# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
3566 |
2013-08-31T06:37:21 Z |
blmarket |
Great Pow! (kriii1_G) |
C++ |
|
0 ms |
1672 KB |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <numeric>
#include <iterator>
#include <queue>
#include <set>
#include <map>
#include <vector>
#define mp make_pair
#define pb push_back
#define sqr(x) ((x)*(x))
#define foreach(it,c) for(typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
template<typename T> int size(const T &a) { return a.size(); }
int main(void)
{
int a,k;
cin >> a >> k;
if((k&1) == 0) {
cout << a << endl;
return 0;
}
cout << 1 << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1672 KB |
Output is correct |
2 |
Incorrect |
0 ms |
1672 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |