Input
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).
Problem Description
Each test case contains only a number n (0< n<= 10^5) in a line.Sample Input
Output the condition of the n-th lamp after infinity operations (0 - off, 1 - on).
Output
- 1
- 5
Sample Output
- 1
- 0Hinthint 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.
測试数据量不大,能够简单粗暴,这道题也就是水题。
- #include <iostream>
- #include <cstring>
- using namespace std;
- int main()
- {
- int n;
- int count;
- while(cin>>n)
- {
- count=0;
- for(int i=1;i<=n;i++)
- {
- if(n%i==0)
- {
- count++;
- }
- }
- if(count%2==0)cout<<"0"<<endl;
- else cout<<"1"<<endl;
- }
- return 0;
- }
来源: http://www.bubuko.com/infodetail-2117155.html