https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1011
第一道题,代码:
#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
int main(){
int a,b;
while(cin>>a>>b){
cout<<gcd(a,b)<<endl;
}
return 0;
}
https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1012
第二道题,代码:
#include<iostream>
using namespace std;
int gcd(long long a,long long b){
return b?gcd(b,a%b):a;
}
int main(){
long long a,b;
cin>>a>>b;
cout<<a*b/gcd(a,b)<<endl;
return 0;
}
https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1106
第三道题,代码:
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
int m;
cin>>m;
if(m==2||m==1)
cout<<"Yes"<<endl;
else{
int flag=0;
for(int i=2;i*i<=m;i++)
if(m%i==0){
flag=1;
break;
}
if(flag==1)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;}
}
return 0;
}
https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1046
第四道题(快速幂),代码如下:
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long a,b,c;
cin>>a>>b>>c;
int ans=1;
a=a%c;
while(b>0){
if(b&1)
ans=(ans*a)%c;
b=b/2;
a=a*a%c;
}
cout<<ans<<endl;
return 0;
}
http://acm.hdu.edu.cn/showproblem.php?pid=2504
第五道题(欧几里得gcd),代码:
#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
int main(){
int n;
cin>>n;
while(n--){
int a,b,c;
cin>>a>>b;
for(int i=b+1;i!=b;i++)
if(gcd(a,i)==b){
c=i;
break;
}
cout<<c<<endl;
}
return 0;
}
http://acm.hdu.edu.cn/showproblem.php?pid=2098
第六道题(分拆素数和),代码如下:
#include<iostream>
#include<algorithm>
using namespace std;
int that_prime(int n){
for(int i=2;i*i<=n;i++)
if(n%i==0)
return 0;
return 1;
}
int main(){
int n;
while(cin>>n&&n){
int ans=0;
for(int i=2;i<n/2;i++){
if(that_prime(i)&&that_prime(n-i))
ans++;
}
cout<<ans<<endl;
}
return 0;
}
http://acm.hdu.edu.cn/showproblem.php?pid=1222
第七道题(Wolf and Rabbit),代码如下:
#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
int main(){
int p;
cin>>p;
while(p--){
int m,n;
cin>>m>>n;
if(gcd(m,n)!=1)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}