{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"I was trying to solve problem [1234 - Harmonic Number](http://v2.lightoj.com/author/problem/1234), I wrote the following code\n\n``` \nlong long H( int n ) {\n long long res \u003d 0;\n for( int i \u003d 1; i \u003c\u003d n; i++ )\n res \u003d res + n / i;\n return res;\n}\n```\n\nYes, my error was that I was using the integer divisions only. However, you are given **n**, you have to find **H(n)** as in my code."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026#8804; 1000)**, denoting the number of test cases.\n\nEach case starts with a line containing an integer **n (1 \u0026#8804; n \u0026lt; 2\u003csup\u003e31\u003c/sup\u003e)**."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and **H(n)** calculated by the code."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e11\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n2147483647\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 1\nCase 2: 3\nCase 3: 5\nCase 4: 8\nCase 5: 10\nCase 6: 14\nCase 7: 16\nCase 8: 20\nCase 9: 23\nCase 10: 27\nCase 11: 46475828386\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}