1 Star 0 Fork 1

saigon/Algorithms

forked from charlieshu/Algorithms 
加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
数独练习.cpp 1.14 KB
一键复制 编辑 原始数据 按行查看 历史
charlie 提交于 2024-01-09 00:01 . move from github to gitee
#include <math.h>
#include <iostream>
#include <time.h>
using namespace std;
int randint(){
return rand()%9;
}
int main(){
int x,y,xx,nps_times=0,ps_times=0;
long time,av_ps_time=0;
char user;
while(true){
int b[9] = {1,2,3,4,5,6,7,8,9};
for(int i=0;i<100;i++){
x = randint();
y = randint();
xx = b[x];
b[x] = b[y];
b[y] = xx;
}
for(int i=0;i<8;i++){
cout<<b[i];
}
cout<<endl<<":";
time = clock();
cin>>user;
time = clock()-time;
if(user == 'q'){
cout<<"========================================result========================================"<<endl<<endl<<endl;
cout<<"this time you have a great result:"<<endl;
cout<<"sum:"<<ps_times+nps_times<<endl;
cout<<"pass times:"<<ps_times<<endl;
cout<<"fail times:"<<nps_times<<endl;
cout<<"pass rate:"<<(ps_times*100.0f)/(ps_times+nps_times)<<"%"<<endl;
cout<<"average time of pass:"<<av_ps_time/(ps_times+nps_times)/1000.0f<<"s";
return 0;
}
else if(user - '0' == b[8]){
cout<<"bingo!"<<endl;
av_ps_time += time;
ps_times++;
}
else{
cout<<"wrong!"<<endl;
nps_times++;
}
}
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C++
1
https://gitee.com/saigonshu/algorithm.git
git@gitee.com:saigonshu/algorithm.git
saigonshu
algorithm
Algorithms
master

搜索帮助

0d507c66 1850385 C8b1a773 1850385