命运在指间

Problem D So Hard Accept: 188    Submit: 948 Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description 请将有限小数化为最简分数。 Input 一个整数n 表示需要转化的小数个数；接下来n行，每行有一个有限小数。（保证小数位数不超过9位） O

Description DZY loves chemistry, and he enjoys mixing chemicals. DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them

Description I am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from 0 to n-1 and each road has a cost. There are m roads. You are gi

There are n swords of different weights Wiand n heros of power Pi. Your task is to find out how many ways the heros can carry the swords so that each hero carries exactly one sword. Here are some