|
6 z[j].len=z[j].r-z[j].l+1;
47 z[j].num=z[j].len/b;
48 cc+=z[j].len/b;
49 j++;
50 }
51 }
52 /* if(b==1){
53 if(k==cc){
54 for(i=0;i<j;i++){
55 for(int i1=z[i].l;i1<=z[i].r;i1++){
56 h[m]=i1;
57 m++;
58 }
59 }
60 ans=m;
61 }
62 else{
63 ans=k-a+1;
64 for(i=0;i<j;i++){
65 for(int i1=z[i].l;i1<=z[i].r;i1++){
66 h[m]=i1;
67 m++;
68 if(m==ans) break;
69 }
70 if(m==ans) break;
71 }
72 }
73 }
74 else */ {
75 /*if(a==cc){
76 for(i=0;i<j;i++){
77 if(z[i].num){
78 for(int i1=z[i].l+b-1;i1<=z[i].r+b-1;i1+=b){
79 h[m]=i1;
80 m++;
81 }
82 }
83 }
84 ans=m;
85 }
86 else */{
87 ans=cc-a+1;
88 for(i=0;i<j;i++){
89 if(z[i].num){
90 for(int i1=z[i].l+b-1;i1<=z[i].r;i1+=b){
91 h[m]=i1;
92 m++;
93 if(m==ans) break;
94 }
95 }
96 if(m==ans) break;
97 }
98 }
99 }
100 // for(i=0;i<j;i++) printf("%d %d \n",z[i].l,z[i].r);
101
102 printf("%d\n",ans);
103 for(i=0;i<m;i++){
104 if(i!=m-1) printf("%d ",h[i]);
105 else printf("%d\n",h[i]);
106 }
107 }
108
109
110 return 0;
111 }
|