2015年08月_张思瑶126

原创 ACdream 1213 Matrix Multiplication

Matrix MultiplicationTime Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)Submit Statistic Next ProblemProblem Description Let us consider undirected

2015-08-27 23:46:32 728

转载 ACM训练大纲（csust）

原文网址：http://blog.csdn.net/freezhanacmore/article/details/7956436 ACM 训练大纲

2015-08-26 16:27:22 604

原创 HDU 1698 Just a Hook

Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23147 Accepted Submission(s): 11604Problem DescriptionIn the game

2015-08-26 15:23:24 554

原创 ZXPxx头文件

/***********************************ZXPxx的头文件**********************************///include#include #include #include #include #include #include #include #include #include #include #include

2015-08-26 10:12:13 800

原创 NBUT 1451 Elise （map +并查集）

[1451] Elise时间限制: 1000 ms　内存限制: 65535 K问题描述Elise is the Spider Queen. She has a skill, Spider Form(蜘蛛形态).When she transformed to the spider, there will be some small spiders arou

2015-08-25 22:51:56 1303

转载 C++ 【STL】 map的基本操作和使用

原文网址：http://blog.sina.com.cn/s/blog_61533c9b0100fa7w.html Map是c++的一个标准容器，它提供了很好一对一的关系，在一些程序中建立一个map可以起到事半功倍的效果，总结了一些map基本简单实用的操作！1. map最基本的构造函数； mapmapstring; mapmapin

2015-08-25 21:40:34 461

原创【STL】vector 用法总结

一、Vector 的部分用法：#include #include using namespace std;int main(){ vector a; a.push_back(1); a.push_back(2); a.push_back(3); a.push_back(4); a.push_back(5); for(int i =

2015-08-25 20:59:05 573

原创 C++中 pair 的用法

#include#include#include#include#include#include#include#include#includeusing namespace std;map m;pair p;int main() { p = make_pair("one",1);//make_pair(),返回一个pair类型 cout << p.

2015-08-24 17:40:27 1339

原创 NBUT 1223 Friends number

[1223] Friends number时间限制: 1000 ms　内存限制: 131072 K问题描述Paula and Tai are couple. There are many stories between them. The day Paula left by airplane, Tai send one message to telephone 22

2015-08-24 15:01:27 772

原创 NBUT 1225 NEW RDSP MODE I

[1225] NEW RDSP MODE I时间限制: 1000 ms　内存限制: 131072 K问题描述Little A has became fascinated with the game Dota recently, but he is not a good player. In all the modes, the rdsp Mode

2015-08-23 22:47:17 921

原创 HDU 4709 Herding（叉乘法）

HerdingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2194 Accepted Submission(s): 629Problem DescriptionLittle John is herd

2015-08-23 17:32:32 1612 2

原创 NBUT 题解索引

NBUT 1217 Dinner ：http://blog.csdn.net/zhang_xueping/article/details/47751181NBUT 1218 You are my brother ：http://blog.csdn.net/zhang_xueping/article/details/47752637NBUT 1219 Time ：http://blo

2015-08-23 09:18:08 773

原创 NBUT 1452 Ezreal

[1452] Ezreal时间限制: 1000 ms　内存限制: 65535 K问题描述There are a LCD (Liquid Crystal Display) on Ezreal's arm. The LCD is composed of liquid crystal, and the LCD is 16 lines and 48 rows. Ho

2015-08-22 23:40:13 688

原创 NBUT 1449 Annie

[1449] Annie时间限制: 1000 ms　内存限制: 65535 K问题描述Annie is a kawaii loli in League of Legends. High Councilor Kiersta Mandrake said that Annie may be one of the most powerful champions ever to

2015-08-22 23:03:46 642

原创 C++中 cin 与 cout 的用法

整数的基数：dec(十进制) ， oct(八进制)， hex(十六进制) 。具体实现见代码：/**************************************************/#include using namespace std;int main(){ cout.setf(ios::hex, ios::basefield); //十六进制

2015-08-22 22:36:03 2394

原创 NBUT 1455 Malphite

[1455] Malphite时间限制: 1000 ms　内存限制: 65535 K问题描述Granite Shield(花岗岩护盾) - Malphite is shielded by a layer of rock which absorbs damage up to 10% of his maximum Health.If Malphite has

2015-08-22 22:15:41 676

原创 NBUT 1450 Blitzcrank

[1450] Blitzcrank时间限制: 1000 ms　内存限制: 65535 K问题描述Blitzcrank is a robot.There are some pretty good registers(寄存器) in Blitzcrank's body.There are some instructions about register A

2015-08-22 00:05:48 1731 4

转载 string和stringstream用法总结

原文网址：http://blog.csdn.net/xw20084898/article/details/21939811一、stringstring 是 C++ 提供的字串型態，和 C 的字串相比，除了有不限长度的优点外，还有其他许多方便的功能。要使用 string，必須先加入这一行：#include 接下來要宣告一个字串变量，可以写成：stri

2015-08-21 23:24:11 3364

