i am getting WA for the problem https://www.spoj.pl/problems/BYECAKES/
Can someone provide me test cases where the code is failing?
#include<stdio.h>
int main(){
int i,n,j,k,l,m,e,f,s,e1,f1,s1,m1,a[20]={0},req[20]={0},max,flag;
scanf("%d %d %d %d %d %d %d %d",&e,&f,&s,&m,&e1,&f1,&s1,&m1);
while(e!=-1&&f!=-1&&s!=-1&&m!=-1&&e1!=-1&&f1!=-1&&s1!=-1&&m1!=-1){flag=0;
while(1){
if((e%e1==0)&&(e1!=0)&&(e!=0)){
a[0]=e/e1;
flag=1;
}
if((f%f1==0)&&(f1!=0)&&(f!=0)){
a[1]=f/f1;
flag=1;
}
if((s%s1==0)&&(s1!=0)&&(s!=0)){
a[2]=s/s1;flag=1;
}
if((m%m1==0)&&(m1!=0)&&(m!=0)){
a[3]=m/m1;flag=1;
}
if(flag==0)
{
f++;s++;m++;e++;
for(i=0;i<4;i++)
req[i]++;
}
else{
max=a[0];
for(i=1;i<4;i++){
if(a[i]>max)
max=a[i];
}
//printf("max=%d",max);
printf("%d ",e1*max-e+req[0]);
printf("%d ",f1*max-f+req[1]);
printf("%d ",s1*max-s+req[2]);
printf("%d ",m1*max-m+req[3]);
printf("\n");
break;
}
}
for(i=0;i<4;i++)
{req[i]=0;
a[i]=0;}
scanf("%d %d %d %d %d %d %d %d",&e,&f,&s,&m,&e1,&f1,&s1,&m1);
}
}