Cod sursa(job #2902910)
Utilizator | Data | 16 mai 2022 22:16:54 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("farfurii.in");
ofstream fout("farfurii.out");
long long n, k;
int main()
{
fin>>n>>k;
int lg = 1;
while(lg*(lg+1)/2 <= k)
lg++;
for(int i = 1; i <= n-lg - 1; i++)
fout<<i<<' ';
int comp = lg * (lg+1) / 2 - k;
fout<<n - comp << ' ';
for(int i = n; i >= n - lg; i--)
if(i != n - comp)
fout<<i<<' ';
return 0;
}