Data Structure: code used to insert and delete a linear table once

# Include <iostream>

# Include <cmath>

# Include <cstring>

# Include <algorithm>

# Include <stack>

# Include <queue>

# Include <cstdio>

Using namespace STD;

Int insertsqlist (INT Weizhi, double Charu, int * t, double B [])
{
Int n = * t, I;
If (Weizhi <1 | Weizhi> n + 1)
Return 0;
Else
{
For (I = n + 1; I> Weizhi; I --)
B [I] = B [I-1];
B [Weizhi] = Charu;
* T = ++ N;
Return 1;
}

}

Int desertsqlist (INT Weizhi, int * t, double B [])
{
Int n = * t, I;
If (Weizhi <1 | Weizhi> N)
Return 0;
Else
{
For (I = Weizhi; I <n; I ++)
B [I] = B [I + 1];
* T = -- N;
Return 1;
}

}

Double A [100], Charu;

Int main ()
{
Int N, Weizhi, I, total;
While (CIN> N)
{
Total = N;
Printf ("Enter % d count", N );
For (I = 1; I <= N; I ++)
Cin> A [I];
Printf ("Please enter the Weizhi where you wowould like to set :");
Cin> Weizhi;
Printf ("Please enter the num that you wowould like to set :");
Cin> Charu;
Int M = insertsqlist (Weizhi, Charu, & total, );
If (M = 1)
{
For (I = 1; I <= total; I ++)
Cout <A [I] <"";
Printf ("\ n ");
}
Else
Printf ("SB! Insert your dick! \ N ");
Printf ("Please enter the Weizhi where you wowould like to delete :");
Cin> Weizhi;
M = desertsqlist (Weizhi, & total, );
If (M = 1)
{
For (I = 1; I <= total; I ++)
Cout <A [I] <"";
Printf ("\ n ");
}
Else
Printf ("SB! Delete your dick! \ N ");
}
Return 0;
}