# Long Challenge

Appy and Chef are participating in a contest. There are NN problems in this contest; each problem has a unique problem code between 11 and NN inclusive. Appy and Chef decided to split the problems to solve between them β Appy should solve the problems whose problem codes are divisible by AA but not divisible by BB, and Chef should solve the problems whose problem codes are divisible by BB but not divisible by AA (they decided to not solve the problems whose codes are divisible by both AA and BB).

To win, it is necessary to solve at least KK problems. You have to tell Appy whether they are going to win or lose.

CODE:

#include<stdio.h>

int main(){
int i,n,a,b,k,c = 0;
printf(βEnter the numbers\nβ);
scanf("%d %d %d %d",&n,&a,&b,&k);

``````for(i=1;i<=n;i++){

if(i%a == 0 || i%b == 0 && !(i%a == 0 && i%b == 0))
c++;
}
//printf("%d\n",c_a);
//printf("%d\n",c_b);
//printf("%d\n",c_ab);
//printf("%d\n",c_a+c_b-c_ab);

if(c >= k)
printf("\nWin");
else
printf("\nLose");
``````

}