申屠志刚

分类

ACM(1) C(128) C++(380) C.++(1) CTF(44) C语言(34) DP(4) JAVA(2) Python(1) 博弈论(1) 并查集(2) 最小生成树(1) 最短路(2) 未归档(435) 浙江理工大学2018年10月赛(2) 生成树(1) 申屠志刚的ACM之路(37) 申屠志刚的CTF之路(2) 矩阵(1) 线段树(1) 经典问题(1) 背包问题(1) 语法(1)

/ 注册

全部文章（共29篇）

A strange lift

There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have ju...

C DFS BFS 最短路

2018-10-07

0 662

逃离迷宫

给定一个m × n (m行, n列)的迷宫，迷宫中有两个位置，gloria想从迷宫的一个位置走到另外一个位置，当然迷宫中有些地方是空地，gloria可以穿越，有些地方是障碍，她必须绕行，从迷宫的一个位置，只能走到与它相邻的4个位置中,当然在行走过程中，gloria不能走到迷宫外面去。令人头痛的是，g...

C DFS BFS

2018-10-10

0 716

N皇后问题

在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。 Input 共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。 ...

C 经典问题回溯法 DFS

2018-10-10

0 713

Find The Multiple

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 m...

C DFS

2018-10-11

0 556

Flip Game

Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other o...

C DFS

2018-10-12

0 617

Bookshelf 2

Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space ...

C DP 背包问题 DFS

2018-10-20

0 647

Farm Irrigation

Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these ...

C 并查集 DFS

2018-11-01

0 467

The Values You Can Make

https://codeforces.com/problemset/problem/687/C Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci...

C DP 01背包多维背包 DFS

2018-11-28

0 474

三角形

https://ac.nowcoder.com/acm/contest/318#question C++版本一题解：排序+DFS 竟然没有TLE /* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h>...

C 排序 DFS 几何

2018-12-23

0 466

加分二叉树

https://www.luogu.org/problemnew/show/P1040 题解：这个题可以用动态规划或者记忆化搜索来做。因为如果要求加分最大的话，必须要求它的儿子结点加分最大，所以就有了最优子阶段。我们可以枚举根来更新最大值。中序遍历有个特点，在中序遍历这个序列上，某个点左边的序列一...

C 区间DP DFS

2018-12-16

0 590