Cod sursa(job #2356356)
Utilizator | Data | 26 februarie 2019 17:13:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
bool p[2000000];
int i,n,nr,j;
ifstream f("eratostene.in");
ofstream g("eratostene.out");
int main()
{
f>>n;
for(i=2;i<=n;i++)
{
g<<nr;
f>>nr;
if(n==0)
nr=1;
if(p[i]==0)
else
}
{
while(n)
}
{
nr++;
n=n/10;
{
for(j=i+i;j<+n;j=j+1)
p[j]=1;
}
g<<nr;
}
return 0;
}