先上源代码(最后一张有神秘物品):
bool jisuan()
{
int min=1,max=9;
bool flag=true;
int a,b,c,d;
unsigned long long seed;
max=99;
seed=(unsigned)time(NULL);
a=suiji(min,max,seed);
b=(suiji(min,max,seed+17)*suiji(min,max,seed+7)*suiji(min,max,seed-1))%100;
c=suiji(0,1,seed);
cout<<a;
if(c==0)
{
cout<<"+";
cout<<b<<"=";
cin>>d;
if(d==(a+b))
{
cout<<"Correct!"<<endl;
}
else
{
flag=false;
}
}
else
{
cout<<"-";
cout<<b<<"=";
cin>>d;
if(d==(a-b))
{
cout<<"Correct!"<<endl;
}
else
{
flag=false;
}
}
return flag;
}
int susuan()
{
int min=1,max=9,s=0;
int a,b,c,d;
unsigned long long seed;
start:cout<<"欢迎来到速算王者!"<<endl;
cout<<"请选择:"<<endl;
cout<<"1.简单模式"<<endl;
cout<<"2.中等模式"<<endl;
cout<<"3.困难模式"<<endl;
cout<<"4.终极模式(新)"<<endl;
cout<&l

最低0.47元/天 解锁文章
1223

被折叠的 条评论
为什么被折叠?



