oj.uz

Submission #839070

# Submission time Handle Problem Language Result Execution time Memory
839070 2023-08-28T14:59:55 Z fanwen Subway (info1cup19_subway) C++17
0 / 100
 0 ms 212 KB 
/**
 *      author : pham van sam 
 *      created : 28 August 2023 (Monday)
 **/

#include <bits/stdc++.h>

using namespace std;

#define int long long

void you_make_it(void) {
    int k, n = 1; cin >> k;
    for (int i = 1; 1LL * i * (i + 1) <= 2LL * k; ++i) {
    	n = i;
    }
    int diff = k - 1LL * n * (n + 1) / 2;
    cout << n + 1 + (diff > 0) << '\n';
	for (int i = 0; i <= n; ++i) {
		cout << i << " " << i - 1 << '\n';
	}
    if(diff > 0) {
    	cout << n + 1 << " " << diff  - 1 << '\n';
    }
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB wrong number of pairs
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB wrong number of pairs
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB wrong number of pairs
2 Halted 0 ms 0 KB -