Pagini recente » Cod sursa (job #1500306) | Cod sursa (job #786753) | Cod sursa (job #3201004) | Cod sursa (job #2790916) | Cod sursa (job #1389191)
#include <cstdio>
int n,c;
int b[45];
int p[45];
int fol[45];
int arr[31];
long long l;
void desc(long long nr)
{
int p,put=0;
for(p=1;;p*=c)
{
if(p*c>nr)
{
break;
}
put++;
}
while(nr!=0)
{
if(nr>=p)
{
while(nr>=p)
{
nr-=p;
b[put]++;
}
}
put--;
if(put<0) break;
p/=c;
}
}
int main()
{
FILE *fin;
fin=fopen ("shop.in","r");
freopen ("shop.out","w",stdout);
fscanf(fin,"%d%d%lld",&n,&c,&l);
int a,bx;
for(int i=1;i<=n;i++)
{
fscanf(fin,"%d%d",&arr[i],&bx);
p[arr[i]]=bx;
}
desc(l);
for(int i=32;i>=0;i--)
{
if(b[i]!=0)
{
if(b[i]>=p[i])
{
b[i]-=p[i];
fol[i]+=p[i];
}
else
{
fol[i]=b[i];
b[i]=0;
}
if(i!=0) b[i-1]+=c*b[i];
}
}
long long sum=0;
for(int i=0;i<=32;i++) sum+=fol[i];
printf("%lld\n",sum);
for(int i=1;i<=n;i++)
{
printf("%d ",fol[arr[i]]);
}
fclose(fin);
}