Codeforces Round #375 (Div. 2)A. The New Year: Meeting Friends(水题)
2016-10-05 20:33
453 查看
题目链接:
http://codeforces.com/contest/723/problem/A
【分析】求走的最短的路,即三个数中的最大值减去最小值。
下面是AC代码:
http://codeforces.com/contest/723/problem/A
【分析】求走的最短的路,即三个数中的最大值减去最小值。
下面是AC代码:
#include<cstdio> #include<algorithm> using namespace std; int a[105]; int main() { while(~scanf("%d%d%d",&a[0],&a[1],&a[2])) { sort(a,a+3); printf("%d\n",a[2]-a[0]); } return 0; }
相关文章推荐
- Codeforces Round #375 (Div. 2) A. The New Year: Meeting Friends 水题
- 【Codeforces Round 375 (Div 2) A】【水题】The New Year Meeting Friends
- [codeforces]A. The New Year: Meeting Friends 水题
- Codeforces Round #375 (Div. 2) A-The New Year: Meeting Friends
- Codeforces723 A. The New Year: Meeting Friends (水题)
- A. The New Year: Meeting Friends
- Codeforce 723A - The New Year: Meeting Friends
- CodeForces - 723A A. The New Year: Meeting Friends
- CodeForces 723A-The New Year: Meeting Friends(很水)
- CodeForces - 723A - A. The New Year: Meeting Friends
- 【69.77%】【codeforces 723A】The New Year: Meeting Friends
- codeforces 723A : The New Year: Meeting Friends
- codeforces——723A—— The New Year: Meeting Friends
- G - New Year and Days 【水题】
- Codeforces 723A-The New Year: Meeting Friends
- How to Keep Your Skills Up-to-Date in the New Year(如何提升测试技能)
- Codeforces Round #325 (Div. 2) C. Gennady the Dentist(水题)
- Codeforces Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) A. Checking the Calendar(水题)
- Codeforces Good Bye 2015 A. New Year and Days 水题
- Codeforces Round #166 (Div. 2) A. Beautiful Year(水题)