Welcome to Yumao′s Blog.
ZOJ Problem Set – 2970 Faster, Higher, Stronger
, 2010年04月13日 , C Language , 评论 在〈ZOJ Problem Set – 2970 Faster, Higher, Stronger〉中留言功能已關閉 ,
Faster, Higher, Stronger
Time Limit: 1 Second      Memory Limit: 32768 KB

In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Beijing Olympics is to be a festival for people all over the world as well.

The motto of Olympic Games is “Citius, Altius, Fortius”, which means “Faster, Higher, Stronger”.

In this problem, there are some records in the Olympic Games. Your task is to find out which one is faster, which one is higher and which one is stronger.

Input

Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <= 50) which is the number of test cases. And it will be followed by T consecutive test cases. Each test case has 3 lines. The first line is the type of the records, which can only be “Faster” “Higher” or “Stronger”. The second line is a positive integer N meaning the number of the records in this test case. The third line has N positive integers, i.e. the records data. All the integers in this problem are smaller than 2008. Output Results should be directed to standard output. The output of each test case should be a single integer in one line. If the type is “Faster”, the records are time records and you should output the fastest one. If the type is “Higher”, the records are length records. You should output the highest one. And if the type is “Stronger”, the records are weight records. You should output the strongest one. Sample Input 3
Faster
3
10 11 12
Higher
4
3 5 4 2
Stronger
2
200 200

Sample Output

10
5
200

#include
#include

int max(int shu[],int n)
{
int m,i;
m=shu[0];
for (i=0;i if (m return m;
}
int min(int shu[],int n)
{
int m,i;
m=shu[0];
for (i=0;i if (m>shu[i]) m=shu[i];
return m;
}

int main(int argc, char *argv[])
{
char s[][10]={“Faster”,”Higher”,”Stronger”};
char ch[10];
int i,shu[3000]={0},n,j,k,temp,t,T;

scanf (“%d”,&T);
for (t=0;t {

scanf (“%s”,ch);
scanf (“%d”,&n);
for (j=0;j {
scanf (“%d”,&shu[j]);
}
for (i=0;i<3;i++)
{
if (!strcmp(ch,s[i])) break;
}
if (i==0)
{
printf (“%d\n”,min(shu,n));
}
else
{
printf (“%d\n”,max(shu,n));
}
}
}

关键字:, , , , , , , ,

评论已关闭