3 条题解

  • 0
    @ 2024-5-7 19:11:06
    #include <stdio.h>
    #include <math.h>
    int main()
    {
        int times,time;
        int n=0,i,j;
        int score[10058][5];
        scanf("%d",&times);
        for(time=1;time<=times;time++)
            scanf("%d%d%d",&score[time][1],&score[time][2],&score[time][3]);
        for(time=1;time<=times;time++)
            score[time][4]=score[time][1]+score[time][2]+score[time][3];
        for(i=1;i<times;i++)
            for(j=i+1;j<=times;j++)
                if(fabs(score[i][1]-score[j][1])<=5&&
                fabs(score[i][2]-score[j][2])<=5&&
                fabs(score[i][3]-score[j][3])<=5&&
                fabs(score[i][4]-score[j][4])<=10)
                n++;
        printf("%d",n);
        return 0;
    }//
    
    • 0
      @ 2023-10-31 19:30:04

      #include<stdio.h> int main() { int n,i=1,a[1000],m,j; scanf("%d",&n); while(1) { if(n%20) { a[i]=n; n=n/2; i++; } else { a[i]=n; n=n*3+1; i++; } if(n1) { a[i]=n; m=i; break; } }

      for(j=m;j>=1;j--)
      {
      	printf("%d ",a[j]);
      }return 0;
      

      }

      • 0
        @ 2023-10-30 20:30:52
        #include <stdio.h>
        int main()
        {
        	int n,c=0,i;
        	int a[1002];
        	scanf("%d",&n);
        	a[c++]=n;
        	while(n!=1)
        	{
        		if(n%2==0)
        		{
        			n=n/2;
        			a[c++]=n;
        		}
        		else{
        			n=n*3+1;
        			a[c++]=n;
        		}
        	}
        	for(i=c-1;i>=0;i--)
        	{
        		printf("%d ",a[i]);
        	}
        	return 0;
        }
        
        • 1

        信息

        ID
        96
        时间
        1000ms
        内存
        256MiB
        难度
        6
        标签
        (无)
        递交数
        1016
        已通过
        322
        上传者