12-28 Exercise 1: Pascal triangle

0 like 0 dislike
17.4k views

By using two-dimensional array, write C program to display a table that represents a Pascal triangle of any size. In Pascal triangle, the first and the second rows are set to 1. Each element of the triangle (from the third row downward) is the sum of the element directly above it and the element to the left of the element directly above it. See the example Pascal triangle(size=5) below:

使用二維陣列，寫一個顯示巴斯卡三角形的程式。

Example input1:

5

Example output 1:

    1
   1 1
  1 2 1
 1 3 3 1
1 4 6 4 1

Example input 2:

0

Example output 2:

0

 

[Exercise] Coding (C) - asked in Chapter 8: Arrays by (5.2k points)
ID: 39984 - Available when: Unlimited - Due to: Unlimited
edited by | 17.4k views

102 Answers

0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
int x;
 *  *** *    * *  ***       *
int a[x][x],i,j,k;
if(x == 0)
{
** * ****  * *   *  **   *  ** ** * == 0;
**    *  **  **** **   * **  *  ** ***  ***    ****   *    
}
for(i = 0 ; i < x ; i++)
{
*    * *  *   ** *  ** ** ** ****  = 1 ; k <= x-i-1 ; k++)
* ******* ** *  *** * *   *
*** * *   *  *** * * *   **    *      *   ****    ****  * * *****  ");
 **** ** ***     *****      **
****** *  *  ****   *** *     = 0 ; j <= i ; j++)
** *    **** * ** *   **** * ***

 ****** * ****    **      *****       **** * *   *   *** *    == 0 || j == i)
  * **   ** *      * * **  *****  **   * * *  *  *  ** ** ***** ***** = 1;
  *****  *   **      ** *  ***   ***** **   *  ****  * **** * 
 ***  ** * *    ****  *   * **      * * *  ******  * ** * * * ** *    **** **   **    * *  = a[i-1][j-1] + a[i-1][j];
**   *** ** ********  *   *** * **   **   * ** * ** == 0)
** *     ***    *   * ***** *        **   *          * ** * * ****  ** *  * *   *  ***  **** **  ***   * *  **
**      ** *****  * *   *   * * *** *   **  * ** **   *  **
**   **** * *   *****    * *** **   ***  * ** ****  * *** *** **  ***  *  * ** ** * ***   %d",a[i][j]);
*  **** ** * * ***** ***   

*  * *  *  ***    **  *   **  *    != x-1)
* *   *** **     *  **** ***** *    *  * **    ** *** *       ***  ***
}
*** *  ** * * **    ** ** * **  0;
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
int x;
   * ** *** * ** * ** * **  
int a[x][x],i,j,k;
for(i = 0 ; i < x ; i++)
{
* **   *     * ********** * *  * * * = 1 ; k <= x-i-1 ; k++)
***     * **  *  *   *** 
 * *** **  ********* ** * ***  *   *** **  * * *         * * **  *** ");
*  * ***   ******* *   *   *     
  * * **  *** **     **   *   = 0 ; j <= i ; j++)
*   *  * **** **********
*   *  ****    * * ** *  * * * **   *** *  *** * * * ** * * == 0 || j == i)
*   ***** ***  *  *  * ** **** *** ** *   **** * **   *    * ***** *** *    * * * *  ***  * = 1;
 ** **  * *      *   **        * **** ****    *** **** *  *** **
  *** *     * *** *    ** *****  *** *** **   ****** **** ** * * ** * *** **  * ** = a[i-1][j-1] + a[i-1][j];
* * * **  *   * ** **  *     **  *   **   ** * ** *****    == 0)
*****  *  *  ** * *** *  ***  * *** ** * ** *   * ** *  ****  **  ******* **      **    *** *** ***********   ** 
  *     * ** *** * * **   *   *  *** *  * * **** *   *  ***   *
 ** *** * *  * *   * **   *  * * *** *  *  *       * ******   *  *****  * *    *** *  * %d",a[i][j]);
