fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. bool isPrimeSqrt(int N) {
  5. 	for(int i = 2; i*i <= N; i++)
  6. 		if(N%i == 0)
  7. 			return false;
  8. 	return true;
  9. }
  10.  
  11. bool isPrime[1000000];
  12. int primes[1000000], primecount = 0;
  13. vector<int> vprimes;
  14.  
  15. void sieve(int N) {
  16. 	// initialization = ngeset awalnya by default semua prima
  17. 	memset(isPrime, true, sizeof(isPrime));
  18. 	isPrime[0] = isPrime[1] = false;
  19. 	// sieve = penyaringan semua komposit, per faktor prima
  20. 	for(int i = 2; i*i <= N; i++)
  21. 		// kalo si faktor prima masi prima
  22. 		if(isPrime[i])
  23. 			// coret semua kelipatan i
  24. 			for(int j = i*i; j <= N; j+=i)
  25. 				isPrime[j] = false;
  26. 	// memasukkan bil2 prima ke array
  27. 	// 0 1 2 3 4 5 6 7 8 9 10 11 12 ...
  28. 	// F F T T F T F T F F F  T  F  ...
  29. 	// vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
  30. 	// 0 1 2 3 4  5  ...
  31. 	// 2 3 5 7 11 13 ...
  32. 	for(int i = 2; i <= N; i++)
  33. 		if(isPrime[i]) {
  34. 			primes[primecount++] = i;
  35. 			vprimes.push_back(i);
  36. 		}
  37. 	return;
  38. }
  39.  
  40. int fpb(int a, int b) {
  41. 	if(b == 0) return a;
  42. 	return fpb(b, a%b);
  43. }
  44.  
  45. int kpk(int a, int b) {
  46. 	return a/fpb(a,b)*b;
  47. }
  48.  
  49. int pascal(int a, int b) {
  50. 	if(b == 0 || b == a) return 1;
  51. 	return pascal(a-1, b)+pascal(a-1, b-1);
  52. }
  53.  
  54. int main () {
  55.  
  56. 	return 0;
  57. }
  58.  
  59. /*
  60. Linier -> O(N)
  61. N = 1 -> rt = 1ms
  62. N = 10 -> rt = 10ms
  63. N = 100 -> rt = 100ms
  64.  
  65. O(sqrt(N))
  66. N = 1 -> rt = 1ms
  67. N = 100 -> rt = 10ms
  68.  
  69. O(1)
  70. N = 1 -> rt = 1ms
  71. N = 100 -> rt = 1ms
  72.  
  73. O(N^2) > O(N log N) > O(N) > O(sqrt(N)) > O(log N) > O(1)
  74.  
  75. memset = memory set
  76.  
  77. contoh: int = 32 bit = 4 byte
  78. _ _ _ _
  79.  0 -> 00000000
  80. -1 -> 11111111
  81.  1 -> 00000001
  82.  
  83. */
  84.  
  85.  
Success #stdin #stdout 0.01s 5296KB
comments (?)
stdin
copy 
100
stdout
copy 
10
https://ideone.com/6pYaVS
language:
C++ (gcc 8.3)
created:
13 days 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!