C / C++ / MFC

#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;
struct vehiculo
{
    char VIN[8]
    char hora[19]
};
int main()
vehiculo cocheentrante
{
    File *F;
    File *G;

    //Abrir archivo de Excel

    F = fopen("C:\Users\Ford\Usuarios\Cristales\VINES.csv", "rt");

    if (F == NULL)
    {
        cout << "No se pudo abrir el archivo de entrada. \n";
    }
    else
    {
        cout << "El archivo se abrio correctamente. \n";
    }

    //Crear archivo txt

    G = fopen("dd_mm_aaaa__hh_mm_ss.txt","w");

    if((G = fopen("dd_mm_aaaa__hh_mm_ss.txt","w"))!= NULL)
    {

    //Leer archivo de excel

        while(!feof(F))
        {
            fgets(VIN,8,F);
            fgets(hora,19,F);
            fprintf(G, "%s %s", &VIN, &hora);
        }
    }
    fclose(G);
    fclose(F);
}

// 0-1 knapsack problem using Divide & Conquer
#include <iostream>
#include <climits>
using namespace std;

// Values (stored in array v)
// Weights (stored in array w)
// Number of distinct items (n)
// Knapsack capacity W
int knapSack(int v[], int w[], int n, int W)
{
// Stopping conditions
	// Condition 1: Negative capacity
	if (W < 0)
		return INT_MIN;

	// Condition 2: No items left or capacity becomes 0
	if (n < 0 || W == 0)
		return 0;

// Cases of solving
	// Case 1: Take an item, use recursion for capacity (W - item's weight) and (No. of items - 1)
	int include = v[n] + knapSack(v, w, n - 1, W - w[n]);

	// Case 2. Take out the current item n from the knapsack. Use recursion for the remaining items (n - 1)
	int exclude = knapSack(v, w, n - 1, W);

	// return maximum value we get by including or excluding current item
	return max (include, exclude);
}

int main()
{
	// Input: set of items each with a weight and a value
    // Change it to any numbers you wish
    int n;
    cout<<"Enter number of items:";
    cin>n;
    for (int i=0; i<n; i++) {
        cout<<"Enter the value of item number "<< i <<"\n";
        cin>>v[i];
        cout<<"Enter the weight of item number "<< i <<"\n";
        cin>>w[i];
    }

	// Knapsack capacity, put it as you wish
    int W;
    cout<<"Enter the capacity of knapsack"<<"\n";
    cin>>W;


	cout << "Knapsack value is " << knapSack(v, w, n - 1, W);

	return 0;
}