Submission #976993

#TimeUsernameProblemLanguageResultExecution timeMemory
976993batsukh2006Nadan (COCI18_nadan)C++17
50 / 50
1 ms848 KiB
#include<iostream> #include<stdio.h> #include<math.h> #include<map> #include<string> #include<algorithm> #include<vector> #include<string.h> #include<utility> #include<set> #include<cmath> #include<queue> #include<deque> #include<functional> #include<stack> #include<limits.h> #include<iomanip> #include<unordered_map> #include<numeric> #include<tuple> #include<bitset> using namespace std; #define MOD 1000000000 #define int long long #define ff first #define ss second #define endl '\n' void solve(){ int k,n; cin>>k>>n; if(n==1){ cout<<k; }else{ int sum=0; for(int i=1; i<n; i++){ sum+=i; cout<<i<<' '; } cout<<k-sum; } } signed main(){ // freopen("file.in", "r", stdin); // freopen("file.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1; // cin>>t; while(t--){ solve(); cout<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...