Cod sursa(job #1498593)
Utilizator | Data | 8 octombrie 2015 20:15:47 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
int prim(int a,int b){
int t;
while(b!=0){
t=b;
b=a%b;
a=t;
}
return a;}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,p,q,nr=0;
f>>n;
for(p=1;p<=n;p++)
for(q=1;q<=n;q++)
if(prim(p,q)==1) nr++;
g<<nr;}