dibug

.vs/ProjectSettings.json

@@ -0,0 +1,3 @@
+{
+  "CurrentProjectSetting": "No Configurations"
+}

.vs/VSWorkspaceState.json

@@ -0,0 +1,7 @@
+{
+  "ExpandedNodes": [
+    ""
+  ],
+  "SelectedNode": "\\8.cpp",
+  "PreviewInSolutionExplorer": false
+}

1.cpp

@@ -4,37 +4,38 @@
 
 using namespace std;
 
-long long *b;
+long long* b;
 
 long long int factorial(int n)
 {
 	return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n;
 }
 
-long long int *producingTheFactorialFractions()
+long long int* producingTheFactorialFractions()
 {
-    long long b[10];
+	long long* b = new long long[10];
 
-	for (int i = 10; i >= 0; i--)
+	for (int i = 9; i >= 0; i--)
 	{
-		b[i] += (int)pow(factorial(10), 2.0) / (i + 1);
+		b[i] += pow(factorial(10), 2.0) / (i + 1);
 	}
+
 	return b;
 }
 
-void checkZeros(long long *a)
+void checkZeros(long long* a)
 {
 	for (int i = 9; i >= 0; i--)
 	{
-		if (a[i] = 0)
+		if (a[i] == 0)
 			cout << "Zero Found" << endl;
 	}
 }
 
 int main()
 {
 
-	long long int *a;
+	long long int* a;
 	a = producingTheFactorialFractions();
 	checkZeros(a);
 	for (int i = 0; i < 10; i++)
@@ -43,8 +44,4 @@ int main()
 	}
 	delete a;
 
-	cout<<"hello";
-	cout<<"Bye";
-
-
-}
+}

2.cpp

@@ -5,11 +5,11 @@ using namespace std;
 
 // count all the specific char in the whole array of strings
 int countAllSpecificChars(string sArr[], int arrLength, char specificChar) {
-    int count;
-    for (int i = 0; i <= arrLength; ++i)
-        for (int j = 0; j <= sArr[i].size(); ++j)
+    int count = 0;
+    for (int i = 0; i < arrLength; ++i)
+        for (int j = 0; j < sArr[i].size(); ++j)
             // if the jth char of the string is the specific char
-            if (sArr[i][j] = specificChar)
+            if (sArr[i][j] == specificChar)
                 count++;
     return count;
 }
@@ -24,4 +24,4 @@ int main() {
     char findIt;
     cin >> findIt;
     cout << countAllSpecificChars(sArr, 4, findIt);
-}
+}

3.cpp

@@ -3,7 +3,7 @@
 #define MAX_SIZE 200
 int arr[MAX_SIZE];
 
-typedef struct alfa * alfaptr;
+typedef struct alfa* alfaptr;
 
 struct alfa {
 	long long x;
@@ -16,11 +16,16 @@ void push(int x)
 	node = (alfaptr)malloc(sizeof(struct alfa));
 	node->x = x;
 	if (!front)
+	{
 		front = node;
+		rear = front;
+	}
 	else {
 		rear->next = node;
 		rear = node;
 	}
+
+	node->next = NULL;
 }
 
 void pop()
@@ -31,6 +36,7 @@ void pop()
 	else
 	{
 		node = front->next;
+		free(front);
 		front = node;
 	}
 }
@@ -39,98 +45,130 @@ void search(int x)
 	alfaptr node = front;
 	int counter = 0;
 	while (node)
+	{
 		if (node->x == x)
-			printf("%d", counter);
-		else {
-			printf("ERROR2");
-			break;
-		}
+			counter++;
+
 		node = node->next;
+	}
+
+	printf("%d", counter);
 }
 
 void rpop() {//pop last element
-	alfaptr node = front;
-	while (node)
-		node = node->next;
-	free(rear);
-	rear = node;
-}
+	if (!front)
+		return;
 
