fork download 
  1. #include <iostream>
  2. #include <new>
  3. using namespace std;
  4.  
  5. int main() {
  6. 	long i;
  7. 	bool *x,prime_factors(long);
  8. 	x=new bool[100000]();
  9. 	for(i=2014;i>0;i++)
  10. 		{
  11. 			x[i]=prime_factors(i);
  12. 			if(x[i]==true && x[i-1]==true && x[i-2]==true)
  13. 				{
  14. 					cout<<(i-2);
  15. 					break;
  16. 				}
  17. 		}
  18. 	delete []x;
  19. 	return 0;
  20. }
  21. bool prime_factors(long n)
  22. 	{
  23. 		char *range;
  24. 		int prime_div_count=0;
  25. 		long k,j,temp=n;
  26. 		range=new char[n]();
  27. 		for(k=2;k<=(n/2);k++)
  28. 			{
  29. 				if(range[k]==0)
  30. 					{
  31. 						if(n%k==0)
  32. 							{
  33. 								prime_div_count++;
  34. 								temp/=k;
  35. 							}
  36. 						for(j=k;j<=(n/2);j+=k)
  37. 							range[j]='n';
  38. 					}
  39. 			}
  40. 		if(prime_div_count==0)
  41. 			prime_div_count++;
  42. 		delete []range;
  43. 		return (prime_div_count==3 && temp==1)?true:false;
  44. 	}
Success #stdin #stdout 0.01s 3460KB
comments (?)
stdin 
Standard input is empty
stdout 
2665
https://ideone.com/2YZq4T
(original code posted with sol) https://b...content-available-to-author-only...t.org/problems/end-of-an-era/
language:
C++14 (gcc 8.3)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!