F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

The Fool

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 4096    Accepted Submission(s): 2105


Problem Description
The Fool is numbered 0 – the number of unlimited potential –and therefore does not have a specific place in the sequence of the Tarot cards. The Fool can be placed either at the beginning of the Major Arcana or at the end. The Major Arcana is often considered as the Fool’s journey through life and as such, he is
ever present and therefore needs no number.


Given n ∈ $N_+$, print the parity of
$\sum\limits_{i=1}^N$ [$\frac{n}{i}$],

where [x] = max a (a∈Z,a≤x)
 

Input
The first line of the input contains one integer $T$ ≤ 100, denoting the number of testcases. Then $T$ testcases follow.
In each of the $T$ testcases, there is a positive number $n$ ≤ $10^9$.
 

Output
For each testcase, print a single line starting with “Case $i$ : ”($i$ indicates the case number) and then “even” or “odd”, separated with a single space.
 

Sample Input
3 1 10000 100000000
 

Sample Output
Case 1: odd Case 2: even Case 3: even
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-25 02:13:58, Gzip enabled