- 博客(68)
- 资源 (6)
- 收藏
- 关注
RSS订阅原创 使用C#解决部分Win8.1系统窗口每隔几秒失去焦点的问题
使用了Win8.1 With Update 1后，发现重启系统后，当前激活的窗口总是每隔几秒失去焦点，过0.5~1秒焦点回来，导致输入无法正常工作，严重影响使用心情和效率。在网上找了很久，也没找到相应的解决办法，大多提供的是关闭计划任务中禁用阿里巴巴的自动更新任务（http://www.paopaoche.net/gonglue/21442.html）。可是这个方法对我来说并不管用，而且那种是
2014-05-09 10:31:44
18336
7
原创 【ProjectEuler】ProjectEuler_055（10000以下有多少Lychrel数？）
#pragma once#include #include using namespace std;class MoonBigNum{public: MoonBigNum(void); MoonBigNum(const string &num); MoonBigNum(const UINT32 &num); MoonBigNum(const Moon
2013-06-02 18:58:04
2889
原创 【ProjectEuler】ProjectEuler_054（在扑克游戏中玩家1能赢多少局？）
// Poker hands// Problem 54// In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way://// High Card: Highest value card.//
2013-04-21 18:28:57
3683
原创 【ProjectEuler】ProjectEuler_053（对于1≤n≤100，C(n,r)有多少超过100万？）
// Combinatoric selections// Problem 53// There are exactly ten ways of selecting three from five, 12345://// 123, 124, 125, 134, 135, 145, 234, 235, 245, and 345//// In combinatoric
2013-04-21 18:27:52
2621
原创 【ProjectEuler】ProjectEuler_052(找出最小的正整数x，使得2x, 3x, 4x, 5x和6x都包含同样的数字)
#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt
2013-04-21 18:26:56
3154
原创 【ProjectEuler】ProjectEuler_051（找出最小的能够通过改变同一部分得到八个质数的质数）
#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt
2013-03-24 21:46:14
2183
原创 【ProjectEuler】ProjectEuler_050（找到100万以内最多连续素数的和，它也同时是个素数）
#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt
2013-03-23 20:35:57
2747
原创 【ProjectEuler】ProjectEuler_049
#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt
2013-03-13 20:52:13
2084
原创 【ProjectEuler】ProjectEuler_048
// Self powers// Problem 48// The series, 1^1 + 2^2 + 3^3 + ... + 10^10 = 10405071317.//// Find the last ten digits of the series, 1^1 + 2^2 + 3^3 + ... + 1000^1000.#include #includ
2013-03-11 22:26:16
2505
原创 【ProjectEuler】ProjectEuler_047
#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt
2013-03-11 21:09:26
2050
原创 【ProjectEuler】ProjectEuler_044
#pragma once#include class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt // Access: public
2013-03-11 20:15:52
2032
原创 【ProjectEuler】ProjectEuler_046
#pragma once#include class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt // Access: public // Describe:
2013-03-10 22:23:22
2105
原创 【ProjectEuler】ProjectEuler_045
#pragma once#include class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt // Access: public
2013-03-10 21:53:10
2066
原创 http://challenge.greplin.com/上的3道题。
最近写代码比较少，苦于没机会练手，就去找了一些编程网站，做几道题，昨晚发现http://challenge.greplin.com/有3道题，时间要求20分钟到3个小时，题目不难，把它完成了，贴出代码。第一题，找出一长串字符串和其逆序串中，最长匹配字串。#include "MoonString.h"MoonString::MoonString(void){}
2013-03-09 08:52:37
2897
原创 【ProjectEuler】ProjectEuler_042
// Problem 42// 25 April 2003//// The nth term of the sequence of triangle numbers is given by, tn = ½n(n+1); so the first ten triangle numbers are://// 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
2012-04-11 13:13:05
6247
原创 【ProjectEuler】ProjectEuler_041
// Problem 41// 11 April 2003//// We 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 pr
2012-04-11 12:56:27
2192
原创 【ProjectEuler】ProjectEuler_040
// Problem 40// 28 March 2003//// An irrational decimal fraction is created by concatenating the positive integers://// 0.123456789101112131415161718192021...//// It can be seen that the 12t
2012-04-11 12:00:16
1969
原创 【ProjectEuler】ProjectEuler_039
// Problem 39// 14 March 2003//// If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120.//// {20,48,52}, {24,45,51}, {
2012-04-11 11:18:49
2037
原创 【ProjectEuler】ProjectEuler_067
// By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.// // 3// 7 4// 2 4 6// 8 5 9 3// // That is, 3 + 7 +
2011-11-05 15:41:03
2505
1
原创 【ProjectEuler】ProjectEuler_038
// Problem 38// 28 February 2003//// Take the number 192 and multiply it by each of 1, 2, and 3://// 192 1 = 192// 192 2 = 384// 192 3 = 576// By concatenating each product we get the 1 to
2011-11-05 15:40:11
2198
原创 【ProjectEuler】ProjectEuler_037
// Problem 37// 14 February 2003//// The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage
2011-11-05 15:39:46
1074
原创 【ProjectEuler】ProjectEuler_036
// Problem 36// 31 January 2003//// The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.//// Find the sum of all numbers, less than one million, which are palindromic in
2011-11-05 15:39:24
807
原创 【ProjectEuler】ProjectEuler_035
// Problem 35// 17 January 2003//// The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.//// There are thirteen such primes be
2011-11-05 15:38:58
826
原创 【ProjectEuler】ProjectEuler_034
// Problem 34// 03 January 2003//// 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.//// Find the sum of all numbers which are equal to the sum of the factorial of their digits.//
2011-11-05 15:38:38
656
原创 【ProjectEuler】ProjectEuler_033
// Problem 33// 20 December 2002//// The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is corr
2011-11-05 15:37:59
740
原创 【ProjectEuler】ProjectEuler_032
// Problem 32// 06 December 2002// // We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5
2011-11-05 15:37:23
569
原创 【ProjectEuler】ProjectEuler_031
// Problem 31// 22 November 2002//// In England the currency is made up of pound, O, and pence, p, and there are eight coins in general circulation://// 1p, 2p, 5p, 10p, 20p, 50p, O1 (100p) and O
2011-11-05 15:37:05
535
原创 【ProjectEuler】ProjectEuler_030
// Problem 30// 08 November 2002//// Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits://// 1634 = 14 + 64 + 34 + 44// 8208 = 84 + 24 + 04
2011-11-05 15:36:39
565
原创 【ProjectEuler】ProjectEuler_029
// Problem 29// 25 October 2002//// Consider all integer combinations of ab for 2 a 5 and 2 b 5://// 22=4, 23=8, 24=16, 25=32// 32=9, 33=27, 34=81, 35=243// 42=16, 43=64, 44=256, 45=1024//
2011-11-05 15:36:19
580
原创 【ProjectEuler】ProjectEuler_028
// Problem 28// 11 October 2002//// Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows://// 21 22 23 24 25// 20 7 8 9 10// 19 6
2011-11-05 15:36:01
507
原创 【ProjectEuler】ProjectEuler_027
// Problem 27// 27 September 2002//// Euler published the remarkable quadratic formula://// n² + n + 41//// It turns out that the formula will produce 40 primes for the consecutive values n = 0
2011-11-05 15:35:44
606
原创 【ProjectEuler】ProjectEuler_026
// Problem 26// 13 September 2002//// A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given://// 1/2 = 0.5// 1/3 = 0
2011-11-05 15:35:27
585
原创 【ProjectEuler】ProjectEuler_025
// Problem 25// 30 August 2002// // The Fibonacci sequence is defined by the recurrence relation:// // Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1.// Hence the first 12 terms will be:// // F1 = 1
2011-11-05 15:34:13
685
原创 【ProjectEuler】ProjectEuler_024
// Problem 24// 16 August 2002//// A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are list
2011-11-05 15:33:53
548
原创 【ProjectEuler】ProjectEuler_023
// Problem 23// 02 August 2002//// A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1
2011-11-05 15:33:32
686
原创 【ProjectEuler】ProjectEuler_022
// Problem 22// 19 July 2002//// Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order.
2011-11-05 15:33:09
13260
原创 【ProjectEuler】ProjectEuler_021
// Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).// If d(a) = b and d(b) = a, where a b, then a and b are an amicable pair and each of a and
2011-11-05 15:32:45
650
原创 【ProjectEuler】ProjectEuler_020
using System;using System.Collections.Generic;using System.Text;namespace projecteuler020{ class Program { static void Main(string[] args) { F1(); }
2011-11-05 15:32:16
474
原创 【ProjectEuler】ProjectEuler_019
// You are given the following information, but you may prefer to do some research for yourself.//// 1 Jan 1900 was a Monday.// Thirty days has September,// April, June and November.// All the re
2011-11-05 15:31:58
525
原创 【ProjectEuler】ProjectEuler_018
// By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.// // 3// 7 4// 2 4 6// 8 5 9 3// // That is, 3 + 7 +
2011-11-05 15:31:31
534
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人