This article demonstrates the pattern to print the Venus Symbol (An international gender symbol for females).
C++
// C++ code to wish happY Women's DaY #include <bits/stdc++.h> using namespace std; int main() { // Initializing size of // design int n = 5; // Loop to print Circle // (Upper part of design) // Outer loop to // control height of // design for (int i = 0; i <= 2 * n; i++) { // Inner loop to control // width for (int j = 0; j <= 2 * n; j++) { // computing distance of // each point from center float center_dist = sqrt((i - n) * (i - n) + (j - n) * (j - n)); if (center_dist > n - 0.5 && center_dist < n + 0.5) cout << "$"; else cout << " "; } // Printing HappY Women's DaY if (i == n) cout << " " << "HappY Women's DaY"; cout << endl; } // Loop to print lower part // Outer loop to control // height for (int i = 0; i <= n; i++) { // Positioning pattern // Loop for Printing // horizontal line if (i == (n / 2) + 1) { for (int j = 0; j <= 2 * n; j++) if (j >= (n - n / 2) && j <= (n + n / 2)) cout << "$"; else cout << " "; } else { for (int j = 0; j <= 2 * n; j++) { if (j == n) cout << "$"; else cout << " "; } } cout << endl; } } |
Java
// Java code to wish happY Women's DaY import java.io.*; class GFG { public static void main (String[] args) { // Initializing size of // design int n = 5; // Loop to print Circle // (Upper part of design) // Outer loop to // control height of // design for (int i = 0; i <= 2 * n; i++) { // Inner loop to control // width for (int j = 0; j <= 2 * n; j++) { // computing distance of // each point from center float center_dist =(float) Math.sqrt((i - n) * (i - n) + (j - n) * (j - n)); if (center_dist > n - 0.5 && center_dist < n + 0.5) System.out.print("$"); else System.out.print(" "); } // Printing HappY Women's DaY if (i == n) System.out.print(" " + "HappY Women's DaY"); System.out.println(); } // Loop to print lower part // Outer loop to control // height for (int i = 0; i <= n; i++) { // Positioning pattern // Loop for Printing // horizontal line if (i == (n / 2) + 1) { for (int j = 0; j <= 2 * n; j++) if (j >= (n - n / 2) && j <= (n + n / 2)) System.out.print("$"); else System.out.print(" "); } else { for (int j = 0; j <= 2 * n; j++) { if (j == n) System.out.print("$"); else System.out.print(" "); } } System.out.println(); } } } // This code is contributed by vt_m. |
Python3
# Python 3 code to wish HaPpY Women's DaY import math # Initializing size of # design n = 5 # Loop to print Circle # (Upper part of design) # Outer loop to # control height of # design for i in range(0, 2 * n + 1): # Inner loop to control # width for j in range(0, 2 * n + 1): # computing distance of # each point from center center_dist = math.sqrt((i - n) * (i - n) + (j - n) * (j - n)) if (center_dist > n - 0.5 and center_dist < n + 0.5): print("$", end = "") else: print(end = " ") # Printing HappY Women's DaY if (i == n): print(" ","HappY Women's DaY",end = "") print("") # Loop to print lower part # Outer loop to control # height for i in range(0, n+1) : # Positioning pattern # Loop for Printing # horizontal line if (i == int(n / 2) + 1): for j in range(0, 2 * n + 1): if (j >= (n - int(n / 2)) and j <= (n + int(n / 2))): print("$", end = "") else: print(end = " ") else : for j in range(0, 2 * n + 1): if (j == n): print("$", end = "") else: print(end = " ") print("") # This code is contributed by Smitha. |
C#
// C# code to wish happY Women's DaY using System; class GFG { public static void Main () { // Initializing size of // design int n = 5; // Loop to print Circle // (Upper part of design) // Outer loop to // control height of // design for (int i = 0; i <= 2 * n; i++) { // Inner loop to control // width for (int j = 0; j <= 2 * n; j++) { // computing distance of // each point from center float center_dist = (float) Math.Sqrt((i - n) * (i - n) + (j - n) * (j - n)); if (center_dist > n - 0.5 && center_dist < n + 0.5) Console.Write("$"); else Console.Write(" "); } // Printing HappY Women's DaY if (i == n) Console.Write(" " + "HappY Women's DaY"); Console.WriteLine(); } // Loop to print lower part // Outer loop to control // height for (int i = 0; i <= n; i++) { // Positioning pattern // Loop for Printing // horizontal line if (i == (n / 2) + 1) { for (int j = 0; j <= 2 * n; j++) if (j >= (n - n / 2) && j <= (n + n / 2)) Console.Write("$"); else Console.Write(" "); } else { for (int j = 0; j <= 2 * n; j++) { if (j == n) Console.Write("$"); else Console.Write(" "); } } Console.WriteLine(); } } } // This code is contributed by vt_m. |
Javascript
<script> // Initializing size of // design let n = 5; // Loop to print Circle // (Upper part of design) // Outer loop to // control height of // design for (let i = 0; i <= 2 * n; i++) { // Inner loop to control // width for (let j = 0; j <= 2 * n; j++) { // computing distance of // each point from center let center_dist = Math.sqrt((i - n) * (i - n) + (j - n) * (j - n)); if (center_dist > n - 0.5 && center_dist < n + 0.5) document.write("$"); else document.write("  "); } // Printing HappY Women's DaY if (i == n) document.write("  " + "HappY Women's DaY"); document.write("<br>"); } // Loop to print lower part // Outer loop to control // height for (let i = 0; i <= n; i++) { // Positioning pattern // Loop for Printing // horizontal line if (i == Math.floor(n / 2) + 1) { for (let j = 0; j <= 2 * n; j++) if (j >= (n - n / 2) && j <= (n + n / 2)) document.write("$"); else document.write("  "); } else { for (let j = 0; j <= 2 * n; j++) { if (j == n) document.write("$"); else document.write("  "); } } document.write("<br>"); } // This code is contributed by rag2127 </script> |
Output
$$$$$
$ $
$ $
$ $
$ $
$ $ HappY Women's DaY
$ $
$ $
$ $
$ $
$$$$$
$
$
$
$$$$$
$
$
Time complexity: O(n2)
Auxiliary space: O(1)
This article is contributed by Shambhavi Singh and Astha Tyagi.
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
