Submission #1091538


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int main(){
  int odd = 0;
  int n;
  scanf("%d",&n);
  REP(i,n){
    int x;
    scanf("%d",&x);
    if(x%2==1)odd++;
  }
  puts(odd%2==0?"YES":"NO");
  return 0;
}

Submission Info

Submission Time
Task A - Addition
User rickytheta
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1046 Byte
Status AC
Exec Time 14 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:37:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:40:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&x);
                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 14
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt
Case Name Status Exec Time Memory
in1.txt AC 14 ms 256 KB
in10.txt AC 14 ms 256 KB
in11.txt AC 3 ms 256 KB
in12.txt AC 3 ms 256 KB
in2.txt AC 14 ms 256 KB
in3.txt AC 14 ms 256 KB
in4.txt AC 14 ms 256 KB
in5.txt AC 14 ms 256 KB
in6.txt AC 14 ms 256 KB
in7.txt AC 14 ms 256 KB
in8.txt AC 14 ms 256 KB
in9.txt AC 14 ms 256 KB
sample1.txt AC 3 ms 256 KB
sample2.txt AC 3 ms 256 KB