<?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/%E6%AC%A7%E6%8B%89%E5%87%BD%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>Sun, 30 Oct 2016 15:29:59 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%AC%A7%E6%8B%89%E5%87%BD%E6%95%B0/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 2837 Calculation (指数循环节+欧拉函数)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-2837/</link><pubDate>Sun, 30 Oct 2016 15:29:59 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-2837/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=2837" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：&lt;/p&gt;
&lt;p&gt;Assume that f(0) = 1 and 0^0=1. f(n) = (n)^f(n/10) for all n bigger than zero. Please calculate f(n)%m. (2 ≤ n , m ≤ 10^9, x^y means the y th power of x).&lt;/p&gt;</description></item><item><title>hdu 4335 What is N? （指数循环节+欧拉函数)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-27-hdu-4335/</link><pubDate>Thu, 27 Oct 2016 12:18:20 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-27-hdu-4335/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4335" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出b,p,m（( 0&amp;lt;=b&amp;lt;P, 1&amp;lt;=P&amp;lt;=10^5, 1 &amp;lt;= M &amp;lt;=2^64 – 1 )）,问满足图中条件的n有多少个。&lt;/p&gt;</description></item><item><title>uva 10692 Huge Mods (欧拉函数，指数循环节)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-26-uva-10692/</link><pubDate>Wed, 26 Oct 2016 12:24:10 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-26-uva-10692/</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=1633" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：求一个楼梯数%m的大小。&lt;/p&gt;
&lt;p&gt;思路：指数循环节。&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;需要注意的是，模数只有最外层是m，每往里一层，模数都变成m=phi(m)&lt;/strong&gt;&lt;/p&gt;</description></item><item><title>codeforces 594 D. REQ (树状数组+欧拉函数+逆元)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-09-22-cf594d/</link><pubDate>Thu, 22 Sep 2016 07:48:00 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-09-22-cf594d/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/problemset/problem/594/D" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个数,q个查询，每组一个区间，询问区间中所有数的乘积的欧拉函数9+7的答案是多少。&lt;/p&gt;</description></item></channel></rss>