判断是不是3的倍数

There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). ide Input Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000). code Ou

>>阅读原文<<