![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数学
&小鹏鹏
邮箱:18140035@bjtu.edu.cn
展开
-
Cantor数塔问题
/*1/1 1/2 1/3 1/4 1/5 2/1 2/2 2/3 2/4 3/1 3/2 3/3 4/1 4/2 5/1*/ # include # include int main() { int n; while(scanf("%d",&n)==1) { int k=(int)floor((sqrt(8.0*n+1)-1)/2-1e-9转载 2014-12-03 19:57:11 · 394 阅读 · 0 评论 -
连续数的最小公倍数(时间超短)
#include #include #include using namespace std; #define MOD_NUM 9973 #define Max_n 5002 int prime[Max_n] = {0}; int func[Max_n] = {0}; void init_prime(){ for (int i = 2 ; i < Max_n; i++)原创 2015-03-19 21:13:16 · 746 阅读 · 0 评论