algorithms

Algorithm implementations
git clone git://git.laack.co/algorithms.git
Log | Files | Refs | README

t1.cpp (651B)


      1 #include <iostream>
      2 #include <string>
      3 
      4 long dist(int idxL, std::string& a, std::string& b) {
      5     long sum = 0;
      6     for(int i = 0; i < a.size() - 1; i+=2) {
      7         if(b[idxL+i] != a[i]) {
      8             sum += 1;
      9         }
     10         if(b[idxL+i+1] != a[i+1]) {
     11             sum += 1;
     12         }
     13     }
     14     if(a.size() % 2 != 0) {
     15         if(a[a.size()-1] != b[idxL+a.size()-1]) {
     16             sum += 1;
     17         }
     18     }
     19     
     20     return sum;
     21 }
     22 
     23 int main() {
     24     std::string a,b;
     25 
     26     std::cin >> a;
     27     std::cin >> b;
     28     long sum = 0;
     29 
     30     for(int x = 0; x <= (b.size() - a.size()); ++x) {
     31         sum += dist(x,a,b);
     32     }
     33     std::cout << sum << std::endl;
     34 }