tokers的博客_ACM题解,DP,图论

LightOJ1021---Painful Bases (状压dp)

As you know that sometimes base conversion is a painful task. But still there are interestiid symb

dp

#include

git

ios

原创 2015-06-09 20:24:36 31 阅读

LightOJ1020(博弈)

may have played this game in childhood. The game is playing by alternating turns. In each turn a player can take exactly one or two marbles.Both Alice

博弈

#include

ios

ci

原创 2015-06-09 19:03:30 7 阅读

LightOJ1017---Brush (III) (dp)

Samir returned home from the contest and got angry after seeing his room dusty. Who likes to see a dusty room after a brain storming programming contest? After checking a bit he found a brush in his r

dp

#include

ci

ide

原创 2015-06-08 19:56:52 34 阅读

LightOJ1016---Brush (II) (贪心)

After the long contest, Samee returned home and got angry after seeing his room dusty. Who likes to see a dusty room after a brain storming programming contest? After checking a bit he found a brush i

贪心

#include

ci

ios

原创 2015-06-08 18:23:47 23 阅读

LightOJ1010---Knights in Chessboard (规律题)

Given an m x n chessboard where you want to place chess knights. You have to find the number of maximum knights that can be placed in the chessboard such that no two knights attack each other.Those wh

规律题

#include

ios

ide

原创 2015-06-08 15:25:15 20 阅读

LightOJ1013---Love Calculator (dp)

Yes, you are developing a ‘Love calculator’. The software would be quite complex such that ct behavior of the software.So, given two names your software will generate the perc

dp

#include

串匹配

ios

原创 2015-06-07 22:10:52 12 阅读

LightOJ1012---Guilty Prince (并查集)

Once there was a king named Akbar. He had a son named Shahjahan. For an unforgivab

并查集

#include

ide

ios

原创 2015-06-07 18:09:02 32 阅读

LightOJ1011---Marriage Ceremonies (状压dp)

You work in a company which organizes marriages. Marriages are not that easy to be made,

dp

#include

ios

ci

原创 2015-06-06 11:08:45 15 阅读

Codeforces Round #306 (Div. 2)

A.给定一个字符串,问是否存在不重叠的两个串”AB”和”BA”,顺序任意.先从左到右遍历一遍

codeforces

构造

#include

ios

ci

原创 2015-06-05 22:14:21 29 阅读

LightOJ1009---Back to Underworld (bfs染色)

The Vampires and Lykans are fighting each other to death. The war has become so fiercid of going to

bfs

#include

ios

连通块

原创 2015-06-05 13:00:35 4 阅读

POJ2407---Relatives(求单个数的欧拉函数)

Description Given n, a positive integer, how many positive integers less than n are relativel

欧拉函数

#include

ios

sed

原创 2015-06-04 18:24:27 24 阅读

POJ1284---Primitive Roots(求原根个数, 欧拉函数)

Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is equal to { 1, …, p-1 }. For example, the cons

欧拉函数

#include

原根

ios

原创 2015-06-04 18:04:35 7 阅读

LightOJ1006---Hex-a-bonacci(矩阵快速幂)

Given a code (not optimized), and necessary inputs, you have to find the output of th

矩阵快速幂

#include

ios

原创 2015-06-03 21:47:34 40 阅读

LightOJ1005---Rooks(简单组合数学)

A rook is a piece used in the game of chess which is played on a board of square grids.

组合数学

#include

R3

ios

原创 2015-06-03 21:10:37 35 阅读

LightOJ1003---Drunk(拓扑排序判环)

One of my friends is always drunk. So, sometimes I get a bit confused whether he is drunkinking. So, let m

拓扑排序

#include

sed

ios

原创 2015-06-03 10:38:57 42 阅读

LightOJ1002---Country Roads (最短路变形)

I am going to my home. There are many cities and many bi-directional roads between them.

最短路

#include

ci

sed

原创 2015-06-02 20:27:40 25 阅读

hdu2227---Find the nondecreasing subsequences(dp+树状数组)

Problem Description How many nondecreasing subsequences can you find in the sequeue

dp

树状数组

#include

ios

Problem

原创 2015-06-02 18:52:33 38 阅读

Codeforces Round #240 (Div. 1)---B.Mashmokh and ACM(dp)

Mashmokh’s boss, Bimokh, didn’t like Mashmokh. So he fired him. Mashmokh decided to go

dp

#include

ci

ide

原创 2015-06-02 12:41:32 21 阅读

POJ1337---A Lazy Worker(dp)

Description There is a worker who may lack the motivation to perform at his peak level o

dp

#include

ios

ci

