Logo
(追記) (追記ここまで)

32498번 - Call for Problems 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 1024 MB26541891180371.861%

문제

The Call for Problems for the ICPC North America Qualifier (NAQ) has finished, and a number of problems were proposed. The judges voted on the difficulty of each problem. The NAQ does not want to be considered an odd contest, so therefore they refuse to use any problem which has an odd number (not divisible by two) for a difficulty rating.

Given the difficulty ratings of the candidate problems, how many were excluded by this rule?

입력

The first line of input contains a single integer $n$ (1ドル≤n≤50$), which is the number of candidate problems.

Each of the next nn lines contains a single integer $d$ (0ドル≤d≤100$), which are the difficulty ratings of the $n$ problems.

출력

Output a single integer, which is the number of candidate problems excluded by the rule.

제한

예제 입력 1

2
2
3

예제 출력 1

1

힌트

출처

ICPC > Regionals > North America > North America Qualification Contest > ICPC North America Qualifier 2024 C번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /