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 >>继续阅读

hdu1512

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

Monkey King

Problem Description

Once in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way and none of them knows each other. But monkeys can't avoid quarrelling, and it only happens between two mon >>继续阅读

poj3646

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

The Dragon of Loowater

Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to the lack of predators, the ge >>继续阅读

poj3641

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

Pseudoprime numbers

Fermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not very many) non-prime values of p, known >>继续阅读

poj3468

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

A Simple Problem with Integers

You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in >>继续阅读

poj3320

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

Jessica's Reading Problem

Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master all ideas included in a very thick t >>继续阅读

poj3268

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

Silver Cow Party

One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; ro >>继续阅读

poj3264

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

Balanced Lineup

For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguou >>继续阅读

poj3259

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

Wormholes

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Eac >>继续阅读

poj3250

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

Bad Hair Day

Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows that can see the top of other cows' heads. Each cow i has a >>继续阅读

poj3243

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

Clever Y

Little Y finds there is a very interesting formula in mathematics:

XY mod Z = K

Given X, Y, Z, we all know how to figure out K fast. However, given X, Z, K, could you figure out Y fast?

Input >>继续阅读

poj3233

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

Matrix Power Series

Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.

Input

The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and  >>继续阅读

poj3126

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

Prime Path

The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.

— It is a matter of security to change such things every n >>继续阅读

poj3122

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

Pie

My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one >>继续阅读

poj3090

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

Visible Lattice Points

A lattice point (xy) in the first quadrant (x and y are integers greater than or equal to 0), other than the origin, is visible from the origin if the line from (0, 0) to (xy) does not pass through any other lattice point >>继续阅读

poj3061

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

Subsequence

A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive ele >>继续阅读