# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
82055 |
2018-10-28T20:44:42 Z |
josiftepe |
Nadan (COCI18_nadan) |
C++14 |
|
97 ms |
7356 KB |
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <fstream>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll inf = (1LL << 60LL);
const int maxn = 1e5 + 10;
int n, k;
int main(int argc, const char * argv[]) {
ios_base::sync_with_stdio(false);
cin >> n >> k;
int sum = 0;
for(int i = 1; i < n; ++i){
sum += i;
cout << i << "\n";
}
cout << k - sum << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
6 |
Incorrect |
4 ms |
612 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
708 KB |
Output isn't correct |
10 |
Incorrect |
97 ms |
7356 KB |
Output isn't correct |