随笔分类 - 数论
摘要:前m大的数 Time Limit: 1000 MS Memory Limit: 32768 KB 64-bit integer IO format: %I64...
阅读全文
摘要: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 ...
阅读全文
摘要:Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possible pair of these integers. Input The first lin...
阅读全文
摘要:Problem Description A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both ...
阅读全文
摘要:## Nearest Neighbor Search ##Input file: standard input Output file: standard output Time limit: 1 second Memory limit: 1024 megabyt...
阅读全文