half-consecutive(未AC)
来源:互联网 发布:胡杨网络 天津 编辑:程序博客网 时间:2024/05/17 04:46
The numbers 111,333,666,101010,151515,212121,282828,363636,454545 and ti=12i(i+1)t_i=\frac{1}{2}i(i+1)ti=21i(i+1), are called half-consecutive.
For given NNN, find the smallest rrr which is no smaller than NNN such that trt_rtr is square.
Input Format
The input contains multiple test cases.
The first line of a multiple input is an integer TTT followed by TTT input lines.
Each line contains an integer N (1≤N≤1016)N~(1\le N\le 10^{16})N (1≤N≤1016).
Output Format
For each test case, output the case number first.
Then for given NNN, output the smallest rrr.
If this half-consecutive number does not exist, output −1-1−1.
样例输入
412950
样例输出
Case #1: 1Case #2: 8Case #3: 49Case #4: 288
找规律
阅读全文
0 0
- half-consecutive(未AC)
- 计蒜客 Half-consecutive Numbers
- Longest Consecutive Sequence(未)
- UVa1589(未ac)
- uva10142(未ac)
- uva336(未ac)
- ICPC2017网络赛(乌鲁木齐)E: Half-consecutive Numbers (大数)
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 E.Half-consecutive Numbers
- E. Half-consecutive Numbers 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 E. Half-consecutive Numbers
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛E Half-consecutive Numbers
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 E: Half-consecutive Numbers
- 计蒜客-2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛-E-Half-consecutive Numbers
- 2017 icpc 乌鲁木齐赛区 E.Half-consecutive Numbers(找规律)
- E. Half-consecutive Numbers 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 E. Half-consecutive Numbers
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 E. Half-consecutive Numbers
- 计蒜客 16954 Half-consecutive Numbers(2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 E)
- 移动端Vin码识别-车架号识别SDK
- 笔记--解析xml
- 学习HTML第一周(二)
- 枚举
- sklearn中支持向量机的参数
- half-consecutive(未AC)
- Ubuntu16.04 上 Redis 4.0 及php-redis扩展的安装和使用
- 运用CSS3实现钟摆效果
- test
- Python ftplib
- hdu 2043 密码
- mysql
- ios 获取当前时间 以及前后一个月的时间
- 【LightOJ】1138---Trailing Zeros(二分)