Cod sursa(job #144384)
| Utilizator | Data | 27 februarie 2008 15:51:34 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int ciur[1000001],n,i;
long sol;
void ciur_erath(int n)
{
for(int i=2;i*i<=n;i++)
{if (ciur[i])
for(int l=2;l*i<=n;l++)
{ciur[l*i]=0;sol-=2;}}
}
int main()
{
f>>n;
for(i=2;i<=n;ciur[i]=1,i++);
sol=(n-1)*n;
sol++;
ciur_erath(n);
g<<sol;
f.close();
g.close();
return 0;
}
