# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3464 | BothEarRim | Great Pow! (kriii1_G) | C++98 | 0 ms | 1672 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <cstdlib>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <list>
#include <string>
#include <sstream>
#include <cstring>
#include <ctime>
#include <set>
#include <cstdio>
#include <stack>
#include <climits>
#include <functional>
#include <locale>
using namespace std;
#define LL long long
#define LD long double
#define FOR(i, l) for(int i = 0; i < l; i++)
#define pb push_back
#define SWAP(a, b), {int temp = a; a = b; b = temp;}
#define parsestr(from, findtar) substr(from, distance(in.begin()+from, find(in.begin()+from, in.end(), findtar)))
#define PI acos(0.0) * 2.0
#define undefined -1
#define MOD 2552
#define MAXSIZE (1<<15)+1
int main(){
int a, k;scanf("%d %d", &a, &k);
if(k == 0) printf("%d\n", a);
else printf("1\n");
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |