새싹교실/2020/이찌반/김재훈 - Revision history

Maintenance script: Repair batch-0006 pages from live compare

2026-03-27T01:08:34Z

Repair batch-0006 pages from live compare

2020-10-12T09:31:33Z

← Older revision		Revision as of 09:31, 12 October 2020
Line 401:		Line 401:

	== Level 2 ==		== Level 2 ==
			=== 주식가격 ===
			#include <stdio.h>
			#include <stdbool.h>
			#include <stdlib.h>

			// prices_len은 배열 prices의 길이입니다.
			int* solution(int prices[], size_t prices_len) {
			// return 값은 malloc 등 동적 할당을 사용해주세요. 할당 길이는 상황에 맞게 변경해주세요.
			int* answer = (int)malloc(sizeof(int) prices_len);
			for(int i = 0; i<prices_len; i++) {
			answer[i] = 0;
			for(int j = i+1; j<prices_len; j++) {
			answer[i]++;
			if(prices[j]<prices[i])
			break;
			}
			}
			return answer;
			}

2020-10-07T12:39:09Z

2020-10-07T12:38:09Z

@@ Line 132: / Line 132: @@
       if(i != 4)
           answer = false;
       return answer;
+  }

2020-10-07T12:18:42Z

@@ Line 325: / Line 325: @@
           answer = false;
       return answer;
+  }

2020-10-07T12:13:07Z

@@ Line 290: / Line 290: @@
+      }
       return -1;
+  }

2020-10-07T12:11:05Z

@@ Line 266: / Line 266: @@
       strcpy(answer, letterOfReturn[num%2]);
       return answer;
+  }

2020-10-07T11:50:32Z

@@ Line 250: / Line 250: @@
+          }
+      }
       return answer;
+  }

2020-10-07T11:37:49Z

@@ Line 225: / Line 225: @@
           answer[i++] = n%10;
           n/=10;
+      }
       return answer;

2020-10-07T11:29:08Z

@@ Line 201: / Line 201: @@
       while(n!=0) {
           answer += n%10;
           n/=10;
+      }