From 2d8940783b2ab74de723858092721df375cae64a Mon Sep 17 00:00:00 2001 From: xcyberpunkx0 <53346087+xcyberpunkx0@users.noreply.github.com> Date: Wed, 9 Oct 2019 22:09:44 +0530 Subject: [PATCH 1/7] Create Multiples_of_3_and_5.cpp --- Solutions/Multiples_of_3_and_5.cpp | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Solutions/Multiples_of_3_and_5.cpp diff --git a/Solutions/Multiples_of_3_and_5.cpp b/Solutions/Multiples_of_3_and_5.cpp new file mode 100644 index 0000000..7fb159d --- /dev/null +++ b/Solutions/Multiples_of_3_and_5.cpp @@ -0,0 +1,17 @@ +#include + +using namespace std; + + +int main(){ +int i; long s=0; + + for(i=1;i<1000;i++){ + if((i%3==0)||(i%5==0)){ s+=i;} + } + + + cout<<"Multiples of 3 or 5 below 1000 are : "< Date: Wed, 9 Oct 2019 22:11:05 +0530 Subject: [PATCH 2/7] Create Largest_prime_factor.cpp --- Solutions/Largest_prime_factor.cpp | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 Solutions/Largest_prime_factor.cpp diff --git a/Solutions/Largest_prime_factor.cpp b/Solutions/Largest_prime_factor.cpp new file mode 100644 index 0000000..78e8e4c --- /dev/null +++ b/Solutions/Largest_prime_factor.cpp @@ -0,0 +1,20 @@ +#include +#include +using namespace std; + +int main() +{ + long long i; + long long n=600851475143L; + + for(i=2;i<=sqrt(n);i++) { + while(n%i==0){ + n/=i; + } + } + + + cout<<"Largest prime factor : "<< n; + +return 0; +} From e25c59535e3e5e4798031c50702cbd7529097d60 Mon Sep 17 00:00:00 2001 From: xcyberpunkx0 <53346087+xcyberpunkx0@users.noreply.github.com> Date: Wed, 9 Oct 2019 22:12:05 +0530 Subject: [PATCH 3/7] Create Largest_palindrome_product.cpp --- Solutions/Largest_palindrome_product.cpp | 25 ++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 Solutions/Largest_palindrome_product.cpp diff --git a/Solutions/Largest_palindrome_product.cpp b/Solutions/Largest_palindrome_product.cpp new file mode 100644 index 0000000..a3bb9da --- /dev/null +++ b/Solutions/Largest_palindrome_product.cpp @@ -0,0 +1,25 @@ +#include + +using namespace std; + +int main(){ +long i,j,s=0,n,rw=0,r,q; + + for(i=100;i<1000;i++){ + for(j=100;j<1000;j++){ + n=i*j; q=n; + while(q>0){ + r=q%10; + rw=rw*10+r; + q=q/10; } + + if(rw==n&&n>s){ s=rw; } + + rw=0; + } + } + + cout<<"Largest palindrome 3 digit is : "< Date: Wed, 9 Oct 2019 22:13:09 +0530 Subject: [PATCH 4/7] Create Even_Fibonacci_numbers.cpp --- Solutions/Even_Fibonacci_numbers.cpp | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 Solutions/Even_Fibonacci_numbers.cpp diff --git a/Solutions/Even_Fibonacci_numbers.cpp b/Solutions/Even_Fibonacci_numbers.cpp new file mode 100644 index 0000000..9fc0731 --- /dev/null +++ b/Solutions/Even_Fibonacci_numbers.cpp @@ -0,0 +1,23 @@ +#include + +using namespace std; + +int main(){ + + long a=1,b=2,c=0,s=0; + long n=4000000; + + + + while(c Date: Thu, 10 Oct 2019 00:09:23 +0530 Subject: [PATCH 5/7] Delete Largest_palindrome_product.cpp --- Solutions/Largest_palindrome_product.cpp | 25 ------------------------ 1 file changed, 25 deletions(-) delete mode 100644 Solutions/Largest_palindrome_product.cpp diff --git a/Solutions/Largest_palindrome_product.cpp b/Solutions/Largest_palindrome_product.cpp deleted file mode 100644 index a3bb9da..0000000 --- a/Solutions/Largest_palindrome_product.cpp +++ /dev/null @@ -1,25 +0,0 @@ -#include - -using namespace std; - -int main(){ -long i,j,s=0,n,rw=0,r,q; - - for(i=100;i<1000;i++){ - for(j=100;j<1000;j++){ - n=i*j; q=n; - while(q>0){ - r=q%10; - rw=rw*10+r; - q=q/10; } - - if(rw==n&&n>s){ s=rw; } - - rw=0; - } - } - - cout<<"Largest palindrome 3 digit is : "< Date: Thu, 10 Oct 2019 00:09:34 +0530 Subject: [PATCH 6/7] Delete Largest_prime_factor.cpp --- Solutions/Largest_prime_factor.cpp | 20 -------------------- 1 file changed, 20 deletions(-) delete mode 100644 Solutions/Largest_prime_factor.cpp diff --git a/Solutions/Largest_prime_factor.cpp b/Solutions/Largest_prime_factor.cpp deleted file mode 100644 index 78e8e4c..0000000 --- a/Solutions/Largest_prime_factor.cpp +++ /dev/null @@ -1,20 +0,0 @@ -#include -#include -using namespace std; - -int main() -{ - long long i; - long long n=600851475143L; - - for(i=2;i<=sqrt(n);i++) { - while(n%i==0){ - n/=i; - } - } - - - cout<<"Largest prime factor : "<< n; - -return 0; -} From 5d09a7e710af7e381ba3ecb34d51e04d9834b2d2 Mon Sep 17 00:00:00 2001 From: xcyberpunkx0 <53346087+xcyberpunkx0@users.noreply.github.com> Date: Thu, 10 Oct 2019 00:09:47 +0530 Subject: [PATCH 7/7] Delete Multiples_of_3_and_5.cpp --- Solutions/Multiples_of_3_and_5.cpp | 17 ----------------- 1 file changed, 17 deletions(-) delete mode 100644 Solutions/Multiples_of_3_and_5.cpp diff --git a/Solutions/Multiples_of_3_and_5.cpp b/Solutions/Multiples_of_3_and_5.cpp deleted file mode 100644 index 7fb159d..0000000 --- a/Solutions/Multiples_of_3_and_5.cpp +++ /dev/null @@ -1,17 +0,0 @@ -#include - -using namespace std; - - -int main(){ -int i; long s=0; - - for(i=1;i<1000;i++){ - if((i%3==0)||(i%5==0)){ s+=i;} - } - - - cout<<"Multiples of 3 or 5 below 1000 are : "<