A. Definite Game
https://codeforces.com/problemset/problem/1081/A
2를 제외하고, n - (n-1)이 가능하다.
1 2 3 4 5 6 7 8 9 10 11 12 | #include <bits/stdc++.h> using namespace std; int n; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> n; if (n == 2) cout << 2; else cout << 1; return 0; } | cs |
'Competition > codeforces' 카테고리의 다른 글
Educational Codeforces Round 62 (Rated for Div. 2) C. Playlist (0) | 2019.03.30 |
---|---|
Codeforces Round #524 (Div. 2) B. Margarite and the best present (0) | 2019.03.29 |
Codeforces Round #526 (Div. 2) A. The Fair Nut and Elevator (0) | 2019.03.29 |
Codeforces Round #525 (Div. 2) A. Ehab and another construction problem (0) | 2019.03.29 |
Technocup 2019 - Elimination Round 4 A. Right-Left Cipher (0) | 2019.03.29 |