L1-016 查验身份证
一个合法的身份证号码由17位地区、日期编号和顺序编号加1位校验码组成。校验码的计算规则如下:
首先对前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
C语言参考代码:
#include<stdio.h>
int main(){
char M[11]={'1','0','X','9','8','7','6','5','4','3','2'};
char a[100][18],i,j;
int n,flag=1,f=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a[i]);
int sum=0;
sum=(a[i][0]-'0')*7+(a[i][1]-'0')*9+(a[i][2]-'0')*10+(a[i][3]-'0')*5+(a[i][4]-'0')*8+(a[i][5]-'0')*4+(a[i][6]-'0')*2+(a[i][7]-'0')+(a[i][8]-'0')*6+(a[i][9]-'0')*3+(a[i][10]-'0')*7+(a[i][11]-'0')*9+(a[i][12]-'0')*10+(a[i][13]-'0')*5+(a[i][14]-'0')*8+(a[i][15]-'0')*4+(a[i][16]-'0')*2;//{7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2}
int z;
z=sum%11;
if(M[z]!=a[i][17]){
flag=0;
if(f==1)printf("\n");
else f=1;
printf("%s",a[i]);
}
}
if(flag==1)printf("All passed");
return 0;
}
C++参考代码:
#include<bits/stdc++.h>
using namespace std;
int main(){
char M[11]={'1','0','X','9','8','7','6','5','4','3','2'};
string a[100];
int i,j;
int n,flag=1,f=0;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
int sum=0;
sum=(a[i][0]-'0')*7+(a[i][1]-'0')*9+(a[i][2]-'0')*10+(a[i][3]-'0')*5+(a[i][4]-'0')*8+(a[i][5]-'0')*4+(a[i][6]-'0')*2+(a[i][7]-'0')+(a[i][8]-'0')*6+(a[i][9]-'0')*3+(a[i][10]-'0')*7+(a[i][11]-'0')*9+(a[i][12]-'0')*10+(a[i][13]-'0')*5+(a[i][14]-'0')*8+(a[i][15]-'0')*4+(a[i][16]-'0')*2;
int z;
z=sum%11;
if(M[z]!=a[i][17]){
flag=0;
if(f==1)cout<<"\n";
else f=1;
cout<<a[i];
}
}
if(flag==1)cout<<"All passed";
return 0;
}
Python参考代码:
check=['1','0','X','9','8','7','6','5','4','3','2']
power=[7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2]
numbers=[]#身份证号列表
errorNumbers=[]#有错误的身份证号列表
n=int(input())
for i in range(n):
numbers.append(input())
for i in range(n):
flag = 0#用于计算权值和
try:# 检查是否前17位全部为数字,若出现其他情况,则按异常处理
for j in range(17):
flag += int(numbers[i][j]) * power[j]
if check[flag % 11] != numbers[i][17]:
errorNumbers.append(numbers[i])
except:
errorNumbers.append(numbers[i])
if len(errorNumbers)==0:#若全部合格
print("All passed")
else:
for i in range(len(errorNumbers)):
print(errorNumbers[i])
Golang参考代码:
package main
import "fmt"
func main(){
var n int
fmt.Scanf("%d",&n)
var ans []string
weight := []int{7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2} // 用数组来存储权重
std := map[int]string{
0:"1",
1:"0",
2:"X",
3:"9",
4:"8",
5:"7",
6:"6",
7:"5",
8:"4",
9:"3",
10:"2",
}
var str []string
for i:=0;i<n;i++ {
var s string
fmt.Scanf("%s",&s)
str=append(str,s)
}
for _,s := range str {
var flag bool
sum:=0
for index,t := range s {
if index==len(s)-1 {
break
}
if '0'>t||t>'9' {
ans=append(ans,s)
flag=true
break
}
num:=int(t-'0')
sum+=num*weight[index]
}
if flag{
continue
}
stdIndex:=sum%11
stdStr:=string(s[len(s)-1])
if std[stdIndex]!=stdStr{
ans=append(ans,s)
}
}
if len(ans)==0 {
fmt.Printf("All passed")
}else{
for i,s := range ans{
if i==0 {
fmt.Printf(s)
}else{
fmt.Printf("\n"+s)
}
}
}
}