Cod sursa(job #364636)
Utilizator | Data | 16 noiembrie 2009 18:06:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream.h>
#include<fstream.h>
#include<math.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,k,ct,p=0,r=0,ct2;
int main(){
f>>n;
k=2;
while(k<=sqrt(n)+1){
r=k;
for(i=2;i<sqrt(k);i++)
if((k%i==0)&&(k!=i))
ct++;
if(ct==0)
ct2++;
ct=0,p=0,r=0;
k++;}
g<<ct2;}