Cod sursa(job #1142435)
Utilizator | Data | 13 martie 2014 20:41:04 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,v[1000000],i,j,k=0,ca,cb;
int main()
{
f>>n;
for(i=1;i<=n;i++)
v[i]=i;
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{ca=v[i];
cb=v[j];
while(ca!=cb)
if(ca>cb)
ca=ca-cb;
else
cb=cb-ca;
if(cb==1)
k++;}
}
g<<k<<endl;
return 0;
}