<?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/%E8%A3%B4%E8%9C%80%E5%AE%9A%E7%90%86/</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 Apr 2017 06:26:02 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E8%A3%B4%E8%9C%80%E5%AE%9A%E7%90%86/index.xml" rel="self" type="application/rss+xml"/><item><title>BZOJ 2257: [Jsoi2009]瓶子和燃料 (裴蜀定理)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-04-02-bzoj-2257/</link><pubDate>Sun, 02 Apr 2017 06:26:02 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-04-02-bzoj-2257/</guid><description>&lt;h2 class="relative group"&gt;2257: [Jsoi2009]瓶子和燃料
 &lt;div id="2257-jsoi2009瓶子和燃料" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#2257-jsoi2009%e7%93%b6%e5%ad%90%e5%92%8c%e7%87%83%e6%96%99" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 10 Sec  Memory Limit: 128 MB
Submit: 1246  Solved: 756
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=2257" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=2257" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=2257" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>poj 2115 C Looooops (扩展欧几里得算法)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-13-poj-2115-c-looooops-e689a9e5b195e6aca7e587a0e9878ce5be97e7ae97e6b395/</link><pubDate>Thu, 13 Oct 2016 08:11:17 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-13-poj-2115-c-looooops-e689a9e5b195e6aca7e587a0e9878ce5be97e7ae97e6b395/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2115" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意： 问 循环for ( int i = a ; i !=b; i+=c)在% （2^k）的意义下循环了多少次。&lt;/p&gt;</description></item><item><title>poj 1061 青蛙的约会 （扩展欧几里得算法（负数的处理））</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-13-poj-1061-e99d92e89b99e79a84e7baa6e4bc9a-efbc88e689a9e5b195e6aca7e587a0e9878ce5be97e7ae97e6b395efbc88e8b49fe695b0e79a84e5a484e79086efbc89/</link><pubDate>Thu, 13 Oct 2016 07:48:35 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-13-poj-1061-e99d92e89b99e79a84e7baa6e4bc9a-efbc88e689a9e5b195e6aca7e587a0e9878ce5be97e7ae97e6b395efbc88e8b49fe695b0e79a84e5a484e79086efbc89/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=1061" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：两只青蛙初始在数轴的x,y点，单位时间内分别可以向右跳m米和n米，数轴是环型的，长度为L，问两只青蛙能否相遇，以及相遇时跳的次数。&lt;/p&gt;</description></item><item><title>hdu 2669 Romantic (扩展欧几里得模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-12-hdu-2669/</link><pubDate>Wed, 12 Oct 2016 12:30:21 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-12-hdu-2669/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=2669" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：问a&lt;em&gt;x+b&lt;/em&gt;y=1的一组x&amp;gt;0的解，如果无解输出sorry.&lt;/p&gt;</description></item><item><title>中国剩余定理(crt)学习笔记</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-11-e4b8ade59bbde589a9e4bd99e5ae9ae79086crte5ada6e4b9a0e7ac94e8aeb0/</link><pubDate>Tue, 11 Oct 2016 13:04:54 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-11-e4b8ade59bbde589a9e4bd99e5ae9ae79086crte5ada6e4b9a0e7ac94e8aeb0/</guid><description>&lt;p&gt;前置技能点：&lt;/p&gt;
&lt;p&gt;&lt;a href="https://zh.wikipedia.org/wiki/" target="_blank" rel="noreferrer"&gt;维基百科_裴蜀定理（贝祖等式）&lt;/a&gt;&lt;/p&gt;
&lt;blockquote&gt;&lt;p&gt;对任何&lt;a href="https://zh.wikipedia.org/wiki/" target="_blank" rel="noreferrer"&gt;整数&lt;/a&gt;&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt="a"
 src="https://wikimedia.org/api/rest_v1/media/math/render/svg/ffd2487510aa438433a2579450ab2b3d557e5edc"
 &gt;&lt;/figure&gt;

， &lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt="b"
 src="https://wikimedia.org/api/rest_v1/media/math/render/svg/f11423fbb2e967f986e36804a8ae4271734917c3"
 &gt;&lt;/figure&gt;

和它们的&lt;a href="https://zh.wikipedia.org/wiki/" target="_blank" rel="noreferrer"&gt;最大公约数&lt;/a&gt;&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt="d"
 src="https://wikimedia.org/api/rest_v1/media/math/render/svg/e85ff03cbe0c7341af6b982e47e9f90d235c66ab"
 &gt;&lt;/figure&gt;

，关于未知数&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt="x"
 src="https://wikimedia.org/api/rest_v1/media/math/render/svg/87f9e315fd7e2ba406057a97300593c4802b53e4"
 &gt;&lt;/figure&gt;

和&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt="y"
 src="https://wikimedia.org/api/rest_v1/media/math/render/svg/b8a6208ec717213d4317e666f1ae872e00620a0d"
 &gt;&lt;/figure&gt;

的&lt;a href="https://zh.wikipedia.org/wiki/" target="_blank" rel="noreferrer"&gt;线性&lt;/a&gt;&lt;a href="https://zh.wikipedia.org/wiki/" target="_blank" rel="noreferrer"&gt;丢番图方程&lt;/a&gt;（称为&lt;strong&gt;裴蜀等式&lt;/strong&gt;）：&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt="ax&amp;#43;by=m"
 src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a3386cf2b30d74a8dc65ec168ef326cf2ece3de0"
 &gt;&lt;/figure&gt;
&lt;/p&gt;</description></item></channel></rss>