fork download
copy 
  1. #include <stdio.h>
  2.  
  3. #define PREFECTURE_NUM 100
  4. #define TRUE 1
  5. #define FALSE 0
  6. #define Num(a) sizeof(a)/sizeof(a[0])
  7.  
  8. typedef struct {
  9.   char            head;
  10.   char            tail;
  11.   int             str_len;
  12. }               word;
  13.  
  14. void            calc(int idx);
  15. int             calc_current(int idx);
  16.  
  17. word prefects[] = {
  18.   {'ｱ', 'ｳ',1}, {'ｱ', 'ｹ',1}, {'ｱ', 'ﾀ',1},
  19.   {'ｲ', 'ﾛ',1}, {'ｴ', 'ﾏ',1}, {'ｺ', 'ﾚ',1},
  20.   {'ﾃ', 'ﾐ',1}, {'ｵ', 'ﾉ',1}, {'ﾀ', 'ｺ',12},
  21.   {'ﾔ', 'ｷ',1}, {'ﾙ', 'ﾜ',1}, {'ｻ', 'ﾜ',1},
  22.   {'ｺ', 'ﾐ',1}, {'ｺ', 'ﾜ',1}, {'ﾏ', 'ﾀ',1},
  23.   {'ｶ', 'ﾊ',1}, {'ｺ', 'ﾊ',1}, {'ｶ', 'ﾉ',1},
  24.   {'ｺ', 't',1}, {'ｼ', 'ﾊ',1}, {'ｶ', 'ﾘ',1},
  25.   {'ｶ', 'ﾆ',1}, {'ｶ', 'ｻ',1}, {'ｼ', 'ﾉ',1},
  26.   {'ﾅ', 'ﾀ',1}, {'ﾂ', 'ｳ',1}, {'ﾚ', 'ﾊ',1},
  27.   {'ﾗ', 'ｹ',1}, {'ｺ', 'ﾐ',1}, {'ﾅ', 'ｶ',1},
  28.   {'ﾐ', 'ｸ',1}, {'ﾆ', 'ﾓ',1}, {'ﾉ', 'ｷ',1},
  29.   {'ﾘ', 'ﾁ',1}, {'ﾆ', 'ﾊ',1}, {'ｺ', 'ｺ',1},
  30.   {'ﾋ', 'ｷ',1}, {'ﾐ', 'ｶ',1}, {'ﾊ', 'ﾏ',1},
  31.   {'ﾐ', 'ﾁ',1}, {'ｱ', 'ﾚ',1}, {'ﾐ', 'ﾊ',1},
  32.   {'ｷ', 'ｶ',1}, {'ﾕ', 'ﾕ',1}, {'ﾁ', 'ｱ',1},
  33.   {'ﾔ', 'ｾ',1}, {'ﾊ', 'ﾛ',1}
  34. };
  35.  
  36. int             pattern[PREFECTURE_NUM] = {0};
  37. int            *p_idx = pattern;
  38. int             max_len = 0;
  39. int             pattern_save[PREFECTURE_NUM];
  40. int             used[PREFECTURE_NUM];
  41.  
  42. void
  43. pp()
  44. {
  45.   int             i;
  46.   printf("pattern: ");
  47.   for (i = 0; pattern_save[i] >= 0; i++)
  48.     printf("%d ", pattern_save[i]);
  49. }
  50.  
  51. void
  52. save()
  53. {
  54.   int             i = PREFECTURE_NUM;
  55.   while (i--)
  56.     pattern_save[i] = pattern[i];
  57. }
  58.  
  59. int
  60. main()
  61. {
  62.   int             i;
  63.  
  64.   for (i = 0; i < Num(prefects); i++)
  65.     used[i] = FALSE;
  66.   calc(-1);
  67.   printf("max string length: %d\n", max_len);
  68.   pp();
  69.  
  70.   calc_current(max_len);
  71.  
  72.   return 0;
  73. }
  74.  
  75. void
  76. calc(int idx)
  77. {
  78.   int             i, w;
  79.  
  80.   for (i = 0; i < Num(prefects); i++) {
  81.     if (idx < 0)
  82.       calc(i);
  83.     else {
  84.       used[idx] = TRUE;
  85.       *p_idx++ = idx;
  86.       *p_idx = -1;
  87.       if (used[i] == FALSE &&
  88.           prefects[i].head == prefects[idx].tail)
  89.         calc(i);
  90.       used[idx] = FALSE;
  91.       p_idx--;
  92.     }
  93.     w = calc_current(p_idx - pattern + 1);
  94.     if (max_len < w) {
  95.       max_len = w;
  96.       save();
  97.     }
  98.   }
  99. }
  100.  
  101. int
  102. calc_current(int idx)
  103. {
  104.   int             r = 0;
  105.  
  106.   while (idx--)
  107.     r += prefects[idx].str_len;
  108.  
  109.   return r;
  110. }
Success #stdin #stdout 0.03s 1720KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
max string length: 29
pattern: 29 17 32 42 20 33 44 40 26 38 14 8 35 12 37 21 34 46
https://ideone.com/S4fbi
language:
C (gcc 8.3)
created:
12 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!