范宸睿 (景泰四7班范宸睿)

UID: 2850, 注册于 2024-9-24 14:41:12, 最后登录于 2025-9-25 15:45:27, 最后活动于 2025-11-2 20:59:50.

解决了 242 道题目，RP: 239.61 (No. 12)

♂ MOD

个人简介

   #include<bits/stdc++.h>
#include<windows.h>
#include<conio.h>
using namespace std;
const int daytime=0,night=1;
int day=0, during_time=daytime, player_number, my_number;
HWND hwnd=GetForegroundWindow();
const int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//颜色常量 
void color(int c){
	switch(c){
		case red:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);break;
		case green:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);break;
		case yellow:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN);break;
		case blue:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);break;
		case white:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE);break;
		case purple:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_BLUE);break;
	}
}
int idx_police=-1;
void gotoxy(int x,int y){
	COORD position;
	position.X=x;
	position.Y=y;
	SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position);
}
void init_Show_Window(){
	system("mode con lines=60 cols=188"); 
	ShowWindow(hwnd,SW_MAXIMIZE);//窗口最大化 
	DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC_CLOSE, MF_BYCOMMAND);
	DrawMenuBar(GetConsoleWindow());//删除×字符 
}
 
/*玩家类*/
const int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2;
class player{
public:
	int type;
	int die_or_life;
	int how(){
		return die_or_life;
	}
	int is_light;//是否已经公布 
	int killer;
};
player players[1000];
 
/*转换白天模式*/ 
void change_daytime(){
	during_time=daytime;
	day++;
}
 
/*转换黑夜模式*/
void change_night(){
	during_time=night;
}
int nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0;
int idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1};
 
/*b是否在Arr中*/
bool is_include(int arr[],int b,int l){
	for(int i=0;i<l;i++){
		if(arr[i]==b)
			return true;
	}
	return false;
}
 
/*初始化人数*/
void init_players(){
	my_number=rand()%player_number;
	if(player_number==12) nlangren=4;
	else if(player_number>=10) nlangren=3;
	else nlangren=2;
	for(int i=0;i<player_number;i++)
	{
		players[i].die_or_life=life;
		players[i].is_light=0;
		players[i].type=-1;
		players[i].killer=2147483647;
	}
	for(int i=0;i<nlangren;i++)
	{
		int p=rand()%player_number;
		if(!is_include(idxlangren,p,4))
			idxlangren[i]=p,players[p].type=langren;
		else
			i--;
		Sleep(rand()%80+100);
	}
	if(player_number==12)
	{
		do{
			idxshouwei=rand()%player_number;
		}while(players[idxshouwei].type!=-1);   
		players[idxshouwei].type=shouwei;   
	}
	do{
		idxnvwu=rand()%player_number;
	}while(players[idxnvwu].type!=-1);
	players[idxnvwu].type=nvwu;
	if(player_number>=10)
	{
		do{
			idxlieren=rand()%player_number;
		}while(players[idxlieren].type!=-1);
		players[idxlieren].type=lieren;   
	}
	do{
		idxyuyanjia=rand()%player_number;
	}while(players[idxyuyanjia].type!=-1);
	players[idxyuyanjia].type=yuyanjia;
	for(int i=0;i<player_number;i++)
		if(players[i].type==-1)
			players[i].type=cunmin,
			ncunmin++;
	if(players[my_number].type==langren)
	{
		for(int i=0;i<nlangren;i++)
		{
			players[idxlangren[i]].is_light=1;
		}
	}
	players[my_number].is_light=1;
}
 
/*在屏幕上打印东西*/
void print(){
	gotoxy(0,0);
	cout<<"作者：洛谷393864";
	gotoxy(90,0);
	if(during_time==night)
		color(red);
	else
		color(blue);
	printf("第%d天 | ",day);
	if(during_time==night) cout<<"黑夜";
	else cout<<"白天";
	
	gotoxy(0,3);
	color(blue);
	cout<<" 我的号位:"<<my_number+1;
	for(int i=0;i<player_number;i++){
		gotoxy(i*8+1,4);
		if(i==idx_police) color(yellow);
		else color(blue);
		cout<<i+1<<"号位"; 
		gotoxy(i*8+1,5);
		if(players[i].how()==die){
			color(red);
			cout<<"死 亡";
		}else{
			color(green);
			cout<<"存 活";
		}
		gotoxy(i*8+1,6);
		color(blue);
		if(players[i].is_light){
			if(players[i].is_light==1){
				switch(players[i].type){
					case nvwu: cout<<"女 巫";break;
					case yuyanjia: cout<<"\b预言家";break;
					case cunmin: cout<<"村 民";break;
					case langren:cout<<"狼 人"; break;
					case lieren:cout<<"猎 人"; break; 
					case shouwei:cout<<"守 卫"; break;
				}   
			}else{
				cout<<"好人";
			}
			
		}else{
			cout<<"未知";
		}
	}
	
} 
 
