代码题:
//列出0-10000素数
void isPrime(int k)
{
int j;
int i;
int judge=1;
for ( j=2; j*j<=k; j++ )
{
if(k%j==0)
{
judge=0;break;
}
}
if(judge)v.push_back(k);
}
//最小生成元
void preme()
{
int ans[maxn];
int n;
memset(ans, 0, sizeof(ans));
for (int m = 1; m < maxn; m++)
{
int x = m, y = m;
while (x > 0) { y += x % 10; x /= 10; }
if (ans[y] == 0 || m < ans[y]) ans[y] = m;
}
while (cin >> n)
{
cout << "最小生成元为: " << ans[n] << " ";
}
}