Cod sursa(job #996452)
Utilizator | Data | 11 septembrie 2013 22:25:03 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long N,K;
void Solve()
{
long long current=N;
while(current*(current-1)/2>=K)
current--;
current++;
for(long long i=1;i<=N-current;i++)
g<<i<<" ";
long long number=current*(current-1)/2-K;
g<<N-number<<" ";
for(long long i=N;i>N-current;i--)
{
if(i!=N-number)
g<<i<<" ";
}
}
int main()
{
f>>N>>K;
Solve();
g<<"\n";
return 0;
}