Jose Ronaldo da Silva / Competitive-Programming

Download as
Browse Code ยป

Commit ae8adc28d3439bc86d737c6c74d25cf7d085066d

Authored by Ronaldo
1 parent b29dd2ce0f
Exists in main

Updating the directory NumberTheoryandCombinatorics.

Showing 2 changed files with 57 additions and 57 deletions Side-by-side Diff

NumberTheoryandCombinatorics/ProjectEuler/SummationOfPrimes/SumPrimes.cpp View file @ ae8adc2
  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 + }
  50 + cin >> t;
  51 + for(unsigned long long a0 = 0; a0 < t; a0++){
  52 + cin >> n;
  53 + PrimesNumbers(primes, n);
  54 + }
  55 + return 0;
  56 +}
NumberTheoryandCombinatorics/SummationOfPrimes/SumPrimes.cpp View file @ ae8adc2
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   - }
50   - cin >> t;
51   - for(unsigned long long a0 = 0; a0 < t; a0++){
52   - cin >> n;
53   - PrimesNumbers(primes, n);
54   - }
55   - return 0;
56   -}