알고리즘/문자와 문자열38 1919 애너그램 만들기 1234567891011121314151617181920212223242526272829#include #include #include int main() { char a[1005] = { 0 }; char b[1005] = { 0 }; scanf("%s %s", &a, &b); int lenA = strlen(a); int lenB = strlen(b); int chkA[123] = { 0 }, chkB[123] = { 0 }, sum = 0; for (int i = 0; i 2020. 1. 4. 2941 크로아티아 알파벳 1234567891011121314151617181920212223242526272829303132#include #include int main() { char arr[105] = { 0 }; scanf("%s", &arr); int rst = 0, len = strlen(arr); for (int i = 0; i 2020. 1. 4. 2902 KMP는 왜 KMP 일까? 123456789101112131415161718192021#include #include int main() { char arr[105] = { 0 }, rst[105] = { 0 }; scanf("%s", &arr); rst[0] = arr[0]; int len = strlen(arr) - 1, idx = 1; for (int i = 1; i 2020. 1. 4. 10988 팰린드롬인지 확인하기 1234567891011121314151617181920212223242526#include #include int main() { char arr[105] = { 0 }; scanf("%s", &arr); int len = strlen(arr) - 1, flag = 0; for (int i = 0; i 2020. 1. 4. 2864 5와6의차이 12345678910111213141516171819202122232425262728293031323334353637383940#include #include #include int toMax(char* arr) { int len = strlen(arr) - 1, sum = 0; for (int i = len; i >= 0; i--) { if (arr[i] == '5') { sum += 6 * pow(10, len - i); } else { sum += ((int)arr[i] - 48) * pow(10, len - i); } } return sum;} int toMin(char* arr) { int len = strlen(arr) - 1, sum = 0; for (int i = len; i >= 0; i.. 2020. 1. 4. 10987 모음의 갯수 123456789101112131415#include #include int main() { char arr[105] = { 0 }; scanf("%s", &arr); int sum = 0; for (int i = 0; i 2020. 1. 4. 1316 그룹 단어 체크 1234567891011121314151617181920212223242526272829303132333435363738#include #include int checker(char* arr) { int chk[200] = { 0 }; int len = strlen(arr), bef = -1; for (int i = 0; i 2020. 1. 4. 5622 다이얼 1234567891011121314151617181920212223242526272829#include #include int toInt(char c) { int intC = (int)c; intC -= 65; int idx = intC / 3 + 2; if (idx > 7) { if (intC == 18) idx = 7; else if (intC 2020. 1. 4. 2908 상수 123456789101112131415161718192021222324252627282930313233343536373839#include #include #include #include char* reverse(char* arr) { int len = strlen(arr); char* rev = (char*)malloc(sizeof(char)*2); for (int i = 0; i 2020. 1. 4. 1157 단어공부 1234567891011121314151617181920212223242526272829303132333435363738#include #include int toBig(char c) { int intC = (int)c; if (intC >= 97) intC -= 32; return intC;} int main() { int chk[100] = {}, maxN = 0, maxIdx = -1, flag = 0; char arr[1000001]; scanf("%s", &arr); int len = strlen(arr); for (int i = 0; i 2020. 1. 3. 11654 아스키 코드 12345678#include int main() { char a; scanf("%c", &a); printf("%d", (int)a);}cs 2020. 1. 3. blurred vision 더블릿 123456789101112131415161718192021222324252627#include int arr[20][20] = { 0 }; int main() { char stend[10]; int a, b; scanf("%s %d %d", stend, &a, &b); for(int j = 0 ; j 2019. 3. 1. 이전 1 2 3 4 다음