(14)

int prim(int n)
{
int d = 2, ok = 1;

if (n == 1 ) ok = 0;
else
{
while (d * d <= n && ok == 1)
{
if (n % d == 0) ok = 0;
else d++;
}
}

if (ok == 1) return 1;
else return 0;
}

(16)

int sum_div(int n)
{
int d = 1, s = 0;

while (d <= n/2)

{
if(n % d == 0) s += d;
d++;
}

s += n;

return s;
}

(27)

int nr_cif_zero(int n)
{
int nr = 0, aux = n;

while (n > 0)
{
if (n % 10 == 0) nr++;
n /= 10;
}

if (aux == 0) return 1;
else return nr;
}

(113)

int nr_cif(int n, int k)

{
int nr = 0;
 while (n > 0)
{
if(n % 10 > 0) if (k % (n % 10) == 0) nr++;
n /= 10;
}

return nr;
}

(1442)

int sum_cifra_control(int a, int b)

{
int nr = 0, i, aux1, s, aux2;

for (i = a; i <= b; i++)

{
aux1 = i;
while (aux1 > 9)
{
s = 0;
aux2 = aux1;
while (aux2 > 0)
{
s += aux2 % 10;
aux2 /= 10;
}
aux1 = s;
}

if (aux1 == a) nr++;
}

return nr;
}

(76)

int UCP(int n)
{
int ok = 1;

while (n > 0 && ok == 1)

{
if (n % 2 == 0)
{
ok = 0;
return n % 10;
}

n /= 10;
}
if (ok == 1) return -1;
}

(36)

#include <iostream>
using namespace std;

int i_prim(int n)
{
int i, d, ok, p1, p2;

for (i = 2; i <= n; i++)

{
d = 2;
ok = 1;
while (d * d <= i && ok == 1)
{
if (i % d == 0) ok = 0;
else d++;
}

if (ok == 1) p1 = i;
}

ok = 0;
for (i = n; ok == 0; i++)
{
d = 2;
ok = 1;
while (d * d <= i && ok == 1)
{
if (i % d == 0) ok = 0;
else d++;
}

if (ok == 1) p2 = i;
}

return p2 - p1;
}

(904)

int concat(int a, int b)

{

int inv = 0;
while (b > 0)
{
inv = inv * 10 + b % 10;
b /= 10;
}

while (inv > 0)

{
a = a * 10 + inv % 10;
inv /= 10;
}

return a;
}