数论专题

Always an integer

c++,string类的花式使用

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (210)
ll a[MAXN];
char st[MAXN],sz=0;
int D;
void trans() {
    st[sz+1]=0;

    string s(st+1);
    if (s[0]=='+') s=s.substr(1);

    int C=0,E=0;

    if (s.find('n')==string::npos) E=0;
    else if (s.find('^')==string::npos) E=1;
    else {
        int p = s.find('^');
        E = atoi(s.substr(p+1).c_str());        
    }

    int p = s.find('n');
    if (p==string::npos) C=atoi(s.c_str());
    else {
        string s2=s.substr(0,p);
        if (s2=="") C=1;
        else if (s2=="-") C=-1;
        else C=atoi(s2.c_str());
    }

    a[E]=C;
    sz=0;
}
ll calc(ll p) {
    ll ans=0,q=1;
    Rep(i,101) {
        ans=(ans+q*a[i]%D)%D;
        q=q*p%D;        
    }
    return ans%D;
} 
int main()
{
    int kcase=1;
//  freopen("la4119.in","r",stdin);
//  freopen(".out","w",stdout);

    string s;
    while(cin>>s) {
        if (s==".") break;
        int len=s.length();

        MEM(a)
        sz=0;
        For(i,len-1) {
            if (s[i]=='+'||(s[i]=='-'&&i>1))
            {
                trans();
            } 
            st[++sz]=s[i];
            if (s[i]==')') {
                --sz;
                trans();
                D=atoi(s.substr(i+2).c_str());
                break;
            }
        }
        bool flag=0;
        Rep(i,101) if (calc(i)) {
            flag=1;break;
        }   
        printf("Case %d: ",kcase++);
        if (flag) puts("Not always an integer");
        else puts("Always an integer");



    }   


    return 0;
}

UVA 11426 GCD - Extreme (II)

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define MAXN (4000000+10) 
typedef long long ll;
typedef unsigned long long ull;
int p[MAXN],tot,phi[MAXN];
bool b[MAXN]={0};
void make_prime(int n)
{
    tot=0; phi[1]=1;
    Fork(i,2,n)
    {
        if (!b[i]) p[++tot]=i,phi[i]=i-1;
        For(j,tot)
        {
            if (i*p[j]>n) break;
            b[i*p[j]]=1;
            phi[i*p[j]]=phi[i]*phi[p[j]];
            if (i%p[j]==0) {
                phi[i*p[j]]= phi[i]*p[j];
                break;
            }
        }
    }
}
ull S[MAXN]={0};
void prework(int n){
    For(i,n) 
        for(int j=2*i;j<=n;j+=i) S[j]+=i*phi[j/i];
    Fork(i,2,n) S[i]+=S[i-1];
}
int main()
{
    make_prime(MAXN-10);
//  For(i,20) cout<<i<<':'<<phi[i]<<endl;
    prework(MAXN-10);
    int t;
    while(cin>>t&&t) {
        cout<<S[t]<<endl;
    }


    return 0;
}