Cod sursa(job #3276595)
Utilizator | Data | 13 februarie 2025 21:33:27 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
int n,count=0;
fin>>n;
int a[n],b[n];
for(int i=1;i<=n;i++){
a[i]=i;
b[i]=i;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
int p=i;
int q=j;
if(__gcd(p,q)==1)
count++;
}
}
fout<<count;
return 0;
}