Problem 5. Smallest multiple C++编写

#include<iostream>

#include<cmath>

int prime(int n)

{

bool flag=true;

int i;

for(i=2;i<int(n/2)+1;i++)

if(n%i==0)

flag=false;

return flag;

}

int main()

{

int i,j,result=1,z;

int a[21]={0},b[21]={0};

for(j=1;j<21;j++)

a[j]=1;

for(i=2;i<21;i++)

if(prime(i))

a[i]=i;

for(j=2;j<21;j++)

{

if(a[j]!=1)

z=a[j];

while (z<21)

{

b[j]+=1;

z=z*a[j];

}

}

for(j=1;j<21;j++)

std::cout<<a[j]<<" "<<b[j]<<std::endl;

for(j=1;j<21;j++)

result*=pow(a[j],b[j]);

std::cout<<result<<std::endl;

return 0;

}

Problem 5. Smallest multiple C++编写,布布扣,bubuko.com

Problem 5. Smallest multiple C++编写

原文：http://8734514.blog.51cto.com/8724514/1393636