摘要:
//UVa133 - The Dole Queue#include#define maxn 25using namespace std;int n, k, m, a[maxn];//p为初位置,逆时针走t步,d为-1时顺时针走,返回新位置int go(int p, i... 阅读全文
摘要:
//UVa101 - The Blocks Problem#include#include#include#includeusing namespace std;const int maxn = 30;int n;vectorpile[maxn];//找木块a所在的p... 阅读全文