Open source list

Process hacker  Process hacker is a free and open source process viewer and memory editor with unique features such as powerful Process Termination. It can show services, processes and their threads, modules, handles and memory regions.   Libemu

HDU-1396 magic triangle. Pitfall!

Simple questions are hidden in the dark! This is a recursive question. I like this type of question very much and it is very easy to start. This type of question is easy to find patterns. For example. First look at the triangle. After drawing a

The HDU-1372 knight moves (BFS)

Question: It is the minimum number of steps from a coordinate to another coordinate of a chess horse (take the "day" sub-grid ). I haven't searched for questions for a long time, and I guess I forgot about it. Today I am going to OJ to write the

Warning c4995: 'wcscat': Name was marked as # pragma deprecated

Symptom # Include # IncludeThe following warning is reported when these two header files are used today: /Microsoft Visual Studio 10.0/VC/include/intrin. H (1087): Warning c4995:'Wcscat': Name was marked as # pragma deprecated It means to

HDU-4602 partition finding rules

Analysis: I did not understand the report and then suddenly realized it. When K> N obviously does not exist, the answer is 0; When 1 In two cases, K consecutive points do not contain endpoints. In N position area k continuous points have n-1

Codeforces 123 D string (Suffix: automatic machine Sam)

Http://codeforces.com/problemset/problem/123/D Question: Give You A string S, define a function f (S, x), where X is the string in S, F (S, x) definition is too troublesome, in fact, if X appears n times in S, F (S, x) = N * (n + 1)/2. Ask for the

Dollar POJ1013-Counterfeit

 Reprinted please indicate the source: Thank youHttp://blog.csdn.net/lyy289065406/article/details/6661421     General question: There is a dozen (12) coins, including only one counterfeit coin and 11 real coins. Use ~ L as the code of each

POJ2305-Basic remains

Reprinted please indicate the source: Thank you Http://user.qzone.qq.com/289065406/blog/1309151264   General question: Evaluate P % m in B Base Where p is less than 1000 bits in B, and m is less than 9 bits in B.   Solution: Save P, M as

POJ2635-The: Embarrassed cryptographer

  Reprinted please indicate the source: Thank you Http://user.qzone.qq.com/289065406/blog/1309305108   General question: Given a large number k, k is the product value of two large prime numbers. Then, specify the number l in an int. Ask whether the

Contest POJ2187-Beauty

Reprinted please indicate the source: Thank you Http://user.qzone.qq.com/289065406/blog/1302882180   General question: Calculates the Square Value of the farthest two points for some scatter plots on the plane.   Solution: Don't think about

POJ1016-Numbers that count

Reprinted please indicate the source: Thank you http://blog.csdn.net/lyy289065406/article/details/6673675     General question: The meaning of the question is hard to understand. For any number string N, it can be compressed and stored C1 D1 C2 D2...

POJ2965-The pilots brothers 'refrigerator

Reprinted please indicate the source: Thank youHttp://user.qzone.qq.com/289065406/blog/1299077378   Tip: This question is consistent with the idea of playing a game in poj1753. It should be noted that the flip process should be output. Therefore,

Jeans POJ3080-Blue

  Reprinted please indicate the source: Thank you Http://user.qzone.qq.com/289065406/blog/1309012790   General question: Is to find the longest continuous public substring of K strings with a length of 60, 2 Rules: 1. the maximum length of a Public

HDU-1565, 1569 Max Point Weight independent set (Network Stream)

Question connection HDU 1565 and 1569 share the same problem: the largest vertex weight independence set. This is the largest vertex weight independence set in a bipartite graph. It is used to find some vertices in the graph so that these vertices

POJ3352-Road Construction

Reprinted please indicate the source: Thank youHttp://blog.csdn.net/lyy289065406/article/details/6762370       General question: A company wants to turn a tropical paradise island into a tourist attraction. There are n tourist attractions on the

Tree link splitting

I learned how to split down the tree chain some time ago. I haven't looked at it for a long time. I'll review it again today. Hurry up and write it down. Don't forget it. In the informatics competition, we sometimes encounter such a type of question.

Cows POJ2186-Popular

 Reprinted please indicate the source: Thank youHttp://blog.csdn.net/lyy289065406/article/details/6764104   General question: There are n cows, of which cow a thinks that cow B is highly noticed, and Cow B may also think that cow C is highly noticed.

HDU 4416 good article good sentence (suffix automatic machine Sam)

In the 2012 Hangzhou network competition, the suffix of the array Suffix of the machine can be used. Give a string s and a series of strings T1 ~ TN: How many different substrings are there in S to meet the requirement that it is not T1 ~ The

Peking University ACM question category-update all my problem solving report links in real time

  Reprinted please indicate the source: Thank you Http://blog.csdn.net/lyy289065406/article/details/6642573     Last AC question: 2528 updated: 2011.09.22 Number of AC questions: 146 All preliminary questions have been completed at 2011.06.30   Some

HDU-4662 (MU puzzle)

This is a regular question. It is not difficult to find a regular question. First, we can be sure that there is only one'm "in the string, and it must be in the first one. Processing I is equivalent to 1, and U is equivalent to 3. we found that

Total Pages: 64722 1 .... 28587 28588 28589 28590 28591 .... 64722 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.