n! 素因子分解

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<bitset>#include<iomanip>using namespace std;const int Max = 1000 ;int prime[ Max ] ;bool num[ Max ] = { true , true } ;int k = 0 ;void init(){for( int i = 2 ; i * i <= Max ; ++i ){if( !num[ i ] ) {for( int  j = i ; j * i <= Max ; ++j )num[ i * j ] = true ;}}for( int i = 2 ; i <= Max ; ++i ){if( !num[ i ] )prime[ k++ ] = i ;}}int main(){init() ;int n ;while( cin >> n ){for( int i = 0 ; i < k && prime[ i ] <= n ; ++i ){int temp = n ;while( temp >= prime[ i ] ){for( int j = 1 ; j <= temp / prime[ i ] ; ++j)cout << prime[ i ] << ' ' ;temp /= prime[ i ] ;}}cout << endl ;}return 0 ;}