Cod sursa(job #2904319)
Utilizator | Data | 17 mai 2022 23:12:32 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream o("farfurii.out");
long long n, k, i;
int main()
{
f>>n>>k;
int x = 1;
for (x; x*(x+1) <= 2*k; ++x){continue;}
for(i=1; i < n-x; i++)
o<<i<<" ";
int y = n-(x*(x+1)/2-k);
o<<y<<" ";
for(i=n; i >= n-x; i--)
if(i != y)
o<<i<<" ";
return 0;
}