随笔分类 -  水水更健康

1 2 3 下一页
Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)——B纯暴力——Bear and Three Musketeers
摘要：/*写搜索WA了。。赛后发现直接暴力不会超啊，，，*//************************************************* Author :Powatr* Created Time :2015-8-30 14:55:10* File Name ... 阅读全文
posted @ 2015-08-30 15:02 Painting、时光 阅读(111) 评论(0) 推荐(0)
ZOJ3827——Information Entropy
摘要：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3827/*输出用f*//************************************************* Author :Powatr* Cre... 阅读全文
posted @ 2015-08-19 16:44 Painting、时光 阅读(154) 评论(0) 推荐(0)
HDU5400——Arithmetic Sequence
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=5400/************************************************* Author :Powatr* Created Time :2015-8-18 13:00... 阅读全文
posted @ 2015-08-19 14:46 Painting、时光 阅读(141) 评论(0) 推荐(0)
POJ3276——暴力——Fliptile
摘要：http://poj.org/problem?id=3279/*枚举第一行所有的状态，接下来的行都已经确定了，字典序最小输出 *//************************************************* Author :Powatr* Created Tim... 阅读全文
posted @ 2015-08-09 15:29 Painting、时光 阅读(159) 评论(0) 推荐(0)
HDU5344——数学题——MZL's xor
摘要：MZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an array B is defined a... 阅读全文
posted @ 2015-08-05 22:16 Painting、时光 阅读(158) 评论(0) 推荐(0)
Codeforces Round #312 (Div. 2)——C暴力技巧——Amr and Chemistry
摘要：Amr loves Chemistry, and specially doing experiments. He is preparing for a new interesting experiment.Amr hasndifferent types of chemicals. Each chem... 阅读全文
posted @ 2015-07-22 21:10 Painting、时光 阅读(559) 评论(0) 推荐(0)
Codeforces489D——暴力水题——Unbearable Controversy of Being
摘要：DescriptionTomash keeps wandering off and getting lost while he is walking along the streets of Berland. It's no surprise! In his home town, for any p... 阅读全文
posted @ 2015-07-22 14:33 Painting、时光 阅读(172) 评论(0) 推荐(0)
多校7.21A——维护技巧——OO’s Sequence
摘要：Problem DescriptionOO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy aimod aj=0,now OO want to know∑i=1... 阅读全文
posted @ 2015-07-21 19:47 Painting、时光 阅读(342) 评论(0) 推荐(0)
HDU5284——水，strlen坑——wyh2000 and a string problem
摘要：Young theoretical computer scientist wyh2000 is teaching young pupils some basic concepts about strings.A subsequence of a stringsis a string that can... 阅读全文
posted @ 2015-07-20 14:53 Painting、时光 阅读(207) 评论(0) 推荐(0)
FZU2077——暴力技巧——The tallest tree
摘要：lzs种了n棵树，每棵树每天长高一定的高度。某一天，lzs想知道树长得怎么样了，你能求出那一天最高的树有多高吗？Input有多组测试数据，每组数据第一行输入两个整数n,m(1#include#includeusing namespace std;const int MAX = 100000 + 10... 阅读全文
posted @ 2015-07-18 18:46 Painting、时光 阅读(190) 评论(0) 推荐(0)
HDU4451——Dressing
摘要：Wangpeng has N clothes, M pants and K shoes so theoretically he can have N×M×K different combinations of dressing.One day he wears his pants Nike, sho... 阅读全文
posted @ 2015-07-17 21:39 Painting、时光 阅读(175) 评论(0) 推荐(0)
Codeforces Round #310 (Div. 1)——A水——Case of Matryoshkas
摘要：Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.The main exhibi... 阅读全文
posted @ 2015-07-16 20:16 Painting、时光 阅读(222) 评论(0) 推荐(0)
FZU2013 short problem
摘要：Problem DescriptionThe description of this problem is very short. Now give you a string(length N), and ask you the max sum of the substring which the ... 阅读全文
posted @ 2015-07-15 21:32 Painting、时光 阅读(184) 评论(0) 推荐(0)
Looksery Cup 2015——AFace Detection
摘要：The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a co... 阅读全文
posted @ 2015-06-11 17:19 Painting、时光 阅读(209) 评论(0) 推荐(0)
POJ2291——Rotten Ropes
摘要：DescriptionSuppose we have n ropes of equal length and we want to use them to lift some heavy object. A tear-off weight t is associated to each rope, ... 阅读全文
posted @ 2015-06-08 18:52 Painting、时光 阅读(219) 评论(0) 推荐(0)
zstu——找规律——青蛙过河
摘要：Description一条小溪尺寸不大，青蛙可以从左岸跳到右岸，在左岸有一石柱L，面积只容得下一只青蛙落脚，同样右岸也有一石柱R，面积也只容得下一只青蛙落脚。有一队青蛙从尺寸上一个比一个小。我们将青蛙从小到大，用1，2，…，n编号。规定初始时这队青蛙只能趴在左岸的石头L上，当然是一个落一个，小的落在... 阅读全文
posted @ 2015-06-08 18:49 Painting、时光 阅读(879) 评论(0) 推荐(0)
Codeforces Round #306 (Div. 2)——C模拟——Divisibility by Eight
摘要：You are given a non-negative integern, its decimal representation consists of at most100digits and doesn't contain leading zeroes.Your task is to dete... 阅读全文
posted @ 2015-06-05 17:04 Painting、时光 阅读(256) 评论(0) 推荐(0)
Codeforces Round #306 (Div. 2)——A——Two Substrings
摘要：You are given strings. Your task is to determine if the given stringscontains two non-overlapping substrings "AB" and "BA" (the substrings can go in a... 阅读全文
posted @ 2015-06-05 17:01 Painting、时光 阅读(269) 评论(0) 推荐(0)
Codeforces Round #306 (Div. 2)——B暴力——Preparing Olympiad
摘要：You havenproblems. You have estimated the difficulty of thei-th one as integerci. Now you want to prepare a problemset for a contest, using some of th... 阅读全文
posted @ 2015-06-05 16:59 Painting、时光 阅读(306) 评论(0) 推荐(0)
HDU1058——Humble Numbers
摘要：Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15,... 阅读全文
posted @ 2015-05-29 19:27 Painting、时光 阅读(129) 评论(0) 推荐(0)

1 2 3 下一页