Algorithms_in_C 1.0.0
Set of algorithms implemented in C.

Problem 15 solution More...
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
Functions  
unsigned long long  number_of_paths (int N) 
At every node, there are 2 possible ways to move > down or right.  
int  main (int argc, char **argv) 
Main function.  
Problem 15 solution
int main  (  int  argc, 
char **  argv  
) 
Main function.
unsigned long long number_of_paths  (  int  N  ) 
At every node, there are 2 possible ways to move > down or right.
Since it is a square grid, there are in all, 2N steps with N down and N right options, without preference for order. Hence, the path can be be traced in N out of 2N number of ways. This is the same as binomial coeeficient.