Cod sursa(job #1042902)
Utilizator | Data | 27 noiembrie 2013 19:39:29 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
int i, j, n, nr, m, N;
bool a[1000000];
int main()
{
f>>n;
for(i=1; i<=n; ++i) a[i]=i;
for(i=1; i<=n; ++i)
{
for(j=1; j<=n; ++j)
{
m=a[i]; N=a[j];
while(m!=N) {if (m>N) m-=N;
else N-=m;}
if (m==1) ++nr;
}
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}