Cod sursa(job #633457)

Utilizator Marius_mFMI-M2 Marius Melemciuc Marius_m Data 13 noiembrie 2011 20:13:59
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.48 kb
#include<iostream>
#include<vector>

using namespace std;

vector<long int> v;

void ciur(long int n,long int &x)
{	long int i,j;
	for(i=1;i<=n;i++)
		v.push_back(1);
	for(i=2;i<=n;i++)
		if(v[i]==1)	{
			x++;
			for(j=2*i;j<=n;j=j+i)
				if(v[j]==1)
					v[j]=0;
		}
}

int main()
{	long int N,nr=0;
	FILE *c,*d;
	c=fopen("ciur.in","r");
	d=fopen("ciur.out","w");
	fscanf(c,"%ld",&N);
	ciur(N,nr);
	fprintf(d,"%ld",nr);
	fclose(c);
	fclose(d);
	return 0;
}