일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- recursion
- 10953
- Counting cells in a blob
- shapeArea
- 파이썬머신러닝완벽가이드
- Sequential Search
- almostIncreasingSequence
- markdown
- Numpy
- 2015 봄학기 알고리즘
- collections.deque
- C++
- baekjun
- 백준
- matrixElementsSum
- 파이썬 포렌식
- centuryFromYear
- cpp
- codesignal
- 수 정렬하기
- codesingal
- data_structure
- Daily Commit
- Python
- til
- flask
- 피보나치 수
- adjacentElementsProduct
- 2750
- All Longest Strings
- Today
- Total
Introfor
12345678910111213141516171819202122232425262728293031#define BUFFER_SIZE 20 int read_line(char str[], int n); #include int main(){ char buffer[BUFFER_SIZE]; while (1) { printf("$ "); int len = read_line(buffer, BUFFER_SIZE); printf("%s:%d\n", buffer, len); } return 0; } int read_line(char str[], int limt) { int ch, i = 0; while ((ch = getchar()) != '\n') if (i
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816..