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

Switch Game

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 34334    Accepted Submission(s): 20942


Problem Description
There are many lamps in a line. All of them are off at first. A series of operations are carried out on these lamps. On the i-th operation, the lamps whose numbers are the multiple of i change the condition ( on to off and off to on ).
 

Input
Each test case contains only a number n ( 0< n<= 10^5) in a line.
 

Output
Output the condition of the n-th lamp after infinity operations ( 0 - off, 1 - on ).
 

Sample Input
1
5
 

Sample Output
1
0

Consider the second test case:

The initial condition	   : 0 0 0 0 0 ¡­
After the first operation  : 1 1 1 1 1 ¡­
After the second operation : 1 0 1 0 1 ¡­
After the third operation  : 1 0 0 0 1 ¡­
After the fourth operation : 1 0 0 1 1 ¡­
After the fifth operation  : 1 0 0 1 0 ¡­

The later operations cannot change the condition of the fifth lamp any more. So the answer is 0.
 

Hint
hint
 

Author
LL
 

Source
УÇì±­Warm Up
 

Statistic | Submit | Discuss | Note
Home | Top 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-22 06:56:53, Gzip enabled 		Administration