Submission #1758803
Source Code Expand
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
using namespace std;
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define p(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1000000001
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;
int dy[8]={1,1,1,0,0,-1,-1,-1};
int dx[8]={-1,0,1,-1,1,-1,0,1};
struct S{
int a,b,c;
};
bool asc(const S& left,const S& right){
return left.c > right.c;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,ng[3];
cin>>N;
rep(i,3)cin>>ng[i];
rep(i,100){
rep(i,3){
if(N-3!=ng[i]){
N-=3;
break;
}
else if(N-2!=ng[i]){
N-=2;
break;
}
else if(N-1!=ng[i]){
N-=1;
break;
}
else {
cout<<"NO"<<endl;
return 0;
}
}
}
if(N<=0)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 123引き算 |
User |
ke_to |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1378 Byte |
Status |
WA |
Exec Time |
2 ms |
Memory |
384 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 |
WA |
1 ms |
256 KB |
test_297_294_292_290.txt |
AC |
1 ms |
256 KB |
test_297_297_30_83.txt |
WA |
2 ms |
384 KB |
test_297_3_43_72.txt |
AC |
1 ms |
256 KB |
test_298_125_123_124.txt |
WA |
1 ms |
256 KB |
test_298_293_295_291.txt |
WA |
1 ms |
256 KB |
test_298_298_4_8.txt |
WA |
1 ms |
256 KB |
test_298_36_72_98.txt |
AC |
1 ms |
256 KB |
test_298_55_3_43.txt |
AC |
1 ms |
256 KB |
test_298_92_91_295.txt |
AC |
1 ms |
256 KB |
test_299_200_151_65.txt |
AC |
1 ms |
256 KB |
test_299_240_35_154.txt |
AC |
1 ms |
256 KB |
test_299_300_299_298.txt |
WA |
1 ms |
256 KB |
test_299_33_242_151.txt |
WA |
1 ms |
256 KB |
test_299_56_57_58.txt |
WA |
1 ms |
256 KB |
test_299_66_132_198.txt |
AC |
1 ms |
256 KB |
test_300_271_44_68.txt |
AC |
1 ms |
256 KB |
test_300_299_298_296.txt |
AC |
1 ms |
256 KB |
test_300_30_99_183.txt |
AC |
1 ms |
256 KB |
test_300_4_5_6.txt |
WA |
1 ms |
256 KB |
test_84_34_64_36.txt |
AC |
1 ms |
256 KB |