sa se afiseze recursiv triunghirile
. ex
1
2 2
3 3 3
4 4 4 4
si
1
1 2
1 2 3
1 2 3 4

#include<iostream>using namespace std;void afis(int k){int i=k;while(i--){ cout<<k<<" ";}cout<<endl;if(k<4){ afis(k+1);}}void afis2(int k){int i=k;int j=1;while(i--){cout<<j<<" ";j++;}cout<<endl;if(k<4){ afis2(k+1);}}
int main()
{ int k=1; afis(k); cout<<"\n----------------"<<endl; afis2(k);}

Answer Link

Bovisio Bovisio · Answer 2 · 2016-03-01T21:32:05+02:00

#include <cstdio>

using namespace std;

int triunghi1(int a,int n)
{
    if(n>a)
    {
        return 0;
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            printf("%i ",n);
        }
        printf("\n");
        triunghi1(a,n+1);
    }
}

int triunghi2(int a,int n)
{
    if(n>a)
    {
        return 0;
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            printf("%i ",i);
        }
        printf("\n");
        triunghi2(a,n+1);
    }
}

int main()
{
    int m;
    scanf("%i",&m);
    triunghi1(m,1);
    triunghi2(m,1);
    return 0;
}
#include <cstdio>

using namespace std;

int triunghi1(int a,int n)
{
    if(n>a)
    {
        return 0;
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            printf("%i ",n);
        }
        printf("\n");
        triunghi1(a,n+1);
    }
}

int triunghi2(int a,int n)
{
    if(n>a)
    {
        return 0;
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            printf("%i ",i);
        }
        printf("\n");
        triunghi2(a,n+1);
    }
}

int main()
{
    int m;
    scanf("%i",&m);
    triunghi1(m,1);
    triunghi2(m,1);
    return 0;
}