
模拟
星辰浩宇
路在脚下
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ-3087 Shuffle'm Up(模拟)
A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips,S1andS2, each stack containingCchips. Ea...原创 2019-04-08 21:14:35 · 133 阅读 · 0 评论 -
表达式计算
#include<iostream> #include<stack> #include<cctype> using namespace std; const int N=200; stack<int> s; stack<double> num; char str[N+5]; int main() { double x,y,sum; ...原创 2019-04-09 23:07:47 · 135 阅读 · 0 评论 -
括号匹配
#include<iostream> #include<stack> #include<cstring> using namespace std; stack<int>s; const int N=100; char str1[N+5]; char str2[N+5]; int main() { scanf("%s",str1); int i;...原创 2019-04-10 16:37:59 · 94 阅读 · 0 评论 -
A*算法求解八数码问题
#include <stdio.h> #include <iostream> #include <string.h> #include <string> #include <algorithm> #include <limits> #include <vector> using namespace std; //...原创 2019-07-30 16:38:56 · 1670 阅读 · 0 评论