2018-2019 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) Solution
A:Exam Solved. 温暖的签。 View Code B:Coprime Integers Solved. 枚举gcd反演 View Code C:Contest Setting ...
原文：Liars（2018-2019 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)）差分法
Problem L limit second Liars There are n people in a circle, numbered from to n, each of whom always tells the truth or always lies. Each person i makes a claim of the form: the number of truth teller ...
2020-04-29 10:49 0 802 推荐指数：
相关推荐
2017-2018 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)
A. Odd Palindrome 所有回文子串长度都是奇数等价于不存在长度为$2$的偶回文子串，即相邻两个字符都不同。 #include<cstdio> #include< ...
2018-2019 ACM-ICPC, Asia Seoul Regional Contest
ProblemA Circuits Solved. 题意： 有$n$个矩形，可以放两条平行与$x$轴的线，求怎么放置两条无线长的平行于$x$轴的线，使得他们与矩形相交个数最多 如果一个矩形同时 ...
2018-2019 ACM-ICPC, Asia Xuzhou Regional Contest
地址 Rank Solved A B C D E F G H I J K ...
2018-2019 ACM-ICPC, Asia Nanjing Regional Contest
https://codeforces.com/gym/101981 Problem A. Adrien and Austin 贪心，注意细节 f[x]=1：先手必赢。 f[x]: ...
Gym 101964 2018-2019 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2018)
传送门 A.Numbers B.Broken Watch 先考虑最简单的情况，就是a,b,c都相等的情况，这个时候答案显然只会跟n有关系，在n个线段 ...
【GYM102091】2018-2019 ACM-ICPC, Asia Nakhon Pathom Regional Contest
A-Evolution Game 题目大意：有$n$个不同的野兽，定义第$i$ 个野兽有 $i$ 个眼睛和 $h[i]$ 个角，你可以任意从中选择一个野兽进行进化，每次进化角数量必须增加，而且进化后 ...