pat1031:查验身份证
2016-03-10 17:28
489 查看
https://www.patest.cn/contests/pat-b-practise/1031
#include "stdio.h"
int main()
{
int i, j, n, flag1, flag = 0, sum = 0;
char id[100][18];
scanf("%d", &n);
for(i = 0; i < n; ++i)
scanf("%s", id[i]);
for(i = 0; i < n; ++i)
{
flag1 = 0;
for(j = 0; j < 17; ++j)
{
if((id[i][j] >= '0') && (id[i][j] <= '9'));
else
{
flag = flag1 = 1;
break;
}
}
if(17 == j)
{
sum = (id[i][0]-'0')*7 + (id[i][1]-'0')*9 + (id[i][2]-'0')*10 + (id[i][3]-'0')*5 + (id[i][4]-'0')*8 + (id[i][5]-'0')*4 + (id[i][6]-'0')*2 + (id[i][7]-'0')*1 + (id[i][8]-'0')*6 + (id[i][9]-'0')*3 + (id[i][10]-'0')*7 + (id[i][11]-'0')*9 + (id[i][12]-'0')*10 + (id[i][13]-'0')*5 + (id[i][14]-'0')*8 + (id[i][15]-'0')*4 + (id[i][16]-'0')*2;
switch(sum%11)
{
case 0: if('1' != id[i][17]) flag = flag1 = 1; break;
case 1: if('0' != id[i][17]) flag = flag1 = 1; break;
case 2: if('X' != id[i][17]) flag = flag1 = 1; break;
case 3: if('9' != id[i][17]) flag = flag1 = 1; break;
case 4: if('8' != id[i][17]) flag = flag1 = 1; break;
case 5: if('7' != id[i][17]) flag = flag1 = 1; break;
case 6: if('6' != id[i][17]) flag = flag1 = 1; break;
case 7: if('5' != id[i][17]) flag = flag1 = 1; break;
case 8: if('4' != id[i][17]) flag = flag1 = 1; break;
case 9: if('3' != id[i][17]) flag = flag1 = 1; break;
case 10: if('2' != id[i][17]) flag = flag1 = 1; break;
default: break;
}
}
if(flag1)
{
for(j = 0; j < 18; ++j)
printf("%c", id[i][j]);
printf("\n");
}
}
if(!flag)
printf("All passed\n");
return 0;
}
#include "stdio.h"
int main()
{
int i, j, n, flag1, flag = 0, sum = 0;
char id[100][18];
scanf("%d", &n);
for(i = 0; i < n; ++i)
scanf("%s", id[i]);
for(i = 0; i < n; ++i)
{
flag1 = 0;
for(j = 0; j < 17; ++j)
{
if((id[i][j] >= '0') && (id[i][j] <= '9'));
else
{
flag = flag1 = 1;
break;
}
}
if(17 == j)
{
sum = (id[i][0]-'0')*7 + (id[i][1]-'0')*9 + (id[i][2]-'0')*10 + (id[i][3]-'0')*5 + (id[i][4]-'0')*8 + (id[i][5]-'0')*4 + (id[i][6]-'0')*2 + (id[i][7]-'0')*1 + (id[i][8]-'0')*6 + (id[i][9]-'0')*3 + (id[i][10]-'0')*7 + (id[i][11]-'0')*9 + (id[i][12]-'0')*10 + (id[i][13]-'0')*5 + (id[i][14]-'0')*8 + (id[i][15]-'0')*4 + (id[i][16]-'0')*2;
switch(sum%11)
{
case 0: if('1' != id[i][17]) flag = flag1 = 1; break;
case 1: if('0' != id[i][17]) flag = flag1 = 1; break;
case 2: if('X' != id[i][17]) flag = flag1 = 1; break;
case 3: if('9' != id[i][17]) flag = flag1 = 1; break;
case 4: if('8' != id[i][17]) flag = flag1 = 1; break;
case 5: if('7' != id[i][17]) flag = flag1 = 1; break;
case 6: if('6' != id[i][17]) flag = flag1 = 1; break;
case 7: if('5' != id[i][17]) flag = flag1 = 1; break;
case 8: if('4' != id[i][17]) flag = flag1 = 1; break;
case 9: if('3' != id[i][17]) flag = flag1 = 1; break;
case 10: if('2' != id[i][17]) flag = flag1 = 1; break;
default: break;
}
}
if(flag1)
{
for(j = 0; j < 18; ++j)
printf("%c", id[i][j]);
printf("\n");
}
}
if(!flag)
printf("All passed\n");
return 0;
}
相关文章推荐
- Linux C函数参考手册(PDF版)
- C# partial关键字说明
- Lua教程(十七):C API简介
- 简单谈谈lua和c的交互
- C#实现打造气泡屏幕保护效果
- 举例讲解C#编程中委托的实例化使用
- 使用C#代码获取存储过程返回值
- C/C++数据对齐详细解析
- 利用C语言来求最大连续子序列乘积的方法
- 字符串的组合算法问题的C语言实现攻略
- C 语言基础教程(我的C之旅开始了)[三]
- 学习C和C++的9点经验总结
- C++中的extern “C”用法详解
- C 语言基础教程(我的C之旅开始了)[七]
- 最大子矩阵问题实例解析
- C字符串操作函数实现方法小结
- C语言中static的作用及C语言中使用静态函数有何好处
- 字典树的基本知识及使用C语言的相关实现
- 详解C语言中free()函数与getpagesize()函数的使用