Cod sursa(job #1222092)
Utilizator | Data | 22 august 2014 11:23:53 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
#include<algorithm>
using namespace std;
long long n,k,i,p,aux;
int main()
{
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
cin>>n>>k;
for(p=1;(p*p-p)/2<k;++p);
k-=(p*p-p)/2;
for(p=n-p,i=1;i<=p;++i) cout<<i<<' ';
for(cout<<n+k<<' ',i=n;i>p;--i)
if(i!=n+k) cout<<i<<' ';
return 0;
}