
回答 1 已采纳 Problem Description
background:
A new semester comes , and the HDU also meets its 50th birthday. No matter what's your major, the only thing I want to tell you is:"Treasure the college life and seize the time." Most people thought that the college life should be colorful, less presure.But in actual, the college life is also busy and rough. If you want to master the knowledge learned from the book, a great deal of leisure time should be spend on individual study and practise, especially on the latter one. I think the every one of you should take the learning attitude just as you have in senior school.
"No pain, No Gain", HDU also has scholarship, who can win it? That's mainly rely on the GPA(gradepoint average) of the student had got. Now, I gonna tell you the rule, and your task is to program to caculate the GPA.
If there are K(K > 0) courses, the ith course has the credit Ci, your score Si, then the result GPA is
GPA = (C1 * S1 + C2 * S2 +……+Ci * Si……) / (C1 + C2 + ……+ Ci……) (1 <= i <= K, Ci != 0)
If there is a 0 <= Si < 60, The GPA is always not existed.
Input
The first number N indicate that there are N test cases(N <= 50). In each case, there is a number K (the total courses number), then K lines followed, each line would obey the format: CourseName (Length <= 30) , Credits(<= 10), Score(<= 100).
Notice: There is no blank in the Course Name. All the Inputs are legal
Output
Output the GPA of each case as discribed above, if the GPA is not existed, ouput:"Sorry!", else just output the GPA value which is rounded to the 2 digits after the decimal point. There is a blank line between two test cases.
Sample Input
2
3
Algorithm 3 97
DataStruct 3 90
softwareProject 4 85
2
Database 4 59
English 4 81
Sample Output
90.10
Sorry!

回答 1 已采纳 Problem Description
The head technical person, Joey, at ACM (Association for Cyberspace Management)has just received a weird cablelike device – supposedly invented by programmers during a competition – for inspection.
The device may be viewed as a straight bidirectional cable, which can be used for transmitting arbitrary number of data packages simultaneously. The speed with which each package is sent will be predetermined by the device and furthermore may vary within a certain range; however it will remain constant throughout each package’s entire transmission process. The time it takes for a single data package with speed V to arrive at the opposite end of the cable is thus L/V, where L is the length of the cable.
In addition, the user may sometimes send a fixedspeed “detector” package,
which is capable of reporting the number of data packages alongside itself at any time.
Finding this device highly amusing, Joey decides to perform an experiment on the odd “cable”. He has scheduled N packages to be sent from the left side and another M to be sent from the other side of the cable; also, he has calculated the possible speed range for each data package. With this information in hand, Joey wants to estimate the effectiveness of a detector he will send. For a detector that departs at a certain time, its effectiveness can be represented as a real number in the range [0..1], which is simply the ratio of the time during which the detector has a chance of reporting all N + M packages (explained below) to the total time.
If Joey sends the detector at an arbitrary time in [S, T] with speed V from the left side of the cable, what is the average effectiveness he can achieve?
Note: For a detector to have a chance of reporting all N + M packages at time T0, the device must be able to schedule all data packages with such speeds so that all can share the same position with the detector at time T0.
Input
There are multiple test cases in the input file.
Each test case starts with one integer, L ( 1 ≤ L ≤ 106), the length of the cable.
The next line contains one integer, N, the number of packages Joey will send from the
left side, followed by N lines, the ith line with three real numbers, MinVi, MaxVi, and Leavei(1≤MinVi≤MaxVi), which are the minimum speed, maximum speed, and
departure time for package i , respectively. Another (M + 1) lines follow, describing the
packages departing from the right side. The last line of the input contains three real numbers, S, T and V (T  S ≥ 1), whose meanings are described above.
The total number of packages Joey sent will be in the interval [1,5000]. It is
guaranteed that the speed of any data packet, including that of the detector, will be no less than 0.01; also, all real numbers in the input will be given with at most two digits after the decimal point, and will belong to the interval: [0 , 106].
Two successive test cases are separated by a blank line. A case with L = 0
indicates the end of the input file, and should not be processed by your program.
Output
Please print the average effectiveness of the detector’s trip, with precision up to 0.00001.
Sample Input
5
1
5.00 10.00 2.00
2
10.05 11.50 0.05
1.68 2.00 0.01
3.00 4.00 1000
5
1
1.25 2.50 1.0
0
1.00 5.00 2.50
0
Sample Output
Case #1: 0.00000
Case #2: 0.25000

回答 1 已采纳 Problem Description
As far as Samuel is concerned,physics is very dull and doing the physics experiment is a waste of time. So Samuel only got a passing score in the experiment this semester. Dealing with the figures that get from the experiment requires a lot of energy and time,and it is not valuable to do it by press the calculator to get answer. So Samuel and his roommates often make up a program to work it out. Can you help Samuel make a program?
The problem is not hard. You only need to figure out the average M of n number(double type x1,x2,x3...xn) (the precision set as 10).
Input
test cases t,each of a test case contains a number n(an integer) and n figures(double type).
Output
Output the average M by “The average M = m.”here m is a number.
Sample Input
1
3 1.0 1.2 1.1
Sample Output
The average M = 1.1000000000.

回答 1 已采纳 Description
A good drink is always served on ice. That said, the amount of ice is what makes the difference. If it is too much, the drink will be well cooled, however, this is a bit of fraud as there could be less ice (and more Vodka for example). On the other hand, if there is too little ice the drink is warm which is unacceptable. You are to help the bartender, of course neither with mixing nor drinking, but with calculating the expected outcome of such mixtures.
To make things easier, we assume that pure water is mixed with ice in a closed system, i.e., there is no problem with the outside temperature or the warming of the bottle, etc. Therefore, after a some time has passed, the system may be regarded as balanced (there is no further change in temperature and no more melting or freezing). Your job is to calculate the final temperature of this balanced system and the amount of ice and water in this equilibrium state.
As you know from physics, it takes 4.19 Joule to heat one gram of water one Kelvin, whereas it takes 2.09 Joule if it is ice. We define the capacities cw = 4.19 J/(g*K) and ci = 2.09 J/(g*K). Melting one gram of ice takes 335 Joule, where the temperature remains constant at zero. We define the constant em = 335 J/g. The total thermal energy of the ice and the water before the experiment is equal to the thermal energy of the final mixture.
The figure below shows the energy of one gram of ice, icewatermixture, or water, where the temperature is measured relative to 30 degrees Celsius. The jump at 0 degrees represents the melting of ice to water. The amount of energy gained is proportional to the amount of ice already melted.
Input
The input contains several test cases. Each test case consists of four real numbers mw, mi, tw, ti. The mass of water mw and the mass of ice mi are both nonnegative, given in grams, and mw + mi > 0. The water temperature tw and the ice temperature ti follow, both given in degrees Celsius, and you may assume that 30 < ti <= 0 <= tw < 100. The last test case is followed by four zeroes.
Output
For each test case output the amount of ice and water in grams and the final temperature of the mixture in degrees Celsius. All numbers must be rounded to one digit. Adhere to the sample output for the exact format to use.
Sample Input
100 20 50 10
100 22 0 0
100 35 25 10.5
10 90 25 28
0 0 0 0
Sample Output
0.0 g of ice and 120.0 g of water at 27.5 C
22.0 g of ice and 100.0 g of water at 0.0 C
6.0 g of ice and 129.0 g of water at 0.0 C
100.0 g of ice and 0.0 g of water at 4.2 C

回答 1 已采纳 As we know, an atom can be in different energy states (or "energy levels"). Usually, when it transits from a higher energy state to a lower one, it will emit a photon, whose energy is equal to the difference in energy of these two states. Absorption of photons is the reverse process. If a photon, whose energy equal to the difference in energy of two states of an atom, passes by, it may be absorbed and its energy will put the atom into a higher energy level. For most elements, the atom can transit between any two states directly, by emitting or absorbing only one photon. Scientists are puzzled by a new element that they discovered recently. For two certain energy states, the atom of this element can transit between them directly (emitting or absorbing one and only one photon), but for some other pairs of energy states, the atom cannot.
Generally speaking, when an atom transits among energy states one after another, a trail of events (emitting or absorbing a photon) occurs. For example, when transiting from energy state Ei1 to Eit, the atom follows this sequence:
Ei1, Ei2, Ei3, ..., Eik, ..., Eit
Eik (1 <= k <= t) represents a certain energy state. During the of process of transiting from Eik to Eik+1, one and only one photon is emitted or absorbed.
The atom can be in any energy state and transit to some other one. But as we mentioned above, for some pairs of energy states, this special atom cannot transit between them directly. What's more, when its energy state changes from one to another, for example, from Ej1 to Ejw, it can only follow a unique sequence Ej1, Ej2, Ej3, ..., Ejw. And the most interesting thing is that it can only follow another unique sequence Ejw, ..., Ej3, Ej2, Ej1, when it transits back from Ejw to Ej1. You can find that it is the reversion of the former one! Right! Isn't it special?
Now, the scientists need your help today. In an experiment, some atoms of this new element will be put into a container. Any two atoms would be regarded as "dangerous atoms" if they satisfy one of the following conditions:
They are in the same energy state.
They are in different energy states. But if one of them emits or absorbs a photon, they will be in the same states too.
You must make sure that there are no dangerous atoms in this container. And the higher the total energy of the atoms in the container is, the more easily will the experiment succeed.
Now, the scientists have told you all photons that the atoms of this element can emit or absorb, as well as the energy of all atom states. They ask you calculate the highest total energy that the atoms in the container can reach.
Input
There are several testcases in the input. Each begins with a line containing two integers N, M (0 < N, M <= 200), representing the number of the energy levels and the number of the different photons that this kind of atom can emit or absorb respectively. The two numbers are followed by exactly N + M lines, which contain one positive integer each. These N + M positive integers are not greater than 1,000,000. The first N distinguishing integers are the energy of the atom in the N different energy states in ascending order. The next M integers correspond to the energy of the M different photons, which can be emitted or absorbed by atoms of this element. If the difference in energy of any two states equals to the energy of one of the M photons, the atom can transit between these two states directly.
There is no blank line between two data sets. The last testcase is followed by a line containing two zeros.
Output
For each testcase, output one line containing an integer, which indicates the highest total energy that the atoms in the container can reach. There should be no blank line between any two cases.
Sample Input
3 1
2
4
6
2
0 0
Sample Output
8

