大陆身份证号码格式校验代码

    最近项目用到身份证校验，在提交公安系统做实名校验前，需要自己检查一下身份证格式是否正确；毕竟每查询一次需要money啊；
提前排除用户随手输入的号码。因此贴出了分享一下

1. #ifndef __YSP_IDCARD_H__
   
2. #define __YSP_IDCARD_H__
   
3. 
   
4. #include <string>
   
5. #include <stdlib.h>
   
6. #include <ctype.h>
   
7. #include <time.h>
   
8. 
   
9. using namespace std;
   
10. namespace NS_YSP
    
11. {
    
12. // wi =2(n-1)(mod 11)
    
13. static int32_t wi[18] = { 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1 };
    
14. 
    
15. // verify digit
    
16. static char vi[11] = { '1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2' };
    
17. 
    
18. class IDCard
    
19. {
    
20.     public:
    
21.         //身份证号码校验
    
22.         static int32_t verify(string idcard, int32_t& gender/*0: 女 1::表示男*/)
    
23.         {
    
24.             //把15位身份证升级为18位
    
25.             if ( idcard.length() == 15)
    
26.             {
    
27.                 idcard = uptoeighteen(idcard);
    
28.             }
    
29. 
    
30.             if (idcard.length() != 18)
    
31.             {
    
32.                 return -1;
    
33.             }
    
34. 
    
35.             //1-17必须是数字
    
36.             for(int32_t i = 0; i < 17; ++i)
    
37.             {
    
38.                 if( idcard[i] < '0' || idcard[i] > '9')
    
39.                 {
    
40.                     return -2;
    
41.                 }
    
42.             }
    
43.             
    
44.             //最后一位(第18位)为校验码，检查checksum值
    
45.             char verify = toupper(idcard[17]);
    
46.             if (verify != checksum(idcard))
    
47.             {
    
48.                 return -3;
    
49.             }
    
50.             
    
51.             //第1-2位为省级行政区划代码，[11, 65] (第一位华北区1，东北区2，华东区3，中南区4，西南区5，西北区6)
    
52.             string strProvince = idcard.substr(0, 2);
    
53.             int32_t nProvince = atoi(strProvince.c_str());
    
54.             if( nProvince < 11 || nProvince > 65 )
    
55.             {
    
56.                 return -4;
    
57.             }
    
58. 
    
59.             //第3-4为为地级行政区划代码，第5-6位为县级行政区划代码因为经常有调整，这块就不做校验
    
60.             
    
61.             //第7-10位为出生年份；//第11-12位为出生月份 //第13-14为出生日期
    
62.             if( !checkdate(idcard.substr(6,8)) )
    
63.             {
    
64.                 return -5;
    
65.             }
    
66. 
    
67.             //第15-17位为顺序码，表示在同一地址码所标识的区域范围内，对同年、同月、同日出生的人编定的顺序号，顺序码的奇数分配给男性，偶数分配给女性
    
68.             string strSeq = idcard.substr(14,3);
    
69.             int32_t nSeq = atoi(strSeq.c_str());
    
70.             gender = nSeq%2;
    
71. 
    
72.             return 0;
    
73.         }
    
74.         
    
75.         static bool checkdate(const string& strDate)
    
76.         {
    
77.             string strYear = strDate.substr(0, 4);
    
78.             int32_t nYear = atoi(strYear.c_str());
    
79. 
    
80.             time_t timep;
    
81.             time(&timep);
    
82.             struct tm *p = gmtime(&timep);
    
83.             if( p )
    
84.             {
    
85.                 if( nYear < 1900 || nYear > 1900 + p->tm_year )
    
86.                 {
    
87.                     return false;
    
88.                 }
    
89. 
    
90.                 if( atoi(strDate.c_str()) > ( (1900 + p->tm_year)*10000 + p->tm_mon*100 + p->tm_mday ) )
    
91.                 {
    
92.                     return false;
    
93.                 }
    
94.             }
    
95. 
    
96.             string strMon = strDate.substr(4, 2);
    
97.             int32_t nMon = atoi(strMon.c_str());
    
98.             if( nMon <= 0 || nMon > 12 )
    
99.             {
    
100.                 return false;
     
101.             }
     
102.             
     
103.             //月份天数表
     
104.             int32_t days[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
     
105.             bool bLeapYear = (nYear % 4 == 0 && nYear % 100 != 0) || (nYear % 400 == 0);
     
106.             if( bLeapYear )
     
107.             {
     
108.                 days[1] = 29;
     
109.             }
     
110.             string strDay = strDate.substr(6, 2);
     
111.             int32_t nDay = atoi(strDay.c_str());
     
112.             if( nDay > days[nMon - 1 ] || nDay <= 0 )
     
113.             {
     
114.                 return false;
     
115.             }
     
116. 
     
117.             return true;
     
118.         }
     
119. 
     
120.         //计算校验码
     
121.         static char checksum(string eightcardid)
     
122.         {
     
123.             int32_t remaining = 0;
     
124.             int32_t ai[18];
     
125. 
     
126.             if ( eightcardid.length() == 18 )
     
127.             {
     
128.                 eightcardid = eightcardid.substr(0, 17);
     
129.             }
     
130. 
     
131.             if ( eightcardid.length() == 17 )
     
132.             {
     
133.                 int32_t sum = 0;
     
134.                 for (int32_t i = 0; i < 17; i++)
     
135.                 {
     
136.                     string k = eightcardid.substr(i, 1);
     
137.                     ai[i] = atoi(k.c_str());
     
138.                 }
     
139. 
     
140.                 for (int32_t i = 0; i < 17; i++)
     
141.                 {
     
142.                     sum = sum + wi[i] * ai[i];
     
143.                 }
     
144.                 remaining = sum % 11;
     
145.             }
     
146.             
     
147.             return vi[remaining];
     
148.         }
     
149. 
     
150.         //把15位身份证升级到18位身份证号码
     
151.         static string uptoeighteen(const string& fifteencardid)
     
152.         {
     
153.             string eightcardid = fifteencardid.substr(0, 6);
     
154.             //加上年月日
     
155.             eightcardid = eightcardid + "19";
     
156.             eightcardid = eightcardid + fifteencardid.substr(6) ;
     
157.             //加上校验码
     
158.             eightcardid.push_back(checksum(eightcardid));
     
159.             return eightcardid;
     
160.         }
     
161. };
     
162. 
     
163. }
     
164. 
     
165. #endif