设为首页收藏本站
切换到窄版

鱼C论坛

 找回密码
 立即注册
鱼C论坛»论坛 › 技术交流 › 数据结构与算法 › 欧拉计划（Project Euler） › 题目11：在20×20的网格中同一直线上四个数的最大乘积是 ...
123下一页
返回列表 发新帖
查看: 5832|回复: 46

题目11：在20×20的网格中同一直线上四个数的最大乘积是多少？

[复制链接]
欧拉计划
发表于 2015-4-21 16:13:44 | 显示全部楼层 |阅读模式

马上注册，结交更多好友，享用更多功能^_^

您需要 登录 才可以下载或查看，没有账号？立即注册

x
本帖最后由 欧拉计划 于 2023-6-28 03:01 编辑
Largest product in a grid

In the 20×20 grid below, four numbers along a diagonal line have been marked in red.

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48


The product of these numbers is 26 × 63 × 78 × 14 = 1788696.

What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid?

题目：

在以下这个 20×20 的网格中，四个处于同一对角线上的相邻数字用红色标了出来：

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48


这四个数字的乘积是：26 × 63 × 78 × 14 = 1788696。

在这个 20×20 网格中，处于任何方向上（上，下，左，右或者对角线）的四个相邻数字的乘积的最大值是多少？



评分

参与人数 1荣誉 +1 收起 理由
cwhsmile + 1 15行3, 14行4, 13行5, 12行6，70600674，0..

查看全部评分

想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复

使用道具 举报

翅膀团
发表于 2015-7-26 17:20:30 | 显示全部楼层
本帖最后由 翅膀团 于 2015-11-16 14:13 编辑
  1. #include <stdio.h>

  3.     int num[20][20] = {
  4.                         { 8, 2,22,97,38,15, 0,40, 0,75, 4, 5, 7,78,52,12,50,77,91, 8},
  5.                         {49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48, 4,56,62, 0},
  6.                         {81,49,31,73,55,79,14,29,93,71,40,67,53,88,30, 3,49,13,36,65},
  7.                         {52,70,95,23, 4,60,11,42,69,24,68,56, 1,32,56,71,37, 2,36,91},
  8.                         {22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80},
  9.                         {24,47,32,60,99, 3,45, 2,44,75,33,53,78,36,84,20,35,17,12,50},
  10.                         {32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70},
  11.                         {67,26,20,68, 2,62,12,20,95,63,94,39,63, 8,40,91,66,49,94,21},
  12.                         {24,55,58, 5,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72},
  13.                         {21,36,23, 9,75, 0,76,44,20,45,35,14, 0,61,33,97,34,31,33,95},
  14.                         {78,17,53,28,22,75,31,67,15,94, 3,80, 4,62,16,14, 9,53,56,92},
  15.                         {16,39, 5,42,96,35,31,47,55,58,88,24, 0,17,54,24,36,29,85,57},
  16.                         {86,56, 0,48,35,71,89, 7, 5,44,44,37,44,60,21,58,51,54,17,58},
  17.                         {19,80,81,68, 5,94,47,69,28,73,92,13,86,52,17,77, 4,89,55,40},
  18.                         { 4,52, 8,83,97,35,99,16, 7,97,57,32,16,26,26,79,33,27,98,66},
  19.                         {88,36,68,87,57,62,20,72, 3,46,33,67,46,55,12,32,63,93,53,69},
  20.                         { 4,42,16,73,38,25,39,11,24,94,72,18, 8,46,29,32,40,62,76,36},
  21.                         {20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74, 4,36,16},
  22.                         {20,73,35,29,78,31,90, 1,74,31,49,71,48,86,81,16,23,57, 5,54},
  23.                         { 1,70,54,71,83,51,54,69,16,92,33,48,61,43,52, 1,89,19,67,48}
  24.                      };

  26. int max_Level(void)
  27. {
  28.     int i,j,z,result=1,max=0;
  29.     for(z=0;z<20;z++)
  30.     {
  31.     for(i=0;i<17;i++)
  32.     {
  33.     for(j=0;j<4;j++)
  34.     {
  35.     if(num[z][i] == 0)
  36.     {
  37.         goto Z;
  38.     }
  39.     result *= num[z][i];
  40.     i++;
  41.     }
  42.     if(result > max)
  43.     {
  44.     max = result;
  45.     }
  46.     i = i-4;
  47. Z:  result = 1;
  48.     }
  49.     }
  50.     return max;
  51. }

  53. int max_Vertical(void)
  54. {
  55.     int i,j,z,result=1,max=0;
  56.     for(z=0;z<20;z++)
  57.     {
  58.     for(i=0;i<17;i++)
  59.     {
  60.     for(j=0;j<4;j++)
  61.     {
  62.     if(num[i][z] == 0)
  63.     {
  64.         goto Z;
  65.     }
  66.     result *= num[i][z];
  67.     i++;
  68.     }
  69.     if(result > max)
  70.     {
  71.     max = result;
  72.     }
  73.     i = i-4;
  74. Z:  result = 1;
  75.     }
  76.     }
  77.     return max;
  78. }

  80. int max_Slash_top(void)
  81. {
  82.     int i,j,f,z,result=1,max=0;
  83.     for(f=0;f<17;f++)
  84.     {
  85.     z=0,i=3+f;
  86.     for(;z<1+f;z++,i--)
  87.     {
  88.     for(j=0;j<4;j++)
  89.     {
  90.     if(num[z][i] == 0)
  91.     {
  92.     goto Z;
  93.     }
  94.     result *= num[z][i];
  95.     i--,z++;
  96.     }
  97.     if(result > max)
  98.     {
  99.     max = result;
  100.     }
  101.     z = z-4;
  102.     i = i+4;
  103. Z:  result = 1;
  104.     }
  105.     }
  106.     return max;
  107. }

  109. int max_Slash_below(void)
  110. {
  111.     int i,j,f,z,result=1,max=0;
  112.     for(f=0;f<17;f++)
  113.     {
  114.     z=19,i=16-f;
  115.     for(;z<1+f;z--,i++)
  116.     {
  117.     for(j=0;j<4;j++)
  118.     {
  119.     if(num[z][i] == 0)
  120.     {
  121.     goto Z;
  122.     }
  123.     result *= num[z][i];
  124.     i++,z--;
  125.     }
  126.     if(result > max)
  127.     {
  128.     max = result;
  129.     }
  130.     z = z+4;
  131.     i = i-4;
  132. Z:  result = 1;
  133.     }
  134.     }
  135.     return max;
  136. }

  138. int max_Backslash_top(void)
  139. {
  140.     int i,j,f,z,result=1,max=0;
  141.     for(f=0;f<17;f++)
  142.     {
  143.     z=0,i=16-f;
  144.     for(;z<1+f;z++,i--)
  145.     {
  146.     for(j=0;j<4;j++)
  147.     {
  148.     if(num[z][i] == 0)
  149.     {
  150.     goto Z;
  151.     }
  152.     result *= num[z][i];
  153.     i--,z++;
  154.     }
  155.     if(result > max)
  156.     {
  157.     max = result;
  158.     }
  159.     z = z-4;
  160.     i = i+4;
  161. Z:  result = 1;
  162.     }
  163.     }
  164.     return max;
  165. }

  167. int max_Backslash_below(void)
  168. {
  169.     int i,j,f,z,result=1,max=0;
  170.     for(f=0;f<17;f++)
  171.     {
  172.     z=19,i=3+f;
  173.     for(;z<1+f;z--,i++)
  174.     {
  175.     for(j=0;j<4;j++)
  176.     {
  177.     if(num[z][i] == 0)
  178.     {
  179.     goto Z;
  180.     }
  181.     result *= num[z][i];
  182.     i++,z--;
  183.     }
  184.     if(result > max)
  185.     {
  186.     max = result;
  187.     }
  188.     z = z+4;
  189.     i = i-4;
  190. Z:  result = 1;
  191.     }
  192.     }
  193.     return max;
  194. }

  196. int main(void)
  197. {

  199.     int a,b,c1,c2,d1,d2,max=0;
  200.     a = max_Level();
  201.     b = max_Vertical();
  202.     c1 = max_Slash_top();
  203.     c2 = max_Slash_below();
  204.     d1 = max_Backslash_top();
  205.     d2 = max_Backslash_below();
  206.     if(a > max)
  207.     {
  208.     max = a;
  209.     }
  210.     if(b > max)
  211.     {
  212.     max = b;
  213.     }
  214.     if(c1 > max)
  215.     {
  216.     max = c1;
  217.     }
  218.     if(c2 > max)
  219.     {
  220.     max = c2;
  221.     }
  222.     if(d1 > max)
  223.     {
  224.     max = d1;
  225.     }
  226.     if(d2 > max)
  227.     {
  228.     max = d2;
  229.     }
  230.    
  231.     printf("max=%d\n",max);
  232. }
