hdu2897 邂逅明下------找规律

邂逅明下Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 968    Accepted Submission(s): 458


Problem DescriptionInputOutputSample InputSample OutputSourceRecommend#include<iostream>#include<cstdlib>#include<stdio.h>#include<memory.h>using namespace std;int n,p,q;int main(){ int n,p,q; while(scanf("%d%d%d",&n,&p,&q)!=EOF) { int xx=n%(p+q); if(xx==0) puts("WIN"); else if(xx<=p) puts("LOST"); else puts("WIN"); }}