# Please count!!!! SRO-O-O-ChNO!!!! Near the river there live only green and pestrenky young frogs (there are no young frogs of other flowers). It is known, chtoyesl a young frog green, he is cheerful; all pestrenky young frogs sit ashore. Choose statements which can be true. 1. All green young frogs — veselye2. The green young frog sitting on beregu3 can meet. All young frogs sitting ashore — grustnye4. If young frog cheerful, then it zelenyy5. Can meet cheerful pestrenkiya lyagushonok6. The green young frog sitting on beregu7 can meet. All pestrenky young frogs — grustnye8. In water it is possible to see pestrenky lyagushonka9. All young frogs sitting ashore — pestrenky

Toambugzh

345

А: if a young frog green, then he is cheerful; Б: vsepestrenky young frogs sit ashore. 1. Truly, since. And. 2. It can be true since it is not told where green young frogs 3 sit. It can be true since it is not told that green young frogs can be all ashore at once, and it is not told that pyostrenky there cannot be all sad. 4. It can be true since conditions do not exclude that pyostrenky all can be sad at once. 5. It can be true since it is not told that pyostrenky have to be sad. 6. It can be true since it is not told where green young frogs 7 have to sit. Perhaps, since it is not told that pyostrenky young frogs cannot be all sad at once. 8. It cannot be true since B 9. It can be true since conditions do not exclude that green young frogs can all at once is ashore.

32

Answer add
Dora

### Other questions in the section - informatics

Siopenmik

The line of symbols is given. To determine length of a line. If length

2020-10-26 10:00:32

Kirik

3 different lines of symbols are given. To define the longest line and to

2020-10-26 10:00:32

Kemapisva

3. N natural numbers of a1, a2 are set, …, aN (), each of

2020-10-26 10:00:32

Burizel

Make the Pascal language program for the solution of the following task. Enter 3

2020-10-26 10:00:32

Evsevievich