Cod sursa(job #1374484)
Utilizator | Data | 5 martie 2015 09:35:31 | |
---|---|---|---|
Problema | Farfurii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
#include<algorithm>
using namespace std;
long long n,k,x,y,i,p;
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f>>n>>k;
while(p*(p+1)<=2*k)
p++;
p--;
x=p*(p+1)/2;
for(i=1;i<p;i++)
g<<i<<" ";
g<<n-x+p+1<<" ";
y=n-x+p+1;
for(i=n;i>=p;i--)
if(i!=y)
g<<i<<" ";
return 0;
}