POJ
来源:互联网 发布:mac os x 10.9.5百度云 编辑:程序博客网 时间:2024/06/08 17:09
e-Coins
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 750 Accepted: 372
Description
At the Department for Bills and Coins, an extension of today's monetary system has newly been proposed, in order to make it fit the new economy better. A number of new so called e-coins will be produced, which, in addition to having a value in the normal sense of today, also have an InfoTechnological value. The goal of this reform is, of course, to make justice to the economy of numerous dotcom companies which, despite the fact that they are low on money surely have a lot of IT inside. All money of the old kind will keep its conventional value and get zero InfoTechnological value.
To successfully make value comparisions in the new system, something called the e-modulus is introduced. This is calculated as SQRT(X*X+Y*Y), where X and Y hold the sums of the conventional and InfoTechnological values respectively. For instance, money with a conventional value of $3 altogether and an InfoTechnological value of $4 will get an e-modulus of $5. Bear in mind that you have to calculate the sums of the conventional and InfoTechnological values separately before you calculate the e-modulus of the money.
To simplify the move to e-currency, you are assigned to write a program that, given the e-modulus that shall be reached and a list of the different types of e-coins that are available, calculates the smallest amount of e-coins that are needed to exactly match the e-modulus. There is no limit on how many e-coins of each type that may be used to match the given e-modulus.
To successfully make value comparisions in the new system, something called the e-modulus is introduced. This is calculated as SQRT(X*X+Y*Y), where X and Y hold the sums of the conventional and InfoTechnological values respectively. For instance, money with a conventional value of $3 altogether and an InfoTechnological value of $4 will get an e-modulus of $5. Bear in mind that you have to calculate the sums of the conventional and InfoTechnological values separately before you calculate the e-modulus of the money.
To simplify the move to e-currency, you are assigned to write a program that, given the e-modulus that shall be reached and a list of the different types of e-coins that are available, calculates the smallest amount of e-coins that are needed to exactly match the e-modulus. There is no limit on how many e-coins of each type that may be used to match the given e-modulus.
Input
A line with the number of problems n (0 < n<=100), followed by n times:
- A line with the integers m (0 < m<=40) and S (0 < S<=300), where m indicates the number of different e-coin types that exist in the problem, and S states the value of the e-modulus that shall be matched exactly.
- m lines, each consisting of one pair of non-negative integers describing the value of an e-coin. The first number in the pair states the conventional value, and the second number holds the InfoTechnological value of the coin.
Output
The output consists of n lines. Each line contains either a single integer holding the number of coins necessary to reach the specified e-modulus S or, if S cannot be reached, the string "not possible".
Sample Input
3 2 5 0 2 2 0 3 20 0 2 2 0 2 1 3 5 3 0 0 4 5 5
Sample Output
not possible 10 2
Hint
The illustration examplifies adding 8 coins of conventional value 2 and InfoTechnological value 1, and 2 coins with pure InfoTechnological value 2. The e-modulus is of course 20 as SQRT((8*2+2*0)^2+(8*1+2*2)^2)=SQRT(16^2+12^2)=20
Source
Svenskt Mästerskap i Programmering/Norgesmesterskapet 2001
[Submit] [Go Back] [Status] [Discuss]
题意: 给出N种a和b值,让你从中选出最少的数量(每种取次数无限制),使得能够满足a^2+b^2=s^2思路:用bfs搜索,把N种值放到一个结构体中,便于使用。
#include<stdio.h>#include<string.h>#include<math.h>#include<queue>using namespace std;int map[400][400];int u[200],v[200],n,m;int book[400][400];struct node{ int x; int y; int step;} ;void bfs(){ memset(book,0,sizeof(book)); queue<node> q; node now,tmp; now.x=0; now.y=0; now.step=0; book[0][0]=1; q.push(now); while(!q.empty()) { now=q.front(); q.pop(); if(sqrt(now.x*now.x+now.y*now.y)==n) { printf("%d\n",now.step); return ; } for(int i=0;i<m;i++) { int tx=now.x+u[i]; int ty=now.y+v[i]; if(tx*tx+ty*ty<=n*n&&book[tx][ty]==0) { book[tx][ty]=1; tmp.x=tx; tmp.y=ty; tmp.step=now.step+1; q.push(tmp); } } } printf("not possible\n");}int main(){ int t; scanf("%d",&t); while(t--) { scanf("%d%d",&m,&n); for(int i=0;i<m;i++) scanf("%d%d",&u[i],&v[i]); bfs(); }}
阅读全文
0 0
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- 如何拷贝别人家的网站之webzip的使用方法
- dialog在非activity下显示解决方案
- CreateSqlQuery()/CreateQuery()相关方法列举
- 1.
- 深入理解JVM之一:Java内存区域
- POJ
- caffe的python接口使用方法示例
- web.xml 配置中classpath: 与classpath*:的区别
- java内部类
- 单人在线实践(jsp+java)
- 09:矩阵乘法
- 图像的阈值操作
- 安卓-拨打电话&基础整理
- nginx(location详细讲解)