fork download
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int main(void) {
  5.  
  6. int i,j;
  7.  
  8. //square
  9.  
  10. //vertical 0 to 5
  11. for(i=0;i<5;i++){
  12. //horizontal 0 to 5
  13. for(j=0;j<5;j++){
  14.  
  15. printf(" * ");
  16. }
  17.  
  18. printf("\n");
  19. }
  20.  
  21. //right triangle
  22. for(i=0;i<5;i++){
  23. for(j=0;j<i;j++){
  24. printf(" * ");
  25. }
  26. printf("\n");
  27. }
  28. //diagonal
  29. for(i=0;i<=5;i++){
  30. for(j=0;j<=5;j++){
  31.  
  32. if(i==j)
  33. printf("*");
  34. else
  35. printf(" ");
  36. }
  37. printf("\n");
  38. }
  39. //pyramid
  40. for(i = 1; i <= 5 ;i++){
  41.  
  42. for(j = i; j < 5 ;j++){
  43. printf(" ");
  44. }
  45.  
  46. for(j = 1; j <= (2 * i - 1) ;j++){
  47. printf("*");
  48. }
  49.  
  50. printf("\n");
  51. }
  52.  
  53. //circle
  54. float dist;
  55. int radius = 5;
  56.  
  57. //vertical i from 0 to diameter
  58. for (int i = 0; i <= (2 * radius); i++) {
  59.  
  60. //horizontal i from 0 to diameter = 2 * radius
  61. for (int j = 0; j <= (2 * radius); j++) {
  62.  
  63. //formula for dist. from (i,j) to (radius,radius)
  64. //on a grid (i=0,j=0) to (i=2*radius,j=2*radius)
  65. //i = x2, j = y2 radius = y1 = x1
  66. dist = sqrt((i - radius) * (i - radius) + (j - radius) * (j - radius));
  67.  
  68. //print * when distance from (i,j) to (radius,radius) is radius + or - .5
  69. if (dist > radius - 0.5 && dist < radius + 0.5)
  70. printf(" *");
  71. else
  72. printf(" ");
  73. }
  74.  
  75. printf("\n");
  76. }
  77.  
  78. return 0;
  79. }
  80.  
Success #stdin #stdout 0s 9424KB
stdin
Standard input is empty
stdout
 *  *  *  *  * 
 *  *  *  *  * 
 *  *  *  *  * 
 *  *  *  *  * 
 *  *  *  *  * 

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