## AtCoder Grand Contest 020 (2/6)

maksyuki 发表于 比赛 分类，标签:

A Move and Win

A game is played on a strip consisting of N cells consecutively numbered from 1 to N.

Alice has her token on cell A. Borys has his token on a different cell B.

Players take turns, Alice moves first. The moving player must shift h >>继续阅读

## Codeforces Educational Round 36(Rated for Div. 2) (3/7)

maksyuki 发表于 比赛 分类，标签:

A Garden

Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't wate >>继续阅读

## Codeforces Round Hello 2018 (4/8)

maksyuki 发表于 比赛 分类，标签:

A Modular Exponentiation

The following problem is well-known: given integers n and m, calculate,

where 2n = 2·2·...·2 (n factors), and denotes the remainder of division of x by y.

You are asked to solve the "reverse" problem. Given integers n a >>继续阅读

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

maksyuki 发表于 比赛 分类，标签:

A Tricky Alchemy

During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.

Grisha needs to obtain some ye >>继续阅读

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

maksyuki 发表于 比赛 分类，标签:

## Codeforces Round #340(Div.2) (4/5)

maksyuki 发表于 比赛 分类，标签:

A Elephant

An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x(x > 0) of the coordinate line. In one step the elephant >>继续阅读

## TopCoder SRM#679(Div2)(2/3)

maksyuki 发表于 比赛 分类，标签:

250 Problem Statement

You have two favorite music bands. Each of them has just recorded a new album. You have bought both albums.

You know the durations (in seconds) of songs on each of >>继续阅读

## TopCoder SRM#677(Div2)(2/3)

maksyuki 发表于 比赛 分类，标签:

250 Problem Statement

A positive integer is called a prime if it has exactly two distinct positive integer divisors: 1 and itself. The first few primes are 2, 3, 5, 7, 11, 13, ...

A positive integer is called a palindrome if its base-10 represent >>继续阅读

## BestCoder Round #67 (2/4)

maksyuki 发表于 比赛 分类，标签:

A N bulbs

Problem Description

N bulbs are in a row from left to right,some are on, and some are off.The first bulb is the most left one. And the last one is the most right one.they are numbered from 1 to n,from left to right. >>继续阅读

## Codeforces Round #336(Div.2) (1/5) (Div.1) (0/5)

maksyuki 发表于 比赛 分类，标签:

A Saitama Destroys Hotel

Saitama accidentally destroyed a hotel again. To repay the hotel company, Genos has volunteered to operate an elevator in one of its other hotels. The elevator is special — it starts on the top floor, can only move down, an >>继续阅读

## TopCoder SRM#676(Div2)(2/3)

maksyuki 发表于 比赛 分类，标签:

250 Problem Statement

Farmer John recently found out about a popular online farming game.There are n types of plants in the game. The types are numbered 0 through n-1. At the beginning of the game, Farmer John is given one seed of each plant type.T >>继续阅读

## BestCoder Round #65 (4/5)

maksyuki 发表于 比赛 分类，标签:

A ZYB's Biology

Problem Description

After getting 600 scores in NOIP ZYB(ZJ-267) begins to work with biological questions.Now he give you a simple >>继续阅读

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

maksyuki 发表于 比赛 分类，标签:

A Uncowed Forces

Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Ke >>继续阅读

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

maksyuki 发表于 比赛 分类，标签:

A Numbers

Problem Description

There is a number N.You should output "YES" if N is a multiple of 2, 3 or 5,otherwise output "NO". >>继续阅读

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

maksyuki 发表于 比赛 分类，标签:

A Two Bases

After seeing the "ALL YOUR BASE ARE BELONG TO US" meme for the first time, numbers X and Y realised that they have different bases, which complicated their relations. >>继续阅读

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

maksyuki 发表于 比赛 分类，标签:

A sequence1

Problem Description

Given an array a with length n, could you tell me how many pairs (i,j) ( i < j ) for abs(ai−aj) mod b=c.

Input >>继续阅读