* * **  ***  * * *   *    **

* **       * **    * *  *    != x-1)
**  * ****      **  **  * ** ***  ****   ********  ** ** *** **** ****   **
}
  **  * ****   **  ** *    *     0;
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
int x;
*** ** * *  ** ***  *** **
int a[x][x],i,j,k;
for(i = 0 ; i < x ; i++)
{
     ** ** * * * ***** *  *   ** = 1 ; k <= x-i-1 ; k++)
   **  ***** * *** ** *  *****
*  *   **  **** ***  **  **     * * *** * ** * ******* ** * *     ******* ** *
 * * *      ****   * * 
* ***** **  *    **** *** * = 0 ; j <= i ; j++)
    {
****  * * ** * * *** ** **  **  **** * * **   ** **  **  == 0 || j == i)
 *   * ** **  **   *  ***    *** * * **  ***  * *** *  ** **   *  ***  * ***   **   = 1;
*   *  * *  *   *   ***  *   *    ** ***  *   * * *      * ** 
* *** * **  *     **    *  **** ** **  * *    *  *  *    *** * * ** *        *   * = a[i-1][j-1] + a[i-1][j];
* * *  **  ***   **    ** *********    *  * *  *    **** ***   * == 0)
 ** *     *   *   ***   *       ****  ***    ** ****      * * **   *** **   * ****  *    ** ***** * *  ** *
* * **  **    ** *     * **      ******** ** *  ***** 
  *   *   ** ** ** *  *** *  * * ***  **   ****   *** **  ***  **  *  **    * * * *  * **  %d",a[i][j]);
 *** ** *** **** *      ****

 * ** *     * * ******** ** * **** != x-1)
  **    *   *   * *   **  * *  **  *  * * ***   ***   ***  **   * *  *** **** * **  *** 
}
    *** ***** **   ***   *    * **   0;
}
answered by (-255 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Correct output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>

int main()
{
    int row, n, k;

   ** *** * *  *  ***** *** * ** * *  **** **   * *   ***
    int pascal[row][row];

    for( n = 0 ; n < row ; n++ )
*   **   *  * **  ***********     **   *******  *   ***     **  *  *   *** * *** *
**   ** *    ** *** ** **  ***     ***** **** **  * *     *        **    **  ** *** ***** ***  ** * *  ** ** * ** = 1 ;
 * **  ***  * * * *  ** *** *** ***  *   **  ***  **  *   **  *  ***  **   * **  * ** ****   *  *   ** **    * * *  *        = 1 ;
   * *  * * *  ****  *  ** *  *  ** *   *     * * * *  *** ** * *       * *  ***  **   
  *     * *  * * ** **    *** ** * *     *     ***   **   * **   **   ***    
****  *  *** *  *     * *   * * * *   ***   * ****  ** ***** ** **  ****** ** *** * ***    *       *  ** * *
   *  *   ***  * *     ** * ** *     *   *  *  ** *   ** ***  * *** **   *****     ** ***     ** *    ** *** ***  *** = pascal[n-1][k-1] + pascal[n-1][k];
* **  * *   ***     ** *  *   * ****** *  * *  *  * *        ** 
    }
**    * ***    * * *** *   *****  *
    * *  **  * * * * *   **  **   **  *   **    ** ** *   * *  
***      * * **   * * * * ***  
    * *****  ******  **  ( n = 0 ; n < row -1  ; n++ )
    {
 *    * *  ***  * *  *  ** *   *** **  ****  * * **** ( k = 0 ; k <  row - 1 - n  ; k++ )
   *   * *  ***** **** *      ** ** *  *  ****** *    *****   **  *  *** ** ** *   *  * *  ");
*** **    **  ** **  * **   **    ** * ***  ** * ** ** * **  ********   ***   
**   *** * **  *  ** *** **  * * **  * * ** *** *   * *    *** *   ***
 ** **  **** *  * ***  * * *** **  * *  * *   *** **  *** **     *** * **   ** * *  * * *  %d",pascal[n][k]);
  *** * **  *      *****   ** *  *    ****     **  *     **     *     ****
    }
  ** ***        *         *  ********  **   **** *    ** ** * *****   ****
** ***** * ***** *****   ***  **  * *  *   ****  *  *****  ** ***    * **   *   ***    ***  *    ** *****     **  * * *
*    * *   *** * * * ****   * *** ***  * ***   *     * **  ***    * **   ** *  * *  * * %d",pascal[n][k]);
    *  * **  * *   ***    **  ******* ** ** * 
   ** **  ******  * *  **   0;
}
answered by (-196 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
int main()
{
int x;
scanf("%d",&x);
int a[x][x],i,j,k;
for(i = 0 ; i < x ; i++)
{
  **      **   *      * ** * = 1 ; k <= x-i-1 ; k++)
  ***   * ** * **  *  * **
  * *  ***** **  **  ****   ** *  *** * *  * *  *** *** ** * ** ******  
    }
  ***         ** * *    **  * == 1 && a[i][i] == 1)
