## lightoj1010

maksyuki 发表于 oj 分类，标签:

1010 - Knights in Chessboard

Those who are not familiar with chess knights, note that a chess knight can attack 8 positions in the board as shown in the picture below.Given an m x n chessboard where you want to place chess knights. You have to find >>继续阅读

## lightoj1008

maksyuki 发表于 oj 分类，标签:

1008 - Fibsieve`s Fantabulous Birthday

Among these gifts there was an N x N glass chessboard that had a light in each of its cells. When the board was turned on a distinct cell would light up every second, and then go dark.Fibsieve had a fantabulou >>继续阅读

## lightoj1007

maksyuki 发表于 oj 分类，标签:

1007 - Mathematically Hard

In this problem, you will be given two integers a and b. You have to find the summation of the scores of the numbers from a to b (inclusive). The score of a number is defined as the following function.Mathematically some >>继续阅读

## lightoj1002

maksyuki 发表于 oj 分类，标签:

For example, in the above picture, if we want to go from 0 to 4, then we can chooseI am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from 0 to n-1 and each road has >>继续阅读

## bzoj3229

maksyuki 发表于 oj 分类，标签:

## bzoj2818

maksyuki 发表于 oj 分类，标签:

## bzoj2705

maksyuki 发表于 oj 分类，标签:

## Description

Longge的数学成绩非常好，并且他非常乐于挑战高难度的数学问题。现在问题来了：给定一个整数N，你需要求出∑gcd(i, N)(1<=i <=N)。

## bzoj2190

maksyuki 发表于 oj 分类，标签:

## sgu112

maksyuki 发表于 oj 分类，标签:

ab-ba

You are given natural numbers a and b. Find ab-ba.

Input

Input contains numbers a and b (1≤a,b≤100).

## sgu105

maksyuki 发表于 oj 分类，标签:

Div 3

There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Given first N elements of that sequence. You must determine amount of numbers in it that are divisible by 3.

Input

Input contains N (1<=N<=231 - 1).

Output

Write >>继续阅读

## sgu104

maksyuki 发表于 oj 分类，标签:

Little shop of flowers

PROBLEM

You want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being of a different kind, and at least as many vases ordered in a row. The vases are glued onto >>继续阅读

## sgu102

maksyuki 发表于 oj 分类，标签:

Coprimes

For given integer N (1<=N<=104) find amount of positive numbers not greater than N that coprime with N. Let us call two positive integers (say, A and B, for example) coprime if (and only if) their greatest common divisor is 1. >>继续阅读

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

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

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 发表于 比赛 分类，标签:

## sgu100

maksyuki 发表于 oj 分类，标签:

A+B

Read integers A and B from input file and write their sum in output file.

Input

Input file contains A and B (0<A,B<10001).

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

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