IQ test

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.
Examples
Input
5
2 4 7 8 10
Output
3
Input
4
1 2 1 1
Output
2
问题链接
https://cn.vjudge.net/problem/CodeForces-25A
问题简述
判断输入的数中以奇偶判断哪个数字不是同类
程序说明
以动态数组来存放你所要判断的数,然后用循环判断输出

#include <iostream>
using namespace std;
int main()
{
	int n,i,j=0,k=0,a,b;
	cin >> n;//输入所要判断的数的个数
	int*p = new int[n];//申请动态空间
	for (i = 0; i < n; i++)//循环输入
	{
		cin >> p[i];
		if (p[i] % 2 == 0)//判断是否为偶数
		{
			j++; if (j == 1)a = i+1;//用j判断有几个偶数,将第一个偶数在第几位保留下来
		}
		else { k++; if (k == 1)b = i+1; }//用k看有几个奇数,将第一个奇数位置保留下来
	}
	if (k == 1)cout << b<<endl;//判断是哪个只有一个,输出其所在的位置
	else cout << a << endl;

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值