1031 查验身份证 (15分)

输入样例1：
4
320124198808240056
12010X198901011234
110108196711301866
37070419881216001X

输出样例1：
12010X198901011234
110108196711301866
37070419881216001X

输入样例2：
2
320124198808240056
110108196711301862
输出样例2：
All passed

代码如下：

 #include<iostream>
#include<string>
using namespace std;
int main()
{
 int n,k=0;
 string s[101], s1[101], zhi= "10X98765432";
 int quan[20] = { 7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2 };
 cin >> n;
 for (int i = 0; i < n; i++)
 {
  int m = 0;
  cin >> s[i];
  for (int j = 0; j < 17; j++)
  {
   m += (s[i][j] - '0')*quan[j];
  }
   
  if (s[i][17] != zhi[m % 11])
  {
   s1[k++] = s[i];
  }
 }
 if (k == 0) cout << "All passed";
 else
 {
  for (int j = 0; j < k; j++)
   cout << s1[j] << endl;
 }
 return 0;
}