Cod sursa(job #428416)

Utilizator darkseekerBoaca Cosmin darkseeker Data 29 martie 2010 11:25:17
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb

#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
	fstream f("ciur.in",ios::in);
	fstream g("ciur.out",ios::out);
	int x,i,prim=0,j;
	char v[2000001];
	f>>x;
	for(i=2;i<=x;i++)
		if(!v[i])
		{
			prim++;
			for(j=i;j<=x;j+=i)
				v[j]=1;
		}
	g<<prim;
}
/*
#include<fstream>
using namespace std;
 
ifstream f("ciur.in");
ofstream g("ciur.out");
 
char a[20000005];int n,i,j,nr;
 
int main()
{
    f>>n;nr=0;
    for(i=2;i<=n;i++)
        if(!a[i])// i este prim
            {
              nr++;
              
                for(j=2;j<=n/i;j++)//marchez cu 1 multiplii lui i
                    a[i*j]=1;
            }
    g<<"\n"<<nr;
    return 0;
}			
	*/