Cod sursa(job #867843)
Utilizator | Data | 30 ianuarie 2013 10:54:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f1("ciur.in");
long n,i,a[100001],j;
int s=0,d,nrp=0;
f1>>n;
for(i=0;i<n-1;i++){
a[i]=i+1;
for(j=1;j<a[i];j++){
d=i%j;
if(d==0)
s++;
}
if(s==2)
nrp++;
s=0;
}
nrp++;
ofstream f2("ciur.out");
f2<<nrp;
}