摘要：
链接: https://vjudge.net/problem/LightOJ 1236 题意： Find the result of the following code: long long pairsFormLCM( int n ) { long long res = 0; for( int i 阅读全文
摘要：
链接： https://vjudge.net/problem/LightOJ 1245 题意: I was trying to solve problem '1234 Harmonic Number', I wrote the following code long long H( int n ) 阅读全文
摘要：
链接: https://vjudge.net/problem/LightOJ 1259 题意： Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematic 阅读全文
摘要：
链接： https://vjudge.net/problem/LightOJ 1282 题意： You are given two integers: n and k, your task is to find the most significant three digits, and least 阅读全文