Cod sursa(job #1235863)
Utilizator | FMI - Petcu Ion Cristian jean | Data | 30 septembrie 2014 20:07:23 |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<cstdio>
using namespace std;
long long N, K, i, p, q;
int main() {
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%lld %lld", &N, &K);
p = 1;
while ( (N-p) * (N-p-1) / 2 >= K ) { printf("%lld ", p); p++; }
N = N - p + 1;
q = K - (N-1)*(N-2) / 2 + 1;
printf("%lld ", q + p - 1);
for (i = N ; i > 0 ; i--)
if (i != q) printf("%lld ", i + p - 1);
return 0;
}