怎么老是超时?
蒟蒻40分,对1,3,6,9点
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(3) //O3优化
int a(int m,int n)//求最大公约数
{
int min;
if(m<=0||n<=0) return -1;
if(m>n) min = n; else min = m;
while(min){
if(m%min==0&&n%min==0) return min;
min--;
}
return -1;
}
int b(int m,int n)
{
int max;
if(m<=0||n<=0) return -1;
if(m>n) max=m;
else max=n;
while(max){
if(max%m==0&&max%n==0) return max;
max++;
}
return -1;
}
int main(){
int p,q,sum=0;
cin>>p>>q;
for(int i=p;i<=q;i++){
for(int j=p;j<=q;j++)
if(a(i,j)==p&&b(i,j)==q)
sum++;
}
cout<<sum;
return 0;
}