bzoj2190

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

2190: [SDOI2008]仪仗队

Description

作为体育委员,C君负责这次运动会仪仗队的训练。仪仗队是由学生组成的N * N的方阵,为了保证队伍在行进中整齐划一,C君会跟在仪仗队的左后方,根据其视线所及的学生人数来判断队伍是否整齐(如下图)。 现在,C君希望你告诉他队伍整齐时能看到的学生人数。

>>继续阅读

sgu112

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

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 分类,标签:
0
sgu105

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 分类,标签:
0
sgu104

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 分类,标签:
0
sgu102

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

sgu100

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

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).

>>继续阅读