-void set()
-{
-	alfaptr node = front;
-	for (int i = 0; i < MAX_SIZE && node; i++, node = node->next)
-		arr[i] = node->x;
-}
+	if (front->next == NULL)
+		front = NULL;
+	else
+	{
 
-int size()
-{
-	alfaptr node = front;
-	int count;
-	while (node)
-		count++;node = node->next;
-	return count;
-}
+		alfaptr node = front;
+		while (node->next->next != NULL)
+			node = node->next;
+		alfa* lastNode = node->next;
+		node->next = NULL;
+		rear = lastNode;
+		free(lastNode);
+	}
 
-void show()
-{
-	if (!front) {
-		for (int i = 0; i < MAX_SIZE; i++)
-			printf("%d ", arr[i]);
+	void set()
+	{
+		if (!front)
+			return;
+
+		alfaptr node = front;
+		for (int i = 0; i < MAX_SIZE && node; i++, node = node->next)
+			arr[i] = node->x;
 	}
-	else
+
+	int size()
 	{
-		printf("ERROR3");
+		alfaptr node = front;
+		int count = 0;
+		while (node)
+		{
+			count++; node = node->next;
+		}
+		return count;
 	}
-}
 
-int average()
-{
+	void show()
+	{
+		if (!front) {
+			for (int i = 0; i < MAX_SIZE; i++)
+				printf("%d ", arr[i]);
+		}
+		else
+		{
+			alfaptr node = front;
+			while (node)
+			{
+				printf("%lld ", node->x);
+				node = node->next;
+			}
+		}
+	}
 
-	alfaptr node = front;
-	int sum = 0, count;
-	while (node) {
-		sum += node->x;
-		count++;
-		node = node->next;
+	int average()
+	{
+		if (!front)
+			return 0;
+
+		alfaptr node = front;
+		int sum = 0, count = 0;
+		while (node) {
+			sum += node->x;
+			count++;
+			node = node->next;
+		}
+		return sum / count;
 	}
-	return sum / count;
-}
 
-void main()
-{
-	int cmd;
-	long long int x;
-	while (true)
+	int main()
 	{
-		scanf("%d", &cmd);
-		switch (cmd)
+		int cmd;
+		long long int x;
+		while (true)
 		{
-		case 1://push
-			scanf("%lld", &x);
-			push(x);
-			break;
-		case 2://pop
-			pop();
-			break;
-		case 3://rpop
-			rpop();
-			break;
-		case 4://search
-			scanf("%lld", &x);
-			search(x);
-			break;
-		case 5://set
-			set();
-			break;
-		case 6://show
-			show();
-			break;
-		case 7://size
-			printf("%d", size());
-			break;
-		case 10:
-			exit(0);
+			scanf("%d", &cmd);
+			switch (cmd)
+			{
+			case 1://push
+				scanf("%lld", &x);
+				push(x);
+				break;
+			case 2://pop
+				pop();
+				break;
+			case 3://rpop
+				rpop();
+				break;
+			case 4://search
+				scanf("%lld", &x);
+				search(x);
+				break;
+			case 5://set
+				set();
+				break;
+			case 6://show
+				show();
+				break;
+			case 7://size
+				printf("%d", size());
+				break;
+			case 10:
+				exit(0);
+			}
+
+			printf("\n");
 		}
+
+
+
+		while (size())
+			pop();
+
+		return 0;
 	}
-}

4.cpp

@@ -6,4 +6,5 @@ int main()
     float *ptr2 = ptr1 + 3;
     printf("%f", *ptr2 - *ptr1);
     return 0;
-}
+}
+//doroste

5.cpp

@@ -7,4 +7,5 @@ int main()
     printf("%d\n", (*ptr2 - *ptr1));
     printf("%c", (char)(*ptr2 - *ptr1));
     return 0;
-}
+}
+//doroste

6.cpp

@@ -9,3 +9,4 @@ int main()
 	printf("%d\n", a);
 	return 0;
 }
+//doroste

7.cpp

@@ -7,4 +7,5 @@ int main()
 	p += 2;
 	printf("%d", *p);
 	return 0;
-}
+}
+//doroste

8.cpp

@@ -1,6 +1,6 @@
 #include<stdio.h>
 const char * f(const char **p) {
-	auto q = (p + sizeof(char))[1];
+	const char * q = (p + sizeof(char))[1];
 	return q;
 }
 int main() {