8-8每日一题：质数问题 构造字符串

质数问题

枚举所有$1-N$以内所有的质数，然后再逐一判断两两相加是否为质数

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 1010;

int primes[N], cnt;
bool st[N];

int n, k;

void get_primes(int n)  // 线性筛质数
{
    for (int i = 2; i <= n; i ++ )
    {
        if (!st[i]) primes[cnt ++ ] = i;
        for (int j = 0; primes[j] <= n / i; j ++ )
        {
            st[primes[j] * i] = true;
            if (i % primes[j] == 0) break;
        }
    }
}


int main()
{
    get_primes(N - 1);
    
    int T;
    scanf("%d", &T);
    
    while (T -- )
    {
        cin >> n >> k;
        
        int res = 0;
        for (int i = 2; i <= n; i ++ )
        {
            if (st[i]) continue;
            for (int j = 1; j < cnt; j ++ )
            {
                if (primes[j - 1] + primes[j] + 1 == i)
                {
                    res ++ ;
                    break;
                }
            }
        }
        
        if (res >= k) puts("YES");
        else puts("NO");
    }
    return 0;
}

构造字符串

构造成aabbaabbaabbaabb这种字符串就可以了

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;
    
    for (int i = 0; i < n; i ++ )
        if (i % 4 < 2) cout << 'a';
        else cout << 'b';
    
    return 0;
}

Leetcode每日一题：泰斐波那锲数

class Solution {
public:
    int tribonacci(int n) {
        int a = 0, b = 1, c = 1;
        if (n == 0) return a;
        else if (n == 1 || n == 2) return b;
        else
        {
            int k = n - 2, t;
            while (k -- )
            {
                t = a + b + c;
                a = b, b = c, c = t;
            }
            return t;
        }
    }
};