Pagini recente » Cod sursa (job #3144308) | Clasament dedicatie_speciala | Cod sursa (job #2661077) | Cod sursa (job #2206701) | Cod sursa (job #3132723)
#include<iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n, k, a , b , i, ind;
int main() {
f >> n >> k;
while(b * (b + 1) / 2 < k)
b++;
for(i = 1; i <= n - 1 - b; i++)
g << i << " ";
a = b * (b + 1) / 2 - k;
g << n - a << " ";
ind = n;
while(i <= ind ) {
if(ind == n - a){
ind --;
continue;
}
g << ind << " ";
ind--;
}
return 0;
}