質問編集履歴

2番目のコードが100点を取れたコードです。よろしくお願いいたします。

2021/08/22 09:23

投稿

whitehorse85921

スコア34

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -96,6 +96,338 @@
 ```C
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <stddef.h>
+typedef struct {
+    char user[100];
+    char blood[100];
+    char blood2[100];
+    char fortune[100];
+} User;
+//ハッシュ表
+typedef struct {
+    User **data;
+    unsigned int size;
+} HASHTABLE;
+unsigned int MakeHash2(char* str, unsigned int hashmax)
+{
+    unsigned int n, length, hash, weight;
+    length = strlen(str);
+    for (n = weight = hash = 0; n < length; n++, weight++) {
+        if (weight > 7) {
+            weight = 0;
+        }
+        hash += (int)str[n] << (4 * weight);
+    }
+    return hash % hashmax;
+}
+unsigned int ReHash(HASHTABLE *hashtable, unsigned int firsthash)
+{
+    unsigned int hashval, k;
+    for (k = 1; k <= hashtable->size / 2; k++) {
+        hashval = (firsthash + k * k) % hashtable -> size;
+        if (hashtable->data[hashval] == NULL) {
+            return hashval;
+        }
+    }
+    return -1;
+}
+void AddDataToMap(HASHTABLE *hashtable, User *newdata)
+{
+    unsigned int hashval;
+    hashval = MakeHash2(newdata->user, hashtable->size);
+    if (hashtable->data[hashval] != NULL) {
+        hashval = ReHash(hashtable, hashval);
+        if (hashval == -1) {
+            return;
+        }
+    }
+    hashtable->data[hashval] = newdata;
+}
+char *GetDataFromMap(HASHTABLE *hashtable, char *key)
+{
+    unsigned int hashval, k;
+    User *word;
+    hashval = MakeHash2(key, hashtable->size);
+    for (k = 0; k <= hashtable->size / 2; k++) {
+        word = hashtable->data[(hashval + k * k) % hashtable->size];
+        if (word != NULL) {
+            if (strcmp(key, word->user) == 0) {
+                return word->blood;
+            }
+        }
+    }
+    return NULL;
+}
+char *GetDataFromMap2(HASHTABLE *hashtable, char *key)
+{
+    unsigned int hashval, k;
+    User *word;
+    hashval = MakeHash2(key, hashtable->size);
+    for (k = 0; k <= hashtable->size / 2; k++) {
+        word = hashtable->data[(hashval + k * k) % hashtable->size];
+        if (word != NULL) {
+            if (strcmp(key, word->blood2) == 0) {
+                return word->fortune;
+            }
+        }
+    }
+    return NULL;
+}
+void IniHashTable(HASHTABLE *hashtable, unsigned int size)
+{
+    hashtable->data = (User**)malloc(sizeof(User*) * size);
+    memset(hashtable->data, NULL, sizeof(User*) * size);
+    hashtable->size = size;
+}
+void CleanupHashTable(HASHTABLE *hashtable)
+{
+    free(hashtable->data);
+    hashtable->size = 0;
+}
+void PrintAllData(HASHTABLE *hashtable)
+{
+    unsigned int n;
+    for (n = 0; n < hashtable->size; n++) {
+        if (hashtable->data[n] != NULL) {
+            printf("%s\n", hashtable->data[n]->fortune);
+        }
+    }
+}
+int main(void)
+{
+    char *blood, *blood2;
+    HASHTABLE hashtable;
+    IniHashTable(&hashtable, 503);
+    char target[100];
+    scanf("%s", target);
+    int n;
+    scanf("%d", &n);
+    User u[n];
+    for (int i = 0; i < n; i++) {
+        scanf("%s%s", u[i].user, u[i].blood);
+    }
+    int m;
+    scanf("%d", &m);
+    for (int i = 0; i < m; i++) {
+        scanf("%s%s", u[i].blood2, u[i].fortune);
+    }
+    for (int i = 0; i < n; i++) {
+        AddDataToMap(&hashtable, &u[i]);
+    }
+    blood = GetDataFromMap(&hashtable, target);
+    blood2 = GetDataFromMap2(&hashtable, blood);
+    if (blood2 != NULL) {
+        printf("%s\n", blood2);
+    }
+    CleanupHashTable(&hashtable);
+    return 0;
+}
+```
+```C
 //エラーはなくなっていませんが100点を取れたコードです。
 #include <stdio.h>
@@ -114,11 +446,17 @@
     char blood[100];
+} User;
+typedef struct {
     char blood2[100];
     char fortune[100];
-} User;
+} Result;
@@ -132,6 +470,16 @@
 } HASHTABLE;
+typedef struct {
+    Result **data2;
+    unsigned int size2;
+} HASHTABLE2;
 unsigned int MakeHash2(char* str, unsigned int hashmax)
@@ -140,7 +488,7 @@
     unsigned int n, length, hash, weight;
     length = strlen(str);
@@ -168,7 +516,7 @@
     unsigned int hashval, k;
     for (k = 1; k <= hashtable->size / 2; k++) {
@@ -188,17 +536,43 @@
+unsigned int ReHash2(HASHTABLE2 *hashtable, unsigned int firsthash)
+{
+    unsigned int hashval, k;
+    for (k = 1; k <= hashtable->size2 / 2; k++) {
+        hashval = (firsthash + k * k) % hashtable -> size2;
+        if (hashtable->data2[hashval] == NULL) {
+            return hashval;
+        }
+    }
+    return -1;
+}
 void AddDataToMap(HASHTABLE *hashtable, User *newdata)
 {
     unsigned int hashval;
     hashval = MakeHash2(newdata->user, hashtable->size);
     if (hashtable->data[hashval] != NULL) {
@@ -218,6 +592,36 @@
+void AddDataToMap2(HASHTABLE2 *hashtable, Result *newdata)
+{
+    unsigned int hashval;
+    hashval = MakeHash2(newdata->blood2, hashtable->size2);
+    if (hashtable->data2[hashval] != NULL) {
+        hashval = ReHash(hashtable, hashval);
+        if (hashval == -1) {
+            return;
+        }
+    }
+    hashtable->data2[hashval] = newdata;
+}
 char *GetDataFromMap(HASHTABLE *hashtable, char *key)
 {
@@ -226,11 +630,11 @@
     User *word;
     hashval = MakeHash2(key, hashtable->size);
     for (k = 0; k <= hashtable->size / 2; k++) {
@@ -254,23 +658,23 @@
-char *GetDataFromMap2(HASHTABLE *hashtable, char *key)
+char *GetDataFromMap2(HASHTABLE2 *hashtable, char *key)
 {
     unsigned int hashval, k;
-    User *word;
+    Result *word;
-    hashval = MakeHash2(key, hashtable->size);
+    hashval = MakeHash2(key, hashtable->size2);
-    for (k = 0; k <= hashtable->size / 2; k++) {
+    for (k = 0; k <= hashtable->size2 / 2; k++) {
-        word = hashtable->data[(hashval + k * k) % hashtable->size];
+        word = hashtable->data2[(hashval + k * k) % hashtable->size2];
         if (word != NULL) {
@@ -300,7 +704,7 @@
     hashtable->data = (User**)malloc(sizeof(User*) * size);
     memset(hashtable->data, NULL, sizeof(User*) * size);
@@ -310,6 +714,22 @@
+void IniHashTable2(HASHTABLE2 *hashtable, unsigned int size)
+{
+    hashtable->data2 = (User**)malloc(sizeof(User*) * size);
+    memset(hashtable->data2, NULL, sizeof(User*) * size);
+    hashtable->size2 = size;
+}
 void CleanupHashTable(HASHTABLE *hashtable)
 {
@@ -322,17 +742,29 @@
+void CleanupHashTable2(HASHTABLE2 *hashtable)
+{
+    free(hashtable->data2);
+    hashtable->size2 = 0;
+}
-void PrintAllData(HASHTABLE *hashtable)
+void PrintAllData(HASHTABLE2 *hashtable)
 {
     unsigned int n;
-    for (n = 0; n < hashtable->size; n++) {
+    for (n = 0; n < hashtable->size2; n++) {
-        if (hashtable->data[n] != NULL) {
+        if (hashtable->data2[n] != NULL) {
-            printf("%s\n", hashtable->data[n]->fortune);
+            printf("%s\n", hashtable->data2[n]->fortune);
         }
@@ -350,23 +782,27 @@
     HASHTABLE hashtable;
+    HASHTABLE2 hashtable2;
     IniHashTable(&hashtable, 503);
+    IniHashTable2(&hashtable2, 503);
     char target[100];
     scanf("%s", target);
     int n;
     scanf("%d", &n);
     User u[n];
@@ -376,33 +812,39 @@
     }
     int m;
     scanf("%d", &m);
+    Result r[m];
     for (int i = 0; i < m; i++) {
-        scanf("%s%s", u[i].blood2, u[i].fortune);
+        scanf("%s%s", r[i].blood2, r[i].fortune);
-    }
+    }
     for (int i = 0; i < n; i++) {
         AddDataToMap(&hashtable, &u[i]);
+        AddDataToMap2(&hashtable2, &r[i]);
-    }
+    }
     blood = GetDataFromMap(&hashtable, target);
-    blood2 = GetDataFromMap2(&hashtable, blood);
+    blood2 = GetDataFromMap2(&hashtable2, blood);
     if (blood2 != NULL) {
@@ -410,15 +852,17 @@
     }
     CleanupHashTable(&hashtable);
+    CleanupHashTable2(&hashtable2);
     return 0;
 }
@@ -426,448 +870,6 @@
-```C
-#include <stdio.h>
-#include <string.h>
-#include <stdlib.h>
-#include <stddef.h>
-typedef struct {
-    char user[100];
-    char blood[100];
-} User;
-typedef struct {
-    char blood2[100];
-    char fortune[100];
-} Result;
-//ハッシュ表
-typedef struct {
-    User **data;
-    unsigned int size;
-} HASHTABLE;
-typedef struct {
-    Result **data2;
-    unsigned int size2;
-} HASHTABLE2;
-unsigned int MakeHash2(char* str, unsigned int hashmax)
-{
-    unsigned int n, length, hash, weight;
-    length = strlen(str);
-    for (n = weight = hash = 0; n < length; n++, weight++) {
-        if (weight > 7) {
-            weight = 0;
-        }
-        hash += (int)str[n] << (4 * weight);
-    }
-    return hash % hashmax;
-}
-unsigned int ReHash(HASHTABLE *hashtable, unsigned int firsthash)
-{
-    unsigned int hashval, k;
-    for (k = 1; k <= hashtable->size / 2; k++) {
-        hashval = (firsthash + k * k) % hashtable -> size;
-        if (hashtable->data[hashval] == NULL) {
-            return hashval;
-        }
-    }
-    return -1;
-}
-unsigned int ReHash2(HASHTABLE2 *hashtable, unsigned int firsthash)
-{
-    unsigned int hashval, k;
-    for (k = 1; k <= hashtable->size2 / 2; k++) {
-        hashval = (firsthash + k * k) % hashtable -> size2;
-        if (hashtable->data2[hashval] == NULL) {
-            return hashval;
-        }
-    }
-    return -1;
-}
-void AddDataToMap(HASHTABLE *hashtable, User *newdata)
-{
-    unsigned int hashval;
-    hashval = MakeHash2(newdata->user, hashtable->size);
-    if (hashtable->data[hashval] != NULL) {
-        hashval = ReHash(hashtable, hashval);
-        if (hashval == -1) {
-            return;
-        }
-    }
-    hashtable->data[hashval] = newdata;
-}
-void AddDataToMap2(HASHTABLE2 *hashtable, Result *newdata)
-{
-    unsigned int hashval;
-    hashval = MakeHash2(newdata->blood2, hashtable->size2);
-    if (hashtable->data2[hashval] != NULL) {
-        hashval = ReHash(hashtable, hashval);
-        if (hashval == -1) {
-            return;
-        }
-    }
-    hashtable->data2[hashval] = newdata;
-}
-char *GetDataFromMap(HASHTABLE *hashtable, char *key)
-{
-    unsigned int hashval, k;
-    User *word;
-    hashval = MakeHash2(key, hashtable->size);
-    for (k = 0; k <= hashtable->size / 2; k++) {
-        word = hashtable->data[(hashval + k * k) % hashtable->size];
-        if (word != NULL) {
-            if (strcmp(key, word->user) == 0) {
-                return word->blood;
-            }
-        }
-    }
-    return NULL;
-}
-char *GetDataFromMap2(HASHTABLE2 *hashtable, char *key)
-{
-    unsigned int hashval, k;
-    Result *word;
-    hashval = MakeHash2(key, hashtable->size2);
-    for (k = 0; k <= hashtable->size2 / 2; k++) {
-        word = hashtable->data2[(hashval + k * k) % hashtable->size2];
-        if (word != NULL) {
-            if (strcmp(key, word->blood2) == 0) {
-                return word->fortune;
-            }
-        }
-    }
-    return NULL;
-}
-void IniHashTable(HASHTABLE *hashtable, unsigned int size)
-{
-    hashtable->data = (User**)malloc(sizeof(User*) * size);
-    memset(hashtable->data, NULL, sizeof(User*) * size);
-    hashtable->size = size;
-}
-void IniHashTable2(HASHTABLE2 *hashtable, unsigned int size)
-{
-    hashtable->data2 = (User**)malloc(sizeof(User*) * size);
-    memset(hashtable->data2, NULL, sizeof(User*) * size);
-    hashtable->size2 = size;
-}
-void CleanupHashTable(HASHTABLE *hashtable)
-{
-    free(hashtable->data);
-    hashtable->size = 0;
-}
-void CleanupHashTable2(HASHTABLE2 *hashtable)
-{
-    free(hashtable->data2);
-    hashtable->size2 = 0;
-}
-void PrintAllData(HASHTABLE2 *hashtable)
-{
-    unsigned int n;
-    for (n = 0; n < hashtable->size2; n++) {
-        if (hashtable->data2[n] != NULL) {
-            printf("%s\n", hashtable->data2[n]->fortune);
-        }
-    }
-}
-int main(void)
-{
-    char *blood, *blood2;
-    HASHTABLE hashtable;
-    HASHTABLE2 hashtable2;
-    IniHashTable(&hashtable, 503);
-    IniHashTable2(&hashtable2, 503);
-    char target[100];
-    scanf("%s", target);
-    int n;
-    scanf("%d", &n);
-    User u[n];
-    for (int i = 0; i < n; i++) {
-        scanf("%s%s", u[i].user, u[i].blood);
-    }
-    int m;
-    scanf("%d", &m);
-    Result r[m];
-    for (int i = 0; i < m; i++) {
-        scanf("%s%s", r[i].blood2, r[i].fortune);
-    }
-    for (int i = 0; i < n; i++) {
-        AddDataToMap(&hashtable, &u[i]);
-        AddDataToMap2(&hashtable2, &r[i]);
-    }
-    blood = GetDataFromMap(&hashtable, target);
-    blood2 = GetDataFromMap2(&hashtable2, blood);
-    if (blood2 != NULL) {
-        printf("%s\n", blood2);
-    }
-    CleanupHashTable(&hashtable);
-    CleanupHashTable2(&hashtable2);
-    return 0;
-}
-```
 ### 試したこと

エラーはなくなっていませんが100点を取れたコードを記載しました。

2021/08/22 09:23

投稿

whitehorse85921

スコア34

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -96,6 +96,8 @@
 ```C
