/*自然数序列,找出任意连续之和等于n的所有子序列 */
public class Code0001 {
public static void main(String[] args) {
int x=1;
int find = 10;
while(x-1<=(find+1)/2){
int temp = (x*x-x)/2;
System.out.println(temp);
if((find-temp)%x == 0 && (find-temp)/x >=0){
System.out.print(x+"个数:");
for(int i=0;i<x;i++){
System.out.print((find-temp)/x + i);
if(i!=x-1)
System.out.print(",");
}
System.out.println();
}
x++;
}
}
}
转载于:https://my.oschina.net/huichen/blog/415154