| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
small trick count=0;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if((b[i]&1)&&(c[j]&1)) { count++; x=i; y=j; }
b,c:行列的奇偶性
count==1 change
else corrupt
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator