일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |
Tags
- 10953
- codesingal
- C++
- til
- cpp
- adjacentElementsProduct
- Sequential Search
- data_structure
- almostIncreasingSequence
- Python
- markdown
- centuryFromYear
- 2015 봄학기 알고리즘
- Daily Commit
- 백준
- Counting cells in a blob
- 수 정렬하기
- 피보나치 수
- 2750
- recursion
- matrixElementsSum
- Numpy
- collections.deque
- All Longest Strings
- codesignal
- 파이썬 포렌식
- baekjun
- 파이썬머신러닝완벽가이드
- flask
- shapeArea
Archives
- Today
- Total
목록shapeArea 1
Introfor

[Intro] shapeArea
Below we will define an n-interesting polygon. Your task is to find the area of a polygon for a given n. A 1-interesting polygon is just a square with a side of length 1. An n-interesting polygon is obtained by taking the n - 1-interesting polygon and appending 1-interesting polygons to its rim, side by side. You can see the 1-, 2-, 3- and 4-interesting polygons in the picture below. 그림에서 보면 알 수..
Programming_prob/Codesignal
2020. 7. 18. 16:10