码迷,mamicode.com
首页 >  
搜索关键字:2014-2015 acm-icpc    ( 1013个结果
HDU 4292 FOOD 2012 ACM/ICPC Asia Regional Chengdu Online
FoodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3399Accepted Submission(...
分类:其他好文   时间:2015-07-18 16:57:25    阅读次数:115
Codeforces Round #289 (Div. 2, ACM ICPC Rules)——B贪心——Painting Pebbles
There arenpiles of pebbles on the table, thei-th pile containsaipebbles. Your task is to paint each pebble using one of thekgiven colors so that for e...
分类:其他好文   时间:2015-07-16 22:09:50    阅读次数:155
下沙的沙子有几粒?(hdu1267)递推
下沙的沙子有几粒? Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 1   Accepted Submission(s) : 1 Problem Description 2005年11月份,我们学校参加了ACM/ICPC 亚洲赛区成都...
分类:其他好文   时间:2015-07-16 00:57:03    阅读次数:151
UVA - 12001 UVa Panel Discussion
Description UVa Panel DiscussionThe UVa online judge team is arranging a panel discussion for the next ACM-ICPC World Finals event in Orlando, Florida...
分类:其他好文   时间:2015-07-12 20:09:38    阅读次数:135
hdu 5101 Select
题目连接http://acm.hdu.edu.cn/showproblem.php?pid=5101SelectDescriptionOne day, Dudu, the most clever boy, heard of ACM/ICPC, which is a very interesting ...
分类:其他好文   时间:2015-06-28 14:09:04    阅读次数:73
POJ3067:Japan(树状数组求逆序对)
Description Japan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <...
分类:编程语言   时间:2015-06-23 23:18:22    阅读次数:206
分子量(Molar Counting, ACM/ICPC Seoul 2007, UVa1586)
An organic compound is any member of a large class of chemical compounds whose molecules contain carbon. The molar mass of an organic compound is the mass of one mole of the organic compound. The molar...
分类:其他好文   时间:2015-06-19 10:39:58    阅读次数:145
得分(Score, ACM/ICPC Seoul 2005, UVa 1585)
给出一个由O和X组成的串(长度为1~80),统计得分。每个O的分数为目前连续出现的O的个数,X的得分为0。例如,OOXXOXXOOO的得分为1+2+0+0+1+0+0+1+2+3。 分析:此题很简单,两个变量一个用于记录当前O的分数,另外一个变量用来累加分数。#include #include #define maxn 80char s[maxn];int...
分类:其他好文   时间:2015-06-18 19:54:11    阅读次数:156
数数字(Digit Counting, ACM/ICPC Danang 2007, UVa 1225)
把前n(n<=10000)个整数顺次写在一起:123456789101112…数一数0~9各出现多少次(输出10个整数,分别是0, 1, …, 9出现的次数)。#include #include #define maxn 10000char s[maxn]; int act[10];int main() { int i; while(scanf...
分类:其他好文   时间:2015-06-18 19:48:09    阅读次数:139
生成元(Digit Generator,ACM/ICPC Seoul 2005, UVa1583)
For a positive integer N , the digit-sum of N is defined as the sum of N itself and its digits. When M is the digitsum of N , we call N a generator of M .For example, the digit-sum of 245 is 256 (= 245...
分类:其他好文   时间:2015-06-17 21:40:45    阅读次数:220
1013条   上一页 1 ... 78 79 80 81 82 ... 102 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!