Codeforces Round #469 (Div. 2)

寒假回来简直废柴一只。。。

两道水题  告诉记几别瞎想！！！

A. Left-handers, Right-handers and Ambidexters

#include <iostream>
using namespace std;
int main()
{
    int x,y,z;
    while(cin>>x>>y>>z)
    {
        int c=min(x,y);
        int ans;
        if(abs(x-y)>=z)
        {
            ans=(c+z)*2;
        }
        else
        {
             z-=abs(x-y);
              ans=2*(z/2)+2*max(x,y);
        }
        cout<<ans<<endl;
    }
    return 0;
}

B. Intercepted Message

#include <iostream>
#include <iostream>
using namespace std;
const int maxn=1e5;
int tt[maxn],xx[maxn];
int main()
{
    int x,y,z;
    while(cin>>x>>y)
    {
       for(int i=0;i<x;i++)
           cin>>tt[i];
       for(int i=0;i<y;i++)
          cin>>xx[i];
       int i=0,j=0,ans=0;
       long long s1=tt[0],s2=xx[0];
     while(i<x&&j<y)
     {
         if(s1==s2)
         {
             ans++;
             i++;
             j++;
             s1+=tt[i];
             s2+=xx[j];
         }
         else if(s1>s2)
         {
             j++;
             s2+=xx[j];
         }
         else
         {
             i++;
             s1+=tt[i];
         }
     }
     cout<<ans<<endl;
    }
    return 0;
}