<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[迷路的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_40967787</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_40967787]]></copyright><item><title><![CDATA[N皇后]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/96477637</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/96477637</guid><author>qq_40967787</author><pubDate>Thu, 26 Nov 2020 17:47:09 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;
using namespace std;
const int MAX = 110;
int a[MAX][MAX],ver[MAX],L[2*MAX],R[2*MAX];  ///ver表示竖线,L表示左斜线,R表示右斜线
int ans = 0;

void print(int n){
    for(int i = 0;i&lt;n...]]></description><category></category></item><item><title><![CDATA[2020 年 “联想杯”全国高校程序设计在线邀请赛暨第三届上海理工大学程序设计竞赛 C. Cheat Sheet]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/106468915</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/106468915</guid><author>qq_40967787</author><pubDate>Mon, 01 Jun 2020 11:24:07 +0800</pubDate><description><![CDATA[题目：


University of Shanghai for Science and Technology starts a course calledFilm Appreciation ofBlack Albumrecently. To be the best “Blackologist” in the university, Setsuna is actively preparing for the exam.

The examination of the course is open bo...]]></description><category></category></item><item><title><![CDATA[01背包模板]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/103074355</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/103074355</guid><author>qq_40967787</author><pubDate>Thu, 14 Nov 2019 20:28:51 +0800</pubDate><description><![CDATA[一维数组


//求解将哪些物品装入背包可使价值总和最大 
#include &lt;iostream&gt;
#include&lt;cstring&gt;
using namespace std;
const int nmax=1000;
 
int v[nmax];//v[i]表示第i个物品的价值value 
int w[nmax];//w[i]表示第i个物品的重量weight 
int ...]]></description><category></category></item><item><title><![CDATA[hdu 1032 The 3n + 1 problem]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/90452410</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/90452410</guid><author>qq_40967787</author><pubDate>Wed, 22 May 2019 21:41:27 +0800</pubDate><description><![CDATA[The 3n + 1 problem

注意很坑！！！

i 和 j 的大小

Problem Description


Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this p...]]></description><category></category></item><item><title><![CDATA[hdu 1003 Max Sum]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/90049456</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/90049456</guid><author>qq_40967787</author><pubDate>Thu, 09 May 2019 22:47:07 +0800</pubDate><description><![CDATA[Max Sum

Problem Description


Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + ...]]></description><category></category></item><item><title><![CDATA[汉诺塔问题]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/89740435</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/89740435</guid><author>qq_40967787</author><pubDate>Wed, 01 May 2019 21:46:45 +0800</pubDate><description><![CDATA[汉诺塔







问题链接：https://www.jisuanke.com/course/2291/182230

问题分析：

参考博客：http://www.cnblogs.com/xxNote/p/3965739.html

先把n-1个盘子从A移动到B，剩下最大的那个盘子在A（这时所移动的次数为f (n-1) ）
	再将最大的那个盘子移到C盘，（这时所移动的次数为 f (n-1)...]]></description><category></category></item><item><title><![CDATA[hdu 2058 The sum problem]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/89441830</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/89441830</guid><author>qq_40967787</author><pubDate>Sun, 21 Apr 2019 23:42:32 +0800</pubDate><description><![CDATA[Problem Description


Given a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.


Input


Input contains multiple test cases. each ...]]></description><category></category></item><item><title><![CDATA[hdu 2057 A + B Again]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/89440209</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/89440209</guid><author>qq_40967787</author><pubDate>Sun, 21 Apr 2019 22:13:45 +0800</pubDate><description><![CDATA[A + B Again

Problem Description


There must be many A + B problems in our HDOJ , now a new one is coming.
Give you two hexadecimal integers , your task is to calculate the sum of them,and print it i...]]></description><category></category></item><item><title><![CDATA[2019中山大学程序设计竞赛（重现赛） Coding Problem]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/89423297</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/89423297</guid><author>qq_40967787</author><pubDate>Sat, 20 Apr 2019 21:05:03 +0800</pubDate><description><![CDATA[Coding Problem

Problem Description


Here is the logic.I am the brother of mata Chuang.Mata chuang is the brother of cxk.So what am I?Am I the grand-brother of cxk?Or am I in a position that same bro...]]></description><category></category></item><item><title><![CDATA[hdu 2054 A == B ?]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/81865688</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/81865688</guid><author>qq_40967787</author><pubDate>Thu, 18 Apr 2019 22:54:58 +0800</pubDate><description><![CDATA[A == B ?

Problem Description


Give you two numbers A and B, if A is equal to B, you should print "YES", or print "NO".




Input


each test case contains two numbers A and B.




Output


for eac...]]></description><category></category></item><item><title><![CDATA[hdu 2055 An easy problem]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/81865850</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/81865850</guid><author>qq_40967787</author><pubDate>Tue, 16 Apr 2019 21:51:03 +0800</pubDate><description><![CDATA[An easy problem

Problem Description


we define f(A) = 1, f(a) = -1, f(B) = 2, f(b) = -2, ... f(Z) = 26, f(z) = -26;
Give you a letter x and a number y , you should output the result of y+f(x)


Inpu...]]></description><category></category></item><item><title><![CDATA[hdu 2030 汉字统计]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/81230986</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/81230986</guid><author>qq_40967787</author><pubDate>Tue, 09 Apr 2019 22:50:28 +0800</pubDate><description><![CDATA[汉字统计

Problem Description


统计给定文本文件中汉字的个数。


Input


输入文件首先包含一个整数n，表示测试实例的个数，然后是n段文本。


Output


对于每一段文本，输出其中的汉字的个数，每个测试实例的输出占一行。
[Hint:]从汉字机内码的特点考虑~


Sample Input


2

WaHaHa! WaHaHa! 今年过节不说话要说只说普通...]]></description><category></category></item><item><title><![CDATA[hdu 2023 求平均成绩]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/81155017</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/81155017</guid><author>qq_40967787</author><pubDate>Mon, 18 Mar 2019 23:06:39 +0800</pubDate><description><![CDATA[求平均成绩

问题描述

假设一个班有n个（n &lt;= 50）个学生，每人考m个（m &lt;= 5）门课，求每个学生的平均成绩和每门课的平均成绩，并输出各科成绩均大于等于平均成绩的学生数量。





输入

输入数据有多个测试实例，每个测试实例的第一行包括两个整数Ñ和米，分别表示学生数和课程数然后是Ñ行数据，每行包括米个整数（即：考试分数）。 。





输出

对于每个测试实例...]]></description><category></category></item><item><title><![CDATA[Not so Mobile UVA 839]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/88544262</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/88544262</guid><author>qq_40967787</author><pubDate>Thu, 14 Mar 2019 00:01:17 +0800</pubDate><description><![CDATA[输入一个树状天平，根据力矩相等原则判断是否平衡。如图6-5所示，所谓力矩相等，就是WlDl=WrDr，其中Wl和Wr分别为左右两边砝码的重量，D为距离。采用递归（先序）方式输入：每个天平的格式为Wl，Dl，Wr，Dr，当Wl或Wr为0时，表示该“砝码”实际是一个子天平，接下来会描述这个子天平。当Wl=Wr=0时，会先描述左子天平，然后是右子天平。



样例输入：
1
0 2 0 ...]]></description><category></category></item><item><title><![CDATA[hdu 2001 计算两点间的距离]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/81741605</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/81741605</guid><author>qq_40967787</author><pubDate>Thu, 27 Dec 2018 11:25:43 +0800</pubDate><description><![CDATA[计算两点间的距离

Problem Description

输入两点坐标（X1,Y1）,（X2,Y2）,计算并输出两点间的距离。

 

 

Input

输入数据有多组，每组占一行，由4个实数组成，分别表示x1,y1,x2,y2,数据之间用空格隔开。

 

 

Output

对于每组输入数据，输出一行，结果保留两位小数。

 

 

Sample Input

0 0 0 1

0 ...]]></description><category></category></item><item><title><![CDATA[hdu 2032 杨辉三角]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/81286305</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/81286305</guid><author>qq_40967787</author><pubDate>Sun, 23 Dec 2018 15:32:49 +0800</pubDate><description><![CDATA[杨辉三角

Problem Description

还记得中学时候学过的杨辉三角吗？具体的定义这里不再描述，你可以参考以下的图形：
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1

 

 

Input

输入数据包含多个测试实例，每个测试实例的输入只包含一个正整数n（1&amp;lt;=n&amp;lt;=30），表示将要输出的杨辉三角的层数。

 

 

Outp...]]></description><category></category></item><item><title><![CDATA[hdu 2094 产生冠军]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/84980720</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/84980720</guid><author>qq_40967787</author><pubDate>Wed, 12 Dec 2018 22:57:42 +0800</pubDate><description><![CDATA[产生冠军

Problem Description


有一群人，打乒乓球比赛，两两捉对撕杀，每两个人之间最多打一场比赛。
球赛的规则如下：
如果A打败了B，B又打败了C，而A与C之间没有进行过比赛，那么就认定，A一定能打败C。
如果A打败了B，B又打败了C，而且，C又打败了A，那么A、B、C三者都不可能成为冠军。
根据这个规则，无需循环较量，或许就能确定冠军。你的任务就是面对一群比赛选手，在经过...]]></description><category></category></item><item><title><![CDATA[hdu 2018 母牛的故事]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/81078896</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/81078896</guid><author>qq_40967787</author><pubDate>Sun, 09 Dec 2018 17:54:48 +0800</pubDate><description><![CDATA[母牛的故事

问题描述

有一头母牛，它每年年初生一头小母牛。每头小母牛从第四个年头开始，每年年初也生一头小母牛。请编程实现在第Ñ年的时候，共有多少头母牛？

 

 

输入

输入数据由多个测试实例组成，每个测试实例占一行，包括一个整数n（0 &amp;lt;n &amp;lt;55），n的含义如题目中描述
.n = 0表示输入数据的结束，不做处理。

 

 

输出

对于每个测试实例，输出在第ň年的时候...]]></description><category></category></item><item><title><![CDATA[noi 06:循环数]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/84930021</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/84930021</guid><author>qq_40967787</author><pubDate>Sun, 09 Dec 2018 17:53:10 +0800</pubDate><description><![CDATA[全局题号：1953

总时间限制:

1000ms

内存限制:

65536kB

描述


若一个n位的数字串满足下述条件，则称其是循环数（cyclic）：将这个数字串视为整数（可能带有前导0），并用任意一个 1 到 n 之间（包含1和n）的整数去乘它时, 会得到一个将原数字串首尾相接后，再在某处断开而得到的新数字串所对应的整数。例如，数字 142857 是循环数，因为:
142857 *1 ...]]></description><category></category></item><item><title><![CDATA[hdu 1039 I Think I Need a Houseboat]]></title><link>https://blog.youkuaiyun.com/qq_40967787/article/details/84728931</link><guid>https://blog.youkuaiyun.com/qq_40967787/article/details/84728931</guid><author>qq_40967787</author><pubDate>Sun, 02 Dec 2018 22:39:52 +0800</pubDate><description><![CDATA[I Think I Need a Houseboat

Problem Description


Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the stat...]]></description><category></category></item></channel></rss>