제출 #3583

#제출 시각아이디문제언어결과실행 시간메모리
3583blmarketGreat Pow! (kriii1_G)C++98
1 / 1
0 ms1672 KiB
#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 == 0) {
        cout << a << endl;
        return 0;
    }

    if((a&1) == 0) {
        cout << 1 << endl;
        return 0;
    }
    cout << a << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...