阳晨 (看我的是AC)
UID: 5052, 注册于 2024-4-14 14:10:39, 最后登录于 2025-9-16 23:36:27, 最后活动于 2025-9-16 20:31:53.
解决了 360 道题目，RP: 265.8 (No. 27)
-
个人简介
#include<bits/stdc++.h> using namespace std; int main(){ return 0; }
https://ac.xiaosaima.com/file/5052/.avatar.jpg
···''' /############\ /###//aaaaaaaa\\###\ /##<?phpxxooooxxphp?>##\ /#/xxxxoooo.........xxx\#\ /#/xxoo..................\#\ #/xxo..............###....\# /#xo.............######.....#\ #/o......#########..........\# #o..#######..##..............# /#o...........##....###.......#\ #/...###################......\# #....###################.......# #....##.......##......##.......# #....##.......##......##.......# #....##.......##......##.......# #....##.......##......##.......# #....##.......##..#...##.......# #....###......##...#..##.......# #...####......##...##.##......x# #....##.......##....####......x# #.............##.....##......xx# #\............##.............x/# \#............##............xx#/ #............##...........xxx# #\...........##..........xxx/# \#...........##..........xx#/ #\..........#..........xxx/# \#\.........#........xxxx/#/ \#\...............xxxxx/#/ \##\...........xxxxx/##/ \###\\....xxxx//###/ \############/  http://www.heyzxz.me/pcol/ ```#include<bits/stdc++.h> using namespace std; int main(){ //创建一个栈 stack<int> s; //入栈 s.push(888); //获取栈顶元素 cout<<s.top()<<endl; s.push(666); cout<<s.top()<<endl; s.pop(); cout<<s.top()<<endl; cout<<s.size()<<endl; if(s.empty()==1){ cout<<"栈为空"<<endl; }else{ cout<<"栈不为空"<<endl; } return 0; } https://www.deepseek.com/  #include<bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; queue<string> q; for (int i=0;i<n;i++) { string x; cin >> x; q.push(x); } for (int i=0;i<m;i++) { string front=q.front(); q.pop(); q.push(front); } if (!q.empty()) { cout<<q.front(); q.pop(); while(!q.empty()) { cout<<" "<<q.front(); q.pop(); } } return 0; } 基本操作： 1、入栈 push 2、出栈 pop 3、取栈顶元素 top 4、判空 empty 5、获取大小 size 队列(queue)的特点：先进先出 基本操作： 1、入栈 push 2、出栈 pop 3、取队首 front 4、取队尾 back 5、判空 empty 6、获取大小 size deepseek.com                                        -
最近活动
