Cattle off network - Puzzles 1

Do not learn, play games, doing puzzles

 

 

 

Puzzle 1:

Magic 20 * 20 * 20, 8000 a small cube, if stripping the outermost layer, but also the number of squares remaining?

Solution: stripped layer, the cube edge length -2, answer = 18 * 18 * 18 = 5832

 

Puzzles 2:

Two rings, radii are 1 and 2, the small circle within the great circle great circle around the circumference of the week, the small round their turn to ask for a few weeks? If their turn in the great circle of a few weeks it outside, small round?

solution:

= Distance of the center of the displacement movement of the ball

Movement inside the small circle distance = 2π * (2-1) = 2π = 1 circumferential

Movement distance outside the small circle = 2π * (2 + 1) = 6π = 3 circumferential

 

Puzzles 3:

A, B two playing charades, rules of the game are as follows:
A select a number between [1,100] B back on paper, then let B begin to guess; guess if small B, A will be prompted to B the guess is too small; once a particular guess B is too large, no longer prompts a, B after the small a guess would no longer be prompted only answer was right or not. I ask: B at least to guess () times in order to ensure guessed?

solution:

The first guess is assumed that N (big), the second biggest need guess N-1, N-2 requires maximum three times

Corresponds to a tolerance of arithmetic sequence 1: N (N + 1) / 2 ≥ 100

N = 14

 

Puzzles 4:

solution:

1. Horizontally , each row of each color has three grid , the third row dark gray and light gray grid has three, then? At the black grid must be 3

(B,D,E,F,G)

2. Horizontally, three grid is a vertical cross-2, then? At the black must be cross

(D,F,G)

3. The two-dimensional array of black, know each number 3, Items 2 1 3 3 3 3

深灰的二维数组为:[(2,3,2),(1,1,3),(3,1,x)]     

浅灰的二维数组为:[(1,2,3),(3,2,2),(1,3,x)]

黑色的二维数组为:[(3,1,1),(2,3,1),(2,2,3)]   

所以深灰色?处为2,浅灰色?处为1

选:F

 

智力题 5:

有十张扑克牌,每次可以只出一张,也可以只出两张,要出完有多少种出法

解:

def count(n):
    if n < 1:
        return -1
    elif n == 1:
        return 1
    elif n == 2:
        return 2
    else:
        return count(n-2) + count(n-1)
print(count(10))
输出:89(种)

 

持续更新......

 

Guess you like

Origin www.cnblogs.com/hhs1998/p/11781515.html