pat1031:查验身份证

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;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值