pat 乙级 1031. 查验身份证(15)

代码：

#include <iostream>
using namespace std;
int W[]={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};
char w[]={'1','0','X','9','8','7','6','5','4','3','2'};
int main()
{	int N;
	cin>>N;
	string s[N];
	for (int i=0; i<N;i++ )
	{
		cin>>s[i];
	}
	int count[N]={0};
	for (int i=0;i<N ;i++ )
	{
		int sum=0,div=0;
		for (int j=0;j<s[i].length()-1 ;j++ )
		{
			sum+=W[j]*(s[i].at(j)-48);
		}
		
		div=sum%11;
		if (w[div]==s[i].at(s[i].length()-1))
		{
			count[i]=1;
		}
		else
		{
			count[i]=0;
		}
	}

	int num=0;

	for (int i=0; i<N;i++ )
	{
		if (count[i]!=1)
		{
			cout<<s[i]<<endl;
			num=1;
		}
	}
	if (num==0)
	{
		cout<<"All passed"<<endl;
	}
	return 0;
}