Cod sursa(job #2617057)
Utilizator | Data | 20 mai 2020 17:34:09 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int GCD(int A, int B) {
if(!B)
return A;
return GCD(B, A%B);
}
int n,rez=0,numitor[1000001],numarator[1000001];
int main(void)
{
f>>n;
rez=n+n-1;
for(int i=2;i<=n;i++){
for(int j=2;j<=n;j++){
numitor[i]=i;
numarator[j+1]=j;
while(numarator[j+1]!=0){
if(GCD(numitor[i],numarator[j+1])==1){
rez+=1;
}
break;
}
break;
}
break;
}
g<<rez;
return 0;
}