Cod sursa(job #1060668)
Utilizator | Data | 18 decembrie 2013 13:09:25 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long N, K, aux, aux2;
int main()
{
f>>N>>K; aux=N;
while ( aux*(aux-1)/2>=K )
--aux; ++aux;
for (int i=1; i<=N-aux; ++i)
g<<i<<' ';
aux2=aux*(aux-1)/2-K;
g<<N-aux2<<' ';
for (int i=N; i>N-aux; --i)
if (i!=N-aux2) g<<i<<' ';
return 0;
}