Submission #7089333
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<cmath> #define rep(i,n) for(int (i)=0;(i)<(n);(i)++) using namespace std; int func(int count, int N, int NG[], int i) { if (N - NG[i] % 3 == 0 || N - NG[i] % 3 == 2) { count = (N-NG[i]) / 3 + 1; N = NG[i] - 1; return N; } else if (N - NG[i] % 3 == 1) { count = (N-NG[i]) / 3 + 1; N = NG[i] - 2; return N; } } int main() { int N = 0; cin >> N; int NG[3]; cin >> NG[0] >> NG[1] >> NG[2]; int count = 0; if ((N - NG[2]) % 3 == 0 || (N - NG[2]) % 3 == 2) { count = (N-NG[2]) / 3 + 1 + count; N = NG[2] - 1; } else if ((N - NG[2]) % 3 == 1) { count = (N-NG[2]) / 3 + 1 + count; N = NG[2] - 2; } if ((N - NG[1]) % 3 == 0 || (N - NG[1]) % 3 == 2) { count = (N-NG[1]) / 3 + 1 + count; N = NG[1] - 1; } else if ((N - NG[1]) % 3 == 1) { count = (N-NG[1]) / 3 + 1 + count; N = NG[1] - 2; } if ((N - NG[0]) % 3 == 0 || (N - NG[0]) % 3 == 2) { count = (N-NG[0]) / 3 + 1 + count; N = NG[0] - 1; } else if ((N - NG[0]) % 3 == 1) { count = (N-NG[0]) / 3 + 1 + count; N = NG[0] - 2; } count = count + N / 3; if (count > 99) { cout << "NO" << endl; } else { cout << "YES" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 123引き算 |
User | moopu |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1263 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | sample_01.txt, sample_02.txt, sample_03.txt, test_143_142_141_140.txt, test_1_1_2_3.txt, test_1_2_3_4.txt, test_200_200_2_3.txt, test_231_77_78_80.txt, test_235_124_126_125.txt, test_253_45_47_48.txt, test_297_223_224_225.txt, test_297_294_292_290.txt, test_297_297_30_83.txt, test_297_3_43_72.txt, test_298_125_123_124.txt, test_298_293_295_291.txt, test_298_298_4_8.txt, test_298_36_72_98.txt, test_298_55_3_43.txt, test_298_92_91_295.txt, test_299_200_151_65.txt, test_299_240_35_154.txt, test_299_300_299_298.txt, test_299_33_242_151.txt, test_299_56_57_58.txt, test_299_66_132_198.txt, test_300_271_44_68.txt, test_300_299_298_296.txt, test_300_30_99_183.txt, test_300_4_5_6.txt, test_84_34_64_36.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
test_143_142_141_140.txt | WA | 1 ms | 256 KB |
test_1_1_2_3.txt | WA | 1 ms | 256 KB |
test_1_2_3_4.txt | AC | 1 ms | 256 KB |
test_200_200_2_3.txt | WA | 1 ms | 256 KB |
test_231_77_78_80.txt | AC | 1 ms | 256 KB |
test_235_124_126_125.txt | WA | 1 ms | 256 KB |
test_253_45_47_48.txt | AC | 1 ms | 256 KB |
test_297_223_224_225.txt | AC | 1 ms | 256 KB |
test_297_294_292_290.txt | AC | 1 ms | 256 KB |
test_297_297_30_83.txt | WA | 1 ms | 256 KB |
test_297_3_43_72.txt | AC | 1 ms | 256 KB |
test_298_125_123_124.txt | AC | 1 ms | 256 KB |
test_298_293_295_291.txt | AC | 1 ms | 256 KB |
test_298_298_4_8.txt | AC | 1 ms | 256 KB |
test_298_36_72_98.txt | AC | 1 ms | 256 KB |
test_298_55_3_43.txt | WA | 1 ms | 256 KB |
test_298_92_91_295.txt | WA | 1 ms | 256 KB |
test_299_200_151_65.txt | WA | 1 ms | 256 KB |
test_299_240_35_154.txt | WA | 1 ms | 256 KB |
test_299_300_299_298.txt | AC | 1 ms | 256 KB |
test_299_33_242_151.txt | AC | 1 ms | 256 KB |
test_299_56_57_58.txt | AC | 1 ms | 256 KB |
test_299_66_132_198.txt | AC | 1 ms | 256 KB |
test_300_271_44_68.txt | WA | 1 ms | 256 KB |
test_300_299_298_296.txt | WA | 1 ms | 256 KB |
test_300_30_99_183.txt | AC | 1 ms | 256 KB |
test_300_4_5_6.txt | AC | 1 ms | 256 KB |
test_84_34_64_36.txt | AC | 1 ms | 256 KB |