COJ 0801 非传统题（一）

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstring>
#define PAU putchar(' ')
#define ENT putchar('\n')
using namespace std;
inline int read(){
int x=0,sig=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')sig=-1;ch=getchar();}
while(isdigit(ch))x=10*x+ch-'0',ch=getchar();
return x*=sig;
}
inline void write(int x){
if(x==0){putchar('0');return;}if(x<0)putchar('-'),x=-x;
int len=0,buf[15];while(x)buf[len++]=x%10,x/=10;
for(int i=len-1;i>=0;i--)putchar(buf[i]+'0');return;
}
const int Safe=5;
int gcd(int a,int b){return !b?a:gcd(b,a%b);}
int mul(int a,int b,int p){
int tmp=(a*b-(int)((double)a/p*b+1e-8)*p);
return tmp<0?tmp+p:tmp;
}
int pow(int a,int b,int p){
int ans=1;a%=p;
for(int i=b;i;i>>=1,a=mul(a,a,p))
if(i&1)ans=mul(ans,a,p);
return ans;
}
bool check(int a,int n,int r,int s){
int ans=pow(a,r,n),p=ans;
for(int i=1;i<=s;i++){
ans=mul(ans,ans,n);
if(ans==1&&p!=1&&p!=n-1) return true;
p=ans;
} if(ans!=1)return true;return false;
}
bool MR(int n){
if(n<=1) return false;
if(n==2) return true;
if(!(n&1)) return false;
int r=n-1,s=0;
while(!(r&1)) r>>=1,s++;
for(int i=0;i<Safe;i++)
if(check(rand()%(n-1)+1,n,r,s)) return false;
return true;
}
int n;
void solve1(){
n=read();
for(int i=1;i<=n;i++){
write(read()+read());ENT;
} return;
}
void solve2(){
n=read();
for(int i=1;i<=n;i++){
write(MR(read())?1:0);ENT;
} return;
}
void solve3(){
n=read();
for(int i=1;i<=n;i++){
write(read()*read());ENT;
} return;
}
void solve4(){
puts("你的程序需要在此处输出程序本身。听起来很难？努力吧！！！哈哈哈");
return;
}
void init(){
int type=read();
if(type==1) solve1();
else if(type==2) solve2();
else if(type==3) solve3();
else solve4();
return;
}
void work(){
return;
}
void print(){
return;
}
int main(){init();work();print();return 0;}