inv0ker的博客

题目链接：https://codeforces.com/contest/31/problem/D#include <iostream>#include <cstdio>#include <cstdlib>#include <cctype>#include <cmath>#include <climits>#include <cstring>#include <vector>#include &l

题目链接：https://codeforces.com/contest/29/problem/D#include <iostream>#include <cstdio>#include <cstdlib>#include <cctype>#include <cmath>#include <climits>#include <cstring>#include <vector>#include &l

题目链接：https://codeforces.com/contest/29/problem/C#include <iostream>#include <cstdio>#include <cstdlib>#include <cctype>#include <cmath>#include <climits>#include <cstring>#include <vector>#include &l

题目链接：https://codeforces.com/contest/27/problem/E约数和定理+爆搜#include <iostream>#include <algorithm>using namespace std;typedef __int128 ll;static const int primes[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};static const ll INFL=100000000

题目链接：https://codeforces.com/contest/22/problem/E#include <iostream>#include <vector>#include <cstring>using namespace std;static const int MAXN=1e5+10;int son[MAXN],d[MAXN];int vis[MAXN];int n;vector<int> h,t;int dfs(int x

题目链接：https://codeforces.com/contest/19/problem/E#include <iostream>#include <cstring>using namespace std;static const int MAXN=1e4+10;static const int MAXM=2e4+10;struct Edge{ int u,v; bool trEdge; int odd,even;}edge[MAXN];i

题目链接：https://codeforces.com/contest/11/problem/C来自洛谷题解的做法，先找第一类正方形，再找第二类正方形，dfs找联通块并全部清除，判断1的数量是否构成之前找到的任意一种正方形。#include <iostream>#include <cstring>using namespace std;static const int MAXN=250+10;static const int dx[]={-1,-1,-1,0,0,1,1,

【题目描述】The twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built are A(adenine), C(cytosine), G(guanine), an...

【题目描述】一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。【输入】前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出.【输出】输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每行首先输出...

【题目描述】This is a very popular game for children. In this game, there’s a cube, which consists of 3 * 3 * 3 small cubes. We can unwrap the cube, it will become like this:w w ww w ww w wr r r g g g ...

【题目描述】Last night,little erriyue had a horrible nightmare.He dreamed that he and his girl friend were trapped in a big maze separately.More terribly,there are two ghosts in the maze.They will kill the...

【题目描述】Let’s play a card game called Gap.You have 28 cards labeled with two-digit numbers.The first digit (from 1 to 4) represents the suit of the card,and the second digit (from 1 to 7) represents t...

【题目描述】可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主被关在一个两层的迷宫里，迷宫的入口是S（0，0，0），公主的位置用P表示，时空传输机用#表示...

【题目描述】Today we play a squiggly sudoku, The objective is to fill a 9*9 grid with digits so that each column, each row, and each of the nine Connecting-sub-grids that compose the grid contains all of t...

试题编号： 201809-4试题名称： 再卖菜时间限制： 1.0s内存限制： 256.0MB问题描述： 问题描述　　在一条街上有n个卖菜的商店，按1至n的顺序排成一排，这些商店都卖一种蔬菜。　　第一天，每个商店都自己定了一个正整数的价格。店主们希望自己的菜价和其他商店的一致，第二天，每一家商店都会根据他自己和相邻商店的价格调整自己的价格。具体的，每家商店都会将第二天的菜价设置为自己和...

【题目描述】This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.Polycarp lik...

【题目描述】Eight-puzzle,which is also called “Nine grids”,comes from an old game.In this game,you are given a 3 by 3 board and 8 tiles.The tiles are numbered from 1 to 8 and each covers a grid.As you see...

【题目描述】The students of the HEU are maneuvering for their military training.The red army and the blue army are at war today.The blue army finds that Little A is the spy of the red army,so Little A has...

【题目描述】Pass a year learning in Hangzhou,yifenfei arrival hometown Ningbo at finally.Leave Ningbo one year,yifenfei have many people to meet.Especially a good friend Merceki.Yifenfei’s home is at the ...

【题目描述】在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。【输入】输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 , k <...

【题目描述】You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north...

【题目描述】Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ...

【题目描述】大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N毫升和M毫升可乐的体积为S（S<101）毫升(正好装满一瓶) ，它们三个之间可以相互倒可乐 (都是没有刻度的，且 S==N+M，101＞...

【题目描述】The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that div...

【题目描述】定义一个二维数组：int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。【输入】一个5 × 5的二维数组，表示一个...

【题目描述】Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze.Given Joe’s location in...

【题目描述】Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then the...

【题目描述】You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:1.FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;2.DROP(i) emp...

【题目描述】Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤...

【题目描述】Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 an...

【题目描述】The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.— It is a matter...

【题目描述】A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C ch...

【题目描述】The 15-puzzle has been around for over 100 years; even if you don’t know it by that name, you’ve seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and al...

【题目描述】George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he h...