<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[黑球球吖的博客]]></title><description><![CDATA[不让自己的知识流失]]></description><link>https://blog.youkuaiyun.com/aaaaheiqiu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; aaaaheiqiu]]></copyright><item><title><![CDATA[最短路—G - MPI Maelstrom]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80158655</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80158655</guid><author>aaaaheiqiu</author><pubDate>Tue, 01 May 2018 19:14:20 +0800</pubDate><description><![CDATA[BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee’s research advi...]]></description><category></category></item><item><title><![CDATA[最短路—D - Silver Cow Party]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80082339</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80082339</guid><author>aaaaheiqiu</author><pubDate>Wed, 25 Apr 2018 17:03:02 +0800</pubDate><description><![CDATA[One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way ro...]]></description><category></category></item><item><title><![CDATA[搜索—A - 棋盘问题]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80055648</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80055648</guid><author>aaaaheiqiu</author><pubDate>Mon, 23 Apr 2018 20:18:17 +0800</pubDate><description><![CDATA[在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。 
Input 
输入含有多组测试数据。  
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n &amp;lt;= 8 , k &amp;lt;= ...]]></description><category></category></item><item><title><![CDATA[第一场组队赛—L - L]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80054760</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/80054760</guid><author>aaaaheiqiu</author><pubDate>Mon, 23 Apr 2018 19:10:45 +0800</pubDate><description><![CDATA[人随着岁数的增长是越大越聪明还是越大越笨，这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考，因为他在很小的时候就知道亲和串如何判断了，但是发现，现在长大了却不知道怎么去判断亲和串了，于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。  
亲和串的定义是这样的：给定两个字符串s1和s2,如果能通过s1循环移位，使s2包含在s1中，那么我们就说s2 是s1的亲和串。  
In...]]></description><category></category></item><item><title><![CDATA[组队赛—M - M]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79996380</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79996380</guid><author>aaaaheiqiu</author><pubDate>Wed, 18 Apr 2018 20:35:57 +0800</pubDate><description><![CDATA[给出一个数N，求1至N中，有多少个数不是2 3 5 7的倍数。 例如N = 10，只有1不是2 3 5 7的倍数。 
Input 
输入1个数N(1 &amp;lt;= N &amp;lt;= 10^18)。 
Output 
输出不是2 3 5 7的倍数的数共有多少。 
Sample Input 
10 
Sample Output 
1

思路：本题用的是容斥。其实数学好的话，这个题很简单的。因为里面会重复减...]]></description><category></category></item><item><title><![CDATA[J - 叠筐]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79966590</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79966590</guid><author>aaaaheiqiu</author><pubDate>Mon, 16 Apr 2018 21:09:20 +0800</pubDate><description><![CDATA[需要的时候，就把一个个大小差一圈的筐叠上去，使得从上往下看时，边筐花色交错。这个工作现在要让计算机来完成，得看你的了。 
Input 
输入是一个个的三元组，分别是，外筐尺寸n（n为大于0小于80的奇整数），中心花色字符，外筐花色字符，后二者都为ASCII可见字符； 
Output 
输出叠在一起的筐图案，中心花色与外筐花色字符从内层起交错相叠，多筐相叠时，最外筐的角总是被打磨掉。叠筐与叠筐之间应...]]></description><category></category></item><item><title><![CDATA[零碎小知识]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79511327</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79511327</guid><author>aaaaheiqiu</author><pubDate>Mon, 16 Apr 2018 20:15:46 +0800</pubDate><description><![CDATA[
puts函数和printf函数 在特殊符号(如,”等)前加上符号\。 
printf里%%表示%符号。


2.



bool cmp(pp a,pp b)
{
    return a.v&amp;gt;b.v;
}



bool cmp(pp a,pp b)
{
    if(a.v&amp;gt;b.v)
        return 1;
    return 0;
}

对于sort结构体，cmp...]]></description><category></category></item><item><title><![CDATA[分拆素数和]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79943669</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79943669</guid><author>aaaaheiqiu</author><pubDate>Sat, 14 Apr 2018 20:09:17 +0800</pubDate><description><![CDATA[把一个偶数拆成两个不同素数的和，有几种拆法呢？ 
Input 
输入包含一些正的偶数，其值不会超过10000，个数不会超过500，若遇0，则结束。 
Output 
对应每个偶数，输出其拆成不同素数的个数，每个结果占一行。 
Sample Input 
30 
26 
0 
Sample Output 
3 
2

思路：要求是把这个偶数分为两个素数。f（）就是来判断是否为素数。

第一次交 T ...]]></description><category></category></item><item><title><![CDATA[第八场积分赛—A - 小数数字]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79933655</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79933655</guid><author>aaaaheiqiu</author><pubDate>Fri, 13 Apr 2018 19:39:05 +0800</pubDate><description><![CDATA[给定一个真分数P/Q(P &amp;lt; Q)，请你求出它的小数部分都包括0~9中的哪些数字。  

例如1/2=0.5，只包含数字5；1/3=0.33333……，只包含数字3，1/7=0.142857142857……，包含数字124578。

Input 
两个整数P和Q，1 ≤ P &amp;lt; Q ≤ 1000000

Output 
从小到大输出小数部分出现的所有数字

Sample Input 
...]]></description><category></category></item><item><title><![CDATA[第八场积分赛—E - Interview with Oleg]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79889747</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79889747</guid><author>aaaaheiqiu</author><pubDate>Tue, 10 Apr 2018 23:22:01 +0800</pubDate><description><![CDATA[Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string s consisting of n lowercase English letters.

Th...]]></description><category></category></item><item><title><![CDATA[第七场积分赛—B - Two Problems]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79843863</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79843863</guid><author>aaaaheiqiu</author><pubDate>Sat, 07 Apr 2018 18:48:10 +0800</pubDate><description><![CDATA[A boy Valera registered on site Codeforces as Valera, and wrote his first Codeforces Round #300. He boasted to a friend Arkady about winning as much as x points for his first contest. But Arkady did n...]]></description><category></category></item><item><title><![CDATA[第六场积分赛—K - Can you find it?]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79839477</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79839477</guid><author>aaaaheiqiu</author><pubDate>Sat, 07 Apr 2018 10:41:27 +0800</pubDate><description><![CDATA[Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X. 
Input 
There ...]]></description><category></category></item><item><title><![CDATA[第六场积分赛—E - Optimal Symmetric Paths]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79834667</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79834667</guid><author>aaaaheiqiu</author><pubDate>Fri, 06 Apr 2018 16:41:27 +0800</pubDate><description><![CDATA[ 


题意：给一个带有数字的矩阵，你需要从左上格走到右下格。要求是路径关于右上格与左下格的连线对称且最短。问：这样的路径有多少条。

思路：看到题想当然的以为是让输出从 左上格 到 右下格 的对称路径的 最小值。当然，按照我的理解也没有把题目做出来。  在看题解时才明白求的东西是什么。手动模拟了好久才弄懂。/流泪 菜的一批。附上大佬的代码。 
    首先是个矩阵，因为路径是对称的，所以把右下部...]]></description><category></category></item><item><title><![CDATA[第六场积分赛—C - Box Game]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79831942</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79831942</guid><author>aaaaheiqiu</author><pubDate>Fri, 06 Apr 2018 11:18:21 +0800</pubDate><description><![CDATA[

思路：找规律。虽然我确实没找到这个规律，但这个规律是对的。规律为，如果n==2^k-1，那么就是Bob赢，反之就是Alice赢。

#include&amp;lt;stdio.h&amp;gt;
int main()
{
    int n;
    while(~scanf(&quot;%d&quot;,&amp;amp;n)&amp;amp;&amp;amp;n)
    {
        n++;
        while(n%2==0)//...]]></description><category></category></item><item><title><![CDATA[第五场积分赛—I -编队阵容]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79823813</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79823813</guid><author>aaaaheiqiu</author><pubDate>Thu, 05 Apr 2018 08:22:58 +0800</pubDate><description><![CDATA[Kim 正在玩一款手游，在这款游戏中，Kim可以选择若干个角色编成一队作战。为了挑战不同的关卡，Kim需要不断的调整编队阵容。然而随着游戏不断更新，队伍成员变得越来越多，Kim已经记不清哪些角色在队伍中，哪些角色不在队伍中了。请你写一个程序来帮助他。

具体来说，Kim有三种可以执行的操作。

1 x  ：把 x 号角色加入队伍。如果x号角色已经在队伍中，什么都不会发生。

2 x  ：把 x 号...]]></description><category></category></item><item><title><![CDATA[第五场积分赛—E - 选牌]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79821489</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79821489</guid><author>aaaaheiqiu</author><pubDate>Wed, 04 Apr 2018 19:42:49 +0800</pubDate><description><![CDATA[小K手中有n张牌，每张牌上有一个一位数的数，这个字数不是0就是5。小K从这些牌在抽出任意张（不能抽0张），排成一行这样就组成了一个数。使得这个数尽可能大，而且可以被90整除。

注意：

1.这个数没有前导0，

2.小K不需要使用所有的牌。

Input 
每个测试数据输入共2行。  
第一行给出一个n，表示n张牌。(1&amp;lt;=n&amp;lt;=1000)  
第二行给出n个整数a[Math Pro...]]></description><category></category></item><item><title><![CDATA[第三场积分赛—B - 循环数组]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79763162</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79763162</guid><author>aaaaheiqiu</author><pubDate>Fri, 30 Mar 2018 20:57:40 +0800</pubDate><description><![CDATA[给定包含N个整数的数组A1, A2, … AN，你可以选择任意一个Ai，将Ai旋转到数组第一项，即将数组变成：

Ai, Ai+1, Ai+2, … AN, A1, A2, …, Ai-1  

现在小Hi希望旋转之后的数组满足：

对于任意K(1 ≤ i ≤ N)，前K项的和都是正数。  

例如对于A=[3, -5, 2, -2, 3, 0]，旋转成[3, 0, 3, -5, 2, -2]满足...]]></description><category></category></item><item><title><![CDATA[第三场积分赛—A - 字符串排序]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79761861</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79761861</guid><author>aaaaheiqiu</author><pubDate>Fri, 30 Mar 2018 18:59:08 +0800</pubDate><description><![CDATA[一般我们在对字符串排序时，都会按照字典序排序。当字符串只包含小写字母时，相当于按字母表”abcdefghijklmnopqrstuvwxyz”的顺序排序。  

现在我们打乱字母表的顺序，得到一个26个字母的新顺序。例如”bdceafghijklmnopqrstuvwxyz”代表’b’排在’d’前，’d’在’c’前，’c’在’e’前……  

给定N个字符串，请你按照新的字母顺序对它们排序。

I...]]></description><category></category></item><item><title><![CDATA[最短路—A - Til the Cows Come Home]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79644789</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79644789</guid><author>aaaaheiqiu</author><pubDate>Wed, 21 Mar 2018 19:40:39 +0800</pubDate><description><![CDATA[Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get b...]]></description><category></category></item><item><title><![CDATA[最小生成树—I - Agri-Net]]></title><link>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79593911</link><guid>https://blog.youkuaiyun.com/aaaaheiqiu/article/details/79593911</guid><author>aaaaheiqiu</author><pubDate>Sat, 17 Mar 2018 17:24:13 +0800</pubDate><description><![CDATA[Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.  
Farmer John ordered a high sp...]]></description><category></category></item></channel></rss>