Cod sursa(job #2316822)
Utilizator | Data | 12 ianuarie 2019 14:31:53 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f1("fractii.in");
ofstream f2("fractii.out");
int n,p,q;
int divizor=0;
int y=0;
f1>>n;
for (p=1;p<=n;p++){
for (q=1;q<=n;q++){
if (p%q==0){
if ((p==q) && (p==1)) y++;
if ((q==1) && (p>q)) y++;
}
if (p%q!=0){
for (int i=q;i>=2;i--){
if ((p%i==0) && (q%i==0)) divizor=i;
}
if (divizor==0) y++;
divizor=0;
}
}
}
f2<<y;
return 0;
}