转载既见君子云胡不喜

或许是由于室友的原因，对胡歌的关注增加了些，虽然算不上粉丝，但还是觉得他挺好的，这是从室友那转过来的转自：http://blog.sina.com.cn/s/blog_758ea7970101491h.html原文地址：云胡不喜——致我们记忆里永远不会消失的青春和你" style="text-decoration:none; color:rgb(76,107,115)"

2015-08-21 21:12:38 1676

原创 HDU2690 Boys and girls

Boys and girlsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 900 Accepted Submission(s): 247Problem DescriptionIn a big part

2015-08-21 17:14:46 636

原创 HDU 5082 Love

LoveTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 763 Accepted Submission(s): 455Problem DescriptionThere is a Love country

2015-08-21 10:30:02 646

原创 HDU 4707 Pet

PetTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1909 Accepted Submission(s): 924Problem DescriptionOne day, Lin Ji wake up

2015-08-20 17:32:14 658

转载贪心算法

原文网址：http://blog.163.com/hadyk1111@126/blog/static/29599406200752343627495/一、算法思想贪心法的基本思路：——从问题的某一个初始解出发逐步逼近给定的目标，以尽可能快的地求得更好的解。当达到某算法中的某一步不能再继续前进时，算法停止。该算法存在问题：1. 不能保证求得的最后解是最佳的；2.

2015-08-20 00:20:39 744

原创进制转换模板（十进制 < == > 任意进制）

进制转换模板:其中包括任意进制转十进制，十进制转任意进制。

2015-08-18 22:51:49 1808

原创打印 0 1 字符串（五位）

// 方法一：暴力（这个可以有）#include using namespace std;int main(){ cout<<"00000"<<endl; cout<<"00001"<<endl; cout<<"00010"<<endl; cout<<"00011"<<endl; cout<<"00100"<<endl; cout<<"001

2015-08-18 22:45:44 616

转载数论基础讲解（转）

原文网址：http://acm.nenu.edu.cn/us/2014/08/30/%E6%95%B0%E8%AE%BA%E5%9F%BA%E7%A1%80%E8%AE%B2%E8%A7%A3/数论，顾名思义，是对整数进行研究的理论。是数学学科的一个重要分支，也是ACM竞赛题型中饶有趣味的一个部分。　　数论，有人戏称为“素论”。可见对于素数的研究在数论中比重之大

2015-08-18 22:38:42 1226

原创 NBUT 1220 SPY

[1220] SPY时间限制: 1000 ms　内存限制: 131072 K问题描述The National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’sconf

2015-08-18 20:12:39 1018

原创 NBUT 1218 You are my brother

[1218] You are my brother时间限制: 1000 ms　内存限制: 131072 K问题描述Little A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A w

2015-08-18 15:47:16 992

原创 NBUT 1219 Time

[1219] Time时间限制: 1000 ms　内存限制: 131072 K问题描述Digital clock use 4 digits to express time, each digit is described by 3*3 characters (including”|”,”_”and” “).now given the current time, plea

2015-08-18 14:53:13 599

原创 NBUT 1217 Dinner

[1217] Dinner时间限制: 1000 ms　内存限制: 32768 K问题描述Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl, kni

2015-08-18 14:16:48 655

原创 UVA 12657 Boxes in a Line

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4395题目意思是说，给出一个数n，表示存在一个整数序列1……n，然后进行四种操作：操作一：输入x，y，表示将x移到y的左边（若x本来就在y的左边则忽略）；操作二：输入x，y，表

2015-08-17 21:50:40 963

原创 HDU 3342 Legal or Not

Legal or NotTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6069 Accepted Submission(s): 2818Problem DescriptionACM-DIY is a

2015-08-17 10:24:28 698

原创 spfa模板和拓扑排序模板（HDU1874 和 HDU3342）

//SPFA模版：//HDU 1874#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef __int64 LL;const

2015-08-16 23:51:34 429

原创 HDU 1796 How many integers can you find

How many integers can you find Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, and M-integer set is {2,3}, so there i

2015-08-16 10:00:02 766

原创 HDU 1014 Uniform Generator

Uniform GeneratorComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere '%' is the modulus operator.

2015-08-16 00:09:51 860

转载 CSDN博客积分规则和获取积分方法

原文网址：http://blog.csdn.net/ygzk123/article/details/8172594博客积分是衡量博客水平的重要标准，博客的排名也将按照积分排列。积分规则具体如下： 1、每发布一篇原创或者翻译文章：可获得10分 2、每发布一篇转载文章：可获得2分 3、博主的文章每被评论一次：可获得1分 4、每发表一次评论：可获得1分（自己给自己评论、博主回

2015-08-15 21:53:54 405

原创 HDU 3460 Ancient Printer (字典树)

Ancient PrinterThe contest is beginning! While preparing the contest, iSea wanted to print the teams' names separately on a single paper. Unfortunately, what iSea could find was only an ancient printer: so ancient that you can't believe it, it only had

2015-08-15 17:28:33 791

空空如也

空空如也