Floraqiu的博客

Codeforces 931.C Laboratory Work Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the e...

Here N (N ≥ 3) rabbits are playing by the river. They are playing on a number line, each occupying a different integer. In a single move, one of the outer(注意！外面的兔子才可以跳) rabbits jumps into a space betwe

nn pagodas were standing erect in Hong Jue Si between the Niushou Mountain and the Yuntai Mountain, labelled from 11 to nn. However, only two of them (labelled aa and bb, where 1≤a≠b≤n1≤a≠b≤n) withstoo

用1，2，3，…，9组成3个三位数abc，def和ghi，每个数字恰好使用一次，要求abc：def：ghi＝1：2：3。按照“abc def ghi”的格式输出所有解，每行一个解。提示：不必太动脑筋。 根据题目要求，可以用到的最小的数（作为abc）是123，最大的数（作为ghi）是987，由最大数可以根据3个数的比例推算出最小数abc的上限为987÷3=329，因此最小数abc的范围是123~329

【思维】Maximum Multiple HDU - 6298 Given an integer n, Chiaki would like to find three positive integers x, y and z such that: n=x+y+z, x∣n, y∣n, z∣n and xyz is maximum. Input There are multiple test...

【递推】【巧妙模拟】【思维】ZOJ 1633 Big String 【拼接两个字符串】 We will construct an infinitely long string from two short strings: A = “^__^” (four characters), and B = “T.T” (three characters). Repeat the following st...

【思维】HDU 6376 度度熊剪纸条 【01串，剪k刀，问拼接后最多的前缀1数量是多少】 Problem Description 度度熊有一张纸条和一把剪刀。 纸条上依次写着 N 个数字，数字只可能是 0 或者 1。 度度熊想在纸条上剪 K 刀（每一刀只能剪在数字和数字之间），这样就形成了 K+1 段。 他再把这 K+1 段按一定的顺序重新拼起来。 不同的剪和接的方案，可能会得到不...