2015ACM-ICPC亚洲区长春网赛(2/13)

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

 

B Ponds

Problem Description

Betty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value v. Now Betty wants to remove some ponds becaus >>继续阅读

BestCoder Round #55(0/4)

maksyuki 发表于 比赛 分类,标签:
0
BestCoder Round #55(0/4)

>>继续阅读

Codeforces Round #319(Div.2) (4/5) (Div.1) (2/5)

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

>>继续阅读

BestCoder Round #54(Div.2) (4/4) (Div.1) (3/4)

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

A problem of sorting

Problem Description

There are many people's name and birth in a list.Your task is to print the name from young to old.(There is no pair of >>继续阅读

HihoCoder挑战赛14(2/4)

maksyuki 发表于 比赛 分类,标签:
0
HihoCoder挑战赛14(2/4)

A 不等式

描述

给定n个关于X的不等式,问最多有多少个成立。

每个不等式为如下的形式之一:

X < C

X <= C

X = C

X > C

X >= C

输入

第一行一个整数n。

以下n行,每行一个不等式。

数据范围:

1<=N<=50,0<=C<=1000

输出

一行一个整数,表示最多可以同时成立的不等式个数。

样例输入

4

X = 1

X = 2

X = 3 >>继续阅读

Codeforces Round #318(Div.2) (4/5) (Div.1) (2/5)

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

>>继续阅读

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

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

>>继续阅读

Codeforces Round #317(Div.2) (3/5) (Div.1) (1/5)

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

A. Arrays

You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to >>继续阅读

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

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

>>继续阅读

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

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

>>继续阅读

BestCoder Round #47 (0/4)

maksyuki 发表于 比赛 分类,标签:
0
BestCoder Round #47 (0/4)

>>继续阅读

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

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

A Ilya and Diplomas

Soon a school Olympiad in Informatics will be held in Berland, n schoolchildren will participate there.

At a meeting of the jury of the Olympiad it was decided that each of the n participants, depending on the results, will ge >>继续阅读

Codeforces Round #310(Div.2) (3/5) (Div.1) (1/5)

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

A.Case of the Zeros and Ones

Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.

Once he thought about a string of length n consisting of zeroes and ones. Consider the fol >>继续阅读

Codeforces Round #309(Div.2) (3/5) (Div.1) (1/5)

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

A.Kyoya and Photobooks

Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled "a" to "z", and he has compiled them into a photo booklet with some photos in some order (possibly with some photos being duplic >>继续阅读

BestCoder Round #45 (2/4)

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

A.Dylans loves numbers

Problem Description

Who is Dylans?You can find his ID in UOJ and Codeforces. His another ID is s1451900 in BestCoder. And now today's problems are all about him.Dylans is given a number N. >>继续阅读

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

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

A.Vanya and Table

Vanya has a table consisting of 100 rows, each row contains 100 cells. The rows are numbered by integers from 1to 100 from bottom to top, the columns are numbered from 1 to 100 from left to right.

In this table, Vanya chose n re >>继续阅读