Cod sursa(job #3292865)
Utilizator | Data | 9 aprilie 2025 15:34:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <bits/stdc++.h>
#define VMAX 2000005
#define INF 2147000000
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int ciur[VMAX];
int main()
{
int n,m,i,j,k,t,q,nr,minim,maxim,st,dr,mij;
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j*i<=n;j++)
ciur[i*j]++;
}
fout<<ciur[n]<<'\n';
return 0;
}