Cod sursa(job #796481)
Utilizator | Data | 11 octombrie 2012 17:08:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int a[500001];
int main()
{
int i,j;
long long n;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
// cout<<sizeof a;
for(i=2;i<=n;i++)
{
a[i]=i-1;
}
for(i=2;i<=n;i++)
{
for(j=i+i;j<=n;j+=i)
{
a[j]-=a[i];
}
}
g<<a[n];
return 0;
}