Pagini recente » Cod sursa (job #2322206) | Cod sursa (job #3004595) | Cod sursa (job #1013690) | Cod sursa (job #2975268) | Cod sursa (job #880701)
Cod sursa(job #880701)
#include <fstream>
using namespace std;
int main()
{
long n,k,i,m,p;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f>>n>>k;
for(p=1;p<n;p*=2)
{
for(m=0;p>0;p/=2)
{
if(m+p<=n&&(m+p)*(m+p-1)<=2*k) m+=p;
}
}
k-=m*(m-1)/2;
if(!k)
{
for(i=1;i<=n-m;i++) g<<i<<" ";
for(i=n;i>n-m;i--) g<<i<<" ";
g<<'\n';
}
else
{
k=m-k;
m++;
for(i=1;i<=n-m;i++)
{
g<<i<<" ";
}
g<<n-k<<" ";
for(i=n;i>n-k;i--) g<<i<<" ";
for(i=n-k-1;i>n-m;i--) g<<i<<" ";
g<<'\n';
}
return 0;
}