# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
144852 | 2019-08-17T22:27:15 Z | tincamatei | Nadan (COCI18_nadan) | C++14 | 2 ms | 380 KB |
#include <bits/stdc++.h> using namespace std; int main() { int K, N; scanf("%d%d", &K, &N); for(int i = 1; i < N; ++i) printf("%d\n", i); printf("%lld\n", K - ((long long)N * (N - 1) / 2)); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 380 KB | Output is correct |
8 | Correct | 2 ms | 256 KB | Output is correct |
9 | Correct | 2 ms | 252 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |