Cod sursa(job #3150955)
Utilizator | Tanislav Luca Andrei Pescarus | Data | 19 septembrie 2023 10:30:56 |
---|---|---|---|
Problema | Farfurii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#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 << ' ';
}
}
}