Napoleon2004的博客

#include<bits/stdc++.h>using namespace std;int s[1000010];int ksm(unsigned long long a,unsigned long long b,int m){ if(b==0)return 1; int x=ksm(a,b/2,m); x=(x*x)%m; if(b%2)x=(...

#include<cstdio>const int m=1e6;int l,a[m+1];bool b[m+1];long long s[m+1];void zs(){ long long i,j; b[1]=0; for(i=2;i<=m;i++) if(b[i]==0){ a[++l]=i; for(j=i*i;j<=m;j+=i) ...

#include<cstdio>using namespace std;typedef long long ll;const int M=9901;ll p[100],k[100];ll power(ll n,ll m){ ll sq=1; while(m){ if(m&1)sq=sq*n%M; m>>=1; n=n*n%M; } re...

#include<bits/stdc++.h>using namespace std;typedef long long ll;const int N=50000;int p[N+10],mbs[N+10];bool vis[N+10];void mobius(){    int i,j;    mbs[1]=1;    for(i=2;i<=N;i++){ ...

#include<cstdio>using namespace std;const int M=431;bool b[M+5];int l,p[M+5],jie[M+5][M+5];void jc(){ int i,j; for(i=2;i<=M;i++) if(b[i]==0){ for(j=i*i;j<=M;j+=i) b[j]=1; ...

#include<bits/stdc++.h>using namespace std;const int MAXN=3000000;bool b[MAXN];int p[MAXN],phi[MAXN];void get_phi(){ phi[1]=1; int i,j,cnt=0; for(i=2;i<MAXN;i++){ if(...

#include<cstdio>using namespace std;typedef long long ll;ll p[6010],prime[50010];ll l,d,ans,s[20],k[20],b[20];void get_prime(){ ll i,j; prime[0]=prime[1]=1; for(i=2;i<=50000;i++) if...

#include<bits/stdc++.h>using namespace std;int qpow(int m,int n){ int k=m,s=1; while(n){ if(n&1)s=s*k%29; k=k*k%29; n>>=1; } return s;}int m...

#include<bits/stdc++.h>using namespace std;int k[110][1010];void out(int n){ int i; for(i=k[n][0];i>=1;i--) printf("%d",k[n][i]); printf("\n");}void cal(int x,int y,i...

#include<cstdio>int s[1001];int gcd(int x,int y){ if(x%y==0)return y; return gcd(y,x%y);}int pd(int i,int j){ if(i==0&&j==0||i==0&&j!=1||i!=1&&j==0)return 0; if(i...

第一次写BSGS算法。#include<cstdio>#include<cmath>#include<map>using namespace std;map<long long,int>mp;long long a,b,c,m;long long qsm(long long x){ long long sum=1,aa=a; whil...

A line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from  - 5·1018 to 5·1018 inclusive, or to find out that s...

#include<bits/stdc++.h>using namespace std;long long s[300];long long exgcd(long long a,long long b,long long& x,long long& y){ if(!b){ x=1; y=0; return a; } long long d=...

#include<bits/stdc++.h>using namespace std;const int M=20010;int b[M],e[M];vector<int>prime;void ss(int n){ int i,j; b[1]=1; for(i=2;i<=n;i++) if(b[i]==0)//==0就是素数 ==1就不是 ...

#include<bits/stdc++.h>using namespace std;int main(){ long long n,i,m,t,sum,ans,kase=0; while(scanf("%lld",&n)&&n){ kase++; ans=0; m=0; t=n; if(n==1){ printf("Case ...

#include<bits/stdc++.h>using namespace std;int n,i,t,a,b,c,ans[30000010];int main(){ n=30000000; for(c=1;c<=(n>>1);c++) for(a=2*c;a<=n;a+=c){ b=a-c; if(c==(a^b))ans[a]++...

#include<bits/stdc++.h>using namespace std;int a1[10],a2[10],b[10];int qpow(int n){ if(n<0)return 0; int sum=1; while(n--)sum*=10; return sum;}void f1(int n){ int s=1,m=0; while(s*...

Lucas 大组合求模#include<bits/stdc++.h>using namespace std;long long fac(long long n,long long p){ long long sum=1; for(long long i=1;i<=n;i++) sum=sum*i%p; return sum;}long long qpow(lon...

#include<bits/stdc++.h>using namespace std;typedef long long ll;ll exgcd(ll x,ll y,ll& a,ll& b){ ll ret,tmp; if(y==0){ a=1; b=0; return x; } re...

#include<cstdio>using namespace std;int x,y;int gcd(int a,int b){ if(!b){ x=1; y=0; return a; } int r=gcd(b,a%b); int t=x; x=y; y=t-a/b*y; ...

题目描述作为体育委员，C君负责这次运动会仪仗队的训练。仪仗队是由学生组成的N * N的方阵，为了保证队伍在行进中整齐划一，C君会跟在仪仗队的左后方，根据其视线所及的学生人数来判断队伍是否整齐(如下图)。  现在，C君希望你告诉他队伍整齐时能看到的学生人数。输入输出格式输入格式： 共一个数N 输出格式： 共一个数，即C君应看到的学生人数。 #incl...