复制代码


如果有错误希望指出
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

huomqh
发表于 2016-6-13 18:04:34 | 显示全部楼层
  1. juzhen='''08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  2. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  3. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  4. 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  5. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  6. 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  7. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  8. 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  9. 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  10. 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  11. 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  12. 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  13. 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  14. 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  15. 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  16. 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  17. 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  18. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  19. 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  20. 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
  21. '''
  22. list1=[]
  23. list2=[]
  24. list3=[]
  25. i=0
  26. j=0
  27. list1=juzhen.split('\n')
  28. list1.pop()
  29. for i in range(0,20):
  30.     list2.append(list1[i].split(' '))
  31. summax=0
  32. sum1=1
  33. for i in range(0,20):
  34.     list2[i].append('0')
  35.     list2[i].append('0')
  36.     list2[i].append('0')
  37. for i in range(0,23):
  38.     list3.append('0')
  39. for i in range(0,3):
  40.     list2.append(list3)
  41. for i in range(0,20):
  42.     for j in range(0,20):
  43.         sum1=1
  44.         for x in range(0,4):
  45.             sum1*=int(list2[i+x][j+x])
  46.         if sum1>summax:
  47.             summax=sum1
  48.             a,b=i,j
  49. print (summax)
  50. for x in range(0,4):
  51.     print(int(list2[a+x][b+x]),end="*")
复制代码

40304286=94*99*71*61
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 0 反对 1

使用道具 举报

k329266978
发表于 2016-8-15 11:19:31 | 显示全部楼层
  1. #include<stdio.h>
  2. #include<math.h>
  3.         int s[20][20]={
  4.         {8,2,22,97,38,15,0,40,0,75,4,5,7,78,52,12,50,77,91,8},
  5.         {49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,4,56,62,0},
  6.         {81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,3,49,13,36,65},
  7.         {52,70,95,23,4,60,11,42,69,24,68,56,1,32,56,71,37,2,36,91},
  8.         {22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80},
  9.         {24,47,32,60,99,3,45,2,44,75,33,53,78,36,84,20,35,17,12,50},
  10.         {32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70},
  11.         {67,26,20,68,2,62,12,20,95,63,94,39,63,8,40,91,66,49,94,21},
  12.         {24,55,58,5,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72},
  13.         {21,36,23,9,75,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95},
  14.         {78,17,53,28,22,75,31,67,15,94,3,80,4,62,16,14,9,53,56,92},
  15.         {16,39,5,42,96,35,31,47,55,58,88,24,0,17,54,24,36,29,85,57},
  16.         {86,56,0,48,35,71,89,7,5,44,44,37,44,60,21,58,51,54,17,58},
  17.         {19,80,81,68,5,94,47,69,28,73,92,13,86,52,17,77,4,89,55,40},
  18.         {04,52,8,83,97,35,99,16,7,97,57,32,16,26,26,79,33,27,98,66},
  19.         {88,36,68,87,57,62,20,72,3,46,33,67,46,55,12,32,63,93,53,69},
  20.         {04,42,16,73,38,25,39,11,24,94,72,18,8,46,29,32,40,62,76,36},
  21.         {20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,4,36,16},
  22.         {20,73,35,29,78,31,90,1,74,31,49,71,48,86,81,16,23,57,5,54},
  23.         {01,70,54,71,83,51,54,69,16,92,33,48,61,43,52,1,89,19,67,48}};
  24. int Num_Ver,Num_Hor;
  25. void main()
  26. {
  27. int judge(int i,int j,int max,int *p);
  28. int calc_horizontal(int i,int j);
  29. int calc_vertical(int i,int j);
  30. int calc_diagonal(int i,int j);
  31. int calc_max(int a,int b,int c,int max,int *p,int i,int j);
  32. int i,j,max=0,method=0;//about method  1:horizontal 2:vertical 3:calc_diagonal
  33. int *p=&method;
  34. for(i=0;i<20;i++)
  35. for(j=0;j<20;j++)
  36. {
  37. max=judge(i,j,max,p);
  38. }
  39. printf("the max %d\n",max);
  40. if(method==1) printf("the combination was [%d][%d] [%d][%d] [%d][%d] [%d][%d]\n",Num_Ver,Num_Hor,Num_Ver,Num_Hor+1,Num_Ver,Num_Hor+2,Num_Ver,Num_Hor+3);
  41. if(method==2) printf("the combination was [%d][%d] [%d][%d] [%d][%d] [%d][%d]\n",Num_Ver,Num_Hor,Num_Ver+1,Num_Hor,Num_Ver+2,Num_Hor,Num_Ver+3,Num_Hor);
  42. if(method==3) printf("the combination was [%d][%d] [%d][%d] [%d][%d] [%d][%d]\n",Num_Ver,Num_Hor,Num_Ver+1,Num_Hor+1,Num_Ver+2,Num_Hor+2,Num_Ver+3,Num_Hor+3);
  43. }



  47. int judge(int i,int j,int max,int *p)
  48. {
  49. int max1,max2,max3;
  50. max1=(j<=16)?calc_horizontal(i,j):0;
  51. max2=(i<=16)?calc_vertical(i,j):0;
  52. max2=(i<=16&&j<=16)?calc_diagonal(i,j):0;

  54. return calc_max(max1,max2,max3,max,p,i,j);
  55. }

  57. int calc_horizontal(int i,int j)
  58. {
  59. return s[i][j]*s[i][j+1]*s[i][j+2]*s[i][j+3];
  60. }


  63. int calc_vertical(int i,int j)
  64. {
  65. return s[i][j]*s[i+1][j]*s[i+2][j]*s[i+3][j];
  66. }

  68. int calc_diagonal(int i,int j)
  69. {
  70. return s[i][j]*s[i+1][j+1]*s[i+2][j+2]*s[i+3][j+3];
  71. }

  73. int calc_max(int a,int b,int c,int max,int *p,int i,int j)
  74. {
  75. int t,max_0;
  76. t=0,max_0=0;
  77. if(a>b) {max_0=a;t=1;}
  78. else {max_0=b;t=2;}
  79. if(max_0<c) {max_0=c;t=3;}

  81. if(max_0>max) {*p=t;Num_Ver=i;Num_Hor=j;return max_0;}
  82. else return max;
  83. }
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

k329266978
发表于 2016-8-15 11:21:52 | 显示全部楼层
输出答案是[8][10]*[8][11]*[8][12]*[8][13]=78*78*96*83=48477312
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

Plusenxue
发表于 2016-8-26 21:45:32 | 显示全部楼层
  1. juzhen='''08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  2. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  3. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  4. 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  5. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  6. 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  7. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  8. 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  9. 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  10. 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  11. 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  12. 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  13. 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  14. 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  15. 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  16. 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  17. 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  18. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  19. 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  20. 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
  21. '''
  22. newtemp = []
  23. vale = []
  24. temp = juzhen.split('\n',20)
  25. for i in range(20):
  26.     templinei = temp[i].split(' ',19)
  27.     for k in range(20):
  28.         templinei[k] = int(templinei[k])
  29.     newtemp.append(templinei)
  30. for i in range(20):
  31.     for j in range(17):
  32.         vale.append(newtemp[i][j]*newtemp[i][j+1]*newtemp[i][j+2]*newtemp[i][j+3])

  34. for i in range(17):
  35.     for j in range(20):
  36.         vale.append(newtemp[i][j]*newtemp[i+1][j]*newtemp[i+2][j]*newtemp[i+3][j])

  38. for i in range(17):
  39.     for j in range(17):
  40.         vale.append(newtemp[i][j]*newtemp[i+1][j+1]*newtemp[i+2][j+2]*newtemp[i+3][j+3])


  43. for i in range(17):
  44.     for j in range(3,20):
  45.         vale.append(newtemp[i][j]*newtemp[i+1][j-1]*newtemp[i+2][j-2]*newtemp[i+3][j-3])

  47. print(max(vale))
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

jerryxjr1220
发表于 2016-9-17 11:19:03 From FishC Mobile | 显示全部楼层
本帖最后由 jerryxjr1220 于 2016-9-17 13:03 编辑

都不对吧，我算出来最大是70,600,674。
[6][12]开始，左下方4个的乘积。
89*94*97*87

  1. 8  2  22 97 38 15 0  40 0  75 4  5  7  78 52 12 50 77 91 8  

  3. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 4  56 62 0  

  5. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 3  49 13 36 65

  7. 52 70 95 23 4  60 11 42 69 24 68 56 1  32 56 71 37 2  36 91

  9. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80

  11. 24 47 32 60 99 3  45 2  44 75 33 53 78 36 84 20 35 17 12 50

  13. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70

  15. 67 26 20 68 2  62 12 20 95 63 94 39 63 8  40 91 66 49 94 21

  17. 24 55 58 5  66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72

  19. 21 36 23 9  75 0  76 44 20 45 35 14 0  61 33 97 34 31 33 95

  21. 78 17 53 28 22 75 31 67 15 94 3  80 4  62 16 14 9  53 56 92

  23. 16 39 5  42 96 35 31 47 55 58 88 24 0  17 54 24 36 29 85 57

  25. 86 56 0  48 35 71 89 7  5  44 44 37 44 60 21 58 51 54 17 58

  27. 19 80 81 68 5  94 47 69 28 73 92 13 86 52 17 77 4  89 55 40

  29. 4  52 8  83 97 35 99 16 7  97 57 32 16 26 26 79 33 27 98 66

  31. 88 36 68 87 57 62 20 72 3  46 33 67 46 55 12 32 63 93 53 69

  33. 4  42 16 73 38 25 39 11 24 94 72 18 8  46 29 32 40 62 76 36

  35. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 4  36 16

  37. 20 73 35 29 78 31 90 1  74 31 49 71 48 86 81 16 23 57 5  54

  39. 1  70 54 71 83 51 54 69 16 92 33 48 61 43 52 1  89 19 67 48

  41. 6 12 70600674 lx
  42. Time: 0.016 sec
