Cod sursa(job #1472841)
Utilizator | Data | 17 august 2015 21:00:53 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int N, X, Y, i, nr;
long long K;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d%lld", &N, &K);
for (X = 0; X * (X + 1)/2 < K; X++ );
for (i = 1; i <= N - X - 1; ++i)
printf("%d ", i);
Y = N - (X * (X + 1)) / 2 + K;
printf("%d ", Y);
for( i = N; i >= N - X; --i)
if(i != Y)
printf("%i ", i);
}