Detail of message

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

three for to solve this problem

Posted by dart at 2008-01-03 16:44:17 on Problem 2739

   for(i=2;i<=prime.size();i++)
		for(j=0;j<prime.size();j++)
		{
			int sum=0;
			for(k=j;k<j+i && k<prime.size();k++)
			{
			    sum+=prime[k];	
			}
			if(sum<10001) result[sum]++;
		}

Followed by:

two is enough! (0) daxiong 2009-03-04 18:49:45
这种思路挺好的 (16) Christole 2009-08-04 15:49:27

Post your reply here:

Home Page Go Back To top