问题描述

The sum of the squares of the first ten natural numbers is,

The square of the sum of the first ten natural numbers is,

Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is $3025−385=2640$.

Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.

问题描述

$2520$ is the smallest number that can be divided by each of the numbers from $1$ to $10$ without any remainder.

What is the smallest positive number that is evenly divisible by all of the numbers from $1$ to $20$?

evenly divisible: divisible with no remainder

问题描述

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is $9009 = 91 × 99$.

Find the largest palindrome made from the product of two 3-digit numbers.

问题描述

The prime factors of $13195$ are $5$,$7$,$13$ and $29$.

What is the largest prime factor of the number $600851475143$?

问题描述

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

问题描述

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

Find the sum of all the multiples of 3 or 5 below 1000.

这里展示的主要是一些在blog搭建初期的遇到问题以及解决措施

我使用的是hexo的blog框架

采用的主题是next.

问题描述

给一个无向图 N个顶点（0 ~ N-1） E条边 从第0个顶点开始DFS/BFS遍历这个无向图

按照编号递增的顺序访问邻接点.

题目链接:

https://pintia.cn/problem-sets/15/problems/714

数据范围:

0 <= N <= 10

E未知

样例:

Input:

1
2
3
4
5
6
7

8 6
0 7
0 1
2 0
4 1
2 4
3 5

Output:

1
2
3
4
5
6

{ 0 1 4 2 7 }
{ 3 5 }
{ 6 }
{ 0 1 2 7 4 }
{ 3 5 }
{ 6 }

问题描述

给一个图，有N个结点 M条边 然后找出每一个结点从当前结点开始 与该节点距离不超过6的结点数占结点总数N的百分比.

题目链接:

https://pintia.cn/problem-sets/15/problems/715

数据范围:

N: 1 < N < 1e3

M: <= 33 *N

样例:

Input:

1
2
3
4
5
6
7
8
9
10

10 9
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10

Output:

1
2
3
4
5
6
7
8
9
10

1: 70.00%
2: 80.00%
3: 90.00%
4: 100.00%
5: 100.00%
6: 100.00%
7: 100.00%
8: 90.00%
9: 80.00%
10: 70.00%

问题描述

给定n个数（无序），将n个数插入到一个小顶堆a[i]中，然后m个询问，给定一个下标x，打印a[x]到根节点的路径

题目链接:

https://pintia.cn/problem-sets/15/problems/713

数据范围:

N, M <= 1000

样例:

Input:

1
2
3

5 3
46 23 26 24 10
5 4 3

Output:

1
2
3

24 23 10
46 23 10
26 10