Pagini recente » Cod sursa (job #473183) | Cod sursa (job #816969) | Monitorul de evaluare | Cod sursa (job #1361878) | Cod sursa (job #2617063)
#include<bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
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){
while (numitor[i] != numarator[j+1])
{
if (numitor[i] > numarator[j+1])
numitor[i] = numitor[i] - numarator[j+1];
else
numarator[j+1] = numarator[j+1] - numitor[i];
}
if(numitor[i]==1){
rez+=1;
}
break;
}
}
}
g<<rez;
return 0;
}