<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[_caorui_blog]]></title><description><![CDATA[努力，坚持。]]></description><link>https://blog.youkuaiyun.com/xiaorui98</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xiaorui98]]></copyright><item><title><![CDATA[ALi-2020/3/27-1]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/105136627</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/105136627</guid><author>xiaorui98</author><pubDate>Fri, 27 Mar 2020 11:02:14 +0800</pubDate><description><![CDATA[题目：给定两个字符串S、T，保证0&lt;|S|=|T|&lt;100000；即长度相等，先输入S、后输入T，若S经过变换可以变为T，则输出对应的变换次数，若不行，则输出-1。变换是指把某个字母放到字符串的末尾。串由小写字母组成。

例子：

  输入：

  acdk

  ckad

  输出：

  2

说明：第一步把a提到末尾，第二步把d提到末尾。

思路：是否可以...]]></description><category></category></item><item><title><![CDATA[CCF——2015/12——第一题——数位之和（100分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/105132499</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/105132499</guid><author>xiaorui98</author><pubDate>Fri, 27 Mar 2020 00:42:17 +0800</pubDate><description><![CDATA[试题编号：
			201512-1
		试题名称：
			数位之和
		时间限制：
			1.0s
		内存限制：
			256.0MB
		问题描述：
			
			问题描述

			　　给定一个十进制整数n，输出n的各位数字之和。

			输入格式

			　　输入一个整数n。

			输出格式

			　　输出一个整数，表示答案。

			样例输入

			20151220

			样例输出...]]></description><category></category></item><item><title><![CDATA[CCF——2013/12——第一题——出现次数最多的数（100分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/104256745</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/104256745</guid><author>xiaorui98</author><pubDate>Mon, 10 Feb 2020 23:20:40 +0800</pubDate><description><![CDATA[100分


#include &lt;iostream&gt;
#include &lt;cmath&gt;
#include &lt;algorithm&gt;

using namespace std;

const int MAXN = 1e4+10;
const int MINN = -10;
int a[MAXN];
 
int main(void)
{
	for(int i=0; ...]]></description><category></category></item><item><title><![CDATA[CCF——2019/12/15——第五题——魔数（10分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/103603348</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/103603348</guid><author>xiaorui98</author><pubDate>Wed, 18 Dec 2019 19:30:47 +0800</pubDate><description><![CDATA[题目链接


/*10分....*/

#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;


using namespace std;

const int M = 1e5;
int a[M];

int f(int x){
	return x ...]]></description><category></category></item><item><title><![CDATA[CCF——2019/12/15——第三题——化学方程式（30分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/103603329</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/103603329</guid><author>xiaorui98</author><pubDate>Wed, 18 Dec 2019 19:29:54 +0800</pubDate><description><![CDATA[/*30分....*/

#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;


using namespace std;

const int M = 53;
int a[M];//等号前面的各元素个数 
int b[M];//等号后面的各元素个...]]></description><category></category></item><item><title><![CDATA[CCF——2019/12/15——第二题——回收站选址（100分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/103603315</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/103603315</guid><author>xiaorui98</author><pubDate>Wed, 18 Dec 2019 19:28:46 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;

using namespace std;

const int M = 6;
const int MAX=1006;

int a[M];//存放每个得分的选址个数 

struct Node{...]]></description><category></category></item><item><title><![CDATA[CCF——2019/12/15——第一题——报数（100分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/103603308</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/103603308</guid><author>xiaorui98</author><pubDate>Wed, 18 Dec 2019 19:28:08 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;

using namespace std;

const int M = 4;
int a[M+1];


bool function(int i){
	int a;
	while(i){
		a...]]></description><category></category></item><item><title><![CDATA[HDU-1425 sort]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/102959895</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/102959895</guid><author>xiaorui98</author><pubDate>Thu, 07 Nov 2019 17:51:02 +0800</pubDate><description><![CDATA[sort
			Time Limit: 6000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)
			Total Submission(s): 76053Accepted Submission(s): 19980
			
			Problem Description

			给你n个整数，请按...]]></description><category></category></item><item><title><![CDATA[Openacc优化矩阵乘法]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/101612805</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/101612805</guid><author>xiaorui98</author><pubDate>Sat, 28 Sep 2019 14:05:53 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdlib&gt;
#include &lt;chrono&gt;

#define N 1000//可以更改大小

using namespace std;
using namespace std::chrono;

double a[N][N], b[N][N], c[N][N];

int main()
{
...]]></description><category></category></item><item><title><![CDATA[常见模板]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/101317770</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/101317770</guid><author>xiaorui98</author><pubDate>Tue, 24 Sep 2019 22:43:48 +0800</pubDate><description><![CDATA[1、闰年


#include &lt;iostream&gt;

using namespace std;

//计算闰年数
int leapyear(int year){
	return((year%4==0)&amp;&amp;(year%100!=0)) || (year%400==0) ? 1 : 0;
}  

int main(void)
{
	int n;
	cin &gt;&gt...]]></description><category></category></item><item><title><![CDATA[CCF——2019/09——第二题——小明种苹果（续）（50分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/101173092</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/101173092</guid><author>xiaorui98</author><pubDate>Sun, 22 Sep 2019 21:18:08 +0800</pubDate><description><![CDATA[50分


#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;

using namespace std;

const int N = 1e4+10;
int a[N];
int b[N];//标记数...]]></description><category></category></item><item><title><![CDATA[CCF——2019/09——第一题——小明种苹果（100分）]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/101173066</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/101173066</guid><author>xiaorui98</author><pubDate>Sun, 22 Sep 2019 21:17:28 +0800</pubDate><description><![CDATA[100分


#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;

using namespace std;

const int N = 1e4+10;
int a[N][N];
int b[N];/...]]></description><category></category></item><item><title><![CDATA[Backward Digit Sums POJ - 3187]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/100110966</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/100110966</guid><author>xiaorui98</author><pubDate>Wed, 28 Aug 2019 00:18:58 +0800</pubDate><description><![CDATA[FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 &lt;= N &lt;= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. ...]]></description><category></category></item><item><title><![CDATA[Smallest Difference POJ - 2718]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/100108976</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/100108976</guid><author>xiaorui98</author><pubDate>Tue, 27 Aug 2019 21:35:16 +0800</pubDate><description><![CDATA[Given a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some order. The remaining digits can be written down in some orde...]]></description><category></category></item><item><title><![CDATA[CodeForce   Tic-Tac-Toe]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/100068111</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/100068111</guid><author>xiaorui98</author><pubDate>Sun, 25 Aug 2019 21:34:00 +0800</pubDate><description><![CDATA[Two bears are playing tic-tac-toe via mail. It's boring for them to play usual tic-tac-toe game, so they are a playing modified version of this game. Here are its rules.

The game is played on the fol...]]></description><category></category></item><item><title><![CDATA[2019CCPC网络赛——1003——K-th occurrence]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/100047243</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/100047243</guid><author>xiaorui98</author><pubDate>Fri, 23 Aug 2019 22:54:21 +0800</pubDate><description><![CDATA[K-th occurrence

Time Limit: 5000/5000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 0Accepted Submission(s): 0


Problem Description

You are given a st...]]></description><category></category></item><item><title><![CDATA[2019 CCPC网络赛——1007——Windows Of CCPC]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/100047212</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/100047212</guid><author>xiaorui98</author><pubDate>Fri, 23 Aug 2019 22:51:16 +0800</pubDate><description><![CDATA[Windows Of CCPC

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0Accepted Submission(s): 0


Problem Description

In recent years, CCPC h...]]></description><category></category></item><item><title><![CDATA[Fence Repair POJ - 3253]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/99653289</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/99653289</guid><author>xiaorui98</author><pubDate>Thu, 15 Aug 2019 19:48:19 +0800</pubDate><description><![CDATA[Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN(1 ≤N≤ 20,000) planks of wood, each having some integer lengthLi(1 ≤Li...]]></description><category></category></item><item><title><![CDATA[Saruman's Army POJ - 3069]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/99649835</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/99649835</guid><author>xiaorui98</author><pubDate>Thu, 15 Aug 2019 18:43:19 +0800</pubDate><description><![CDATA[ithinRunits of some palantir.

Input

The input test file will contain multiple cases. Each test case begins with a single line containing an integerR, the maximum effective range of all palantirs ...]]></description><category></category></item><item><title><![CDATA[Meteor Shower POJ - 3669]]></title><link>https://blog.youkuaiyun.com/xiaorui98/article/details/99078197</link><guid>https://blog.youkuaiyun.com/xiaorui98/article/details/99078197</guid><author>xiaorui98</author><pubDate>Sat, 10 Aug 2019 15:30:26 +0800</pubDate><description><![CDATA[Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they hit. Anxious for her safety, she vows to find her way to a sa...]]></description><category></category></item></channel></rss>