Cod sursa(job #3150960)
| Utilizator | Data | 19 septembrie 2023 10:40:34 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#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 << ' ';
}
}
}