Cod sursa(job #1498343)
Utilizator | Data | 8 octombrie 2015 14:32:35 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, t;
long long k;
int main(){
fin>>n>>k;
int p=1;
while(p*(p-1)/2<=k) ++p;
--p;
t=n-p-p*(p-1)/2+k;
++p;
for(int i=1;i<=n-p;++i) fout<<i<<' ';
fout<<t<<' ';
for(int i=n;i>t;--i) fout<<i<<' ';
for(int i=t-1;i>n-p;--i) fout<<i<<' ';
return 0;
}