projecteuler

Problem : There is an m x n grid. One can only move either down or right at any point in time. One is trying to reach the bottom-right corner of the grid. How many possible unique paths are there? (project euler problem 15) The similar question has been asked in Cracking the coding interview: Here we have to count the unique paths, but there we have to find the unique paths. [Read More]

//p104 // Find the Fibonacci sequence for which the first nine digits and the last nine digits are 1-9 pandigital #include #include char number_string[100000]; char isPandigital( unsigned long int num ) { if ( num < 123456789 ) { return 0; }  char num_of_unique_digits = 0;  char number_array[9];  unsigned long int temp = num;  int i; int j;  for ( i = 0; i < 9; i++ ) [Read More]