首先对前17位数字加权求和,权重分配为:{7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};然后将计算的和对11取模得到值Z;最后按照以下关系对应Z值与校验码M的值:
Z:0 1 2 3 4 5 6 7 8 9 10
M:1 0 X 9 8 7 6 5 4 3 2
现在给定一些身份证号码,请你验证校验码的有效性,并输出有问题的号码。
输入格式:
输入第一行给出正整数N(≤100)是输入的身份证号码的个数。随后N行,每行给出1个18位身份证号码。
输出格式:
按照输入的顺序每行输出1个有问题的身份证号码。这里并不检验前17位是否合理,只检查前17位是否全为数字且最后1位校验码计算准确。如果所有号码都正常,则输出All passed。
输入样例1:
4
320124198808240056
12010X198901011234
110108196711301866
37070419881216001X
输出样例1:
12010X198901011234
110108196711301866
37070419881216001X
输入样例2:
2
320124198808240056
110108196711301862
输出样例2:
All passed
这题比较简单,定义两个数组,分别为1-17位权重,和加权求取模和后,对应的校验码
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
int n = sti(bf.readLine());
ArrayList<String> r = new ArrayList<String>();
for (int i = 0; i < n; i++) {
String tem = bf.readLine();
if (check(tem)) {
r.add(tem);
}
}
if (r.size() == 0) {
out.print("All passed");
} else {
for (int i = 0; i < r.size(); i++) {
out.println(r.get(i));
}
}
out.flush();
}
static int[] w = new int[] { 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2 };
static char[] l = new char[] { '1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2' };
static boolean check(String num) {
char[] n = num.toCharArray();
int sum = 0;
for (int i = 0; i < 17; i++) {
sum += (n[i] - '0') * w[i];
}
sum %= 11;
return l[sum] != n[17];
}
static int sti(String a) {
return Integer.parseInt(a);
}
static int[] stii(String a) {
String[] ra = a.split(" ");
int[] r = new int[ra.length];
for (int i = 0; i < r.length; i++) {
r[i] = sti(ra[i]);
}
return r;
}
}