Cod sursa(job #861460)
Utilizator | Data | 21 ianuarie 2013 16:24:26 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include<fstream>
#include<iostream>
using namespace std;
long i,n,j,s=0;
int diva(int a,int b)
{while(a!=b)
if(a>b) a=a-b;
else b=b-a;
return a;}
int main()
{ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=2;i<=n;i++)
for(j=i+1;j<=n;j++)
if(diva(i,j)==1) s++;
s=2*s+2*n-1;
g<<s;}