제출 #1316995

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1316995		muhammad-mutahir	Subway (info1cup19_subway)	C++20	100 / 100	33 ms	844 KiB

subway

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n;
    int l =0 ;
    int r = 1e9;
    while(r-l>1){
    	int mid = (l+r)/2;
    	if(mid*(mid+1)/2 <= n){
    		l = mid;
    	}
    	else{
    		r = mid;
    	}
    	
    }
    n-=l*(l+1)/2;
    cout<<l+ 1 +(n!=0) <<endl;
    cout<<0<<" "<<-1<<endl;
    for(int i = 0;i<l;i++){
    	cout<<i+1<<" "<<i<<endl;
    }
    if(n!=0)cout<<l+1<<" "<< n-1<<endl;




}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50