小磊's blog

A -Watermelon                                                                            Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u                         Submit

1_hdu_2734#include#includeusing namespace std;int main(){ char ch; int sum=0; int i=1; while(cin.get(ch)) { if(ch=='#') break; if(ch!='\n') { if(ch!=' ') s

shǎ崽 OrOrOrOrzTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2455 Accepted Submission(s): 828 Problem DescriptionAcm

排列2Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2031 Accepted Submission(s): 653 Problem DescriptionRay又对数字的列产生了兴趣

A题：（德翔坑的题意，这样吧 不改了）code:#include#include#include#include#include#include#include#include#includeusing namespace std;//头文件int main(){ int cas; cin>>cas; int weizhi[1000]; int sum=0;

Judging OlympiaTime Limit: 1000MS    Memory limit: 65536K 题目描述For years, a group of Regional Contest Directors (RCDs) of the ACM International Collegiate  Programming Contest (ICPC) have

简单枚举类型——植物与颜色Time Limit: 1000MS    Memory limit: 65536K 题目描述请定义具有red, orange, yellow, green, blue, violet六种颜色的枚举类型color，根据输入的颜色名称，输出以下六种植物花朵的颜色：Rose(red), Poppies(orange), Sunflower(yellow

Code Formatter Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 33   Accepted Submission(s) : 9Problem DescriptionSome companies have spe

Accurately Say "CocaCola"!Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 25   Accepted Submission(s) : 8Problem Description

在背包九讲里面将多重背包转化为01背包，并且进行时间优化，有利用到一个二进制分解的思想。下面是在网上搜索之后得到的一个关于二进制分解思想的讲解和实现多重背包二进制分解思想讲解[cpp] view plaincopyprint?/**      在这之前，我空间好像转过一个背包九讲，现在我就只对      01背包和

Just A TriangleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1386 Accepted Submission(s): 910  Problem

Vowel CountingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1495 Accepted Submission(s): 850  Problem D

Problem A                                                                     Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

C -Alice, Bob and Chocolate                                                   Time Limit:2000MS Memory Limit:65536KB64bit IO Format:%I64d & %I64u DescriptionAlice and Bob like game

Problem A                                                  Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Others)

Problem  I Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 512    Accepted Submission(s): 298 Problem DescriptionLong long ago, a pro

C - StripeCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 18CDescriptionOnce Bob took a paper

超级玛丽Time Limit: 1000MS Memory limit: 65536K 题目描述浪子和南爵总喜欢玩超级玛丽这款游戏，不过玩久了也会产生烦腻的感觉！！已知这个游戏中有若干个天空场景，每个场景内包含四个参数 N(云彩个数)、D(跳跃长度)、M、L。第 i 朵云彩位于[(i-1)*M，(i-1)*M+L](保证L为了寻求刺激，两个人商量一种新的游戏

http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=18824#problem/A                                                                                                                     A. Wor

A题                                                                                                                                   StepsTime Limit: 3000MS Memory limit: 65536K 题目描述On

B. Platforms                                                                   http://codeforces.com/problemset/problem/18/BIn one one-dimensional world there are n platforms. Platform w

StepsTime Limit: 3000MS Memory limit: 65536K 题目描述One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to

The ? 1 ? 2 ? ... ? n = k problemTime Limit: 3000MS Memory limit: 65536K 题目描述Given the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a giv

A -Triangle                                 Time Limit:2000MSMemory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 18ADescriptionOnce Bob took a paper st

问题 A : 购物停车时间限制：1 秒内存限制：32 兆特殊判题： 否提交：53解决： 42题目描述小明每周都要开车陪女朋友去商业街购物，商业街是一条笔直的大街，我们把它抽象成是X轴上的一条线段，街上的每个商铺都位于线段上整数点的位置，而顾客可以在线段上的任何一个位置停车，并且每停一次车都需要交一次费用。于是小明想知道如果自己就停