# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667227 | divad | Subway (info1cup19_subway) | C++14 | 7 ms | 724 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>
#define int long long
using namespace std;
int k;
int gauss(int n){
return n*(n+1)/2;
}
signed main()
{
cin >> k;
int ans = 0, st = 1, dr = 45000;
/// 1 1 1 1 1 0 0 0 0 0 0
/// ^
while(st <= dr){
int mid = (st+dr)/2;
if(gauss(mid) <= k){
ans = mid;
st = mid+1;
}else{
dr = mid-1;
}
}
int rest = k-gauss(ans);
int cnt = 1+ans+(rest > 0);
cout << ans+1+(rest > 0) << "\n";
cout << "0 -1\n";
for(int i = 1; i <= ans; i++){
cout << i << " " << i-1 << "\n";
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |