Pagini recente » Cod sursa (job #2342577) | Cod sursa (job #1670270) | Borderou de evaluare (job #850864) | Cod sursa (job #2626553) | Cod sursa (job #2281222)
#include <bits/stdc++.h>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int main() {
ios::sync_with_stdio(false); in.tie(0); out.tie(0);
long long n, k; in >> n >> k;
long long m;
for(m = 1; m * (m - 1) < k; ++m);
if(m * (m - 1) == k) {
for(long long i = 1; i <= n - m; ++i) {
out << i << " ";
}
for(long long i = n; i >= n - m - 1; --i) {
out << i << " ";
}
} else {
for(long long i = 1; i < n - m; ++i) {
out << i << " ";
}
stack< long long > s; s.push(n - ((m + 1) * m / 2 - k));
out << n - ((m + 1) * m / 2 - k) << " ";
for(long long i = n; i >= n - m; --i) {
if(i != s.top()) {
out << i << " ";
}
}
}
out << "\n";
in.close(); out.close();
return 0;
}