训练指南（白书）第二章：数学基础

uva11388 最大公约数和最小公倍数
这题真坑 代码简洁易懂

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define LL long long
#define INF 1000000000
#define eps 1e-10
#define sqr(x) (x)*(x)
#define pa pair<int,int>
#define cyc(i,x,y) for(int i=(x);i<=(y);i++)
#define cy2(i,x,y) for(int i=(x);i>=(y);i--)
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
    return x*f;
}
int T,x,y;
int main()
{
    T=read();
    cyc(i,1,T) 
    {
        x=read();y=read();
        if(y%x)printf("-1\n");else printf("%d %d\n",x,y);   
    }
    return 0;
}

uva11889 最小公倍数
A * B=C * gcd(A,B)
B=C’ * i 枚举i就好了

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#define for2(i,x,y) for(int i=x;i<=y;i++)
#define for3(i,y,x) for(int i=y;i>=x;i--)
using namespace std;
int gcd(int a,int b){return b==0? a:gcd(b,a%b);}
int main(){
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
    int a,c,t;
    cin>>t;
    while(t--){ 
      cin>>a>>c;
      if(c%a)cout<<"NO SOLUTION"<<endl;else
      {
        int tmp=gcd(a,c);
        a/=tmp;c/=tmp;
        double t=0;
        int i=1;
        while(a*i!=gcd(a*tmp,c*i))i++;
        cout<<c*i<<endl;
      }
    }
    return 0;
}

uva10943 全加和
插板法 自行百度
ans=C(n+k-1,k-1)

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define LL long long
#define INF 1000000000
#define eps 1e-10
#define sqr(x) (x)*(x)
#define pa pair<int,int>
#define cyc(i,x,y) for(int i=(x);i<=(y);i++)
#define cy2(i,x,y) for(int i=(x);i>=(y);i--)
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
    return x*f;
}
#define mod 1000000
int c[210][210];
int main()
{
//  freopen("input.in","r",stdin);
//  freopen("output.out","w",stdout);
    cyc(i,0,200)
    {
      c[i][0]=c[i][i]=1;
      cyc(j,1,i-1)c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod; 
    }
    int n,k;
    while(scanf("%d%d",&n,&k)&&n)
    {
        cout<<c[n+k-1][k-1]<<endl;
    }
    return 0;
}

uva10780 幂和阶乘
因式分解

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define LL long long
#define INF 1000000000
#define eps 1e-10
#define sqr(x) (x)*(x)
#define pa pair<int,int>
#define cyc(i,x,y) for(int i=(x);i<=(y);i++)
#define cy2(i,x,y) for(int i=(x);i>=(y);i--)
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
    return x*f;
}
bool is_prime(int x)
{
    int tmp=(int)sqrt(x+0.5);
    cyc(i,2,tmp)if(x%i==0)return false;
    return true;
}
int t,n,m,tmp,ans;
int prime[11000],p[10010],pp[10010],cnt;
int main()
{
//  freopen("input.in","r",stdin);
//  freopen("output.out","w",stdout);
    cyc(i,2,10000)if(is_prime(i))prime[++cnt]=i;
    cin>>t;
    cyc(k,1,t)
    {
        memset(p,0,sizeof p);ans=INF;
        cin>>m>>n;printf("Case %d:\n",k);
            cyc(i,1,n)
            {
                tmp=i;
                cyc(j,1,cnt)
                {
                    if(tmp<prime[j])break;
                    while(tmp%prime[j]==0)p[j]++,tmp/=prime[j];
                }
            }
            bool f=false;
            cyc(i,1,cnt)
            {
                tmp=m;
                int tot=0; 
                if(tmp<prime[i])break;
                while(tmp%prime[i]==0)tot++,tmp/=prime[i];
                if(tot&&p[i])ans=min(ans,p[i]/tot);
                if(p[i]<tot)f=true;
            }
            if(ans<INF&&!f)cout<<ans<<endl;else printf("Impossible to divide\n");
    }
    return 0;
}

uva11609 组队
二项式 sigma(C(n,i)*i)=n*2^(n-1)

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define LL long long
#define INF 1000000000
#define eps 1e-10
#define sqr(x) (x)*(x)
#define pa pair<int,int>
#define cyc(i,x,y) for(int i=(x);i<=(y);i++)
#define cy2(i,x,y) for(int i=(x);i>=(y);i--)
using namespace std;
inline LL read()
{
    LL x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
    return x*f;
}
#define mod 1000000007
LL pow1(LL a,LL b)
{
    LL r=1,tmp=a;
    while(b)
    {
        if(b&1)r=r*tmp%mod;
        tmp=tmp*tmp%mod;
        b>>=1;
    }
    return r;
}
int main()
{
//  freopen("input.in","r",stdin);
//  freopen("output.out","w",stdout);
    int n=read();
    cyc(i,1,n)
    {
        LL x=read();
        printf("Case #%d: %lld\n",i,pow1(2,x-1)*x%mod);
    }
    return 0;
}

uva11489 整数游戏
这难道不是博弈论 ==脑筋急转弯

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define LL long long
#define INF 1000000000
#define eps 1e-10
#define sqr(x) (x)*(x)
#define pa pair<int,int>
#define cyc(i,x,y) for(int i=(x);i<=(y);i++)
#define cy2(i,x,y) for(int i=(x);i>=(y);i--)
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
    return x*f;
}
char ch,s[1100];
int cnt,sum,len,sta[1010],top;
bool work()
{
    if(len==1)return true;
    int f=0;
    if(sum%3)cyc(i,1,top)
    if((sum-sta[i])%3==0){f=1;sum-=sta[i];sta[i]=-1;break;}
    if(cnt%2)f^=1;
    return f;
}
int main()
{
//  freopen("input.in","r",stdin);
//  freopen("output.out","w",stdout);
    int T=read();
    cyc(cas,1,T)
    {
        scanf("%s",s);
        len=strlen(s);cnt=0;sum=0;top=0;
        cyc(i,0,len-1)
        {if((s[i]-'0')%3==0)cnt++;else sta[++top]=s[i]-'0',sum+=sta[top];}
        if(work())ch='S';else ch='T';
        printf("Case %d: %c\n",cas,ch);
    }
    return 0;
}

uva11461 完全平方数
这是智障题

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define LL long long
#define INF 1000000000
#define eps 1e-10
#define sqr(x) (x)*(x)
#define pa pair<int,int>
#define cyc(i,x,y) for(int i=(x);i<=(y);i++)
#define cy2(i,x,y) for(int i=(x);i>=(y);i--)
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
    return x*f;
}
int main()
{
//  freopen("input.in","r",stdin);
//  freopen("output.out","w",stdout);
    int a,b;
    while(~scanf("%d%d",&a,&b)&&a)
    {
        if(a>b)swap(a,b);
        printf("%.0lf\n",floor(sqrt(b))-ceil(sqrt(a))+1);
    }
    return 0;
}

uva12293 盒子游戏
必败态：n=2^n-1
uva11892 类nim游戏
必敗态：全是1且有偶数个