Codeforces The New Year: Meeting Friends
来源:互联网 发布:爱淘宝 首页 红包 编辑:程序博客网 时间:2024/06/04 19:02
import java.util.Arrays;import java.util.Scanner;public class TheNewYearMeetingFriends {public static void main(String[] args) {Scanner scanner = new Scanner(System.in);int[] a = new int[3];while(scanner.hasNext()) {for(int i = 0; i < 3; i++) {a[i] = scanner.nextInt();}Arrays.sort(a);System.out.println(a[1] - a[0] + a[2] - a[1]);}}}
阅读全文
0 0
- Codeforces The New Year: Meeting Friends
- [codeforces]A. The New Year: Meeting Friends 水题
- Codeforces 723A The New Year: Meeting Friends
- 【69.77%】【codeforces 723A】The New Year: Meeting Friends
- Codeforces — 723A. The New Year: Meeting Friends
- The New Year: Meeting Friends Codeforces Round#375-A
- Codeforces 723A-The New Year: Meeting Friends
- CodeForces 723A-The New Year: Meeting Friends(很水)
- A. The New Year: Meeting Friends
- Codeforces 723A The New Year: Meeting Friends(题意有偏差的水题)
- 【Codeforces Round 375 (Div 2) A】【水题】The New Year Meeting Friends
- Codeforces Round #375 (Div. 2)A. The New Year: Meeting Friends(水题)
- Codeforces Round #375 (Div. 2) A-The New Year: Meeting Friends
- codeforces——723A—— The New Year: Meeting Friends
- CodeForces 723A he New Year: Meeting Friends
- Codeforces723 A. The New Year: Meeting Friends (水题)
- Codeforce 723A - The New Year: Meeting Friends
- codeforces723AThe New Year: Meeting Friends+水题
- 斯坦福机器学习课程目录
- ubuntu 安装opencv3
- ubuntu下面安装Pycharm
- shellscript之简单的if语句
- 剑指offer-连续子数组的最大值
- Codeforces The New Year: Meeting Friends
- Graph(2)--图的实现(邻接矩阵&邻接表 )
- 【Android框架】volley源码分析
- 07-rabbitmq-消息路由
- Keepalived主主虚拟路由器与虚拟服务器
- 仿QQ列表展开、收缩(1)
- JLink_V8克隆版解决方法,亲测实用的教程!!!
- 关于== 与 equals
- struts2文件上传