problem 1058
2007-11-12 12:32
169 查看
小学生题,读题比做题还花时间的说。。。
#include<stdio.h>
float ratio[5][5];
void solve(int n)
{
int i,c[15];
float res;
c[0] = c[n + 1] = 0;
for(i = 1; i <= n; i++)
{
scanf("%d",&c[i]);
c[i]--;
}
scanf("%f",&res);
for(i = 1; i < n + 2; i++)
{
res = res * ratio[c[i - 1]][c[i]];
res = res * 100;
res = (int)(res + 0.5);
res = res / 100.0;
}
printf("%.2f/n",res);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("1058.txt","r",stdin);
#endif
int t,n;
while(scanf("%d",&t) != EOF)
while(t--)
{
for(int i = 0; i < 5; i++)
for(int j = 0; j < 5; j++)
scanf("%f",&ratio[i][j]);
while(scanf("%d",&n) != EOF && n != 0)
solve(n);
if(t > 0) printf("/n");
}
#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0;
}
Accepted | 1058 | C++ | 00:00.01 | 392K |
float ratio[5][5];
void solve(int n)
{
int i,c[15];
float res;
c[0] = c[n + 1] = 0;
for(i = 1; i <= n; i++)
{
scanf("%d",&c[i]);
c[i]--;
}
scanf("%f",&res);
for(i = 1; i < n + 2; i++)
{
res = res * ratio[c[i - 1]][c[i]];
res = res * 100;
res = (int)(res + 0.5);
res = res / 100.0;
}
printf("%.2f/n",res);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("1058.txt","r",stdin);
#endif
int t,n;
while(scanf("%d",&t) != EOF)
while(t--)
{
for(int i = 0; i < 5; i++)
for(int j = 0; j < 5; j++)
scanf("%f",&ratio[i][j]);
while(scanf("%d",&n) != EOF && n != 0)
solve(n);
if(t > 0) printf("/n");
}
#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0;
}
相关文章推荐
- hdu 1058 The sum problem
- hdu 1058 The sum problem
- ZOJ Problem Set - 1058 Currency exchange
- ZOJ Problem Set - 1058 Currency exchange
- Problem D:Humble Numbers(HDU 1058)
- Problem 1058 粗心的物理学家
- DP Problem D:Humble Numbers(HDU 1058)
- Problem and Solution : Unable to resolve target 'android-9'
- a的n次幂 —— POJ 3100 Root of the Problem
- 【Algorithms】NP-complrte problem(exercises-8.14)
- POJ 3487 The Stable Marriage Problem(Gale-Shapley算法求稳定婚姻)
- Project Euler:Problem 28 Number spiral diagonals
- 1360 Problem A 最大公约与最小公倍最大公约与最小公倍
- The Hardest Problem Ever(字符串处理,易)
- hdu4430 Yukari's Birthday 2012 ACM_ICPC Asia ChangChun Regional Contest problem K
- XJOI-A+B Problem
- POJ 3468 A Simple Problem with Integers 线段树
- [sicily]1157. The hardest problem
- 【嵙大OJ】 <未完成>Problem 1029: 1!+2!+…+k!=?
- uva 387 - A Puzzling Problem