+//エラーはなくなっていませんが100点を取れたコードです。
 #include <stdio.h>
 #include <string.h>
@@ -424,6 +426,448 @@
+```C
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <stddef.h>
+typedef struct {
+    char user[100];
+    char blood[100];
+} User;
+typedef struct {
+    char blood2[100];
+    char fortune[100];
+} Result;
+//ハッシュ表
+typedef struct {
+    User **data;
+    unsigned int size;
+} HASHTABLE;
+typedef struct {
+    Result **data2;
+    unsigned int size2;
+} HASHTABLE2;
+unsigned int MakeHash2(char* str, unsigned int hashmax)
+{
+    unsigned int n, length, hash, weight;
+    length = strlen(str);
+    for (n = weight = hash = 0; n < length; n++, weight++) {
+        if (weight > 7) {
+            weight = 0;
+        }
+        hash += (int)str[n] << (4 * weight);
+    }
+    return hash % hashmax;
+}
+unsigned int ReHash(HASHTABLE *hashtable, unsigned int firsthash)
+{
+    unsigned int hashval, k;
+    for (k = 1; k <= hashtable->size / 2; k++) {
+        hashval = (firsthash + k * k) % hashtable -> size;
+        if (hashtable->data[hashval] == NULL) {
+            return hashval;
+        }
+    }
+    return -1;
+}
+unsigned int ReHash2(HASHTABLE2 *hashtable, unsigned int firsthash)
+{
+    unsigned int hashval, k;
+    for (k = 1; k <= hashtable->size2 / 2; k++) {
+        hashval = (firsthash + k * k) % hashtable -> size2;
+        if (hashtable->data2[hashval] == NULL) {
+            return hashval;
+        }
+    }
+    return -1;
+}
+void AddDataToMap(HASHTABLE *hashtable, User *newdata)
+{
+    unsigned int hashval;
+    hashval = MakeHash2(newdata->user, hashtable->size);
+    if (hashtable->data[hashval] != NULL) {
+        hashval = ReHash(hashtable, hashval);
+        if (hashval == -1) {
+            return;
+        }
+    }
+    hashtable->data[hashval] = newdata;
+}
+void AddDataToMap2(HASHTABLE2 *hashtable, Result *newdata)
+{
+    unsigned int hashval;
+    hashval = MakeHash2(newdata->blood2, hashtable->size2);
+    if (hashtable->data2[hashval] != NULL) {
+        hashval = ReHash(hashtable, hashval);
+        if (hashval == -1) {
+            return;
+        }
+    }
+    hashtable->data2[hashval] = newdata;
+}
+char *GetDataFromMap(HASHTABLE *hashtable, char *key)
+{
+    unsigned int hashval, k;
+    User *word;
+    hashval = MakeHash2(key, hashtable->size);
+    for (k = 0; k <= hashtable->size / 2; k++) {
+        word = hashtable->data[(hashval + k * k) % hashtable->size];
+        if (word != NULL) {
+            if (strcmp(key, word->user) == 0) {
+                return word->blood;
+            }
+        }
+    }
+    return NULL;
+}
+char *GetDataFromMap2(HASHTABLE2 *hashtable, char *key)
+{
+    unsigned int hashval, k;
+    Result *word;
+    hashval = MakeHash2(key, hashtable->size2);
+    for (k = 0; k <= hashtable->size2 / 2; k++) {
+        word = hashtable->data2[(hashval + k * k) % hashtable->size2];
+        if (word != NULL) {
+            if (strcmp(key, word->blood2) == 0) {
+                return word->fortune;
+            }
+        }
+    }
+    return NULL;
+}
+void IniHashTable(HASHTABLE *hashtable, unsigned int size)
+{
+    hashtable->data = (User**)malloc(sizeof(User*) * size);
+    memset(hashtable->data, NULL, sizeof(User*) * size);
+    hashtable->size = size;
+}
+void IniHashTable2(HASHTABLE2 *hashtable, unsigned int size)
+{
+    hashtable->data2 = (User**)malloc(sizeof(User*) * size);
+    memset(hashtable->data2, NULL, sizeof(User*) * size);
+    hashtable->size2 = size;
+}
+void CleanupHashTable(HASHTABLE *hashtable)
+{
+    free(hashtable->data);
+    hashtable->size = 0;
+}
+void CleanupHashTable2(HASHTABLE2 *hashtable)
+{
+    free(hashtable->data2);
+    hashtable->size2 = 0;
+}
+void PrintAllData(HASHTABLE2 *hashtable)
+{
+    unsigned int n;
+    for (n = 0; n < hashtable->size2; n++) {
+        if (hashtable->data2[n] != NULL) {
+            printf("%s\n", hashtable->data2[n]->fortune);
+        }
+    }
+}
+int main(void)
+{
+    char *blood, *blood2;
+    HASHTABLE hashtable;
+    HASHTABLE2 hashtable2;
+    IniHashTable(&hashtable, 503);
+    IniHashTable2(&hashtable2, 503);
+    char target[100];
+    scanf("%s", target);
+    int n;
+    scanf("%d", &n);
+    User u[n];
+    for (int i = 0; i < n; i++) {
+        scanf("%s%s", u[i].user, u[i].blood);
+    }
+    int m;
+    scanf("%d", &m);
+    Result r[m];
+    for (int i = 0; i < m; i++) {
+        scanf("%s%s", r[i].blood2, r[i].fortune);
+    }
+    for (int i = 0; i < n; i++) {
+        AddDataToMap(&hashtable, &u[i]);
+        AddDataToMap2(&hashtable2, &r[i]);
+    }
+    blood = GetDataFromMap(&hashtable, target);
+    blood2 = GetDataFromMap2(&hashtable2, blood);
+    if (blood2 != NULL) {
+        printf("%s\n", blood2);
+    }
+    CleanupHashTable(&hashtable);
+    CleanupHashTable2(&hashtable2);
+    return 0;
+}
+```
 ### 試したこと

