Cod sursa(job #2223192)
Utilizator | Data | 19 iulie 2018 12:45:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <stdio.h>
#include<math.h>
using namespace std;
int A[2000000];
int main()
{
int n,i,j;
FILE *f=fopen("ciur.in","rt");
FILE *g=fopen("ciur.out","wt");
fscanf(f,"%d",&n);
for (i=2;i<=sqrt(n);i++)
if (A[i]==0)
for (j=i*i;j<=n;j=j+i)
A[j]=1;
int countt=0;
for (i=1;i<=n;i++)
if(A[i]==0)countt++;
fprintf(g,"%d",countt);
fclose(f);
fclose(g);
return 0;
}