Codeforces Beta Round #57 (Div. 2) A题
2013-06-23 12:42
411 查看
这道题目很简单,通过样例就知道什么意思,直接代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char a[105],b[105],c[105];
int i,j;
gets(a);
gets(b);
int len;
len=strlen(a);
for(i=0; i<len; i++)
{
if(a[i]==b[i])
{
c[i]='0';
}
else
{
c[i]='1';
}
}
for(i=0; i<len; i++)
cout<<c[i];
cout<<endl;
return 0;
}
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char a[105],b[105],c[105];
int i,j;
gets(a);
gets(b);
int len;
len=strlen(a);
for(i=0; i<len; i++)
{
if(a[i]==b[i])
{
c[i]='0';
}
else
{
c[i]='1';
}
}
for(i=0; i<len; i++)
cout<<c[i];
cout<<endl;
return 0;
}
相关文章推荐
- Codeforces Beta Round #57 (Div. 2) Enemy is weak
- Codeforces Beta Round #75 (Div. 2)---A. Chips
- Codeforces Beta Round #32 (Div. 2) C (math+思维)
- Codeforces Beta Round #75 (Div. 2 Only) A题
- Codeforces Beta Round #92 (Div. 2 Only) B. Permutations 模拟
- Codeforces Beta Round #75 (Div. 1 Only) A题
- Codeforces Beta Round #16 (Div. 2 Only)——C
- Codeforces Beta Round #18 (Div. 2 Only) D - Seller Bob
- Codeforces Beta Round #69 (Div. 1 Only) C. Beavermuncher-0xFF 树上贪心
- Codeforces Beta Round #80 (Div. 2 Only)
- Codeforces Beta Round #34 (Div. 2) C. Page Numbers
- Codeforces Beta Round #92 (Div. 1 Only)
- Codeforces Beta Round #18 (Div. 2 Only)——A
- Codeforces Beta Round #27 (Codeforces format, Div. 2) E. Number With The Given Amount Of Divisors 反素数
- Codeforces Beta Round #99 (Div. 1) C Mushroom Gnomes - 2(单点查询)
- Codeforces Beta Round #87 (Div. 2 Only) A题
- Codeforces Beta Round #6 (Div. 2 Only) A. Triangle 水题
- Codeforces Beta Round #44 (Div. 2)——B
- Codeforces Beta Round #73 (Div. 2 Only)——A,B,C
- Codeforces Beta Round #34 (Div. 2) A题 B题 C题(水水~)