Cod sursa(job #1728717)
Utilizator | Data | 13 iulie 2016 16:14:28 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
void ireductibil(int i, int j, int v[100][100])
{
int max = (i > j) ? i : j;
for(int k = max; k >= 2; k--)
{
if(i % k == 0 && j % k == 0)
{
i /= k;
j /= k;
}
}
v[i][j] = 1;
}
int main()
{
int n, i, j, v[100][100], total = 0;
ifstream fin("fractii.in");
fin>>n;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
{
v[i][j] = 0;
ireductibil(i, j, v);
if(v[i][j] == 1)
total++;
}
}
cout<<"Total: "<<total;
return 0;
}