Pagini recente » Cod sursa (job #2684935) | Cod sursa (job #1397707) | Cod sursa (job #422014) | Cod sursa (job #1501016) | Cod sursa (job #2903319)
#include <bits/stdc++.h>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
long long n,k, inv, i;
int main()
{
in>>n>>k;
inv=1;
while((inv*(inv-1))>>1<k)
inv++;
for(i=1; i<=n-inv; i++)
out<<i<<" ";
int val=inv*(inv-1)/2-k;
out<<n-val<<" ";
for(i=n; i>n-val; i--)
out<<i<<" ";
for(i=n-val-1;i>n-inv;i--)
out<<i<<" ";
return 0;
}