Submission #249490

#TimeUsernameProblemLanguageResultExecution timeMemory
249490VimmerUzastopni (COCI17_uzastopni)C++14
24 / 80
383 ms38712 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #pragma GCC optimize("unroll-loops") #pragma GCC optimize("-O3") #pragma GCC optimize("Ofast") //#pragma GCC optimize("fast-math") //#pragma GCC optimize("no-stack-protector") #define F first #define S second #define sz(x) int(x.size()) #define pb push_back #define pf push_front #define N 100010 #define M ll(1e9 + 7) #define inf 1e9 + 1e9 using namespace std; //using namespace __gnu_pbds; typedef long double ld; typedef long long ll; typedef short int si; typedef array <int, 6> a6; //typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; ll sum, kol, cur; set <ll> se; int main() { //freopen("input.txt", "r", stdin); freopen("output4.txt", "w", stdout); ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n; cin >> n; vector <pair <ll, ll> > ans; ans.clear(); ll sg = sqrt(n); for (ll i = 2; i <= sg; i++) for (ll start = max(1ll, n / i - 10); start <= min(n, n / i + 10); start++) { if (se.find(start) != se.end()) continue; se.insert(start); ll l = 2, r = n; while (l < r) { ll md = (l + r) / 2; if (start * md + (md * (md - 1)) / 2 < n) l = md + 1; else r = md; } if (start * l + (l * (l - 1)) / 2 == n) ans.pb({start, start + l - 1}); } for (auto it : ans) cout << it.F << " " << it.S << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...