2018年5月12日
LightOJ - 1236 Pairs Forming LCM
摘要： Find the result of the following code:long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i #include#include#in... 阅读全文
posted @ 2018-05-12 20:51 _大美 阅读(112) 评论(0) 推荐(0)
papillon
摘要： 求高精度浮点数a%b.......（想知道这个题目点进来 会是什么感受）#include#include#include#include#include#include#include#include#include#include#define maxn 10000... 阅读全文
posted @ 2018-05-12 20:22 _大美 阅读(134) 评论(0) 推荐(0)
LightOJ - 1245 Harmonic Number (II)
摘要： I was trying to solve problem '1234 - Harmonic Number', I wrote the following codelong long H( int n ) { long long res = 0; for(... 阅读全文
posted @ 2018-05-12 09:18 _大美 阅读(136) 评论(0) 推荐(0)