悠悠我心。

摘要： #include#includeusing namespace std;int a[1005][1005];int main(){ int n; while(cin>>n) { a[n][0]=1; for(int i=0;i>m) cout<<a[n][m]<<endl; }} 阅读全文

摘要： DescriptionAfter escaping from Figo's chase, Severus falls into a N * M maze designed by Figo.At first, Severus is located on the grid S. Every second he can only move to the four grids that adjacent to the grid he islocated on. The moment he move to any side of the maze, he will get rid of Figo 阅读全文