11 2017 档案
NJUOJ 上机7 题目8
摘要:#include #define N 0 #define M 1 int f[2][100] = { 0 }; int c[2][100] = { 0 }; void factor(int num, int pos) { int facs = 0; for (int i = 2; i > n >> m; if (m max) max = count; ... 阅读全文
posted @ 2017-11-09 19:18 Ricochet! 阅读(222) 评论(0) 推荐(0)