BI TP THC HNH MN NGN NG LP TRNH

H v tn: Nguyn Tng Anh.

MSSV:20111125.
Lp: TTT 05-K56.-SBKFET.
Bi 1:
1.1:
#include"iostream.h"
#include"conio.h"
int main()
{

char c;
cout<<" nhap ki tu vao nao:";
cin<<c;
cout<<c;
cout<<int(c);
return 0;

}
1.2:
#include"iostream.h"
#include"conio.h"
int main()
{
double f,c,Xc,pi=3.14;
cout<<" nhap f:"<<"\t";
cin>>f;

cout<<"\n"<<"nhap c:"<<"\t";
cin>>c;
Xc=1/(2*pi*f*c);
cout<<"\n"<<"Xc="<<"\t"<<Xc;

}
1.3:
#include"iostream.h"
#include"conio.h"
int main()
{
char c;
double r1,r2,r3;
cout<<" nhap gia tri lan luot cua 3 dien tro vao nao:";
cin<<r1<<r2<<r3;
cout<<" gia tri cua 3 dien tro neu mac noi tiep:"<<"\t";
cout<<(r1+r2+r3);
cout<<" gia tri cua 3 dien tro neu mac song song:"<<"\t";
cout<<1/(1/r1+1/r2+1/r3);
return 0;

}
Bi 2:
2.1:

#include"iostream.h"
#include"conio.h"
int main()
{
int c,a[100];
float n,i,j,Rtd,m=0;
cout<<" nhap vao so dien tro:";
cin>>n;
for(i=0;i<n;i++)
{
cout<<"bat dau nhap gia tri dien tro >0 nhe";
cout<<"\n"<<"neu gia tri dien tro =<0 thi bat dau lai ct day :D";
cout<<"\n"<<"r"<<i+1<<"=";
cin>>a[i];
if(a[i]<=0)break;

}
cout<<"\n"<<"song song thi nhan : 1 ";
cout<<"\n"<<" noi tiep thi nhan: 0";
cout<<"\n"<<" ban chon:";
cin>>c;
if(c==1)
{
for(i=0;i<n;i++)
m=m+1/(a[i]);

Rtd=1/m;
}
if(c==0)
{
for(i=0;i<n;i++)
m=m+a[i];
Rtd=m;
}
cout<<Rtd;

return 0;

}
2.3:
#include"iostream.h"
#include"conio.h"
int main()
{
float a[100][100],h[100],c[100],S=0;
int i,j,m,n;
cout<<"nhap vao so hang cua ma tran nao";
cin>>m;
cout<<"nhap vao so cot cua ma tran nao:";
cin>>n;

for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cout<<"a"<<"["<<i+1<<"]"<<"["<<j+1<<"]";
cin>>a[i][j];
}
}
for(i=0;i<m;i++)
{h[i]=0;
for(j=0;j<n;j++)
{
h[i]=+a[i][j];
}
}
for(i=0;i<m;i++)
cout<<"tong hang "<<i+1<<h[i]<<"\n";

for(j=0;j<n;i++)
{c[i]=0;
for(i=0;i<n;j++)
{
c[i]=+a[i][j];
}
}

for(i=0;i<n;i++)
cout<<"tong cot"<<i+1<<c[i];

for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
S=+a[i][j];
}
}

return 0;
}
Bi 3:
3.1:
#include"iostream.h"
#include"conio.h"

class Complex
{
private:
double re,im;
public:
Complex(double r=0,double i=0): re(r),im(i){}

Complex(Complex& c): im(c.im),re(c.re){}

public:
Complex operator+(Complex c);
Complex operator-(Complex c);
Complex operator*(Complex c);
Complex operator/(Complex c);
public:
friend ostream& operator<<(ostream& os,Complex& c)
{
os<<c.re<<c.im;
return os;
}
friend istream& operator<<(istream& is,Complex& c)
{
cin>>c.re>>c.im;
return is;
}
};
Complex Complex::operator+(Complex c)
{
return Complex(this->re+c.re, this->im+c.im);
}
Complex Complex::operator-(Complex c)
{
return Complex(this->re-c.re, this->im-c.im);

}
Complex Complex::operator*(Complex c)
{
return Complex(this->re*c.re-this->im*c.im, this->im*c.re-this>re*c.im);
}
Complex Complex::operator-(Complex c)
{

double a=c.re*c.re-c.im*c.im;

return Complex((this->re*c.re+this->im*c.im)/a,(this->im*c.re-this>re*c.im)/a);
}

