GRADE:C
文章平均质量分 57
JeraKrs
本人目前就职于百度商业研发部,有需要内推的朋友简历可发我邮箱 jerakrs@qq.com
展开
-
uva 196 Spreadsheet(拓扑排序+DFS)
Spreadsheet In 1979, Dan Bricklin and Bob Frankston wrote VisiCalc, the first spreadsheet application. It became a huge success and, at that time, was the killer application for the Ap原创 2013-08-01 20:30:16 · 2158 阅读 · 0 评论 -
uva 10129 Play on Words(欧拉道路)
Play on WordsSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the pu原创 2013-08-01 00:05:12 · 1425 阅读 · 0 评论 -
uva 10916 Factstone Benchmark(对数函数的活用)
技巧很实用。原创 2013-07-31 13:15:03 · 1858 阅读 · 0 评论 -
uva 11234 Expressions(后缀变层次)
ExpressionsArithmetic expressions are usually written with the operators in between the two operands (which is called infix notation). For example, (x+y)*(z-w) is an arithmetic expression in inf原创 2013-07-18 15:13:07 · 1205 阅读 · 0 评论 -
uva 10004 Bicoloring(并查集)
Bicoloring In 1976 the ``Four Color Map Theorem" was proven with the assistance of a computer. This theorem states that every map can be colored using only four colors, in such a way tha原创 2013-08-01 00:10:20 · 1541 阅读 · 0 评论 -
uva 216 Getting in Line(暴力枚举)
Getting in Line Computer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are chained together原创 2013-07-20 01:32:11 · 1330 阅读 · 0 评论 -
uva 424 Integer Inquiry(高精度加法)
Integer Inquiry 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 333 and he explored taking various sums of原创 2013-07-25 20:55:53 · 1205 阅读 · 0 评论 -
uva 465 Overflow(借助double型进行比较)
Overflow Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be原创 2013-07-25 21:03:56 · 1417 阅读 · 0 评论 -
uva 568 Just the Facts(f分解因子)
Just the Facts The expression N!, read as ``N factorial," denotes the product of the first N positive integers, where N is nonnegative. So, for example,NN!0原创 2013-07-26 15:21:10 · 1124 阅读 · 0 评论 -
uva 127 ``Accordian'' Patience(栈+模拟)
``Accordian'' Patience You are to simulate the playing of games of ``Accordian'' patience, the rules for which are as follows:Deal cards one by one in a row from left to right, n原创 2013-07-07 10:16:55 · 1651 阅读 · 0 评论 -
uva 112 Tree Summing(建树+遍历)
Tree Summing BackgroundLISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are th原创 2013-07-31 13:41:04 · 2312 阅读 · 10 评论 -
uva 297 Quadtrees
test#include#include#includeusing namespace std;#define N 10000int sum;char *move;void build(int n);int cut(char *t,int f) // 对 'p' 与 'f' 相遇时,'p'的后续子树进行删除{ for(int i=0;原创 2013-07-07 09:25:44 · 1491 阅读 · 0 评论 -
uva 10115 Automatic Editing(strstr函数查找子串)
Automatic EditingSource file:autoedit.{c, cpp, java, pas}Input file:autoedit.inOutput file:autoedit.outText-processing tools like awk and sed allow you to aut原创 2013-07-25 00:23:39 · 1580 阅读 · 0 评论 -
uva 10474 Where is the Marble?(计数排序)
Where is the Marble? Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after ano原创 2013-07-20 00:33:17 · 1281 阅读 · 0 评论 -
uva 10194 Football (aka Soccer)(字符串处理+sort排序)
Football (aka Soccer) The ProblemFootball the most popular sport in the world (americans insist to call it "Soccer", but we will call it "Football"). As everyone knows, Brasil原创 2013-07-28 16:16:43 · 2241 阅读 · 0 评论 -
uva 10014 Simple calculations(公式推导)
Simple calculations The ProblemThere is a sequence of n+2 elements a0, a1,…, an+1 (n i 1000). It is known that ai = (ai–1 + ai+1)/2 – ci for each i=1, 2, ..., n. You are given a0,原创 2013-07-31 13:31:28 · 1323 阅读 · 0 评论 -
uva 10110 Light, more light(因子的特性)
Light, more lightThe ProblemThere is man named "mabu" for switching on-off light in our University. He switches on-off the lights in a corridor. Every bulb has its own toggle switch.原创 2013-07-26 14:51:51 · 1044 阅读 · 0 评论 -
uva 699 The Falling Leaves(建树)
The Falling Leaves Each year, fall in the North region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the tr原创 2013-07-07 14:04:32 · 1100 阅读 · 0 评论 -
uva 705 Slash Maze(几何转换+DFS)
Slash Maze By filling a rectangle with slashes (/) and backslashes ( ), you can generate nice little mazes. Here is an example:As you can see, paths in the maze cannot bran原创 2013-08-01 20:49:23 · 1575 阅读 · 0 评论 -
uva 10557 XYZZY(DFS+BFS)
XYZZYADVENT: /ad�vent/, n.The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed fantasy gaming, and expande原创 2013-08-01 20:43:45 · 1910 阅读 · 0 评论 -
uva 11205 The Broken Pedometer
The Broken Pedometer The ProblemA marathon runner uses a pedometer with which he is having problems. In the pedometer the symbols are represented by seven segments (or LEDs):But原创 2013-07-17 13:05:45 · 1210 阅读 · 0 评论 -
uva 10106 Product(高精度乘法)
Product The ProblemThe problem is to multiply two integers X, Y. (0250)The InputThe input will consist of a set of pairs of lines. Each line in pair contains one multip原创 2013-07-25 20:59:16 · 1565 阅读 · 0 评论 -
uva 10494 If We Were a Child Again(高精度与低精度求模和商)
If We Were a Child AgainInput: standard inputOutput: standard outputTime Limit: 7 seconds “Oooooooooooooooh!If I could do the easy mathematics like my school days!!I can guarante原创 2013-07-25 21:09:07 · 1363 阅读 · 0 评论 -
uva 123 Searching Quickly(遍历+排序)
Searching Quickly BackgroundSearching and sorting are part of the theory and practice of computer science. For example, binary search provides a good example of an easy-to-unde原创 2013-07-28 15:57:13 · 1581 阅读 · 0 评论 -
poj 1094 Sorting It All Out(拓扑排序 + 邻接表)
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24176 Accepted: 8361DescriptionAn ascending sorted sequence of distinct values is on原创 2013-08-03 15:50:02 · 1526 阅读 · 0 评论 -
uva 539 The Settlers of Catan
The Settlers of Catan Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted w原创 2013-07-16 14:06:09 · 1418 阅读 · 1 评论 -
uva 305 Joseph(约瑟夫环解+打表)
Joseph The Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, ..., n, standing in circle every mth is原创 2013-08-01 00:05:35 · 1907 阅读 · 0 评论 -
uva 208 Firetruck (DFS + 并查集)
Firetruck The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given原创 2013-08-04 14:09:20 · 1240 阅读 · 0 评论 -
poj 2756 Autumn is a Genius(高精度加法)
题目连接:http://poj.org/problem?id=2756题目大意:求两个数的和,题目给出了上限,却没有给出下限,所以可以是负的无穷大。解题思路:模板套用(写模板的时候有考虑正负)。模板连接:http://blog.csdn.net/keshuai19940722/article/details/10087993int main()原创 2013-08-20 00:06:37 · 1547 阅读 · 0 评论 -
hdu 1297 Children’s Queue(高精度加法+情况分析+打表)
题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1297题目大意:校长要给孩子们排队,要求不能有单独的女孩子站在最后,问,对于n个人(男女不限)的合法队列有多少。解题思路:num[n] = num[i - 1] + num[ i - 2] + num[i - 4];不懂的话介绍一篇:http://www.cnblogs.co原创 2013-08-20 10:28:47 · 981 阅读 · 0 评论 -
hdu 3068 最长回文(manachar求最长回文子串)
题目连接:hdu 3068 最长回文解题思路:通过manachar算法求最长回文子串,如果用遍历的话绝对超时。#include #include const int N = 220005;int rad[N];char string[N], tmpstr[N];int max(int a, int b) { return a > b ? a : b;原创 2013-08-19 23:53:02 · 1372 阅读 · 0 评论 -
hdu 4642 Fliping game
DescriptionAlice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board with one in each grid and every coin may be upw原创 2013-08-08 00:35:05 · 978 阅读 · 0 评论 -
uva 185 Roman Numerals (深搜+字符串处理)
Roman Numerals The original system of writing numbers used by the early Romans was simple but cumbersome. Various letters were used to represent important numbers, and these were then原创 2013-08-08 08:51:40 · 1467 阅读 · 0 评论 -
hdu 1250 Hat's Fibonacci(高精度加法+缩进+斐波那契数)
题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1250题目大意:求一个斐波那契数列的第n 项, n的上限是10000.解题思路:因为本题的上限是10000,所以对于高精度要进行缩进。#include #include using namespace std;const int MAXN = 10000000原创 2013-08-20 15:45:28 · 1328 阅读 · 0 评论 -
hdu 1042 N!(高精度乘法 + 缩进)
题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1042题目大意:求n!, n 的上限是10000。解题思路:高精度乘法 , 因为数据量比较大, 所以得用到缩进,但因为是乘法,缩进只能在10^5, 不然在乘的过程中就超过int型。然后数值位数大概在8000位以下。#include #include using n原创 2013-08-20 16:18:31 · 1067 阅读 · 0 评论 -
hdu 2955 Robberies(01背包)
DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work i原创 2013-08-08 08:32:39 · 1039 阅读 · 0 评论 -
uva 10954 Add All(STL)
题目连接:10954 Add All题目大意:给出n个数,要将n个数相加,每次相加所得的值为当次的计算量,完成所有的求和运算后,要求总的计算量最小。解题思路:只要每次挑选最小的两个数出来相加就可以了,然后将和当成新的一个数放回数组。#include #include using namespace std;int n, ans;multiset s;原创 2013-08-23 00:19:55 · 1127 阅读 · 0 评论 -
uva 131 The Psychic Poker Player(直接枚举)
The Psychic Poker Player In 5-card draw poker, a player is dealt a hand of five cards (which may be looked at). The player may then discard between zero and five of his or her cards an原创 2013-08-11 21:28:51 · 1709 阅读 · 0 评论 -
uva 10700 Camel trading(STL 栈)
题目连接:10700 - Camel trading题目大意:给出一个只含有‘+’和‘*’的算式,要求不考虑优先级的情况下,求的算式的最大值和最小值。解题思路:最大值无非先处理所有的加法, 最小值先处理所有的乘法(因为所有数值均为正数)。#include #include using namespace std;int main() { int原创 2013-08-23 23:54:48 · 1075 阅读 · 0 评论 -
uva 108 - Maximum Sum(检索)
题目连接:108 - Maximum Sum题目大意:对应矩阵的值为矩阵中所有元素的和, 要求所给出的矩阵中, 和最大的子矩阵,输出最大和。解题思路:可以看成是求若干次连续序列最大和,第一次求1行,第二次就是1 和2 行对应元素的和的数组,第三次就是1 、 2 和3 行、、、、、、然后知道1 加到n行, 就换2行, 然后是2 + 3 行,以此类推。#includ原创 2013-08-24 01:03:12 · 1159 阅读 · 0 评论