Algorithm
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has two strings a and b of the same length n. The strings consist only of lucky digits. Petya can perform operations of two types:
- replace any one digit from string a by its opposite (i.e., replace 4 by 7 and 7 by 4);
- swap any pair of digits in string a.
Petya is interested in the minimum number of operations that are needed to make string a equal to string b. Help him with the task.
The first and the second line contains strings a and b, correspondingly. Strings a and b have equal lengths and contain only lucky digits. The strings are not empty, their length does not exceed 105.
Print on the single line the single number — the minimum number of operations needed to convert string a into string b.
47
74
1
774
744
1
777
444
3
In the first sample it is enough simply to swap the first and the second digit.
In the second sample we should replace the second digit with its opposite.
In the third number we should replace all three digits with their opposites.
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <cstdio>
#include <iostream>
int main(){
std::string a, b;
getline(std::cin, a);
getline(std::cin, b);
long ftos(0), stof(0);
for(int k = 0; k < a.size(); k++){
if(a[k] == '4' && b[k] == '7'){++ftos;}
else if(a[k] == '7' && b[k] == '4'){++stof;}
}
printf("%ld\n", (ftos > stof) ? ftos : stof);
return 0;
}Input
74
Output
Demonstration
Codeforces Solution-A. Lucky Conversion-Solution in C, C++, Java, Python