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

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)

>>继续阅读

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

>>继续阅读

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

2015年四川省ACM省赛(1/10)

maksyuki 发表于 比赛 分类,
0
2015年四川省ACM省赛(1/10)

A题

由于正的无理数和任何正数相加都是无理数,所以只要判断所给的数是否都是完全平方数即可

  >>继续阅读