CF1780A.Hayato and School
入门
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Today Hayato came home from school with homework.
In the assignment, Hayato was given an array a of length n. The task was to find 3 numbers in this array whose sum is odd. At school, he claimed that there are such 3 numbers, but Hayato was not sure, so he asked you for help.
Answer if there are such three numbers, and if so, output indices i, j, and k such that ai+aj+ak is odd.
The odd numbers are integers that are not divisible by 2: 1, 3, 5, and so on.
今天,叶人放学回家后带了家庭作业。
作业中,叶人得到了一个长度为 n 的数组 a。任务是找出该数组中三个数,使其和为奇数。在学校里,他声称这样的三个数存在,但叶人并不确定,于是向你求助。
请判断是否存在这样的三个数;若存在,请输出下标 i、j 和 k,使得 ai+aj+ak 为奇数。
奇数是指不能被 2 整除的整数:1、3、5,等等。
输入格式
The first line contains a single integer t (1≤t≤104) — the number of test cases.
For each test case, the first line contains one integer n (3≤n≤300) — the length of a.
The second line contains n integers a1,a2,…,an (1≤ai≤105) — the array a.
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.
第一行包含一个整数 t(1≤t≤104)—— 测试用例的数量。
对于每个测试用例,第一行包含一个整数 n(3≤n≤300)—— 数组 a 的长度。
第二行包含 n 个整数 a1,a2,…,an(1≤ai≤105)—— 数组 a。
保证所有测试用例的 n 之和不超过 2⋅105。
输出格式
For each test case, in the first line print one word "YES" (without quotes) if there are 3 numbers with an odd sum or "NO" (without quotes) if there are no such 3 numbers.
If the answer exists, then on the second line print 3 distinct integers i,j,k (1≤i,j,k≤n) — the indices of the numbers. If there are several answers, output any.
对于每个测试用例,如果存在三个数的和为奇数,则在第一行输出一个单词 “YES”(不带引号);否则(即不存在这样的三个数),输出 “NO”(不带引号)。
如果答案存在,则在第二行输出三个互不相同的整数 i,j,k(1≤i,j,k≤n)—— 即这三个数的下标。如果有多个答案,输出任意一个即可。
输入输出样例
输入#1
6 3 1 1 1 4 1 1 2 2 3 1 2 3 5 1 4 5 1 2 4 2 6 2 4 5 5 6 3 2 1
输出#1
YES 1 2 3 YES 3 4 1 NO YES 1 3 4 NO YES 1 3 5
说明/提示
In the first test case, there is one way to choose 3 numbers, and since 1+1+1=3, this triple is fine for us.
In the second test case, you need to choose the numbers 1,2,2, since 1+2+2=5.
In the third test case, there is one way to choose three numbers, but 1+2+3=6 is an even number, so the required triple does not exist.
In the fifth test case, no matter what three numbers we choose, their sum is even.
在第一个测试用例中,只有一种选择 3 个数的方式,且由于 1+1+1=3,该三元组满足要求。
在第二个测试用例中,你需要选择数字 1,2,2,因为 1+2+2=5。
在第三个测试用例中,只有一种选择三个数的方式,但 1+2+3=6 是偶数,因此所要求的三元组不存在。
在第五个测试用例中,无论选择哪三个数,它们的和均为偶数。
输入解题思路,AI测评打分。不知道怎么写?