Project Euler:Problem 41 Pandigital prime,eulerpandigitalWe shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.What is the
HDU 5237 Base64,hdu5237base64Base64Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 245 Accepted Submission(s): 119Problem DescriptionMike does not
Multithreading: How to Use the Synchronization Classes,usesizeclasses(Owed by: 春夜喜雨 http://blog.csdn.net/chunyexiyu 轉載請標明來源)翻譯文章來源: msdn - Multithreading: How to Use the Synchronization Classes注1: 藉助了google翻譯和金山詞霸注2:
LeetCode191:Number of 1 Bits,leetcode191bits Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 0000000000
How to get service execuable path,Some time we need to get specific service path and then do something you want. there are 2 way to get specific service path bellow.private static string GetRegistData(string name){string registData;RegistryKey hkml =
leetcode 221: Maximal Square,leetcodemaximalMaximal SquareTotal Accepted: 1312 Total Submissions: 6388Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following