Submission #249482

#TimeUsernameProblemLanguageResultExecution timeMemory
249482VimmerUzastopni (COCI17_uzastopni)C++14
32 / 80
1091 ms384 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; 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 l = 1, r = 0, sum = 0; while (r <= 800000000 && r < n / 3) { while (sum > n) sum -= l++; if (sum == n) ans.pb({l, r}); sum += ++r; } if (n % 2) ans.pb({n / 2, (n + 1) / 2}); if (n / 3 + n / 3 + n / 3 + 3 == n) ans.pb({n / 3, n / 3 + 2}); for (auto it : ans) cout << it.F << " " << it.S << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...