URAL-1991 The battle near the swamp 水题-白红宇

URAL-1991 The battle near the swamp 水题

阅读量：5105 次

发布时间：2019-06-13

本文共 1924 字，大约阅读时间需要 6 分钟。

　　题目链接：

　　水题。。

1 //STATUS:C++_AC_15MS_333KB 2 #include 
     
       3 #include 
      
        4 #include 
       
         5 //#include 
        
          6 #include 
         
           7 #include 
          
            8 #include 
           
             9 #include 
            
             10 #include 
             
              11 #include 
              
               12 #include 
               
                13 #include 
                
                 14 #include 
                 
                  15 #include 
                  
                   16 #include 
                   
                    17 #include 
                    
                     18 #include 
                     
                      19 #include 
                      
                       20 #include 
                       
                        21 #include 
                        
                         22 #include 
                         23 using namespace std;24 //#pragma comment(linker,"/STACK:102400000,102400000")25 //using namespace __gnu_cxx;26 //define27 #define pii pair
                          
                           28 #define mem(a,b) memset(a,b,sizeof(a))29 #define lson l,mid,rt<<130 #define rson mid+1,r,rt<<1|131 #define PI acos(-1.0)32 //typedef33 typedef __int64 LL;34 typedef unsigned __int64 ULL;35 //const36 const int N=100010;37 const int INF=0x3f3f3f3f;38 const int MOD=95041567,STA=8000010;39 const LL LNF=1LL<<60;40 const double EPS=1e-8;41 const double OO=1e15;42 const int dx[4]={-1,0,1,0};43 const int dy[4]={ 0,1,0,-1};44 const int day[13]={ 0,31,28,31,30,31,30,31,31,30,31,30,31};45 //Daily Use ...46 inline int sign(double x){ return (x>EPS)-(x<-EPS);}47 template
                           
                             T gcd(T a,T b){ return b?gcd(b,a%b):a;}48 template
                            
                              T lcm(T a,T b){ return a/gcd(a,b)*b;}49 template
                             
                               inline T lcm(T a,T b,T d){ return a/d*b;}50 template
                              
                                inline T Min(T a,T b){ return a
                               
                                 inline T Max(T a,T b){ return a>b?a:b;}52 template
                                
                                  inline T Min(T a,T b,T c){ return min(min(a, b),c);}53 template
                                 
                                   inline T Max(T a,T b,T c){ return max(max(a, b),c);}54 template
                                  
                                    inline T Min(T a,T b,T c,T d){ return min(min(a, b),min(c,d));}55 template
                                   
                                     inline T Max(T a,T b,T c,T d){ return max(max(a, b),max(c,d));}56 //End57 58 int n,m;59 60 int main()61 {62 // freopen("in.txt","r",stdin);63 int i,j,a,ans1,ans2;64 while(~scanf("%d%d",&n,&m))65 {66 ans1=ans2=0;67 for(i=0;i
                                    
                                     m)ans1+=a-m;70 else ans2+=m-a;71 }72 73 printf("%d %d\n",ans1,ans2);74 }75 return 0;76 }