csuoj 1396: Erase Securely

http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1396

1396: Erase Securely

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 102  Solved: 60
[Submit][Status][Web Board]

Description

Input

Output

Sample Input

1
10001110101000001111010100001110
01110001010111110000101011110001

Sample Output

Deletion succeeded

HINT

 

 

Source

 

分析；
就是01互换，然后对比两个串的异同。

 

AC代码：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<iostream>
#include<stack>
#include<map>
#include<string>
using namespace std;
char ch1[1050], ch2[1050];
int main(){
    int n;
    while(~scanf("%d", &n)){
        scanf("%s%s", ch1, ch2);
        int l = strlen(ch1);
        if(n%2 == 1)
            for(int i = 0; i < l; i++)
                if(ch1[i] == '1')
                    ch1[i]--;
                else if(ch1[i] == '0')
                    ch1[i]++;
        if(strcmp(ch1, ch2) == 0)
            printf("Deletion succeeded\n");
        else
            printf("Deletion failed\n");
    }
    return 0;
}