Cod sursa(job #1883857)
| Utilizator | Data | 18 februarie 2017 11:39:25 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long unsigned N, K, i, M, val, s;
int main()
{
fin>>N>>K;
fin.close();
M = 2; s = 1;
while (s < K)
{
s = s + M;
M++;
}
for (i = 1; i <= N-M; i++)
fout<<i<<" ";
val = N-(s-K);
fout<<val<<" ";
for (i = N; i >= val+1; i--)
fout<<i<<" ";
for (i = val-1; i >= N-M+1; i--)
fout<<i<<" ";
fout.close();
return 0;
}
