Pagini recente » Cod sursa (job #814825) | Cod sursa (job #129947) | Cod sursa (job #1352658) | Cod sursa (job #725238) | Cod sursa (job #2225141)
#include<fstream>
#include<iostream>
using namespace std;
void problema() {
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;
shift = K - (N - pozCrit)*(N - pozCrit - 1) / 2;
fout << pozCrit + shift << " ";
for (int j = N; j >= pozCrit; j--) {
if (j != pozCrit+shift)
fout << j << " ";
}
fout.close();
}