A - 求奇数的乘积 HDU - 2006
求奇数的乘积
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 95378 Accepted Submission(s): 58519
3 1 2 3
4 2 3 4 5
3
15
[分析]
水。
[代码]
#include<cstdio>
int main()
{
int n;
while (scanf("%d", &n) != EOF)
{
int x, ans = 1;
for (int i = 0; i < n; i++)
{
scanf("%d", &x);
if(x&1)ans = ans*x;
}
printf("%d\n", ans);
}
}
B - 平方和与立方和 HDU - 2007
平方和与立方和
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 172307 Accepted Submission(s): 54773
你可以认为32位整数足以保存结果。
1 3
2 5
4 28
20 152
[分析]
注意m>n时交换。
[代码]
#include<cstdio>
int main()
{
long long n, m;
while (scanf("%lld%lld", &m, &n) != EOF)
{
long long ans1 = 0;
long long ans2 = 0;
if (m>n)
{
m = m + n;
n = m - n;
m = m - n;
}
for (long long i = m; i <= n; i++)
{
if (i % 2)ans1 = ans1 + i*i*i;
else ans2 = ans2 + i*i;
}
printf("%lld %lld\n", ans2, ans1);
}
}
C - 数值统计 HDU - 2008
数值统计
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 107497 Accepted Submission(s): 52138
6 0 1 2 3 -1 0
5 1 2 3 4 0.5
0
1 2 3
0 0 5
[分析]
水。
[代码]
#include<cstdio>
int main()
{
int n; double x;
int a[3];
while (scanf("%d", &n) != EOF)
{
if (!n)break;
a[0] = 0; a[1] = 0; a[2] = 0;
for (int i = 0; i < n; i++)
{
scanf("%lf", &x);
if (x < 0)a[0]++;
else if (x == 0)a[1]++;
else a[2]++;
}
printf("%d %d %d\n", a[0], a[1], a[2]);
}
}
D - 求数列的和 HDU - 2009
求数列的和
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 83772 Accepted Submission(s): 50920
数列的第一项为n,以后各项为前一项的平方根,求数列的前m项的和。
81 4
2 2
94.73
3.41
[分析]
水。
[代码]
#include<cstdio>
#include<cmath>
int main()
{
double n, m;
while (scanf("%lf%lf", &n, &m) != EOF)
{
double ans = n;
for (int i = 1; i < m; i++)
{
ans = ans + sqrt(n);
n = sqrt(n);
}
printf("%.2lf\n", ans);
}
}
//81 9 3 /3
E - 水仙花数 HDU - 2010
水仙花数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 194065 Accepted Submission(s): 55521
“水仙花数”是指一个三位数,它的各位数字的立方和等于其本身,比如:153=1^3+5^3+3^3。
现在要求输出所有在m和n范围内的水仙花数。
如果给定的范围内不存在水仙花数,则输出no;
每个测试实例的输出占一行。
100 120
300 380
no
370 371
[分析]
水。
[代码]
#include<cstdio>
#include<cmath>
int is_shuixian(int a)
{
int p=a;
int ans = 0;
while (p > 0)
{
ans = ans + pow((p % 10),3);
p = p / 10;
}
if (ans == a)return 1;
else return 0;
}
int main()
{
int n, m;
while (scanf("%d%d", &m, &n) != EOF)
{
int i; int flag = 1;
for (i = m; i <= n; i++)
{
if (is_shuixian(i))
{
printf("%d", i);
flag = 0;
break;
}
}
i++;
for (; i <= n; i++)
{
if (is_shuixian(i))printf(" %d", i);
}
if (flag)printf("no\n");
else printf("\n");
}
}
F - 多项式求和 HDU - 2011
多项式求和
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 79605 Accepted Submission(s): 45572
1 - 1/2 + 1/3 - 1/4 + 1/5 - 1/6 + …
现在请你求出该多项式的前n项的和。
2
1 2
1.00
0.50
[分析]
水。
[代码]
#include<cstdio>
#include<cmath>
int main()
{
int m,x;
double a[1005];
a[0] = 0;
for (int ii = 1; ii < 1005; ii++)
{
double i = ii;
a[ii] = a[ii-1] + pow((-1), i + 1) / i;
}
scanf("%d", &m);
while (m--)
{
scanf("%d", &x);
printf("%.2lf\n", a[x]);
}
}
G - 素数判定 HDU - 2012
素数判定
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 139652 Accepted Submission(s): 49340
0 1
0 0
OK
[分析]
基本功。
[代码]
#include<cstdio>
#include<cmath>
int P(int p)
{
if (p == 1)return 0;
if (p == 2)return 1;
for (int i = 2; i <= sqrt(p); i++)
{
if (p%i == 0)return 0;
}
return 1;
}
int xunhuan(int x, int y)
{
for (int i = 0; i <= y; i++)
{
if (!P(i*i + i + 41))return 0;
}
return 1;
}
int main()
{
int x, y;
while (scanf("%d%d", &x, &y) != EOF)
{
if (!x && !y)break;
if (xunhuan(x, y))printf("OK\n");
else printf("Sorry\n");
}
}
H - 蟠桃记 HDU - 2013
蟠桃记
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 65015 Accepted Submission(s): 48391
什么问题?他研究的问题是蟠桃一共有多少个!
不过,到最后,他还是没能解决这个难题,呵呵^-^
当时的情况是这样的:
第一天悟空吃掉桃子总数一半多一个,第二天又将剩下的桃子吃掉一半多一个,以后每天吃掉前一天剩下的一半多一个,到第n天准备吃的时候只剩下一个桃子。聪明的你,请帮悟空算一下,他第一天开始吃的时候桃子一共有多少个呢?
2
4
4
22
[分析]
水,就是循环。
[代码]
#include<cstdio>
#include<cmath>
int main()
{
int n;
int a[35];
a[1] = 1;
for (int i = 2; i < 33; i++)
{
a[i] = (a[i - 1] + 1) * 2;
}
while (scanf("%d", &n) != EOF)
{
printf("%d\n", a[n]);
}
}
I - 青年歌手大奖赛_评委会打分 HDU - 2014
青年歌手大奖赛_评委会打分
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 88292 Accepted Submission(s): 43948
3 99 98 97
4 100 99 98 97
98.00
98.50
[分析]
水。
[代码]
#include<stdio.h>
int main()
{
int n,n1;//n为评委人数
double s,a,max,min;//s为分数
while(scanf("%d",&n)!=EOF)
{
n1=n-1;
scanf("%lf",&s);
max=s;min=s;
while(n1--)
{
scanf("%lf",&a);
s=s+a;
if(a>max)max=a;
if(a<min)min=a;
}
s=s-max-min;
printf("%.2f\n",s/(n-2));
}
return 0;
}
J - 超大型LED显示屏 CSU - 1507
Input
输入包含不超过100组数据。每组数据第一行为”START hh:mm:ss”,表示比赛开始时刻为hh:mm:ss。最后一行为”END hh:mm:ss”,即比赛结束时刻。二者之间至少会有一个SCORE信息,格式为”SCORE hh:mm:ss team score”,其中team要么是”home”(主场)要么是”guest”(客场), score表示得分,为1,2或者3。这些信息保证按照时间从早到晚的顺序排列,且任意两条SCORE信息的时刻均不相同。比赛开始时间不会早于9:00,结束时间不会晚于同一天的21:00。注意,如果比赛开始时间为09:00:00,结束时间为09:00:01,比赛长度为1秒钟,而不是2秒钟。
Output
对于每组数据,输出测试点编号和总耗电量。
Sample Input
START 09:00:00
SCORE 09:01:05 home 2
SCORE 09:10:07 guest 3
END 09:15:00
START 09:00:00
SCORE 10:00:00 home 1
SCORE 11:00:00 home 1
SCORE 12:00:00 home 1
SCORE 13:00:00 home 1
SCORE 14:00:00 home 1
SCORE 15:00:00 home 1
SCORE 16:00:00 home 1
SCORE 17:00:00 home 1
SCORE 18:00:00 home 1
SCORE 19:00:00 home 1
SCORE 20:00:00 home 1
END 21:00:00
Sample Output
Case 1: 9672
Case 2: 478800
[分析]
女朋友刚好问过类似的题目,所有个人赛的时候Ac的比较快,主要就是先用数组存下每个数字需要的段数。如何模拟,数字乘存在时间。取和。
[代码]
#include<cstdio>
#include<cstring>
int pow[10] = { 6,2,5,5,4,5,6,3,7,6 };
int time(int hour1, int min1, int second1, int hour2, int min2, int second2)
{
int time1 = hour1 * 3600 + min1 * 60 + second1;
int time2 = hour2 * 3600 + min2 * 60 + second2;
return time2 - time1;
}//算出时间差
int powuse(int a)//计算当前分数的用电量
{
if (!a)return 6;
int ans = 0;
while (a > 0)
{
ans = ans + pow[a % 10];
a = a / 10;
}
return ans;
}
int main()
{
char a[10], b[10];
int hour1, min1, second1;
int hour2, min2, second2;
int kase = 0;
while (scanf("%s %d:%d:%d", a, &hour1, &min1, &second1) != EOF)
{
int score1 = 0;
int score2 = 0;
int ans = 0;
while (scanf("%s", a) && a[0] != 'E')
{
scanf("%d:%d:%d", &hour2, &min2, &second2);
int Time = time(hour1, min1, second1, hour2, min2, second2);
ans = ans + Time*(powuse(score1) + powuse(score2));
hour1 = hour2; min1 = min2; second1 = second2;//数据更新
int x;
scanf("%s %d", b, &x);
if (b[0] == 'h')score1 += x;//主场
else score2 += x;//客场
}
scanf("%d:%d:%d", &hour2, &min2, &second2);
int Time = time(hour1, min1, second1, hour2, min2, second2);
ans = ans + Time*(powuse(score1) + powuse(score2));
printf("Case %d: %d\n", ++kase, ans);
}
}