View difference between Paste ID: vSvwPRqf and Wzf0tJw1

 #include <iostream>
 
-void Eliminare (int vector[], int n, const int &k, int *suma)
+void Eliminare (int vector[], const int &n, const int &k, int &numere_eliminate)
 {
 	for (int i = 0; i < n; i = i + k - 1)
-	for (int i = 1; i <= n; i = i + k - 1)
+		if (vector[i] = -1)
-	{
+			i++;
-		vector[i] = 0;
+		else
-		*suma -= i;
+		{
-		for (int j = i; j < n; ++j)
+			vector[i] = -1;
-			vector[j]=vector[j+1];
+			numere_eliminate++;
-		--n;
+		}
-	}
+
 
 void Afisare_pozitie (int vector[], const int &n)
 {
 	for (int i = 0; i < n; ++i)
 		if (vector[i] != -1)
 			std::cout << vector[i];
 
-	int n, k;
+
 
 void Citire_vector (int vector[], const int &n)
- 	int *vector = new int[n];
+
 	for (int i = 0; i < n; ++i)
 		std::cin >> vector[i];
 }
 int main()
-	for (int i = 1; i <= n; ++i)
+
-		cin >> vector[i];
+
 	using std::cin;
-	int suma = n * (n+1) / 2;    //suma elementelor, din care scadem pozitia elementului eliminat,
+
-								 //la final ramanand doar ultimului singurului element din vector
+	int n,k;
-	while (n > 1)
+
-	{
+
-		for (int i =1; i <= n; ++i)
+	int *vector = new int[n];
-			Eliminare (vector,n,k,&suma);
+
-	}
+
-   cout << suma;
+	Citire_vector(vector,n);
-   return 0;
+
 	int numere_eliminate = 0;
 	while (numere_eliminate <= n - 1)
 		Eliminare(vector,n,k,numere_eliminate);
 
 	Afisare_pozitie(vector,n);
 	return 0;
 }