Cod sursa(job #2143238)
Utilizator | Data | 25 februarie 2018 18:30:39 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int prim(int n)
{
int i;
for(i=2;i<=sqrt(n);i++)
{
if(n%i==0)
return 0;
}
return 1;
}
int main()
{
int N,i,j,nr=0;
f>>N;
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)
{
if(prim(i)&&prim(j)&&i!=j)
{
nr++;
}
}
}
g<<nr;
}