【CodeForces】[25A]IQ test
2016-07-18 21:31
330 查看
找出一串数中唯一的奇数或者偶数的坐标
#include<stdio.h> int a[120]; int n; void solve() { int cnt1=0,cnt2=0; for(int i=1; i<=n; i++) { if(a[i]&1) cnt1++; else cnt2++; if(cnt1>1&&i>cnt1) for(int i=1; i<=n; i++) if(a[i]%2==0) { printf("%d\n",i); return ; } if(cnt2>1&&i>cnt2) for(int i=1; i<=n; i++) if(a[i]&1) { printf("%d\n",i); return ; } } return ; } int main() { while(scanf("%d",&n)!=EOF) { for(int i=1; i<=n; i++) scanf("%d",&a[i]); solve(); } return 0; }
题目地址:【CodeForces】[25A]IQ test
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- codeforces 618C. Constellation
- Codeforces Round #349 (Div. 2) - C
- Codeforces Round #361 (Div. 2)
- 7.13Codeforces Round #360 (Div. 2)
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- CodeForces 603A_Alternative Thinking (DP)
- CodeForces 602B_Approximating a Constant Range_DP
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces Round #356 (Div. 2)