Book of tasks on programming. Old version

 

 by Aliaksandr N. Prykhodzka

 

текстовый, program, перемещение максимального элемента, диаграмма, author, alphabet, address, лабораторный, unit, label, макрос, динамический, uses
 

for valuable work you must have JavaScript (allow active content)

Pascal. Pc.11. Nest of tasks. Algorithms. Tasks of Дьюдени

 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

Pc.11.1     Answer

Task about ten digits. Place all ten digits 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 in such order that resulting number divided to all numbers from 2 to 18. Write step-by-step algorithm for solving this task.


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

Pc.11.2     Answer

Three and seven. Find least number having the following properties. This number must consist of digits 3 and 7 only, this number and sum of its digits must be divided to 3 and 7. Write step-by-step algorithm for solving this task.


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

Pc.11.3     Answer

In order return. Find nine-digit number satisfying the following condition. Multiplication of this number and number 123456789 produces number having low-order digits 987654321. Write step-by-step algorithm for solving this task.


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

Pc.11.4     Answer

Digit squares. Place nine dibs with digits from 1 to 9 in row. Replace them by minimum moves in such order that digits form square of integer number. Write step-by-step algorithm for solving this task.


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

Pc.11.5     Answer

Digits and squares. Find the least and the largest square containing all digits from 0 to 9, every digit occurs one time only. Write step-by-step algorithm for solving this task.


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

Pc.11.6     Answer

Сколькими способами можно разместить девять бочек в три яруса так, чтобы числа (цифры от 1 до 9) написанные на бочках, расположенных справа от любой из бочек или под ней, были больше числа, написанного на самой бочке. Написать пошаговый алгоритм, который решает эту задачу.


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

Pc.11.7     Answer

Digits instead of letters. We have expression ABCD*EFGHI=ACGEFHIBD. Every letter signify own digit from 1 to 9 (no zero). Replace letters by digits so this equality will be correct. Write step-by-step algorithm.


 

©   Aliaksandr Prykhodzka    1993 - 2007