1031 查验身份证(15 分)
一个合法的身份证号码由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
参考代码:(我发现我总是把问题复杂化。。要反省一下了,这么繁重冗长的代码,太难看了)
#include<iostream>
#include<string>
#include<vector>
using namespace std;
void calculate(int &sum,int j,char x)
{
switch(j)
{
case 0:
sum = sum + 7 * (x-'0');
break;
case 1:
sum = sum + 9 * (x -'0');
break;
case 2:
sum = sum + 10 * (x - '0');
break;
case 3:
sum = sum + 5 * (x - '0');
break;
case 4:
sum = sum + 8 * (x - '0');
break;
case 5:
sum = sum + 4* (x - '0');
break;
case 6:
sum = sum + 2 * (x - '0');
break;
case 7:
sum = sum + 1 * (x - '0');
break;
case 8:
sum = sum + 6 * (x - '0');
break;
case 9:
sum = sum + 3 * (x - '0');
break;
case 10:
sum = sum + 7 * (x - '0');
break;
case 11:
sum = sum + 9 * (x - '0');
break;
case 12:
sum = sum + 10 * (x - '0');
break;
case 13:
sum = sum + 5 * (x - '0');
break;
case 14:
sum = sum + 8 * (x - '0');
break;
case 15:
sum = sum + 4 * (x - '0');
break;
case 16:
sum = sum + 2 * (x - '0');
break;
}
}
bool judge(int z,char y)
{
switch (z)
{
case 0:
if (y-'0' == 1)
return true;
else
return false;
break;
case 1:
if (y-'0' == 0)
return true;
else
return false;
break;
case 2:
if (y=='X' )
return true;
else
return false;
break;
case 3:
if (y-'0' == 9)
return true;
else
return false;
break;
case 4:
if (y-'0' == 8)
return true;
else
return false;
break;
case 5:
if (y-'0' == 7)
return true;
else
return false;
break;
case 6:
if (y - '0' == 6)
return true;
else
return false;
break;
case 7:
if (y-'0' == 5)
return true;
else
return false;
break;
case 8:
if (y-'0' == 4)
return true;
else
return false;
break;
case 9:
if (y-'0' == 3)
return true;
else
return false;
break;
case 10:
if (y-'0' == 2)
return true;
else
return false;
break;
}
}
int main()
{
int N;
cin >> N;
vector<string>data;
string str;
for (int i = 0; i < N; i++)
{
cin >> str;
data.push_back(str);
}
int count = 0;
vector<string>res1;
int sum = 0;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < 17; j++)
{
if (toupper(data[i][j]) >= 'A'&&toupper(data[i][j]) <= 'Z')
{
res1.push_back(data[i]);
break;
}
calculate(sum,j,data[i][j]);
if (j == 16)
{
int z = sum % 11;
if (judge(z, data[i][17]))
count++;
else
res1.push_back(data[i]);
}
}
sum = 0;
}
if (count == N)
cout << "All passed";
else
for (int i = 0; i < res1.size(); i++)
{
cout << res1[i] << endl;
}
system("pause");
return 0;
}