Cod sursa(job #900248)
Utilizator | Data | 28 februarie 2013 18:30:23 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int main()
{ long long a,b,S,i,j,n;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
long long V[n];
for(i=1;i<=n;i++)
V[i]=i;
S=2*n-1;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
{a=V[i];b=V[j];
while(a!=b)
if(a>b)
a=a-b;
else
b=b-a;
if(a==1)
S++;}
g<<S;
g<<"\n";
return 0;
}