Cod sursa(job #2003691)
| Utilizator | Data | 23 iulie 2017 17:35:57 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int i, j, n, fractii=0, e[1000000];
f>>n;
for(i=2;i<=n;i++)
e[i]=1;
for(i=2;i<=n;i++)
if(e[i])
for(int j=i+i;j<=n;j+=i)
e[j]=0;
e[1]=0;
fractii+=n;
for(i=2;i<=n;i++)
for(j=1;j<=n;j++)
if(e[i]==1 && e[j]==1) fractii++;
g<<fractii;
}
