2015年06月_要个男盆友扭蛋

原创 pcap网络抓包无法import pcap

坑爹的不知道从哪里看到说只有pcap最多只支持到python2.5，然后又是easy install又是安装pip就是无法成功import pcap。。。我的python版本是2.7.8。sudo apt-get install python-pypcapimport pcapy没有报错了，重要可以安心的抓包了。

2015-06-09 10:36:21 2273

原创 Project Euler：Problem 50 Consecutive prime sum

The prime 41, can be written as the sum of six consecutive primes:41 = 2 + 3 + 5 + 7 + 11 + 13This is the longest sum of consecutive primes that adds to a prime below one-hundred.The longest s

2015-06-07 14:20:52 560

原创 Project Euler：Problem 49 Prime permutations

The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are perm

2015-06-07 11:12:06 650

原创 Project Euler：Problem 48 Self powers

The series, 11 + 22 + 33 + ... + 1010 = 10405071317.Find the last ten digits of the series, 11 + 22 + 33 + ... + 10001000.#include #include using namespace std;string powe(int n){ stri

2015-06-07 10:50:46 743

原创 Project Euler：Problem 47 Distinct primes factors

The first two consecutive numbers to have two distinct prime factors are:14 = 2 × 715 = 3 × 5The first three consecutive numbers to have three distinct prime factors are:644 = 2² × 7 × 23

2015-06-07 10:31:00 685

原创 Project Euler：Problem 46 Goldbach's other conjecture

It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.9 = 7 + 2×1215 = 7 + 2×2221 = 3 + 2×3225 = 7 + 2×3227 = 19 + 2

2015-06-07 10:04:14 712

原创 Project Euler：Problem 45 Triangular, pentagonal, and hexagonal

Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:Triangle Tn=n(n+1)/2 1, 3, 6, 10, 15, ...Pentagonal Pn=n(3n−1)/2 1, 5, 12, 22, 35, ...

2015-06-05 15:28:10 583

原创 Project Euler：Problem 44 Pentagon numbers

Pentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The first ten pentagonal numbers are:1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...It can be seen that P4 + P7 = 22 + 70 = 92 = P8.

2015-06-05 15:09:20 594

原创 Project Euler：Problem 43 Sub-string divisibility

The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.Let d1

2015-06-05 10:24:15 719

原创 Project Euler：Problem 42 Coded triangle numbers

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, ...By converting each letter in a word to a

2015-06-05 09:57:13 757

原创 Project Euler：Problem 41 Pandigital prime

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 prime.What is the largest n-digit pandi

2015-06-05 09:53:19 866

原创 Project Euler：Problem 40 Champernowne's constant

An irrational decimal fraction is created by concatenating the positive integers:0.123456789101112131415161718192021...It can be seen that the 12th digit of the fractional part is 1.If dn repr

2015-06-04 11:25:18 631

原创 Project Euler：Problem 39 Integer right triangles

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}, {30,40,50}For which value of p ≤ 1000, is

2015-06-04 11:22:21 791

原创 Project Euler：Problem 38 Pandigital multiples

Take the number 192 and multiply it by each of 1, 2, and 3:192 × 1 = 192192 × 2 = 384192 × 3 = 576By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 19238457

2015-06-04 10:57:54 569

原创 Project Euler：Problem 37 Truncatable primes

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: 3797, 797, 97, and 7. Similarly we c

2015-06-04 10:23:00 833

原创 Project Euler：Problem 36 Double-base palindromes

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 base 10 and base 2.(Please note that the

2015-06-04 09:55:26 534

原创 Project Euler：Problem 35 Circular primes

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 below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71,

2015-06-03 14:07:10 478

原创 Project Euler：Problem 34 Digit factorials

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.Note: as 1! = 1 and 2! = 2 are not sums they

2015-06-03 13:57:20 616

原创 Project Euler：Problem 33 Digit cancelling fractions

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.Note: as 1! = 1 and 2! = 2 are not sums they

2015-06-03 10:59:55 819

原创 Project Euler：Problem 32 Pandigital products

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 pandigital.The product 7254 is unusu

2015-06-03 10:40:55 747

原创 Project Euler：Problem 31 Coin sums

In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).It is possible to make £2 in the

2015-06-03 09:55:05 924

原创 Project Euler：Problem 30 Digit fifth powers

Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:1634 = 14 + 64 + 34 + 448208 = 84 + 24 + 04 + 849474 = 94 + 44 + 74 + 44As 1 = 14

2015-06-02 22:43:55 609

原创 Project Euler：Problem 29 Distinct powers

Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:22=4, 23=8, 24=16, 25=3232=9, 33=27, 34=81, 35=24342=16, 43=64, 44=256, 45=102452=25, 53=125, 54=625, 55=3125If they a

2015-06-02 22:42:45 798

原创 Project Euler：Problem 28 Number spiral diagonals

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 2520 7 8 9 1019 6 1 2 1118 5 4 3 1217 16 15 14 13It

2015-06-02 10:44:02 761

原创 Project Euler：Problem 27 Quadratic primes

Euler discovered the remarkable quadratic formula:n² + n + 41It turns out that the formula will produce 40 primes for the consecutive values n = 0 to 39. However, when n = 40, 402 + 40 + 41 = 40

2015-06-02 10:07:57 633

原创 Project Euler：Problem 26 Reciprocal cycles

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.51/3= 0.(3)1/4= 0.251/5

2015-06-02 09:56:04 837

原创 Project Euler：Problem 25 1000-digit Fibonacci number

The Fibonacci sequence is defined by the recurrence relation:Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.Hence the first 12 terms will be:F1 = 1F2 = 1F3 = 2F4 = 3F5 = 5F6 = 8F7 = 1

2015-06-01 22:47:59 980

原创 Project Euler：Problem 24 Lexicographic permutations

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 listed numerically or alphabetically, we

2015-06-01 22:14:36 849 1

原创 Project Euler：Problem 23 Non-abundant sums

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 + 2 + 4 + 7 + 14 = 28, which means

2015-06-01 22:12:14 960

原创 Project Euler：Problem 22 Names scores

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. Then working out the alphabetical

2015-06-01 21:01:10 797 1

原创 Project Euler：Problem 21 Amicable numbers

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 b a

2015-06-01 15:30:32 1175

312小公举的专栏