** **   ****** *    ** ****** *   **  *** *  **** * *   *******   = 1;
*  *  * *  *  **   * **** * 
    {
* *****   *    ***  *   *********  *  *  ***  ** *** *  * ** * = 1 ; j < i ; j++)
 ** ***  *  ** ****      *   **  *  *  ******   *  ***
    ** ***** ** ** *****   *****   ***  ***    * ***  *    *  * ** *** * *   **** = a[i-1][j-1] + a[i-1][j];
    **  ** *** **    ** * * **  *****  *****   *     *  ****** * *  **  * * **    **   ** *** *** == 0)
*     ***** **  * **    *        ** * ***    *****  * **   *     * * ***   * ***  *** *  ***  **  ****  * * * *   **   ***** * 
    **** ***   **  ** ****     * * *  ****  *   ***   * *  *  *  * *  * *** * *   **
 *  *  * ** ** * ******  *     *** ****** * **    ** *****   *** * ** * * **  **  * * *       * *****  * **** ** %d",a[i][j]);
           ***** ** ** * *   *  ** ** *  ***  * *   **
 **   * *  * ** ***   * * * 
 * **** **    *  * *     *   ** != x-1)
* **  ******   * **        ***    *   ** ** *** **      ** * ***  
}
    **   * **    *   **** *** * 0;
}
answered by (-255 points)
0 0
prog.c: In function 'main':
prog.c:4:1: warning: implicit declaration of function 'scanf' [-Wimplicit-function-declaration]
 scanf("%d",&x);
 ^~~~~
prog.c:4:1: warning: incompatible implicit declaration of built-in function 'scanf'
prog.c:4:1: note: include '<stdio.h>' or provide a declaration of 'scanf'
prog.c:10:9: warning: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
         printf("*");
         ^~~~~~
prog.c:10:9: warning: incompatible implicit declaration of built-in function 'printf'
prog.c:10:9: note: include '<stdio.h>' or provide a declaration of 'printf'
prog.c:20:17: warning: incompatible implicit declaration of built-in function 'printf'
                 printf("%d",a[i][j]);
                 ^~~~~~
prog.c:20:17: note: include '<stdio.h>' or provide a declaration of 'printf'
prog.c:22:17: warning: incompatible implicit declaration of built-in function 'printf'
                 printf(" %d",a[i][j]);
                 ^~~~~~
prog.c:22:17: note: include '<stdio.h>' or provide a declaration of 'printf'
prog.c:26:9: warning: incompatible implicit declaration of built-in function 'printf'
         printf("\n");
         ^~~~~~
prog.c:26:9: note: include '<stdio.h>' or provide a declaration of 'printf'
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>

