CC

原题描述：On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV.   The rule is very simple.  On the ground there are 100 labeled balloons, with the numbers 1 to 100.

原题描述：Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small

原题 题意 ： 就是A B 壶相互倒水，直到B壶的水满足一定数值N 。一开始没搞懂这道题的输出，oj判断的就是得出其中一个解就可以了？？？好像没啥别的硬性规定，搞得我晕乎了好一阵，直接就一个一个判断数值就好了。代码如下：（要么一直填A ，要么一直填B ，思路是一样的）#include int main( ){ int Ca , Cb , N , a , b ; wh

题目大意就是根据字母的序号和给出的公式将密码翻译过来。#include #include int main ( ){ int ciphercode[ 70 ] , plaincode[ 70 ] ; char plaintext[ 70 ] , ciphertext[ 70 ] ; int K ; while ( scanf("%d",&K ) , K )

原题大意就是当x取某个值的时候，求这个公式的值。其实题目下面那个提示已经很明确了，直接求是肯定不行的，可以通过f(x)-f(1)来求f(x) ,因为已知f(1)=1.那么根据公式可以算出 f(x) - f(1) = (1-x) / ( k* (k+1) * (k+x) ) , 这时分母为k的三次方，原题要求的0.5e-12可以只求到10000，减少了运算量。再根据第三个公式求的最后

原题大意：判断相邻的正方形块能否拼成三角形标号相邻的在一起。Hart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is given n*n squares. Each square is divided into

原题描述：In World War II, Germany once used an electronic encryption machine called Enigma, which played a decisive role in the initial victories of Nazi Germany. It was proved to be one of the mo