Cod sursa(job #2880032)
Utilizator | Data | 29 martie 2022 12:56:45 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n;
long long k,m;
int main()
{
fin >> n >> k;
double R=(1+sqrt((long long)(8*k+1)))/2;
m=floor(R);
for(int i=1;i<n-m;i++)
fout << i << " ";
fout << n-(m*(m+1)/2-k) << " ";
for(int i=n;i>=n-m;i--)
{
if(i!=n-(m*(m+1)/2-k)) fout << i << " ";
}
return 0;
}