UVA 10038 - Jolly Jumpers
Problem PDF
Solution:
#include
#include
#include
using namespace std;
int main()
{
int n,c,b[3010],a[3010],i;
while(scanf("%d",&n)==1)
{
c=1;
for(i=0;ihttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10038/10038.cpp
