Pagini recente » Cod sursa (job #94160) | Cod sursa (job #1148377) | Cod sursa (job #871181) | Cod sursa (job #545154) | Cod sursa (job #209403)
Cod sursa(job #209403)
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
using namespace std;
int nprime(int numer, int denum) {
int min, max;
if(numer==denum) return 0;
if(numer<denum) {min=numer; max=denum;}
else {min=denum; max=numer;}
int i=2;
while (i<=min || i<=(sqrt(max)))
{
if(numer%i==0 && denum%i==0) { cout<<"num,den: "<<numer<<" "<<denum<<" not coprime\n"; return 0;}
i++;
}
return 1;
}
int main(void)
{
ifstream afile ("fractii.in");
ofstream afile1 ("fractii.out");
char ab[10];
int num[15],sum=0, x=0;
for (int i=0; i<10;i++){
afile.getline(ab,10);
num[i]=atoi(ab); if(num[i]!=0) x++;}
for(int no=0; no<x; no++)
{sum=num[no]; cout<<"adding "<<num[no]<<" to the sum\n"; //num[no];
if(num[no]%2==0) sum+=(num[no]/2)*(num[no]/2);
else sum+=((num[no]/2)+1)*(num[no]/2);
for(int i=3; i<=num[no]; i+=2){
{sum++;
for(int j=2; j<=num[no];j++)
if(nprime(i, j)==1) sum++;
}
}
afile1<<sum<<endl;
cout<<sum<<endl<<endl;}
afile.close();
}