sol1.c File Reference

Problem 5 solution - Naive algorithm (slowest) More...

#include <stdio.h>
#include <stdlib.h>

Include dependency graph for sol1.c:

Functions
static char	check_number (unsigned long long n)
	Pretty naive implementation. More...
int	main (void)
	Main function. More...

Detailed Description

Problem 5 solution - Naive algorithm (slowest)

See also

Faster: problem_5/sol2.c

Fastest: problem_5/sol3.c

Function Documentation

check_number()

static char check_number ( unsigned long long  n )

static

Pretty naive implementation.

Just checks every number if it's devisable by 1 through 20

Parameters

n	number to check

Returns

0 if not divisible

1 if divisible

{
    for (unsigned long long i = 1; i <= 20; ++i)
    {
        if (n % i != 0)
        {
            return 0;
        }
    }
 
    return 1;
}

main()

int main

(

void

)

Main function.

Returns

0 on exit

{
    for (unsigned long long n = 1;; ++n)
    {
        if (check_number(n))
        {
            printf("Result: %llu\n", n);
            break;
        }
    }
 
    return 0;
}

Here is the call graph for this function: