# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
249917 | 2020-07-16T12:37:16 Z | NONAME | Uzastopni (COCI17_uzastopni) | C++14 | 11 ms | 384 KB |
#include <bits/stdc++.h> #define dbg(x) cerr << #x << " = " << x << "\n" #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie() using namespace std; using ll = long long; using ld = long double; ll sm(ll x) { return (x * (x + 1)) / 2; } int main() { fast_io; ll n, ans = 0; cin >> n; for (int i = 2; sm(i) <= n; ++i) { ll l = 1, r = sqrt(n) + 10; while (l < r) { ll md = (l + r) >> 1; if (sm(md + i - 1) - sm(md - 1) < n) l = md + 1; else r = md; } if ((sm(l + i - 1) - sm(l - 1)) == n) cout << l << " " << l + i - 1 << "\n"; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Output isn't correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Incorrect | 0 ms | 384 KB | Output isn't correct |
4 | Incorrect | 0 ms | 384 KB | Output isn't correct |
5 | Incorrect | 1 ms | 384 KB | Output isn't correct |
6 | Incorrect | 0 ms | 384 KB | Output isn't correct |
7 | Incorrect | 1 ms | 384 KB | Output isn't correct |
8 | Incorrect | 1 ms | 384 KB | Output isn't correct |
9 | Incorrect | 3 ms | 384 KB | Output isn't correct |
10 | Incorrect | 11 ms | 384 KB | Output isn't correct |