fork(1) download 
  1. #include <iostream>
  2. #include <new>
  3. #include <math.h>
  4. using namespace std;
  5.  
  6. int main() {
  7. 	unsigned long long n,i,j,lcm=1,tmp;
  8. 	const unsigned long long mod=pow(10,9)+7;
  9. 	char *list;
  10. 	cin>>n;
  11. 	list=new char[n+1]();
  12. 	for(i=2;i<=n;i++)
  13. 		{
  14. 			if(list[i]==0)
  15. 				{
  16. 					tmp=i;
  17. 					while(tmp*i<=n)
  18. 						tmp*=i;
  19. 					lcm*=tmp;
  20. 					lcm%=mod;
  21. 					for(j=i;j<=n;j+=i)
  22. 						list[j]='n';
  23. 				}
  24. 		}
  25. 	cout<<lcm;
  26. 	delete []list;
  27. 	return 0;
  28. }
Success #stdin #stdout 0s 3416KB
comments ()
stdin 
1000
stdout 
849686073
https://ideone.com/Tp0YlO
primelist approach in cpp for problem below
language:
C++14 (gcc 8.3)
created:
9 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!