蓝桥杯算法提高VIP-特殊的质数肋骨 （C语言代码）打表

解题思路: 先用暴力的方法把结果全部跑出来，然后打表输出就可以了，其它方法没想到QWQ

参考代码:

#include <stdio.h>

int main(){
 int a[9][17] = {
  {0},
  {3,2,3,5,7},
  {8,23,29,31,37,53,59,71,73,79},
  {13,233,239,293,311,313,317,373,379,593,599,719,733,739,797},
  {15,2333,2339,2393,2399,2939,3119,3137,3733,3739,3793,3797,5939,7193,7331,7333,7393},
  {14,23333,23339,23399,23993,29399,31193,31379,37337,37339,37397,59393,59399,71933,73331,73939},
  {11,233993,239933,293999,373379,373393,593933,593993,719333,739391,739393,739397,739399},
  {7,2339933,2399333,2939999,3733799,5939333,7393913,7393931,7393933},
  {4,23399339,29399999,37337999,59393339,73939133}
 }; 
 int i,n;
 
 scanf("%d", &n);
 for(i = 1; i <= a[n][0]+1; i++)
  printf("%d\n", a[n][i]);
 
 return 0;
}