SilverNebula的博客

/*UVa 11292 Dragon of Loowater*/#include#include#include#includeusing namespace std;int n,m;int main(){ while(scanf("%d%d",&n,&m) && n!=0 && m!=0){ int i; int a[20050]={0};/

一个匹配左右括号的问题/*UVa 673 Parentheses Balance*/#include#include#include#include#includeusing namespace std;char c[500];int n;int pd(char q,char e){ if(q=='(' && e==')')return 1; if(q=='[' && e

UVa 101 The Blocks Problem一道纯模拟题The Problem The problem is to parse a series of commands that instruct a robot arm in how to manipulate blocks that lie on a flat table. Initially there are nbl

#include#include#include#include#includeusing namespace std;int n;bool bal(int &w){ int w1,w2,d1,d2; bool b1=1,b2=1; scanf("%d%d%d%d",&w1,&d1,&w2,&d2); if(!w1)b1=bal(w1); if

算概率的小题

KMP