<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[YeHosea的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/YeHosea</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; YeHosea]]></copyright><item><title><![CDATA[Grakn Forces 2020（ABCD）]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/108893222</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/108893222</guid><author>YeHosea</author><pubDate>Thu, 01 Oct 2020 09:50:57 +0800</pubDate><description><![CDATA[A. Circle Coloring

签到，abc三个数组找到一个符合要求的就行了

#include &lt;bits/stdc++.h&gt;
using namespace std;
int a[105],b[105],c[105];
int main(){
    int t;cin&gt;&gt;t;
    while(t--){
        int n;cin&gt;&gt;n;
        for(int i=1;i&lt;=n;i++)cin&gt;&gt;a[i];
     ]]></description><category></category></item><item><title><![CDATA[Codeforces Round #668 (Div. 2)ABCD]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/108440169</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/108440169</guid><author>YeHosea</author><pubDate>Mon, 07 Sep 2020 08:37:49 +0800</pubDate><description><![CDATA[比赛链接
A. Permutation Forgery
开始看错题了，导致傻逼题想了挺久的。。
#include &lt;bits/stdc++.h&gt;
using namespace std;
int a[205];
int main(){
    ios::sync_with_stdio(false); 
    int t;cin&gt;&gt;t;
    while(t--){
        int n;cin&gt;&gt;n;
        for(int i=1;i&lt;=n;i+]]></description><category></category></item><item><title><![CDATA[Codeforces Round #666 (Div. 2)ABCD]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/108313862</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/108313862</guid><author>YeHosea</author><pubDate>Mon, 31 Aug 2020 08:30:20 +0800</pubDate><description><![CDATA[A.Juggling Letters

题意：n个字符串，执行无限次操作，每次可以将一个字符串的其中一个字符，移动到任意字符串的任意位置。问是否能使所有字符串一样。

由于可以随便操作，使所有字符串一样的条件是a-z每个字母出现的总次数能被n整除。
#include &lt;bits/stdc++.h&gt;
using namespace std;
#define m(a) memset(a,0,sizeof(a))
int a[30];
int main(){
    int t;cin&gt;&gt;]]></description><category></category></item><item><title><![CDATA[2020杭电多校第十场1010-hdu6886-Tic-Tac-Toe-Nim]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/108135571</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/108135571</guid><author>YeHosea</author><pubDate>Thu, 20 Aug 2020 22:05:16 +0800</pubDate><description><![CDATA[2020杭电多校第十场1010-hdu6886-Tic-Tac-Toe-Nim
题目链接
nim游戏，可以一步步讨论：
第一轮，Alice先手取一个：
1.Bob后手取了一个同行或同列的，那么Alice在同一行列取剩下的一个即可取胜。
2.Bob后手取了一个不共线的，那么继续讨论。
第二轮，还剩下7个位置，其中一个位置与前两个点不同行也不同列，剩下的六个位置谁取最后一个石头就必败。
因此这六个位置的值-1和那个不共线的位置构成一个普通的nim游戏。
#include &lt;bits/stdc++.h&gt]]></description><category></category></item><item><title><![CDATA[Codeforces Round #628 (Div. 2)ABC]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104873295</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104873295</guid><author>YeHosea</author><pubDate>Sun, 15 Mar 2020 09:52:51 +0800</pubDate><description><![CDATA[A - EhAb AnD gCd


输出1和x-1

#include &lt;bits/stdc++.h&gt;
using namespace std;
int main(){
    int t;cin&gt;&gt;t;
    while(t--){
        ll x;cin&gt;&gt;x;
        cout&lt;&lt;1&lt;&lt;' '&lt;&lt;x...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104723403</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104723403</guid><author>YeHosea</author><pubDate>Sat, 07 Mar 2020 22:14:07 +0800</pubDate><description><![CDATA[A. Even Subset Sum Problem


找一个偶数，或找两个奇数

#include &lt;bits/stdc++.h&gt;
using namespace std;
int a[105];
int b,c;
int main(){
    int t;cin&gt;&gt;t;
    while(t--){
        b=0,c=0;
        int n;c...]]></description><category></category></item><item><title><![CDATA[CodeCraft-20 (Div. 2)ABC]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104667365</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104667365</guid><author>YeHosea</author><pubDate>Thu, 05 Mar 2020 08:27:42 +0800</pubDate><description><![CDATA[A. Grade Allocation


取可以拿的最高分和限制的分数的最小值

#include &lt;bits/stdc++.h&gt;
using namespace std;
int main(){
    int t;cin&gt;&gt;t;
    while(t--){
        int n,m;cin&gt;&gt;n&gt;&gt;m;
        int sum...]]></description><category></category></item><item><title><![CDATA[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)ABC]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104646435</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104646435</guid><author>YeHosea</author><pubDate>Wed, 04 Mar 2020 08:56:56 +0800</pubDate><description><![CDATA[A. Kuroni and the Gifts


a1&lt;a2&lt;a3
b1&lt;b2&lt;b3
a1+b1&lt;a2+b2&lt;a3+b3
所以对两个数组排序后输出就ok

#include &lt;bits/stdc++.h&gt;
using namespace std;
int t;
int a[1005];
int b[1005];
int main(){
    ci...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #625 (Div. 2, based on Technocup 2020 Final Round)ABC]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104603590</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104603590</guid><author>YeHosea</author><pubDate>Mon, 02 Mar 2020 00:35:48 +0800</pubDate><description><![CDATA[A. Contest for Robots

#include &lt;bits/stdc++.h&gt;
using namespace std;
int a[1005],b[1005];
int main(){
    int n;cin&gt;&gt;n;
    for(int i=1;i&lt;=n;i++)cin&gt;&gt;a[i];
    for(int i=1;i&lt;=n...]]></description><category></category></item><item><title><![CDATA[POJ1426 Find The Multiple]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104508574</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104508574</guid><author>YeHosea</author><pubDate>Wed, 26 Feb 2020 00:01:32 +0800</pubDate><description><![CDATA[直接暴力dfs

#include &lt;bits/stdc++.h&gt;
using namespace std;
#define INF 0x3f3f3f3f
int n;
unsigned long long s;
bool flag;
void dfs(unsigned long long x,int k){//k表示位数
    if(flag)return;
    if(x%...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #624 (Div. 3)ABCD]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104491242</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104491242</guid><author>YeHosea</author><pubDate>Tue, 25 Feb 2020 10:27:32 +0800</pubDate><description><![CDATA[A. Add Odd or Subtract Even


a等于b时输出0
a&lt;b且b-a为奇数输出1
a&gt;b且a-b为偶数输出1
剩下输出2

#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
int main(){
int t;cin&g...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine)ABCD]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104471494</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104471494</guid><author>YeHosea</author><pubDate>Mon, 24 Feb 2020 08:32:00 +0800</pubDate><description><![CDATA[A. Dead Pixel


用坏点两边较长的长乘以整个宽
用坏点两边较长的宽乘以整个长
取max

#include &lt;bits/stdc++.h&gt;
using namespace std;
int t,a,b,x,y;
int main(){
    cin&gt;&gt;t;
    while(t--){
        cin&gt;&gt;a&gt;&gt;b&gt;&g...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #622 (Div. 2)ABC1]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104468771</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104468771</guid><author>YeHosea</author><pubDate>Sun, 23 Feb 2020 22:47:54 +0800</pubDate><description><![CDATA[A. Fast Food Restaurant


贪心，易得先用一种菜肴，再用第二种菜肴，再用第三种

#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
int main(){
    int t;cin&gt;&gt;t;
    while(t--)...]]></description><category></category></item><item><title><![CDATA[LOOPS（概率dp）]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104453907</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104453907</guid><author>YeHosea</author><pubDate>Sun, 23 Feb 2020 03:13:22 +0800</pubDate><description><![CDATA[roblem Description Akemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).
Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped in a...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #621 (Div. 1 + Div. 2)ABC]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104369073</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104369073</guid><author>YeHosea</author><pubDate>Tue, 18 Feb 2020 09:44:59 +0800</pubDate><description><![CDATA[A - Cow and Haybales


从最左边的移到第一个才能实现最大化
即从左到右判断

#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
int a[105];
int t;
int main(){
    cin&gt;&gt;t;
    ...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #620 (Div. 2)ABCD]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104339344</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104339344</guid><author>YeHosea</author><pubDate>Sun, 16 Feb 2020 11:00:25 +0800</pubDate><description><![CDATA[A - Two Rabbits!


签到题

#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
int t;
ll x,y,a,b;
int main(){
    cin&gt;&gt;t;
    while(t--){
        cin&gt...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #619 (Div. 2)ABC]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104307635</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104307635</guid><author>YeHosea</author><pubDate>Fri, 14 Feb 2020 10:45:31 +0800</pubDate><description><![CDATA[A. Three Strings


只需满足c的每一位等于a对应的那位或等于b对应的那位即符合条件

#include &lt;bits/stdc++.h&gt;
using namespace std;
int t;
int main(){
    cin&gt;&gt;t;
    while(t--){
        string a,b,c;
        cin&gt;&gt;a&...]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 82 (Rated for Div. 2)AB]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104292917</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104292917</guid><author>YeHosea</author><pubDate>Thu, 13 Feb 2020 12:12:24 +0800</pubDate><description><![CDATA[A. Erasing Zeroes
题意：删除多余的0，使字符串中的1是连续的
如果1只出现一次或未出现则输出0
若出现多次，每两个1之间得0都要删除
#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
int t;
string s;
int a[1000...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #614 Editorial（Div2.ABC）]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104260087</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104260087</guid><author>YeHosea</author><pubDate>Tue, 11 Feb 2020 11:24:52 +0800</pubDate><description><![CDATA[A
因为最多不会超过k
所以对s-x到s+x的范围进行枚举
#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
int a[1005];
int b[1005];
int main(){
 int t;
 cin&gt;&gt;t;
 while(t--){...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #618 Editorial（Div2.ABCD）]]></title><link>https://blog.youkuaiyun.com/YeHosea/article/details/104245645</link><guid>https://blog.youkuaiyun.com/YeHosea/article/details/104245645</guid><author>YeHosea</author><pubDate>Mon, 10 Feb 2020 11:31:22 +0800</pubDate><description><![CDATA[A
题目要求元素之和、之积均不等于0
逐个输入元素，若元素为0，则加一
计算元素总和，若等于0，则加一
#include &lt;bits/stdc++.h&gt;
using namespace std;
int t,n,a[105];
int main(){
 int t;
 cin&gt;&gt;t;
 while(t--){
  cin&gt;&gt;n;
  int sum=0;
  i...]]></description><category></category></item></channel></rss>