Submission #154678


Source Code Expand

// compile with "g++ XXX.cc -mno-cygwin -O2" in Cygwin

#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>
#include<bitset>
#include<cassert>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define FOR3(i,a,b) for(int i=a,i##_end=b;i<i##_end;i++)
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define CLS(x,val) memset((x) , val , sizeof(x)) 
typedef long long ll_t;
typedef long double ld_t;
typedef vector<int> VI; 
typedef vector<VI> VVI;
typedef complex<int> xy_t;

template<typename T> void debug(T v , string delimiter = "\n")
{ for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++) cout << *it << delimiter; cout << flush ;}

int dx[]  = {0,1,0,-1};
int dy[]  = {1,0,-1,0};
string ds = "SENW";

const double PI = 4.0*atan(1.0);

int main() {
  
  int N;
  cin>>N;
  puts(N%3==0?"YES":"NO");
  return 0 ;
}

Submission Info

Submission Time
Task A - 世界のFizzBuzz
User EmK
Language C++ (G++ 4.6.4)
Score 100
Code Size 1307 Byte
Status AC
Exec Time 26 ms
Memory 924 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 9
Set Name Test Cases
All test_1.txt, test_2.txt, test_3.txt, test_4.txt, test_5.txt, test_6.txt, test_7.txt, test_8.txt, test_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 22 ms 916 KB
sample_02.txt AC 24 ms 920 KB
sample_03.txt AC 23 ms 860 KB
test_1.txt AC 23 ms 884 KB
test_2.txt AC 23 ms 924 KB
test_3.txt AC 24 ms 876 KB
test_4.txt AC 23 ms 924 KB
test_5.txt AC 23 ms 856 KB
test_6.txt AC 22 ms 916 KB
test_7.txt AC 22 ms 924 KB
test_8.txt AC 23 ms 912 KB
test_9.txt AC 26 ms 920 KB