ACM
文章平均质量分 80
cmonkey
追随大自然的召唤
展开
-
2014 微软 编程之美 初赛 第一场 题解
2014 微软 编程之美 初赛 第一场 题解趁热火写个题解.这场一共才三题.第一题 焦距这...大致就是给你公式照着敲,处理好字符串就行,自认为代码写的蛮干净的~~第二题 树这是最难的一题,但是大数据太弱了,竟然都暴过了...题意:N(1e5)个点的树,初始点权都为0,有Q(1e5)个操作,每次操作在以u为根的子树中,对深度(根的深度为1)在区间[l,r]内原创 2014-04-19 22:58:17 · 969 阅读 · 1 评论 -
HDU 3831 DICS
Problem DescriptionThis time, we are involved in a more complicated one: given two strings SOURCE and DESTINATION , we have 4 operationsDelete: remove the ith character.Insert: in pos i(the ith原创 2011-07-27 09:48:10 · 978 阅读 · 0 评论 -
HDU 3920 Clear all of them I
Clear All of Them ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 122768/62768 K (Java/Others)Total Submission(s): 722 Accepted Submission(s): 217Problem DescriptionAcmers have been原创 2011-08-12 15:52:16 · 685 阅读 · 0 评论 -
HDU 3652 B-number
题意:1..n的数中数字包含‘13’且能被13整除的,有多少个。n分析:按位DP困在能被13整除上了,查了能被13整除的数的特性,不知道怎么转化dp...后来看了解题报告,状态上多记录个模13的余数就好了~#include #include #include int ans;int num[10], ln;int f[10][13][3];void原创 2011-08-07 16:52:53 · 1016 阅读 · 0 评论 -
HDU 3828 A+B problem
Problem DescriptionQQ and OO always play the game of A + B. QQ gives tow decimal number A and B, and OO answers the sum at once. But to do the same things too often is boring. So, today they are fed原创 2011-07-27 10:04:53 · 1061 阅读 · 0 评论 -
BUPT 199 Beat it!
BUPT 199 Beat it!DescriptionThere's a monster-attacking game on the Renren's open platform, and the game's background are showing below.Where lies a strange country, lices a strange monster.原创 2011-07-27 09:22:45 · 607 阅读 · 0 评论 -
HDU 3883 CS and Sugar
2011 Multi-University Training Contest 5 - Host by BNUHDU 3883 CS and Sugar (DP)#include #include #include int n, m;int map[101][101];int hash[2][101][101][2];bool vis[101];int f[2];int原创 2011-07-27 08:50:36 · 879 阅读 · 0 评论 -
POJ 1671 Rhyme Schemes
Rhyme SchemesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1175 Accepted: 645 Special JudgeDescriptionThe rhyme scheme for a poem (or stanza o原创 2012-03-06 13:55:25 · 1232 阅读 · 0 评论 -
POJ 2430 Lazy Cows
Lazy CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1897 Accepted: 718DescriptionFarmer John regrets having applied high-grade fertilizer to hi原创 2012-02-19 19:19:52 · 1322 阅读 · 0 评论 -
HDU 3880 luck number
#include #include #include int main(){ __int64 i, j, k; __int64 a, b, M; while(scanf("%I64d%I64d%I64d", &a, &b, &M) != EOF){ if (a > b){ k = a; a = b; b = k; } if (b == 1){ k原创 2011-07-27 10:17:46 · 1357 阅读 · 0 评论 -
HDU 3709 Balanced Number
Balanced NumberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 162 Accepted Submission(s): 59Problem DescriptionA balanced number is a原创 2011-08-05 15:51:01 · 2190 阅读 · 2 评论 -
HDU 3913 Suffix
SUFFIXTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 85 Accepted Submission(s): 27Problem DescriptionA string is a list of characters原创 2011-08-10 15:19:20 · 956 阅读 · 0 评论 -
codeforce 55D Beautiful numbers
D. Beautiful numberstime limit per test:4 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputVolodya is an odd boy and his taste is strange as well. It see原创 2011-08-07 23:00:38 · 2071 阅读 · 5 评论 -
POJ3693 Maximum repetition substring 后缀数组
Maximum repetition substringTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4671 Accepted: 1381DescriptionThe repetition number of a string is defined as the maximum number R原创 2012-10-19 23:35:39 · 808 阅读 · 0 评论 -
CF234G Practice
G.Practicetime limit per test:1 secondmemory limit per test:256 megabytesinput:input.txtoutput:output.txtLittle time is left before Berland annual football championship. Therefore the coac原创 2012-10-19 23:53:18 · 665 阅读 · 0 评论 -
HDU 3864 D_num
Problem DescriptionOregon Maple was waiting for Bob When Bob go back home. Oregon Maple asks Bob a problem that as a Positive number N, if there are only four Positive number M makes Gcd(N, M) == M原创 2011-07-27 19:31:59 · 1125 阅读 · 0 评论 -
HDU 3872 Dragon Ball
Dragon BallTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/32768 K (Java/Others)Total Submission(s): 113 Accepted Submission(s): 45Problem DescriptionThere are N "dragon balls"原创 2011-08-02 09:19:58 · 947 阅读 · 0 评论 -
BUPT 202 chocolate mashine
北邮多校联合赛HBUPT 202 chocolate mashine[Description]There is a Vending machine sales which sell magic chocolate in Renren office. The chocolate is shaped like a n*m rectangle, andeach 1*1 unit is as原创 2011-07-27 09:14:13 · 568 阅读 · 0 评论 -
pku 1274 二分图匹配
//经典的二分图匹配,留个念。#include #include #include #include int N, M;int map[201][201] = {0};int x[201];bool vis[201];void init(){ int i, j; for (i = 1; i { scanf("%d", &map[i][0]原创 2010-11-05 21:42:00 · 362 阅读 · 0 评论 -
背包优化
多重背包优化一•看做有N组物品,放入容量为j的背包,对于每组物品,选择放入的数量k(0…n[i])•对于第i种物品,放入容量为j的背包f[j+k*c[i]] = max{f[j+k*c[i]],f[j]+k*w[i]}•j= 0: c[i], 2*c[i], 3*c[i],..., n[i]*c[i]•j= 1: 1+c[i], 1+2*c[i]...•j= c[i原创 2012-02-27 12:29:39 · 603 阅读 · 0 评论 -
POJ 1269 Intersecting Lines
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6233 Accepted: 2939DescriptionWe all know that a pair of distinct points on a plane原创 2012-02-19 23:29:29 · 558 阅读 · 0 评论 -
POJ 1936 All in All
All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 21411 Accepted: 8511DescriptionYou have devised a new encryption technique which encodes a message by inserting between原创 2012-02-03 23:01:59 · 473 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 24310 Accepted: 8696DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm p原创 2012-02-03 22:59:48 · 359 阅读 · 0 评论 -
POJ 2635 The Embarrassed Cryptographer
The Embarrassed CryptographerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8984 Accepted: 2316DescriptionThe young and very promising cryptographer Odd Even has implemented the sec原创 2012-02-03 22:29:57 · 556 阅读 · 0 评论 -
POJ 1942 Paths on a Grid
Paths on a GridTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16218 Accepted: 3885DescriptionImagine you are attending your math lesson at school. Once again, you are bored be原创 2012-02-03 22:33:35 · 616 阅读 · 0 评论 -
POJ 3252 Round Number
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5077 Accepted: 1736DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scisso原创 2012-02-03 22:39:44 · 1406 阅读 · 0 评论 -
POJ 3349 Snowflake Snow Snowflakes
Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 20205 Accepted: 5269DescriptionYou may have heard that no two snowflakes are alike. Your task is to wri原创 2012-02-03 22:55:29 · 402 阅读 · 0 评论 -
POJ 2151 Check the difficulty of problems
Check the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2674 Accepted: 1163DescriptionOrganizing a programming contest is not an easy job. To avoid making原创 2012-02-03 22:53:48 · 406 阅读 · 0 评论 -
POJ 3274 Gold Balanced Lineup
Gold Balanced LineupTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7600 Accepted: 2245DescriptionFarmer John's N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ ha原创 2012-02-03 22:49:51 · 449 阅读 · 0 评论 -
POJ 2513 Colored Sticks
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 22276 Accepted: 5884DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with原创 2012-02-03 22:58:05 · 379 阅读 · 0 评论 -
POJ 1015 Jury Compromise
Jury CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19548 Accepted: 4886 Special JudgeDescriptionIn Frobnia, a far-away country, the ve原创 2012-02-13 13:59:00 · 665 阅读 · 0 评论 -
POJ 1037 A decorative fence
A decorative fenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5280 Accepted: 1880DescriptionRichard just finished building his new house. Now the原创 2012-02-13 13:57:48 · 964 阅读 · 0 评论 -
POJ 1742 Coins
CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 21637 Accepted: 7358DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3原创 2012-02-27 12:36:41 · 645 阅读 · 1 评论 -
HDU 1171 Big Event in HDU
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10355 Accepted Submission(s): 3595Problem DescriptionNowaday原创 2012-02-27 12:35:08 · 419 阅读 · 0 评论 -
HDU 3732 Ahui Writes Word
Ahui Writes WordTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 701 Accepted Submission(s): 283Problem DescriptionWe all know原创 2012-02-27 12:32:31 · 603 阅读 · 0 评论 -
POJ3304 Segments
SegmentsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5604 Accepted: 1630DescriptionGiven n segments in the two dimensional space, write a program原创 2012-02-26 22:32:43 · 884 阅读 · 0 评论 -
POJ 1742 Coins
CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 21551 Accepted: 7343DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3..原创 2012-02-16 23:58:16 · 550 阅读 · 0 评论 -
POJ 1947 Rebuilding Roads
Rebuilding RoadsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6309 Accepted: 2724DescriptionThe cows have reconstructed Farmer John's farm, with its原创 2012-02-16 14:52:23 · 710 阅读 · 0 评论 -
POJ 1636 Prison rearrangement
Prison rearrangementTime Limit: 3000MS Memory Limit: 10000KTotal Submissions: 1447 Accepted: 693DescriptionIn order to lower the risk of riots and escape atte原创 2012-02-14 20:29:27 · 764 阅读 · 0 评论 -
POJ 1848 Tree
TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2564 Accepted: 859DescriptionConsider a tree with N vertices, numbered from 1 to N. Add, if it is原创 2012-02-14 18:53:33 · 566 阅读 · 0 评论