Cod sursa(job #2224754)
| Utilizator | Data | 24 iulie 2018 23:03:49 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream>
#include<iostream>
using namespace std;
int main() {
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long N, K, i;
fin >> N >> K;
fin.close();
for (i = 1; i <= N && (N - i)*(N - i - 1) / 2 >= K; i++) {
fout << i << " ";
}
int pozCrit = i, shift, partea2 = N-1;
shift = K - (N - pozCrit)*(N - pozCrit -1) / 2;
fout << N - shift << " ";
for (int j = N; j >= pozCrit; j--) {
if (j != N - shift)
fout << j << " ";
}
fout.close();
return 0;
}