SHstation SHstation

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 #include #include void pick(int itemSize, int* bucket, int bucketSize, int k) { //중복 조합 int i, lastIndex, smallest, item; if (k == 0) { for (i = 0; i

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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 #include #define WIDTH 10 #define HEIGHT 10 int screen[WIDTH][HEIGHT] = { 0, 0, 0,-1,-1,-1,-1,-1,-1,-1, -1,-1, 0,-1,-1,-1,-1,-1,-1,-1, -1, 0, 0, 0, 0, 0, 0,-1,-1,-1, -1,-1,-1,-1, 0,-1, 0,-1,-1,-1, -1,-1,-1,-1, 0,-1, 0,..

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 #include int main(void) { int num, num1, num2, result = 0, i = 0; scanf("%d %d", &num1, &num2); while (num1 > 0 || num2 > 0) { num = num1 % 10 + num2 % 10; if (i == 1) { num++; i = 0; } if (num >= 10) { result++; i = 1; } num1 /= 10; num2 /= 10; } printf("%d", result); } Colored by Color Scripter cs 결과:

배열의 크기와 배열, 키값을 입력받은후 키가 배열내에 없으면 -1을 있으면 그 인덱스를 출력한다. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 #include int main(void) { int i, n, num; int arr[100]; scanf("%d", &n); for (i = 0; i

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 #include #include #include int solution(int n) { int i; for (i = 2; i

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 32 33 34 35 36 37 38 39 #include int isPalindrome(char s[]) { int i, j, k = 0; char str[30]; for (i = 0; s[i] != '\0'; i++) { if (isupper(s[i])) { str[k] = tolower(s[i]); k++; } else if (isalpha(s[i])) { str[k] = s[i]; k++; } } str[k] = '\0'; for (j = 0; j

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 #include int main(void) { int num, i, result; scanf("%d", &num); if (num == 1) printf("2"); else printf("%d", Zeck(num)); } int Zeck(int n) { int i; for (i = 0; i

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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 #include int main(void) { int num, i, result; scanf("%d", &num); printf("%d", Zeck(num)); } int Zeck(int n) { int i, result = 0; if (n == 1) return 2; for (i = 0; i