1209. Sequence Sum Possibi
来源:互联网 发布:知乎 cos 编辑:程序博客网 时间:2024/04/30 04:56
TAG 数论
简单的数学题。设 n+.. +(n+k)=X, n>0,k>0
有 (2n+k)(k+1)=2X
k(k+1) <2X
k^2<2X
k<sqrt(2X)
枚举k到sqrt(2X)就行了
- 1209. Sequence Sum Possibi
- 1209. Sequence Sum Possibi
- [sicily]1209. Sequence Sum Possibi
- sicily 1209. Sequence Sum Possibi
- Sicily 1209. Sequence Sum Possibi
- Sequence Sum Possibi
- Sicily 1209 Sequence Sum Possibi
- Sicily1209. Sequence Sum Possibi题解
- poj 2853 Sequence Sum Possibilities
- Max Sum of Max-K-sub-sequence
- Poj 2853,2140 Sequence Sum Possibilities(因式分解)
- POJ 2853 Sequence Sum Possibilities 可能会
- Max Sum of Max-K-sub-sequence
- hdu 3415 Max Sum of Max-K-sub-sequence
- hdu 3415 Max Sum of Max-K-sub-sequence
- hduoj 3415 Max Sum of Max-K-sub-sequence
- hdu3415 Max Sum of Max-K-sub-sequence
- DP单调队列:Max Sum of Max-K-sub-sequence
- Web应用的系统架构
- IRP的同步完成与异步完成
- LINUX 硬链接与软链接的区别
- 好郁闷呢啊
- 打炮弹之神奇算法
- 1209. Sequence Sum Possibi
- NOW I AM IN MY LABORATORY
- hdu 1712 ACboy needs your help 分组背包
- java keywods & reserved
- 学习C++和编程的50个观点
- Hibernate session浅见(3)
- Java多线程编程总结
- LDD3学习笔记《三》第四章
- 消息队列通信msgsnd函数时一直invalid argument