61A - Ultra-Fast Mathematician Codeforces || Codeforces 61A - Ultra-Fast Mathematician Solution
Problem Name:
61A Ultra-Fast Mathematician
Judge: Codeforces
Problem link: 61A Ultra-Fast Mathematician
Solution on GitHub: 61A Ultra-Fast Mathematician
Codeforces 61A - Ultra-Fast Mathematician Solution in C++/Cpp
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s1, s2;
cin >> s1 >> s2;
int len = s1.length();
string sn[len];
for (int i = 0; i < len; i++)
{
if (s1[i] == s2[i])
{
sn[i] = "0";
}
else
{
sn[i] = "1";
}
}
for (int i = 0; i < len; i++)
{
cout << sn[i];
}
cout << "\n";
return 0;
}
Tags: Codeforces 61A - Ultra-Fast Mathematician solution in C C++, 61A
codeforces solution in C C++, Codeforces 61A solution in C C++, Codeforces
Ultra-Fast Mathematician solution in C C++, 61A - Ultra-Fast Mathematician
Codeforces solution in C C++, Codeforces 61A - Ultra-Fast Mathematician
solution in C C++
