The Magic Tower

The Magic Tower
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 0    Accepted Submission(s): 0
Problem Description
Like most of the RPG (role play game), “The Magic Tower” is a game about how a warrior saves the princess.
After killing lots of monsters, the warrior has climbed up the top of the magic tower. There is a boss in front of him. The warrior must kill the boss to save the princess.
Now, the warrior wants you to tell him if he can save the princess.
 
Input
There are several test cases.
For each case, the first line is a character, “W” or “B”, indicating that who begins to attack first, ”W” for warrior and ”B” for boss. They attack each other in turn.
The second line contains three integers, W_HP, W_ATK and W_DEF. (1<=W_HP<=10000, 0<=W_ATK, W_DEF<=65535), indicating warrior’s life point, attack value and defense value.
The third line contains three integers, B_HP, B_ATK and B_DEF. (1<=B_HP<=10000, 0<=B_ATK, B_DEF<=65535), indicating boss’s life point, attack value and defense value.
Note: warrior can make a damage of (W_ATK-B_DEF) to boss if (W_ATK-B_DEF) bigger than zero, otherwise no damage. Also, boss can make a damage of (B_ATK-W_DEF) to warrior if (B_ATK-W_DEF) bigger than zero, otherwise no damage.
 
Output
For each case, if boss’s HP first turns to be smaller or equal than zero, please print ”Warrior wins”. Otherwise, please print “Warrior loses”. If warrior cannot kill the boss forever, please also print ”Warrior loses”.
 
Sample Input

   
   
   
   

    
    
    
    W
100 1000 900
100 1000 900
B
100 1000 900
100 1000 900
   
   
   
   

 
Sample Output

   
   
   
   

    
    
    
    Warrior wins
Warrior loses
   
   
   
   
   
   
   
   


   
   
   
   
   
   
   
   

    
    
    
    AC:
   
   
   
   
   
   
   
   

    
    
    
    
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int a,b,c,a1,b1,c1;
    char s;
    int l,k;
    while(cin>>s>>a>>b>>c>>a1>>b1>>c1)
    {
        
        l=b-c1;k=b1-c;
        if(s=='W'){
            while(1){
                if(l<=0){
                    printf("Warrior loses
");
                    break;
                }
                else {
                    a1=a1-l;
                    if(a1<=0){
                        printf("Warrior wins
");
                        break;
                    }
                    a=a-k;
                    if(a<=0){
                        printf("Warrior loses
");
                        break;
                    }
                }
            }
        }
        else{
            while(1){
                if(l<=0){
                    printf("Warrior loses
");
                    break;
                }
                else {
                    a=a-k;
                    if(a<=0){
                        printf("Warrior loses
");
                        break;
                    }
                    a1=a1-l;
                    if(a1<=0){
                        printf("Warrior wins
");
                        break;
                    }
                }
            }
        }
    }
    return 0;
}