Cod sursa(job #1576788)
| Utilizator | Data | 22 ianuarie 2016 20:37:18 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
# include <bits/stdc++.h>
using namespace std;
long long n, k, i, j;
int main ()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%lld %lld", &n, &k);
long long Lmax = 1LL* n * (n - 1) / 2, nr = 0LL;
bool OK;
for (i = 1; i <= n && !OK; ++i) {
nr += n - i;
if (k <= Lmax - nr) printf("%lld ", i);
else {
printf("%lld ", i + k - (Lmax - nr));
for (j = n; j >= i; --j)
if (j != i + k - (Lmax - nr)) printf("%lld ", j);
OK = true;
}
}
printf("\n");
return 0;
}
