Pagini recente » Cod sursa (job #1441301) | Cod sursa (job #1222316) | Monitorul de evaluare | Cod sursa (job #2366842) | Cod sursa (job #1386162)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int n,i,j,cop1,cop2;
long long nr=0;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if((i%2==0&&j%2==0)||(i%3==0&&j%3==0))
cop1=0;
else
{
cop1=i;
cop2=j;
while(cop1!=cop2)
if(cop1>cop2)
cop1-=cop2;
else
cop2-=cop1;
if(cop1==1)
nr++;
}
g<<nr;
}