int main()
{
    int row, n, k;

*    * ***  * ** *** * * **    **  **  ***** *   ** *** *  * *
    int pascal[row][row];

***             *   *   **** *  n = 0 ; n < row ; n++ )
* * * ***    * * *  **     * *      * ** *   ****** *   *   **** ***     
  *  * ****  * ** **  * ****   *** **    ** **    *  * ** **  * *  *  *  ******  *** *  *    ** *   *** *   * *  *  = 1 ;
*  ***  *  **  *  * ** *    * **** *** *  *  **   * * * **** ***     *  * ** *   **  *   ** *    ***       *         *       = 1 ;
***** * **   * ***    * *  *      *   ***  **  *       ** ****** **   * * * **   **
   *  ****   * ** ****     ***              *** ** * ***    * **** *  
* * *   * ** *    * *   ** *   *   *  * **   * ** * ** **   ** * **** **  *** * ******* *   * ** 
  ****** **  * *    **   * *   *        * ** *      *  **  *  ***  ** *********  ** *  * ***** *  ***** ****  * **  *      = pascal[n-1][k-1] + pascal[n-1][k];
 ***** ** ** ****   ***     ** * ****** *  * * *   *
    }
***  **  * * * *   **  * *    * *   
******** ** ** ***   *****    * *****     *    **** * *    * ** *    *
 *   ****    *** * *    *** 
 ** **     * ** * ***    * **** ( n = 0 ; n < row  ; n++ )
    {
    *           ** ****  *    ***  *** *  * * *  *   **** ( k = 0 ; k <  row - 1 - n  ; k++ )
 *  * ***  *     *   *  ** ** * ** * *   ***** * * *  *   ***  ** *  * * *   * *  ***  *  * ");
* * **** ***     ****  ** ** *****     *  *   * * * *    * *     * *  * ****
  ** *   ** ** * * **** **  * ** * * **** **   ****  ***** ** * * *** ***   
     ***  *  * *        ** ** *   * *      * ***** ***** **   *** *** ***   * *** *  ** **   **  %d",pascal[n][k]);
 *  *  * *   *   * *  ******    * **    ***     * ** **    *  * **    **   ** ***  * *
    }
   * * ******  ** **          ** *    *****
  * **  *   *   *** **  **  0;
}
answered by (-196 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Correct output
commented by (4.3k points)
0 0
You have extra newline at the end of the output
commented by (5.2k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>

long factorial(int);

int main()
{
    int row, n, k;

 *  * * ****  ***** *  ****  * * ** * **  *    * *   ** *
     *  ***   *    * ** * *  *  * pascal[row][row];

 *   * ** **   ** *  ***** *  n = 0 ; n < row ; n++ )
* *** ******* ***  **  **     * ****  *****  **  ***    ** *    ** ** **  
      * *   ****   * *  *  *** ** *  ** * *  ** **  * * * * ****  ** ** ** *****  *   ****** * **  *    * ***   ******    * = 1 ;
 **** *  *   * *  **    ***  **  **** * **   *  **    ** * ** ***** *  * *** ****    * *****   *  ** *  **  = 1 ;
 *   *   **      ****** * *** **  ** *******    ***   **  **  **  *  ***  ***    *  *
****  * * *     **   *********** *   **  ***  *** *** *  *   ** *  * *
  *** * *   *   * * *** *****  *   *  * * *   ***     * ***   **    ** **  **  ** **** **    
*****  * ** *** *  * *   *** ** *   *   **   **    *  * *  ** ** *      ** * * **** ********* *   *** **  ** *   **  = pascal[n-1][k-1] + pascal[n-1][k];
** *  *    **  ***   **  * *****  ** *   **   *   *  * 
    }
* **   * * *  *  * *** ******* * * 
* * ** ** **  **  ***      ***    ***     ***  ** * * * ** **  *   
* ****  *  ******     *
******   *****   * **  ** *     ( n = 0 ; n < row  ; n++ )
    {
    *  ** * *  *** *********  ***** *    *   *  *  *   ** ** ( k = 0 ; k <  row - 1 - n  ; k++ )
  ** *  *  **  *   ***    *  *  ******  *** ** **  * * *  * *  * * **** * **   * *  * * ");
***    *   **** ** *         ** **  * *** **   ** *  * *** **  *  * *** * *  **    
  *  ******    ** *   ** * * *  * **  * **  *********  * * **   *********   
**  ****  * *** ***   * **   * **  *   ***  *    *    *** **  ********* *     **   **    ***  %d",pascal[n][k]);
****   **    *   **  *  *** *** ***   * *** ***  * * ** ***   ***  *** *  ** * *  ***
    }
* ** * **** **  *  ***** ** **  ***  *** ***** 
   * **  *******   *** * *** 0;
}
answered by (-196 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>

long factorial(int);

int main()
{
  **  *** * *** *  *   ** ** * ** row, n, k;

 **  * *******  ** **  ** **    ** *  *** ** * **  *
*****  *   *** *** **     *** pascal[row][row];

 *  *** ****  **  ** **  ** n = 0 ; n < row ; n++ )
  *  *  *  ***  ** ***   **   **  ***   ** ****  ** *** *   *  ** *** *  **    * 
   * *  * *    ** *       *  * *  ****        * * ****   ** ** * **   *** *** * *  ***   *  * *   *  *  ** *   ****  ****   = 1 ;
   **    *  *  * * *****  *  * *   *  *  * * **  *  *  *   *****  **    *   *** *  *** **  *  *** * * *  *  ****   = 1 ;
 *  ****    ** * ** ******   *   *   *  **      ***  * ***   ***********  *   ***  * 
* *     * *  ***  *        * * * * *   **   ****   * * ****     * *** *  **
*** ** **   ****  * *  **  **  *  *   *** *    ** ***** *     **  ***  **** *  ****           *****
**  * *   * *  *** **   *  ** *     ** * *  ******* ** * *  **  **  *    * *      * **     *********  *  *  ** * * = pascal[n-1][k-1] + pascal[n-1][k];
**    *    *  * *  ****  ** *****  * *  ****   *  *   **  
    }

