program code::block >>penghitungan nilai tertinggi .cah ilangall

#include <iostream>                                                     // ALIK SETIAWAN
#include <string.h>                                                     //145 182 410 22
#include <ctype.h>
#include <conio.h>
using namespace std;

struct DaftarNilai
{
    float x;
}
Xn[20];
void input            (struct DaftarNilai Xn[20],int *ws);
void konvers          (struct DaftarNilai Xn[20],int *ws);
void penyelesaian     (struct DaftarNilai Xn[20],int ws);

int main()
{
    int msl;
    input(Xn,&msl);
    konvers(Xn,&msl);
}

void input(struct DaftarNilai Xn[20],int *msl)
{         int i,nilai;
cout<<"\n ±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±\n"
    <<" ±±  ±±±±±±±±                                                      ±±±±±±±±  ±±\n"
    <<" ±±±±±±±±±±±±                MENCARI NILAI TERTINGGI               ±±±±±±±±±±±±\n"
    <<" ±±  ±±±±±±±±                                                      ±±±±±±±±  ±±\n"
    <<" ±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±\n"
    <<"     |                                                                    |\n"
    <<"     |                            ALIK SETIAWAN                           |\n"
    <<"     |                     cahilangall012.blogspot.com                    |\n"
    <<"     |                                                                    |\n"
    <<"  ±±-|-±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±-|-±±\n\n";
    cout<<"\t\t\tMasukan jumlah Xn  : \t\t";cin>>nilai;
    cout<<"  ±±-|±±±±±±±±±±±±±±________________________________________±±±±±±±±±±±±±±|-±±";
                                  *msl=nilai;cout<<"\t";
      for(i=0; i<nilai; i++)
          {
              cout<<"\t\t\tMasukan data X ke-"<<i+1<<" :\t\t";
              cin>>Xn[i].x; cout<<"\n";
          }
}
void konvers(struct DaftarNilai Xn[20],int *msl)
{
    float E=0.2,jumlah=0,xb[10];
    int i,dx=1;   cout<<"\n\n";
        for(i=1; i<=*msl;  i++)
          cout<< "\tX"<<i<<"\t";      cout<<"\n\n\t";
        for(i=0; i<*msl; i++)
          cout<<Xn[i].x<<"\t\t";
      atas:
            dx+=1;  jumlah = 0;
        for(i=0; i<*msl; i++)
            jumlah +=Xn[i].x;          cout<<"\n\t";
        for(i=0; i<*msl; i++)
    {
        Xn[i].x=Xn[i].x-(E*(jumlah-Xn[i].x));
        if(Xn[i].x<=0)
        {
            Xn[i].x=0;
            cout<<Xn[i].x<<"\t\t";
        }
        else
            cout<<Xn[i].x<<"\t\t";
    }
    for (i=0; i<*msl; i++)
    {
        if(Xn[i].x<=0)
            Xn[i].x=0;
        else if(Xn[i+1].x<=0)
            xb[i]=Xn[i+1].x;
        else
        {
cout<<"\n  ±±-|____________________________________________________________________|-±±\n";
            goto atas;
        }
    }
void penyelesaian     (struct DaftarNilai Xn[20],int msl);
    cout<<"\n\n\t\t\t";
    for(i=0; i<*msl; i++)
    {
        if(Xn[i].x>0)
    goto Bawah;
    }
    Bawah:
        cout<<"Nilai X terbesar adalah = "<<Xn[i].x<<"\n";
        cout<<"\t\t\tPenyelesaian Sampai Baris ke-"<<dx<<"\n\n";
cout<<" ±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±\n"
    <<"     |                                                                    |\n"
    <<"     |                             TERIMAKASIH                            |\n"
    <<"     |                     cahilangall012.blogspot.com                    |\n"
    <<"     |                                                                    |\n"
    <<"  ±±-|-±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±±-|-±±\n\n";
}