swjtuoj - 2087 Fibonacci Prime

Fibonacci Prime

Description
1 ; 2 ; 3 ; 5 ; 8 ; 13 are Fibonacci numbers, 2 ; 3 ; 5 ; 13 are Fibonacci Prime
numbers, because they are co-prime with numbers before them. Give you a
integer k
now, please print k th Fibonacci Prime number.
Input
Multiple sets of data input. Each case is a integer k (1<= k <= 20).
Output
Print k th Fibonacci Prime number.
Sample input
1
2
3
4
Sample output
2
3
5

13

思路：Fibonacci prime 前四项特殊处理， 后面的下标为质数的Fibonacci就是Fibonacci prime。

           附链接：http://en.wikipedia.org/wiki/Fibonacci_prime

#include <iostream>
#include "algorithm"
#include "cstdio"
#include "cmath"
#include "cstring"
using namespace std;
#define manx 1000
long long vis[manx+10], pri[manx+10];
double fib[manx+10];
int main()
{   //freopen("1.in", "r", stdin);
    int i, j, k;
    int cur = 5;
    for(i = 2; i <= manx; i++) if(!vis[i])
        for(j = i*i; j <= manx; j += i) vis[j] = 1;
    for(i = 11; i <= manx; i++)
        if(vis[i] == 0) pri[cur++] = i;
    fib[0] = 0; fib[1] = 1;
    for(i = 2; i <= manx; i++)
        fib[i] = fib[i-1] + fib[i-2];
    while(cin>>k)
    {
        if(k == 1) cout<<2<<endl;
        else if(k == 2) cout<<3<<endl;
        else if(k == 3) cout<<5<<endl;
        else if(k == 4) cout<<13<<endl;
        else printf("%.0f\n", fib[pri[k]]);
    }
    return 0;
}