Submission #4309699


Source Code Expand

#include<stdio.h>
int num[6];
int ans;
int main(){
	for(int i=1;i<=5;i++)scanf("%d",&num[i]);
	ans=num[5];
	while(num[4]>0){
		ans++;num[4]--;
		num[1]-=61;
	}
	while(num[3]>0){
		ans++;num[3]--;
		if(num[2]>=7){
			num[2]-=7;
			num[1]-=42;
		}
		else{
			num[1]-=(98-num[2]*8);
			num[2]=0;
		}
	}
	while(num[2]>0){
		ans++;
		if(num[2]>=8){
			num[2]-=8;
			num[1]-=61;
		}
		else{
			num[1]-=(125-num[2]*8);
			num[2]=0;
		}
	}
	while(num[1]>0){
		ans++;
		num[1]-=125;
	}
	printf("%d\n",ans);
}

Submission Info

Submission Time
Task D - 5キューブ
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 0
Code Size 536 Byte
Status WA
Exec Time 977 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:5:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=5;i++)scanf("%d",&num[i]);
                                          ^

Judge Result

Set Name All
Score / Max Score 0 / 75
Status
AC × 40
WA × 23
Set Name Test Cases
All case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt, case_043.txt, case_044.txt, case_045.txt, case_046.txt, case_047.txt, case_048.txt, case_049.txt, case_050.txt, case_051.txt, case_052.txt, case_053.txt, case_054.txt, case_055.txt, case_056.txt, case_057.txt, case_058.txt, case_059.txt, case_060.txt, case_061.txt, case_062.txt
Case Name Status Exec Time Memory
case_000.txt AC 1 ms 128 KB
case_001.txt AC 1 ms 128 KB
case_002.txt WA 976 ms 128 KB
case_003.txt WA 977 ms 128 KB
case_004.txt AC 975 ms 128 KB
case_005.txt WA 974 ms 128 KB
case_006.txt AC 1 ms 128 KB
case_007.txt AC 1 ms 128 KB
case_008.txt AC 1 ms 128 KB
case_009.txt AC 1 ms 128 KB
case_010.txt AC 1 ms 128 KB
case_011.txt AC 1 ms 128 KB
case_012.txt WA 64 ms 128 KB
case_013.txt WA 125 ms 128 KB
case_014.txt AC 25 ms 128 KB
case_015.txt AC 108 ms 128 KB
case_016.txt AC 78 ms 128 KB
case_017.txt WA 125 ms 128 KB
case_018.txt AC 27 ms 128 KB
case_019.txt WA 118 ms 128 KB
case_020.txt WA 75 ms 128 KB
case_021.txt WA 112 ms 128 KB
case_022.txt WA 125 ms 128 KB
case_023.txt AC 5 ms 128 KB
case_024.txt AC 99 ms 128 KB
case_025.txt WA 62 ms 128 KB
case_026.txt WA 72 ms 128 KB
case_027.txt AC 18 ms 128 KB
case_028.txt AC 90 ms 128 KB
case_029.txt WA 58 ms 128 KB
case_030.txt WA 61 ms 128 KB
case_031.txt WA 47 ms 128 KB
case_032.txt AC 72 ms 128 KB
case_033.txt AC 15 ms 128 KB
case_034.txt AC 108 ms 128 KB
case_035.txt AC 74 ms 128 KB
case_036.txt AC 104 ms 128 KB
case_037.txt AC 94 ms 128 KB
case_038.txt AC 21 ms 128 KB
case_039.txt WA 124 ms 128 KB
case_040.txt AC 82 ms 128 KB
case_041.txt AC 87 ms 128 KB
case_042.txt WA 122 ms 128 KB
case_043.txt AC 14 ms 128 KB
case_044.txt AC 96 ms 128 KB
case_045.txt AC 27 ms 128 KB
case_046.txt WA 61 ms 128 KB
case_047.txt AC 22 ms 128 KB
case_048.txt WA 70 ms 128 KB
case_049.txt AC 42 ms 128 KB
case_050.txt AC 24 ms 128 KB
case_051.txt AC 96 ms 128 KB
case_052.txt AC 100 ms 128 KB
case_053.txt AC 38 ms 128 KB
case_054.txt AC 102 ms 128 KB
case_055.txt WA 52 ms 128 KB
case_056.txt AC 75 ms 128 KB
case_057.txt AC 46 ms 128 KB
case_058.txt WA 68 ms 128 KB
case_059.txt WA 118 ms 128 KB
case_060.txt AC 95 ms 128 KB
case_061.txt AC 20 ms 128 KB
case_062.txt WA 114 ms 128 KB