挑战一下传说中的HDU100题
2000:
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
string s;
while(cin >> s)
{
sort(s.begin(), s.end());
cout << s[0] << " " << s[1] << " " << s[2] << endl;
}
return 0;
}
2001:
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
double x1, y1, x2, y2;
while(scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2) != EOF)
{
double dis = sqrt(pow(x1-x2, 2) + pow(y1-y2, 2));
printf("%.2lf\n", dis);
}
return 0;
}
2002:
#include <iostream>
#include <cstdio>
#define PI 3.1415927
using namespace std;
int main()
{
double r;
while(~scanf("%lf", &r))
{
printf("%.3lf\n", 4.0 / 3 * PI * r * r * r);
}
return 0;
}
2003:
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
double num;
while(scanf("%lf", &num) != EOF)
{
if(num < 0)
printf("%.2lf\n", -num);
else
printf("%.2lf\n", num);
}
return 0;
}
2004:
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int score;
while(scanf("%d", &score) != EOF)
{
if(score < 0 || score > 100)
printf("Score is error!\n");
else if(score < 60)
printf("E\n");
else if(score < 70)
printf("D\n");
else if(score < 80)
printf("C\n");
else if(score < 90)
printf("B\n");
else
printf("A\n");
}
return 0;
}
2005:
#include <cstdio>
using namespace std;
int a[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main()
{
int y, m, d;
while(scanf("%d/%d/%d", &y, &m, &d) != EOF)
{
int ans = 0;
for(int i=0; i<m; i++)
ans += a[i];
ans += d;
if( ((y%4==0 && y%100 != 0) || y%400==0) && m >= 3)
printf("%d\n", ans+1);
else
printf("%d\n", ans);
}
return 0;
}
2006:
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
int num;
long long mul = 1;
for(int i=0; i<n; i++)
{
scanf("%d", &num);
if(num%2 == 1)
mul *= num;
}
printf("%lld\n", mul);
}
return 0;
}
2007:
// 此题有坑,默认输入的两个数并不一定是小的在前大的在后
// 忘记删除测试行导致错了好几发
#include <cstdio>
using namespace std;
int main()
{
int n, m;
while(scanf("%d %d", &n, &m) != EOF)
{
if(n > m)
n^=m^=n^=m;
long long mul2 = 0;
long long mul3 = 0;
for(int i=n; i<=m; i++)
{
if(i%2 == 1)
mul3 += 1ll * i*i*i;
else
{
mul2 += 1ll*i*i;
}
}
printf("%lld %lld\n", mul2, mul3);
}
return 0;
}
2008:
#include <cstdio>
using namespace std;
int main()
{
int n;
while(scanf("%d", &n), n)
{
double num;
int sum0, sum1, sum2;
sum0 = sum1 = sum2 = 0;
for(int i=0; i<n; i++)
{
scanf("%lf", &num);
if(num < 0)
sum0 ++;
else if(num == 0)
sum1 ++;
else
sum2 ++;
}
printf("%d %d %d\n", sum0, sum1, sum2);
}
return 0;
}
2009:
#include <cstdio>
#include <cmath>
using namespace std;
// int a[10000+7];
int main()
{
double n;
int m;
while(scanf("%lf %d", &n, &m) != EOF)
{
double sum = 0;
sum += n;
for(int i=1; i<m; i++)
{
n = sqrt(n);
sum += n;
}
printf("%.2lf\n", sum);
}
return 0;
}