<?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/%E4%BA%A4%E4%BA%92%E9%A2%98/</link><description>Recent content in 交互题 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sun, 02 Oct 2016 12:58:24 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E4%BA%A4%E4%BA%92%E9%A2%98/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces 679A A. Bear and Prime 100 (交互题，构造)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-02-cf679a/</link><pubDate>Sun, 02 Oct 2016 12:58:24 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-02-cf679a/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/problemset/problem/679/A" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：存在一个[2..100]之间的数，每次可以询问一个数是否是该数的因子，返回yes或者no,最多询问20次。每次要输出询问的数，以及最后要输出这个数是否是质数。&lt;/p&gt;</description></item></channel></rss>