⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 chitietphuc.cpp

📁 it s a code for calculator the price of a machine which have a lot of parts.
💻 CPP
字号:
// ChiTietPhuc.cpp: implementation of the CChiTietPhuc class.
//
//////////////////////////////////////////////////////////////////////

#include "stdafx.h"
#include "ChiTietPhuc.h"
#include "ChiTietDon.h"
#include "iostream"
using namespace std;

//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////

CChiTietPhuc::CChiTietPhuc()
{
	n=0;
}

CChiTietPhuc::~CChiTietPhuc()
{
	for(int i=0; i<n; i++)
		delete ds[i];
}

void CChiTietPhuc::Nhap()
{
	cout << "Nhap ma so chi tiet phuc: ";
	cin >> maso;
	cout << "Nhap n cua CTP: ";
	cin >> n;
	ds.resize (n);
	int loai;
	for(int i=0; i<n; i++)
	{
		do
		{
			cout << i+1 <<".Nhap loai(0.Don, 1.Phuc): ";
			cin >> loai;
		}
		while (!(loai==0 || loai==1));
		switch(loai)
		{
		case 0:
			ds[i] = new CChiTietDon;
			break;
		case 1:
			ds[i] = new CChiTietPhuc;
			break;
		}
		ds[i]->Nhap();
	}
}

void CChiTietPhuc::Xuat()
{
	printf("{ %ld ",maso);
	for(int i=0; i<n; i++)
	{
		ds[i] -> Xuat();
		cout << " ";
	}
	cout << " }";
}

float CChiTietPhuc::TinhTien()
{
	float s=0;
	for(int i=0; i<n; i++)
		s += ds[i] -> TinhTien();
	return s;
}

int CChiTietPhuc::TimKieu(long ms)
{
	if(maso == ms)	
		return 1;
	for(int i=0; i<n; i++)
	{
		int kq = ds[i]->TimKieu(ms);
		if(kq != -1)
			return kq;
	}
	return -1;
}

int CChiTietPhuc::DemChiTietDon()
{
	int dem=0;
	for(int i=0; i<n; i++)
		dem += ds[i]->DemChiTietDon();
	return dem;
}

CChiTiet* CChiTietPhuc::TimKiem(long ms)
{
	if(maso == ms)
		return this;
	for(int i=0; i<n; i++)
	{
		CChiTiet* kq = ds[i]->TimKiem(ms);
		if(kq != NULL)
			return kq;
	}
	return NULL;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -