Submission #168107

#TimeUsernameProblemLanguageResultExecution timeMemory
168107sansUzastopni (COCI17_uzastopni)C++14
0 / 80
4 ms380 KiB
#include <iostream> #include <numeric> #include <cmath> #include <algorithm> #include <vector> using namespace std; #define sp ' ' #define st first #define nd second #define pb push_back #define mp make_pair #define forn(YY, yy) for(long long int yy = 0; yy < YY; ++yy) #define prn(XX) cout << XX << endl #define prs(XX) cout << XX << " " typedef long long int ll; typedef unsigned long long int ull; typedef vector<ll> vll; typedef vector<vector<ll>> vvll; typedef pair<ll, ll> pll; typedef vector<pll> vpll; const int MOD = 1e9 + 7; const int INF = 2e9 + 13; const int mINF = -2e9 - 13; const double PI = 3.14159265358979; const double EPS = 1e-9; int main(int argc, char **argv){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ll N; cin >> N; ll gk = 0; for(int i = 1; i <= 500000; ++i){ gk += i; if(gk >= N) break; if((N-gk)%(i+1) == 0){ cout << N-gk << sp << i+1 << endl; cout << (N-gk)/(i+1) << sp << (N-gk)/(i+1) + (i) << endl; } } return 0; } //cikisir
#Verdict Execution timeMemoryGrader output
Fetching results...