码迷,mamicode.com
首页 >  
搜索关键字:contest    ( 3128个结果
Codeforces Gym 100286J Javanese Cryptoanalysis 傻逼暴力
原题地址:http://codeforces.com/gym/100286/attachments/download/2013/20082009-acmicpc-northeastern-european-regional-contest-neerc-08-en.pdf此题题意是给你一个单对单密文,...
分类:编程语言   时间:2015-08-08 22:36:14    阅读次数:139
4thweek contest.A 归并排序求逆序数
题目:bobo has a sequence a1,a2,…,an. He is allowed to swap twoadjacentnumbers for no more than k times.Find the minimum number of inversions after his s...
分类:编程语言   时间:2015-08-08 19:46:37    阅读次数:133
Codeforces Gym 100418A A - A+-B java高精度
A -A+-BTime Limit: 20 SecMemory Limit: 256 MB题目连接http://acm.hust.edu.cn/vjudge/contest/view.action?cid=86686#problem/ADescriptionYou are given the int...
分类:编程语言   时间:2015-08-07 21:38:39    阅读次数:153
(连通图)Network--POJ--3694
链接:http://poj.org/problem?id=3694http://acm.hust.edu.cn/vjudge/contest/view.action?cid=82833#problem/D这部分学的不是很好,还需要努力!代码: 1 #include 2 #include 3 #...
分类:Web程序   时间:2015-08-07 12:43:06    阅读次数:138
(连通图 模板题)Network of Schools--POJ--1236
链接:http://poj.org/problem?id=1236http://acm.hust.edu.cn/vjudge/contest/view.action?cid=82833#problem/A代码: 1 #include 2 #include 3 #include 4 #incl...
分类:Web程序   时间:2015-08-06 23:50:36    阅读次数:183
Ultra-QuickSort(数组排序问题)
题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=85904#problem/A题意: 多组案例,先输入数据的数目,在依次输入数据,判断将这些数据从小到大排列最少需要多少操作步数。(案例以输入0结束)案例: Sample Input...
分类:编程语言   时间:2015-08-05 17:56:52    阅读次数:182
51nod 算法马拉松4
http://www.51nod.com/contest/problemList.html#!contestId=9D 装盒子拓扑排序?
分类:编程语言   时间:2015-08-03 20:39:41    阅读次数:136
Happy Programming Contest zoj3703 dp
Description In Zhejiang University Programming Contest, a team is called “couple team” if it consists of only two students loving each other. In the contest, the team will get a lovely balloon with un...
分类:移动开发   时间:2015-08-03 14:31:20    阅读次数:164
poj 3660 Cow Contest(warshall算法)
poj 3660 Cow ContestDescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain co...
分类:编程语言   时间:2015-07-31 21:56:13    阅读次数:136
2015 Multi-University Training Contest 2 1004 Delicious Apples(DP)
题目链接 题意:长度为l 的环,有n棵果树,背包容量为k,告诉你k棵苹果树的id,以及每棵树上结的果子数,背包一旦装满要返回起点(id==0) 清空,问你至少走多少路,能摘完所有的苹果。 思路: 因为是环形,所以其实离起点最远的点应该是l / 2; 两种摘苹果的方式,一种从上半圈开始走,用dp[0][i]记录; 另外一种,从下半圈开始走,用dp[1][i]记录; allv 记录苹果总...
分类:移动开发   时间:2015-07-27 19:12:50    阅读次数:153
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!