| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
状态空间搜索BFS状态表示: mult对n的余数
状态集合: A = { 0, 1, 2, ..., n-1 }, |A| <= 200
初始状态: 1
终点状态: 0
对状态S的扩展运算为
newS = (10*s)%n;
if ( !used[newS] ) {
queue.push( newS );
used[newS] = true;
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator