77cc-优快云博客

原创大麦自动抢票

利用python+selenium+tk写的大麦自动抢票GUI已封装成exe文件，无需配置环境，直接可以使用github链接：https://github.com/caijichang/Auto-damai欢迎大家star和fork写的有些烂，bug很多，有任何问题和疑问请联系QQ：1330043465（备注大麦抢票）...

2020-01-30 18:56:50 3253 1

A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and "carbon". Note that the empty string is not cons

2017-07-27 09:47:11 815

原创 Repository

When you go shopping, you can search in repository for avalible merchandises by the computers and internet. First you give the search system a name about something, then the system responds with the r

2017-07-27 09:33:23 549

原创 Hat’s Words

A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat’s words in a dictionary. InputStandard input consis

2017-07-27 09:19:59 454

原创 What Are You Talking About

Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want

2017-07-27 09:13:39 756

原创 poj2185Milking Grid（未完待续）

Milking GridTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8776 Accepted: 3820DescriptionEvery morning when they are milked, the Farmer John's cows for

2017-07-22 16:54:21 361

原创 po2406Power Strings

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 49274 Accepted: 20527DescriptionGiven two strings a and b we define a*b to be their concate

2017-07-22 11:02:02 368

原创 Count the string

It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example: s: "aba

2017-07-21 17:43:17 364

原创 Oulipo

he French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: Tout avait Pair normal, mais tout

2017-07-21 17:31:57 620

原创 D - A + B for you again

Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of the addition between

2017-07-21 17:20:39 797

原创 Clairewd’s message

Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sending it to ykwd. They had agreed that each letter of these mes

2017-07-21 17:07:31 419

原创 POJ 1703

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46068 Accepted: 14176DescriptionThe police office in Tadu City decides to say ends

2017-07-19 20:33:09 323

转载生动形象的描述并查集（转）

并查集是我暑假从高手那里学到的一招，觉得真是太精妙的设计了。以前我无法解决的一类问题竟然可以用如此简单高效的方法搞定。不分享出来真是对不起party了。（party：我靠，关我嘛事啊？我跟你很熟么？）来看一个实例，HDU1232畅通工程首先在地图上给你若干个城镇，这些城镇都可以看作点，然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整幅图的连通性问题。比如随意给你两个

2017-07-19 10:38:52 454

转载并查集与带权并查集（转）

转自Chris_zzj的博客！并查集并查集是一个很高效算法，理解起来也很简单，写起来更简单。①fat[i] = i;②找到一个点的祖先[cpp] view plain copyint findfat(int x) { if(fat[x] == x) return x;

2017-07-19 10:36:13 1434

原创 Is It A Tree?

A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. There

2017-07-18 19:05:04 377

原创棋盘问题 POJ - 1321

在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n 当为-1 -1时表示输入结束

2017-07-13 15:54:35 303

原创 A - 迷宫问题 POJ - 3984

定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。Input一个5

2017-07-13 15:48:18 500

原创二叉树排序查找

Elven PostmanTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionElves are very peculiar creatures. As we all know, they can live for a ve

2017-07-05 16:58:54 647

原创满二叉树编号问题

S-Trees(满二叉树数组保存与编号)A Strange Tree (S-tree) over the variable set Xn = {x1,x2,...,xn} is a binary tree representing a Boolean function f:{0,1}->{0,1}. Each path of the S-tree begins at the r

2017-07-05 15:24:02 981

原创线性表的链式结构创建与实现（一）

个人理解，仅供参考创建链表的步骤：1：创建头指针2：将头指针指向空，防止野指针3：将新的指针移动到头指针（我习惯认为是将头指针赋值给它）4：建立新结点5：让新指正指向空，防止野指针6：给新指针赋值7：让尾指针指向当前指针，实现链表的连接（我习惯认为是让上一指针指向它）8：将尾指针移向当前指针（我习惯认为将当前指针赋值给它）***每次创建新指针的时候都要将指针

2017-07-04 14:26:58 1654

原创线性表的顺式储存结构与实现

//数组的形式表示顺序表 #includeusing namespace std;//建立非空的顺序表（长度为len，整型） void CreateSequence(int *sequence,int len){ int value; for(int count=0;count<len;count++) //count用来计数 { cin>>value;

2017-07-04 11:17:15 700

原创根据前序遍历，中序遍历求后序遍历

Binary Tree Traversals Time Limit: 1000/1000 MS Memory Limit: 32768/32768 KA binary tree is a finite set of vertices that is either empt

2017-07-03 10:12:56 2822

原创 ZOJ Problem Set - 1488

NavigationTime Limit: 2 Seconds Memory Limit: 65536 KB There is a computer game which had been quite popular in China about 7 years ago named "Uncharted Waters II". This game has severa

2017-06-30 18:58:14 357

原创 ZOJ Problem Set - 1331

Perfect CubesTime Limit: 10 Seconds Memory Limit: 32768 KB For hundreds of years Fermat's Last Theorem, which stated simply that for n > 2 there exist no integers a, b, c > 1 such that

2017-06-30 15:57:48 436

原创 ZOJ Problem Set - 1292

Integer InquiryTime Limit: 2 Seconds Memory Limit: 65536 KB One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to

2017-06-30 12:39:29 332

原创 ZOJ Problem Set - 1242

Carbon DatingTime Limit: 2 Seconds Memory Limit: 65536 KB Until the second half of the 20th century, determining the actual age of an archaeological find had been more or less a matter

2017-06-30 10:16:48 400

原创 ZOJ Problem Set - 1216

DeckTime Limit: 2 Seconds Memory Limit: 65536 KB ScenarioA single playing card can be placed on a table, carefully, so that the short edges of the card are parallel to the table's edg

2017-06-29 22:31:24 341

原创 ZOJ Problem Set - 1205

Martian AdditionTime Limit: 2 Seconds Memory Limit: 65536 KB In the 22nd Century, scientists have discovered intelligent residents live on the Mars. Martians are very fond of mathemat

2017-06-29 19:52:25 362

原创 ZOJ Problem Set - 1115

Digital RootsTime Limit: 2 Seconds Memory Limit: 65536 KB BackgroundThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a

2017-06-29 16:33:11 486

ACM77的博客