Codeforces Beta Round #25 (Div. 2)A. IQ test_html/css_WEB-ITnose

立即学习“前端免费学习笔记（深入）”；

IQ test

time limit per test

memory limit per test

input

output

Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob ? to check his answers, he needs a program that among the given n numbers finds one that is different in evenness.

Input

The first line contains integer n (3?≤?n?≤?100) ? amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.

Output

Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.

Sample test(s)

input

52 4 7 8 10

output

input

41 2 1 1

output

立即学习“前端免费学习笔记（深入）”；

div+css3阶梯分页样式

div+css3阶梯分页样式

84

查看详情

解题报告：水题。。。给你一列数，其中只有一个数的奇偶性和其他数不同，输出它所在的位置。直接暴力扫一遍，记录最后一个奇数和偶数的位置，并记录奇数和偶数的个数，即可。

AC代码：

立即学习“前端免费学习笔记（深入）”；

#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <time.h>using namespace std;#define INF 0x7fffffffint a[105];int main(){    #ifdef sxk        freopen("in.txt","r",stdin);    #endif    int n;    while(scanf("%d",&n)!=EOF)    {        int ans1 = 0, ans2 = 0, x, y;        for(int i=0; i<n; i++){            cin>>a[i];            if(a[i]&1) {                ans1 ++;                x = i+1;            }            else{                ans2 ++;                y = i+1;            }        }        if(ans1>ans2) cout<<y<<endl;         //判断条件也可换成ans1 == 1        else cout<<x<<endl;    }    return 0;}

立即学习“前端免费学习笔记（深入）”；