比赛 I - 0 or 1
来源:互联网 发布:电脑雕刻制图软件 编辑:程序博客网 时间:2024/05/22 13:33
Description
Solving problem is a interesting thing. Yifenfei like to slove different problem,because he think it is a way let him more intelligent. But as we know,yifenfei is weak in math. When he come up against a difficult math problem, he always try to get a hand. Now the problem is coming! Let we
define T(n) as the sum of all numbers which are positive integers candivied n. and S(n) = T(1) + T(2) + T(3)…..+T(n).
define T(n) as the sum of all numbers which are positive integers candivied n. and S(n) = T(1) + T(2) + T(3)…..+T(n).
Input
The first line of the input contains an integer T which means the number of test cases. Then T lines follow, each line consists of only one positive integers n. You may assume the integer will not exceed 2^31.
Output
For each test case, you should output one lines of one integer S(n) %2. So you may see the answer is always 0 or 1 .
Sample Input
3123
Sample Output
100
Hint
Hint S(3) = T(1) + T(2) +T(3) = 1 + (1+2) + (1+3) = 8 S(3) % 2 = 0
一开始做题的时候就理解错题意了,没有看到divided n,就理解为T(n)=1+n,(n>1),于是就用最简单的方法写的,但是结果超时了,后来才发现是理解错题意了,题意其实很简单,其中有规律的,我列了大量的数据才发现:
只有T[i*i]和T(i*i*2)为1,,其余的都为0,但是在写代码的过程中要注意是哪个在前哪个在后。所以:
#include <iostream>#include <cstdio>using namespace std;int main(){ int n; int m,sum; cin>>n; while(n--) { scanf("%d",&m); sum=0; for(int i=1; i<=m; i++) { if(i*i*2<=m) sum++; if(i*i<=m) sum++; //if(i*i*2<=m) //sum++; else break; //cout<<sum<<endl; } //cout<<sum<<endl; cout<<sum%2<<endl; } return 0;}
0 0
- 比赛 I - 0 or 1
- I - 0 or 1
- Should I use NULL or 0?
- 比赛 I Love This Game
- 不用写成 if @i=1 OR @i=2 OR ... 这么蠢
- 不用写成 if @i=1 OR @i=2 OR ... 这么蠢
- 比赛1
- Which is fast : ++i or i++?
- 0 or 1 ?
- HDU2608 0 or 1
- hdu2608 0 or 1
- 0 or 1
- hdu2608:0 or 1
- 0 or 1
- hdu2608 0 or 1
- hdu4370 0 or 1
- 0 or 1 HDU
- 比赛
- ExtJs4 笔记(7) Ext.tip.ToolTip 提示
- 苹果推送通知办事教程 Apple Push&nb
- 类的继承
- 遍历整个轮廓
- 装饰和单例设计模式
- 比赛 I - 0 or 1
- ExtJs4 笔记(8) Ext.slider 滚轴控件、 Ext.ProgressBar 进度条控件、 Ext.Editor 编辑控件
- 硕士论文查重原理与快速通过的七大方法
- PAT 1063
- 博客始
- 连接脚本
- 蓝桥杯------大臣的旅费------Floyd算法求解
- 继续add oil...
- 【了解 tomcat 目录结构】