2015ACM-ICPC亚洲区合肥站网赛(0/10)

maksyuki 发表于 比赛 分类,
0
2015ACM-ICPC亚洲区合肥站网赛(0/10)

>>继续阅读

BestCoder Round #57(Div.2) (2/4) (Div.1) (1/4)

maksyuki 发表于 比赛 分类,标签:
0
BestCoder Round #57(Div.2) (2/4) (Div.1) (1/4)

Scaena Felix

Problem Description

Given a parentheses sequence consist of '(' and ')', a modify can filp a parentheses, changing '(' to ')' or ')' to '('. >>继续阅读

2015ACM-ICPC亚洲区上海站网赛(0/11)

maksyuki 发表于 比赛 分类,
0
2015ACM-ICPC亚洲区上海站网赛(0/11)

>>继续阅读

Codeforces Round #321(Div.2) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #321(Div.2) (2/5)

A Kefa and First Steps

Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-de >>继续阅读

bzoj1087

maksyuki 发表于 oj 分类,标签:
0
bzoj1087

1087: [SCOI2005]互不侵犯King

Description

在N×N的棋盘里面放K个国王,使他们互不攻击,共有多少种摆放方案。国王能攻击到它上下左右,以及左上左下右上右下八个方向上附近的各一个格子,共8个格子。

Input

只有一行,包含两个数N,K ( 1 <=N <=9, 0 <= K <= N * N) >>继续阅读

poj2385

maksyuki 发表于 oj 分类,标签:
0
poj2385

Apple Catching

It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apples when they are on the tree, so she must wait >>继续阅读

poj3659

maksyuki 发表于 oj 分类,标签: ,
0
poj3659

Cell Phone Network

Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell phone towers on his N (1 ≤ N ≤ 10,000) pastures (conveniently numbered 1..N >>继续阅读

poj1463

maksyuki 发表于 oj 分类,标签: ,
0
poj1463

Strategic game

Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a >>继续阅读

ural1018

maksyuki 发表于 oj 分类,标签:
0
ural1018

1018. Binary Apple Tree

Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enumerate by integers the root of binary ap >>继续阅读

poj2063

maksyuki 发表于 oj 分类,标签:
0
poj2063

Investment

John never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only inheritor.

John did not need that muc >>继续阅读

poj1014

maksyuki 发表于 oj 分类,标签:
0
poj1014

Dividing

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just spli >>继续阅读

2015ACM-ICPC亚洲区北京站网赛(1/10)

maksyuki 发表于 比赛 分类,
0
2015ACM-ICPC亚洲区北京站网赛(1/10)

H 描述

This is the logo of PKUACM 2016. More specifically, the logo is generated as follows:

Put four points A0(0,0), B0(0,1), C0(1,1), D0(1,0) on a cartesian coordinate system.

Link A0B0, B0C0, C0D0, D0A0separately, forming square A0B0C0D0.

>>继续阅读

BestCoder Round #56(Div.2) (0/4) (Div.1) (0/4)

maksyuki 发表于 比赛 分类,标签:
0
BestCoder Round #56(Div.2) (0/4) (Div.1) (0/4)

>>继续阅读

2015ACM-ICPC亚洲区沈阳站网赛(2/13)

maksyuki 发表于 比赛 分类,
0
2015ACM-ICPC亚洲区沈阳站网赛(2/13)

J Jesus Is Here

Problem Description

I've sent Fang Fang around 201314 text messages in almost 5 years. Why can't she make sense of what I mean?

But Jesus is here!" the priest intoned. Show me your messages."

Fine, the first message is s1=‘‘c" >>继续阅读

hdu2795

maksyuki 发表于 oj 分类,标签:
0
hdu2795

Billboard

Problem Description

At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are posted: nearest programming compe >>继续阅读

hdu1394

maksyuki 发表于 oj 分类,标签:
0
hdu1394

Minimum Inversion Number

Problem Description

The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.

For a given sequence of numbers a1, a2, ..., an, if we move the f >>继续阅读