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

大牛们帮下哪错了!!或者给组测试数据

Posted by 20054953 at 2007-05-09 15:31:25 on Problem 1411
#include<iostream>
using namespace std;

main()
{
	
	int prime[168]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
    double ab;
	int wild,len,m,a,b,i,k,max;
	while(cin>>m>>a>>b)
	{
		if(m==a&&a==b&&b==0)
			break;
		ab=(double)a/b;
		wild=(int)(m*b/(a+b));
		for(i=167;i>=0;i--)
		{
			if(prime[i]<=wild+1)
				break;
		}		
		max=0;
		for(;i>=0;i--)
		{
			if(prime[i]*prime[i]<=max)
				break;
			for(k=i;k>=0;k--)
			{
				if((double)prime[k]/prime[i]<ab)
					break;
				if(prime[i]*prime[k]<=m&&(double)prime[k]/prime[i]>=ab)
				{
					if(prime[i]*prime[k]>max)
					{
						max=prime[i]*prime[k];
						wild=prime[i];
						len=prime[k];
					}
					break;
				}
			}
		}
		cout<<len<<" "<<wild<<endl;     
	}	
}

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