| | | |

随笔分类 - 分治算法

摘要：include "stdafx.h" define maxn 64 int a[maxn + 1][maxn + 1] = { 0 }; void gamecal(int k, int n) { int i, j; if (n == 2) { a[k][1] = k; a[k][2] = k + 1 阅读全文

posted @ 2018-03-25 03:31 K' 阅读(102) 评论(0) 推荐(0)