1173B - Nauuo and Chess - CodeForces Solution


constructive algorithms greedy *1100

Please click on ads to support us..

Python Code:

n = int(input())
m = n // 2 + 1
print(m)
for i in range(0, n):
    a1 = i // 2
    a2 = i - a1
    assert a1 < m and a2 < m
    assert a1 + a2 == i
    print(f"{a1+1} {a2+1}")

C++ Code:

#include <bits/stdc++.h>

using namespace std;

// debug macros
#ifndef ONLINE_JUDGE
    #define printv(v) cerr << #v << ": ";for(auto x : v) cerr << x << ' '; cerr << '\n';
    #define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
    template<typename ...Args>
    void logger(string vars, Args&&... values) {
        cerr << vars << " = ";
        string delim = "";
        (..., (cerr << delim << values, delim = ", "));
        cerr << '\n';
    }
#else
    #define printv(v) 0
    #define deb(...) 0
#endif

// shortcuts
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define endl '\n'
#define pb push_back
#define fr first
#define sc second
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sz(v) (int)(v).size()
#define TEST int t;cin>>t;while(t--)

typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int,int> mii;
typedef set<int> si;
typedef set<char> sc;

void setPrec() { cout << fixed << setprecision(16); }
void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    setPrec();
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

int main() {
    setIO();
    int n; cin >> n;
    cout << 1+(n/2) << endl;
    int x=1,y=1;
    for(int i = 1 ; i <= n ; i++){
        cout << x << " " << y << endl;
        if(i&1) x++;
        else y++;
    }

  return 0;
}


Comments

Submit
0 Comments
More Questions

1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List
1219. Path with Maximum Gold
1268. Search Suggestions System
841. Keys and Rooms