Cod sursa(job #1593645)
Utilizator | Data | 8 februarie 2016 19:33:10 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
#include <iostream>
using namespace std;
int n,i,j,k=0;
int Prime(int a, int b)
{
int i,r;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
if(a==1)
return 1;
return 0;
}
int main() {
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(Prime(i,j)==1) k++;
fout<<k;
}