know_heng的博客

Wrestling Match Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 266    Accepted Submission(s): 123 Problem Description Nowadays, at

补全4*4的数独 代码： #include #include #include #include #include #include using namespace std; int a[40][40],sum; int hang[40][50],lie[40][50],f[20][20][50]; int jud(int i,int j,int k){ int h=(i

Number Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3760   Accepted: 1557 Description Christine and Matt are playing an exciting game they just inv

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 had orig

The game of Tobo is played on a plastic board designed into a 3 × 3 grid with cells numbered from 1 to 9 as shown in figure (a). The grid has four dials (labeled ``A" to ``D" in the figure.) Each dial

走迷宫 Time Limit: 1000ms Memory Limit: 128000KB 64-bit integer IO format:      Java class name: Submit Status PID: 4918 Dr.Kong设计的机器人卡多非常爱玩，它常常偷偷跑出实验室，在某个游乐场玩之不疲。这天卡多又跑出来了，在SJTL游乐场玩

Description A boy named Vasya wants to play an old Russian solitaire called "Accordion". In this solitaire, the player must observe the following rules: A deck of n cards is carefully shuffled,

Have you learned something about segment tree? If not, don’t worry, I will explain it for you.  Segment Tree is a kind of binary tree, it can be defined as this:  - For each node u in Segment Tree,

Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is o

Moriarty has trapped n people in n distinct rooms in a hotel. Some rooms are locked, others are unlocked. But, there is a condition that the people in the hotel can only escape when all the doors ar

Consider an n × m grid. Initially all the cells of the grid are colored white. Lenny has painted some of the cells (at least one) black. We call a painted grid convex if one can walk from any black

Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.  This is an example of one of her creat

L2-011. 玩转二叉树 时间限制 400 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 陈越 给定一棵二叉树的中序遍历和前序遍历，请你先将树做个镜面反转，再输出反转后的层序遍历的序列。所谓镜面反转，是指将所有非叶结点的左

问题描述 　　兰顿蚂蚁，是于1986年，由克里斯·兰顿提出来的，属于细胞自动机的一种。 　　平面上的正方形格子被填上黑色或白色。在其中一格正方形内有一只“蚂蚁”。 　　蚂蚁的头部朝向为：上下左右其中一方。 　　蚂蚁的移动规则十分简单： 　　若蚂蚁在黑格，右转90度，将该格改为白格，并向前移一格； 　　若蚂蚁在白格，左转90度，将该格改为黑格，并向前移一格。 　

Bugs Integrated, Inc. Time Limit: 15000MS   Memory Limit: 30000K Total Submissions: 10080   Accepted: 3884 Case Time Limit: 5000MS Description Bugs Integrated, Inc.

双向广搜,：使出发点和目标点同时添加到队列里搜索，一旦有相同点则结束搜索。 代码： #include struct ST{ int x,y,s,t; }re[100],fr[100]; int head1=0,head2=0,tail1=0,tail2=0; int Judge(int x,int y,int head,int tail,struct ST a[]){ for(int i=

C -- Coco Time Limit：1s Memory Limit：64MByte Submissions：262Solved：125 DESCRIPTION Coco just learned a math operation call mod.Now,there is an integer aa and nn integers

Problem Description There is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci. The path between each two different nodes is uni