Commit ae8adc28d3439bc86d737c6c74d25cf7d085066d
1 parent
b29dd2ce0f
Exists in
main
Updating the directory NumberTheoryandCombinatorics.
Showing 2 changed files with 57 additions and 57 deletions Inline Diff
NumberTheoryandCombinatorics/ProjectEuler/SummationOfPrimes/SumPrimes.cpp
View file @
ae8adc2
| File was created | 1 | // | ||
| 2 | // Created by ronal on 2/12/2023. | |||
| 3 | // Problem description link. | |||
| 4 | // https://www.hackerrank.com/contests/projecteuler/challenges/euler010/problem | |||
| 5 | ||||
| 6 | #include <bits/stdc++.h> | |||
| 7 | #define N 1000000 | |||
| 8 | ||||
| 9 | using namespace std; | |||
| 10 | ||||
| 11 | bool isPrime(unsigned long long n){ | |||
| 12 | ||||
| 13 | if(n == 2 || n == 3){ | |||
| 14 | return true; | |||
| 15 | ||||
| 16 | }else if(n <= 1 || n % 2 == 0 || n % 3 == 0){ | |||
| 17 | return false; | |||
| 18 | }else{ | |||
| 19 | for(int i = 5; i * i <= n; i += 6){ | |||
| 20 | if(n % i == 0 || n % (i + 2) == 0){ | |||
| 21 | return false; | |||
| 22 | } | |||
| 23 | } | |||
| 24 | } | |||
| 25 | return true; | |||
| 26 | } | |||
| 27 | ||||
| 28 | void PrimesNumbers(vector<unsigned long long> &primes, unsigned long long size){ | |||
| 29 | unsigned long long sum = 0; | |||
| 30 | for(unsigned long long i = 0; i < primes.size(); i++){ | |||
| 31 | if( primes[i] <= size){ | |||
| 32 | sum += primes[i]; | |||
| 33 | }else{ | |||
| 34 | break;; | |||
| 35 | } | |||
| 36 | } | |||
| 37 | cout << sum << "\n"; | |||
| 38 | } | |||
| 39 | ||||
| 40 | int main(){ | |||
| 41 | ios_base::sync_with_stdio(false); | |||
| 42 | cin.tie(NULL); | |||
| 43 | vector<unsigned long long> primes; | |||
| 44 | unsigned long long t, n; | |||
| 45 | for(unsigned long long i = 0; i <= N; i++){ | |||
| 46 | if(isPrime(i)){ | |||
| 47 | primes.push_back(i); | |||
| 48 | } | |||
| 49 | } |
NumberTheoryandCombinatorics/SummationOfPrimes/SumPrimes.cpp
View file @
ae8adc2
| // | 1 | File was deleted | ||
| // Created by ronal on 2/12/2023. | 2 | |||
| // Problem description link. | 3 | |||
| // https://www.hackerrank.com/contests/projecteuler/challenges/euler010/problem | 4 | |||
| 5 | ||||
| #include <bits/stdc++.h> | 6 | |||
| #define N 1000000 | 7 | |||
| 8 | ||||
| using namespace std; | 9 | |||
| 10 | ||||
| bool isPrime(unsigned long long n){ | 11 | |||
| 12 | ||||
| if(n == 2 || n == 3){ | 13 | |||
| return true; | 14 | |||
| 15 | ||||
| }else if(n <= 1 || n % 2 == 0 || n % 3 == 0){ | 16 | |||
| return false; | 17 | |||
| }else{ | 18 | |||
| for(int i = 5; i * i <= n; i += 6){ | 19 | |||
| if(n % i == 0 || n % (i + 2) == 0){ | 20 | |||
| return false; | 21 | |||
| } | 22 | |||
| } | 23 | |||
| } | 24 | |||
| return true; | 25 | |||
| } | 26 | |||
| 27 | ||||
| void PrimesNumbers(vector<unsigned long long> &primes, unsigned long long size){ | 28 | |||
| unsigned long long sum = 0; | 29 | |||
| for(unsigned long long i = 0; i < primes.size(); i++){ | 30 | |||
| if( primes[i] <= size){ | 31 | |||
| sum += primes[i]; | 32 | |||
| }else{ | 33 | |||
| break;; | 34 | |||
| } | 35 | |||
| } | 36 | |||
| cout << sum << "\n"; | 37 | |||
| } | 38 | |||
| 39 | ||||
| int main(){ | 40 | |||
| ios_base::sync_with_stdio(false); | 41 | |||
| cin.tie(NULL); | 42 | |||
| vector<unsigned long long> primes; | 43 | |||
| unsigned long long t, n; | 44 | |||
| for(unsigned long long i = 0; i <= N; i++){ | 45 | |||
| if(isPrime(i)){ | 46 | |||
| primes.push_back(i); | 47 | |||
| } | 48 | |||
| } | 49 |