We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. C
  3. Conditionals and Loops
  4. Printing Pattern Using Loops
  5. Discussions

Printing Pattern Using Loops

Sort by

recency

|

1007 Discussions

|

  • harisainadh1234
     + 0 comments

    include

    int main() { int n; scanf("%d", &n); int size = (2 * n) - 1; int out[size][size]; int i, j;

    // Fill the matrix with the concentric layer numbers
for (i = 0; i < size; i++)
{
    for (j = 0; j < size; j++)
    {
        // Calculate the minimum distance to any edge
        int p = i < size - i - 1 ? i : size - i - 1;
        p = p < (j < size - j - 1 ? j : size - j - 1) ? p : (j < size - j - 1 ? j : size - j - 1);
        out[i][j] = n - p;
    }
}

// Print the matrix with space-separated values
for (i = 0; i < size; i++)
{
    for (j = 0; j < size; j++)
    {
        printf("%d ", out[i][j]);
    }
    printf("\n");
}

return 0;

    }

  • boyrham123
     + 0 comments

    include

    include

    include

    int main() {

        int n;
    scanf("%d", &n);
    for(int lines = 1 - n; lines < n; lines=lines+1)
    {
        int mvp = abs(lines) + 1;
        for(int i = 1 - n; i < n; i=i+1)
        {
            if((abs(i) + 1) > mvp) printf("%d ", abs(i) + 1);
            else printf("%d ", mvp);
        }
        printf("\n");
    }

return 0;

    }

  • turzogamer25
     + 0 comments
    #include<stdio.h>

int main(){
    int n;
    scanf("%d",&n);
    int l=((n-1)*2)+1;
    int matrix[l][l];
    int x=1,i,y=2;
    int mid=n-1;

    for(x;x<n;x++){
        i=0;
        for(i=0;i<l;i++){
            matrix[mid+x][i]=y;
            matrix[mid-x][i]=y;
        }
        i=0;
        for(i=0;i<l;i++){
            matrix[i][mid+x]=y;
            matrix[i][mid-x]=y;
        }
        y++;
    }
    matrix [mid][mid]=1;
    int j=0;
    i=0;

    for (i = 0; i < l; i++) {
        for ( j = 0; j < l; j++) {
            printf("%d ", matrix[i][j]);
        }
        printf("\n");
        j=0;
    }
    return 0;
}

  • hossam_hassan301
     + 0 comments

    include

    include

    include

    include

    int main() { int n; scanf("%d",&n);

    int size = (n*2)-1;
int hub =size;

    for (int row=1 ;row <=n;row++ ){ hub--; for (int col=1;col<=size;col++){

        printf("%d ",n);

    if (row>col && row>1 ){
        if (row>=col){n--;}

    }   
    else if (col>hub  &&row >1&& size !=col  ){n++;}

    }

        printf("\n")  ;  
 }
 int a =n;
 int hub_add=n+1;
 int hub_sub=n-2;
 for (int row=1;row <n;row++){

     a=n;
     for (int col=1;col<=size;col++){
     printf("%d ",a);
     if(row!=n-1){
     if (hub_sub>=col  ){
         a--;
     }
      if (hub_add<=col ){
         a++;

     }
     }
     }
        hub_add++;
        hub_sub--;
              printf("\n");

 }

    }

  • sezzaldiin0
     + 0 comments
    #include <stdio.h>

int main() 
{
    int n;
    scanf("%d", &n);

    int size = 2 * n - 1;

    // Print the pattern
    for (int i = 0; i < size; i++) {
        for (int j = 0; j < size; j++) {
            // Determine the value to print
            int min_distance = i < size - i - 1 ? i : size - i - 1;
            min_distance = j < size - j - 1 ? min_distance < j ? min_distance : j : min_distance < size - j - 1 ? min_distance : size - j - 1;
            printf("%d ", n - min_distance);
        }
        printf("\n");
    }

}