2016年08月_wchhlbt

原创 codeforces 374C Inna and Dima （dfs+记忆化）

Inna and DimaInna and Dima bought a table of size n × m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A".Inna loves Dima, so she wants to go through

2016-08-20 17:35:28 523

原创 codeforces 702C Cellular Network（二分+尺取）

Cellular NetworkYou are given n points on the straight line — the positions (x-coordinates) of the cities and m points on the same line — the positions (x-coordinates) of the cellular

2016-08-20 17:09:12 449

原创 codeforces 697C Lorenzo Von Matterhorn（二叉树LCA）

Lorenzo Von MatterhornBarney lives in NYC. NYC has infinite number of intersections numbered with positive integers starting from 1. There exists a bidirectional road between intersections

2016-08-19 22:22:59 705

原创欧拉函数

一、定义：欧拉函数ϕ(n)定义为不超过n且和n互质的正整数的个数。二、如果P是素数，那么ϕ(p)=p−1.反之，如果p是正整数且满足ϕ(p)=p−1，那么p是一个素数三、如果P是素数，那么 ϕ( p n )=p n − p n−1 证明：从 1 到 p^n 总共有 p^n 个数，其中只有1*p，2*p，3*

2016-08-16 22:53:29 732

原创 codefoces 706C Hard problem （dp/dfs）

C. Hard problemhttp://codeforces.com/problemset/problem/706/CVasiliy is fond of solving different tasks. Today he found one he wasn't able to solve himself, so he asks you to help.Vasiliy is

2016-08-12 20:16:06 340

原创 codeforces 691C Exponential notation（思维 + 比较精妙的模拟）

C. Exponential notationYou are given a positive decimal numberx.Your task is to convert it to the "simple exponential notation".Letx = a·10b, where 1 ≤ a , then in general case the "si

2016-08-12 16:52:33 789

原创 hdu 2531 Catch him （块状BFS） + 常见BFS的错因

Catch himTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 963 Accepted Submission(s): 438Problem Description在美式足球中，四分卫负责指挥整只球队的进

2016-08-10 20:57:16 577

原创 POJ 2356 Find a multiple （抽屉原理）

Find a multipleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7597Accepted: 3311Special JudgeDescriptionTh

2016-08-10 20:36:16 338

原创 POJ 1365 Prime Land（质因数分解）

Prime LandTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 3845Accepted: 1728DescriptionEverybody in the Prime Land is using

2016-08-10 20:11:53 681

原创 POJ 1061 青蛙的约会（拓展欧几里得算法）

青蛙的约会Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 106922 Accepted: 21273Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是

2016-08-10 19:55:45 357

原创 hdu 1029 Ignatius and the Princess IV（主元素问题）：

Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 26993 Accepted Submission(s): 11454Problem Descriptio

2016-08-05 16:17:36 311

原创 hdu 2089 不要62（数位DP/暴力）

不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34126 Accepted Submission(s): 12309Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：l

2016-08-04 19:16:45 373

原创 hdu 5410 CRB and His Birthday（0-1背包+完全背包）

CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1605 Accepted Submission(s): 755Problem DescriptionToday is

2016-08-04 18:45:18 351

原创 hdu 4545 魔法串（模拟）

魔法串Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2331 Accepted Submission(s): 858Problem Description　　小明和他的好朋友小西在玩一个新的游戏，由小西给

2016-08-04 18:29:33 478

原创 hdu 3555 Bomb (数位dp)

题目大意：给定一个数n，问你从1--n之中有多少个数含有49这个子串，1-50中就只有49符合条件。解题思路：因为是初学数位dp，这是自己根据模板写的第一道题，我设计的dp[i][j]表示的含义是i位数字，并且他的前一位是数字j，从1-这个数字中不包含49字串的个数。具体可以参考代码。这里简单介绍一下我所了解的数位dp，所谓数位dp，无非就是根据每一位数字的情况来进行判

2016-08-04 17:14:11 524 1

wchhlbt的博客