水题
LLL_yx
这个作者很懒,什么都没留下…
展开
-
CF1176C Lose it!(简单题)
题目链接:http://codeforces.com/contest/1176/problem/C题意:https://www.luogu.com.cn/problem/CF1176C思路:把这6个数按顺序排成一排,传递一样,比如现在是15,就把8的个数-1,15的个数+1,就代表这一个序列传到了15了,最后只要统计42的个数就行了。代码:#include <bits/...原创 2020-03-19 22:27:45 · 468 阅读 · 0 评论 -
UVA - 1593 Alignment of Code(熟练c++操作)
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4468题意:所有单词都左对齐而且每个单词之间至少要空一格,注意每行最后一个单词最后不要空格。思路:尽量使用c++的操作,主要是两个需要注意,一个就是直接用vector来储存整个表,这样就不原创 2018-01-28 23:04:43 · 401 阅读 · 0 评论 -
CodeForces - 859B Lazy Security Guard(思维)
题目链接:http://codeforces.com/problemset/problem/859/B题意:要你求n个正方形的最小周长思路:直接找规律了,具体看代码#include #define INF 0x3f3f3f3fusing namespace std;typedef long long LL;typedef pair P;const int maxn =原创 2017-09-27 23:54:34 · 450 阅读 · 0 评论 -
codeforces#428(div2)C Journey(树上的dfs水题)
There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.Theon and Yara Greyjoy are on a horse in the first cit原创 2017-08-13 13:19:25 · 409 阅读 · 0 评论 -
codeforces #429(div2)C—Leha and Function(水题)
题目链接:http://codeforces.com/contest/841/problem/C CF终于上分了,0.0题意:(题目读了半天Orz)就是把第一个数列重新排序,使得第一个数列最大数对应第二个数列的最小数,再次大对次小。。。依次对应思路:用一个结构体存第二个数列位置和值就行了,把第一个数列大到小排序,第二个数列小到大排序,然后对应就行了代码:#incl原创 2017-08-19 20:57:25 · 266 阅读 · 0 评论 -
HDU - 1272 小希的迷宫(看似并查集的水题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1272题意:中文题0.0思路:这道题是在并查集专题里卖弄找到的,但是一看题目就是要求图中有没有环,那么直接判断边数是否等于点数-1就行了。注意:这里需要特判一下第一个数据就是0,0的情况,答案是Yes代码:#include #include #include #incl原创 2017-08-19 20:51:27 · 974 阅读 · 0 评论 -
CodeForces - 734C Anton and Making Potions(二分+枚举)
Anton is playing a very interesting computer game, but now he is stuck at one of the levels. To pass to the next level he has to prepare n potions.Anton has a special kettle, that can prepare one原创 2017-08-12 14:44:05 · 354 阅读 · 0 评论 -
CodeForces - 522B Photo to Remember (水题)
One day n friends met at a party, they hadn't seen each other for a long time and so they decided to make a group photo together.Simply speaking, the process of taking photos can be described as f原创 2017-08-01 19:39:57 · 478 阅读 · 0 评论 -
HDU - 5327 Olympiad(前缀和水题)
You are one of the competitors of the Olympiad in numbers. The problem of this year relates to beatiful numbers. One integer is called beautiful if and only if all of its digitals are different (i.e.原创 2017-08-01 19:11:28 · 467 阅读 · 0 评论 -
Pagodas(思维)
nn pagodas were standing erect in Hong Jue Si between the Niushou Mountain and the Yuntai Mountain, labelled from 11 to nn. However, only two of them (labelled aa and bb, where 1≤a≠b≤n1≤a≠b≤n) withsto原创 2017-07-11 09:26:43 · 589 阅读 · 0 评论 -
hdu 2012 素数判定
题目:#include #include #include #include #include #include #include #include #include #include #include #include #define INF 0x3f3f3f3ftypedef long long LL;using namespace std;bool sushu原创 2017-02-24 00:24:58 · 331 阅读 · 0 评论 -
hdu 2010 水仙花数
和poj格式稍稍不同;#include #include #include #include #include #include #include #include #include #include #include #include #define INF 0x3f3f3f3ftypedef long long LL;using namespace std;原创 2017-02-23 23:01:33 · 300 阅读 · 0 评论