多すぎた入力データを削りました。

2021/08/22 09:22

投稿

whitehorse85921

スコア34

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -56,333 +56,7 @@
 x rUW1ZgksZXq5pZey
-s TNA3A
-DzoWEEN6RlGuu17iKaL EQKjgXYQ9
-nMEQpS 4l3AIz3Wz
-QmKiPEfUQzo RkgYvmps4wlgRxG9
-WCprF 9s7IMWesx
-GF7vqk9rn9Bpb c166l
-NzU48nwY5Zfmdy6D KJGlBRt
-16fV13c7jd1WkRxC FoH
-8bBemJ KSE6jTpYBA31MxsiUj
-DsuYTTM7hLsvmkv0Uj WFCd
-jiS8WrXle5Yn34e wXMv
-d a1wJEyBlG9U
-wWWlRa mEiRHWI4sL
-sA3o4XQN7U4Lawyr zK1HgYPyF08Jbks
-wZb XJd39db
-zTE2 Jw0N
-Pi5PX GnQAMeWWQZYTUs1fO8f
-96pA c166l
-b rJrUe0AB8vILgoqTdl
-VHPpmHjDWPK wXMv
-wHntfo21C00OcjVANYi 3JH4g8l6T6VI
-rqApEtkaMmDUh 5XWcTUY7mSV4
-TEZNhL9krYuW9A KJGlBRt
-ZurB XJd39db
-nAphB7hFowF4x jKU6xZfnxH
-AUwq6C Un
-faMxQZJu0 wXMv
-6Zx8QcPSclY5FN S9Avu7e4B7e1eHEAgn
-Ul3acUux RkgYvmps4wlgRxG9
-Ygxq3hiJexy m3z3PbBN0FhiQ7lm
-9iftxHktd5k4L DK7K
-PJ rmcYOrsChsh5H
-leC32JKwZQIVywDmvb jKU6xZfnxH
-Q58l29walHjViPt OZ9UoCoHh0T3
-5 RfMgENaz4uR
-P0Lyf6I yjK
-8Y 1ElIJ9Eq1OTZCcOIaMuW
-tb6ysu6fZQGHc xpHRxsHOVnneIcGO3
-Z8Mt2 rmcYOrsChsh5H
-kPll9ft7Qwi9 rJrUe0AB8vILgoqTdl
-kTdd4 6BFXOV
-gdWvqbAkuSW9T dD5
-LrDQIafQSNi3SV LfYm6SUUN9
-VxF 1ElIJ9Eq1OTZCcOIaMuW
-wTv1X2bbj8Ykf zkoiHgK8HNj5Kb4R5
-bMJmrDq5QnMOMjYo1t wXMv
-hsaWwx6eu td6XxyT
-66lW3QLyxGC45jOJhhl5 rJrUe0AB8vILgoqTdl
-Ti7R9bUsD DK7K
-VQ7JTTn1iRxrNrkew2 Ppj3j8Qj
-aY4stiolg5yEZVAsc2sM RkgYvmps4wlgRxG9
-GvBXsWLn9c11N8M8p C
-a1I8qkgCoF2tuT5Hzt 5XWcTUY7mSV4
-VOIXjKu rmcYOrsChsh5H
-Npi20ctul1m4gNsWMxw SDmAorA7UE1
-TZVXB3fc2EnOQwaC m3z3PbBN0FhiQ7lm
-Ocmp6UV2 fGn0W4
-rem15FnBrIB32e m3z3PbBN0FhiQ7lm
-iL28TaW Un
-OXQlhRRifs1LC9vWm Ppj3j8Qj
-Misiz Ppj3j8Qj
-QP Jw0N
-wKElXVBtHbN dD5
-ER50Kimi td6XxyT
-sn 5XWcTUY7mSV4
-DgrM30ZDRwS3x4mg2 rmcYOrsChsh5H
-INymoR rmcYOrsChsh5H
-6QQu6K81A9MJ RkgYvmps4wlgRxG9
-M9ZPVqyoP wXMv
-nf8sMRPMwLOWStZOpz4s C
-hubnAPY0j58w nm2Ekzwa3
-aWbX8Gr0sDSWGDS m3z3PbBN0FhiQ7lm
-SxtTMeS4agtk Jw0N
-H FoH
-osHephA6bmOAT5sAwo7p pQ2RUxCWDiO
-vgwJ0dByESag nm2Ekzwa3
-d0Ydy0kVP6f 2mqcFvTvHmoZprj0O
-7bYZlEL1wXzjq 9s7IMWesx
-tYdJihvT pDvr6ALO2MrhsDn9h
-tA 3JH4g8l6T6VI
-vZvbDcgKsXGuqt3Z rUW1ZgksZXq5pZey
-6jFanHqpdKsmUFn 6BFXOV
-Yvsv KJGlBRt
-yC dD5
-LiiLHZvDhVE hCXLayIHLK
-f7zu9pcELXg 3
-O0FUhFeAHObarbTB3 No3
-7JonaUhrbODiw vdOI6d
-XVRxdBL1Al1 wXMv
-WN5ESoKov zjsUsGxnFygfRBBMi
-XBy9TEkMwwfwfQJisZe SL0E
-XCO DK7K
-71
+・・・
-pQ2RUxCWDiO I
-rJrUe0AB8vILgoqTdl BygEXoKVtDBG4
-xpHRxsHOVnneIcGO3 TTTzCANKgSt2WMz62E
-C VZLfU724sEVLFsygE1S
-Jw0N D
-zkoiHgK8HNj5Kb4R5 jo4amQhVb22W
-CA48TlP3J63Jdt 8YQIuS08
-gnrzeLLTSO588fI PQ1i
-OZ9UoCoHh0T3 G7QEZ
-1ElIJ9Eq1OTZCcOIaMuW HfbPmS3ET0j
-mEiRHWI4sL LQktSFQe
-fJz2bBKD8WXCGZJmd6 xxLTzvs9UnDKhlc1X
-5XWcTUY7mSV4 P9J
-nm2Ekzwa3 p
-A2t2LG2BB xl7rFdDEC
-Ppj3j8Qj v60xILTw29OV3UpsAeIj
-9s7IMWesx gLKp4G6G2
-KSE6jTpYBA31MxsiUj PS32N
-hCXLayIHLK OGkMe0
-Zb1R81VwrzOlOuOyI8H HG7SQ1vZMii
-dD5 xDQ57FIzqYvC17zk8i5
-FoH 15MO9d6OehefsyRLNxcB
-rmcYOrsChsh5H a1fx6FfisXZ30NCU
-wrerhX J
-S9Avu7e4B7e1eHEAgn VyRX
-jHvgPZLCEviISuh6 PZ1rV
-cUYtUKK2iPv buzMs0zczCOGUWFdAJ4g
-GnQAMeWWQZYTUs1fO8f Hd4P
-c166l tgAp2ZhsJm
-EQKjgXYQ9 6339bAG5mR9SSXpBJgH
-a1wJEyBlG9U EU95TZp83ktEy1pJ3oal
-pDvr6ALO2MrhsDn9h 3lTVVceT
-3JH4g8l6T6VI El3SSUa0Jh7XDnx0r2q
-zK1HgYPyF08Jbks kdRRIdC
-2mqcFvTvHmoZprj0O WSdM2lH8
-3 WZCUk
-jKU6xZfnxH 2PKhlsjfBxsCnGWMJhud
-xhDqoSHQWX6fJ7H 6v
-SDmAorA7UE1 qDMsEzMjjA2zAphXNlBw
-98o4RpHNGu5669e83If aQah83p6H75e
-WFCd 3SSDCXx
-RfMgENaz4uR v5X5w2aTUELU3Nq
-wXMv 8f5z7FXHWl91
-rUW1ZgksZXq5pZey y0oQN
-jFN Dt81
-o8vpv7R IHVV1z2joS
-m3z3PbBN0FhiQ7lm twvfW
-hf9iuGifMQ1Y7 r
-fGn0W4 AzJSqQfQEYMyDMmP5
-SL0E bm0x9uTgeKf1
-KJGlBRt Alma12kTQNlgj
-0D2eqGTYmSCM Xr3lRg
-XJd39db vAYpfVldxuxxq
-j00cuhP16MtVK 9kXDH5Zm
-TNA3A vRG0P3nDm3
-Z PTyeGoTSjTQGBgLfcUP
-yuYGkLmudiPjZmjMN XWvT6SCFzE0swKWTVj
-RkgYvmps4wlgRxG9 aJl5zuoR95KeDm63
-yjK HOT5VUZRBb1HleLz
-DK7K U2kkUtkE8QUB0
-ZK2iRTXnjctB fGX5Q8rrxs
-zjsUsGxnFygfRBBMi SQIEWbQlKQOK3TXK
-59q0nSMc8wGkc2 2laDa4A5oFaeFCL
-4l3AIz3Wz 7Ak7xcF2VR8f14t
-vdOI6d nCSBt
-td6XxyT yYTjBK0uDIL6n48S6EHN
-No3 zb
-Un qRNihN
-NojRPxxW7f Anph4Bb
-6BFXOV KuhwXz
-LfYm6SUUN9 hPFv0is1XoNnLgD