/*判断是否结束,没结束返回0  好人胜利返回1  狼人胜利返回2   平局返回3*/
int is_end(){
	int die_bad=0;
	int die_people=0;
	int die_god=0;
	for(int i=0;i<player_number;i++){
		if((players[i].type == nvwu || players[i].type == yuyanjia || players[i].type == shouwei)&&players[i].die_or_life==die)
			die_god++;
		else if(players[i].type == langren && players[i].die_or_life==die)
			die_bad++;
		else if(players[i].type == cunmin && players[i].die_or_life==die)
			die_people++;
	}
	if((die_bad==die_people || die_bad==die_god)&&(die_bad>=nlangren))
		return 3;
	if(die_bad>=nlangren)
		return 1;
	if(die_people>=ncunmin||die_god>=(player_number>=10 ? 3:2))
		return 2;
	return 0;
}
 
/*游戏开始前的骚操作*/
void before_game(){
	srand(time(NULL));
	init_Show_Window();
	color(green);
	cout<<"欢迎来到狼人杀游戏\t\t\t为了更好的游戏体验,请右键点击上方↑↑,点击\"属性\",点击\"字体\"栏目,将字体修改为宋体或新宋体,将字号改为20\n作者：洛谷393864\n请勿私自转载,违者依法追究法律责任  注：10 11 12人局开设猎人  12人局开设守卫警长\n______________________\n";
	cout<<"请输入玩家人数(8-12人):";
	cin>>player_number;
	while(player_number<8||player_number>12)
	{ cout<<"请重新输入！\n"; cin>>player_number; }
	system("cls");
	cout<<"初始化身份中，请稍等.";
	for(int i=0;i<6;i++){
		for(int j=0;j<12;j++){
			cout<<".";
			Sleep(50);
		}   
		cout<<"\b\b\b\b\b\b\b\b\b\b\b\b            \b\b\b\b\b\b\b\b\b\b\b\b";
	}
	system("cls");
	
	init_players();
	cout<<"我的号位:"<<my_number+1<<endl
	<<"我的身份:";
	switch(players[my_number].type){
		case nvwu: cout<<"女巫\n";break;
		case yuyanjia: cout<<"预言家\n";break;
		case cunmin: cout<<"村民\n";break;
		case langren:cout<<"狼人\n";break;  
		case lieren:cout<<"猎人\n"; break;  
		case shouwei:cout<<"守卫\n";break;
	}
	change_daytime();
	system("pause");
	system("cls");
	cout<<"游戏加载中.";int ppppp=rand()%3+2;
	for(int i=0;i<ppppp;i++){
		for(int j=0;j<6;j++){
			cout<<".";
			Sleep(rand()%100+150);
		}   
		cout<<"\b\b\b\b\b\b      \b\b\b\b\b\b";
	}   
	print();
} 
 
/*每一天开始前的操作*/
void something_before_everyday(){
	change_night();
	system("cls");
	print();
	gotoxy(0,7);
	cout<<"________________________";
	gotoxy(0,8);
	color(white);
	cout<<"天黑~请闭眼~~~\n";
}
 
/*守卫操作*/
int shouweishou=0;
int ShouWei(){
	color(blue);
	cout<<"守卫~请睁眼~~\n";
	Sleep(1500);
	cout<<"你要守护的是?\n";
	if(players[my_number].type==shouwei&&players[my_number].die_or_life == life){
		cin>>shouweishou;
		while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){
			cout<<"请重新输入！\n";
			cin>>shouweishou;
		}
		cout<<"你今晚要守护的是"<<shouweishou<<"号\n";
		Sleep(1500); 
		shouweishou--;
	}else{
		if(players[idxshouwei].die_or_life == life){
			shouweishou=rand()%10;
			while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){
				shouweishou=rand()%10;
			}
		}
	}   
	Sleep(2000);
	cout<<"守卫请闭眼"<<endl<<endl;
	return shouweishou;
} 
 
