文章分类 -  数论

LightOJ - 1236 - Pairs Forming LCM--唯一分解定理--计算 LCM
摘要：Description Find the result of the following code: long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) for( int j = i; 阅读全文
posted @ 2017-05-12 19:50 渣渣技术狗 阅读(61) 评论(0) 推荐(0)
HDU - 1165 - Ackermann function -- 阿克曼函数
摘要：Description As is known, Ackermann function plays an important role in the sphere of theoretical computer science. However, in the other hand, the dra 阅读全文
posted @ 2017-04-19 19:43 渣渣技术狗 阅读(213) 评论(0) 推荐(0)