diff --git "a/minyokim/BOJ/0. bronze/1/1157_\353\213\250\354\226\264\352\263\265\353\266\200.c" "b/minyokim/BOJ/0. bronze/1/1157_\353\213\250\354\226\264\352\263\265\353\266\200.c" new file mode 100644 index 0000000..9e9a33d --- /dev/null +++ "b/minyokim/BOJ/0. bronze/1/1157_\353\213\250\354\226\264\352\263\265\353\266\200.c" @@ -0,0 +1,46 @@ +#include +#include + +#define MAX(a, b) ((a) > (b) ? (a) : (b)) + +int main(void) +{ + char word[1000000]; + char alpha[] = "abcdefghijklmnopqrstuvwxyz"; + char Alpha[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; + int count[26] = {0}; + int max; + int max_index; + int check = 0; + int str_len; + + scanf("%s", word); + str_len = strlen(word); + for (int i = 0; i < str_len; i++) + for (int j = 0; j < 26; j++) + if (word[i] == alpha[j] || word[i] == Alpha[j]) + count[j]++; + + max = count[0]; + max_index = 0; + for (int i = 1; i < 26; i++) + max = MAX(max, count[i]); + + for (int i = 0; i < 26; i++) + { + if (max == count[i]) + { + check++; + max_index = i; + } + } + + if (check != 1) + { + printf("?"); + return 0; + } + + printf("%c", Alpha[max_index]); + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/1/2750_\354\210\230\354\240\225\353\240\254\355\225\230\352\270\260.c" "b/minyokim/BOJ/0. bronze/1/2750_\354\210\230\354\240\225\353\240\254\355\225\230\352\270\260.c" new file mode 100644 index 0000000..f4a2ecc --- /dev/null +++ "b/minyokim/BOJ/0. bronze/1/2750_\354\210\230\354\240\225\353\240\254\355\225\230\352\270\260.c" @@ -0,0 +1,28 @@ +#include +#include + +void swap(int *a, int *b) +{ + int temp = *a; + *a = *b; + *b = temp; +} + +int main(void) +{ + int N; + int *arr; + + scanf("%d", &N); + arr = (int *)malloc(sizeof(int) * N); + for (int i = 0; i < N; i++) + scanf("%d", &arr[i]); + for (int i = N - 1; i > 0; i--) + for (int j = 0; j < i; j++) + if (arr[j] > arr[j + 1]) + swap(&arr[j], &arr[j + 1]); + for (int i = 0; i < N; i++) + printf("%d\n", arr[i]); + + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/10809_\354\225\214\355\214\214\353\262\263\354\260\276\352\270\260.c" "b/minyokim/BOJ/0. bronze/2/10809_\354\225\214\355\214\214\353\262\263\354\260\276\352\270\260.c" new file mode 100644 index 0000000..aba78b3 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/10809_\354\225\214\355\214\214\353\262\263\354\260\276\352\270\260.c" @@ -0,0 +1,28 @@ +#include +#include + +int main(void) +{ + char word[101]; + char alphabet[] = "abcdefghijklmnopqrstuvwxyz"; + int flag; + + scanf("%s", word); + + for (int i = 0; i < 26; i++) + { + flag = 0; + for (int j = 0; j < strlen(word); j++) + { + if (alphabet[i] == word[j]) + { + printf("%d ", j); + flag = 1; + break; + } + } + if (flag == 0) + printf("-1 "); + } + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/10870_\355\224\274\353\263\264\353\202\230\354\271\230\354\210\2305.c" "b/minyokim/BOJ/0. bronze/2/10870_\355\224\274\353\263\264\353\202\230\354\271\230\354\210\2305.c" new file mode 100644 index 0000000..6a915d7 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/10870_\355\224\274\353\263\264\353\202\230\354\271\230\354\210\2305.c" @@ -0,0 +1,21 @@ +#include + +int fibonacci(int n) +{ + if (n == 0) + return 0; + if (n == 1) + return 1; + if (n == 2) + return 1; + return (fibonacci(n - 1) + fibonacci(n - 2)); +} +int main(void) +{ + int n; + + scanf("%d", &n); + printf("%d", fibonacci(n)); + + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/1152_\353\213\250\354\226\264\354\235\230\352\260\234\354\210\230.c" "b/minyokim/BOJ/0. bronze/2/1152_\353\213\250\354\226\264\354\235\230\352\260\234\354\210\230.c" new file mode 100644 index 0000000..df73009 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/1152_\353\213\250\354\226\264\354\235\230\352\260\234\354\210\230.c" @@ -0,0 +1,24 @@ +#include +#include + +int main(void) +{ + char str[1000000]; + int count = 1; + int i = 0; + + scanf("%[^\n]s", str); + if (str[0] == ' ') + count--; + if (str[strlen(str) - 1] == ' ') + count--; + while (str[i]) + { + if (str[i] == ' ') + count++; + i++; + } + printf("%d", count); + + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/11720_\354\210\253\354\236\220\354\235\230\355\225\251.c" "b/minyokim/BOJ/0. bronze/2/11720_\354\210\253\354\236\220\354\235\230\355\225\251.c" new file mode 100644 index 0000000..c7778c1 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/11720_\354\210\253\354\236\220\354\235\230\355\225\251.c" @@ -0,0 +1,21 @@ +#include +#include + +int main(void) +{ + int num; + char *arr; + int result = 0; + + scanf("%d", &num); + + arr = (char *)malloc(sizeof(char) * num); + scanf("%s", arr); + + for (int i = 0; i < num; i++) + { + result += arr[i] - '0'; + } + + printf("%d", result); +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/15596_\354\240\225\354\210\230N\352\260\234\354\235\230\355\225\251.c" "b/minyokim/BOJ/0. bronze/2/15596_\354\240\225\354\210\230N\352\260\234\354\235\230\355\225\251.c" new file mode 100644 index 0000000..71bd86c --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/15596_\354\240\225\354\210\230N\352\260\234\354\235\230\355\225\251.c" @@ -0,0 +1,12 @@ +#include + +long long sum(int *a, int n) +{ + long long ans = 0; + + for (int i = 0; i < n; i++) + { + ans += a[i]; + } + return ans; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/2231_\353\266\204\355\225\264\355\225\251.c" "b/minyokim/BOJ/0. bronze/2/2231_\353\266\204\355\225\264\355\225\251.c" new file mode 100644 index 0000000..d7c6919 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/2231_\353\266\204\355\225\264\355\225\251.c" @@ -0,0 +1,27 @@ +#include + +int bucket[1000000]; + +int ft_bucket(int n) +{ + int sum = n; + int temp = n; + while (n) + { + sum += n % 10; + n /= 10; + } + if (sum <= 1000000 && bucket[sum - 1] == 0) + bucket[sum - 1] = temp; +} + +int main(void) +{ + int N; + + scanf("%d", &N); + for (int i = 1; i < 1000000; i++) + ft_bucket(i); + + printf("%d", bucket[N - 1]); +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/2675_\353\254\270\354\236\220\354\227\264\353\260\230\353\263\265.c" "b/minyokim/BOJ/0. bronze/2/2675_\353\254\270\354\236\220\354\227\264\353\260\230\353\263\265.c" new file mode 100644 index 0000000..440f242 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/2675_\353\254\270\354\236\220\354\227\264\353\260\230\353\263\265.c" @@ -0,0 +1,21 @@ +#include +#include + +int main(void) +{ + int T; + int R; + char str[20]; + + scanf("%d", &T); + for (int n = 0; n < T; n++) + { + scanf("%d %s", &R, &str); + for (int i = 0; i < strlen(str); i++) + { + for (int j = 0; j < R; j++) + printf("%c", str[i]); + } + printf("\n"); + } +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/2798_\353\270\224\353\236\231\354\236\255.c" "b/minyokim/BOJ/0. bronze/2/2798_\353\270\224\353\236\231\354\236\255.c" new file mode 100644 index 0000000..0c47e03 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/2798_\353\270\224\353\236\231\354\236\255.c" @@ -0,0 +1,34 @@ +#include +#define MAX(a, b) (a >= b ? a : b) + +int main(void) +{ + int N; + int M; + int card[100]; + int comb[161700]; + int n = 0; + int count = 0; + int max; + + scanf("%d %d", &N, &M); + + for (int i = 0; i < N; i++) + scanf("%d", &card[i]); + + for (int i = 0; i < N - 2; i++) + for (int j = i + 1; j < N - 1; j++) + for (int k = j + 1; k < N; k++) + if (card[i] + card[j] + card[k] <= M) + { + comb[n] = card[i] + card[j] + card[k]; + count++; + n++; + } + + max = comb[0]; + for (int i = 1; i < count; i++) + max = MAX(max, comb[i]); + printf("%d", max); + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/2908_\354\203\201\354\210\230.c" "b/minyokim/BOJ/0. bronze/2/2908_\354\203\201\354\210\230.c" new file mode 100644 index 0000000..8dc9a49 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/2908_\354\203\201\354\210\230.c" @@ -0,0 +1,26 @@ +#include + +int main(void) +{ + char num1[4]; + char num2[4]; + + scanf("%s%s", num1, num2); + for (int i = 2; i >= 0; i--) + { + if (num1[i] == num2[i]) + continue; + if (num1[i] > num2[i]) + { + for (int j = 2; j >= 0; j--) + printf("%d", num1[j] - '0'); + return 0; + } + else + { + for (int j = 2; j >= 0; j--) + printf("%d", num2[j] - '0'); + return 0; + } + } +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/2/5622_\353\213\244\354\235\264\354\226\274.c" "b/minyokim/BOJ/0. bronze/2/5622_\353\213\244\354\235\264\354\226\274.c" new file mode 100644 index 0000000..7d3bbb8 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/2/5622_\353\213\244\354\235\264\354\226\274.c" @@ -0,0 +1,32 @@ +#include + +int main(void) +{ + char word[16]; + int result = 0; + int i = 0; + scanf("%s", word); + while (word[i]) + { + if (word[i] >= 'A' && word[i] <= 'C') + result += 3; + if (word[i] >= 'D' && word[i] <= 'F') + result += 4; + if (word[i] >= 'G' && word[i] <= 'I') + result += 5; + if (word[i] >= 'J' && word[i] <= 'L') + result += 6; + if (word[i] >= 'M' && word[i] <= 'O') + result += 7; + if (word[i] >= 'P' && word[i] <= 'S') + result += 8; + if (word[i] >= 'T' && word[i] <= 'V') + result += 9; + if (word[i] >= 'W' && word[i] <= 'Z') + result += 10; + i++; + } + printf("%d", result); + + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/3/10872_\355\214\251\355\206\240\353\246\254\354\226\274.c" "b/minyokim/BOJ/0. bronze/3/10872_\355\214\251\355\206\240\353\246\254\354\226\274.c" new file mode 100644 index 0000000..7e48c47 --- /dev/null +++ "b/minyokim/BOJ/0. bronze/3/10872_\355\214\251\355\206\240\353\246\254\354\226\274.c" @@ -0,0 +1,19 @@ +#include + +int factorial(int N) +{ + int result = N; + + if (N == 1 || N == 0) + return 1; + return (result * factorial(N - 1)); +} +int main(void) +{ + int N; + + scanf("%d", &N); + printf("%d", factorial(N)); + + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/0. bronze/5/11654_\354\225\204\354\212\244\355\202\244\354\275\224\353\223\234.c" "b/minyokim/BOJ/0. bronze/5/11654_\354\225\204\354\212\244\355\202\244\354\275\224\353\223\234.c" new file mode 100644 index 0000000..5d6cdab --- /dev/null +++ "b/minyokim/BOJ/0. bronze/5/11654_\354\225\204\354\212\244\355\202\244\354\275\224\353\223\234.c" @@ -0,0 +1,9 @@ +#include + +int main(void) +{ + char i; + + scanf("%s", &i); + printf("%d", i); +} \ No newline at end of file diff --git "a/minyokim/BOJ/1. silver/4/1065_\355\225\234\354\210\230.c" "b/minyokim/BOJ/1. silver/4/1065_\355\225\234\354\210\230.c" new file mode 100644 index 0000000..e10887d --- /dev/null +++ "b/minyokim/BOJ/1. silver/4/1065_\355\225\234\354\210\230.c" @@ -0,0 +1,8 @@ +#include + +int main(void) +{ + int N; + + scanf("%d", &N); +} \ No newline at end of file diff --git "a/minyokim/BOJ/1. silver/4/10816_\354\210\253\354\236\220\354\271\264\353\223\2342.c" "b/minyokim/BOJ/1. silver/4/10816_\354\210\253\354\236\220\354\271\264\353\223\2342.c" new file mode 100644 index 0000000..3aa281f --- /dev/null +++ "b/minyokim/BOJ/1. silver/4/10816_\354\210\253\354\236\220\354\271\264\353\223\2342.c" @@ -0,0 +1,27 @@ +#include + +int bucket[20000001]; + +int main(void) +{ + int N; + int M; + int A; + int a; + + scanf("%d", &N); + for (int i = 0; i < N; i++) + { + scanf("%d", &A); + bucket[10000000 + A]++; + } + + scanf("%d", &M); + for (int i = 0; i < M; i++) + { + scanf("%d", &a); + printf("%d\n", bucket[10000000 + a]); + } + + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/1. silver/4/10816_\354\210\253\354\236\220\354\271\264\353\223\2342_bsearch.c" "b/minyokim/BOJ/1. silver/4/10816_\354\210\253\354\236\220\354\271\264\353\223\2342_bsearch.c" new file mode 100644 index 0000000..f6a816a --- /dev/null +++ "b/minyokim/BOJ/1. silver/4/10816_\354\210\253\354\236\220\354\271\264\353\223\2342_bsearch.c" @@ -0,0 +1,70 @@ +#include +#include + +int bin_search(int *A, int N, int a) +{ + int pl = 0; + int pr = N - 1; + int pc; + int count = 0; + + while (pl <= pr) + { + pc = (pl + pr) / 2; + if (A[pc] == a) + { + if (pc - 1 >= 0 && A[pc - 1] == a) + { + while (A[pc] == a) + pc--; + pc += 1; + } + while (A[pc] == a) + { + pc++; + count++; + } + return count; + } + else if (A[pc] < a) + pl = pc + 1; + else + pr = pc - 1; + } + return 0; +} + +int compare(const void *a, const void *b) +{ + int n1 = *(int *)a; + int n2 = *(int *)b; + + if (n1 == n2) + return 0; + return (n1 - n2); +} + +int main(void) +{ + int N; + int M; + int *A; + int *arr; + + scanf("%d", &N); + A = (int *)malloc(sizeof(int) * N); + for (int i = 0; i < N; i++) + scanf("%d", &A[i]); + + scanf("%d", &M); + arr = (int *)malloc(sizeof(int) * M); + for (int i = 0; i < M; i++) + scanf("%d", &arr[i]); + + qsort(A, N, sizeof(arr[0]), compare); + + for (int i = 0; i < M; i++) + printf("%d\n", bin_search(A, N, arr[i])); + + return 0; +} \ No newline at end of file diff --git "a/minyokim/BOJ/1. silver/4/1920_\354\210\230\354\260\276\352\270\260.c" "b/minyokim/BOJ/1. silver/4/1920_\354\210\230\354\260\276\352\270\260.c" new file mode 100644 index 0000000..ec42e61 --- /dev/null +++ "b/minyokim/BOJ/1. silver/4/1920_\354\210\230\354\260\276\352\270\260.c" @@ -0,0 +1,49 @@ +#include +#include + +int bin_search(int *A, int N, int a) +{ + int pl = 0; + int pr = N - 1; + int pc; + + while (pl <= pr) + { + pc = (pl + pr) / 2; + if (A[pc] == a) + return 1; + else if (A[pc] < a) + pl = pc + 1; + else + pr = pc - 1; + } + return 0; +} + +int compare(const void *a, const void *b) +{ + return (*(int *)a > *(int *)b); +} + +int main(void) +{ + int N; + int M; + int A[100000]; + int arr[100000]; + + scanf("%d", &N); + for (int i = 0; i < N; i++) + scanf("%d", &A[i]); + + scanf("%d", &M); + for (int i = 0; i < M; i++) + scanf("%d", &arr[i]); + + qsort(A, N, sizeof(arr[0]), compare); + + for (int i = 0; i < M; i++) + printf("%d\n", bin_search(A, N, arr[i])); + + return 0; +} \ No newline at end of file diff --git a/minyokim/BOJ/1. silver/4/test.c b/minyokim/BOJ/1. silver/4/test.c new file mode 100644 index 0000000..77ba774 --- /dev/null +++ b/minyokim/BOJ/1. silver/4/test.c @@ -0,0 +1,107 @@ +#include +#include + +#define SIZE 2000000 + +typedef struct s_queue +{ + int arr[SIZE]; + int start; + int end; +} t_queue; + +t_queue queue; + +void push(int n) +{ + if (queue.start == -1) + { + queue.start = 0; + queue.end = 0; + queue.arr[0] = n; + } + else + { + queue.end = (queue.end + 1) % SIZE; + queue.arr[queue.end] = n; + } +} + +void pop() +{ + if (queue.start == queue.end) + { + printf("%d\n", queue.arr[queue.start]); + queue.start = -1; + queue.end = -1; + } + else if (queue.start == -1) + printf("-1\n"); + else + { + printf("%d\n", queue.arr[queue.start]); + queue.start = (queue.start + 1) % SIZE; + } +} + +void size() +{ + if (queue.start == -1) + printf("0\n"); + else + printf("%d\n", (SIZE + queue.end - queue.start + 1) % SIZE); +} + +void empty() +{ + if (queue.start == -1) + printf("1\n"); + else + printf("0\n"); +} + +void front() +{ + if (queue.start == -1) + printf("-1\n"); + else + printf("%d\n", queue.arr[queue.start]); +} + +void back() +{ + if (queue.end == -1) + printf("-1\n"); + else + printf("%d\n", queue.arr[queue.end]); +} + +int main() +{ + queue.start = -1; + queue.end = -1; + + char str[100]; + int n; + int num; + scanf("%d", &n); + for (int i = 0; i < n; i++) + { + scanf("%s", str); + if (strcmp(str, "push") == 0) + { + scanf("%d", &num); + push(num); + } + else if (strcmp(str, "pop") == 0) + pop(); + else if (strcmp(str, "size") == 0) + size(); + else if (strcmp(str, "empty") == 0) + empty(); + else if (strcmp(str, "front") == 0) + front(); + else if (strcmp(str, "back") == 0) + back(); + } +} \ No newline at end of file diff --git a/minyokim/BOJ/1. silver/4/test.exe b/minyokim/BOJ/1. silver/4/test.exe new file mode 100644 index 0000000..aaf981a Binary files /dev/null and b/minyokim/BOJ/1. silver/4/test.exe differ diff --git a/minyokim/BOJ/silver/10989.c "b/minyokim/BOJ/1. silver/5/10989_\354\210\230\354\240\225\353\240\254\355\225\230\352\270\2603.c" similarity index 100% rename from minyokim/BOJ/silver/10989.c rename to "minyokim/BOJ/1. silver/5/10989_\354\210\230\354\240\225\353\240\254\355\225\230\352\270\2603.c" diff --git a/minyokim/BOJ/silver/1181.c "b/minyokim/BOJ/1. silver/5/1181_\353\213\250\354\226\264\354\240\225\353\240\254.c" similarity index 100% rename from minyokim/BOJ/silver/1181.c rename to "minyokim/BOJ/1. silver/5/1181_\353\213\250\354\226\264\354\240\225\353\240\254.c" diff --git a/minyokim/BOJ/silver/2751.c "b/minyokim/BOJ/1. silver/5/2751_\354\210\230\354\240\225\353\240\254\355\225\230\352\270\2602.c" similarity index 100% rename from minyokim/BOJ/silver/2751.c rename to "minyokim/BOJ/1. silver/5/2751_\354\210\230\354\240\225\353\240\254\355\225\230\352\270\2602.c" diff --git "a/minyokim/BOJ/1. silver/5/2941_\355\201\254\353\241\234\354\225\204\355\213\260\354\225\204\354\225\214\355\214\214\353\262\263.c" "b/minyokim/BOJ/1. silver/5/2941_\355\201\254\353\241\234\354\225\204\355\213\260\354\225\204\354\225\214\355\214\214\353\262\263.c" new file mode 100644 index 0000000..4cfe9f4 --- /dev/null +++ "b/minyokim/BOJ/1. silver/5/2941_\355\201\254\353\241\234\354\225\204\355\213\260\354\225\204\354\225\214\355\214\214\353\262\263.c" @@ -0,0 +1,61 @@ +#include + +int main(void) +{ + char word[101]; + int i = 0; + char a; + char b; + int count = 0; + int flag; + + scanf("%s", word); + while (word[i] && word[i + 1]) + { + a = word[i]; + b = word[i + 1]; + flag = 0; + + if (a == 'c' && (b == '=' || b == '-')) + { + count += 1; + i += 2; + flag = 1; + } + else if (a == 'd') + { + if (b == 'z' && word[i + 2] == '=') + { + count += 1; + i += 3; + flag = 1; + } + else if (b == '-') + { + count += 1; + i += 2; + flag = 1; + } + } + else if ((a == 'l' || a == 'n') && b == 'j') + { + count += 1; + i += 2; + flag = 1; + } + else if ((a == 's' || a == 'z') && b == '=') + { + count += 1; + i += 2; + flag = 1; + } + if (flag == 0) + { + count += 1; + i += 1; + } + } + if (word[i] != 0) + count++; + printf("%d", count); +} \ No newline at end of file diff --git "a/minyokim/BOJ/1. silver/5/4673_\354\205\200\355\224\204\353\204\230\353\262\204.c" "b/minyokim/BOJ/1. silver/5/4673_\354\205\200\355\224\204\353\204\230\353\262\204.c" new file mode 100644 index 0000000..ca1f97c --- /dev/null +++ "b/minyokim/BOJ/1. silver/5/4673_\354\205\200\355\224\204\353\204\230\353\262\204.c" @@ -0,0 +1,36 @@ +#include + +int self_num(int *count, int n) +{ + int sum = n; + int store; + + while (sum < 10000) + { + store = sum; + while (store) + { + sum += store % 10; + store = store / 10; + } + count[sum]++; + } +} + +int main(void) +{ + + int count[50000] = {0}; + for (int i = 1; i <= 9972; i++) + { + self_num(count, i); + } + + for (int i = 1; i < 10000; i++) + { + if (count[i] == 0) + printf("%d\n", i); + } + + return 0; +} diff --git "a/minyokim/BOJ/2. gold/16235_\353\202\230\353\254\264\354\236\254\355\205\214\355\201\254.c" "b/minyokim/BOJ/2. gold/16235_\353\202\230\353\254\264\354\236\254\355\205\214\355\201\254.c" new file mode 100644 index 0000000..6da49de --- /dev/null +++ "b/minyokim/BOJ/2. gold/16235_\353\202\230\353\254\264\354\236\254\355\205\214\355\201\254.c" @@ -0,0 +1,13 @@ +#include + +int N, M, K, A[10][10]; + +int main(void) +{ + scanf("%d %d %d", &N, &M, &K); + for (int r = 0; r < N; r++) + for (int c = 0; c < N; c++) + scanf("%d", A[r][c]); + + return 0; +} \ No newline at end of file