<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Log on 111qqz's blog</title><link>https://111qqz.com/en/tags/log/</link><description>Recent content in Log on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Tue, 13 Sep 2016 09:41:38 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/log/index.xml" rel="self" type="application/rss+xml"/><item><title>light oj 1045 Digits of Factorial (k进制数的位数)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-09-13-digits-of-factorial-ke8bf9be588b6e695b0e79a84e4bd8de695b0/</link><pubDate>Tue, 13 Sep 2016 09:41:38 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-09-13-digits-of-factorial-ke8bf9be588b6e695b0e79a84e4bd8de695b0/</guid><description>&lt;p&gt;&lt;a href="http://vjudge.net/problem/26765" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;
题意：求n！在k进制表示下有多少位。
思路：答案为[ log(1)+log(2)+&amp;hellip;+log(N) ]+1  其中log的底数都是K&lt;/p&gt;</description></item><item><title>uva 10916 Factstone Benchmark</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-01-29-uva10916/</link><pubDate>Fri, 29 Jan 2016 12:53:01 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-01-29-uva10916/</guid><description>&lt;p&gt;&lt;a href="https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid;=8&amp;amp;page;=show_problem&amp;amp;problem;=1857" target="_blank" rel="noreferrer"&gt;https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;Itemid;=8&amp;page;=show_problem&amp;problem;=1857&lt;/a&gt;
题意：计算最大的n,满足n!/* ***********************************************
Author :111qqz
Created Time :2016年01月29日 星期五 19时49分25秒
File Name :code/uva/10916.cpp
************************************************ */&lt;/p&gt;</description></item></channel></rss>