Pagini recente » Cod sursa (job #1732687) | Cod sursa (job #2770831) | Cod sursa (job #2693886) | Cod sursa (job #1379431) | Cod sursa (job #819541)
Cod sursa(job #819541)
#include <fstream>
#include <iomanip>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int n,result;
int divComun(int i,int j)
{
if(i == 1 && j == 1)
return 1;
else if( i == 1 || j == 1)
return 2;
if(i == j)
return 0;
if(i % j == 0)
return 2;
if(j % i == 0)
return 2;
return 0;
}
void solve()
{
for(int i = 1; i <= n; i++)
for(int j = 1; j < n;j++)
{
result += divComun(i,j);
}
}
int main()
{
in >> n;
in.close();
solve();
out << result;
out.close();
return 0;
}