# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
721274 | 2023-04-10T15:34:17 Z | vjudge1 | Uzastopni (COCI17_uzastopni) | C++17 | 58 ms | 65536 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ll n; cin >> n; ll k = n/2+1; if(k >= 1e8){ for(int i = 0; i <= 1e8; i++){ for(int j = 0; j <= 1e8; j++){ } } } vector<ll> table; table.push_back(1); ll pos = 0; for(ll i = 2; i <= k; i++){ if(table.back() == n){ cout << 1 <<" "<< i-1 <<"\n"; } if(table.back() > n){ pos = i; } table.push_back((i*(i+1))/2); } for(ll i = pos; i < table.size(); i++){ if(binary_search(table.begin(), table.end(), table[i]-n)){ cout << lower_bound(table.begin(), table.end(), table[i]-n)-table.begin()+2 <<" "<< i+1 <<"\n"; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Incorrect | 1 ms | 856 KB | Output isn't correct |
5 | Incorrect | 1 ms | 1492 KB | Output isn't correct |
6 | Incorrect | 8 ms | 8648 KB | Output isn't correct |
7 | Runtime error | 51 ms | 65536 KB | Execution killed with signal 9 |
8 | Runtime error | 51 ms | 65536 KB | Execution killed with signal 9 |
9 | Runtime error | 58 ms | 65536 KB | Execution killed with signal 9 |
10 | Runtime error | 53 ms | 65536 KB | Execution killed with signal 9 |