Cod sursa(job #2099217)
| Utilizator | Data | 4 ianuarie 2018 10:57:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
int n,i,k=0;
in>>n;
for(i=2; i*i<=n; i++)
{
if(n%i==0)
k++;
}
if(k!=0)
out << k;
return 0;
}
