avr39-ripe

triangleMad

Jul 11th, 2019
127
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.61 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. const int maxCord = 9;
  4. int a,b,c,d;
  5. char input='x';
  6.  
  7. using namespace std;
  8. char block=' ';
  9. int main ()
  10. {
  11.     do
  12.     {
  13.     cout<<"Enter figure a, b, c, d, e, f, g, h, i, j or x to exit\n";
  14.     cin>>input;
  15.     if (input == 'a') {a=-1; b=1; c=1; d=1;}
  16.     else if (input == 'b') {a=-1; b=-1; c=1; d=-1;}
  17.     else if (input == 'c') {a=-1; b=1; c=-1; d=1;}
  18.     else if (input == 'd') {a=1; b=-1; c=1; d=-1;}
  19.     else if (input == 'e') {a=-1; b=1; c=1; d=-1;}
  20.     else if (input == 'f') {a=-1; b=-1; c=1; d=1;}
  21.     else if (input == 'g') {a=-1; b=-1; c=-1; d=-1;}
  22.     else if (input == 'h') {a=1; b=1; c=1; d=1;}
  23.     else if (input == 'i') {a=-1; b=-1; c=-1; d=1;}
  24.     else if (input == 'j') {a=1; b=-1; c=1; d=1;}
  25.     else if (input == 'x') {break;}
  26.     else {cout<<"Incorrect input\n"; continue; };
  27.    
  28.     for (int y=0; y < maxCord; y++)
  29.     {
  30.         for (int x = 0; x < maxCord; x++)
  31.         {
  32.             block=' ';
  33.             //(((x+y) >= (maxCord-1) && x >= y) || ((x+y) >= (maxCord-1) && x >= y)) / Main idea of triangles;
  34.             //if ( (a*(x+y) >= a*(maxCord-1) && b*x >= b*y) || (c*(x+y) >= c*(maxCord-1) && d*x >= d*y)) //For triangles
  35.  
  36.             //( (y >= maxCord/2 ) &&  ( x  >= maxCord/2) || ( y >= maxCord/2) &&  (x >= maxCord/2) ) // Main idea of squares
  37.             if ( (a*y >= a*maxCord/2 ) &&  ( b*x  >= b*maxCord/2) || ( c*y >= c*maxCord/2) &&  (d*x >= d*maxCord/2) ) //For squares
  38.             {
  39.                 block='*';
  40.             }
  41.             cout<<' '<<block<<' ';
  42.         }
  43.     cout << endl;
  44.     }
  45.     cout << endl;
  46.     }
  47.     while (input!='x');
  48. }
Advertisement
Add Comment
Please, Sign In to add comment