绝尘

Instantaneous Transference Time Limit: 5000MS Memory Limit: 65536KDescriptionIt was long ago when we played the game Red Alert. There is a magic function for the game objects which is called instan

Codeforces 359 Div2A. Free Ice Cream time limit per test2 seconds memory limit per test256 megabytesAfter their adventure with the magic mirror Kay and Gerda have returned home and sometimes give f

A. Opponents time limit per test 1 second memory limit per test 256 megabytesArya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents ha

Painting A Board Time Limit: 1000MS Memory Limit: 10000KDescriptionThe CE digital company has built an Automatic Painting Machine (APM) to paint a flat board fully covered by adjacent non-overlappi

Time Limit: 1000MS Memory Limit: 65536KDescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to descri

A. Nicholas and Permutation time limit per test:1 second memory limit per test:256 megabytesNicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a per

BZOJ【2038】—— [2009国家集训队]小Z的袜子(hose)Codeforces 86D. Powerful arrayBzoj【 3289】—— Mato的文件管理HDU【5381】——The sum of gcdBzoj【4540】—— [Hnoi2016]序列Codeforces 617E. XOR and Favorite NumberBzoj【1086】—— [SCOI2005]王室联

Codeforces Round #375 (Div. 2)A. The New Year: Meeting FriendsB. Text Document AnalysisC. Polycarp at the RadioD. Lakes in Berland

Time Limit: 60 Sec Memory Limit: 256 MBDescriptionA 国共有 n 座城市，这些城市由 n-1 条道路相连，使得任意两座城市可以互达，且路径唯一。每座城市都有一个 幸运数字，以纪念碑的形式矗立在这座城市的正中心，作为城市的象征。一些旅行者希望游览 A 国。旅行者计划 乘飞机降落在 x 号城市，沿着 x 号城市到 y 号城市之间那条唯一的路径游览，

Time Limit: 2000MS Memory limit: 65536K题目描述 Ok, now I will introduce this game to you… Isaac is trapped in a maze which has many common rooms…Like this…There are 9 common rooms on the map. And t

Time Limit: 2000MS Memory limit: 131072K题目描述Fibonacci numbers are well-known as follow: Now given an integer N, please find out whether N can be represented as the sum of several Fibonacci numbers i

Knights of the Round TableDescriptionBeing a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things

Bag Problem Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/131072 K (Java/Others) Total Submission(s): 1449 Accepted Submission(s): 405Problem Description 0/1 bag problem should s

time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputAfter observing the results of Spy Syndrome, Yash realised the errors of his w

题意：定义一种数叫做”sortedness”,对于数组中下标i<j的数，其中a[i]<a[j]的对数数组中下标i<j的数，其中a[i]<a[j]的对数，给你一个长度为数组，数组中的数的大小为0∼n0\sim n，数组中0表示对应得位置没有数，求在在没有数的地方将缺失的数填上使得数组的sortedness 的大小等于给定的sortedness的方案数。同时保证在一个数组中0的个数不会超过5个。思路：由

题意：给你一个矩阵，每一个小格子中有一个字母，相邻的相同字母的为一个区域，相邻是指一个格子的八个方向。每一次都可以将一个区域涂成红色，问最少涂多少个格子使得从上到下没有路径，即涂上颜色的格子不能走，是不是使得不存在一条路径连接第一行和最后一行的需要涂的最少的格子的数量。思路：刚看到这道题的时候一脸懵逼，后来看到其他人的博客，才发现自己好弱。首先我们将不同的区域找出来，那么相邻的区域之间可以相互的连接

题意：给你一个2*n的矩阵，每个小格子是’.’或者’#’,’.’表示是白的格子，’#’表示黑色格子，问最多可以将白的格子涂黑是的还存在一条从左到右只有白色的格子组成的路径（可以上下移动）。思路：共有两个起点，从每一个起点开始，BFS到第n列的最少经过白色格子的数量。表明这条路径是不可以涂的，那么将其他的白色的格子的数量就是答案。#include <bits/stdc++.h>using namesp

Time Limit: 1000MS Memory Limit: 10000KDescriptionThe twenty-first century is a biology-technology developing century. One of the most attractive and challenging tasks is on the gene project, espec

Time Limit: 1000MS Memory Limit: 65536KDescriptionA network of m roads connects N cities (numbered from 1 to N). There may be more than one road connecting one city with another. Some of the roads

HackerrankHourRank17