codeforces 141 B. Hopscotch (规律)
来源:互联网 发布:无人机手机遥控软件 编辑:程序博客网 时间:2024/06/15 01:42
So nearly half of the winter is over and Maria is dreaming about summer. She's fed up with skates and sleds, she was dreaming about Hopscotch all night long. It's a very popular children's game. The game field, the court, looks as is shown in the figure (all blocks are square and are numbered from bottom to top, blocks in the same row are numbered from left to right). Let us describe the hopscotch with numbers that denote the number of squares in the row, staring from the lowest one: 1-1-2-1-2-1-2-(1-2)..., where then the period is repeated (1-2).
The coordinate system is defined as shown in the figure. Side of all the squares are equal and have length a.
Maria is a very smart and clever girl, and she is concerned with quite serious issues: if she throws a stone into a point with coordinates(x, y), then will she hit some square? If the answer is positive, you are also required to determine the number of the square.
It is believed that the stone has fallen into the square if it is located strictly inside it. In other words a stone that has fallen on the square border is not considered a to hit a square.
The only input line contains three integers: a, x, y, where a (1 ≤ a ≤ 100) is the side of the square, x and y( - 106 ≤ x ≤ 106, 0 ≤ y ≤ 106) are coordinates of the stone.
Print the number of the square, inside which the stone fell. If the stone is on a border of some stone or outside the court, print "-1" without the quotes.
1 0 0
-1
3 1 1
1
3 0 10
5
3 0 7
-1
3 4 0
-1
题意:像小时候玩的跳格子,在一个直角坐标上,这里会有很多层,每层1 1 2 1 2 (重复1 2),给一个点,点在方格内且不压线,输出放个的序号
否则输出-1;
code:
#include <iostream>#include<cstdio>using namespace std;int main(){ int a,x,y; scanf("%d%d%d",&a,&x,&y); int b=y/a;//落在哪一行 b+=1; if(y%a==0) printf("-1\n"); else//行数奇偶分析,在分析x坐标 { if(b==1) { if(2*x<a&&2*x>(-a)) printf("1\n"); else printf("-1\n"); } else if(b%2==0) { if(2*x<a&&2*x>(-a)) printf("%d\n",(b-2)/2*3+2); else printf("-1\n"); } else if(b%2) { if(x<0&&x>(-a)) printf("%d\n",(b-1)/2*3); else if(x>0&&x<a) printf("%d\n",(b-1)/2*3+1); else printf("-1\n"); } } return 0;}
- codeforces 141 B. Hopscotch (规律)
- CodeForces 141B - Hopscotch
- CodeForces 141B Hopscotch
- 【Codeforces 141 B Hopscotch 】+ 构造
- CodeForces - 141B Hopscotch (模拟)水
- codeforces 141-B. Hopscotch(数学)
- CodeForces 141B Hopscotch(分类讨论)
- codeforces-141【B找规律】【C思维】
- Codeforces Round #101 (Div. 2) B. Hopscotch
- Codeforces 608B 找规律
- Codeforces 626B Cards(规律)
- CodeForces 618B (找规律)
- CodeForces 248B - Chilly Willy - 找规律
- Codeforces 480B Long Jumps 规律题
- codeforces 2184 B. Chilly Willy(规律)
- CodeForces 248B - Chilly Willy - 找规律
- CodeForces - 617B Chocolate (规律)
- Codeforces--617B--Chocolate(规律)
- CentOS 7.0系统安装配置步骤详解
- 隐变量模型(latent variable model)
- BZOJ 2434 [Noi2011]阿狸的打字机
- GOF设计模式之ITERATOR(迭代器)
- Django尝试-day 1
- codeforces 141 B. Hopscotch (规律)
- 模拟电子技术基础概念
- PAT--1120. Friend Numbers (20)
- redis单机搭建
- Dlib与Opencv的图像转换
- Flash相关理论知识:SLC与MLC、NOR与NAND FLASH、闪存卡
- sdut oj3-4 计算长方形的周长和面积
- oracle中游标详细用法
- IDEA配置tomcat7