Cod sursa(job #2418860)
| Utilizator | Data | 6 mai 2019 17:23:34 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<bits/stdc++.h>
using namespace std;
//bool prii;
long long n,k;
int primm(long long x,long long y){
long long mn;
mn=min(x,y);
if((x==1)||(y==1))return 1;else{
if(x==y)return 0;else{
for(int i=2;i<=mn;i++){
if((x % i == 0)&&(y % i == 0))return 0;else return 1;
}
}
}
}
int main(){
ifstream cin("fractii.in");
ofstream cout("fractii.out");
cin>>n;
for(long long i=1;i<=n;i++)
for(long long j=1;j<=n;j++){
if(primm(i,j))k++;
}
cout<<k;
return 0;
}
