Codeforces Global Round 1

A. Parity

签.

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 #define N 100010
 5 int b, k, a[N]; 
 6 
 7 int main()
 8 {
 9     while (scanf("%d%d", &b, &k) != EOF)
10     {
11         int res = 0; 
12         for (int i = 1; i <= k; ++i) scanf("%d", a + i);
13         int base = 1; 
14         for (int i = k; i >= 1; --i)
15         {
16             res = (res + a[i] * base % 2) % 2;
17             base = base * b % 2; 
18         }
19         puts(res % 2 ? "odd" : "even");
20     }
21     return 0;
22 }

View Code