http://www.staggeringbeauty.com/ 大虫子 https://www.ak-ioi.com/apps/oi-2048/ 华容道 chrome://dino/ 小恐龙 https://littlealchemy2.com/ 小小炼金师 https://2048game.com/ 数字组 https://dimit.me/Fe26/index_zh_CN.html 死铁 http://www.4399.com/ 4399 https://www.mazegenerator.net/ 迷宫 https://lewan.baidu.com/rankland? idfrom=5056&gameSource=mini&gameType=0 百度游戏 [https://deepmess.com/namerena/]名字竞技场 ev.io 枪战游戏 https://www.crazygames.com/game/air-wars-2 飞机 https://www.crazygames.com/game/kirka-io 枪战 https://www.crazygames.com/game/ev-io 枪战 CrazyGames -

https://www.crazygames.com/game/frontwars-io 一个很弱的小垃圾

记忆化搜索的最少硬币 #include<bits/stdc++.h> using namespace std; int a[100005]={0,1,2,1,2,1,2}; int f(int x){ if(x==0)return 0; if(a[x]==0){ if(f(x-1)<f(x-3)&&f(x-1)<f(x-5))a[x]=f(x-1)+1; else if(f(x-3)<f(x-5))a[x]=f(x-3)+1; else a[x]=f(x-5)+1; } return a[x]; } int main(){ int n; cin>>n; cout<<f(n); }

三角形最优路径 #include<bits/stdc++.h> using namespace std; int n,m[1001],a[1001][1001]; int main(){ cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=i;j++)cin>>a[i][j]; } for(i=1;i<=n;i++)m[i]=a[n][i]; for(i=n-1;i>=1;--i) for(j=1;i<=i;++j)m[j]=max(m[j],m[j+1]+a[i][j]) cout<<m[1]; }