7.26补题

素数筛

朴素筛法

void get_prime(int n) {
    for (int i = 2; i <= n; i++) {
        if (!vis[i]) {
            prime[cnt++] = i;
        }
        for (int j = i + 1; i <= n; j += i) {
            vis[j] = true;
        }
    }
}

埃氏筛

void get_prime(int n) {
    for (int i = 2; i <= n; i++) {
        if (!vis[i]) {
            prime[cnt++] = i;
            for (int j = i + 1; j <= n; j += i)
                vis[j] = true;
        }
    }
}

线性筛

void get_prime(int n) {
    for (int i = 2; i <= n; i++) {
        if (!vis[i]) primes[cnt++] = i;
        for (int j = 0; primes[j] <= n / i; j++) {
            vis[i * primes[j]] = true;
            if (i % primes[j] == 0) break;
        }
    }
}

Catalan Square

题意

求给出的卡特兰数第n+1项。

思路

分解质因数法求组合数。

#define _CRT_SECURE_NO_WARNINGS 1;
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cstring>
#include <stdio.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
#define off ios::sync_with_stdio(false);
#define INF 0x3f3f3f3f
#define forn(i,n) for(int i = 0; i < int(n); i++)
#define scan1(n) scanf("%d",&n)
#define scan2(n,m) scanf("%d %d",&n,&m)
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define debug(x) cout << '*' << x <<endl;

const int N = 200000 + 10;
const int M = 2 * N;
const int mod = 998244353;
const int P = 131;
typedef pair<int, int> PII;
typedef long long ll;
typedef vector<int> vic;

bool vis[N];
int cnt;
int d[N];

void get_prime(int n) {
    for (int i = 2; i <= n; i++)
        for (int j = i + i; j <= n; j += i)
            vis[j] = true;
}

vector<ll> mul(vector<ll>& A, int B) {
    vector<ll> c;
    int t = 0;
    for (int i = 0; i < A.size() || t; i++) {
        if (i < A.size()) t += A[i] * B;
        c.push_back(t % 10);
        t /= 10;
    }
    while (c.size() > 1 && c.back() == 0) c.pop_back();
    return c;
}

int get(int x, int y) {
    int s = 0;
    while (x) s += x / y, x /= y;
    return s;
}

int main()
{
    //off;
    int n;
    cin >> n;
    n++;
    get_prime(2 * n);
    for (int i = 2; i <= n * 2; i++) {
        if (!vis[i]) {
            d[i] = get(n * 2, i) - get(n * 2 - n, i) * 2;
        }
    }
    int k = n + 1;
    for (int i = 2; i <= k; i++) {
        while (k % i == 0) {
            k /= i;
            d[i]--;
        }
    }
    vector<ll> res;
    res.push_back(1);
    for (int i = 2; i <= n * 2; i++) {
        for (int j = 0; j < d[i]; j++)
            res = mul(res, i);
    }
    for (int i = res.size() - 1; i >= 0; i--) cout << res[i];
    return 0;
}

Clock Pictures

题意

比较给出的两个钟表指针是否相同。

思路

开始想到用kmp但是没有坚定的做。相同的话两个图应完全重合。将角度求出来之后以任意一个角做起点都应该能重合，所以将一个图的角度记录两次，用另一个比较即可。

#define _CRT_SECURE_NO_WARNINGS 1;
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cstring>
#include <stdio.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
#define off ios::sync_with_stdio(false);
#define INF 0x3f3f3f3f
#define forn(i,n) for(int i = 0; i < int(n); i++)
#define scan1(n) scanf("%d",&n)
#define scan2(n,m) scanf("%d %d",&n,&m)
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define debug(x) cout << '*' << x <<endl;

const int N = 200000 + 10;
const int M = 2 * N;
const int mod = 998244353;
const int P = 131;
typedef pair<int, int> PII;
typedef long long ll;
typedef vector<int> vic;

int ne[N], e[N];
int s[2*N], t[N];

void get_ne(int a[], int len) {
    for (int i = 2, j = 0; i <= len; i++) {
        while (j && a[i] != a[j + 1]) j = ne[j];
        if (a[i] == a[j + 1]) j++;
        ne[i] = j;
    }
}

void kmp(int len, int len1) {
    get_ne(t, len1);
    for (int i = 1, j = 0; i <= len; i++) {
        while (j && s[i] != t[j + 1]) j = ne[j];
        if (s[i] == t[j + 1]) j++;
        if (j == len1) {
            cout << "possible" << endl;
            return;
        }
    }
    cout << "impossible" << endl;
}

int main()
{
    //off;
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> e[i];
    sort(e + 1, e + n + 1);
    for (int i = 1; i <= n - 1; i++) s[i] = e[i + 1] - e[i];
    s[n] = e[1] - e[n] + 360000;
    for (int i = 1; i <= n; i++) cin >> e[i];
    sort(e + 1, e + n + 1);
    for (int i = 1; i <= n - 1; i++) t[i] = e[i + 1] - e[i];
    t[n] = e[1] - e[n] + 360000;
    for (int i = n + 1; i <= 2 * n; i++)
        s[i] = s[i - n];
    kmp(2 * n, n);
    return 0;
}