NYOJ 464 Cookies

Cookies

时间限制: 1000 ms  |  内存限制: 65535 KB
难度: 1
描述
Olga came to visit the twins Anna and Maria and saw that they have many cookies. The cookies are distributed into bags. As there are many cookies, Olga decided that it's no big deal if she steals a bag. However, she doesn't want the sisters to quarrel because of nothing when they divide the cookies. That's why Olga wants to steal a bag with cookies so that the number of cookies in the remaining bags was even, that is, so that Anna and Maria could evenly divide it into two (even 0 remaining cookies will do, just as any other even number). How many ways there are to steal exactly one cookie bag so that the total number of cookies in the remaining bags was even?
输入
The first line contains the only integer n (1 ≤ n ≤ 100) — the number of cookie bags Anna and Maria have. The second line contains n integers ai (1 ≤ ai ≤ 100) — the number of cookies in the i-th bag.Cases will be end with EOF.
输出
Print in the only line the only number — the sought number of ways. If there are no such ways print 0.
样例输入
1
1
10
1 2 2 3 4 4 4 2 2 2
11
2 2 2 2 2 2 2 2 2 2 99
样例输出
1
8
1
java:

import java.util.Scanner;

public class Cookies {

 public static void main(String[] args) {
  Scanner in = new Scanner(System.in);
  while (in.hasNext()) {

   int n = in.nextInt();
   int[] a = new int[n];
   int sum = 0;
   for (int i = 0; i < n; i++) {
    a[i] = in.nextInt();
    sum += a[i];
   }
   if (sum % 2 == 0) {
    int cnt = 0;
    for (int i = 0; i < n; i++) {
     if (a[i] % 2 == 0)
      cnt++;
    }
    System.out.println(cnt);

   } else {
    int cnt = 0;
    for (int i = 0; i < n; i++) {
     if (a[i] % 2 != 0)
      cnt++;
    }
    System.out.println(cnt);
   }

  }

 }

}

 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值