HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Chapter 2. Decision structures > problem:


05. Find the biggest 2

Volume problems

• 01. a
• 02. Sign
• 04. Leap Year
• 05. Find the biggest 2
• 06. Find the biggest 3
• 1. a

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 500/500/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.

Given 2 integer numbers. Find the biggest one among them.

cin cout
3 10 10
40 15 40
Для отправки решений необходимо выполнить вход.

www.contester.ru