Cod sursa(job #1742881)
| Utilizator | Data | 17 august 2016 11:49:04 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream si("farfurii.in");
ofstream so("farfurii.out");
int main()
{
long long n,t,m;
si>>n>>t;
long long i;
m=sqrt(t*2);
for(i=1;i<n-m;++i)
so<<i<<' ';
if(m*(m+1)==t*2)
{
for(i=n;i>=n-m;--i)
so<<i<<' ';
}
else
{
t=n-((m+1)*m/2-t);
so<<t<<' ';
for(i=n;i>t;--i)
so<<i<<' ';
for(i=t-1;i>=n-m;--i)
so<<i<<' ';
}
return 0;
}
