quadratic equation Time Limit: 2000MS Memory Limit: 131072KB Submit Statistic Problem Description ...With given integers a,b,c, you are asked to judge whether the following statement is true
quadratic equation Time Limit: 2000MS Memory Limit: 131072KB Submit Statistic Problem Description ...With given integers a,b,c, you are asked to judge whether the following statement is true
赛前10天,找了经典的题目,每天做3-5道,以比赛的形式每天晚上打组队赛,一起做题。但是最后的实施情况并不是很好,每天也就做1-2个。第一是题目难度全部为中等难度题目,并且时间紧张,对队友的能力把握不够清晰;...
Square NumberTime Limit: 1000 ms Memory Limit: 65536 KiBSubmit Statistic DiscussProblem DescriptionIn mathematics, a square number is an integer that is the square of an integer....
作为一只大三老年参赛选手,第三次参加省赛,去年没有银,今年没有金,喜提银牌。7题结束比赛。不过实力如此,金要八题。最后选择E题,怎样都A不了,好迷。 不过今年的比赛整体好评,虽然中间榜炸了一会,不过影响...
G - sum of power Description Input Input contains two integers n,m(1≤n≤1000,0≤m≤10). Output Output the answer in a single line. Sample Input 10 0 Sample Output ...#incl...
Orz has two strings of the same length: A and B. Now she wants to transform A into an anagram of B (which means, a rearrangement of B) by changing some of its letters. The only operation the girl can ...
Time Limit: 2000MS Memory limit: 131072K题目描述 Because of the GFW (Great Firewall), we cannot directly visit many websites, such as Facebook, Twitter, YouTube, etc. But with the help of proxy and ...
第十一届山东省程序设计竞赛(ACM省赛)
Triple Nim Time Limit: 2000MS Memory limit: 65536K 题目描述 Alice and Bob are always playing all kinds of Nim games and Alice always goes first. Here is the rule of Nim game:... There are som
Problem DescriptionFascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem:f(n)=She is required to calculate f(n) mod 2 ...
5月初比赛完,一直拖到现在,没下笔写,更多的原因大概还是不愿去回忆吧,苦笑。 第一次参加比赛,结果不是很好。 虽然赛后教练一直在说这个比赛很水的,让你们大一的第...5 月 5 日下午热身赛,教练说难度跟正规...
昨天打了18年的山东省赛,先过的C,用排序然后for循环a了,接着又看A, 感觉是二分图,本来想着排个序用贪心,又发现靠后的字母和靠前的字母挨得更近,是个循环,脑子就乱了,没思路时看榜单一半的队都做出来了而且...
题干: Problem Description In GGO, a world dominated by gun and steel, players are fighting for the honor of being the strongest gunmen. Player Shino is a sniper, and her aimed shot kills one ...
Swiss-system tournament Time Limit: 2000MS Memory Limit: 131072KB Submit Statistic Problem Description A Swiss-system tournament is a tournament which uses a non-elimination format....
省赛打完很久了才发,这还是当时写的总结,感觉写了一坨*啊。 省赛打完了,对于成绩并不满意,最终六个题,只拿了铜牌,很可能,这应该是最后一次省赛了,感觉还是很多遗憾吧。 单从心态上来讲,这次应该比...
标签: 算法
还是想总结一下,才能更踏实的在接下来一个月时间好好复习文化课,并且扩充算法广度。我对数学、dp、计算几何、数据结构相关算法比较感兴趣,之后会更多的去接触这些算法,具体如何还是看之后队伍内分工情况。...
传送门:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=4115 昨天赛场上只想到了一种情况:最远点一定是在最后一次循环中产生的,且一定是第一次循环中最远点对应的那个点,因此想到的只是求出第...
标签: acm
比赛过程:首先看到的是F题,我一开始从后面往前看的,然后队友告诉我F比较简单,然后就去让队友去敲了,我去继续看了其他的题,首先过一遍题是为了找到水题。不幸的是F题WA了好多次,这时候另一个队友说G是一个水题...
Time Limit: 2000MS Memory limit: 131072K题目描述Alice has a monkey, she must feed fruit to the monkey every day.She has three kinds of fruits, bananas, peaches and apples. Every day, she chooses one ...
链接:https://www.nowcoder.com/acm/contest/123/D来源:牛客网题意:在根节点为0的树上(编号:0,1,2...n)。一条边上有两个值 poweri ,numi,相当于网络流:poweri相当于路上的cost,numi相当于容量,相当于汇点为0...
标签: ACM
2016年新总结的ACM常用算法总结,搜集整理自网络.pdf
A:As long as I was by her side 题意:连续三个人的高度和是三的倍数,就说这三个人是“挺好的”,一组数据进行排序,要求最多“挺好的”组。 分析:把所有数据预处理,mod 3,按照数量进行排序,小的放后面。...
Emergency Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 Kudo’s real name is not Kudo. Her name is Kudryavka Anatolyevna Strugatskia, and Kudo is only her nickname.
题意:给定n个人,每个人有身高和体重,根据身高排序后,进行121212报数分为两组,1的为red,2的为blue,统计1和2的总体重,总体重大的则胜利,输出red或blue。 思路:排序。 #include #include ...
#include #include using namespace std; typedef long long LL; LL n1,n2,n3,d1,d2,d3; LL b[55][55][55][4],a[4],d[4],c[55][55][55]; const LL mod=1e9+7;...LL f(int i,int j,int k) ... if(min((i,j),k)
Time Limit: 2000MS Memory limit: 65536K题目描述Murloc is a powerful race in Hearthstone. In the set League of Explorers, a new Paladin ability card called Anyfin Can Happen is released with the ...
Four-tuplesTime Limit: 2000 ms Memory Limit: 524288 KiBSubmit Statistic DiscussProblem DescriptionGiven l1, r1, l2, r2, l3, r3, l4, r4, please count the number of four-tuples (x1, x2, ...
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; const ll mod=1e9+7; const ll maxn=1e5+5; ll fact[maxn],f[maxn],inv[maxn];...void init()