winehownine的博客

hdu1312Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of

#include#includeusing namespace std;int mm[10001];int nn[10001];int main(){    int m,n,i,pos,cas=1;    while(cin>>m>>n&&m!=0&&n!=0)    {        for(i=0;i        {            ci

#include#include#include#includeusing namespace std;int ans[100001],vis[100001];queue que;int bfs(int sp,int ep){    que.push(sp);    int i=0,fnp,snp;    ans[sp]=0;    vis[sp]=

#include#include#includeusing namespace std;int a[100005];int n,c;bool judge_num(int x){    int temp=a[0];    int d=1,i;    for(i=1;i    {        if(a[i]-temp>=x)        { 

#include#include#includeusing namespace std;int a[505],b[505],c[505];int ab[505*505];int la,lb,lc;int times,temp;bool judge_num(int l,int r,int x){    int mid;    while(l    {

#includeusing namespace std;int a,b,c=1;void get_ans(){  c=1;  a = a % 10;  while(b>0)  {    if(b % 2 == 1)    c= (c * a) % 10;    b = b/2;    a = (a * a) % 10;  }}int ma