Pagini recente » Cod sursa (job #678623) | Cod sursa (job #475717) | Cod sursa (job #879068) | Cod sursa (job #275239) | Cod sursa (job #3359397)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main() {
long long n, k;
fin >> n >> k;
long long t = 1;
while (t <= n){
long long rest = n - t;
if (rest * (rest - 1) / 2 >= k){
fout << t << ' ';
t++;
}
else{
break;
}
}
long long rest = n - t;
long long maxim = rest * (rest - 1) / 2;
long long q = k - maxim;
fout << t + q << ' ';
for (long long i = n; i >= t; i--){
if (i != t + q){
fout << i << ' ';
}
}
fout << '\n';
return 0;
}