打表
ACLJW
这个作者很懒,什么都没留下…
展开
-
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 a generator of M. For example, the digit-sum of 245 is 256 (= 24...原创 2018-04-04 11:44:12 · 102 阅读 · 0 评论 -
524:Prime Ring Problem
Prime Ring Problem #include<bits/stdc++.h> using namespace std; const int maxn = 17; int n; int A[maxn],vis[maxn],p[2*maxn]; int isPrime(int n){ for(int i = 2;i <= int(sqrt(n));i++){ ...原创 2018-08-16 00:12:41 · 122 阅读 · 0 评论