/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,a[205];
vector<pair<ll,ll>>v;
int32_t main(){
CODE_START;
cin>>n;
v.pb(mp(0,-1));
ll s1=1;
while(n>=1){
ll val=sqrt(n);
if(val*(val+1)/2>n){
val--;
}
for(ll i=1;i<=val;i++)
{
if(i==1){
v.pb(mp(s1,0));
}else {
v.pb(mp(s1,s1-1));
}
s1++;
}
n=n-val*(val+1)/2;
}
cout<<v.size()<<endl;
for(ll i=0;i<v.size();i++)
cout<<v[i].f<<' '<<v[i].s<<endl;
}
Compilation message
subway.cpp: In function 'int32_t main()':
subway.cpp:48:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(ll i=0;i<v.size();i++)
~^~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Partially correct |
5 ms |
384 KB |
Partially correct |
7 |
Partially correct |
5 ms |
384 KB |
Partially correct |
8 |
Partially correct |
4 ms |
384 KB |
Partially correct |
9 |
Partially correct |
5 ms |
384 KB |
Partially correct |
10 |
Partially correct |
5 ms |
384 KB |
Partially correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Partially correct |
5 ms |
384 KB |
Partially correct |
7 |
Partially correct |
5 ms |
384 KB |
Partially correct |
8 |
Partially correct |
4 ms |
384 KB |
Partially correct |
9 |
Partially correct |
5 ms |
384 KB |
Partially correct |
10 |
Partially correct |
5 ms |
384 KB |
Partially correct |
11 |
Partially correct |
10 ms |
1148 KB |
Partially correct |
12 |
Partially correct |
9 ms |
1148 KB |
Partially correct |
13 |
Partially correct |
9 ms |
1148 KB |
Partially correct |
14 |
Partially correct |
9 ms |
1148 KB |
Partially correct |
15 |
Partially correct |
9 ms |
1148 KB |
Partially correct |
16 |
Partially correct |
25 ms |
3432 KB |
Partially correct |
17 |
Partially correct |
5 ms |
512 KB |
Partially correct |
18 |
Partially correct |
25 ms |
3444 KB |
Partially correct |
19 |
Partially correct |
18 ms |
2552 KB |
Partially correct |
20 |
Partially correct |
19 ms |
2552 KB |
Partially correct |