复制代码

  1. # 在这个 20×20,网格中，处于任何方向上（上，下，左，右或者对角线）的四个相邻数字的乘积的最大值是多少？
  2. matrix = [
  3. '08','02','22','97','38','15','00','40','00','75','04','05','07','78','52','12','50','77','91','08','49','49','99','40','17','81','18','57','60','87','17','40','98','43','69','48','04','56','62','00','81','49','31','73','55','79','14','29','93','71','40','67','53','88','30','03','49','13','36','65','52','70','95','23','04','60','11','42','69','24','68','56','01','32','56','71','37','02','36','91','22','31','16','71','51','67','63','89','41','92','36','54','22','40','40','28','66','33','13','80','24','47','32','60','99','03','45','02','44','75','33','53','78','36','84','20','35','17','12','50','32','98','81','28','64','23','67','10','26','38','40','67','59','54','70','66','18','38','64','70','67','26','20','68','02','62','12','20','95','63','94','39','63','08','40','91','66','49','94','21','24','55','58','05','66','73','99','26','97','17','78','78','96','83','14','88','34','89','63','72','21','36','23','09','75','00','76','44','20','45','35','14','00','61','33','97','34','31','33','95','78','17','53','28','22','75','31','67','15','94','03','80','04','62','16','14','09','53','56','92','16','39','05','42','96','35','31','47','55','58','88','24','00','17','54','24','36','29','85','57','86','56','00','48','35','71','89','07','05','44','44','37','44','60','21','58','51','54','17','58','19','80','81','68','05','94','47','69','28','73','92','13','86','52','17','77','04','89','55','40','04','52','08','83','97','35','99','16','07','97','57','32','16','26','26','79','33','27','98','66','88','36','68','87','57','62','20','72','03','46','33','67','46','55','12','32','63','93','53','69','04','42','16','73','38','25','39','11','24','94','72','18','08','46','29','32','40','62','76','36','20','69','36','41','72','30','23','88','34','62','99','69','82','67','59','85','74','04','36','16','20','73','35','29','78','31','90','01','74','31','49','71','48','86','81','16','23','57','05','54','01','70','54','71','83','51','54','69','16','92','33','48','61','43','52','01','89','19','67','48']

  5. import time
  6. start = time.time()

  8. matrix1 = []
  9. for each in matrix:
  10.     matrix1.append (int(each))

  12. def showMatrix(matrix):  
  13.     for j in range(20):  
  14.         for i in range(20):
  15.             if len (str(matrix[j*20+i])) == 1:
  16.                 print('%d '%(matrix[j*20+i]),end=' ')
  17.             else:
  18.                 print('%d '%(matrix[j*20+i]),end='')  
  19.         print('\n')

  21. class point:
  22.         def __init__(self,x,y):  #x = col; y = row;
  23.                 self.x=x  
  24.                 self.y=y  
  25.                 self.ver=[]  
  26.                 self.hor=[]
  27.                 self.rx=[]
  28.                 self.lx=[]
  29.                 self.maxi=0  

  31. def rowVer(point,matrix):
  32.     row = []
  33.     if point.x <17:
  34.         row=matrix[(point.y*20+point.x):(point.y*20+point.x+4)]
  35.     return row #list type  
  36.   
  37. def colHor(point,matrix):  
  38.     col=[]  
  39.     if point.y <17:
  40.         for i in range(point.y*20+point.x,point.y*20+point.x+80,20):  
  41.             col.append(matrix[i])   
  42.     return col #list type  

  44. def rcRx(point, matrix):
  45.     rx = []
  46.     if point.x <17 and point.y <17:
  47.         for i in range(point.y*20+point.x,point.y*20+point.x+84,21):  
  48.             rx.append(matrix[i])
  49.     return rx #list type
  50.         
  51. def rcLx(point,matrix):
  52.     lx = []
  53.     if point.x >2 and point.y <17:
  54.         for i in range(point.y*20+point.x,point.y*20+point.x+76,19):
  55.             lx.append(matrix[i])
  56.     return lx #list type

  58. def initPoint(matrix):
  59.     length = len(matrix)
  60.     pointlist = []
  61.     for i in range(length):
  62.         p=point(i%20,i//20)
  63.         p.ver =  rowVer(p,matrix)
  64.         p.hor =  colHor(p,matrix)
  65.         p.rx =  rcRx(p,matrix)
  66.         p.lx =  rcLx(p,matrix)
  67.         pointlist.append(p)
  68.     return pointlist

  70. testlist = initPoint(matrix1)
  71. maxam = 1
  72. max_x = 0
  73. max_y = 0
  74. mm = ''
  75. for each in testlist:
  76.     vertotal = 1
  77.     hortotal = 1
  78.     rxtotal = 1
  79.     lxtotal = 1
  80.     for k in range(4):
  81.         if each.ver != []:
  82.             vertotal *= each.ver[k]
  83.         if each.hor != []:
  84.             hortotal *= each.hor[k]
  85.         if each.rx != []:
  86.             rxtotal *= each.rx[k]
  87.         if each.lx != []:
  88.             lxtotal *= each.lx[k]
  89.         each.maxi = max(vertotal,hortotal,rxtotal,lxtotal)
  90. for p in testlist:
  91.     if p.maxi > maxam:
  92.         maxam = p.maxi
  93.         max_x = p.x
  94.         max_y = p.y
  95.         if p.maxi == p.ver:
  96.             mm = 'ver'
  97.         elif p.maxi == p.hor:
  98.             mm = 'hor'
  99.         elif p.maxi == p.rx:
  100.             mm = 'rx'
  101.         else:
  102.             mm = 'lx'

  104. end = time.time()

  106. showMatrix(matrix1)

  108. print (max_x, max_y, maxam, mm)

  110. print ('Time: %.3f sec' % (end-start))
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 1 反对 0

使用道具 举报

lyciam
发表于 2016-11-18 11:59:38 | 显示全部楼层
  1. import time
  2. t = time.clock()

  4. def euler11():
  5.     """
  6.     在以下20X20的网格中，四个处于同一对角线上的相邻数字用红色标了出来：
  7.     """
  8.     gridnum="""
  9. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  10. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  11. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  12. 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  13. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  14. 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  15. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  16. 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  17. 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  18. 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  19. 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  20. 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  21. 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  22. 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  23. 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  24. 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  25. 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  26. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  27. 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  28. 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
  29.     """
  30.     """
  31.     这个四个数字的乘积是：26 X 63 X 78 X 14 = 1788696
  32.     在这个20 X 20 网格中，处于任何方向上（上下左右或者对角线）的四
  33.     个相邻数字的乘积的最大值是多少？
  34.     """
  35.     gridlist = [ [int(m) for m in row] for row in [ n.split() for n in gridnum.strip().split('\n') ]  ]
  36.     x_left = [gridlist[ n ][ n ] for n in range(20)]
  37.     x_right = [gridlist[ n ][19-n ] for n in range(20)]
  38.     gridlist.insert(20,x_left)
  39.     gridlist.insert(21,x_right)
  40.     result = [ 0, [0, 0, 0, 0] ]
  41.     for row in gridlist:
  42.         for n in range(len(row)-3):
  43.             temp = row[n]*row[n+1]*row[n+2]*row[n+3]
  44.             if result[0] < temp:
  45.                 result = [temp, [row[n], row[n+1], row[n+2], row[n+3] ] ]
  46.     return result
  47. print(euler11(), '--time: ', time.clock()-t)
复制代码


[48477312, [78, 78, 96, 83]] --time:  0.0010933442278124534
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

jerryxjr1220
发表于 2016-11-19 07:42:28 | 显示全部楼层
lyciam 发表于 2016-11-18 11:59
[48477312, [78, 78, 96, 83]] --time:  0.0010933442278124534

你算错了
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

lyciam
发表于 2016-11-22 17:12:37 | 显示全部楼层
  1. import time
  2. t = time.clock()
  3. def product(args):
  4.     result = 1
  5.     for n in args:
  6.         result *= n
  7.     return result

  9. def euler11():
  10.     """
  11.     在以下20X20的网格中，四个处于同一对角线上的相邻数字用红色标了出来：
  12.     """
  13.     gridnum="""
  14. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  15. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  16. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  17. 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  18. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  19. 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  20. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  21. 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  22. 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  23. 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  24. 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  25. 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  26. 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  27. 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  28. 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  29. 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  30. 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  31. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  32. 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  33. 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
  34.     """
  35.     """
  36.     这个四个数字的乘积是：26 X 63 X 78 X 14 = 1788696
  37.     在这个20 X 20 网格中，处于任何方向上（上下左右或者对角线）的四
  38.     个相邻数字的乘积的最大值是多少？
  39.     """
  40.     gridlist = [ [int(m) for m in row] for row in [ n.split() for n in gridnum.strip().split('\n') ]  ]
  41.     result = {'max' : 0}
  42.     for x in range(17):
  43.         for y in range(3,17):
  44.             left = product( [ gridlist[x][y-n] for n in range(4) ] )
  45.             right = product( [ gridlist[x][y+n] for n in range(4) ] )
  46.             down = product( [ gridlist[x+n][y] for n in range(4) ] )
  47.             downleft = product( [ gridlist[x+n][y-n] for n in range(4) ] )
  48.             downright = product( [ gridlist[x+n][y+n] for n in range(4) ] )
  49.             temp = {'left' : left, 'right' : right, 'down' : down, 'downleft' : downleft, 'downright' : downright}
  50.             for key in temp:
  51.                 if result['max'] < temp[key]:
  52.                     result['max'] = temp[key]
  53.                     result['position(x,y)'] ='{}-->{}'.format( (x,y), key )   
  54.     return result
  55. print(euler11(), '--time: ', time.clock()-t)
复制代码


{'position(x,y)': '(12, 6)-->downleft', 'max': 70600674} --time:  0.005414622617168334

@jerryxjr1220 谢谢指出我的错误。之前确实看错题啦，现在重新改写一遍，答案和你的一样
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

lyciam
发表于 2016-11-22 17:13:42 | 显示全部楼层
jerryxjr1220 发表于 2016-11-19 07:42
你算错了

谢谢指出我的错误。现在我重新改写了一遍，答案是和你一样的！
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

芒果加黄桃
发表于 2017-1-9 15:34:33 | 显示全部楼层
  1. # encoding:utf-8

  3. numbers = [
  4. ['08', '02', '22', '97', '38', '15', '00', '40', '00', '75', '04', '05', '07', '78', '52', '12', '50', '77', '91', '08'],
  5. ['49', '49', '99', '40', '17', '81', '18', '57', '60', '87', '17', '40', '98', '43', '69', '48', '04', '56', '62', '00'],
  6. ['81', '49', '31', '73', '55', '79', '14', '29', '93', '71', '40', '67', '53', '88', '30', '03', '49', '13', '36', '65'],
  7. ['52', '70', '95', '23', '04', '60', '11', '42', '69', '24', '68', '56', '01', '32', '56', '71', '37', '02', '36', '91'],
  8. ['22', '31', '16', '71', '51', '67', '63', '89', '41', '92', '36', '54', '22', '40', '40', '28', '66', '33', '13', '80'],
  9. ['24', '47', '32', '60', '99', '03', '45', '02', '44', '75', '33', '53', '78', '36', '84', '20', '35', '17', '12', '50'],
  10. ['32', '98', '81', '28', '64', '23', '67', '10', '26', '38', '40', '67', '59', '54', '70', '66', '18', '38', '64', '70'],
  11. ['67', '26', '20', '68', '02', '62', '12', '20', '95', '63', '94', '39', '63', '08', '40', '91', '66', '49', '94', '21'],
  12. ['24', '55', '58', '05', '66', '73', '99', '26', '97', '17', '78', '78', '96', '83', '14', '88', '34', '89', '63', '72'],
  13. ['21', '36', '23', '09', '75', '00', '76', '44', '20', '45', '35', '14', '00', '61', '33', '97', '34', '31', '33', '95'],
  14. ['78', '17', '53', '28', '22', '75', '31', '67', '15', '94', '03', '80', '04', '62', '16', '14', '09', '53', '56', '92'],
  15. ['16', '39', '05', '42', '96', '35', '31', '47', '55', '58', '88', '24', '00', '17', '54', '24', '36', '29', '85', '57'],
  16. ['86', '56', '00', '48', '35', '71', '89', '07', '05', '44', '44', '37', '44', '60', '21', '58', '51', '54', '17', '58'],
  17. ['19', '80', '81', '68', '05', '94', '47', '69', '28', '73', '92', '13', '86', '52', '17', '77', '04', '89', '55', '40'],
  18. ['04', '52', '08', '83', '97', '35', '99', '16', '07', '97', '57', '32', '16', '26', '26', '79', '33', '27', '98', '66'],
  19. ['88', '36', '68', '87', '57', '62', '20', '72', '03', '46', '33', '67', '46', '55', '12', '32', '63', '93', '53', '69'],
  20. ['04', '42', '16', '73', '38', '25', '39', '11', '24', '94', '72', '18', '08', '46', '29', '32', '40', '62', '76', '36'],
  21. ['20', '69', '36', '41', '72', '30', '23', '88', '34', '62', '99', '69', '82', '67', '59', '85', '74', '04', '36', '16'],
  22. ['20', '73', '35', '29', '78', '31', '90', '01', '74', '31', '49', '71', '48', '86', '81', '16', '23', '57', '05', '54'],
  23. ['01', '70', '54', '71', '83', '51', '54', '69', '16', '92', '33', '48', '61', '43', '52', '01', '89', '19', '67', '48']
  24. ]

  26. # 字符串转为整数
  27. for line in numbers:
  28.     for num in line:
  29.         line[line.index(num)] = int(num)  
  30.         
  31. max_num = 0
  32. i_h, j_s = 0, 0

  34. # 横排最大
  35. for i in range(0, 20):
  36.     for j in range(0, 17):
  37.         temp = numbers[i][j] * numbers[i][j + 1] * numbers[i][j + 2] * numbers[i][j + 3]
  38.         if temp > max_num:
  39.             max_num = temp
  40.             i_h, j_s = i, j

  42. # 竖排
  43. for i in range(0, 17):
  44.     for j in range(0, 20):
  45.         temp = numbers[i][j] * numbers[i + 1][j ] * numbers[i + 2][j ] * numbers[i + 3][j ]
  46.         if temp > max_num:
  47.             max_num = temp
  48.             i_h, j_s = i, j


  51. # 左斜
  52. for i in range(0, 17):
  53.     for j in range(0, 17):
  54.         temp = numbers[i][j] * numbers[i + 1][j + 1 ] * numbers[i + 2][j + 2 ] * numbers[i + 3][j + 3 ]
  55.         if  temp > max_num:
  56.             max_num = temp
  57.             i_h, j_s = i, j

  59. # 左斜
  60. for i in range(3, 20):
  61.     for j in range(0, 17):
  62.         temp = numbers[i][j] * numbers[i - 1][j + 1 ] * numbers[i - 2][j + 2 ] * numbers[i - 3][j + 3 ]
  63.         # print(temp)
  64.         if  temp > max_num:
  65.             max_num = temp
  66.             i_h, j_s = i, j
  67.             
  68. print('最大乘积是%d, 坐标为：x = %d, y = %d' % (max_num, i_h, j_s))


复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

渡风
发表于 2017-1-14 00:03:26 | 显示全部楼层
此代码使用matlab编程
Problem11所用时间为0.002456秒
Problem11的答案为70600674
  1. %题目11：在20×20的网格中同一直线上四个数的最大乘积是多少？
  2. function Output=Problem11(Input)
  3. tic
  4. if nargin==0
  5.     Input=[08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08;
  6.            49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00;
  7.            81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65;
  8.            52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91;
  9.            22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80;
  10.            24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50;
  11.            32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70;
  12.            67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21;
  13.            24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72;
  14.            21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95;
  15.            78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92;
  16.            16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57;
  17.            86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58;
  18.            19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40;
  19.            04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66;
  20.            88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69;
  21.            04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36;
  22.            20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16;
  23.            20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54;
  24.            01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48];
  25. %end
  26. Rank=zeros(21,21-4);
  27. Row=zeros(21-4,21);
  28. Diago_Right=zeros(21-4,21-4);
  29. Diago_Left=zeros(21-4,21-4);
  30. for ii=1:20
  31.     for jj=1:21-4
  32.         Rank(ii,jj)=prod([Input(ii,jj),Input(ii,jj+1),Input(ii,jj+2),Input(ii,jj+3)]);
  33.     end
  34. end
  35. for jj=1:21-4
  36.     for ii=1:20
  37.         Row(jj,ii)=prod([Input(jj,ii),Input(jj+1,ii),Input(jj+2,ii),Input(jj+3,ii)]);
  38.     end
  39. end
  40. for xx=1:21-4
  41.     for yy=1:21-4
  42.         Diago_Right(xx,yy)=prod([Input(xx,yy),Input(xx+1,yy+1),Input(xx+2,yy+2),Input(xx+3,yy+3)]);
  43.     end
  44. end
  45. for pp=1:21-4
  46.     for qq=4:20
  47.         Diago_Left(pp,qq-3)=prod([Input(pp,qq),Input(pp+1,qq-1),Input(pp+2,qq-2),Input(pp+3,qq-3)]);
  48.     end
  49. end
  50. Max1=max(max(Rank));
  51. Max2=max(max(Row));
  52. Max3=max(max(Diago_Right));
  53. Max4=max(max(Diago_Left));
  54. Output=max(Max1,max(Max2,max(Max3,Max4)));
  55. toc
  56. disp('此代码使用matlab编程')
  57. disp(['Problem11所用时间为',num2str(toc),'秒'])
  58. disp(['Problem11的答案为',num2str(Output)])
  59. end
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

FlySelf
发表于 2017-2-3 12:07:09 | 显示全部楼层
  1. import time

  3. def max_product(number=4):
  4.     '求在20×20的网格中同一直线上四个数的最大乘积'
  5.     source = '''
  6.     08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  7.     49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  8.     81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  9.     52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  10.     22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  11.     24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  12.     32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  13.     67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  14.     24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  15.     21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  16.     78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  17.     16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  18.     86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  19.     19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  20.     04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  21.     88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  22.     04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  23.     20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  24.     20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  25.     01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
  26.     '''
  27.     list_source = source.split()
  28.     for i in range(0, len(list_source)):
  29.         list_source[i] = int(list_source[i])
  30.     list_matrix = []
  31.     for i in range(0, 20):
  32.         list_matrix.append(list_source[(i * 20):((i + 1) * 20)])

  34.     result = 1
  35.     value = []
  36.     coord = []
  37.     #横纵方向的最大乘积
  38.     for i in range(0, 20):
  39.         for j in range(0, 21 - number):
  40.             result_horizontal = 1
  41.             result_vertical = 1
  42.             result_horizontal = list_matrix[i][j] * list_matrix[i][j + 1] * list_matrix[i][j + 2] * list_matrix[i][j + 3]
  43.             result_vertical = list_matrix[j][i] * list_matrix[j + 1][i] * list_matrix[j + 2][i] * list_matrix[j + 3][i]
  44.             if result_horizontal > result and result_horizontal > result_vertical:
  45.                 result = result_horizontal
  46.                 coord = [i, j]
  47.                 value = [list_matrix[i][j], list_matrix[i][j + 1], list_matrix[i][j + 2], list_matrix[i][j + 3]]
  48.             elif result_vertical > result and result_vertical > result_horizontal:
  49.                 result = result_vertical
  50.                 coord = [j, i]
  51.                 value = [list_matrix[j][i], list_matrix[j + 1][i], list_matrix[j + 2][i], list_matrix[j + 3][i]]
  52.     #对角线方向的最大乘积
  53.     for i in range(0, 21 - number):
  54.         for j in range(0, 21 - number - i):
  55.             result_up = 1
  56.             result_down = 1
  57.             result_up_right = 1
  58.             result_down_right = 1
  59.             result_up = list_matrix[j][i + j] * list_matrix[j + 1][i + j + 1] * \
  60.             list_matrix[j + 2][i + j + 2] * list_matrix[j + 3][i + j + 3]

  62.             result_down = list_matrix[i + j][j] * list_matrix[i + j + 1][j + 1] * \
  63.             list_matrix[i + j + 2][j + 2] * list_matrix[i + j + 3][j + 3]

  65.             result_up_right = list_matrix[j][19 - i - j] * list_matrix[j + 1][19 - i - j - 1] * \
  66.             list_matrix[j + 2][19 - i - j - 2] * list_matrix[j + 3][19 - i - j - 3]

  68.             result_down_right = list_matrix[i + j][19 - j] * list_matrix[i + j + 1][19 - j - 1] * \
  69.             list_matrix[i + j + 2][19 - j - 2] * list_matrix[i + j + 3][19 - j - 3]

  71.             if result_up > result and result_up > result_down:
  72.                 result = result_up
  73.                 coord = [j, i + j]
  74.                 value = [list_matrix[j][i + j], list_matrix[j + 1][i + j + 1], \
  75.                 list_matrix[j + 2][i + j + 2], list_matrix[j + 3][i + j + 3]]
  76.             elif result_down > result and result_down > result_up:
  77.                 result = result_down
  78.                 coord = [i + j, j]
  79.                 value = [list_matrix[i + j][j], list_matrix[i + j + 1][j + 1], \
  80.                 list_matrix[i + j + 2][j + 2], list_matrix[i + j + 3][j + 3]]

  82.             if result_up_right > result and result_up_right > result_down_right:
  83.                 result = result_up_right
  84.                 coord = [j, 19 - i - j]
  85.                 value = [list_matrix[j][19 - i - j], list_matrix[j + 1][19 - i - j - 1], \
  86.                 list_matrix[j + 2][19 - i - j - 2], list_matrix[j + 3][19 - i - j - 3]]
  87.             elif result_down_right > result and result_down_right > result_up_right:
  88.                 result = result_down_right
  89.                 coord = [i + j, 19 - j]
  90.                 value = [list_matrix[i + j][19 - j], list_matrix[i + j + 1][19 - j - 1], \
  91.                 list_matrix[i + j + 2][19 - j - 2], list_matrix[i + j + 3][19 - j - 3]]

  93.     return [value, coord, result]

  95. start = time.clock()
  96. print(max_product())
  97. end = time.clock()
  98. print('程序执行了%fs。' %(end - start))
复制代码

执行结果：
[[89, 94, 97, 87], [12, 6], 70600674]
程序执行了0.001152s。
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

marmot
发表于 2017-2-22 16:25:48 | 显示全部楼层
本帖最后由 marmot 于 2017-2-22 16:40 编辑
  1. date = """08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  2. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  3. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  4. 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  5. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  6. 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  7. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  8. 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  9. 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  10. 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  11. 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  12. 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  13. 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  14. 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  15. 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  16. 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  17. 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  18. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  19. 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  20. 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48"""


  23. date_nospac = list(date.split())     # 列表化，去空格

  25. date_int = []
  26. for i in date_nospac :       #换int
  27.     date_int.append(int(i))

  29. list = []
  30. for j in range(20):       # 分片装入list
  31.     list.append(date_int[j * 20 :(j + 1) * 20])

  33. # n m 坐标定位
  34. num = 0
  35. for m in  range(16):
  36.     for n in range(16):
  37.         x1 = list[m][n] * list[m + 1][n + 1] * list[m + 2][n + 2] * list[m + 3][n + 3]  # 右斜
  38.         x2 = list[m][n + 3] * list[m + 1][n + 2] * list[m + 2][n + 1] * list[m + 3][n]  # 左斜
  39.         if x1 > num :
  40.             num = x1
  41.         if x2 > num:
  42.             num = x2
  43. for q in range(16):
  44.     x3 = list[q][q] * list[q][q + 1] * list[q][q + 2] * list[q][q + 3]      # 横
  45.     x4 = list[q][q] * list[q + 1][q] * list[q + 2][q] * list[q + 3][q]      # 竖
  46.     if x3 > num:
  47.         num = x1
  48.     if x4 > num:
  49.         num = x2
  50. print("答案是： " + str(num))
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

JonTargaryen
发表于 2017-4-1 14:58:52 | 显示全部楼层
本帖最后由 JonTargaryen 于 2017-4-1 15:01 编辑

The number is: 70600674
  1. #include <stdio.h>

  3. int row_product(int grid[][20], int result);
  4. int column_product(int grid[][20], int result);
  5. int right_cross_product(int grid[][20], int result);
  6. int left_cross_product(int grid[][20], int result);
  7. int main(void)
  8. {
  9.     int grid[][20] = {
  10.     {8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8},
  11.     {49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0},
  12.     {81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65},
  13.     {52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91},
  14.     {22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80},
  15.     {24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50},
  16.     {32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70},
  17.     {67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21},
  18.     {24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72},
  19.     {21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95},
  20.     {78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92},
  21.     {16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57},
  22.     {86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58},
  23.     {19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40},
  24.     {4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66},
  25.     {88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69},
  26.     {4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36},
  27.     {20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16},
  28.     {20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54},
  29.     {1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48}};

  31.     int result = 0;

  33.     result = row_product(grid, result);
  34.     result = column_product(grid, result);
  35.     result = right_cross_product(grid, result);
  36.     result = left_cross_product(grid, result);

  38.     printf("The number is: %d\n", result);

  40.     return 0;
  41. }

  43. int row_product(int grid[][20], int result)
  44. {
  45.     int i, j;
  46.     int temp;

  48.     for(i = 0; i < 20; i++)
  49.     {
  50.         for(j = 0; j < 17; j++)
  51.         {
  52.             temp = grid[i][j] * grid[i][j+1] * grid[i][j+2] * grid[i][j+3];
  53.             result = result > temp ? result : temp;
  54.         }
  55.     }

  57.     return result;
  58. }

  60. int column_product(int grid[][20], int result)
  61. {
  62.     int i, j;
  63.     int temp;

  65.     for(i = 0; i < 17; i++)
  66.     {
  67.         for(j = 0; j < 20; j++)
  68.         {
  69.             temp = grid[i][j] * grid[i+1][j] * grid[i+2][j] * grid[i+3][j];
  70.             result = result > temp ? result : temp;
  71.         }
  72.     }

  74.     return result;
  75. }

  77. int right_cross_product(int grid[][20], int result)
  78. {
  79.     int i, j;
  80.     int temp;

  82.     for(i = 0; i < 17; i++)
  83.     {
  84.         for(j = 0; j < 17; j++)
  85.         {
  86.             temp = grid[i][j] * grid[i+1][j+1] * grid[i+2][j+2] * grid[i+3][j+3];
  87.             result = result > temp ? result : temp;
  88.         }
  89.     }

  91.     return result;
  92. }

  94. int left_cross_product(int grid[][20], int result)
  95. {
  96.     int i, j;
  97.     int temp;

  99.     for(i = 3; i < 20; i++)
  100.     {
  101.         for(j = 0; j < 17; j++)
  102.         {
  103.             temp = grid[i][j] * grid[i-1][j+1] * grid[i-2][j+2] * grid[i-3][j+3];
  104.             result = result > temp ? result : temp;
  105.         }
  106.     }

  108.     return result;
  109. }
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

JonTargaryen
发表于 2017-4-1 15:32:39 | 显示全部楼层
  1. def row_product(grid, result):
  2.     for i in range(20):
  3.         for j in range(17):
  4.             temp = grid[i][j] * grid[i][j+1] * grid[i][j+2] * grid[i][j+3]
  5.             result = max(result, temp)

  7.     return result

  9. def column_product(grid, result):
  10.     for i in range(17):
  11.         for j in range(20):
  12.             temp = grid[i][j] * grid[i+1][j] * grid[i+2][j] * grid[i+3][j]
  13.             result = max(result, temp)

  15.     return result

  17. def right_cross_product(grid, result):
  18.     for i in range(17):
  19.         for j in range(17):
  20.             temp = grid[i][j] * grid[i+1][j+1] * grid[i+2][j+2] * grid[i+3][j+3]
  21.             result = max(result, temp)

  23.     return result

  25. def left_cross_product(grid, result):
  26.     for i in range(3, 20):
  27.         for j in range(17):
  28.             temp = grid[i][j] * grid[i-1][j+1] * grid[i-2][j+2] * grid[i-3][j+3]
  29.             result = max(result, temp)

  31.     return result

  33. def main():
  34.     grid  = [\
  35.     [ 8,  2, 22, 97, 38, 15,  0, 40,  0, 75,  4,  5,  7, 78, 52, 12, 50, 77, 91,  8],\
  36.     [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48,  4, 56, 62,  0],\
  37.     [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30,  3, 49, 13, 36, 65],\
  38.     [52, 70, 95, 23,  4, 60, 11, 42, 69, 24, 68, 56,  1, 32, 56, 71, 37,  2, 36, 91],\
  39.     [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80],\
  40.     [24, 47, 32, 60, 99,  3, 45,  2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50],\
  41.     [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70],\
  42.     [67, 26, 20, 68,  2, 62, 12, 20, 95, 63, 94, 39, 63,  8, 40, 91, 66, 49, 94, 21],\
  43.     [24, 55, 58,  5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],\
  44.     [21, 36, 23,  9, 75,  0, 76, 44, 20, 45, 35, 14,  0, 61, 33, 97, 34, 31, 33, 95],\
  45.     [78, 17, 53, 28, 22, 75, 31, 67, 15, 94,  3, 80,  4, 62, 16, 14,  9, 53, 56, 92],\
  46.     [16, 39,  5, 42, 96, 35, 31, 47, 55, 58, 88, 24,  0, 17, 54, 24, 36, 29, 85, 57],\
  47.     [86, 56,  0, 48, 35, 71, 89,  7,  5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],\
  48.     [19, 80, 81, 68,  5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77,  4, 89, 55, 40],\
  49.     [ 4, 52,  8, 83, 97, 35, 99, 16,  7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],\
  50.     [88, 36, 68, 87, 57, 62, 20, 72,  3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],\
  51.     [ 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18,  8, 46, 29, 32, 40, 62, 76, 36],\
  52.     [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74,  4, 36, 16],\
  53.     [20, 73, 35, 29, 78, 31, 90,  1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57,  5, 54],\
  54.     [ 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52,  1, 89, 19, 67, 48]]

  56.     result = 0
  57.     result = row_product(grid, result)
  58.     result = column_product(grid, result)
  59.     result = right_cross_product(grid, result)
  60.     result = left_cross_product(grid, result)

  62.     print(result)

  64. if __name__ == "__main__":
  65.     main()
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

天之南
发表于 2017-5-1 14:33:26 | 显示全部楼层
本帖最后由 天之南 于 2017-5-1 14:36 编辑
  1. #include <stdio.h>

  3. int main()
  4. {
  5.         int num[20][20] =
  6.         {   
  7.                 8,  2, 22, 97, 38, 15,  0, 40,  0, 75,  4,  5,  7, 78, 52, 12, 50, 77, 91,  8,
  8.                 49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48,  4, 56, 62,  0,
  9.                 81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30,  3, 49, 13, 36, 65,
  10.                 52, 70, 95, 23,  4, 60, 11, 42, 69, 24, 68, 56,  1, 32, 56, 71, 37,  2, 36, 91,
  11.                 22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80,
  12.                 24, 47, 32, 60, 99,  3, 45,  2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50,
  13.                 32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70,
  14.                 67, 26, 20, 68,  2, 62, 12, 20, 95, 63, 94, 39, 63,  8, 40, 91, 66, 49, 94, 21,
  15.                 24, 55, 58,  5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72,
  16.                 21, 36, 23,  9, 75,  0, 76, 44, 20, 45, 35, 14,  0, 61, 33, 97, 34, 31, 33, 95,
  17.                 78, 17, 53, 28, 22, 75, 31, 67, 15, 94,  3, 80,  4, 62, 16, 14,  9, 53, 56, 92,
  18.                 16, 39,  5, 42, 96, 35, 31, 47, 55, 58, 88, 24,  0, 17, 54, 24, 36, 29, 85, 57,
  19.                 86, 56,  0, 48, 35, 71, 89,  7,  5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58,
  20.                 19, 80, 81, 68,  5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77,  4, 89, 55, 40,
  21.                  4, 52,  8, 83, 97, 35, 99, 16,  7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66,
  22.                 88, 36, 68, 87, 57, 62, 20, 72,  3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69,
  23.                  4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18,  8, 46, 29, 32, 40, 62, 76, 36,
  24.                 20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74,  4, 36, 16,
  25.                 20, 73, 35, 29, 78, 31, 90,  1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57,  5, 54,
  26.                  1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52,  1, 89, 19, 67, 48};
  27.         int max = 0;
  28.         for (int i = 0; i < 20; i++)
  29.         {
  30.                 for (int j = 0; j < 20; j++)
  31.                 {
  32.                         if (i + 3 < 20) {
  33.                                 int temp = num[i][j] * num[i + 1][j] * num[i + 2][j] * num[i + 3][j];
  34.                                 max = max > temp ? max : temp;
  35.                         }
  36.                         if (j + 3 < 20)
  37.                         {
  38.                                 int temp = num[i][j] * num[i][j + 1] * num[i][j + 2] * num[i][j + 3];
  39.                                 max = max > temp ? max : temp;
  40.                         }
  41.                         if (i + 3 < 20 && j + 3 < 20)
  42.                         {
  43.                                 int temp = num[i][j]*num[i+1][j+1]*num[i+2][j+2]*num[i+3][j+3];
  44.                                 max = max > temp ? max : temp;
  45.                         }
  46.                         if (i + 3 < 20 && j > 3)
  47.                         {
  48.                                 int temp = num[i][j] * num[i+1][j-1]*num[i+2][j-2] * num[i+3][j-3];
  49.                                 max = max > temp ? max : temp;
  50.                         }
  51.                 }
  52.         }
  53.        
  54.         printf("%d\n",max);
  55.         return 0;
  56. }
复制代码

70600674
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

幻世伽蓝
发表于 2017-7-9 14:40:12 | 显示全部楼层
  1. #include <stdio.h>

  3. int n[20][20]={ { 8, 2,22,97,38,15, 0,40, 0,75, 4, 5, 7,78,52,12,50,77,91, 8},
  4.                 {49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48, 4,56,62, 0},
  5.                 {81,49,31,73,55,79,14,29,93,71,40,67,53,88,30, 3,49,13,36,65},
  6.                 {52,70,95,23, 4,60,11,42,69,24,68,56, 1,32,56,71,37, 2,36,91},
  7.                 {22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80},
  8.                 {24,47,32,60,99, 3,45, 2,44,75,33,53,78,36,84,20,35,17,12,50},
  9.                 {32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70},
  10.                 {67,26,20,68, 2,62,12,20,95,63,94,39,63, 8,40,91,66,49,94,21},
  11.                 {24,55,58, 5,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72},
  12.                 {21,36,23, 9,75, 0,76,44,20,45,35,14, 0,61,33,97,34,31,33,95},
  13.                 {78,17,53,28,22,75,31,67,15,94, 3,80, 4,62,16,14, 9,53,56,92},
  14.                 {16,39, 5,42,96,35,31,47,55,58,88,24, 0,17,54,24,36,29,85,57},
  15.                 {86,56, 0,48,35,71,89, 7, 5,44,44,37,44,60,21,58,51,54,17,58},
  16.                 {19,80,81,68, 5,94,47,69,28,73,92,13,86,52,17,77, 4,89,55,40},
  17.                 { 4,52, 8,83,97,35,99,16, 7,97,57,32,16,26,26,79,33,27,98,66},
  18.                 {88,36,68,87,57,62,20,72, 3,46,33,67,46,55,12,32,63,93,53,69},
  19.                 { 4,42,16,73,38,25,39,11,24,94,72,18, 8,46,29,32,40,62,76,36},
  20.                 {20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74, 4,36,16},
  21.                 {20,73,35,29,78,31,90, 1,74,31,49,71,48,86,81,16,23,57, 5,54},
  22.                 { 1,70,54,71,83,51,54,69,16,92,33,48,61,43,52, 1,89,19,67,48}};


  25. int main()
  26. {
  27.     int i,j,max=0,a=0,b=0,c=0,d=0,e=0;
  28.     for(i=0;i<20;i++)
  29.     {
  30.         for(j=0;j<17;j++)
  31.         {
  32.             if(i>3&&i<17)
  33.             {
  34.                 a=n[i][j]*n[i+1][j]*n[i+2][j]*n[i+3][j];
  35.                 b=n[i][j]*n[i][j+1]*n[i][j+2]*n[i][j+3];
  36.                 c=n[i][j]*n[i+1][j+1]*n[i+2][j+2]*n[i+3][j+3];
  37.                 d=n[i][j]*n[i-1][j+1]*n[i-2][j+2]*n[i-3][j+3];
  38.                 e=(a>b?a:b)>c?(a>b?a:b):c;
  39.                 if(d>e)
  40.                     e=d;
  41.                 if(e>max)
  42.                 {
  43.                     max=e;
  44.                 }
  45.             }
  46.             else if(i<=3)
  47.             {
  48.                 a=n[i][j]*n[i+1][j]*n[i+2][j]*n[i+3][j];
  49.                 b=n[i][j]*n[i][j+1]*n[i][j+2]*n[i][j+3];
  50.                 c=n[i][j]*n[i+1][j+1]*n[i+2][j+2]*n[i+3][j+3];
  51.                 e=(a>b?a:b)>c?(a>b?a:b):c;
  52.                 if(e>max)
  53.                 {
  54.                     max=e;
  55.                 }
  56.             }
  57.             else
  58.             {
  59.                 b=n[i][j]*n[i][j+1]*n[i][j+2]*n[i][j+3];
  60.                 d=n[i][j]*n[i-1][j+1]*n[i-2][j+2]*n[i-3][j+3];
  61.                 if(b>max)
  62.                 {
  63.                     max=b;
  64.                 }
  65.                 if(d>max)
  66.                 {
  67.                     max=d;
  68.                 }
  69.             }
  70.         }
  71.     }

  73.     printf("%d\n",max);
  74.     return 0;
  75. }
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

py阿碗
发表于 2017-7-14 18:19:24 | 显示全部楼层
  1. num = '''08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  2. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  3. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  4. 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  5. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  6. 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  7. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  8. 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  9. 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  10. 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  11. 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  12. 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  13. 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  14. 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  15. 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  16. 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  17. 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  18. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  19. 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  20. 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48'''
  21. num1 = num.replace('/n',' ')
  22. #每行20个数=40+20=60个字符  总共60*20-1=1199
  23. #行line 列column 斜oblique
  24. L = []
  25. for x in range(0,20):
  26.     for i in range(x*60+0,x*60+59,3):
  27.         a = int(num1[i:i+2])
  28.         L.append(a)
  29. #到这里把所有数放入list：L中

  31. L1 = []

  33. line = 0
  34. for x1 in range(0,20):
  35.     for i1 in range(x1*20+0,x1*20+17):
  36.         line = L[i1]*L[i1+1]*L[i1+2]*L[i1+3]
  37.         L1.append(line)

  39. column = 0
  40. for i2 in range(0,340):#不是341从0开始计数
  41.     column = L[i2]*L[i2+20]*L[i2+40]*L[i2+60]
  42.     L1.append(column)

  44. oblique1 = 0
  45. for x3 in range(0,17):
  46.     for i3 in range(x3*20+0,x3*20+17):
  47.         oblique1 = L[i3]*L[i3+21]*L[i3+42]*L[i3+63]
  48.         L1.append(oblique1)

  50. oblique2 = 0
  51. for x4 in range(0,17):
  52.     for i4 in range(x4*20+3,x4*20+21):
  53.         oblique2 = L[i4]*L[i4+19]*L[i4+38]*L[i4+57]
  54.         L1.append(oblique2)

  56. print(max(L1))
复制代码
想知道小甲鱼最近在做啥？请访问 -> ilovefishc.com
回复 支持 反对

使用道具 举报

下一页 »
123下一页
返回列表 发新帖
高级模式
B Color Image Link Quote Code Smilies
您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

小黑屋|手机版|Archiver|鱼C工作室 ( 粤ICP备18085999号-1 | 粤公网安备 44051102000585号)

GMT+8, 2024-4-25 21:28

Powered by Discuz! X3.4

© 2001-2023 Discuz! Team.

快速回复 返回顶部 返回列表