Submission #7079424
Source Code Expand
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/numeric/interval.hpp>
#include <boost/numeric/interval/io.hpp>
#include <boost/any.hpp>
using namespace::std;
namespace mp = boost::multiprecision;
typedef mp::number<mp::cpp_dec_float<32,int64_t>> cfloat;
typedef mp::cpp_int cint;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
typedef vector<pair<lint,lint>> pvec;
typedef vector<vector<pair<lint,lint>>> pmat;
typedef vector<vector<vector<pair<lint,lint>>>> pmat3;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irep1(i) for(lint i = 1;; i++)
#define irep2(i) for(lint i = 2;; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
#define PI 3.141592653589793
#define cout (cout<<fixed<<setprecision(15))
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"")<<i;f=1;}cout<<"\n";}while(0)
#define output2(v) for(auto i:v)output(i);
#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define sum(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF 9223372036854775807
#define MOD 1000000007
vector<lint> dx={-1,1,0,0,1,1,-1,-1};
vector<lint> dy={0,0,-1,1,1,-1,1,-1};
inline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}
inline lint lcm(lint a,lint b){return a*b/gcd(a,b);}
lint binary_search(function<bool(lint)> func) {
lint left = -1;
lint right =IINF;
while (right - left > 1) {
lint mid = left + (right - left) / 2;
if (func(mid)) right = mid;
else left = mid;
}
return right;
}
int main(){
lint n,a,b,c;
cin>>n>>a>>b>>c;
rep(i,100)rrepi(j,1,4){
if(n-j<0)continue;
if(n-j!=a&&n-j!=b&&n-j!=c){
n-=j;
break;
}
}
if(n==0)cout<<"YES\n";
else cout<<"NO\n";
}
Submission Info
Submission Time |
|
Task |
C - 123引き算 |
User |
hotman78 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2604 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 |
AC |
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 |
AC |
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 |
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 |
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 |
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 |
AC |
1 ms |
256 KB |
test_84_34_64_36.txt |
AC |
1 ms |
256 KB |