FOJ--1733--Image Distortion--解题报告

http://acm.fzu.edu.cn/problem.php?pid=1733
In the process of transmission, data loss may occur, resulting in image distortion and so on. To simplify the problem, we consider an image whose pixel is a single bit (0 or 1), and then the bit errors could be: 1 to 0 or 0 to 1.
You should calculate the total bit errors in the process of transmission.
Input

There are multiple test cases. For each test case, the first line contains two integers N and M (2≤N,M≤100), indicating the size of the image. The next N lines, each line contains M characters, these N*M characters indicate the image before transmission. The next N lines, each line contains M characters, these N*M characters indicate the image after transmission. The character is either 0 or 1.

Output

For each test case, output an integer indicating the total bit errors in the process of transmission.

Sample Input
7 7
0000000
0111110
0101010
0111110
0101010
0111110
0000000
0000000
0110110
0111010
0110110
0101010
0111110
0000000

Sample output
3

分析：其实题目意思可以理解成就是前N行一个数组和后N行一个数组，求它们在相同位置出现不一样的数字（0或1）的个数

代码如下：

#include <stdio.h> int main() { int n,m,i,j,sum; char a[100][101],b; while (scanf("%d%d",&n,&m)!=EOF) { sum=0; for(i=0;i<n;i++) scanf("%s",a[i]); getchar(); for(i=0;i<n;i++) { for(j=0;j<m;j++) { scanf("%c",&b); if(a[i][j]!=b) sum++; } getchar(); } printf("%d/n",sum); } return 0; }