项目一:回文和素数
#include<iostream>
using namespace std;
//n<=300.
int isPrimer(int n)
{
int i;
for(i=2;i<n;i++)
if(n%i==0)
break;
if(n==i)
return 1;
else return 0;
}
int isPalindrome(int n)
{
int temp=n;
n=n/100+(n/10-n/100*10)*10+(n-n/10*10)*100;
if((temp==n&&temp%10!=0&&temp>10)||temp<10||(temp%11==0&&temp<100))
return 1;
else
return 0;
}
int judge(int n)
{
if(n>100)
return (n/100+(n/10-n/100*10)*10+(n-n/10*10)*100);
if(n>10&&n<100)
return (n/10+10*(n-n/10*10));
if(n<10)
return n;
}
int isReversiblePrime(int n)
{
int temp;
if(isPrimer(n)==1)
{
temp=judge(n);
if(isPrimer(temp)==1)
return 1;
else return 0;
}
else return 0;
}
int main()
{
int i,coutNum=0;
cout<<"All the primes under 300:"<<endl;
for(i=2;i<=300;i++)
{
if(isPrimer(i)==1)
{
cout<<i<<'\t';
coutNum++;
if(coutNum%7==0)
cout<<endl;
}
}
coutNum=0;
cout<<endl;
cout<<"All the palindromes under 300:"<<endl;
for(i=2;i<=300;i++)
{
if(isPalindrome(i)==1)
{
cout<<i<<'\t';
coutNum++;
if(coutNum%7==0)
cout<<endl;
}
}
coutNum=0;
cout<<endl;
cout<<"All the prime palindromes under 300:"<<endl;
for(i=2;i<=300;i++)
{
if(isPrimer(i)==1&&isPalindrome(i)==1)
{
cout<<i<<'\t';
coutNum++;
if(coutNum%7==0)
cout<<endl;
}
}
coutNum=0;
cout<<endl;
cout<<"All the reversible primes under 300:"<<endl;
for(i=2;i<=300;i++)
{
if(isReversiblePrime(i)==1)
{
cout<<i<<'\t';
coutNum++;
if(coutNum%7==0)
cout<<endl;
}
}
return 0;
}
项目二:
<pre class="cpp" name="code">#include<iostream>
using namespace std;
int main()
{
cout<<"请输入两个整数,中间用空格隔开"<<endl;
int m,n,R,t,k;
cin>>m>>n;t=m*n;
k=m%n;
while(k!=0)
{
m=n;n=k;k=m%n;
}
cout<<"最小公约数为:"<<n<<endl;
R=t/n;
cout<<"最大公倍数为:"<<R;
return 0;
}