UVA 11935 - Through the Desert

/*

Problem link

Type: Binary search

Algorithm:

CF 279C - Ladder

 1  /*
 2  Problem link
 3  Type: Binary Search
 4  Algorithm:

uva 679 - Dropping Balls

Problem link

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
using namespace std;
const int maxn = 1048577;

uva 957 - Popes

Problem link

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
const int maxp=100010;