Cod sursa(job #1105244)
Utilizator | Data | 11 februarie 2014 17:10:36 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main(void){
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n,k,i,p,x;
fin>>n>>k;
for(p=1;(p*(p-1))/2<k;++p);
k-=p*(p-1)/2; x=n+k; p=n-p;
for(i=1;i<=p;++i)fout<<i<<' ';
fout<<x<<' ';
for(i=n;i>p;--i)if(i!=x)fout<<i<<' ';
return 0;
}