回答 1 已采纳 度娘的解决办法无效啊，还是我打开方式不对，
```
# For advice on how to change settings please see
# http://dev.mysql.com/doc/refman/5.6/en/serverconfigurationdefaults.html
# *** DO NOT EDIT THIS FILE. It's a template which will be copied to the
# *** default location during install, and will be replaced if you
# *** upgrade to a newer version of MySQL.
[mysqld]
skipnameresolve
# Remove leading # and set to the amount of RAM for the most important data
# cache in MySQL. Start at 70% of total RAM for dedicated server, else 10%.
# innodb_buffer_pool_size = 256M
# Remove leading # to turn on a very important data integrity option: logging
# changes to the binary log between backups.
# log_bin
# These are commonly set, remove the # and set as required.
# basedir = D:\MySQL
# datadir = D:\MySQL\data
# port = .....
# server_id = .....
# Remove leading # to set options mainly useful for reporting servers.
# The server defaults are faster for transactions and fast SELECTs.
# Adjust sizes as needed, experiment to find the optimal values.
# join_buffer_size = 128M
# sort_buffer_size = 2M
# read_rnd_buffer_size = 2M
```
![图片说明](https://imgask.csdn.net/upload/201705/10/1494400451_324500.png)

回答 1 已采纳 Unlucky scientist Vasya was tired of permanent mockeries of his colleagues. He built a time machine to go away into the future. But his machine had taken him into the past and then exploded!
Vasya needed some way to earn money! He has taken the job of the Court Alchemist of King Arthur. His first task is to create the philosophers' stone. Vasya has found $K$ ingredients and now conducts experiments which consist in mixing these ingredients in various proportions. More formally, each experiment consists in taking a1 ounces of the first ingredient, a2 ounces of the second and so on. Then all the ingredients are put into the crucible, carefully mixed and heated. All ai are nonnegative integers, and their sum does not exceed S  the capacity of the crucible. In all Vasya's experiments at least two ingredients are taken, i.e. there are at least two ai greater than zero.
But all his experiments have been unsuccessful up to now. All mixtures have exploded! The King is unpleased. Maids of honour complain to Queen Guinevere about these awful explosion sounds! The King has decided to give one last chance to Vasya. Tomorrow Vasya is to conduct his next experiment, which could become the last. If the mixture explodes again, Vasya will be executed.
Fortunately, Vasya has just found a way to discard some definitely unsuccessful experiments. He has noted that if for some experiment plan (a1, a2, ..., aK) the mixture has exploded, it would explode for any plan (b1, b2, ..., bK) such that bi >= ai for all i. Now Vasya wants to count the number of possible experiments which are not definitely unsuccessful according to his unfortunate experience. He has taken out his pocket computer and now he is writing a program which will compute this number. Can you do this?
Input
The first line of input contains three positive integers 2 <= K <= 30, 2 <= S <= 10000, 0 <= M <= 20 where M is the number of experiments Vasya has already conducted. The next M lines contain K numbers each, one line per experiment.
Output
Output the number of possible experiment plans for which it is not evident that the mixture would explode.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Sample Input
1
2 4 2
1 3
2 1
Sample Output
2

回答 1 已采纳 Description
Bob and Alice live in Roswell (New Mexico, USA) and they have found some strange item on the floor left by an Unidentified Flying Object (UFO). Let us recall that on July 8, 1947, as stated by Col. William Blanchard, Commander of the 509th Bomb Group at Roswell, ``the wreckage of a crashed disk has been recovered". We believe that this strange item comes from this crash. It looks like a big cube of size s , 1<=s<=215 with tiny holes. It shines differently on every face. Bob and Alice are rather smart and they have quickly understood that some complex system inside the cube reflects the light of the sun so that sunlight emerges from some but not all holes of every face.
Experiments led by Bob and Alice have shown that the cube is full of n , 1<=n<=106 doublesided mirrors. Mirrors are located at integer coordinates. They are small (less than one unit in diameter). They are oriented in one of the following directions:
Bob and Alice analyze the cube by putting a light sensor in front of each face of the cube. This simple experiment allows them to compute the amount of light reflected through the corresponding face (i.e., the number of holes through which a light ray emerges). More precisely, the cube is oriented in the following way (the sun is on the y < 0 axis) and there is one unit of light which enters the cube on every integer coordinate of the upper face ( y = 0, 0<=x<=s, 0<=z<=s ).
You are requested to simulate the behavior of the cube. Given the position and the orientation of each mirror, you are kindly asked to compute, for each face, the number of rays that go out of the face of and the total number of times the corresponding rays have been deviated. Note that when the direction of a ray belongs to the plane of a mirror, it passes through without any interaction.
Input
The first integer (on the first line) is the size s of the box. The second line contains an integer n that corresponds to the total number of mirrors in the box. We then have n lines, each of which containing 4 integers : the coordinates (x, y, z) of the corresponding mirror and its orientation (with respect to the above figure). Notice that the coordinates (x, y, z) of mirrors are pairwise distinct.
Output
The output is made of 12 integers (one per line). The 12 integers are made of 6 groups of 2 integers, each group is related to a different face i of the cube ordered as shown in the above figure. In each group, the first integer is the number of rays (the amount of light) that go out of the face i and the second one is the number of times the corresponding rays have been deviated.
Sample Input
5
4
4 4 0 0
1 3 0 1
1 1 0 0
4 1 0 1
Sample Output
0
0
0
0
1
1
1
1
34
0
0
0

湖南大学研究生杜敏的博客 [外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(imgSJyoawDB1582873027451)(https://s2.ax1x.com/2020/02/28/3DVai6.jpg)] [外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接... 
小谢呀的博客 Through the system simulation experiment and analysis, it is found that the extraction of facial features is the key of the system. At the same time, because of the statistical features of gray ... 
johnjim0816的博客 But, more significantly, the structure of the second table provides the reader with an easily perceived context (time) in which the significant piece of information appears on the left in a pattern ... 
Yongqiang Cheng的博客 The Comprehensive Cars (CompCars) dataset  车辆精细识别数据集 Multimedia Laboratory  Datasets http://mmlab.ie.cuhk.edu.hk/datasets.html The Comprehensive Cars (CompCars) dataset ... 
cool whidpers的博客 最近将Highway的思想用到了步态识别上，我觉得应该算是一个创新点，但是小伙伴建议我读一读Rethinking the value of resnet ,或许会对我有所启发。所以今天就来拜读一下。主要是翻译的形式，一段英文一段中文。 ... 
DrogoZhang的博客 Combination of the above Journal 2017 Yuhan Jia; Jianping Wu; Moshe BenAkiva; Ravi Seshadri; Yiman Du (2017). Rainfallintegrated traffic speed prediction using deep learning method. IET Intelligen... 
Bingcheng1998的博客 title: The influence of oversea study on brain drain in China Key words: oversea study, brain drain, heat wave of going abroad I. Definition of topic This research focuses on the influence o..... 
后知还就那个后觉的博客 ValueError：The passed save_path is not a valid checkpoint: ./experiment_VGG/model500000 三种可能的错误解决： 1、注意 "/" 和 "\" 符号不要弄错 2、路径最后不要加 "/" 4、从源码来看， if not ... 
_张张张i的博客 # Adjust sizes as needed, experiment to find the optimal values. join_buffer_size = 128M sort_buffer_size = 16M read_rnd_buffer_size = 16M sql_mode=NO_ENGINE_SUBSTITUTION,STRICT_TRANS_TABLES 3.... 
Fang的博客 MySQL 默认安装将 /var/lib/mysql 作为数据存储目录，可以通过登录 mysql 查看 datadir 变量的值，或者查看 /etc/my.cnf 文件查看： ...  Variable_name  Value  ++... 
BusyJoy的博客 A Brief Discussion on”ChineseStyle of Crossing The Road” Recently, a vocabulary with ChineseStyle tag is popular in weibo,which is getting a lot of attention. Thisvocabulary is "ChineseStyle of... 
S大幕的博客 Understanding the difficulty of training deep feedforward neural networks这几天读了这篇论文，在这里将大致内容写在这里。Abstract介绍这篇论文的主要内容就是尝试更好的理解为什么使用“标准随机初始化”来...