蓝桥杯算法提高VIP-计算器-题解（C语言代码）

解题思路:

注意事项:

参考代码:

import java.util.Scanner;

public class Main {

static int[][] n=new int[2][2];

public static void main(String[] args) {

Scanner scanner=new Scanner(System.in);

int m=scanner.nextInt();

String str1=scanner.next();

String str2=scanner.next();

String[] str= {"1111110","0000110","1011011","1001111","0100111",

"1101101","1111101","1000110","1111111","1101111"};

int count=0;

while(m!=0) {

m--;

int a=str1.charAt(m)-'0';

int b=str2.charAt(m)-'0';

for(int i=0;i<7;i++) {

if(str[a].charAt(i)!=str[b].charAt(i))

count++;

}

}

System.out.println(count);

}

}