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

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