Cod sursa(job #2691888)
Utilizator | Data | 30 decembrie 2020 16:05:40 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n,k,cnt=1;
long long i, nr;
int main()
{
fin >> n >> k;
while(cnt*(cnt+1)/2<=k) cnt++;
for(i=1; i<n-cnt; i++)
fout << i << ' ';
nr=n-(cnt*(cnt+1)/2-k);
fout << nr << ' ';
for( i=n; i>=n-cnt; i--)
{
if(i!=nr) fout << i << ' ';
}
return 0;
}