摘要:
7-1 Standard Form of Polynomial (20 分) 时间限制:400 ms 内存限制:64 MB The standard form of a polynomial of degree n is P(x)=anxn+an−1xn−1+⋯+a1x+a0. Given that 阅读全文
摘要:
7-1 Square Friends (20 分) 时间限制:400 ms 内存限制:64 MB For any given positive integer n, two positive integers A and B are called Square Friends if by attac 阅读全文
摘要:
7-1 Happy Numbers (20 分) 时间限制:400 ms 内存限制:64 MB A happy number is defined by the following process: Starting with any positive integer, replace the nu 阅读全文
摘要:
7-1 Arithmetic Progression of Primes (20 分) 时间限制:1000 ms 内存限制:64 MB In mathematics, an arithmetic progression (AP,等差数列) is a sequence of numbers such 阅读全文
摘要:
7-1 The Closest Fibonacci Number (20 分) 时间限制:150 ms 内存限制:64 MB The Fibonacci sequence Fn is defined by Fn+2=Fn+1+Fn for n≥0, with F0=0 and F1=1. The c 阅读全文
摘要:
7-1 Panda and PP Milk (20 分) 时间限制:150 ms 内存限制:64 MB PP milk (盆盆奶)is Pandas' favorite. They would line up to enjoy it as show in the picture. On the ot 阅读全文
摘要:
7-1 Prime Day (20 分) 时间限制:400 ms 内存限制:64 MB The above picture is from Sina Weibo, showing May 23rd, 2019 as a very cool "Prime Day". That is, not only 阅读全文
摘要:
7-1 Good in C (20 分) 时间限制:400 ms 内存限制:64 MB When your interviewer asks you to write "Hello World" using C, can you do as the following figure shows? I 阅读全文
摘要:
7-1 Forever (20 分) 时间限制:3000 ms 内存限制:64 MB "Forever number" is a positive integer A with K digits, satisfying the following constrains: the sum of all 阅读全文
摘要:
7-1 Sexy Primes (20 分) 时间限制:400 ms 内存限制:64 MB Sexy primes are pairs of primes of the form (p, p+6), so-named since "sex" is the Latin word for "six". 阅读全文