Cod sursa(job #981708)
Utilizator | Data | 7 august 2013 19:14:25 | |
---|---|---|---|
Problema | Mins | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<stdio.h>
inline int prime(long long a,long long b)
{
long long r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a==1;
}
int main()
{
freopen("mins.in","r",stdin);
freopen("mins.out","w",stdout);
long long n,m,i,j,s=0;
scanf("%lld%lld",&n,&m);
for(i=1;i<n;++i)
for(j=1;j<m;++j)
if(prime(i,j))
++s;
printf("%lld\n",s);
return 0;
}