Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

求教1012算法 （提交总是 OTL）

Posted by gonghuapeng at 2008-08-03 10:51:57 on Problem 1012 
1012 joseph问题：
我的算法很“暴力”，从m=k+1开始，“指针”i随m移动，用flag记下i连续指出的k个bad boys
只要遇到前面的任1个good boy 就停止， 输出此时的m 结束；（n是长度，指出一个就减少1）

下面是我的代码：
#include<iostream>
#include<fstream>
using namespace std;
int main(){
	//ifstream cin("1012");
	int k=0;
	while( (cin>>k)&&(k!=0) ){
		for(int m=k+1;;m++){
			int n=2*k,i=0,flag=0;
			while(1){
				i=(i+m-1)%n;
				if(i>=0&&i<k) break;
				else flag++;
				n--;}
			
			if(flag==k) {cout<<m<<endl; break;}
		}
	}
	
	return 0;
}

PS:刚进poj上做题不久，做题很少AC,感觉很郁闷，希望高手能指教。。。
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator