Pagini recente » Cod sursa (job #833310) | Cod sursa (job #294762) | Rating Lacraru Alexandru Daniel (Lacraru_Alexandru_Daniel_322CC) | Cod sursa (job #1850123) | Cod sursa (job #209383)
Cod sursa(job #209383)
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
using namespace std;
int nprime(int numer, int denum)
{int prime=1, min;
if(numer<denum) min=numer;
else min=denum;
for(int i=2; i<=min; i++){
if(numer%i==0 && denum%i==0) {prime=0; break;}
}
return prime;
}
int main(void)
{
ifstream afile ("fractii.in");
ofstream afile1 ("fractii.out");
char ab[10];
int num[15],sum=0, numer,denum, i=0, j=0;
for (int i=0; i<10;i++){
afile.getline(ab,10);
num[i]=atoi(ab);
cout<<"i= "<<num[i]<<endl;
}
for(int no=0; no<10; no++){
sum=0;
for (int i=1; i<=num[no]; i++){
numer=i;
for (int j=1; j<=num[no]; j++){
denum=j;
if(nprime(numer,denum)==1) sum++;
// if(numer%denum!=0 || (numer==1 || denum==1) ) {
// if (denum%numer!=0 || (numer==1 || denum==1)) {sum++; cout<<"numer="<<numer<<" denum="<<denum<<" prime="<<cmmdc(numer,denum)<<endl;}
// else if(cmmdc(numer,denum)==1) sum++;
}
cout<<endl;
}
afile1<<sum<<endl;
cout<<sum<<endl;
}
// cout<<4%1<<endl;
afile.close();
}