训练赛
文章平均质量分 75
bluefly-hrbust
这个作者很懒,什么都没留下…
展开
-
1013 Battle Over Cities (25分)
题意很简单,对于一个图来说,每次去掉一个点和这个点所相关点边,为了使得剩下点之间互相都是联通的,问需要加多少条边?思路很简单,类似记忆化搜索,我们遍历每个点,然后对于当前点去掉的情况,我们算整个图的联通块数目,算法是DFS,每次遇到每个没有走过的点,就把和这个点的所有关的点打上标记,下次遇到这些打了标记点就不会走了,我们算这些没有走过的点,就能算出联通块点数目坑点第一次写了一个DFS搜索...原创 2020-02-17 16:04:00 · 157 阅读 · 0 评论 -
B - Joty and Chocolate
B - Joty and Chocolate #include#include#includeusing namespace std;long long gcd(long long x,long long y){if (x==0){ return(y);}else{ gcd(y%x,x);}}int main (原创 2018-01-29 20:10:59 · 155 阅读 · 0 评论 -
0216codeforceB正解
B. Run For Your Prizetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou and your friend are participating in a TV show "Run For Your Prize".At the...原创 2018-02-17 21:35:14 · 207 阅读 · 0 评论 -
HDU - 6023
A - Automatic Judge HDU - 6023 本题题意就是设计一个类似计算ACM罚失计算的程序,用map映射把不同题号的结果,完成时间,罚时保存。最后计算即可,但是要注意,某个题必须完成,才会参与罚时计算(这是个坑)。。。#include<iostream>#include<string.h>#include<stdio.h>#inclu...原创 2018-02-21 21:03:18 · 681 阅读 · 0 评论 -
HDU - 6025辗转相除法+前缀后缀
Coprime SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1527 Accepted Submission(s): 733http://acm.hdu.edu.cn/showproblem.php?pid=...原创 2018-02-21 21:55:41 · 177 阅读 · 0 评论 -
UESTC - 1830 - 秦队长猜想
UESTC的ACM貌似挺还不错。。。秦队长猜想:“任何一个大于等于66的整数都能写成三个质数的和。“现给你一个NN,请你构造三个质数x,y,zx,y,z.使得x+y+z=Nx+y+z=N.Input一行,仅一个整数N(6<=N<=109)N(6<=N<=109).Output一行,三个质数x,y,zx,y,z,以空格隔开。如果有多组解,你只用需输出任意一组解即可。Sampl...原创 2018-02-21 22:22:17 · 246 阅读 · 0 评论 -
HDU - 6027-Easy Summation
Easy SummationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1871 Accepted Submission(s): 757Problem DescriptionYou are encountered with a...原创 2018-02-21 22:47:10 · 178 阅读 · 0 评论 -
An Ordinary Game-简单字符串
There is a string s of length 3 or greater. No two neighboring characters in s are equal.Takahashi and Aoki will play a game against each other. The two players alternately performs the following oper...原创 2018-05-27 17:06:29 · 460 阅读 · 1 评论