Pagini recente » Cod sursa (job #1340257) | Cod sursa (job #2304397) | Cod sursa (job #1590533) | Cod sursa (job #1631676) | Cod sursa (job #126734)
Cod sursa(job #126734)
#include <stdio.h>
#include <math.h>
long long n, s, k;
long i, t, j;
int main()
{
freopen("farfurii.in","rt",stdin);
freopen("farfurii.out","wt",stdout);
scanf("%lld%lld", &n, &k);
for(i = 1; i <= n; ++i) {
s = (n - i) * (n - i - 1) / 2;
if (s >= k) {
printf("%ld ",i);
continue;
} else {
t = k - s + i;
printf("%ld ",t);
for (j = n; j > t; --j) {
printf("%ld ",j);
}
for (j = t - 1; j >= i; --j) {
printf("%ld ", j);
}
return 0;
}
}
return 0;
}