Pagini recente » Cod sursa (job #1925830) | Cod sursa (job #1024921) | Cod sursa (job #1125066) | Cod sursa (job #49937) | Cod sursa (job #728097)
Cod sursa(job #728097)
#include<cstdio>
#include<math.h>
using namespace std;
unsigned long long n,l,c,a[30],b[30],d[30],x[30],s,k;
int main()
{
freopen("shop.in","r",stdin);
freopen("shop.out","w",stdout);
unsigned long long i,j;
scanf("%d%d%d",&n,&c,&l);
for(i=0;i<n;i++)
{
scanf("%d%d",&a[i],&b[i]);
d[i]=i;
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
unsigned long long aux=a[i];
a[i]=a[j];
a[j]=aux;
aux=b[i];
b[i]=b[j];
b[j]=aux;
aux=d[i];
d[i]=d[j];
d[j]=aux;
}
i=n-1;
while(s<l && i>=0)
{
unsigned long long p=0;
while(s+pow(c,a[i])<=l && b[i])
{
s+=(unsigned long long)pow(c,a[i]);
b[i]--;
k++;
p++;
}
x[d[i]]=p;
i--;
}
if(s==l)
printf("%d\n",k);
for(i=0;i<n;i++)
printf("%d ",x[i]);
printf("\n");
return 0;
}