codeforces比赛
文章平均质量分 69
AC_XXZ
努力了不一定会成功,但不努力肯定会失败
展开
-
Codeforces Round #265 (Div. 2)
A. inc ARGtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSergey is testing a next-generation processor. In原创 2014-09-08 17:40:36 · 952 阅读 · 0 评论 -
Codeforces 437C The Child and Toy( 贪心)
题意: 一个玩具有n个点,m条边,每个点都有一个权值,现在要拆除玩具,将每个点拿出来,每拆除一个点消耗的能量为与这个点相关联的所有点的权值和,问拆除所有点所需最小能量思路: 可以将问题转换成拆除所有边的最小权值,只不过权值在点上面 ,当求得最小值的时候,必然是所有的边都已经去掉了。也就是说,无论以什么样的顺序去掉这些边,得到最终的结果时所有边都已经去掉了,而我们就是只要结果。去每一条边的时候,原创 2015-08-14 14:15:21 · 1271 阅读 · 0 评论 -
Codeforces Round #270(活用prim算法)
D. Design Tutorial: Inverse the Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is an easy wa原创 2014-10-24 19:16:16 · 1564 阅读 · 0 评论 -
Codeforces Round #291 (Div. 2)(A)
看一眼就知道的题目往往还要再看看题意....不然白白WA后悔死了#include#include#include #include#include using namespace std;const int maxn=65000+10;const int INF=1<<30;typedef long long LL;int main(){ string str;原创 2015-02-16 00:37:41 · 971 阅读 · 0 评论 -
Codeforces Round #291 (Div. 2)(B)
水题但是WA2发了,要特别考虑斜率不存在的情况,最后的答案就是斜率不同的数目,set一下#include#include#include #include#include #include using namespace std;const int maxn=65000+10;const int INF=1<<30;typedef long long LL;int mai原创 2015-02-16 00:32:18 · 968 阅读 · 0 评论 -
Codeforces Round #291 (Div. 2)(C)
Trie+DFS就行,但这题正确姿势好像是Hash,有空再用hash写下#include#include#include #include#include #include using namespace std;const int maxn=600000+1000;const int INF=1<<30;typedef long long LL;char s[maxn];原创 2015-02-16 00:29:32 · 664 阅读 · 0 评论 -
Codeforces Round #291 (Div. 2)(D)
D. R2D2 and Droid Armytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn army of n droids is lined up in o原创 2015-02-16 23:05:41 · 1012 阅读 · 0 评论 -
Codeforces Round #275 (Div. 2)
C. Diverse Permutationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPermutation p is an ordered set of in原创 2014-11-29 19:41:43 · 923 阅读 · 0 评论 -
Codeforces Round #271 (Div. 2)
D. Flowerstime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe saw the little game Marmot made for Mole's原创 2014-10-21 20:47:23 · 1561 阅读 · 0 评论 -
Codeforces Round #279 (Div. 2)
C. Hacking Cyphertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus participates in a competition f原创 2014-11-27 21:10:55 · 1089 阅读 · 0 评论 -
Codeforces Round #276 (Div. 2)
C. Bitstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's denote as the number of bits set ('1' bits)原创 2014-11-27 21:19:23 · 1077 阅读 · 0 评论 -
Codeforces Round #274 (Div. 2)
Codeforces Round #274 (Div. 2)原创 2014-10-20 19:16:46 · 1495 阅读 · 1 评论 -
Codeforces Round #272 (Div. 2)
A. Dreamoon and Stairstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDreamoon wants to climb up a stair of原创 2014-10-19 16:35:01 · 1642 阅读 · 0 评论 -
Codeforces Round #273 (Div. 2)
A. Initial Bettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are five people playing a game called "原创 2014-10-18 15:46:19 · 1727 阅读 · 0 评论 -
Codeforces Round #277.5 (Div. 2)
A. SwapSorttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem your goal is to sort an array co原创 2014-11-19 21:15:39 · 1406 阅读 · 0 评论 -
Codeforces Round #277 (Div. 2)
A. Calculating Functiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFor a positive integer n let's defin原创 2014-11-15 18:59:50 · 1345 阅读 · 0 评论 -
Codeforces Round #266 (Div. 2)
A. Cheap Traveltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnn has recently started commuting by subway原创 2014-09-21 16:14:02 · 981 阅读 · 0 评论 -
codeforces 204(Div.1 A) Little Elephant and Interval(贪心)
题意: 有一种个位数与最高位数字相等的数字,求在l,r的范围内,这种数字的个数。 思路: 找下规律就知道当当n>10的时候除去个位以后的答案等于n/10,然后考虑第一个数字是否小于最后一个,小于减一,还要加上个位一定存在的9位数import java.util.Scanner;public class xxz { public static void main(String[] ar原创 2015-08-14 15:58:34 · 1083 阅读 · 0 评论