Find a looped path through the diagram subject to the following
constraints. The path proceeds from one cell to an adjacent cell, passes
through no cell more than once, does not go through any numbered cells,
and never makes a sharp-angled turn (i.e., a turn at a 60o angle). Each number indicates how many of the adjacent cells are part of the path.


댓글 2개
게시글 목록
| 번호 | 제목 |
|---|---|
| 1989 | |
| 1988 | |
| 1987 | |
| 1986 | |
| 1985 | |
| 1984 | |
| 1983 | |
| 1982 | |
| 1981 | |
| 1980 | |
| 1979 | |
| 2064 | |
| 1968 | |
| 2065 | |
| 1967 | |
| 1971 | |
| 1963 | |
| 1932 | |
| 1880 | |
| 1877 | |
| 1871 | |
| 1885 | |
| 1870 | |
| 1876 | |
| 1869 | |
| 1873 | |
| 1868 | |
| 1887 | |
| 1948 | |
| 1867 |
댓글 작성
댓글을 작성하시려면 로그인이 필요합니다.
로그인하기