自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(10)
  • 收藏
  • 关注

原创 CodeForces 579A Raising Bacteria

Raising BacteriaTime Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uDescriptionYou are a lover of bacteria. You want to raise some bacteria in a

2015-11-22 09:04:46 605

原创 ZOJ 3706 Break Standard Weight

ZOJ 3706 Break Standard WeightTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3706DescriptionThe balance was the first mass m

2015-11-21 17:37:59 429

原创 CodeForces 495B Modular Equations

Modular EquationsTime Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uDescriptionLast week, Hamed learned about a new type of equations in his math class called

2015-11-21 16:55:56 880

原创 POJ 1664 放苹果

放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28861 Accepted: 18248Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。

2015-11-21 11:15:00 370

原创 POJ 1273 Drainage Ditches

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 64253 Accepted: 24793DescriptionEvery time it rains on Farmer John's fields, a pond fo

2015-11-19 09:33:02 306

原创 CodeForces 482A Diverse Permutation

A. Diverse Permutationtime limit per test1 secondmemory limit per test256 megabytesPermutation p is an ordered set of integers p1,   p2,   ...,   pn, consisting of n dist

2015-11-15 10:28:15 460

原创 CodeForces 111B Petya and Divisors

B. Petya and Divisorstime limit per test5 secondsmemory limit per test256 megabytesLittle Petya loves looking for numbers' divisors. One day Petya came across the following pro

2015-11-15 10:22:47 413

原创 CodeForces 44B Cola

B. ColaTo celebrate the opening of the Winter Computer School the organizers decided to buy in n liters of cola. However, an unexpected difficulty occurred in the shop: it turned out that cola i

2015-11-15 10:18:48 475

原创 UVA 11584 Partitioning by Palindromes

题意就是给定一个只有小写字母的字符串,要将这个字符串划分为尽可能少的回文串状态转移方程就是dp[i] = min( dp[j-1]+1, dp[i])  (1#include #include #include #include using namespace std;const int maxn = 1005;int dp[maxn];char s[maxn];

2015-11-10 11:14:40 304

转载 Codeforces Round #127 (Div. 2) C - Fragile BridgesCodeforces

C. Fragile Bridgestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are playing a video game and you hav

2015-11-01 11:24:34 410

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除