codeforces298c

link:http://codeforces.com/problemset/problem/298/C

这道题目可以看出来我智商确实拙计

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <cmath>
 #include <cctype>
 #include <algorithm>
 #include <queue>
 #include <deque>
 #include <queue>
 #include <list>
 #include <map>
 #include <set>
 #include <vector>
 #include <utility>
 #include <functional>
 #include <fstream>
 #include <iomanip>
 #include <sstream>
 #include <numeric>
 #include <cassert>
 #include <ctime>
 #include <iterator>
 const int INF = 0x3f3f3f3f;
 const int dir[][] = {{-,},{,},{,-},{,},{-,-},{-,},{,-},{,}};
 using namespace std;
 char a[],b[];
 int main(void)
 {
     scanf("%s%s",a,b);
     int lena=strlen(a),lenb=strlen(b),cnt1=,cnt2=;
     for(int i=;i<lena;++i) if(a[i]=='') cnt1++;
     for(int i=;i<lenb;++i) if(b[i]=='') cnt2++;
     bool flag=true;
     if(cnt1%==) cnt1++;
     if(cnt1<cnt2) flag=false;
     if(flag) printf("YES\n"); else printf("NO\n");

     return ;
 }

拙计o(╯□╰)o