Cod sursa(job #2242385)
| Utilizator | Data | 18 septembrie 2018 17:05:54 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <cstdio>
//sursa scrisa pe telefon:))
int main() {
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
int n;
long long k;
scanf("%d%lld", &n, &k);
int pos = n;
while (1LL * pos * (pos - 1) / 2 >= k)
pos--;
pos++;
for (int i = 1; i <= n - pos; i++)
printf("%d ", i);
int middle = n + k - pos * (pos - 1) / 2;
printf("%d ", middle);
for (int i = n; i > n - pos; i--)
if (i != middle)
printf("%d ", i);
return 0;
}
