main.cpp

//The problem definition is above this window press "Open Window" to see it better
//TODO use the compile & run button to learn how the testing system works

#include <iostream>
#include <stdlib.h> //.h

const int MAX_NUMS = 61;

//Comparator function as suggested by c++ refernce man
int cmp (const void * a, const void * b)
{
  if ( *(unsigned long long*)a <  *(unsigned long long*)b ) return -1;
  if ( *(unsigned long long*)a == *(unsigned long long*)b ) return 0;
  if ( *(unsigned long long*)a >  *(unsigned long long*)b ) return 1;

  return -1;
}

int main()
{
  // Don't be afraid to make changes!!
  int num_elements;
  std::cin >> num_elements;
  unsigned long long* arr = new unsigned long long[num_elements]; //Some of the suggested nums are too big for int, I changed type
  int i = 0;

  // Input
  for (i = 0; i < num_elements; i++)
  {
    std::cin >> arr[i];
  }
  //Now i have an array of ints

  unsigned long long *result = new unsigned long long[num_elements];

  //The challenge says to only have to do this correctly for the first 60 fib numbers
  //So its either cheating or good test taking, but ill compute the first 61 and store them in 
  //an array and just pick the first element of a greater than a[i]
  unsigned long long *fibs = new unsigned long long[MAX_NUMS + 1];

  //I assume the convention that the first fib number is 0
  //If you work off the convention that the first is 1, my program will not correctly solve your test case 60
  //Maybe ill write code for this later
  fibs[0] = 0;
  fibs[1] = 1;

  for(i = 2; i < MAX_NUMS + 1; i++)
  {
    fibs[i] = fibs[i-1] + fibs[i-2];
  }

  //Im going to switch to pointer arithmatic for arrays
  //The test did array versions, but Id rather do pointer, so here is the switch
  //Now I have a list of fib numbers
  // Output
  int j = 0;
  for (i = 0; i < num_elements; i++)
  {
      j = 0;
      while(arr[i] > fibs[j])
      {
        j++;
      } 

      if(arr[i] == fibs[j])
        result[i] = fibs[j+1];
      result[i] = fibs[j];
      if(result[i] == 1) 
        result[i]++;
      if(result[i] == 2)
        result[i]++;
      std::cout << result[i] << std::endl;
  }

  delete[] arr;


  return 0;
}