sicily 1209. Sequence Sum Possibi
2012-03-27 13:08
323 查看
// 给出m,求由至少两个元素组成的等差数列的和恰好等于m,有多少种组合可能性 // 比如 6 = 1 + 2 + 3 , 9 = 4 + 5 = 2 + 3 + 4 , 则答案是 1 2 // 参照 sicily 1218 纪念邮票 #include<iostream> #include<stdio.h> using namespace std; int main() { int cases; cin>>cases; while(cases--) { int n,m,res=0; cin>>n>>m; for(int c=1;c*c<2*m;++c) { if( 2*m%(1+c)==0 && (2*m/(1+c)-c)%2==0 && (2*m/(1+c)-c)>=2 ) res++; } printf("%d %d\n",n,res); } return 0; }
相关文章推荐
- sicily 1209. Sequence Sum Possibi
- Sicily 1209 Sequence Sum Possibi
- [sicily]1209. Sequence Sum Possibi
- Sicily1209. Sequence Sum Possibi题解
- 1209. Sequence Sum Possibi
- 1209. Sequence Sum Possibi
- Sequence Sum Possibi
- hdu 3415 Max Sum of Max-K-sub-sequence
- hdu 3415 Max Sum of Max-K-sub-sequence 单调队列dp
- HDU 3415(Max Sum of Max-K-sub-sequence-单调队列优化DP)
- POJ 2853 Sequence Sum Possibilities
- Sicily 1028. Hanoi Tower Sequence
- 单调队列——HDU 3415 Max Sum of Max-K-sub-sequence
- sicily Sum up file sizes
- <OJ_Sicily>Sum of Consecutive Primes
- hdu 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(单调队列)
- HDU 3415 Max Sum of Max-K-sub-sequence(求长度不超过K的最大区间和)
- hdu 3415 Max Sum of Max-K-sub-sequence 单调队列dp