* *   *  **  ** *      **** **    ( n = 0 ; n < row  ; n++ )
    {
 **** *     *   *  *  ****   * ****    * **** **   *** ( k = 0 ; k <  row - 1 - n  ; k++ )
   * * ***  *  ** *    *   ** ** **       *    * *  **    **   ** * * ** *** *    *  ****  ");
******  *   **   **   *   ***  * *    * ** * *** * **  **  **** *  ** * * ****  *  **** * *
*   ***     * *     ***  * **  *  **  ***  *** *  * *  ** *    ** *** * * * 
*   * *   ** * *  *   *****  * **** *    * * ***  * *  **  *  *   * *** * * **  ** *  *  %d",pascal[n][k]);
***  **   * * **  ** *  *   *    *  *  *** **** * ** ** *   
    }
   * ********   *  ** ***  **   0;
}
answered by (-196 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>

int array[100][100]={0};

int main(){
    int n,i,j,k;
    array[0][0]=1;
    scanf("%d",&n);
    if(n==0)
* *** *  *   ** **      *  *  **   * * *  *   *   ** *** ****   **   *   *** * * 

    for(i=1;i<=n;i++)
 **  ** ***  *       **  *******   *   * ** * **** 

*   * **     *** * ***  ***  **  ***    **** *   * * * * *   **  ***** ***   ****   **   ** * 
 * **    *** *      *** ***      *    * ***     * * *  *   *   *  * * ****  * *  * * * *** **  * *    
**** *** **  *   *    **  * * **     **     *****   **  ** ** *  * *  *** *** ** **  * * *   * *   *  ******** ****   *   **  ** ");
 *** ***  *  * *  * ****     *    *  *** ** ****** ** *  *  **  **  *  ** ** *********  ** *  ***   
*****  * *  ***    * *** *   * *   * * * ** **    **   * * ** *     ** *   *   ******
****** * ** *   *    * **  * *  ***  *  **      * ** **    * *  *****  *        ** **   * *** *    *  * **  *  * *

     ** **  * *** **  *** ***   ** * **  * ***** * **   *** *  **  *  ***      ** **   *
*  *      * *** ** * * *    *   *  ** *  *     *** **  **  **** * ****    *   *** ** *  *   ** **   * ***** ** *   

* **  **** *     * * ****  * ** ** *** ** ****  ** ** ** *** ** ****  *   ** *  *     * *  * ** * *     *   *   * *    **   ** * ** * *  * ** ***  *  ** **  ***  *    **
 ***  *** *   **  ***   * ***   *****  *   ** * * ** *    **** *  * *** *  * * *** **   *       *** * *   **  *   * * ***  ** *  *   ** * *  * * * * **  %d",array[i][j]);
* *** * ** *   *   * *        *  *  ** * *  ****  * *****      *** *   * * *    ***  * * * * ** * *****  * *
   **** *   *  ** *  *** ** ** ***   *  * ***  * *****   ***    ** * *  *  *****   ***  * * **   * *           * printf("\n");
**  * *    ***   **      * * **   ** *****  ** ***    

}
answered by (-301 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
*  * *        *  *
int main()
{
**    *   *  * *  * ****   a;
 ** **** ** * * ****  **  *  * * *   ** *** *** ** 
*    *  * ** ** *** * *   *   
 *** **  *  * ****** *   * 
*   *  *  * **  **  ***   *   * **        *  ** * *      **  ***   * ** *  ****
    ***  *  ***   *   *  *****
** * ***  ** ****    * **  * ** if(a==2){
** **** ****  **    *   **      *** ** 1\n");
 ** * **   *   *    * *   *** *  * **  1");
* **   * * * **  **  
    ** **   *  *****      if(a==3){
 *     *    *   * * * * **   ******* **  1\n");
  * *** **** *   *  **  * *  **  ** **   *  1 1\n");
 * *  *     * * *** **  * * *** * * *       2 1");
* * *     *****  ******* *     *

 ** * *** * ****  *   ** **  *  if(a==4){
 ****  * ** *** * *** ***  * *  **   *   *  * ********  * ******  *
*  *** * ** ** **     **   ** **** ** *   1 1\n");
  ** ** **    *  *  ** * **** *   *** * * **  1 2 1\n");
*   **   * *****  ******      * *   ** * 1 3 3 1\n");
* *  *** *  ****** *   *  **   *  * * 4 6 4 1");
  *   * *******    **  * * ***
  * *    **   *   ** * ****** if(a==5){
    ***  * * * * * *  **** **     *** *     **  *   *    *    * **    *  *
*    ** *    * * ***    * ***  *      **** ** ******     1\n");
 ** **  *** * *  ** **   *** *    *  **     1 2 1\n");
**   ********** ** * ** ** *  *  ***  *  1 3 3 1\n");
 *****  *  **  * *  *  * * * * ** ** *  * 1 4 6 4 1\n");
 **  * ***  ******  *  *************   5 10 10 5 1");

   *** * *****     *** * * * *


}
answered by (-329 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Correct output
Case 3: Wrong output
commented by (4.3k points)
Page:
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.130.187
©2016-2025

Related questions

0 like 0 dislike
31 answers
12-28 Exercise 2: Prints a table showing how many time each digit appears
[Exercise] Coding (C) - asked Dec 28, 2017 in Chapter 8: Arrays by semicolon (5.2k points)
ID: 39985 - Available when: Unlimited - Due to: Unlimited | 7.8k views
0 like 0 dislike
55 answers
11-30 Exercise 3: Various filters on an array
[Exercise] Coding (C) - asked Nov 29, 2017 in Chapter 8: Arrays by semicolon (5.2k points)
ID: 34968 - Available when: 2017-11-30 18:00 - Due to: Unlimited | 9.8k views
12,783 questions
183,442 answers
172,219 comments
4,824 users