Pagini recente » Cod sursa (job #137044) | Cod sursa (job #126025) | Cod sursa (job #1900450) | Cod sursa (job #1888021) | Cod sursa (job #352738)
Cod sursa(job #352738)
#include <cstdio>
#include <math.h>
long n,k,x,p,i;
using namespace std;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%ld%ld",&n,&k);
i=long(sqrt(k));
float delta=1+8*k;
delta=sqrt(delta);
delta=(1+delta)/2;
i=(long)delta+1;
x=i;
p=i*(i-1)/2-k;
for(i=1;i<=n-x;i++)
printf("%ld ",i);
printf("%ld ",n-p);
for(i=n;i>=n-x+1;i--)
if(i!=n-p)
printf("%ld ",i);
return 0;
}