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 |
为什么是OLT ??第一次遇到#include <iostream.h> int main() { int i,n; int t; bool find; int p[101]; while (1) { cin>>n; if (n==0) break; if (n%2==1) { cout<<"1"<<endl; } else { for (i=0;i<=100;i++) p[i]=0; find = 0; for (i=1;i<=n;i++) { cin>>t; p[t]++; } for (i=1;i<=100;i++) { if (p[i]%2==1) find=1; } if (find) cout<<"1"<<endl; else cout<<"0"<<endl; } } return 0; } Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator