Others

TopicGiven a string S and a string T, find the minimum window in S which would contain all the characters in T in complexity O (n ).For example,S = "Adobecodebanc"T = "ABC"Minimum window is "BANC".Note:If There is no such window in S so covers all

Title Link: http://poj.org/problem?id=1077Title Description: Folk spread of the push 15 game, but here is simplified to 3*3, that is, eight digital problems, ' X ' represents the vacancy. Similar to AOJ0121 's "Seven Puzzle".Idea: Nothing special,

codeforces 411A1#include"iostream"2#include"Cstdio"3#include"CString"4#include"algorithm"5#include"Vector"6 using namespacestd;7 Charstr[ the];8 BOOLIslCharc)9 {Ten if(c >='a'&& C 'Z') One return 1; A return 0; - } - the BOOLIsL

codeforces 412E1#include"iostream"2#include"Cstdio"3#include"CString"4#include"algorithm"5#include"Vector"6 using namespacestd;7 Charstr[1000010];8 intLen;9 BOOLIslCharc)Ten { One if(c >='a'&& C 'Z') A return 1; - if(c >='A'&& C 'Z')

Original works, from the "Blue Blog" blog, Welcome to reprint, please be sure to indicate the following sources, otherwise, the legal responsibility to pursue copyright.Deep Blue Blog:http://blog.csdn.net/huangyanlong/article/details/43925813At this

AThat time, I held a 82-point test paper, alone on the road hesitated.Rain, intermittent underground, is the God for my encounter crying? Leaves shake, is the tree in my fate sigh? The frog quack quack to shout, is the worm grievances for me?        

Reprint of the watercress of an unknown friend of the introduction:NP is a polynomial time to verify that its solution is correct. For example, if we give a solution to a 0-1 backpack, we can verify that the condition is met in the polynomial time.

1 , open Server Manager, select Tools, and select Windows Server Backup ";650) this.width=650; "src=" http://s3.51cto.com/wyfs02/M02/59/D6/wKiom1TrxFPjzIpZAAK2DxCkBMY530.jpg "title=" 1.png " alt= "Wkiom1trxfpjzipzaak2dxckbmy530.jpg"/>2 , open the

Yesterday, in the Debian environment installed Scala, using the Apt-get method installed, version only to 2.9.2, and the version on the website is 2.11, but with Apt-get installed more convenient, also recognized.Ant (1.8.2) is also installed, ready

Given an integer, convert it to a Roman numeral.Input is guaranteed to being within the range from 1 to 3999.For this problem, save several special numbers in Roman numerals in a table, such as 4,5,9,10, and then start traversing the stitching1

An example of the Dex file generated in the previous article, explaining the structure of the Dex file, the Dex file structure is very simple, with only one Helloworld.javaThe basic format of the file, Dex file, please refer to the official

#include#includeBOOL IsPrime (int num) {int sqr= (int) sqrt (num*1.0);"Skill" judge the prime number as long as the square can be judged.Forint i=2; i1; ++i)if (num%i==0)Return0;Return1;}int main () {int l,r; scanf"%d%d", &l,&r);int num=2,cnt=1,pcnt=

usingSystem;usingSystem.Collections.Generic;usingSystem.ComponentModel;usingSystem.Data;usingSystem.Drawing;usingSystem.Linq;usingSystem.Text;usingSystem.Threading.Tasks;usingSystem.Windows.Forms;namespace_2015_1_25{ Public Partial classForm1:form {

Find your own search is really weak, perhaps too few problems. Most of the code is reference to others, =_=| |Test instructionsGive a Phi (n) to find the smallest nAnalysis:Look back at the equation for Euler's function: Note that the PI here is not

Properties of Class 2.4A property is a special "field".Let's take a look at a class student that represents student information:Class Student{Public String Name; NamePublic DateTime Birthday; Birthdaypublic int age; Age}The use of public fields in

Portal: Pairs Forming LCMTest instructions: Test instructions: Ask how many pairs of (1Analysis: To calculate the prime factorization, if XI is the first prime of the power, then for the two number of one of the power must be XI, another arbitrary,

Portal: Harmonic number (II)Test instructions: Beg sum=n/1+n/2+n/3+...+n/n. (nAnalysis: In a certain interval the value of the n/i is certain, so to skip this interval to accelerate the solution.#pragmaComment (linker, "/stack:1024000000,1024000000")

1. Locating data area beginning line endCtrl+home Locating data Region headerCtrl+end locating the end of the data area.2. Position the end of the current row, columnCTRL + Direction key to the beginning of the lineCTRL + Direction key to end of

MyEclipse maven, install error "encoding GBK non-mapped characters"The reason for the error is that compiler uses the GBK encoding, and the source code is set UTF8 encoding causes the compile time can not parse the correct source, the solution is

The third year is coming soon. In a hurry, there is always no reasonable arrangement, growth path, no idea where to go for employment, no idea, your own positioning, no idea! Time is a good person, the first anesthesia of the body and mind, and