Pagini recente » Cod sursa (job #2144129) | Cod sursa (job #2029702) | Cod sursa (job #2877947) | Cod sursa (job #2487409) | Cod sursa (job #2528046)
#include <bits/stdc++.h>
#define input "sumdiv.in"
#define output "sumdiv.out"
#define NMAX 100005
#define MOD 666013
using namespace std;
typedef long long ll;
ifstream in(input);
ofstream out(output);
ll B, E;
vector < ll > primes;
bool uz[NMAX];
ll fasto_expo(ll base, ll exp)
{
if(!exp) return 1;
if(exp == 1) return base;
if(exp % 2 == 1) return base * fasto_expo(base * base, exp / 2);
return fasto_expo(base * base, exp / 2);
}
void Erastostene()
{
primes.push_back(2);
for(int i = 3; i <= NMAX - 5; i += 2)
if(!uz[i])
{
primes.push_back(i);
for(int j = 3 * i; j <= NMAX - 5; j+= 2 * i)
uz[i] = 1;
}
}
void Read_Data()
{
in >> B >> E;
Erastostene();
}
void Solve()
{
}
void
int main()
{
Read_Data();
return 0;
}