FZU_zyt的专栏_(:з」∠)_

题目描述美素数解题思路参考代码#include <stdio.h>#include <string.h>const int maxn = 1000010;bool IsPrime[maxn];int Prime[maxn/2];int ans[maxn];void GetPrime(){ int tot = 0; memset(IsPrime,true,sizeof(Is

题目描述Problem 1402 猪的安家解题思路中国剩余定理的模板题。。参考代码#include<iostream>using namespace std;typedef __int64 ll;const int maxn = 1010;ll a[maxn],b[maxn];ll extended_euclid(ll a, ll b, ll &x, ll &y) { ll d

题目描述HDU 4291 A Short problem解题思路题目大意:g(n)g(n) = 3g(n−1)g(n - 1) + g(n−2)g(n - 2) 其中, g(0)g(0) = 0, g(1)g(1) = 1求 g(g(g(n)))g(g(g(n))) mod 1000000007将递推关系变形为 : (g(n+1)g(n))\begin{pmatrix} g(n+1) \\

Problem Description There is a computer, which has two memory cells (let us denote these cells by the letters a and b). Each cell (variable) stores some integer at any time. The computer can execute