我抄了 谢谢

> //如果某数有generator，它一定可以拆成：i*1001 + j*101 + k*11 + m*2   0<=i,j,k,m<=9
> //数组开到9*1001+9*101+9*11+9*2+1=10036
> 
> #include <iostream>
> using namespace std;
> 
> int main()
> {
> 	int selfnum[10036] = {0};
> 	for ( int i = 0 ; i < 10 ; ++ i )
> 		for ( int j = 0 ; j < 10 ; ++ j )
> 			for ( int k = 0 ; k < 10 ; ++ k )
> 				for ( int m = 0 ; m < 10 ; ++ m )
> 					selfnum[ i*1001 + j*101 + k*11 + m*2 ] = 1;
> 	for ( int i = 1 ; i <= 10000 ; ++ i  )
> 		if ( selfnum[i] == 0 )
> 			cout << i << endl;
> 	return 0;
> }