oj.uz

Submission #249494

# Submission time Handle Problem Language Result Execution time Memory
249494 2020-07-15T06:56:57 Z Vimmer Uzastopni (COCI17_uzastopni) C++14
80 / 80
 70 ms 384 KB 
#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;

    for (ll len = 2; len <= 10 * sqrt(n); len++)
    {
        ll l = 1, r = n;

        while (l < r)
        {
            ll md = (l + r) / 2;

            if (md * len + (len * (len - 1)) / 2 < n) l = md + 1; else r = md;
        }

        if (l * len + (len * (len - 1)) / 2 == n) cout << l << " " << l + len - 1 << '\n';
    }
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 24 ms 384 KB Output is correct
10 Correct 70 ms 384 KB Output is correct