# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1000011 |
2024-06-16T13:00:35 Z |
LilPluton |
Nadan (COCI18_nadan) |
C++14 |
|
1000 ms |
65540 KB |
#include <bits/stdc++.h>
// author : Pluton
#define OPT ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int ll
#define ll long long
#define pb push_back
#define arr array
#define fi first
#define se second
#define rep(i,j,k) for(int i = j; i <= k; ++i)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define endll '\n'
using namespace std;
const int INF = 1e18;
struct BIT
{
int n;
vector<int> ft;
void init(int N)
{
n = N + 5;
ft.assign(n + 5, 0);
}
void add(int pos, int val)
{
for (pos = pos + 1; pos <= n; pos += pos & -pos) ft[pos] += val;
}
int get(int pos, int res = 0)
{
for (pos = pos + 1; pos > 0; pos -= pos & -pos) res += ft[pos];
return res;
}
};
void _()
{
int n, k;
cin >> k >> n;
for(int i = 1; i < n; ++i)
cout << i << endll, k -= i;
cout << k << endll;
}
signed main()
{
OPT
int tc = 1;
cin >> tc;
while(tc--)
_();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2571 ms |
65536 KB |
Time limit exceeded |
2 |
Execution timed out |
2604 ms |
65536 KB |
Time limit exceeded |
3 |
Execution timed out |
2556 ms |
65540 KB |
Time limit exceeded |
4 |
Execution timed out |
2596 ms |
65536 KB |
Time limit exceeded |
5 |
Execution timed out |
2640 ms |
65536 KB |
Time limit exceeded |
6 |
Execution timed out |
2637 ms |
65536 KB |
Time limit exceeded |
7 |
Execution timed out |
2629 ms |
65536 KB |
Time limit exceeded |
8 |
Execution timed out |
2630 ms |
65536 KB |
Time limit exceeded |
9 |
Execution timed out |
2685 ms |
65536 KB |
Time limit exceeded |
10 |
Execution timed out |
2628 ms |
65536 KB |
Time limit exceeded |