Submission #370986

#TimeUsernameProblemLanguageResultExecution timeMemory
370986Atill83Uzastopni (COCI17_uzastopni)C++14
72 / 80
2 ms364 KiB
#include <bits/stdc++.h> #define ff first #define ss second #define endl '\n' using namespace std; const long long INF = (long long) 1e18; const int mod = (int) 1e9+7; const int MAXN = (int) 3e5+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); #ifdef Local freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin); freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout); #endif cin>>n; vector<pll> ans; for(ll x = 2; x * x < 2*n; x++){ //cerr<<x<<endl; if(2 * n % x == 0){ ll b = (2 * n + x * (x - 1))/ (2 * x), a = b - x; //cerr<<x<<" "<<a<<" "<<b<<endl; if(0 <= a && a < b) if((b * (b + 1) / 2 - a * (a + 1) / 2 == n)) ans.push_back({a + 1, b}); } } sort(ans.begin(), ans.end()); for(pii u: ans) cout<<u.ff<<" "<<u.ss<<endl; #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
#Verdict Execution timeMemoryGrader output
Fetching results...