int main()
{
Complex z,y;
double a;
cin<<z<<y;
cin<<a;
cout<<y<<"+"<<z<<"="<<y+z+a<<"\n";
cout<<y<<"-"<<z<<"="<<y-z<<"\n";
cout<<y<<"*"<<z<<"="<<y*z<<"\n";
cout<<y<<"/"<<z<<"="<<y/z<<"\n";

Cc bi ton sp xp:
// Sort.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"

#include <iostream>
using namespace std;

long long comp;

template <class _T> int LessThan(_T& a, _T& b)
{
comp++;
return (a < b);
}

template <class _T> int Greater(_T& a, _T& b)

{
comp++;
return (a >= b);
}

void Init(int *id, int n)

{
for (int i = 0; i < n; i++)

id[i] = i;
}

template <class _T> void SelectionSort(_T *a, int n, int *id)

{
Init(id, n);
for (int i = 0; i < n - 1; i++)
{
int m = i;
for (int j = i + 1; j < n; j++)
if (LessThan(a[id[j]], a[id[m]])) m = j;
if (m != i) swap(id[i], id[m]);
}
}

template <class _T> void InsertionSort(_T *a, int n, int *id)

{
id[0] = 0;
for (int i = 1; i < n; i++)
{
_T& e = a[i];
int j = i - 1;
while (j >= 0 && LessThan(e, a[id[j]]))
id[j + 1] = id[j--];
id[j + 1] = i;

}
}

template <class _T> void BubbleSort(_T *a, int n, int *id)

{
Init(id, n);
for (int i = 0; i < n - 1; i++)
{
int c = 0;
for (int j = n - 1; j > i; j--)
{
if (LessThan(a[id[j]], a[id[j - 1]]))
{
swap(id[j], id[j - 1]);
c = 1;
}
}
if (c == 0) break;
}
}

template <class _T> int Part(_T *a, int l, int r, int *id)
{
_T& e = a[id[l]];
int i = l + 1, j = r;

while (j >= i) {
while (j >= i && LessThan(a[id[i]], e)) i++;
while (j >= i && (i == j || Greater(a[id[j]], e))) j--;
if (i < j) swap(id[i++], id[j--]);
}
if (j != l)
swap(id[l], id[j]);
return j;
}

template <class _T> void QuickSort(_T *a, int l, int r, int *id)
{
if (l < r)
{
int j = Part(a, l, r, id);
QuickSort(a, l, j - 1, id);
QuickSort(a, j + 1, r, id);
}
}

template <class _T> void QuickSort(_T *a, int n, int *id)

{
Init(id, n);
QuickSort(a, 0, n - 1, id);
}

template <class _T> void BuildHeap(_T *a, int n, int i, int *id)
{
_T& e = a[id[i]];
int k = id[i];
int j = (i << 1) | 1;
while (j < n)
{
if (j + 1 < n && LessThan(a[id[j]], a[id[j + 1]])) j++;
if (Greater(e, a[id[j]])) break;
id[i] = id[j];
i = j; j = (i << 1) | 1;
}
id[i] = k;
}

template <class _T> void HeapSort(_T *a, int n, int *id)

{
Init(id, n);
for (int i = (n >> 1) - 1; i > 0; i--)
BuildHeap(a, n, i, id);
while (n > 1)
{
BuildHeap(a, n, 0, id);
swap(id[0], id[--n]);

}
}

void CompSort(int a[], int n, const char *m)

{
comp = 0;
int *id = new int[n];
cout << m << " . . .\t";

switch (m[0])
{
case 'S':
SelectionSort(a, n, id);
break;
case 'I':
InsertionSort(a, n, id);
break;
case 'B':
BubbleSort(a, n, id);
break;
case 'Q':
QuickSort(a, n, id);
break;
case 'H':
HeapSort(a, n, id);

break;
}

cout << comp << endl;

delete[] id;
}

char *CorrectHoTen(char *s)

{
char last = 32;
int i = 0;

for (char *p = s; *p; p++)

{
char c = *p;
if (c != 32)
{
if (last == 32)
{
if (c >= 'a' && c <= 'z') c -= 32;
}
else
{
if (c >= 'A' && c <= 'Z') c += 32;
}

}
else
{
if (last == 32) continue;
}

s[i++] = last = c;
}
if (last == 32) i--;
s[i] = 0;

return s;
}

int _tmain(int argc, _TCHAR* argv[])

{
int length[] = { 10, 100, 1000, 20000 };
int *a;

for (int l = 0; l < 4; l++)

{
int n = length[l];
a = new int[n];
for (int i = 0; i < n; i++)
a[i] = (rand() % n) + 1;

cout << "n = " << n << endl;

CompSort(a, n, "Selection");
CompSort(a, n, "Insertion");
CompSort(a, n, "Bubble");
CompSort(a, n, "Quick");
CompSort(a, n, "Heap");

delete[] a;

cout << endl;

}

cout << endl; system("pause");

return 0;
}