Pagini recente » Cod sursa (job #2382165) | Cod sursa (job #2682854) | Cod sursa (job #150138) | Cod sursa (job #1878765) | Cod sursa (job #2300744)
#include <fstream>
using namespace std;
ifstream cin ("farfurii.in");
ofstream cout ("farfurii.out");
int main(){
int n; cin >> n;
long long k; cin >> k;
int i = 0;
for(i++; i <= n && 1LL * (n - i) * (n - i - 1) / 2 >= k; i++)
cout << i << ' ';
k -= (1LL * (n - i) * (n - i - 1) / 2);
cout << i + (int)k << ' ';
for(int j = n; j >= i; j--){
if (j == i + (int)k) continue;
cout << j << ' ';
}
return 0;
}