Codeforces Round #213 (Div. 2) 解题报告

Problem A Good Number

找出数组中包含所有小于等于k的数字的数。水题

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>

using namespace std;

int n, k, vis[11];

bool judge(long long num)
{
    memset(vis, 0, sizeof vis);
    while(num){
        vis[num%10] = 1;
        num/=10;
    }
    for(int i=0; i<=k; i++){
        if(vis[i] == 0)return false;
    }
    return true;
}

int main()
{
//    freopen("in.txt", "r", stdin);

    long long num;
    while(scanf("%d%d", &n, &k)!=EOF){
        int ans = 0;
        for(int i=0; i<n; i++){
            scanf("%I64d", &num);
            if(judge(num)==true){
                ans++;
            }
        }
        printf("%d
", ans);
    }
    return 0;
}

Problem B The Fibonacci Segment

找出长度最长的斐波那契数。主要考虑n=1的特殊情况后扫描一遍。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#define LEN 100010

using namespace std;

int p[LEN];

int main()
{
//    freopen("in.txt", "r", stdin);
    int n, ans;
    while(scanf("%d", &n)!=EOF)
    {
        for(int i=0; i<n; i++){
            scanf("%d", &p[i]);
        }
        if(n==1){
            ans = 1;
        }else{
            ans = 2;
            int loc = 2;
            for(int i=2; i<n; i++){
                if(p[i] == p[i-1]+p[i-2]){
                    loc++;
                }
                else{
                    if(loc>ans)ans = loc;
                    loc = 2;
                }
            }
            if(loc>ans)ans = loc;
        }
        printf("%d
", ans);
    }
    return 0;
}

比较水只做出两道题。继续努力！