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 ...
原文：2017-2018 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)
A. Odd Palindrome 所有回文子串长度都是奇数等价于不存在长度为 的偶回文子串，即相邻两个字符都不同。 include lt cstdio gt include lt cstring gt char a int n,i int main scanf s ,a n strlen a for i i lt n i if a i a i return puts Or not. , puts ...
2017-11-15 23:58 3 1594 推荐指数：
相关推荐
Liars（2018-2019 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)）差分法
Problem L — limit 1 second Liars There are n people in a circle, numbered from 1 to n, each of who ...
2017-2018 ACM-ICPC, Asia Daejeon Regional Contest
先来一个大神的全题解：http://blog.myungwoo.kr/121 A. Broadcast Stations B. Connect3 题意：在一个4*4的棋盘上玩游戏，先 ...
2017-2018 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2017)
A. Cakey McCakeFace 按题意模拟即可。 #include<stdio.h> #include<iostream> #include<strin ...
2017-2018 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2017) Solution
A：Concerts 题意：给出一个串T， 一个串S，求串S中有多少个串T，可以重复，但是两个字符间的距离要满足给出的数据要求 思路：先顺序统计第一个T中的字符在S中有多少个，然后对于第二位的以及 ...
2017-2018 ACM-ICPC, Central Europe Regional Contest (CERC 17)
A. Assignment Algorithm 按题意模拟即可。 #include<stdio.h> #include<iostream> #include<s ...
2017-2018 ACM-ICPC, NEERC, Moscow Subregional Contest
2017-2018 ACM-ICPC, NEERC, Moscow Subregional Contest Problem A. Advertising Strategy 题目描述：给出两个数\(n, k\)，初始时\(a_1=0\)，每一天开始时令\(b_i=a_i+x_i\)，每天结束时 ...