oj.uz

Submission #361978

# Submission time Handle Problem Language Result Execution time Memory
361978 2021-02-01T13:45:45 Z israeladewuyi Nadan (COCI18_nadan) C++17
50 / 50
 1 ms 364 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<pair<int,int>> vp;

#define int ll
#define PB push_back
#define pb pop_back
#define in insert 
#define endl "\n"
#define MP make_pair
#define f first
#define Trav(a,x) for(auto &a: x)
#define	sort(x) sort(x.begin(),x.end());
const int MOD  = 998244353;
const int maxn = 1e5+1;

int a,b,c,d,k,n,m,s,x,y,ans;

int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin>>k>>n;
	for(int i = 1; i < n; i++){
		cout<<i<<endl;
		k-=i;
	}
	cout<<k;
	return 0;
}

Compilation message

nadan.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
nadan.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct