Pagini recente » Cod sursa (job #471748) | Cod sursa (job #2005373) | Cod sursa (job #2421776) | Cod sursa (job #746281) | Cod sursa (job #3150960)
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
const int nmax = 100005;
long long n, k;
int a[nmax];
int main(){
f >> n >> k;
long long m = 0;
while(m * (m - 1) / 2 < k){
m++;
}
long long val = m * (m - 1) / 2 - k;
for(int i = 1; i <= n - m; i++){
g << i << ' ';
}
g << n - val << ' ';
for(int i = n; i >= n - m; i--){
if(i != n - val){
g << i << ' ';
}
}
}