147. Black-white king time limit per test: 0.25 sec.memory limit per test: 4096 KB input: standard inputoutput: standard output On the chessboard of size NxN leaves only three figures. They are black king, white king and black-white king. The black-w…

时间限制:0.25s 空间限制:4M 题意: 在一个N*N(N <= 106)的棋盘上,有三个棋子:黑王.白王.黑白王,它们的行走方式一致,每秒向8个方向中的任意一个行走一步. 现在黑王和白王想要相遇(即占据相邻的格子),而黑白王需要阻止它们相遇,即抓住其中一个王(走到其中一个王所在的格子), 黑王和白王行走时总是走最短路径,而黑白王走的路径无法被缩短(即能够走斜向的时候,不会走Z字形),由于黑白王是隐身的, 所以黑王和白王无法看见黑白王的走向,但是他们知道有它存在,当黑王和白王走到黑白王所在的…

题意: 有2*n-1个黑色和白色的珠子组成的环形项链,求至少需要多少颗黑色珠子才能使任意排列的项链中都存在两个黑珠间有n个珠子. (2*n-1<=2^31-1); Solution: 先分析n=5,n=7,n=9的情况. 当2*n-1=5,必须有两颗黑珠距离为1(较短的方向). 2*n-1=7,必须有两颗黑珠距离为2. 2*n-1=9,必须有两颗黑珠距离为3. 可以发现 对k=2*n-1,必须存在两颗黑珠的距离为l=(k/2-1) 假设问题的答案是ans, 我们先来求ans-1,即最多的不满足问…

http://codeforces.com/contest/1075/problem/A On a chessboard with a width of nn and a height of nn, rows are numbered from bottom to top from 11 to nn, columns are numbered from left to right from 11 to nn. Therefore, for each cell of the chessboard,…

题目如下: On an 8x8 chessboard, there can be multiple Black Queens and one White King. Given an array of integer coordinates queens that represents the positions of the Black Queens, and a pair of coordinates king that represent the position of the White…

作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 遍历 日期 题目地址:https://leetcode.com/problems/queens-that-can-attack-the-king/ 题目描述 On an 8x8 chessboard, there can be multiple Black Queens and one White King. Given an array of int…

今天遇到一个问题是往 SQL Server 中导入像m².m³这样的单位数据,可是在 SQL Server 中查看到的都是 m2.m3,于是在网上查了一下资料,顺便摘录下来供日后查阅. 一  Windows 系统下快速键入一些特殊字符 ALT+小键盘0153        ™ ALT+小键盘0169        © ALT+小键盘0174        ® ALT+小键盘0177        ± ALT+小键盘0178        ² ALT+小键盘0179        ³ ALT+小键…

A. Anton and Danik time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Anton likes to play chess, and so does his friend Danik. Once they have played n games in a row. For each game it's known…

前言 初入acm的新手,打算在cf混.这几天没有比赛,就做了个最新的Virtual participation.虽然说div2比较简单,但还是被虐得体无完肤...Orz.两个小时,共6道题.最后只AC了AB两道,花了20分钟,剩下的100分钟也不知道哪去了(逃 A.B两道水题没什么说的.那我们从C题开始吧 C. Anton and Making Potions 题意 制作n瓶药水,初始时每制作一瓶花费x秒,有两类法术,第一类(包含m个法术)使制作每瓶药的时间由x变为a[i] (a[i] < x)…

D. Anton and Chess 题目连接: http://codeforces.com/contest/734/problem/D Description Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to…