HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Chapter 3. Repetition structures > problem:


Flowchart 2

Volume problems

• Flowchart 1
• Flowchart 2
• Flowchart 3
• Sum until 0
• Sum less than N
• Sum of N numbers
• The power of 2
• 01. How many digits?
• 02. How many divisors?
• 04. Train

Feedback

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

Time limit 100/100/100/100 ms. Memory limit 65000/65000/65000/65000 Kb.

Write a C++ program according to the flowchart and output values of a and b at the end.


Для отправки решений необходимо выполнить вход.

www.contester.ru