Pagini recente » Cod sursa (job #3137066) | Cod sursa (job #1561680) | Cod sursa (job #431731) | Cod sursa (job #3259519) | Cod sursa (job #676570)
Cod sursa(job #676570)
#include <cstdio>
using namespace std;
int main()
{
freopen("farfurii.in", "r", stdin);
long long n, k, p;
int i,taken, mustAdd;
scanf("%lld %lld\n", &n, &k);
fclose(stdin);
freopen("farfurii.out", "w", stdout);
for(i = 1; i <= n; i++)
{
p = n - i;
if(p * (p - 1) / 2 < k)
{
mustAdd = k - p * (p - 1) / 2 + i;
printf("%d ", mustAdd);
break;
}
printf("%d ", i);
}
p = n - i + 1;
for(i = 0; i < p; i++)
{
if(n - i != mustAdd)
{
printf("%d ", n - i);
}
}
fclose(stdout);
return 0;
}