Pagini recente »
vaslui_cls1112_31.01
|
Istoria paginii runda/dpi_2014/clasament
|
Cod sursă (job #545253)
|
Istoria paginii runda/lasm_26_09_2024_clasa10_11/clasament
|
Cod sursă (job #495226)
Cod sursă (job
#495226)
#include <bits/stdc++.h>
using namespace std;
ifstream fi("lalele.in");
ofstream fo("lalele.out");
char c='\n';
int a[5000010],k=0,d,x,sum,n;
int main ()
{
fi>>n;
while (sum<n)
{
fi>>d>>x;
if (x==0)
{
for (int i=1;i<=d;i++)
{
cout<<"d="<<i<<c;
for (int o=1;o<=k;o++)
{
a[o]+=1;
}
for (int i=1;i<=k;i++)
cout<<a[i]<<" ";
cout<<c<<c;
sort (a,a+k+1);
for (int i=1;i<=k;i++)
cout<<a[i]<<" ";
cout<<c<<c;
//for (int q=k/2+1;q<=k;q++) a[q]=0;
k=k/2;
fo<<a[k+1]<<c;
}
}
else
{
for (int i=1;i<=d;i++)
{
k++;
a[k]=x+d-i;
}
for (int o=1;o<=k-d;o++)
{
a[o]+=d;
}
}
sum+=d;
}
for (int i=1;i<=k;i++)
cout<<a[i]<<" ";
return 0;
}