Submission #45043

#TimeUsernameProblemLanguageResultExecution timeMemory
45043XellosUzastopni (COCI17_uzastopni)C++14
80 / 80
4 ms756 KiB
#include <bits/stdc++.h> // iostream is too mainstream #include <cstdio> // bitch please #include <iostream> #include <algorithm> #include <cstdlib> #include <vector> #include <set> #include <map> #include <queue> #include <stack> #include <list> #include <cmath> #include <iomanip> #include <time.h> #define dibs reserve #define OVER9000 1234567890 #define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++) #define tisic 47 #define soclose 1e-8 #define chocolate win // so much chocolate #define patkan 9 #define ff first #define ss second #define abs(x) ((x < 0)?-(x):x) #define uint unsigned int #define dbl long double #define pi 3.14159265358979323846 using namespace std; // mylittledoge #ifdef DONLINE_JUDGE // palindromic tree is better than splay tree! #define lld I64d #endif int main() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); long long N; cin >> N; for(int i =1; i <= 200000; i++) if((2*N)%i == 0) { long long x =2*N/i+1-i; if(i > 1 && x > 0 && x%2 == 0) cout << x/2 << " " << x/2+i-1 << "\n"; if(1LL*i*i >= 2*N) break; x =i+1-(2*N)/i; if(2*N/i > 1 && x > 0 && x%2 == 0) cout << x/2 << " " << x/2+(2*N)/i-1 << "\n"; } } // look at my code // my code is amazing
#Verdict Execution timeMemoryGrader output
Fetching results...