![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
文章平均质量分 54
nyist_xushukui
成材不自在,自在不成材!!
展开
-
邝斌带你飞之数论专题--Maximum GCD UVA - 11827
Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possible pair of these integers. Input The first line of input is an integer N (1 < N < 100) that determines原创 2017-03-22 12:26:02 · 302 阅读 · 0 评论 -
Nearest Neighbor Search
## Nearest Neighbor Search ## Input file: standard input Output file: standard output Time limit: 1 second Memory limit: 1024 megabytes Bobo has a point p and a cube C in 3-dimension space. The poi原创 2017-03-15 22:02:07 · 508 阅读 · 0 评论 -
Hat's Fibonacci hdu 1250
Problem Description A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n -原创 2017-03-17 13:29:09 · 158 阅读 · 0 评论 -
Number Sequence HDU - 5014
There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules: ● a i ∈ 0,n0,n ● a i ≠ a j( i ≠ j ) For sequence a and sequence b, the integrating degree t原创 2017-04-18 08:58:50 · 304 阅读 · 0 评论 -
前m大的数
前m大的数 Time Limit: 1000 MS Memory Limit: 32768 KB 64-bit integer IO format: %I64d , %I64u Java class name: Main Description 还记得Gardon给小希布置的那个作业么?(上次比赛的1005)其实小希已经找回了原来的那张数表转载 2017-04-19 20:57:28 · 407 阅读 · 0 评论