原创 2015-06-01 23:50:14 18 阅读

URAL1091---Tmutarakan Exams(dp)

University of New Tmutarakan trains the first-class specialists in mental arithmetic. To ente

dp

#include

ios

sed

原创 2015-05-31 13:12:26 11 阅读

hdu5249---KPI(二分+树状数组)

Problem Description 你工作以后, KPI 就是你的全部了. 我开发了一个服务，取得了很大的知名

二分

树状数组

#include

Stack

原创 2015-05-31 13:10:41 11 阅读

hdu5248---序列变换(二分答案+贪心)

Problem Description 给定序列A={A1,A2,…,An}, 要求改变序列A中的某些元素，形成一个严格单

贪心

二分

#include

ios

二分答案

原创 2015-05-31 13:08:49 22 阅读

hdu5246---超级赛亚ACMer(贪心)

Problem Description 百小度是一个ACMer，也是一个超级赛亚人，每个ACMer都有一个战斗

贪心

#include

数据

ios

原创 2015-05-31 13:06:47 24 阅读

UVA12186--- Another Crisis (树形dp)

Description Download as PDFA couple of years ago, a new world wide crisis started, leaving increase

dp

#include

ide

ios

原创 2015-05-28 22:04:55 32 阅读

POJ2773---Happy 2006(容斥+二分)

Description Two positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9…are all relatively prime to 2006.Now your job is eas

容斥

二分

#include

ios

ci

原创 2015-05-28 19:46:17 18 阅读

hdu4059---The Boss on Mars(容斥原理+前n项的4次方和)

Problem Description On Mars, there is a huge company called ACM (A huge Company on Mars), and it’s owned by a younger boss.Due to no moons around Mars, the employees can only get the salaries per-year

容斥原理

数学

#include

ios

Problem

原创 2015-05-28 18:30:20 13 阅读

ZOJ2836---Number Puzzle(容斥原理)

Given a list of integers (A1, A2, …, An), and a positive integer M, please find the number of positive integers

容斥原理

#include

ios

原创 2015-05-28 16:00:02 11 阅读

hdu5245---Joyful(期望)

Problem Description Sakura has a very magical tool to paint walls. One day, kAc asked Sakura to paint a wall that looks like an M×N matrix. The wall has M×N squares in all. In the whole problem we den

期望

#include

ios

Problem

原创 2015-05-28 13:45:03 7 阅读

UVA10325--- The Lottery (容斥)

The Sports Association of Bangladesh is in great problem with their latest lottery ‘Jodi laiga Jai’. There are so many participants this time that they cannot manage all the numbers. In an urgent mee

容斥原理

#include

ci

ide

原创 2015-05-27 20:49:30 15 阅读

Codeforces Round #305 (Div. 2)D---Mike and Feet(单调栈)

Mike is the president of country What-The-Fatherland. There are n bears living in this country

单调栈

#include

Stack

ide

原创 2015-05-27 20:09:25 36 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

11750658

LightOJ1021---Painful Bases (状压dp)

LightOJ1020(博弈)

LightOJ1017---Brush (III) (dp)

LightOJ1016---Brush (II) (贪心)

LightOJ1010---Knights in Chessboard (规律题)

LightOJ1013---Love Calculator (dp)

LightOJ1012---Guilty Prince (并查集)

LightOJ1011---Marriage Ceremonies (状压dp)

Codeforces Round #306 (Div. 2)

LightOJ1009---Back to Underworld (bfs染色)

POJ2407---Relatives(求单个数的欧拉函数)

POJ1284---Primitive Roots(求原根个数, 欧拉函数)

LightOJ1006---Hex-a-bonacci(矩阵快速幂)

LightOJ1005---Rooks(简单组合数学)

LightOJ1003---Drunk(拓扑排序判环)

LightOJ1002---Country Roads (最短路变形)

hdu2227---Find the nondecreasing subsequences(dp+树状数组)

Codeforces Round #240 (Div. 1)---B.Mashmokh and ACM(dp)

POJ1337---A Lazy Worker(dp)

URAL1091---Tmutarakan Exams(dp)

hdu5249---KPI(二分+树状数组)

hdu5248---序列变换(二分答案+贪心)

hdu5246---超级赛亚ACMer(贪心)

UVA12186--- Another Crisis (树形dp)

POJ2773---Happy 2006(容斥+二分)

hdu4059---The Boss on Mars(容斥原理+前n项的4次方和)

ZOJ2836---Number Puzzle(容斥原理)

hdu5245---Joyful(期望)

UVA10325--- The Lottery (容斥)

Codeforces Round #305 (Div. 2)D---Mike and Feet(单调栈)