Traverse all processes and find the specified process to stop

[Cpp]// Testlog. cpp: defines the entry point of the console application.// # Include "stdafx. h"# Include # Include # Include  Using namespace std; Int _ tmain (int argc, _ TCHAR * argv []){// HMODULE Mymhandle;// _ Tsystem (L "calc.exe ");//

Vehicle color recognition-New Version

1. The Program is based on the license plate locating interface of a colleague; 2. For the debugging program, the Program sets the mouse to select a specific area in the image for recognition; 3. Program for car color, a total of 8 colors PS:

Introduction to file_operations struct

1. file_operations source code linux-2.6.38/include/linux/fs. h In the kernel [Cpp]/** NOTE:* All file operations should t setlease can be called* The big kernel lock held in all filesystems.*/Struct file_operations {Struct module * owner;Loff_t (*

Hdu 1423 Longest Common ascending subsequence

I just learned this technique and it is very good. It can be used directly as a template. It is estimated that there will be no such troubles as variants. Directly paste the code. It's too short. Remember it at first glance. [Cpp]# Include Using

6_3 coordinate point

[Cpp]//// Main. cpp// 6_3.cpp//// Created by JI Zilong on 13-4-10.// Copyright (c) 2013 Ji Zilong. All rights reserved.//# Include # Include Class CPoint{Private:Double x; // abscissaDouble y; // ordinatePublic:CPoint (double xx = 0, double yy = 0 );

Insert Sorting Algorithm (InsertSort)

[Cpp] view plaincopyprint?// Insert sorting# Include # Include Using namespace std;  Int arr [] = {23, 34,523,421, 31,346 5, 4, 2341 };Const int n = sizeof (arr)/sizeof (int );Void InsertSort (){    For (int I = 1; I {Int temp = arr [I]; // The temp

Evaluate the depth of the Binary Tree

Question: Enter the root node of a binary tree to find the depth of the tree. A tree path is formed from the root node to the leaf node. The longest path length is the depth of the tree. For example, input binary tree: 10/\6 14//\4 12 16 Output

Maximum rank of hdu 1856 and difference set

[Cpp] // calculate the maximum rank for the sum of difference sets // if a bunch of students are indirectly or directly friends with each other, the union with the largest number of students is the maximum rank [cpp] // No know why G ++ times out

Hdu 2222 AC automatic machine

/* An AC automatic machine template question has timed out more than 20 times. After being modified for half a day, the code marks a key step for modifying the process from TLE to AC, it looks like the details of array passed as function parameters,

Week 5-Project 5-Multi-File Reading

Print? /** Copyright and version Declaration of the program* Copyright (c) 2013, a student from the computer College of Yantai University* All rightsreserved.* File name: object. cpp. * Author: Yang shaoning* Completion date: January 1, April 10, 201

C/C ++ some interesting Algorithms

And operations Int x = 9999; Int count = 0; While (x) { Count ++; X = x & (x-1 ); } Printf ("% d", count ); The output result is 8; Convert 9999 to binary: 9999/2 = 4999... 1; 4999/2 = 2499... 1 ...... In the end, the result is as follows: 10 0111 00

HDOJ 4529-N server guard status compression DP

Status compression DP is much more efficient than self-developed DP... 406ms ~~   Program: [Cpp]# Include # Include # Include # Include # Include # Include # Include # Include # Define ll long# Define OOS 1000000007Using namespace std;Char arc [10] [

Zoj 1006 Do the Untwist

The question is to give you the ciphertext and ask you to output the plaintext How to encrypt plaintext into a ciphertext: ciphercode [I] = (plaincode [ki mod n]-I) mod 28. We can conclude that plaincode [ki mod n] = (ciphercode [I] + I) mod

Zoj 3631 Watashi's BG

Question: N (1 ~ 30) days, the I-day vi (1 ~ 10 ^ 8), total amount of money m (0 ~ 10 ^ 8 ). You can choose to spend or not on a daily basis. Ask how much it can cost at most.   Question: This is similar to the 01 backpack, but the 01 backpack will

Dynamic Planning-monkey 2

If you are interested in hphp and monkeys, read monkey. However, after reading the questions, hphp is very stupid, if the monkey's scope of action is at the bottom of a horizontal column of n (n Input Multiple groups of test data, each group of

Hdu 1198 Farm Irrigation (search + query set)

/* I used this question to search for it. I originally wanted to use and query the set. However, WA can't directly search for it. */ # Include # Include Int n, m;Int dx [] = {0, 0, 1,-1}, dy [] = {1,-1, 0}; // r l d uChar s [2, 555] [555]Int p [555

POJ 2446 binary maximum match

Q: I will give you an N * M graph, and then cover it with 1*2 cards. Some points cannot be covered. Check whether it can completely overwrite binary matching to find out whether the maximum match is equal to the number of points that can be covered.

Nested call of the Boost library bind Function

Question:I wrote a function that uses a random number generator that generates an integer random number as a parameter. Then a function is written to generate a random number generator with different distributions based on parameters for the

Magic C ++ (function pointer) (xml configuration control style)

Problem origin: In my spare time, I wrote WTL-based controls for repainting. In order to flexibly set various controls, I chose to use xml to configure controls (such as text color, Font, background color ). Build. xml is used to set the control

C ++ implementation: reverse (sequential) operations on a single-chain table

[Cpp]// Main. cpp# Include # Include # Include # Include # Include # Include "linklist. cpp"# Define MAXINTLEN 10 Using namespace std; Int main (int argc, char * argv []){Int tmp [MAXINTLEN];Double runtime = 0;Clock_t s, e;Linklist sl; For (int I = 0

Total Pages: 5902 1 .... 3998 3999 4000 4001 4002 .... 5902 Go to: GO

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.