C / C++ / MFC

errorStruct.lib

Code is here 
// CSiBatchJobMigrationDlg dialog

CSiBatchJobMigrationDlg::CSiBatchJobMigrationDlg(CWnd* pParent /*=NULL*/)
	: CDialog(CSiBatchJobMigrationDlg::IDD, pParent)
{
	//{{AFX_DATA_INIT(CSiBatchJobMigrationDlg)
	m_sDatabase = _T("");
	m_leaveDevRow = TRUE;
	//}}AFX_DATA_INIT
	// Note that LoadIcon does not require a subsequent DestroyIcon in Win32
	m_hIcon = AfxGetApp()->LoadIcon(IDR_MAINFRAME);
	m_pMenu = new CMenu;
}



Giving me error in  below line

	SiBatchJobUpdateDlg updateDlg = SiBatchJobUpdateDlg(this);

Write and test the following function that attempts to remove all occurrences of an item from an array:
intremove(int a[], int& n, int x)
The function searches the first n elements of the array a for the item x. If an x is found, it is removed, all the elements above that position are shifted down, the
array size n is decremented. This is repeated until all occurrences of x in the array are removed and then the total number of elements removed is returned. If x is not
.Write your own Car class. The class data should include:
I.	make (using an array of char),
II.	year,
III.	petrol,
IV.	tankSize,
V.	mpg (miles per gallon),
VI.	owner (using an array of char).
The functions should include:
I.	display,
II.	fillPetrol: pass number of gallons as a parameter and return gallons actually input (before full),
III.	drive: pass distance as a parameter and return distance actually travelled (stopping if empty),
IV.	changeOwner (passing new name as a parameter).
V.	You should also have two constructors (one with and one without parameters) and any other functions needed, such as full() and empty(). (Should these 2 functions be public or private?)
VI.	Put code in the constructors to show when each is called (cout<< "Constructor X called";).
VII.	Write a program to create and use a Car object, making sure it calls all the public functions.

int main()
{
	std::wstring Directory = L"C:\\Windows\\System32\\WDI\\*.*";
	WIN32_FIND_DATA FindData;
	
	HANDLE FINDHANDLE = FindFirstFile(Directory.c_str(), &FindData);

	if (FINDHANDLE != INVALID_HANDLE_VALUE)
	{
		std::cout << "IT WORKED!\r\n";
	}
	else
	{
		std::cout << "DID NOT WORK!\r\n";
		DWORD Error = GetLastError();

		std::cout << "ERROR: " << Error << "\r\n";
	}
}

Hi everyone, I have such a task: "Given an integer square matrix. Determine the minimum among the sums of diagonal elements parallel to the main diagonal of the matrix." I have a code but I have problems compiling a flowchart for it, can you help me with compiling a flowchart or give tips? thanks in advance

#include <stdio.h>
 #include <stdlib.h>
 #include <time.h>
 #define N_MIN -3
 #define N_MAX 5
 int main(int argc, char *argv[]){
 int s,i,j,k,l,s1,t2,t1; 
 int a[5][5];
 srand(time(NULL));
 for(i=0;i<5;i++){
 for(j=0;j<5;j++){
 a[i][j]=rand()%(N_MAX-N_MIN+1)+N_MIN;
 }
 }
    for(i=0;i<5;i++){
    for(j=0;j<5;j++){
    printf("%3d ",a[i][j]);
 }
    printf("\n");
 }
    k=0;
    s=0;
    l=0;
    for (i=0; i<5; i++){
    for (j=0; j<5; j++){
    if (a[i][j]>=0){
    if(a[i][j]%2==0)
    l+=a[i][j];
    k++;
 }
 }
    if (k==5){
    l=l;
 }
    else {
 l=0;
 }
    s=s+l;
    k=0; 
 }
    s1=a[0][5-1];
    for(i=1; i<5; i++){
    t1=t2=0;
    for(j=0; j<5-i; j++){
    t1+=a[i+j][j];
    t2+=a[j][i+j];
 }
    if(t1<s1) s1=t1;
    if(t2<s1) s1=t2;
 }
    printf("vivod %d %d\n", s,s1);
    return 0;
 }