Educational Codeforces Round 23总结
来源:互联网 发布:工程管理曲线图 软件 编辑:程序博客网 时间:2024/06/07 05:34
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two values x and y written on it. These values define four moves which can be performed using the potion:
Map shows that the position of Captain Bill the Hummingbird is (x1, y1) and the position of the treasure is (x2, y2).
You task is to tell Captain Bill the Hummingbird whether he should accept this challenge or decline. If it is possible for Captain to reach the treasure using the potion then output "YES", otherwise "NO" (without quotes).
The potion can be used infinite amount of times.
The first line contains four integer numbers x1, y1, x2, y2 ( - 105 ≤ x1, y1, x2, y2 ≤ 105) — positions of Captain Bill the Hummingbird and treasure respectively.
The second line contains two integer numbers x, y (1 ≤ x, y ≤ 105) — values on the potion bottle.
Print "YES" if it is possible for Captain to reach the treasure using the potion, otherwise print "NO" (without quotes).
0 0 0 62 3
YES
1 1 3 61 5
NO
In the first example there exists such sequence of moves:
- — the first type of move
- — the third type of move
import java.util.Scanner;/** * * 作者:张宇翔 创建日期:2017年6月16日 上午9:00:48 描述:写字楼里写字间,写字间里程序员; 程序人员写程序,又拿程序换酒钱。 * 酒醒只在网上坐,酒醉还来网下眠; 酒醉酒醒日复日,网上网下年复年。 但愿老死电脑间,不愿鞠躬老板前; 奔驰宝马贵者趣,公交自行程序员。 * 别人笑我忒疯癫,我笑自己命太贱; 不见满街漂亮妹,哪个归得程序员? */public class Main {private static int x1,y1,x2,y2,x,y;public static void main(String[] args) {InitData();GetAns();}private static void InitData(){Scanner cin=new Scanner(System.in);x1=cin.nextInt();y1=cin.nextInt();x2=cin.nextInt();y2=cin.nextInt();x=cin.nextInt();y=cin.nextInt();};private static void GetAns(){int X=Math.abs(x1-x2);int Y=Math.abs(y1-y2);boolean ok=true;if(X%x!=0){ok=false;}if(Y%y!=0){ok=false;}if(!ok){System.out.println("NO");return;}else{int ans1=X/x;int ans2=Y/y;int ans=Math.abs(ans2-ans1);if(ans%2==0){System.out.println("YES");}else{System.out.println("NO");}}};}
import java.util.Arrays;import java.util.Scanner;/** * * 作者:张宇翔 创建日期:2017年6月16日 上午9:00:48 描述:写字楼里写字间,写字间里程序员; 程序人员写程序,又拿程序换酒钱。 * 酒醒只在网上坐,酒醉还来网下眠; 酒醉酒醒日复日,网上网下年复年。 但愿老死电脑间,不愿鞠躬老板前; 奔驰宝马贵者趣,公交自行程序员。 * 别人笑我忒疯癫,我笑自己命太贱; 不见满街漂亮妹,哪个归得程序员? */public class Main {private final static int Max = (int) (1e5 + 10);private static int n;private static int[] A;private static int ans1, ans2, ans3;private static int MIN1, MIN2, MIN3;public static void main(String[] args) {InitData();GetAns();}private static void InitData() {Scanner cin = new Scanner(System.in);n = cin.nextInt();A = new int[Max];ans1 = 0;ans2 = 0;ans3 = 0;MIN1 = -1;MIN2 = -1;MIN3 = -1;for (int i = 0; i < n; i++) {A[i] = cin.nextInt();}Arrays.sort(A, 0, n);};private static void GetAns() {MIN1 = A[0];ans1++;int i = 1;for (; i < n; i++) {if (A[i] == MIN1) {ans1++;} else {break;}}if (i < n) {MIN2 = A[i];i++;ans2++;for (; i < n; i++) {if (A[i] == MIN2) {ans2++;} else {break;}}if (i < n) {MIN3 = A[i];ans3++;i++;for (; i < n; i++) {if (A[i] == MIN3) {ans3++;} else {break;}}}}long sum=0;if(ans1>=3){ans1-=2;for(long j=1;j<=ans1;j++){sum+=((j*(j+1))/2);}}else{if(ans1==2){sum=ans2;}else{if(ans2==2){sum=1;}else{sum=ans3;}}}System.out.println(sum);};}
- Educational Codeforces Round 23总结
- Educational Codeforces Round 4 总结
- Educational Codeforces Round 5 总结
- Educational Codeforces Round 6 总结
- Educational Codeforces Round 7总结
- Educational Codeforces Round 8 总结
- Educational Codeforces Round 9 总结
- Educational Codeforces Round 20总结
- Educational Codeforces Round 21总结
- Educational Codeforces Round 25总结
- Educational Codeforces Round 26总结
- Codeforces Educational Round 27 总结
- Educational Codeforces Round 30 总结
- [CF] Educational Codeforces Round 23
- Educational Codeforces Round 23 A
- Educational Codeforces Round 23 B
- Educational Codeforces Round 23 题解
- Educational Codeforces Round 23 A. Treasure Hunt
- 常用运维开源工具
- 特征值和特征向量的实际意义
- python2和python3共存的方法
- 时间会停止吗?
- Android中线程池的使用分析
- Educational Codeforces Round 23总结
- IT行业十大热门职位
- 计算两个整数的百分比结果
- 关于localStorage和sessionStorage
- SpringMVC史上最全最强详细示例实战教程
- 数组字典排序
- spring+mybatis中文乱码编码问题
- 【转】Oracle Form 触发器执行顺序
- DataShow