说啥呢 很奇怪，到底是谁？ 管他，书上写着要下矿。 好吧 哇！！！

1.随机迷宫-小游戏 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 2.推箱子-小游戏 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 3.汉诺塔-小游戏 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 4.贪吃蛇-小游戏 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 5.飞机小游戏3.0-小游戏 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 制作: 当心草原上的猎应 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 盗版必究!!!盗版必究!!! 盗版必究!!!

小游戏合集 制作: 当心草原上的猎应 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 盗版必究!!!盗版必究!!! 盗版必究!!! ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 盗版必究!!!盗版必究!!! 盗版必究!!!

也是非常简单好吧 顺便宣传一下团队 AC园区

#include<bits/stdc++.h> using namespace std; const int N = 1e6 + 10; struct node{ int val; int step; }; node a[N]; int n, k; int vis[N]; int main(){ cin >> n >> k; node start = {n, 0}; vis[n] = 1; queue<node> q; q.push(start); while(!q.empty()){ node head = q.front(); if(head.val == k){ cout << head.step; return 0; } int x1 = head.val-1; int x2 = head.val+1; int x3 = head.val*2; if(x1>=0 && x1<=100000 && vis[x1]==0){ node canGo = {x1,head.step+1}; vis[x1] = 1; q.push(canGo); } if(x2>=0 && x2<=100000 && vis[x2]==0){ node canGo = {x2,head.step+1}; vis[x2] = 1; q.push(canGo); } if(x3>=0 && x3<=100000 && vis[x3]==0){ node canGo = {x3,head.step+1}; vis[x3] = 1; q.push(canGo); } q.pop(); } return 0; }

我和“【哟撸撸撸撸撸撸😈】”的小伙伴都在ACGO等你，快用这个专属链接加入我们吧！https://www.acgo.cn/application/1817505248233701376我和“【哟撸撸撸撸撸撸😈】”的小伙伴都在ACGO等你，快用这个专属链接加入我们吧！https://www.acgo.cn/application/1817505248233701376我和“【哟撸撸撸撸撸撸😈】”的小伙伴都在ACGO等你，快用这个专属链接加入我们吧！https://www.acgo.cn/application/1817505248233701376我和“【哟撸撸撸撸撸撸😈】”的小伙伴都在ACGO等你，快用这个专属链接加入我们吧！https://www.acgo.cn/application/1817505248233701376

迷路的小猫

https://join.skype.com/pWH5suMWYKrD

#include<bits/stdc++.h> using namespace std; int dir[4][2] = {{-1, 0},{1, 0},{0, -1},{0, 1}}; char mp[110][110]; int vis[110][110],m,n,flag=0; struct node{ int x,y; char val; }; int main(){ cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>mp[i][j]; } } if(mp[1][1] == '#'){ cout<<"NO"; return 0; } }

小游戏合集 制作: 当心草原上的猎应 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 盗版必究!!!盗版必究!!! 盗版必究!!! ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 盗版必究!!!盗版必究!!! 盗版必究!!!

如题

如题

如题

真的很难，给个点赞关注吧 谢谢

团队招人（点击进入）