-
个人简介
Cut itof~ You↑ have↓ get↗lost~~
传 送 门
百度~优先搜索~ mythware_super_password
Manbow~~~ WOW!! Duang~↑↓
I·······接下一句; I am the storm that is Aproaching!~!!!!!;
I am FIRE!🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥😡🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥😡🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥😡🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥😡🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥
Burn those who dare to care for me~╰(‵□′)╯😈
fly brocken wings;
I know;
you are steel with me;
I need is a nudge to get me started~;
I wanted blood😭;
I wanted Black↓👿 and White↑😇;
I~Must↑be→the↘↗reathen↗↘
↓why↓~↑→😭😥;You must given up your smiles😡!;
啊🤯🤯🤯🤯🤯
Halanfus意义明确的单向图深搜🍬🍬🌷ψ(._. )>
#include<bits/stdc++.h> //Halanfus到此一游§(* ̄▽ ̄*)§ using namespace std; int n,m,a,b; bool reach,ed[200007]; vector<vector<int> > v(200000); void dfs(int r){ if(ed[r]) return; ed[r]=true; if(!v[r].size()) return; if(!reach){ int s=v[r].size(); for(int i=0;i<s;i+=1){ if(v[r][i]==b){ reach=true; return; } else dfs(v[r][i]); } } else return; } int main(){ cin>>n>>m>>a>>b; int x,y; for(int i=1;i<=m;i+=1){ cin>>x>>y; v[x].push_back(y); } dfs(a); if(reach) cout<<"Yes"; else cout<<"No"; return 0; }
二叉树的前中后综合遍历,试卷上看到的,好用优化一下就搬过来了🍧🍨🍩
#include<bits/stdc++.h> using namespace std; int a[101][3]; bool b[101]; void dfs(int k,int w){ if(w==1) cout<<k<<" ";//前 if(a[k][1]) dfs(a[k][1],w); if(w==2) cout<<k<<" ";//后 if(a[k][2]) dfs(a[k][2],w); if(w==3) cout<<k<<" ";//中 } int main(){ int n,m,t,root; cin>>n; for(int i=1;i<=n;i+=1){ cin>>t; cin>>a[t][1]>>a[t][2]; b[a[t][1]]=1; b[a[t][2]]=1; } for(int i=1;i<=n;i+=1){ if(b[i]==0){ root=i; break; } } dfs(root,1); cout<<endl; dfs(root,2); cout<<endl; dfs(root,3); cout<<endl; return 0; }
Destruction, 3,2,1;
#include<bits/stdc++.h> #include<windows.h> //Halanfus到此一游§(* ̄▽ ̄*)§ /* { 清页 system("clear"); 间停 sleep(以毫秒为单位的时间); } */ using namespace std; void wait(){ Sleep(700); } void nor_pass(){ wait(); system("cls"); } void LQCS_download(){ cout<<"Illusory_radiance_Ion diffusioning...."<<endl;nor_pass(); cout<<"/quantization(start);"<<endl<<"Suces"<<endl;nor_pass(); cout<<"/Accelerated->*transmission;"<<endl;nor_pass(); cout<<"Passing through the atmosphere"<<endl;nor_pass(); cout<<"Connect into computer"<<endl<<"Suces"<<endl;nor_pass(); cout<<"/Uploading(main{include <Computer.Havencia++>});";nor_pass(); } char n; int main(){ cout << "\033[31m这是红色文本\033[0m" << std::endl; Sleep(1000); system("cls"); cout<<"awa"; LQCS_download(); cout<<"-----LQCS++,教学系统装载成功-----"<<endl<<"\033[31mcin any key to start;\033[0m"<<endl; cin>>n; cout<<"*剧情前提*:"<<endl<<"illaget是一位十分高级(并不)的程序员兼画师,由于今天是中秋节,所以他做了一个十分高级(并不)的模拟程序(做着玩的)"<<endl; cout<<"同时,住在月球的kepolik是一位魔法师(十分高级),为了不被发现,经常给意外发现他的人施遗忘咒,由于今天是中秋节,所以他决定降临地球更新他的PhigrOs()"<<endl; cout<<"不幸的是,illaget在他的模拟程序里设计了一个角色刚好叫kepolik,而kepolik会自动将所有写下他名字的人施遗忘咒,所以illaget就失忆了"; cout<<"并且由于illaget在失忆前是用电脑写下的“kepolik”,kerolik又没见过电脑,所以illaget被数据化了,并被困在了自己的程序里"<<endl; cout<<"善良的kepolik知道后十分后悔,决定帮助illaget变回实体,尽管kepolik并不懂信息技术,但他会高级的月球魔法(awa)"<<endl<<endl; nor_pass(); cout<<""; return 0; }
-
通过的题目
-
最近活动
This person is lazy and didn't join any contests or homework.
题目标签
- 初窥门径
- 55
- 顺序结构
- 42
- 分支结构
- 9
- 循环结构
- 5
- 一本通编程启蒙
- 2
- while循环
- 1
- 模拟
- 1
- 略有小成
- 1
- 驾轻就熟
- 1
- 递归
- 1
- 字符串
- 1