Eleven

A. Eleventime limit per test ：1 secondmemory limit per test：256 megabytesinput：standard inputoutput：standard output
Eleven wants to choose a new name for herself. As a bunch of geeks, her friends suggested an algorithm to choose a name for her. Eleven wants her name to have exactlyn characters.

• f1 = 1,
• f2 = 1,
• fn = fn - 2 + fn - 1 (n > 2).

As her friends are too young to know what Fibonacci sequence is, they asked you to help Eleven determine her new name.
Input
The first and only line of input contains an integern (1 ≤ n ≤ 1000).
Output
Print Eleven's new name on the first and only line of output.
Examplesinput

8

output

OOOoOooO

input

15

output

OOOoOooOooooOoo

1 #include<bits/stdc++.h>
 2 using namespace std;
 3 
 4 int FB[1005];
 5 
 6 void init()
 7 {
 8     int t;
 9     for(int i = 1; i < 1005; i++)
10         FB[i] = 0;
11     FB[1] = FB[2] = 1;
12     for(int i = 3; i < 1005;i++)
13     {
14 
15         FB[i] = FB[i-1] + FB[i-2];
16     }
17 }
18 
19 int main()
20 {
21     init(); 
22     int n;
23 
24 
25     while(~scanf("%d",&n))
26     {
27             int temp = 2;
28         for(int i = 1; i <= n; i++)
29         {
30             if(i == FB[temp])
31             {
32                 printf("O");
33                 temp++;
34             }
35             else
36             {
37                 printf("o");
38             }
39         }
40         printf("n");
41     }
42     return 0;
43 }

原文链接: https://www.cnblogs.com/jj81/p/8384673.html

欢迎关注

微信关注下方公众号，第一时间获取干货硬货；公众号内回复【pdf】免费获取数百本计算机经典书籍