/*狼人操作*/
int LangRen(){
	int langrensha=-1;
	color(red);
	cout<<"狼人~请睁眼~~~\n";
	Sleep(1500);
	cout<<"你们今晚要杀~谁~~??\n";
	if(players[my_number].type==langren&&players[my_number].die_or_life == life){
		cin>>langrensha;
		while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_life==life)){
			cout<<"请重新输入!\n";
			cin>>langrensha;
		}
		cout<<"你们今晚要杀的是"<<langrensha--<<"号\n";
		Sleep(3500);
	}else{
		while(langrensha==-1 || players[langrensha].die_or_life == die || players[langrensha].type==langren){
			langrensha=rand()%player_number;
		}
		Sleep(3000);
	}
	cout<<"狼人请~闭眼~~\n\n";
	return langrensha;
}
 
/*女巫操作*/
int nvwujiu=0,nvwudu=0,is_nvwujiu=0,is_nvwudu=0;
int NvWu(int langrensha){
	color(purple);
	cout<<"女巫~~请睁眼~~\n";
	Sleep(2000);
	if(players[my_number].type==nvwu&&players[my_number].die_or_life == life){
		if(is_nvwujiu) 
			cout<<"你已经用过解药\n",Sleep(1500);
		else
		{
			cout<<"今晚"<<langrensha+1<<"号死了,你想用解药吗？(1想 / 2不想)\n";
			int is_nvwujie=0;
			cin>>is_nvwujie;
			while(is_nvwujie!=1&&is_nvwujie!=2){
				cout<<"请重新输入\n";
				cin>>is_nvwujie;
			} 
			if(is_nvwujie==1) {
				Sleep(1000);
				cout<<"已经解救"<<langrensha+1<<"号\n";
				nvwujiu=langrensha;
			}
			is_nvwujiu=1;
		}
		Sleep(1500);
		if(::is_nvwudu) cout<<"你已经用过解药\n",Sleep(1500);
		else
		{
			cout<<"你想用毒药吗？（1想 / 2不想）\n";
			Sleep(1500);
			int is_nvwudu=0;
			cin>>is_nvwudu;
			while(is_nvwudu!=1&&is_nvwudu!=2){
				cout<<"请重新输入\n";
				cin>>is_nvwudu;
			}   
			if(is_nvwudu==1){
				Sleep(1500);
				cout<<"你想毒谁？\n"; 
				cin>>nvwudu;
				while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_life==life)){
					cout<<"请重新输入\n";
					cin>>nvwudu; 
				}
				nvwudu--;
				Sleep(1500);
				cout<<"已经毒死了"<<nvwudu+1<<"号\n";
			}
			::is_nvwudu=1;
		}   
	}else{
		if(players[idxnvwu].die_or_life == life){
			if(!is_nvwujiu)
			{
				int is_jiu=rand()%8;
				if(is_jiu==0){
					nvwujiu=langrensha;
					is_nvwujiu=1;
				}   
			}
			if(!is_nvwudu)
			{
				int is_du=rand()%4;
				if(is_du==0){
					int num=rand()%player_number;
					nvwudu=num;
					is_nvwudu=1;
				}
			}
		}
		
	} 
	cout<<"女巫~请闭眼~~\n\n";
	return nvwujiu*10000+nvwudu;//传回两个变量，“加密”操作 
}
 
int yuyanjiabixutoupiao=-1;
/*预言家操作*/
void YuYanJia(){
	color(green);
	cout<<"预言家~请睁眼~~\n";
	Sleep(2000);
	if(players[my_number].type==yuyanjia&&players[my_number].die_or_life == life){
		cout<<"请问你想查验谁的身份\n";
		int p;
		cin>>p;
		while(!(p>=1&&p<=player_number)){
			cout<<"请重新输入！\n";
			cin>>p;
		}
		Sleep(2000);
		cout<<p<<"号的身份是——";
		Sleep(1000);
		if(players[p-1].type == langren){
			cout<<"狼人\n";
			players[p-1].is_light = 1;
		}else{
			cout<<"好人\n";
			players[p-1].is_light = 2;
		}
	}else{
		int p=-1;
		while(p==-1||players[p].die_or_life==die||p==idxlieren)
			p=rand()%player_number;
		if(players[p].type==langren)//锁定目标! 
		{
			yuyanjiabixutoupiao=p;
		}
	}
	cout<<"预言家~~请闭眼~~\n";
}
 
/*黑夜操作*/
int LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; 
void Night(){   
	LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; 
	
	//如果有12人局，添加守卫 
	if(player_number==12){
		SHOUWEISHOU=ShouWei();
		Sleep(2000);
	} 
	/*狼人部分*/
	LANGRENSHA=LangRen();
	Sleep(3500);
	/*女巫部分*/ 
	int nvwu=NvWu(LANGRENSHA);
	NVWUDU=nvwu%10+nvwu/10%10;
	NVWUJIU=nvwu/10000%10+nvwu/100000%10;
	Sleep(3000);
	/*预言家部分*/
	YuYanJia();
	Sleep(2000);
}
 
/*猎人操作*/
void Lieren(){
	int lierendai=-1;
	cout<<idxlieren+1<<"号是猎人\n";
	
	players[idxlieren].is_light = 1;
	Sleep(1000);
	if(idxlieren==my_number){
		cout<<"你想带走几号？\n";
		cin>>lierendai;
		while(lierendai<1||lierendai>player_number||players[lierendai].die_or_life==die){
			cout<<"请重新输入！\n";
			cin>>lierendai;
		}
		lierendai--;
	}else{
		lierendai=rand()%player_number;
		while(players[lierendai].die_or_life == die){
			lierendai=rand()%player_number;
		}
	}
	Sleep(2000);
	cout<<"猎人选择带走"<<lierendai+1<<"号\n";
	Sleep(2000);
	players[lierendai].die_or_life = die;
}
 
void police_die();
/*判断谁死了*/
void panduansiwang(){
	system("cls");
	print(); 
	gotoxy(0,7);
	cout<<"________________________\n";
	Sleep(3000);
	color(white);
	cout<<"天亮了\n";
	Sleep(2000);
	gotoxy(0,9);
	cout<<"昨晚";
	bool is_die[15]={false},is_die_lieren=false,flag=false;
	for(int i=0;i<player_number;i++)
	{
		if(players[i].die_or_life==life)
		{
			if(i==LANGRENSHA||i==NVWUDU) {
				if(players[i].type==lieren) is_die_lieren=true;
				players[i].killer= (i==LANGRENSHA ? langren:nvwu);
				players[i].die_or_life=die;
				is_die[i]=true;
			}
			if(i==SHOUWEISHOU||i==NVWUJIU) {
				if(players[i].type==lieren) is_die_lieren=false;
				players[i].killer=-1;
				players[i].die_or_life=life;
				is_die[i]=false;
			}   
		}
	}
	bool is_police_die=false;
	for(int i=0;i<player_number;i++)
	{
		if(is_die[i])
		{
			if(flag) cout<<"和"<<i+1<<"号";
			else cout<<i+1<<"号",flag=true;
			if(i==idx_police) 
				is_police_die=true;
		}
	}
	if(flag) cout<<"死了\n";
	else cout<<"是平安夜\n";
	
	if(is_die_lieren) Lieren();
	if(is_police_die) police_die();
}
 
/*选警长*/
void choose_police(){
	system("cls");
	print();
	color(blue);
	gotoxy(0,7);
	cout<<"________________________\n";
	color(yellow);
	cout<<"下面开始选举警长，各位不能选举自己~\n";
	int tong[100]={0},cannot[100],must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
	memset(cannot,-1,sizeof(cannot));
	CHOOSE:
	color(yellow);
	Sleep(1500);
	for(int i=0;i<player_number;i++)
	{
		if(players[i].die_or_life==life&&!is_include(cannot,i,player_number))
		{
			if(i==my_number)
			{
				cout<<"你要选举几号？\n";
				int n;
				cin>>n;
				while(n<1||n>player_number||n==i+1||players[n-1].die_or_life==die||!is_include(must,n-1,player_number))
				{
					cout<<"请重新输入!\n";
					cin>>n;
				}
				cout<<i+1<<"号选举"<<n--<<"号\n";
				tong[n]++;
			}
			else
			{
				int n=rand()%player_number;
				while(n==i||players[n].die_or_life==die||!is_include(must,n,player_number))
					n=rand()%player_number;
				cout<<i+1<<"号选举"<<n+1<<"号\n";
				tong[n]++;
			}
			Sleep(1500);
		}
	}
	int idx_max=-1,maxn=-1,len=0;
	for(int i=0;i<player_number;i++)
		if(maxn<tong[i])
		{
			maxn=tong[i];
			idx_max=i;
		}
	int maxn_arr[15]={0};
	for(int i=0;i<player_number;i++)
	{
		if(tong[i]==maxn)
		{
			maxn_arr[len++]=i;
		}
	}
	color(blue);
	if(len>1)
	{
		for(int i=0;i<len;i++)
		{
			if(i==len-1)
			{
				cout<<maxn_arr[i]+1<<"号平票\n"; 
			}
			else
			{
				cout<<maxn_arr[i]+1<<"号,";
			}
		}
		for(int i=0;i<len;i++)
			cannot[i]=maxn_arr[i];
		for(int i=0;i<player_number;i++)
		{
			if(is_include(cannot,i,len))
				must[i]=i;
			else
				must[i]=-1;
		}
		color(white);
		goto CHOOSE;
	}
	cout<<"恭喜"<<idx_max+1<<"号当选警长\n";
	Sleep(3000);
	idx_police=idx_max;
	return;
}
 
/*投票*/
int toupiao(){
	int tong[100]={0},cannot[100]={},must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; 
	memset(cannot,-1,sizeof(cannot));
	gotoxy(0,7);
	color(blue);
	cout<<"________________________\n";
	color(white);
	cout<<"下面进入投票环节\n";
	memset(tong,0,sizeof(tong));
	Sleep(2000);
	TOUPIAO:
	for(int i=0;i<player_number;i++){
		if(players[i].die_or_life == life&&!is_include(cannot,i,player_number)){
			if(i==my_number){
				color(white);
				cout<<"你要投几号？\n";
				int n;
				cin>>n;
				while(!(n>=1&&n<=player_number&&is_include(must,n-1,player_number))){
					cout<<"请重新输入！\n";
					cin>>n;
				}
				Sleep(2000);
				cout<<setw(2)<<my_number+1<<"号投了"<<setw(2)<<n<<"号";
				if(my_number==n-1) color(red),cout<<"快来看！这有个疯子投自己！"; 
				if(i==idx_police) color(yellow),cout<<"(警长)\n"; else cout<<"\n";
				if(i==idx_police) tong[n-1]++;
				tong[n-1]++;
			}else{
				color(white);
				int t=-1;
				while(t==-1 || players[t].die_or_life == die || t==i || !is_include(must,t,player_number)){
					if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1)
					{
						t=yuyanjiabixutoupiao;
						yuyanjiabixutoupiao=-1;
						continue;
					}
					t=rand()%player_number;
					if(is_include(idxlangren,i,nlangren))
					{
						if(players[t].type == langren)
							t=-1;
					}
				}
				cout<<setw(2)<<i+1<<"号"<<"投了"<<setw(2)<<t+1<<"号";
				if(i==idx_police) cout<<"(警长2票)\n"; else cout<<"\n";
				if(i==idx_police) tong[t]++;
				tong[t]++;  
			}
			
			Sleep(rand()%1000+1000);
		}
	}
	int idx_max=-1,maxn=-1,len=0;
	for(int i=0;i<player_number;i++)
		if(maxn<tong[i])
		{
			maxn=tong[i];
			idx_max=i;
		}
	int maxn_arr[15]={0};
	for(int i=0;i<player_number;i++)
	{
		if(tong[i]==maxn)
		{
			maxn_arr[len++]=i;
		}
	}
	color(blue);
	if(len>1)
	{
		for(int i=0;i<len;i++)
		{
			if(i==len-1)
			{
				cout<<maxn_arr[i]+1<<"号平票\n"; 
			}
			else
			{
				cout<<maxn_arr[i]+1<<"号,";
			}
		}
		for(int i=0;i<len;i++)
			cannot[i]=maxn_arr[i];
		for(int i=0;i<player_number;i++)
		{
			if(is_include(cannot,i,len))
				must[i]=i;
			else
				must[i]=-1;
		}
		color(white);
		goto TOUPIAO;
		
	}
	
	cout<<idx_max+1<<"号"<<"出局\n";
	Sleep(4000);
	players[idx_max].die_or_life = die;
	players[idx_max].killer = good;
	return idx_max;
}
 
/*警长死亡*/
void police_die(){
	color(yellow);
	int type;
	if(idx_police==my_number)
	{
		Sleep(1550);
		cout<<"你是想撕毁警徽还是移交警徽？（撕毁输入1，移交输入2)";
		
		cin>>type;
		while(!(type==1||type==2))
		{
			cout<<"请重新输入！\n";
			cin>>type;
		}
	}
	else{
		type=rand()%3+1;
	}
	if(type==1)
	{
		cout<<"警长选择撕毁警徽\n";
		Sleep(1000);
		idx_police=-1;
	}
	else
	{
		int lucky=-1;
		while(lucky==-1||players[lucky].die_or_life==die)
			lucky=rand()%player_number;
		cout<<"警长选择把警徽移交给"<<lucky+1<<"号\n";
		Sleep(1500);
		idx_police=lucky; 
	}
}
 
/*故事的最后*/
void the_end(){
	system("cls");
	switch(is_end()){
		case 1:cout<<"好人胜利\n\n"; break;
		case 2:cout<<"狼人胜利\n\n"; break;
		case 3:cout<<"本局平局\n\n"; break;
	}
	for(int i=0;i<player_number;i++){
		cout<<i+1<<"号位:\t";
		switch(players[i].type){
			case nvwu: cout<<"女巫\t";break;
			case yuyanjia: cout<<"预言家\t";break;
			case cunmin: cout<<"村民\t";break;
			case langren:cout<<"狼人\t";break;
			case lieren:cout<<"猎人\t"; break;  
			case shouwei:cout<<"守卫\t";break;  
		} 
		cout<<"最终";
		switch(players[i].killer){
			case nvwu:cout<<"被女巫毒死\n"; break;
			case langren:cout<<"被狼人杀死\n"; break;
			case good:cout<<"被投票出局\n"; break;
			case lieren:cout<<"被猎人带走\n";break;
			default :cout<<"存活\n";
		}
		cout<<endl;
	}
}
 
/*主函数*/
int main(){
	int wheel=0; 
	before_game();
	while(!is_end()){
		//黑夜准备 
		something_before_everyday();
		Sleep(1500); 
		
		//黑夜部分 
		Night(); //进入黑夜！ 
		change_daytime(); //换天 
		
		//天亮了 
		panduansiwang();//判断谁死了 
		Sleep(2000);
		system("cls");
		print();
		if(is_end()) break;
		
		//选警长 
		if(!wheel&&player_number==12)
		{
			choose_police();
			system("cls");
			print();
		}
		
		//投票环节 
		int idx_max=toupiao();//票数最多的人 
		if(idx_max==idx_police){
			police_die();
		}
		if(players[idx_max].type==lieren){//启动猎人程序 
			Lieren();
			if(is_end()) break;
		}
		system("cls");
		print(); 
		wheel++;
	}
	
	the_end();
	system("pause");
	return 0;
}

学霸" " lsast user 点我吖< ![image](file://C:/Users/DD/Downloads/avatar(5).png) 逐梦卌Naomi 点开你不配点开 📕 image hydor Line 58, Column 59

          .======.
          | INRI |
          |      |
          |      |
 .========'      '========.
 |   _      xxxx      _   |
 |  /_;-.__ / _\  _.-;_\  |
 |     `-._`'`_/'`.-'     |
 '========.`\   /`========'
          | |  / |
          |/-.(  |
          |\_._\ |
          | \ \`;|
          |  > |/|
          | / // |
          | |//  |
          | \(\  |
          |  ``  |
          |      |
          |      |
          |      |
          |      |

\ _ \| // |// _ // _ ^ ^^ ^`^ ^`^^ ^^ ^ `^](https://www.baidu.com/baidu?ie=utf-8&wd=唐人探案街3)

该用户不懒，但这里啥也没写

MessageBox

范宸睿我要去东戴河今天和明天不在家上不了号 --刘仁杰

https://h5-static.talk-cloud.net/static/szbdjy_4.16.0.43/ asset/1c95c78f76425ca1a383.gif LsFcriq6JDAnM97nLAl_Y phone.gif CPC 比赛显示: https://h5-static.talk-cloud.net/static/szbdjy_4.16.0.43/asset/1c95c78f76425ca1a383.gif$0 https://file:///C:/Users/DD/Desktop/1c95c78f76425ca1a383.gif Waiting 评测：评测请求正在等待被评测机抓取 Fetched 评测：评测请求已被评测机抓取，正在准备开始评测 Compiling 评测：正在编译中 Judging 评测：编译成功，正在评测中 (AC)Accepted 通过：程序输出完全正确 (WA)Wrong Answer 不通过：程序输出与标准答案不一致（不包括行末空格以及文件末空行） (TLE)Time Limit Exceeded 不通过：程序运行时间超过了题目限制 (MLE)Memory Limit Exceeded 不通过：程序运行内存空间超过了题目限制

(CE)Compile Error 不通过：编译失败
(SE)System Error 错误：系统错误（如果您遇到此问题，请及时在讨论区进行反馈）
Canceled 其他：评测被取消
(UKE)Unknown Error 其他：未知错误
Ignored 其他：被忽略

test 🆗 http://lvmaojun.com/huaji/

          .======.
          | INRI |
          |      |
          |      |
 .========'      '========.
 |   _      xxxx      _   |
 |  /_;-.__ / _\  _.-;_\  |
 |     `-._`'`_/'`.-'     |
 '========.`\   /`========'
          | |  / |
          |/-.(  |
          |\_._\ |
          | \ \`;|
          |  > |/|
          | / // |
          | |//  |
          | \(\  |
          |  ``  |
          |      |
          |      |
          |      |
          |      |

\ _ \| // |// _ // _ ^ ^^ ^`^ ^`^^ ^^ ^ ^ _______ / ) /_____ | ______ ( ' ) / / __\ _____ |. '| / | \ | / )) |____|/ |-----' /)) -----' ------' _______ / ) / | ______ ( ' ) / / \ _____ |. '| / | \ | / )) ||/ |-----' /_____)) -----' ------' __ __ __ __ __ /__/__/__/__/__/| /__/__/__/__/__/|/ |__'__'__'__'__|/ __ __ __ __ __ /__/__/__/__/__/| /__/__/__/__/__/|/ |__'__'__'__'__|/ __ __ __ __ __ /__/__/__/__/__/| /__/__/__/__/__/|/ |__'__'__'__'__|/ __ __ __ __ __ /__/__/__/__/__/| /__/__/__/__/__/|/ |__'__'__'__'__|/ __ __ __ __ __ /__/__/__/__/__/| /__/__/__/__/__/|/ |__'__'__'__'__|/ __________________,............., /_/_/_/_/_/_/_/_/,-', ,. -,-,--/| /_/_/_/_/_/_/_/,-' // /-| / /--/ / /_/_/_/_/_/_/,-' -''--' ' '--/ / /_/_/_/_/_/_,:................../ / |________,' |/ """""""""""""""""""""""' __________________,............., /_/_/_/_/_/_/_/_/,-', ,. -,-,--/| /_/_/_/_/_/_/_/,-' // /-| / /--/ / /_/_/_/_/_/_/,-' -''--' ' '--/ / /_/_/_/_/_/_,:................../ / |________,' |/ """""""""""""""""""""""' ___ ___ ___ ___ ___.---------------. .'\__\'\__\'\__\'\__\'\__, . ____ ___
|/ __/ __/ __/ / _:\ |. \ \___ \ \\'\__\'\__\'\__\'\__\'\_.|"". \ \___ \ \\/ __\/ __\/ __\/ __\/ __: \ \\'\__\'\__\'\__\ \__\'\_;----------------- \/ / / / / : | |;| ___ ___ ___ ___ .---------------. .'_'_'_'_'_, . ____ ___ \ |\/ __\/ __\/ __\/ __\/ _:\ |. \ _
\'_'_'_'_'_.__|"". \ ___
\/ __/ __/ __/ __/ __:
\'_'_'_\ _'_;----------------- \\/ \/ \/ \/ \/ : | \|______________________;________________| ___ ___ ___ ___ ___.---------------. .'\__\'\__\'\__\'\__\'\__, . ____ ___
|/ __/ __/ __/ / _:\ |. \ \___ \ \\'\__\'\__\'\__\'\__\'\_.|"". \ \___ \ \\/ __\/ __\/ __\/ __\/ __: \ \\'\__\'\__\'\__\ \__\'\_;----------------- \/ / / / / : | |;| .-. ,'/ //
/// // /) /// // //| /// // /// /// // /// (: // /// ;: /// / /::/ / / ' / / (_/ ..................____________,..............., / .-. , ,.--. .-,/_/_/_/_/_/,-', ,. -,-,-- /| / / /- // / / ._/_/_/_/,-' // /-| / /-- / / / -' ' '--' '-'_'/_/_/,-' -''--' `' '-- / / /..................'//,:.................. / / | .'|||; -情人节礼物 | / """"""""""""""""" '"""""""""""""""""""'

           💖💖💖💖                   💖💖💖💖 
          💖💖💖💖💖💖           💖💖💖💖💖💖
         💖💖💖💖💖💖💖💖   💖💖💖💖💖💖💖💖
        <!-- 💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
        💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
         💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
          💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
            💖💖💖💖💖💖💖💖💖💖💖💖💖💖
             💖💖💖💖💖💖💖💖💖💖💖💖💖
                 💖💖💖💖💖💖💖💖💖💖
                   💖💖💖💖💖💖💖💖
                      💖💖💖💖💖💖
                         💖💖💖💖
                            💖💖 -->
                             💖

              💖💖                        💖💖
           💖💖💖💖                   💖💖💖💖 
          💖💖💖💖💖💖           💖💖💖💖💖💖
         💖💖💖💖💖💖💖💖   💖💖💖💖💖💖💖💖
        💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
        💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
         💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
          💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
            💖💖💖💖💖💖💖💖💖💖💖💖💖💖
             💖💖💖💖💖💖💖💖💖💖💖💖💖
                 💖💖💖💖💖💖💖💖💖💖
                   💖💖💖💖💖💖💖💖
                      💖💖💖💖💖💖
                         💖💖💖💖
                            💖💖
                             💖

              💖💖                        💖💖
           💖💖💖💖                   💖💖💖💖 
          💖💖💖💖💖💖           💖💖💖💖💖💖
         💖💖💖💖💖💖💖💖   💖💖💖💖💖💖💖💖
        💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
        💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
         💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
          💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖
            💖💖💖💖💖💖💖💖💖💖💖💖💖💖
             💖💖💖💖💖💖💖💖💖💖💖💖💖
                 💖💖💖💖💖💖💖💖💖💖
                   💖💖💖💖💖💖💖💖
                      💖💖💖💖💖💖
                         💖💖💖💖
                            💖💖
                             💖

3.#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }#include using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; cout<<b; return 0; }

通过的题目
B1001

B1002

B1003

B1004

B1007

B1008

B1009

B1010

B1016

B1020

B1021

B1022

B1023

B1031

B1033

B1034

B1036

B1037

B1038

B1039

B1041

B1042

B1043

B1044

B1045

B1046

B1047

B1048

B1049

B1052

B1053

B1054

B1055

B1057

B1062

B1065

B1066

B1067

B1068

B1069

B1086

B1091

B1094

B1095

B1096

B1097

B1099

dxc00003

B1103

B1104

B1107

B1110

B1111

B1112

B1119

B1129

B1136

B1138

B1144

B1148
B1150

B1156

B1158

B1159

B1170

B1183

B1204

B1210

B1291

B1310

B1319

B1364

B1400

B1407

B1414

CSPJ2019B

CSPJ2019C

CSPJ2020A

CSPJ2020B

CSPJ2022A

NOIPJ2016B

NOIPJ2015A

NOIPJ2005A

P550

555

Z1001

W1008

W1011

W1027

W1031

W1037

hm1201

hm1701

hm1702

hm1802

hm4601

hm4801

hm2001

hm0201

hm0202

W1001

hm2101

hm2102

hm2202

hm2301

hm2401

hm2402

hm2801

hm2901

hm3201

hm3202

hm3401

hm3501

hm3601

hm3602

xwj001

G1030

G1036

G1041

DC0003
B220

TZ0003

TZC001

772

782

799

P1

P10

P102

P11

P117

P118

P12

P13

P132

P14

P143

P146

P15

P16

P17

P18

P19

P2

P20

P208

P21

P22

P225

P250

P26

P282

P293

P3

P4

P42

P436

P448

P5

P57

P6

P62

P64

P7

P71

P76

P8

P80

P81

P82

P83

P84

P85

P9

P94

P97

hm6601

hm3310

1324

G102901
G102902

kx1101

hm3402

G103002

T1542

1387

CSPJ2019A

1399

B223

NG001

TEST1

hm4102

1438

1440

1441

B378

1472

1475

1483

1493

1496

1529

1555

hm4302

1561

G103701

G103702

G104501

G104502

G105301

G105302

G106101

G106102

G106901

G106902

1575

1577

hm4402

1585

hmm2101

1602

hmm4402

1623

1636

1659

1664

1670

1671

1678

1705

1722

1723

hm4602

1753

1759

1760

1804

1805

Tdg01
最近活动

一本通编程启蒙: 50
CSP-J: 7
字符串: 5
for循环: 4
2019: 3
2020: 3
排序: 3
搜索: 3
枚举: 3
NOIP 普及组: 3
数组: 3
数据结构: 3
for循环双重嵌套: 3
GESP: 3
GESP二级: 3
结构体: 2
continue: 2
循环: 2
队列: 2
其他: 2

范宸睿 (景泰四7班范宸睿)

个人简介

通过的题目

最近活动

题目标签

状态

开发

支持

范宸睿 (景泰四7班范宸睿)

个人简介

通过的题目

最近活动

题目标签

状态

开发

支持

还没有账户？

登录