Note: This article is available in Chinese only. 本文暂无英文版本。
View original
codeforcres 589 J - Cleaner Robot(暴力)
Related
codeforces #323 div 2 C. GCD Table (暴力?)
·960 words·2 mins
C. GCD Table
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor of both x and y, it is denoted as . For example, for array a = {4, 3, 6, 2} of length 4 the GCD table will look as follows: