随笔分类 -  打表

524:Prime Ring Problem
摘要：Prime Ring Problem#includeusing namespace std;const int maxn = 17;int n;int A[maxn],vis[maxn],p[2*maxn];int isPrime(int n){ for(int... 阅读全文
posted @ 2018-08-16 00:13 ACLJW 阅读(97) 评论(0) 推荐(0)
1583:Digit Generator
摘要：For a positive integer N, the digit-sum of N is defined as the sum of N itself and its digits. When M is the digitsum of N, we call N... 阅读全文
posted @ 2018-04-04 11:44 ACLJW 阅读(229) 评论(0) 推荐(0)