Pagini recente » Cod sursa (job #2858225) | Cod sursa (job #2856330) | Cod sursa (job #701439) | Cod sursa (job #2961888) | Cod sursa (job #2859039)
#include <fstream>
#include <climits>
#include <iostream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,v[800001];
int main()
{
long long i=1,save,ok=1,c,S;
f>>n>>k;
c=n;
while(ok)
{
S=((n-i)*(n-i+1))/2;
if(S>=k)
v[i]=i,i++;
else
{
v[i-1]=i-1+k-S;
save=i-1+k-S;
ok=0;
i--;
}
}
for(int j=1;j<=i;j++) g<<v[j]<<" ";
for(int j=i;j<n;j++)
{
if(c==save)
c--;
g<<c--<<" ";
}
}