<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>区间计数 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E5%8C%BA%E9%97%B4%E8%AE%A1%E6%95%B0/</link><description>Recent content in 区间计数 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Mon, 05 Sep 2016 13:42:23 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E5%8C%BA%E9%97%B4%E8%AE%A1%E6%95%B0/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces 474 F. Ant colony (线段树求gcd+统计区间中某数出现的次数的经典做法)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-09-05-cf474f/</link><pubDate>Mon, 05 Sep 2016 13:42:23 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-09-05-cf474f/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/problemset/problem/474/F" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个数，m个查询，每组查询一个区间[l,r]，问[l,r]中会被吃掉多少个（区间[l,r]中的数只有当其是其他所有数的因数时才不会被吃掉,&lt;strong&gt;顺便问一句。。a divide b 是 a除b,也就是b除以a,b/a的意思嘛23333）&lt;/strong&gt;&lt;/p&gt;</description></item></channel></rss>