#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{
int n,k,t,i;
cout<<„Unesite stranicu jednakostranicnog trougla:“;
cin>>n;
for (i=1;i<=n;i++)
{
for ( k=1;k<=n-i+1;k++)
{cout<<“ „;
}
for ( t=1;t<=i;t++)
{
cout<<„* „;
}
cout<<endl;}

system(„PAUSE“);
return EXIT_SUCCESS;
}

2.nacin

#include<iostream>
#include<cmath>
using namespace std;
main()
{
int n,i,j;
char a[700][700];
cin>>n;
for(i=1;i<=n;i++)
{
for(j=n-i;j<=n+i;j++)
{
if ((n%2)==1) // provjera da li je broj vrsta neparan
if ((i+j)%2==0) a[i][j]=’*’; //ako jeste, staviti znak * na mjesta sa parnim zbirom indeksa
else a[i][j]=’ ‘;
else
if ((i+j)%2==1) a[i][j]=’*’;
else a[i][j]=’ ‘;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n*2-1;j++)
cout<<(a[i][j]);
cout<<endl;
}
return 0;
}