POJ2586Y2K Accounting Bug

http://poj.org/problem?id=2586

Description

Accounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc. 
All what they remember is that MS Inc. posted a surplus or a deficit each month of 1999 and each month when MS Inc. posted surplus, the amount of surplus was s and each month when MS Inc. posted deficit, the deficit was d. They do not remember which or how many months posted surplus or deficit. MS Inc., unlike other companies, posts their earnings for each consecutive 5 months during a year. ACM knows that each of these 8 postings reported a deficit but they do not know how much. The chief accountant is almost sure that MS Inc. was about to post surplus for the entire year of 1999. Almost but not quite. 
Write a program, which decides whether MS Inc. suffered a deficit during 1999, or if a surplus for 1999 was possible, what is the maximum amount of surplus that they can post.

Input

Input is a sequence of lines, each containing two positive integers s and d.

Output

For each line of input, output one line containing either a single integer giving the amount of surplus for the entire year, or output Deficit if it is impossible.

Sample Input

59 237
375 743
200000 849694
2500000 8000000

Sample Output

116
28
300612
Deficit

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<cstdlib>
 using namespace std ;
 int main()
 {
     int m,n;
     while(scanf("%d %d",&m,&n)!=EOF)
     {
         int flag =  ,surplus;
         if(*m < n)
         {
             surplus = *m-*n ;
             if(surplus < )
             flag = ;
         }
         else if(*m < *n)
         {
             surplus = *m-*n;
             if(surplus < )
             flag = ;
         }
         else if(*m < *n)
         {
             surplus=*m-*n;
             if(surplus < )
             flag = ;
         }
         else if(m < *n)
         {
             surplus=*m-*n;
             if(surplus < )//一开始加了分号在这里导致WA我竟然没发现。
             flag = ;
         }
         else
          flag = ;
         if(flag == )
         cout<<"Deficit"<<endl ;
         else cout<<surplus<<endl ;
     }
     return  ;
 }

这个时间的话是0MS；挺快的

看着分类在贪心里边，后来发现其实就五种情况，枚举一下也行

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<cstdlib>
 using namespace std ;
 int main()
 {
     int m,n;
     while(scanf("%d %d",&m,&n)!=EOF)
     {
         int flag =  ,surplus;
         if(*m < n)
         {
             surplus = *m-*n ;
         }
         else if(*m < *n)
         {
             surplus = *m-*n;
         }
         else if(*m < *n)
         {
             surplus=*m-*n;
         }
         else if(m < *n)
         {
             surplus=*m-*n;
         }
         else
          surplus = -;
         if(surplus < )
         cout<<"Deficit"<<endl ;
         else cout<<surplus<<endl ;
     }
     return  ;
 }

这个是AIHONGHONG帮我改的一开始我因为不仔细WA了，挺好的这个，时间是30MS

 #include<cstdio>
 #include<cstring>
 using namespace std;
 int main()
 {
     int n,m;
     while(scanf("%d%d",&n,&m)!=EOF){
        int k=,i;
        if(n==&&m==)//不加这个就是16MS
        {
            printf("Deficit");
            continue;
        }
        else if(n==||m==)
        {
            printf("Deficit");
            continue;
        }
        for(i=;i<=;i++)
        {
            if(m*(-i)-n*i>)
            {
              k=i;
            }
            else break;
        }
        if(k==)
        {
            if(*k*n-((-k)*+)*m<)
            printf("Deficit");
            else printf("%d",*k*n-((-k)*+)*m);
        }
        else if(k>)
        {
            if(*k*n+*n-((-k)*)*m<)
            printf("Deficit");
            else printf("%d",*k*n+*n-((-k)*)*m);
        }
        else printf("Deficit");
        printf("\n");
     }
     return ;
 }

还有这个是会神代码

大神的博客http://www.cnblogs.com/justforgl/archive/2012/07/14/2591110.html

http://blog.csdn.net/lyy289065406/article/details/6642603