Pagini recente » Borderou de evaluare (job #2118889) | Cod sursa (job #2509447) | Cod sursa (job #2818603) | Cod sursa (job #3191516) | Cod sursa (job #213236)
Cod sursa(job #213236)
/*#include <fstream>
using namespace std;
int cmmdc(int a, int b) {
while (a!=b)
if (a>b) a=a-b;
else b=b-a;
return a;
}
void fractii() {
ifstream f("fractii.in");
ofstream g("fractii.out");
int n, nr;
while (f>>n) {
nr=n+n-1;
for (int i=2 ; i<=n ; i++)
for (int j=2 ; j<=n ; j++)
if (i!=j)
if (cmmdc(i,j)==1)
nr++;
g<<nr<<endl;
}
f.close();
g.close();
}
int main() {
fractii();
return 0;
}
*/