CF 开车找房子

2023-12-13 20:32
文章标签 cf 开车 房子

本文主要是介绍CF 开车找房子,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

暑期练习题


Themain street of Berland is a straight line with n housesbuilt along it (n is an evennumber). The houses are located at both sides of the street. The houses withodd numbers are at one side of the street and are numbered from 1 to n - 1 inthe order from the beginning of the street to the end (in the picture: fromleft to right). The houses with even numbers are at the other side of thestreet and are numbered from 2 ton inthe order from the end of the street to its beginning (in the picture: fromright to left). The corresponding houses with even and odd numbers are strictlyopposite each other, that is, house 1 isopposite house n, house 3 isopposite house n - 2,house 5 is opposite house n - 4andso on.


Vasyaneeds to get to house number a asquickly as possible. He starts driving from the beginning of the street anddrives his car to house a.To get from the beginning of the street to houses number 1 and n,he spends exactly 1 second. He alsospends exactly one second to drive the distance between two neighbouringhouses. Vasya can park at any side of the road, so the distance between thebeginning of the street at the houses that stand opposite one another should beconsidered the same.

Yourtask is: find the minimum time Vasya needs to reach house a.

Input

Thefirst line of the input contains two integers, n and a (1 ≤ a ≤ n ≤ 100 000) —the number of houses on the street and the number of the house that Vasya needsto reach, correspondingly. It is guaranteed that number n iseven.

Output

Printa single integer — the minimum time Vasya needs to get from the beginning ofthe street to house a.

Sample Input

Input

42

Output

2

Input

85

Output

3

 

 

题意:就是给你一排数字,上排为奇数从左往右增大,下排为偶数,从左往右减小。问题就是你开个小车找到指定的数字需要经过多少房子。

 

思路:分奇偶性讨论。

 

代码:

 

/*=============================AC情况===============================*/
/*题目网址:   */
/*时间: */
/*心得:  */#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define G 100int main() {int n,a,ans;while(scanf("%d%d",&n,&a)!=EOF) {if(a%2==0)ans=(n-a)/2+1;elseans=(a+1)/2;printf("%d\n",ans);}return 0;
}/*********************************测试数据***********************************************************************************************************/

 

这篇关于CF 开车找房子的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/489871

相关文章

cf 164 C 费用流

给你n个任务,k个机器,n个任务的起始时间,持续时间,完成任务的获利 每个机器可以完成任何一项任务,但是同一时刻只能完成一项任务,一旦某台机器在完成某项任务时,直到任务结束,这台机器都不能去做其他任务 最后问你当获利最大时,应该安排那些机器工作,即输出方案 具体建图方法: 新建源汇S T‘ 对任务按照起始时间s按升序排序 拆点: u 向 u'连一条边 容量为 1 费用为 -c,

CF 508C

点击打开链接 import java.util.Arrays;import java.util.Scanner;public class Main {public static void main(String [] args){new Solve().run() ;} }class Solve{int bit[] = new int[608] ;int l

【CF】C. Glass Carving(二分 + 树状数组 + 优先队列 + 数组计数)

这题简直蛋疼死。。。。。 A了一下午 #include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;typedef long long LL;const int maxn = 200005;int h,w,n;int C1[maxn],C2[maxn];int

【CF】E. Anya and Cubes(双向DFS)

根据题意的话每次递归分3种情况 一共最多25个数,时间复杂度为3^25,太大了 我们可以分2次求解第一次求一半的结果,也就是25/2 = 12,记录结果 之后利用剩余的一半求结果 s-结果 = 之前记录过的结果 就可以 时间复杂度降低为 3 ^ (n/2+1) 题目链接:http://codeforces.com/contest/525/problem/E #include<set

【CF】D. Arthur and Walls(BFS + 贪心)

D题 解题思路就是每次检查2X2的方格里是否只有一个‘*’,如果有的话这个*就需要变成‘.’,利用BFS进行遍历,入队的要求是这个点为. 一开始将所有的'.'全部加入队列,如果碰到一个'*'变成'.'就入队,判断的时候从4个方向就行判断 题目链接:http://codeforces.com/contest/525/problem/D #include<cstdio>#include<

CF#271 (Div. 2) D.(dp)

D. Flowers time limit per test 1.5 seconds memory limit per test 256 megabytes input standard input output standard output 题目链接: http://codeforces.com/contest/474/problem/D We s

CF Bayan 2015 Contest Warm Up B.(dfs+暴力)

B. Strongly Connected City time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output 题目链接: http://codeforces.com/contest/475/probl

CF Bayan 2015 Contest Warm Up A.(模拟+预处理)

A. Bayan Bus time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output 题目链接: http://codeforces.com/contest/475/problem/A The fi

CF #278 (Div. 2) B.(暴力枚举+推导公式+数学构造)

B. Candy Boxes time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output 题目链接: http://codeforces.com/contest/488/problem/B There

CF#278 (Div. 2) A.(暴力枚举)

A. Giga Tower time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output 题目链接: http://codeforces.com/contest/488/problem/A Giga To