Cod sursa(job #2268032)
Utilizator | Data | 24 octombrie 2018 14:24:19 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
using namespace std;
bool sunt_prime (int a, int b)
{int r;
while (b!=0)
{r=a%b;
a=b;
b=r;
}
if (a==1)
return true;
else
return false;
}
int main()
{
int numa, numi,rezult,n;
rezult=0;
cin >> n;
for (numa=1 ; numa<=n; numa++)
{
for (numi=1; numi<=n; numi++){
if (sunt_prime(numa, numi)==true)
{
rezult ++;
}
}
}
cout << rezult ;
}