#include #include void Reorder(int R[], int index, int val){ int counter=0; while(index != 0 && R[index] > val){ R[index+1] = R[index]; R[index] = val; index--; } } void regular(int R[], int n){ if(n > 0) R[0] = 1; int val=0; for(int i = 0, b = 2, c = i+1 ; i <= n && R[i]!=0; i++, b=2){ while(b<=5){ val = R[i]*b; if((val <= n) && ((b==5 && (val%2!=0 && val%3!=0)) || (b==2 && val%3!=0) || b==3)){ R[c]=val; Reorder(R,c-1,val); c++; } b += b-1; } if(R[i]*2 > n) break; } }