qq_36392612的博客

#include#include#include#includeusing namespace std;//compare比较函数：相等返回0，大于返回1，小于返回-1int compare(string str1,string str2){ if(str1.length()>str2.length()) return 1; else if(str1.length()

公式：W= (d+2*m+3*(m+1)/5+y+y/4-y/100+y/400+1)%7 在公式中d表示日期中的日数，m表示月份数，y表示年数。注意：在公式中有个与其他公式不同的地方：把一月和二月看成是上一年的十三月和十四月，例：如果是2004-1-10则换算成：2003-13-10来代入公式计算。int cal(int y, int m, int d) { i

#define MAXN 9999 #define MAXSIZE 1010 #define DLEN 4 class BigNum {private: int a[5000]; //可以控制大数的位数 int len;public: BigNum() { len = 1;memset(a,0,sizeof(a)); } //构造

#include#include#include#include#define maxn 100010typedef long long LL;using namespace std;LL a[maxn],n,p;struct node{ int l,r; LL sum,alltag,multag;}tr[maxn*4];void build(int id,int

#include#include#include#include#define maxn 100010typedef long long ll;using namespace std;int a[maxn],n,q;struct node{ int l,r,sum,tag;}tr[maxn*4];void build(int id,int l,int r);void

#include#include#include#include#includeusing namespace std;const int maxn=4005;string mul(string str1,string str2);int main(){ //freopen("in.txt","r",stdin); string a,b; cin>>a>>

void makePrime(){ memset(isPrime,1,sizeof(isPrime)); primeCount=0;isPrime[1]=0; for(int i=2;i<maxn;i++){ if(isPrime[i]){ primeCount++; prime[primeCount]=i;

node extend_gcd(LL a,LL b){ node ans; if(a%b==0){ ans.x=0,ans.y=1; return ans; } ans=extend_gcd(b,a%b); LL x=ans.y; LL y=ans.x-(a/b)*ans.y; ans.x=x; ans

int gcd(int a,int b){ if(a%b==0)return b; else return gcd(b,a%b);}

const int maxn=100050;int inStack[maxn],dfn[maxn],low[maxn],Index;int inComponent[maxn],componentDegree[maxn],componentNum=0;vectoredge[maxn],component[maxn];stackStack;memset(low,0,sizeof(l