#include using namespace std;struct Nod{ int x,y; int s,t; char flag[2]; int f;}tom,jerry;int dir[4][2]={-1,0,0,1,1,0,0,-1},n;void findway(Nod* e,int k){ int x,y; x=e->x+e->s*dir[e->f][0]
hdu 4452 Running Rabbits 模擬
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章
AVL樹C實現
happiness_jiazheng
2020-02-24 01:18:15
伸展樹頭文件C語言(splay_tree.h)
happiness_jiazheng
2020-02-24 01:18:15
題目1388:跳臺階
happiness_jiazheng
2020-02-24 01:18:15
題目1015:還是A+B
happiness_jiazheng
2020-02-24 01:18:15
題目1001:A+B for Matrices
happiness_jiazheng
2020-02-24 01:18:15
題目1002:Grading
happiness_jiazheng
2020-02-24 01:18:15
題目1514:數值的整數次方
happiness_jiazheng
2020-02-24 01:18:15
hdu 4451 Dressing 水題
cold__v__moon
2020-02-21 04:51:40
hdu 3657 Game
cold__v__moon
2020-02-21 04:51:40
hdu 4442 Physical Examination 簡單貪心
cold__v__moon
2020-02-21 04:51:39
hdu 4370 0 or 1
cold__v__moon
2020-02-21 04:51:39
AVL樹C實現
happiness_jiazheng
2020-02-24 01:18:15
伸展樹頭文件C語言(splay_tree.h)
happiness_jiazheng
2020-02-24 01:18:15
題目1388:跳臺階
happiness_jiazheng
2020-02-24 01:18:15
題目1015:還是A+B
happiness_jiazheng
2020-02-24 01:18:15