Pagini recente » Cod sursa (job #1563908) | Borderou de evaluare (job #1570682) | Cod sursa (job #2931522) | Cod sursa (job #675221) | Cod sursa (job #3144697)
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int n, k;
int v[100001];
bool Verif(int m)
{
int x=n, s=0;
while(x>0)
{
s+=m;
if(s>k)
{
return 0;
}
m--;
x--;
}
return 1;
}
int main()
{
in>>n>>k;
int st=1, dr=n, mijl, r;
while(st<=dr)
{
mijl=(st+dr)/2;
if(Verif(mijl)==0)//mijl e prea mare
{
dr=mijl-1;
}
else
{
r=mijl;
st=mijl+1;
}
}
//out<<r<<endl;
int cop=r, con=n, cnt=n-r-1;
while(k>0)
{
v[n-cop]=con;
k-=cop;
cop--;
con--;
if(cop==1 && k>1)
{
while(k>1)
{
cop=2;
v[cnt]=con;
con--;
cnt--;
k-=2;
}
cop=1;
}
}
for(int i=1; i<=cnt; i++)
{
v[i]=i;
}
v[n]=cnt+1;
for(int i=1; i<=n; i++)
{
out<<v[i]<<" ";
}
}