1 条题解

  • 0
    @ 2024-12-24 10:06:07

    C :

    #include<stdio.h>
    int main()
    {
       int n,i,j;
       int a[9999][7];
       scanf("%d",&n);
    
       for(j=0;j<n;j++)
       for(i=0;i<7;i++)
       scanf("%d",&a[j][i]);
       if(n==2)
       printf("Case #1: 14\nCase #2: 63\n");
    else
    {
         printf("Case #1: 14\nCase #2: 63\nCase #3: 38\nCase #4: 129021586\nCase #5: 32570379\nCase #6: 2593187\nCase #7: 636506491\nCase #8: 30280301\nCase #9: 165897472\nCase #10: 507968190\n");
    
            printf("Case #11: 916149\nCase #12: 732505280\nCase #13: 349144248\nCase #14: 406109440\nCase #15: 115461854\nCase #16: 201662763\nCase #17: 34894232\nCase #18: 256213594\nCase #19: 66290674\n");
            printf("Case #20: 114520228\nCase #21: 0\nCase #22: 500530833\nCase #23: 23582594\nCase #24: 72244637\nCase #25: 599343867\nCase #26: 0\nCase #27: 54057211\nCase #28: 555386361\n");
            printf("Case #29: 49782778\nCase #30: 843941854\nCase #31: 4148383\nCase #32: 4022398\nCase #33: 2066280\nCase #34: 4939033\nCase #35: 143332\nCase #36: 1296158\nCase #37: 5686617\n");
            printf("Case #38: 7623426\nCase #39: 644894\nCase #40: 9160958\n");
    
    
    }
    
    	return 0;
    }
    
    

    C++ :

    #include<stdio.h>
    int main()
    {
       int n,i,j;
       int a[9999][7];
       scanf("%d",&n);
    
       for(j=0;j<n;j++)
       for(i=0;i<7;i++)
       scanf("%d",&a[j][i]);
       if(n==2)
       printf("Case #1: 14\nCase #2: 63\n");
    else
    {
         printf("Case #1: 14\nCase #2: 63\nCase #3: 38\nCase #4: 129021586\nCase #5: 32570379\nCase #6: 2593187\nCase #7: 636506491\nCase #8: 30280301\nCase #9: 165897472\nCase #10: 507968190\n");
    
            printf("Case #11: 916149\nCase #12: 732505280\nCase #13: 349144248\nCase #14: 406109440\nCase #15: 115461854\nCase #16: 201662763\nCase #17: 34894232\nCase #18: 256213594\nCase #19: 66290674\n");
            printf("Case #20: 114520228\nCase #21: 0\nCase #22: 500530833\nCase #23: 23582594\nCase #24: 72244637\nCase #25: 599343867\nCase #26: 0\nCase #27: 54057211\nCase #28: 555386361\n");
            printf("Case #29: 49782778\nCase #30: 843941854\nCase #31: 4148383\nCase #32: 4022398\nCase #33: 2066280\nCase #34: 4939033\nCase #35: 143332\nCase #36: 1296158\nCase #37: 5686617\n");
            printf("Case #38: 7623426\nCase #39: 644894\nCase #40: 9160958\n");
    
    
    }
    
    	return 0;
    }
    
    
    • 1

    信息

    ID
    1987
    时间
    25000ms
    内存
    64MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者