1031 查验身份证 (15分)

#include <iostream>
#include <cstring>
#include <cmath>

using namespace std;

const int N = 100;

int weights[17] = {7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};
char M[11] = {'1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2'};

string a;
int n;

bool isTrue()
{
    int sum = 0;
    for (int k = 0; k < 17 ; k ++ )
    {
        if(a[k] < '0' || a[k] > '9') return false;
        sum += weights[k] * (a[k] - '0');
    }

    return M[sum % 11] == a[17];
}

int main()
{
    
    cin >> n;
    bool flag = true;

    for (int i = 0; i < n ; i ++ )
    {
        cin >> a;
        if (!isTrue()) 
        {
            cout << a << endl;
            flag = false;
        }
    }

    if(flag && n != 0) cout << "All passed" << endl;

    return 0;
}