I took the input file out simply because i wanted to tackle these code first. After that i will try to handle it.
please i would like to know how to make max_average_gra de compactible with
universities average_grade, should i max_average_gra de as an array?
This is how my code looks as at the moment.
Thanks.
please i would like to know how to make max_average_gra de compactible with
universities average_grade, should i max_average_gra de as an array?
Code:
:\dokumente und einstellungen\paul\eigene dateien\visual studio 2005\projects\matching\matching\matching.cpp(88) : error C2039: 'max_average_grade' : is not a member of 'universities'
Code:
#include "stdafx.h"
#include <iostream>
#include <string>
using namespace std;
struct universities
{
string name;
int places;
double average_grade;
int akzept;
}university;
struct students
{
int id;
universities choice[6];
universities average_grade;
double my_average_grade;
}student;
struct matching_student{
universities match;
students matchd;
}matching;
int _tmain(int argc, _TCHAR* argv[])
{
double max_average_grade;
int i, j, k;
int student_no;
int uni_start;
const int no_of_uni=30;
universities university[no_of_uni];
const int no_of_student=50;
students student[no_of_student];
for(int i=0;i<=30;i++)
{
university[no_of_uni].name=uni_start;
}
for(int j=0;j<50;j++)
{
student[no_of_student].id=student_no;
}
for(int i=0;i<30;i++)
{
for(int j=i+1;j<30;i++)
{
if (university[i].average_grade < university[j].average_grade)
{
max_average_grade=university[j].average_grade;
university[j].average_grade=university[i].average_grade;
university[i].average_grade=max_average_grade;
}
}
}
for(int i;i<=30;i++)
{
for(int j=0;j<=30;j++)
{
cout << university[j].max_average_grade;
university[i].average_grade=university.[j].max_average_grade;
while(university[i].places > 0 && university[i].average_grade)
{
for(int j=0;j<=50;j++)
{
for(int k=0;k<=student[j].choice[6];k++)
{
if(student[j].my_average_grade==university[j].average_grade && student[j].choice[k]==university[i].name)
{
university[i].akzept=student[j].choice[k];
}
}
}
}
--university[i].places;
}
return 0;
}
Comment