Pagini recente » Cod sursa (job #2200936) | Cod sursa (job #758952) | Borderou de evaluare (job #431569) | Cod sursa (job #1086598) | Cod sursa (job #3150955)
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
const int nmax = 100005;
int n, k;
int a[nmax];
int main(){
f >> n >> k;
int m = 0;
while(m * (m - 1) / 2 < k){
m++;
}
int 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 << ' ';
}
}
}