Pagini recente » Cod sursa (job #1933682) | Cod sursa (job #1100301) | Cod sursa (job #3166008) | Cod sursa (job #963858) | Cod sursa (job #185485)
Cod sursa(job #185485)
#include <stdio.h>
int N,K;
void read()
{
freopen("farfurii.in", "r",stdin);
freopen("farfurii.out", "w",stdout);
scanf("%d%d", &N,&K);
}
void solve()
{
for(int i=1;i<=K;++i)
{
if(K==i*(i-1)/2)
{
for(int j=1;j<=N-i;++j)
printf("%d ",j);
for(int j=N;j>=N-i+1;--j)
printf("%d ",j);
return;
}
//if(K>i*(i-1)/2)
// break;
}
}
int main()
{
read();
solve();
return 0;
}