http://acm.timus.ru/problem.aspx?space=1&num=1923 -- timus This is s problem about thd dfs and searching like the leetcode islands problems Creating three 2-D arrays: board, land(copy), visit. board: the input, land:(0: undecided, 1: B country, 2: M…

1.数的划分 点击查看搜索 #include<iostream> #include<cstdio> #include<cmath> #include<algorithm> using namespace std; int n,m,a[100]; void dfs(int x,int y,int z)//shu zong wei { if(y>n)return; if(y==n) { for(int i=1;i<z;i++)//不取等 { prin…

1. Trees Tree is a recursive structure. 1.1 math nodes https://class.coursera.org/principlescomputing-001/wiki/view? page=trees 1.2 CODE无parent域的树 http://www.codeskulptor.org/#poc_tree.py class Tree: """ Recursive definition for trees plus…

Problem: Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. Th…

Given an Android 3x3 key ≤ m ≤ n ≤ , count the total number of unlock patterns of the Android lock screen, which consist of minimum of m keys and maximum n keys. Rules for a valid pattern: Each pattern must connect at least m keys and at most n keys.…

PE刷题记录 PE60 / 20%dif 这道题比较坑爹. 所有可以相连的素数可以构成一张图,建出这张图,在其中找它的大小为5的团.注意上界的估算,大概在1W以内.1W内有1229个素数,处理出这些素数的关系,然后dfs这张图找出大小为5的团. /*** * @name Prime pair sets * @author zball * @algorithm Sieve for primes and dfs search for finding a set of primes */ #inclu…

Given an Android 3x3 key lock screen and two integers m and n, where 1 ≤ m ≤ n ≤ 9, count the total number of unlock patterns of the Android lock screen, which consist of minimum of m keys and maximum n keys. Rules for a valid pattern: Each pattern m…

Trie build and search class TrieNode { public: TrieNode * next[]; bool is_word; TrieNode(bool b = false) { memset(next,,sizeof(next)); is_word = b; } }; class Trie { TrieNode* root; public: /** Initialize your data structure here. */ Trie() { root =…

Problem statement: Given n processes, each process has a unique PID (process id) and its PPID (parent process id). Each process only has one parent process, but may have one or more children processes. This is just like a tree structure. Only one pro…

Given a binary tree where every node has a unique value, and a target key k, find the value of the nearest leaf node to target k in the tree. Here, nearest to a leaf means the least number of edges travelled on the binary tree to reach any leaf of th…