2012.01 最小公倍数(最大公约数)
int main()
{
void swap(int &a,int &b);
int GCD(int a,int b);
int LCM(int a,int b);
int num1,num2;
cout<<"enter two numbers:";
cin>>num1>>num2;
int result1=GCD(num1,num2);
int result2=LCM(num1,num2);
cout<<"result_GCD="<<result1<<endl;
cout<<"result_LCM="<<result2<<endl;
return 0;
}
void swap(int &a,int &b)
{
int temp;
temp=a;
a=b;
b=temp;
}
int GCD(int a,int b) //最大公约数
{
if(a<b)
swap(a,b);
if(a%b==0)
return b;
else
return GCD(b,a%b);
}
int LCM(int a,int b) //最小公倍数
{
int result_ls;
result_ls=(a*b)/(GCD(a,b));
return result_ls;
}
2012.02 一系列整数和
int main()
{
int count,sum=0;
int *p=new int[];
cout<<"Please enter a number to count:";
cin>>count;
for(int i=0;i<count;i++)
{
cin>>*(p+i);
sum+=*(p+i);
}
cout<<"the sum of numbers is:"<<sum<<endl;
return 0;
}
2013 计算1-20000的质数
const int count=20000;
int main()
{
int flag,num=0;
int array[20000];
for(int i=2;i<=count;i++)
{
flag=0;
for(int j=2;j<=sqrt(i);j++)
{
if(i%j==0)
{
flag=1;
break;
}
}
if(flag==0)
{
array[num]=i;
num++;
}
}
cout<<num<<endl;
int row=0;
for(int x=0;x<num;x++)
{
cout<<array[x]<<'\t';
row++;
if(row%10==0)
cout<<'\n';
}
return 0;
}
2013 用strtok处理字符串
int main()
{
char telNumber[]="(025)87234865-957";
char *p;
char *p1;
char *p2;
char *p3;
p1=strtok(telNumber,"()");
p2=strtok(NULL,"-");
p3=strtok(NULL,",");
cout<<p1<<'\t'<<p2<<'\t'<<p3<<endl;
return 0;
}