CCPC sign title Collection
2019 Qinhuangdao:
given positive integer n, is determined 1 / n is not an infinite repeating decimals. (T <= 100, n < = 100)
Solution:
Since \ (1 / n \) is a rational, non-repeating decimals rational does not contain infinite, so \ (1 / n \) is not limited decimal is infinite decimal. So every time it is divided by 2 and 5, until not divide, if this time is a finite decimal, or infinite decimals
CCPC Harbin:
Given n integers, each integer in the range 0-100, and asked if integer less than 80 greater than \ (1/3 \)
Solution:
a simple simulation
CCPC Harbin:
Given n boxes, the boxes have i \ (a_i \) balls, are all optionally from two pellets, find the probability of two balls from different boxes (t < = \ ({10} ^. 5 \) , \ (\ Sigma \) n-< \ ({10} ^. 5 \) , \ (a_i \) <= \ ({10} ^. 5 \) )
Interpretations:
P = 1-P (probability from the same box)
CCPC Harbin:
Given a string 6, depicting a character can find Harbin configuration, output Yes / No from each string. Total T group Test ( \ (. 1 \ Leq T \ Leq \) \ (. 5 * {10} ^. 4 \) ), to ensure that the length of all strings and not more than (2 * {10} 6 ^ \) \
Solution:
1, showing the relationship between each string and the pretreatment harbin, violent search
relationship 2, and each string harbin pretreatment, even sides, run bipartite graph matching
CCPC Harbin:
Given n-( \ (. 1 \ Leq n-\ Leq {10} ^. 9 \) ), seeking whether a prime number x number Harmony exists y such that \ (x + y = n-\) , or the output of -1, a total of T ( \ (. 1 \ Leq T \ Leq ^ {10}. 5 \) )
solution:
ICPC Yinchuan:
the number of output fibnacci front row five
Solution:
? ? ?
ICPC Yinchuan:
converting a digital x k at a next band to band y ( \ (k \ ^ n-Leq {120} \) )
solution to a problem:
the Java or python
ICPC Yinchuan:
a \ (n * m \) matrix, \ (n-, m \ GEQ 2 \) , initially all 0, +1 each row or column may be +1, now a number of missing, it is much demand .
Solution:
direct access to a 2 * 2 matrix (including the unknown), A11-A12 = A21- A22, to
ICPC Yinchuan:
answer:
ICPC Yinchuan:
Given an interval ( \ (. 1 \ Leq L \ R & lt Leq \ Leq 18 is ^ {10} \) ) and an integer S, please find a longest interval in the sub-interval, so that the interval and all of the exclusive oR values (\ leq S \) \
solution:
ICPC Xuzhou:
Given find a \ (- 5000 \ leq a, b, c \ leq 5000 \) such that \ (^. 3 A + B + C ^. 3. 3 = X ^ \) . (1 \ leq x \ leq 200 )
Solution:
ICPC Xuzhou:
Given an interval ( \ (. 1 \ Leq L \ R & lt Leq \ Leq} ^ {10} {18 is \) ), where this interval is determined prime number is not less than one third of the length of the interval.
Solution:
Miller Rubin
ICPC Nanjing:
Given n-( \ (. 1 \ n-Leq \ Leq ^ {10}. 9 \) ), to find a minimal size for all integer k such that {1,2, ..., n} is a child of k there are two numbers in the set is divisible relationship
problem solution:
\ (ANS = \)
ICPC Nanjing:
Given three triangle coordinates and the coordinates of the point P, Q required to find that such rates triangle area segment PQ and PQ are sides of the triangle.
answer:
Nanjing, ICPC:
prince to marry the princess?
ICPC Shanghai:
gives the n digits, the length of less than 10, ask if there are a number of other prefix number.
Problem solution:
Trie tree board questions
ICPC Shanghai:
Given a simple graph, point number $ \ leq $ 16, after deleting the edge part so that the figure of wonders ring, ask how much is up to the rest of the side
Solution:
maximum bipartite graph matching