Location:
Search - corsair 1.2
Search list
Description: cosiar文件共享服务器客户端软件，提供ftp服务-cosiar
Platform: |
Size: 54669312 |
Author: andy |
Hits:
Description: 关于海盗分金的一个问题--和最小且相等问题-a least and same sub.
Platform: |
Size: 1024 |
Author: 吴玉常 |
Hits:
Description: 一伙海盗抢劫一艘商船后，共截获重量不等的N 个金币。海盗试图按重量平分金币，但由于金币
不可分割，所以他们想确定最多可以将这批金币平均分给多少个海盗。请编写程序确定分配方案。
【输入】
输入包含两行：
第一行为一个正整数N，表示金币总数。
第二行包含N 个正整数，表示N 个金币的重量，以空格分隔。
【输出】
只有一行：包含一个正整数，表示输入给定的N 个金币最多可以平均分给多少个海盗。
【限制】
1 <= N <= 60
金币重量的范围为1 到50 -Group of pirates after the robbery of a merchant ship, intercepted a total of N coins of varying weight. The pirates tried to split the gold by weight, but because of the gold indivisible, so they want to make sure these coins can add up to average to the number of pirates. Please write a program to determine the distribution plan. [Input] input contains two lines: the first acts of a positive integer N, the total number of said coins. The second line contains N positive integer, indicating the weight of N coins, separated by spaces. [Output] only a single line: contains a positive integer, said up to enter a given N coins can be divided equally among the number of pirates. [Sample input] [sample output] 4 2 1 2 3 4 [limit] 1 < = N < = 60 gold weight range of 1-50
Platform: |
Size: 2072576 |
Author: Yalei Tan |
Hits:
Description: Reads memory rocket league and displays it on Corsair K95s graphically.-Reads memory rocket league and displays it on Corsair K95s graphically.
Platform: |
Size: 76800 |
Author: Abdul |
Hits: