Add files via upload

Author: abhishek-dhnma

Arrays-Max-Value-In-Array.cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+#include <climits>
+
+using namespace std;
+
+int main() {
+
+	int n;
+	cin >> n;
+	int A[n];
+
+	for (int i = 0; i < n; i++)
+	{
+		cin >> A[i];
+	}
+
+	int Max = INT_MIN;
+
+	for (int i = 0; i < n; i++)
+	{
+		Max = max(Max, A[i]);
+	}
+	cout << Max;
+	cout << endl;
+
+	return 0;
+}

Arrays-Selection-Sort.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+
+using namespace std;
+
+int main() {
+	int n;
+	cin >> n;
+	int A[n];
+	for (int i = 0; i < n; ++i)
+	{
+		cin >> A[i];
+	}
+
+
+
+
+	for (int i = 0; i < n; i++) {
+		cout << A[i] << " ";
+	}
+
+	cout << endl;
+
+	return 0;
+}

Arrays-Target-Sum-Pairs.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+using namespace std;
+
+
+void PrintMe(int i , int j, int a[]) // ( A<=B<=C)
+{
+	if (a[i] > a[j] ) {
+
+		cout << a[j] << " and " << a[i] << endl;
+	}
+	else {
+		cout << a[i] << " and " << a[j] << endl;
+	}
+
+}
+
+
+void Sol(int n, int a[], int t) {
+	int sum = 0;
+
+	for (int i = 0; i < n; i++) {
+		for (int j = i + 1; j < n; j++) {
+
+			sum = a[i] + a[j];
+			if ( sum == t ) {
+				PrintMe(i, j, a);
+
+
+			}
+		}
+	}
+}
+
+int main() {
+	int n;
+	cin >> n;
+	int a[n];
+	for (int i = 0; i < n; i++) {
+		cin >> a[i];
+	}
+	int t;
+	cin >> t;
+
+	//OPERATIONS
+	Sol(n, a, t);
+
+}

Arrays-Target-Sum-Triplets.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+
+
+int main() {
+	int n;
+	cin >> n;
+	int a[n];
+	for (int i = 0; i < n; i++) {
+		cin >> a[i];
+	}
+	int t;
+	cin >> t;
+
+	//OPERATIONS
+	int sum = 0;
+
+	// SORT THIS BEFORE SEARCHING FOR TARGET SUM, SO YOU DONT NEED TO SORT AT END :)
+	// I USE IN BUILD FUNC BUT YOU CAN BUILD YOUR OWN
+	sort(a, a + n);
+
+	for (int i = 0; i < n; i++) {
+		for (int j = i + 1; j < n; j++) {
+			for (int k = j + 1; k < n; k++) {
+				sum = a[i] + a[j] + a[k];
+				if ( sum == t ) {
+					//PrintMe(i, j, k, a);
+					cout << a[i] << ", " << a[j] << " " << "and " << a[k] << endl;
+				}
+			}
+		}
+	}
+
+}

Calculate-The-Sum.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+using namespace std;
+int main() {
+
+    int n;
+    cin >> n;
+    int arr[n];
+    for (int i = 0 ; i < n; i++) {
+        cin >> arr[i];
+    }
+    int Q;
+    cin >> Q;
+
+    int b = arr[n - 1];
+
+    //while(Q > 0){
+    for (int i = 0; i < n; i++) {
+
+        arr[i] += arr[i - 1];
+
+    }
+
+
+    for (int i = 0; i < n; i++) {
+        cout << arr[i] << " ";
+    }
+
+}

Check-prime.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+
+
+bool IsPrime(int n){
+
+		for (int i = 2; i <= sqrt(n); i++)
+		{
+			if(n%i==0){
+
+				return false;
+			}
+		}
+
+return true;
+}
+
+
+int main(){
+	int N;
+	cin>>N;
+
+	IsPrime(N) ? cout<<"Prime" : cout<<"Not Prime";
+
+
+
+
+	return 0;
+}

ChewbaccaAndNumber.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+
+	char a[50];
+	cin >> a;
+
+	int i = 0;
+	if (a[i] == '9') {
+		i++;
+	}
+
+	for ( ; a[i] != '\0'; i++ ) {
+
+		int digit = a[i] - '0';
+		int diff = 9 - digit;
+
+		if (diff > digit) {
+			continue;
+		}
+		a[i] = diff + '0';
+	}
+
+
+	cout << a;
+
+	return 0;
+}

Count-Digits.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+
+
+	int n = 5433231;
+	int target = 3;
+	int rem;
+	int sum=0;
+	int count=0;
+
+	
+while( n>0){
+
+	rem = n%10;
+	//cout<<rem<<" ";
+	n = n/10;
+
+	if(rem==target)
+	{
+		count++;
+	}
+}
+
+
+cout<<count;
+
+
+
+
+	return 0;
+}

Fibonacci-Pattern-(Pattern 4).cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+using namespace std;
+
+
+
+int main(){
+
+	int N = 4;
+	int First = 0;
+	int Second = 1;
+	int Next;
+
+
+	for (int i = 0; i < N; i++)
+	{
+
+	for (int j = 0; j <= i; j++)
+	{
+		cout<<First<<" ";
+		Next = First + Second;
+		First = Second;
+		Second = Next;
+	}
+	cout<<endl;
+}
+
+	return 0;
+}

GCD.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	int i;
+	int a = 16;
+	//cin>>a;
+	int b = 24;
+	//cin>>b;
+
+
+	for ( i = min(a, b); i >= 1 ; i--)
+	{
+		if (a % i == 0 && b % i == 0)
+		{
+			break;
+		}
+	}
+
+	cout << i;
+	return 0;
+}

Ganeshas-Pattern.cpp

@@ -0,0 +1,51 @@
+#include <iostream>
+using namespace std;
+/*
+for N = 7
+
+*  ****
+*  *
+*  *
+*******
+   *  *
+   *  *
+****  *
+
+*/
+int main(){
+
+	int N=10;
+
+	for (int i = 1; i <= N/2 ; i++)
+	{
+		cout<<"*  *";
+		if(i==1){
+			cout<<"***";
+		}
+		cout<<endl;
+	}
+	for (int i = 1; i <= N; i++)
+	{
+		cout<<"*";
+	}
+	cout<<endl;
+
+
+	for (int i = 1; i <= N/2; i++)
+	{
+		
+	
+
+	for (int j = 1; j <= N/2; j++)
+	{
+		cout<<" ";
+
+	}
+	
+		cout<<"*  *";
+		cout<<endl;
+
+}
+
+	return 0;
+}