Location:
Search - coin find
Search list
Description: 解决时钟问题，acm竞赛题
A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.
Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.-clock to solve the problem, acm contest A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you can not use any other kind. There are infinite number of coins of each kind, each marked with a number d (0 lt; = 1000), meaning that this coin will make the minute hand move clockwise d times the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s (0 lt; s = lt; = 59) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
Platform: |
Size: 1308 |
Author: 王冠 |
Hits:
Description: 解决时钟问题，acm竞赛题
A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.
Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.-clock to solve the problem, acm contest A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you can not use any other kind. There are infinite number of coins of each kind, each marked with a number d (0 lt; = 1000), meaning that this coin will make the minute hand move clockwise d times the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s (0 lt; s = lt; = 59) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
Platform: |
Size: 1024 |
Author: 王冠 |
Hits:
Description: 使用VC++编写的自动找币机的控制程序。
有sql2000数据库，用于存储记录。
使用控件实现对找币机串口的控制。-The use of VC++ Prepared automatically find coin machine control procedures. There SQL2000 database, used to store records. The use of controls to achieve coin machine to find the serial control.
Platform: |
Size: 4734976 |
Author: 周斌 |
Hits:
Description: 10. 设有n种不同面值的硬币，各硬币的面值存在于数足T[n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[n]中。对任意钱数0<=m<=20009，设计一个用最少硬币找钱m的方法。-10. There are n different denominations of coins, each coin with a face value exists in the number of adequate T [n] Medium. Is to use these coins to find the money. Can use the various denominations of coins stored in an array of the number of Coins [n] Medium. The amount of money for any 0 < = m < = 20009, the design of a coin with minimal change, m method.
Platform: |
Size: 7168 |
Author: 林大嘴 |
Hits:
Description: 一个自动售邮票的控制电路。
用两个发光二极管分别模拟售出面值为六角和八角的邮票，购买者可以通过开关选择一种面值的邮票，灯亮时表示邮票售出。用开关分别模拟一角、五角和一元硬币投入。用发光二极管分别代表找回剩余的硬币。
要求：每次只能售出一枚邮票；当所投硬币达到或超过购买者所选面值时，售出一枚邮票，并找回剩余的硬币回到初始状态；当所投硬币值不足面值时，可以通过一个复位键退回所投硬币，回到初始状态。-An automatic control circuit sell stamps. With two light-emitting diodes were simulated sold hexagonal and octagonal face value of the stamps, the purchaser can select a switch with a face value of stamps, stamp lights that were sold. Analog switch, respectively, of the iceberg, the Pentagon and one-dollar coins into. Representing the light-emitting diodes used to find the remaining coins. Requirements: only the sale of each stamp cast coins when reached or exceeded the face value of the selected buyer, the sale of a stamp and get the remaining coins back to the initial state when the vote with a face value of coins worth less than when can be reset through a vote by coin return button to return to the initial state.
Platform: |
Size: 1024 |
Author: 张三 |
Hits:
Description: 设有n种不同面值的硬币，各硬币的面值存于数组T[1:n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[1:n]中。
对任意钱数0<=m<=20001,设计一个用最少硬币找钱m的方法。
-N has a different face value coins, the face value of the coins stored in the array T [1: n] in. Is to use these coins to find the money. Can use the various denominations of the coins stored in an array of the number of Coins [1: n] in. The amount of money for any 0 < = m < = 20001, the design of a coin with at least the method of m money.
Platform: |
Size: 45056 |
Author: 无疆 |
Hits:
Description: 有一大堆金币其中有一枚假币在一堆金币中找出一个价币来。-Have a lot of these, a counterfeit gold coin in the pile of coins to find a price.
Platform: |
Size: 986112 |
Author: 刘飞 |
Hits:
Description: 设有n 种不同面值的硬币，各硬币的面值存于数组T〔1:n 〕中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins〔1:n 〕中。
对任意钱数0≤m≤20001，设计一个用最少硬币找钱m 的方法。-With n different coins, the face value of the coins stored in the array of T 〔1: n〕 in. Now use these coins to find the money. You can use the number of coins of various denominations stored in the array Coins 〔1: n〕 in.
The amount of money for any 0 ≤ m ≤ 20001, find the money to design a coin with at least m of the method.
Platform: |
Size: 445440 |
Author: kevin |
Hits:
Description: 设计一个简易的自动售货机，它能够完成钱数处理、找零、显示、退币等功能。
（1）用3个键表示3种钱，再用3个键表示3种物品。
（2）用2个数码管显示输入的钱数，再用2个数码管显示所找的钱数，以元为单位
-Design a simple vending machine, the amount of money that it can complete the treatment, give change, display, coin and other functions. (1) with three keys that three kinds of money, and then 3 keys that 3 items. (2) digital display with two inputs of money, and then two digital display to find the money by the number of units in dollars
Platform: |
Size: 10240 |
Author: chenbei |
Hits:
Description: 设有n种不同面值的硬币，各硬币的面值存于数组T[1:n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[1:n]中。对任意钱数0≤m≤20001，设计一个用最少硬币找钱m的方法。-With n different coins, the face value of the coins stored in the array T [1: n] in the. Now use these coins to find the money. You can use the number of coins of various denominations stored in an array of Coins [1: n] in the. The amount of money for any 0 ≤ m ≤ 20001, find the money to design a coin with at least m of the method.
Platform: |
Size: 537600 |
Author: 陈星风 |
Hits:
Description: 硬币找钱问题的解决方案，时间复杂度小，方法十分方便-Coin find money solution to the problem
Platform: |
Size: 191488 |
Author: cannon |
Hits:
Description: 有n种不同面值的硬币，各硬币面值存于数组T[1:n] 现用这些面值的钱来找钱；各面值的个数存在数组Coins[1:n]中。
对于给定的1<=n<=10，硬币面值数组、各面值的个数及钱数m，0<=m<=2001，编程计算找钱m的最少硬币数。
-There are n different denominations of coins, each coin denomination stored in the array T [1: n] current face value of money with these find money the number of each denomination there are an array of Coins [1: n] in. For a given 1 < = n < = 10, an array of coin denominations, the denomination of the money number and the number m, 0 < = m < = 2001, m program calculate the minimum number of coins find money.
Platform: |
Size: 14336 |
Author: 阿四 |
Hits:
Description: 在n个银币中有一个是不合格的，不合格的银币比合格银币要轻。
现用天平秤银币，找出不合格的银币，且在最坏情况下秤银币的次数最少
-In n silver in one is unqualified, not qualified silver qualified to light than silver.
Now in the balance scale, and find out the unqualified silver coin, and in the worst cases the least number scale silver
Platform: |
Size: 136192 |
Author: 王绍华 |
Hits:
Description: 解决8枚硬币问题。在8枚硬币中有一枚是假硬币，把这个假硬币找出来。-Solve the eight coins problem. In the eight coins in a coin is fake, fake coins to find this out.
Platform: |
Size: 168960 |
Author: 韩娇 |
Hits:
Description: 算法实现题3-1 最少硬币问题
问题描述：设有n种不同面值的硬币，各硬币的面值存于数组T[1:n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[1:n]中。对任意钱数0≤m≤20001，设计一个用最少硬币找钱m的方法。
算法设计：对于给定的1≤n≤10，硬币面值数组T和可以使用的各种面值的硬币个数数组Coins，以及钱数m，0≤m≤20001，计算找钱m的最少硬币数。
数据输入：由文件input.txt 提供输入数据，文件的第一行中只有1 个整数给出n的值,第2 行起每行2 个数，分别是T[j]和Coins[j]。最后1 行是要找的钱数m。
结果输出: 将计算出的最少硬币数输出到文件output.txt中。问题无解时输出-1。-Algorithm to achieve the title 3-1 at least coins Description: There are n kinds of different denominations of coins, the nominal value of each coin is stored in an array T [1: n]. Now use these nominal value of the coins came to money. The number of coins of various denominations that can be used is stored in an array of Coins is [1: n]. Any money 0 ≤ m ≤ 20 001, design a minimum of coins to give change m the method. Algorithm design: For a given 1 ≤ n ≤ 10 Coins come in denominations of array T and can use the various denominations of coins in the number of array Coins, as well as money m, 0 ≤ m ≤ 20 001, calculate the minimum number of coins to find the money m. Data Input: input data from the file input.txt, the first line of the file, given an integer value of n, since each line number in line 2, respectively, T [j] and Coins is [j]. The last line is looking for money m. The results of the output: calculate the minimum number of coins output to the file output.txt. Problem has no
Platform: |
Size: 1024 |
Author: 杨蔚 |
Hits:
Description: 自动售出饮料机系统。该饮料机有五种饮料出售，其价钱分别为1元、1.5元、2元、2.5元和3元；系统可接受五种钱币类型，分别为硬币5角、硬币1元、纸币1元、纸币5元和纸币10元；基本要求：第一，每次可以购置一瓶饮料；第二，每次购置饮料可以接受多次钱币的投入；第三，可以找钱；-Automatic beverage machine systems sold. Five drinks in the beverage machine sale, its price is 1 yuan, 1.5 yuan, 2 yuan, 2.5 yuan and 3 yuan system can accept five coin types, respectively, for coins of 50 cents, coins, banknotes, 5 yuan banknotes and banknotes 10 yuan basic requirements: first, each purchase of a bottle of drink second, each purchase of the beverage can receive many times the coin inputs Third, we can find the money
Platform: |
Size: 50176 |
Author: 李 |
Hits:
Description: 本设计采用实验专用小车，以AT89S52单片机为控制核心，加以超声波测距仪、探测电路、通信部分、液晶显示、电源电路以及其他电路构成。系统由89S52通过IO口控制小车的前进后退以及转向。超声波测距仪用来测量小车在封闭的场地里的具体坐标。探测电路用来探测硬币，经通信系统将第一辆小车测得的硬币位置传给第二辆小车,后一辆小车将根据收到的数据自动找到该硬币。同时本系统将测得各项数据通过液晶显示出来。-This design USES the special car to AT89S52 single chip microcomputer as control core, to ultrasonic range finder, detection circuit, communication part, liquid crystal display, power supply circuit and other circuit composition. System is composed of 89 s52 through the IO port control the car forward and backward and steering. Ultrasonic distance measuring instrument used to measure the car in a closed in the site specific coordinates. Detection circuit used to detect COINS, the communication system will be the first car of measured coin position to the second car, car will according to the received data automatically find the COINS. At the same time the system will measure the data through the liquid crystal display.
Platform: |
Size: 1190912 |
Author: 邓竞 |
Hits:
Description: 硬币找零算法（动态规划）：有一堆不同面值的硬币，需要找到一个硬币数最少的组合来组成某一个数值。-Coin change algorithm (dynamic programming): There are a bunch of different denominations of coins, need to find a combination of the number of coins to form at least one value.
Platform: |
Size: 6144 |
Author: laogao4 |
Hits:
Description: 硬币找钱问题
设有6种不同面值的硬币，各硬币的面值分别为5分、1角、2角、5角、1元和2元。现在要用这些面值的硬币来购物和找钱。购物时可以使用的各种面值的硬币个数存于数组Coins[1:6]中，假设商店里各面值的硬币有足够多。对于给定的付款金额，计算使用硬币个数最少的交易方案。输入数据的每一行有6个整数和一个有2位小数的实数，分别表示可以使用的各种面值的硬币个数和付款金额。输出为交易所需要的最少硬币个数，如果不可能完成交易，则输出“impossible”。-Coins give change problem
Has six different denominations of coins in denominations of coins were 5 minutes, 10 cents, 20 cents, 50 cents, 1 yuan and 2 yuan. Now we use these coin denominations to shop and find the money. When shopping the number of coins of various denominations that can be used is stored in an array of Coins [1: 6], it is assumed for each denomination of coin store more than enough. For a given payment amount, calculated using the minimum number of coins trading scheme. Enter the data for each row has six integer and a real number two decimal places, respectively, the number of coins of various denominations that can be used and payment amount. The output is the minimum number of coins needed exchanges, if it is impossible to complete the transaction, the output impossible .
Platform: |
Size: 710656 |
Author: 小鹿 |
Hits:
Description: 有N个硬币，含 1 枚伪币 （伪币质量与真币质量不一样，真币质量都相同），此程序可以花费平均最少的时间找到伪币(There are N coins, 1 counterfeit coins (coins and coin quality really different quality, the quality of real coins are the same), this program can spend the least time to find the average)
Platform: |
Size: 1024 |
Author: 似水流年001
|
Hits: