Pagini recente » Cod sursa (job #3125195) | Cod sursa (job #297398) | Cod sursa (job #2141847) | Cod sursa (job #1201191) | Cod sursa (job #3243453)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k, i, per;
bool fr[100002];
int main() {
//ios_base::sync_with_stdio(false);
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n >> k;
per = n * (n - 1) / 2;
i = 1;
while(per > k) {
if(per - (n - i) >= k) {
per -= (n - i);
fout << i << " ";
fr[i] = true;
}
else {
long long nr = n - (per - k);
fout << nr << " ";
fr[nr] = true;
break;
}
i++;
}
for(i = n; i >= 1; i--) {
if(!fr[i]) fout << i << " ";
}
return 0;
}