http://en.wikipedia.org/wiki/Meet-in-the-middle_attack

'Wikipedia':http://en.wikipedia.org/wiki/Meet-in-the-middle_attack

ioi 2001 http://olympiads.win.tue.nl/ioi/ioi2001/contest/day2/double/double.pdf

'IOI 2001 Double':http://olympiads.win.tue.nl/ioi/ioi2001/contest/day2/double/double.pdf

A family of diophantine equations (http://web.mit.edu/~mip/www/probs.html)

'A family of diophantine equations / EQS Baraj ONI 2001':http://web.mit.edu/~mip/www/probs.html

http://www.topcoder.com/stat?c=problem_statement&pm=2226&rd=5851&rm=151088&cr=303185
http://www.topcoder.com/stat?c=problem_statement&pm=6742&rd=10763

problema cerea solutia lexicografic minima pentru o problema a rucsacului unde n era maxim 34 http://www.topcoder.com/tc?module=Static&d1=match_editorials&d2=srm140

'problema cerea solutia lexicografic minima pentru o problema a rucsacului unde n era maxim 34':http://www.topcoder.com/tc?module=Static&d1=match_editorials&d2=srm140

discrete logarithm problem http://en.wikipedia.org/wiki/Baby-step_giant-step

'discrete logarithm problem':http://en.wikipedia.org/wiki/Baby-step_giant-step
 
'UVA 10836':http://acm.uva.es/p/v108/10836.html