Cod sursa(job #363395)

Utilizator andrei.sfrentSfrent Andrei andrei.sfrent Data 12 noiembrie 2009 23:54:58
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include<stdio.h>
#define N 2000000
int main()
{
	freopen("ciur.in","r",stdin);
		freopen("ciur.out","w",stdout);
			char c[N+1];
				int cnt=0,n,i,j;
					scanf("%d",&n);
						//init
							for(i=2;i<=n;++i) c[i]=1;
								for(i=2;i<=n;++i)
									{
											if(c[i]) //daca i e prim
													{
																cnt++;
																			for(j=2*i;j<=n;j+=i) c[j]=0; //eliminam multiplii
																					}
																						}
																							printf("%d",cnt);
																								fclose(stdin);
																									fclose(stdout);
																										return 0;
																										}