Cod sursa(job #2114499)
Utilizator | Data | 25 ianuarie 2018 16:57:45 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream in ("fractii.in");
ofstream out ("fractii.out");
int prime (long long a, long long b) {
long long i,t=0;
if (a==b)
t=0;
else {
for (i=1; i<=min(a,b); i++) {
if (a%i==0 && b%i==0)
t++;
}
}
return t;
}
int main()
{
long long a[1000000],b[1000000],n,f=1,k,l;
in>>n;
for (k=1; k<=n; k++){
a[k]=k;
b[k]=k;}
for (k=1; k<=n; k++) {
for (l=1; l<=n; l++){
if (prime(a[k],b[l])==1)
f++;
}
}
out<<f;
return 0;
}