Submission #593232

#TimeUsernameProblemLanguageResultExecution timeMemory
593232nguyen31hoang08minh2003Uzastopni (COCI17_uzastopni)C++14
80 / 80
1 ms320 KiB
/* +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | |/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \| | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | |/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \| +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ |\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /| | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | |\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /| | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | |/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \| | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | |/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \| +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ |\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /| | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | |\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /| | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | +----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+ */ #include <bits/stdc++.h> #define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i) #define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i) #define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i) #define fi first #define se second #define pb push_back #define sz(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() using namespace std; using ll = long long; using ld = long double; template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;}; template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;}; typedef unsigned long long ull; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<vi> vvi; typedef vector<vii> vvii; ll n; /* (r - l + 1)(l + r) = 2 * n r - l + 1 = x l + r = y 2 * r + 1 = x + y r = (x + y - 1) / 2 l = y - r */ int main() { ll m; #ifdef LOCAL freopen("input.INP", "r", stdin); #endif // LOCAL cin.tie(0) -> sync_with_stdio(0); cout.tie(0); cin >> n; m = n << 1; for (ll x = 1, y, l, r; x * x <= m; ++x) { if (m % x) continue; y = m / x; r = x + y - 1; if (r < 0 || (r & 1)) continue; r >>= 1; l = y - r; if (0 < l && l < r) cout << l << ' ' << r << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...