\nif((fp = fopen(argv, "r")) == NULL) goto Free;\n<\/pre><\/div>\n\n\nC\u8a00\u8a9e\u306b\u304a\u3044\u3066goto\u306f\u307e\u3063\u305f\u304f\u4f7f\u3063\u3066\u306f\u3044\u3051\u306a\u3044\u308f\u3051\u3067\u306f\u306a\u3044\u3093\u3060\u3051\u3069\u3001\u3053\u3053\u306f\u95a2\u6570\u3092\u5206\u3051\u308b\u3053\u3068\u3067\u81ea\u7136\u306b\u89e3\u6c7a\u3067\u304d\u308b\u3002\u4f7f\u308f\u306a\u3044\u65b9\u304c\u3044\u3044\u3063\u3066\u3069\u3053\u304b\u3067\u898b\u305f\u3068\u601d\u3046\u3051\u308c\u3069\u3001\u5f53\u6642\u306f\u307e\u3060\u77e5\u3089\u306a\u304b\u3063\u305f\u306e\u304b\u306a\u3002<\/p>\n\n\n\n
scanf<\/code>\u304c\u5371\u306a\u3044<\/strong><\/p>\n\n\n\nscanf("%s", &answer);\n<\/pre><\/div>\n\n\n&answer<\/code>\u3058\u3083\u306a\u304f\u3066answer<\/code>\u3067\u826f\u304f\u3066\u3001\u3057\u304b\u3082\u30b5\u30a4\u30ba\u6307\u5b9a\u304c\u306a\u3044\u306e\u3067\u30d0\u30c3\u30d5\u30a1\u30aa\u30fc\u30d0\u30fc\u30d5\u30ed\u30fc\u304c\u8d77\u304d\u308b\u53ef\u80fd\u6027\u304c\u3042\u308b\u3002scanf(\"%255s\", answer)<\/code>\u3068\u66f8\u304f\u3079\u304d\u3068\u3053\u308d\u3060\u3002<\/p>\n\n\n\n&<\/code>\u3092\u4f7f\u3046\u3068\u3044\u3046\u98a8\u306b\u899a\u3048\u3066\u3044\u3066\u3001\u672c\u8cea\u3092\u898b\u3066\u306a\u304b\u3063\u305f\u5178\u578b\u3060\u306a\u3042\u3068\u601d\u3046\u3067\u3057\u304b\u3057\u3002<\/p>\n\n\n\n\u30bd\u30fc\u30c8\u306e\u30ed\u30b8\u30c3\u30af\u304c\u304a\u304b\u3057\u3044<\/strong><\/p>\n\n\n\nif(exam > exam){\n<\/pre><\/div>\n\n\n\u914d\u5217\u306e\u6dfb\u5b57\u3092\u6bd4\u8f03\u3057\u3088\u3046\u3068\u3057\u3066\u3044\u308b\u3093\u3060\u3051\u3069\u3001\u5b9f\u969b\u306b\u306f\u30dd\u30a4\u30f3\u30bf\u306e\u30a2\u30c9\u30ec\u30b9\u3092\u6bd4\u8f03\u3057\u3066\u3044\u3066\u3001\u610f\u56f3\u3057\u305f\u52d5\u304d\u306b\u306a\u3063\u3066\u3044\u306a\u3044\u53ef\u80fd\u6027\u304c\u9ad8\u3044\u3002\u306a\u3093\u3060\u3053\u308c\u306f\u3002<\/p>\n\n\n\n
\n\n\n\n\u30ea\u30d5\u30a1\u30af\u30bf\u30ea\u30f3\u30b0\u3059\u308b\u3068\u3053\u3046\u306a\u308b<\/h3>\n\n\n\n
\u307e\u305a\u5358\u8a9e\u3092\u69cb\u9020\u4f53\u306b\u307e\u3068\u3081\u308b\u3002<\/p>\n\n\n
\ntypedef struct {\n char *japanese;\n char *english;\n} Word;\n\ntypedef struct {\n Word *words;\n int count;\n} WordList;\n<\/pre><\/div>\n\n\n\u65e5\u672c\u8a9e\u3068\u82f1\u8a9e\u3092\u30bb\u30c3\u30c8\u3067\u7ba1\u7406\u3059\u308b\u3053\u3068\u3067\u3001jptr<\/code>\u3068eptr<\/code>\u3068\u3044\u30462\u3064\u306e\u914d\u5217\u3092\u5225\u3005\u306b\u6301\u3061\u6b69\u304b\u306a\u304f\u3066\u6e08\u3080\u3002<\/p>\n\n\n\n\u30d5\u30a1\u30a4\u30eb\u306e\u8aad\u307f\u8fbc\u307f\u306f\u95a2\u6570\u306b\u5207\u308a\u51fa\u3057\u3066\u3001\u30a8\u30e9\u30fc\u51e6\u7406\u3082goto\u306a\u3057\u3067\u66f8\u3051\u308b\u3002<\/p>\n\n\n
\nint load_wordlist(const char *filename, WordList *wl) {\n FILE *fp = fopen(filename, "r");\n if (fp == NULL) {\n fprintf(stderr, "\u30d5\u30a1\u30a4\u30eb\u3092\u958b\u3051\u307e\u305b\u3093: %s\\n", filename);\n return 0;\n }\n \/\/ ...\n fclose(fp);\n return 1;\n}\n<\/pre><\/div>\n\n\n\u30e9\u30f3\u30c0\u30e0\u306a\u51fa\u984c\u9806\u306fFisher-Yates\u3068\u3044\u3046\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3067\u66f8\u3051\u3066\u3001\u3053\u308c\u304c\u4e00\u756a\u304d\u308c\u3044\u306a\u30b7\u30e3\u30c3\u30d5\u30eb\u306e\u65b9\u6cd5\u3089\u3057\u3044\u3002<\/p>\n\n\n
\nvoid shuffle(int *arr, int n) {\n int i, j, tmp;\n for (i = n - 1; i > 0; i--) {\n j = rand() % (i + 1);\n tmp = arr[i];\n arr[i] = arr[j];\n arr[j] = tmp;\n }\n}\n<\/pre><\/div>\n\n\n1\u554f\u51fa\u984c\u3059\u308b\u306e\u3082\u95a2\u6570\u306b\u3057\u3066\u3001\u6b63\u89e3\u306a\u30891\u3001\u4e0d\u6b63\u89e3\u306a\u30890\u3092\u8fd4\u3059\u3088\u3046\u306b\u3059\u308b\u3002<\/p>\n\n\n
\nint ask_question(int stage, const Word *word) {\n char answer[MAX_LEN];\n int miss = 0;\n\n printf("\\n%d\u554f\u76ee\\n%s ? : ", stage, word->japanese);\n\n while (1) {\n scanf("%255s", answer);\n if (strcmp(answer, word->english) == 0) {\n printf("\u305b\u3044\u304b\u3044\uff01\uff01\\n");\n return 1;\n }\n \/\/ ...\n }\n}\n<\/pre><\/div>\n\n\n\u30bd\u30fc\u30c8\u306f\u633f\u5165\u30bd\u30fc\u30c8\u3067\u3061\u3083\u3093\u3068\u66f8\u304d\u76f4\u3059\u3002<\/p>\n\n\n
\nvoid insertion_sort(int *arr, int n) {\n int i, j, key;\n for (i = 1; i < n; i++) {\n key = arr[i];\n j = i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n}\n<\/pre><\/div>\n\n\n
\n\n\n\n\u30ea\u30d5\u30a1\u30af\u30bf\u30ea\u30f3\u30b0\u5f8c\u306e\u30d5\u30eb\u30bd\u30fc\u30b9<\/h3>\n\n\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\n#define MAX_LEN 256\n#define MAX_MISS 5\n\ntypedef struct {\n char *japanese;\n char *english;\n} Word;\n\ntypedef struct {\n Word *words;\n int count;\n} WordList;\n\nvoid free_wordlist(WordList *wl) {\n int i;\n if (wl->words == NULL) return;\n for (i = 0; i < wl->count; i++) {\n free(wl->words[i].japanese);\n free(wl->words[i].english);\n }\n free(wl->words);\n wl->words = NULL;\n wl->count = 0;\n}\n\nint load_wordlist(const char *filename, WordList *wl) {\n int i;\n FILE *fp = fopen(filename, "r");\n if (fp == NULL) {\n fprintf(stderr, "\u30d5\u30a1\u30a4\u30eb\u3092\u958b\u3051\u307e\u305b\u3093: %s\\n", filename);\n return 0;\n }\n\n fscanf(fp, "%d", &wl->count);\n wl->words = calloc(wl->count, sizeof(Word));\n if (wl->words == NULL) { fclose(fp); return 0; }\n\n for (i = 0; i < wl->count; i++) {\n char etemp[MAX_LEN], jtemp[MAX_LEN];\n fscanf(fp, "%s%s", etemp, jtemp);\n wl->words[i].english = strdup(etemp);\n wl->words[i].japanese = strdup(jtemp);\n if (wl->words[i].english == NULL || wl->words[i].japanese == NULL) {\n fclose(fp);\n free_wordlist(wl);\n return 0;\n }\n }\n\n fclose(fp);\n return 1;\n}\n\nvoid shuffle(int *arr, int n) {\n int i, j, tmp;\n for (i = n - 1; i > 0; i--) {\n j = rand() % (i + 1);\n tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp;\n }\n}\n\nint ask_question(int stage, const Word *word) {\n char answer[MAX_LEN];\n int miss = 0;\n\n printf("\\n%d\u554f\u76ee\\n%s ? : ", stage, word->japanese);\n\n while (1) {\n scanf("%255s", answer);\n\n if (strcmp(answer, word->english) == 0) {\n printf("\u305b\u3044\u304b\u3044\uff01\uff01\\n");\n return 1;\n }\n\n printf("\u9593\u9055\u3044\u3067\u3059\u3002\\n\u6b63\u89e3\u3092\u307f\u305f\u3044\u3067\u3059\u304b\uff1f\uff1f yes = 9 : ");\n int choice;\n scanf("%d", &choice);\n\n if (choice == 9) {\n printf("\u6b63\u89e3\u306f%s\u3067\u3059\u3088\u3002\\n\\n", word->english);\n return 0;\n }\n\n if (++miss >= MAX_MISS) {\n printf("\u6b63\u89e3\u306f%s\u3067\u3059\u3088\u3002\\n\\n", word->english);\n return 0;\n }\n\n printf("\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044\\n%s ? : ", word->japanese);\n }\n}\n\nvoid insertion_sort(int *arr, int n) {\n int i, j, key;\n for (i = 1; i < n; i++) {\n key = arr[i];\n for (j = i - 1; j >= 0 && arr[j] > key; j--)\n arr[j + 1] = arr[j];\n arr[j + 1] = key;\n }\n}\n\nint main(int argc, char *argv[]) {\n int i;\n if (argc < 2) {\n fprintf(stderr, "\u4f7f\u3044\u65b9: %s <\u5358\u8a9e\u30d5\u30a1\u30a4\u30eb>\\n", argv[0]);\n return 1;\n }\n\n WordList wl = { NULL, 0 };\n printf("\u30d5\u30a1\u30a4\u30eb\u540d %s\\n", argv[1]);\n\n if (!load_wordlist(argv[1], &wl)) {\n fprintf(stderr, "\u5358\u8a9e\u30d5\u30a1\u30a4\u30eb\u306e\u8aad\u307f\u8fbc\u307f\u5931\u6557\\n");\n return 1;\n }\n\n srand((unsigned)time(NULL));\n\n int *order = malloc(wl.count * sizeof(int));\n int *correct = malloc(wl.count * sizeof(int));\n if (order == NULL || correct == NULL) { free_wordlist(&wl); return 1; }\n\n for (i = 0; i < wl.count; i++) order[i] = i;\n shuffle(order, wl.count);\n\n int ok = 0;\n for (i = 0; i < wl.count; i++) {\n if (ask_question(i + 1, &wl.words[order[i]]))\n correct[ok++] = order[i];\n }\n\n insertion_sort(correct, ok);\n\n printf("\u6b63\u89e3\u3057\u305f\u306e\u306f");\n if (ok == 0) {\n puts("\u306a\u3044\uff01\u3082\u3063\u3068\u304c\u3093\u3070\u308c");\n } else {\n printf("%d\u500b\u3067\u3001", ok);\n for (i = 0; i < ok; i++) printf("%s ", wl.words[correct[i]].japanese);\n puts("");\n }\n\n free(order);\n free(correct);\n free_wordlist(&wl);\n return 0;\n}\n<\/pre><\/div>\n\n\n
\n\n\n\n\u307e\u3068\u3081<\/h3>\n\n\n\n
\u76f4\u3057\u305f\u65b9\u304c\u3044\u3044\u3068\u601d\u3063\u3066\u3044\u305f\u3053\u3068\u306f\u3001\u3061\u3083\u3093\u3068\u76f4\u3057\u3066\u304a\u304f\u3079\u304d\u3060\u3063\u305f\u306a\u3042\u3068\u601d\u3046\u3001\u5f53\u6642\u306e\u81ea\u5206\u306b\u8a00\u3044\u305f\u3044\u3068\u3044\u3046\u304b\u3001\u3067\u3082\u5f53\u6642\u306e\u81ea\u5206\u306f\u305f\u3076\u3093\u6b21\u306b\u884c\u304f\u3053\u3068\u3067\u982d\u304c\u3044\u3063\u3071\u3044\u3067\u3001\u76ee\u6a19\u306f\u30bd\u30b1\u30c3\u30c8inC\u3092\u8aad\u3080\u3068\u3044\u3046\u3053\u3068\u3060\u3063\u305f\u3057\u3001\u305d\u308c\u306f\u3061\u3083\u3093\u3068\u5f53\u6642\u9054\u6210\u3057\u3066\u3044\u305f\u306e\u3067\u3001\u6025\u3044\u3067\u884c\u304b\u306a\u3044\u3068\u3044\u3051\u306a\u3044\u3053\u3068\u304c\u305f\u304f\u3055\u3093\u3042\u3063\u305f\u3093\u3060\u308d\u3046\u300112\u5e74\u8d8a\u3057\u306b\u5411\u304d\u5408\u3048\u305f\u306e\u3067\u3088\u3057\u3068\u3057\u3088\u3046\u3002<\/p>\n