<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>数位枚举 on Bad Fd</title>
    <link>/tags/%E6%95%B0%E4%BD%8D%E6%9E%9A%E4%B8%BE/</link>
    <description>Recent content in 数位枚举 on Bad Fd</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-cn</language>
    <lastBuildDate>Fri, 01 Jun 2018 20:26:39 +0800</lastBuildDate><atom:link href="/tags/%E6%95%B0%E4%BD%8D%E6%9E%9A%E4%B8%BE/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>算法笔记：计算1到n中2出现的个数</title>
      <link>/posts/algmnotes-count_2_of_a_number/</link>
      <pubDate>Fri, 01 Jun 2018 20:26:39 +0800</pubDate>
      
      <guid>/posts/algmnotes-count_2_of_a_number/</guid>
      <description>&lt;p&gt;这是读书时一篇旧文搬运.几年后再次回顾下算法.&lt;/p&gt;
&lt;h2 id=&#34;问题&#34;&gt;问题&lt;/h2&gt;
&lt;p&gt;给定一个数字n，求1到n序列中2出现的总次数。n最大值可能是10^9。&lt;/p&gt;
&lt;h2 id=&#34;思路&#34;&gt;思路&lt;/h2&gt;
&lt;h3 id=&#34;暴力&#34;&gt;暴力&lt;/h3&gt;</description>
    </item>
    
  </channel>
</rss>
