OJ 56之Hamming Distance
来源:互联网 发布:seo常用工具 编辑:程序博客网 时间:2024/04/27 19:36
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using
namespace
std;
int
main()
{
int
n;
char
str1[100],str2[100];
while
(
scanf
(
"%s"
,str1)!=EOF)
{
int
sum=0;
if
(str1[0]==
'X'
)
break
;
scanf
(
"%s"
,str2);
int
i;
n=
strlen
(str1);
for
(i=0;i<n;i++)
{
if
(str1[i]!=str2[i])
sum++;
}
printf
(
"Hamming distance is %d.\n"
,sum);
}
return
0;
}
读懂题目才是关键...就是找两个数中的不同....
0 0
- OJ 56之Hamming Distance
- OJ,Hamming Distance
- LeetCode之Hamming Distance
- LeetCode之Hamming Distance
- LeetCode之Hamming Distance
- Hamming Distance
- hamming distance
- hamming distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming distance
- Hamming Distance
- Hamming Distance
- 博客收藏
- Android调用系统功能、apk安装卸载
- Swift Nullability and Objective-C
- Linux网络编程:原始套接字的魔力【上】
- 字符串哈希函数
- OJ 56之Hamming Distance
- 解压rpm包
- Ruby 中的$LOAD_PATH,Require,Load,Include和Extend介绍
- 引用类型 与 基本包装类型
- OJ 66之日期计算
- Documentation-Date and Time Programming Guide:About Dates and Times
- oracle 存储过程异常处理
- 架构师面试题参考
- IOS应用程序生命周期(前后台切换,应用的各种状态)详解