Pagini recente » Cod sursa (job #2183557) | Cod sursa (job #60732) | Cod sursa (job #775484) | Cod sursa (job #3146837) | Cod sursa (job #1250776)
#include<iostream>
#include<fstream>
using namespace std;
ifstream g("sum.in");
ofstream f("sum.out");
int x[100], n, co = 0, s = 0;
void funct(int n)
{
int d = 2, p = 0;
while(n != 1)
{
while(n % d == 0)
{
n /= d;
p = 1;
}
if(p != 0)
{
x[co] = d;
co++;
}
d++;
p = 0;
}
d = 2;
p = 0;
}
void biti()
{
int bit[100003] = { 0 };
funct(n);
for(int i = 0; i < co; i++)
{
for(int j = x[i]; j <= n * 2; j+=x[i])
bit[j] = 1;
}
for(int i = 1; i <= n * 2; i++)
if(bit[i] == 0)
s += i;
f << s << "\n";
}
int main()
{
int a;
g >> a;
for(int i = 0; i < a; i++)
{
g >> n;
biti();
co = 0;
s = 0;
}
}