Skip to content

Complete Interview Preparation at 20% off | Use code: PREPAREKARO Check Now

Related Articles

Related Articles

Print squares of first n natural numbers without using *, / and –

View Discussion
Improve Article
Save Article
Like Article
  • Difficulty Level : Medium
  • Last Updated : 02 Dec, 2021

Given a natural number ‘n’, print squares of first n natural numbers without using *, / and -. 
Examples : 
 

Input:  n = 5
Output: 0 1 4 9 16

Input:  n = 6
Output: 0 1 4 9 16 25

We strongly recommend to minimize the browser and try this yourself first.
Method 1: The idea is to calculate next square using previous square value. Consider the following relation between square of x and (x-1). We know square of (x-1) is (x-1)2 – 2*x + 1. We can write x2 as 

x2 = (x-1)2 + 2*x - 1 
x2 = (x-1)2 + x + (x - 1)

When writing an iterative program, we can keep track of previous value of x and add the current and previous values of x to current value of square. This way we don’t even use the ‘-‘ operator.
Below is the implementation of above approach: 
 

C++




// C++ program to print squares of first 'n' natural numbers
// without using *, / and -
#include<iostream>
using namespace std;
 
void printSquares(int n)
{
    // Initialize 'square' and previous value of 'x'
    int square = 0, prev_x = 0;
 
    // Calculate and print squares
    for (int x = 0; x < n; x++)
    {
        // Update value of square using previous value
        square = (square + x + prev_x);
 
        // Print square and update prev for next iteration
        cout << square << " ";
        prev_x = x;
    }
}
 
// Driver program to test above function
int main()
{
   int n = 5;
   printSquares(n);
}

Java



// Java program to print squares
// of first 'n' natural numbers
// without using *, / and
import java.io.*;
 
class GFG
{
static void printSquares(int n)
{
    // Initialize 'square' and
    // previous value of 'x'
    int square = 0, prev_x = 0;
 
    // Calculate and
    // print squares
    for (int x = 0; x < n; x++)
    {
        // Update value of square
        // using previous value
        square = (square + x + prev_x);
 
        // Print square and update
        // prev for next iteration
        System.out.print( square + " ");
        prev_x = x;
    }
}
 
// Driver Code
public static void main (String[] args)
{
    int n = 5;
    printSquares(n);
}
}
 
// This code is contributed
// by akt_mit
Python 3



# Python 3 program to print squares of first
# 'n' natural numbers without using *, / and -
def printSquares(n):
 
    # Initialize 'square' and previous
    # value of 'x'
    square = 0; prev_x = 0;
 
    # Calculate and print squares
    for x in range(0, n):
         
        # Update value of square using
        # previous value
        square = (square + x + prev_x)
 
        # Print square and update prev 
        # for next iteration
        print(square, end = " ")
        prev_x = x
 
# Driver Code
n = 5;
printSquares(n);
 
# This code is contributed
# by Akanksha Rai
C#



// C#  program to print squares
// of first 'n' natural numbers
// without using *, / and
using System;
 
public class GFG{
     
    static void printSquares(int n)
{
    // Initialize 'square' and
    // previous value of 'x'
    int square = 0, prev_x = 0;
 
    // Calculate and
    // print squares
    for (int x = 0; x < n; x++)
    {
        // Update value of square
        // using previous value
        square = (square + x + prev_x);
 
        // Print square and update
        // prev for next iteration
        Console.Write( square + " ");
        prev_x = x;
    }
}
 
// Driver Code
     
    static public void Main (){
        int n = 5;
        printSquares(n);
    }
}
 
// This code is contributed
// by ajit
PHP



<?php
// PHP program to print squares
// of first 'n' natural numbers
// without using *, / and -
 
function printSquares($n)
{
     
    // Initialize 'square' and
    // previous value of 'x'
    $square = 0; $prev_x = 0;
 
    // Calculate and
    // print squares
    for ($x = 0; $x < $n; $x++)
    {
         
        // Update value of square
        // using previous value
        $square = ($square + $x + $prev_x);
 
        // Print square and update
        // prev for next iteration
        echo $square, " ";
        $prev_x = $x;
    }
}
 
    // Driver Code
    $n = 5;
    printSquares($n);
 
// This code is contributed by ajit
?>
Javascript



<script>
// JavaScript program to print squares of first 'n' natural numbers
// without using *, / and -
 
    function printSquares(n)
    {
        // Initialize 'square' and previous value of 'x'
        let square = 0, prev_x = 0;
   
        // Calculate and print squares
        for (let x = 0; x < n; x++)
        {
            // Update value of square using previous value
            square = (square + x + prev_x);
   
            // Print square and update prev for next iteration
            document.write(square + " ");
            prev_x = x;
        }
    }
   
    // Driver program to test above function
 
   let n = 5;
   printSquares(n);
 
// This code is contributed by Surbhi Tyagi
 
</script>
Output:
0 1 4 9 16
Time Complexity: O(n)
Auxiliary Space: O(1)
Method 2: Sum of first n odd numbers are squares of natural numbers from 1 to n. For example 1, 1+3, 1+3+5, 1+3+5+7, 1+3+5+7+9, ….
Following is program based on above concept. Thanks to Aadithya Umashanker and raviteja for suggesting this method.
 
C++



// C++ program to print squares of first 'n' natural numbers
// without using *, / and -
#include<iostream>
using namespace std;
 
void printSquares(int n)
{
    // Initialize 'square' and first odd number
    int square = 0, odd = 1;
 
    // Calculate and print squares
    for (int x = 0; x < n; x++)
    {
        // Print square
        cout << square << " ";
 
        // Update 'square' and 'odd'
        square = square + odd;
        odd = odd + 2;
    }
}
 
// Driver program to test above function
int main()
{
   int n = 5;
   printSquares(n);
}
Java



// Java program to print
// squares of first 'n'
// natural numbers without
// using *, / and -
import java.io.*;
 
class GFG
{
static void printSquares(int n)
{
    // Initialize 'square'
    // and first odd number
    int square = 0, odd = 1;
 
    // Calculate and
    // print squares
    for (int x = 0; x < n; x++)
    {
        // Print square
        System.out.print(square +
                           " " );
 
        // Update 'square'
        // and 'odd'
        square = square + odd;
        odd = odd + 2;
    }
}
 
// Driver Code
public static void main (String[] args)
{
    int n = 5;
    printSquares(n);
}
}
 
// This code is contributed
// by ajit
Python3



# Python3 program to print squares
# of first 'n' natural numbers
# without using *, / and -
 
def printSquares(n):
     
    # Initialize 'square' and
    # first odd number
    square = 0
    odd = 1
     
    # Calculate and print squares
    for x in range(0 , n):
         
        # Print square
        print(square, end= " ")
         
        # Update 'square' and 'odd'
        square = square + odd
        odd = odd + 2
 
# Driver Code
n = 5;
printSquares(n)
 
# This code is contributed
# by Rajput-Ji
C#



// C# program to print squares of first 'n'
// natural numbers without using *, / and -
using System;
 
class GFG
{
static void printSquares(int n)
{
    // Initialize 'square'
    // and first odd number
    int square = 0, odd = 1;
 
    // Calculate and
    // print squares
    for (int x = 0; x < n; x++)
    {
        // Print square
        Console.Write(square + " " );
 
        // Update 'square'
        // and 'odd'
        square = square + odd;
        odd = odd + 2;
    }
}
 
// Driver Code
public static void Main ()
{
    int n = 5;
    printSquares(n);
}
}
 
// This code is contributed
// by inder_verma..
PHP



<?php
// PHP program to print squares
// of first 'n' natural numbers
// without using *, / and -
function printSquares($n)
{
    // Initialize 'square' and
    // first odd number
    $square = 0; $odd = 1;
 
    // Calculate and print squares
    for ($x = 0; $x < $n; $x++)
    {
        // Print square
        echo $square , " ";
 
        // Update 'square' and 'odd'
        $square = $square + $odd;
        $odd = $odd + 2;
    }
}
 
// Driver Code
$n = 5;
printSquares($n);
 
// This code is contributed by m_kit
?>
Javascript



<script>
// Javascript program to print squares of first 'n' natural numbers
// without using *, / and -
 
function printSquares(n)
{
    // Initialize 'square' and first odd number
    let square = 0, odd = 1;
 
    // Calculate and print squares
    for (let x = 0; x < n; x++)
    {
        // Print square
        document.write(square + " ");
 
        // Update 'square' and 'odd'
        square = square + odd;
        odd = odd + 2;
    }
}
 
// Driver program to test above function
let n = 5;
printSquares(n);
 
// This code is contributed by subham348.
</script>
Output : 
 
0 1 4 9 16
Time Complexity: O(n)
Auxiliary Space: O(1)
This article is contributed by Sachin. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
 

My Personal Notes
arrow_drop_up
Previous
Determine whether the given integer N is a Peculiar Number or not
Next

Sum of squares of first n natural numbers
Recommended Articles
Page :
Sum of alternating sign Squares of first N natural numbers
17, Mar 20
Split squares of first N natural numbers into two sets with minimum absolute difference of their sums
02, Dec 20
Sum of squares of first n natural numbers
06, Dec 17
Check if factorial of N is divisible by the sum of squares of first N natural numbers
28, Mar 19
Sum of squares of first n natural numbers
10, Dec 17
Kth element in permutation of first N natural numbers having all even numbers placed before odd numbers in increasing order
03, Mar 21
Print all distinct even and odd prefix Bitwise XORs of first N natural numbers
07, May 21
Average of Squares of Natural Numbers
29, Dec 17
Print all possible K-length subsequences of first N natural numbers with sum N
02, Dec 20
Print all increasing sequences of length k from first n natural numbers
17, Oct 14
Minimize sum of numbers required to convert an array into a permutation of first N natural numbers
14, Jun 21
Bitwise XOR of first N natural numbers that are product of two distinct Prime Numbers
03, Jun 21
Maximize sum of Bitwise AND of same-indexed elements of a permutation of first N natural numbers and a given array
08, Mar 21
Number of M-length sorted arrays that can be formed using first N natural numbers
23, May 21
Difference between Sum of Cubes and Sum of First N Natural Numbers
17, Sep 19
Count unimodal and non-unimodal permutations of first N natural numbers
16, Sep 20
Check if permutation of first N natural numbers exists having Bitwise AND of adjacent elements non-zero
28, Oct 20
Permutation of first N natural numbers having product of Bitwise AND of adjacent pairs exceeding 0
15, Jan 21
Sort a permutation of first N natural numbers by swapping elements at positions X and Y if N ≤ 2|X - Y|
03, Jan 21
Count L-length arrays possible made up of first N natural numbers and each element dividing the next element
29, Jun 21
Maximum set of number from the first N natural numbers whose Bitwise AND is positive
21, Oct 21
Sum of first N natural numbers which are divisible by 2 and 7
05, Nov 18
Find the side of the squares which are lined in a row, and distance between the centers of first and last square is given
19, Jun 19
Count of squares that can be drawn without lifting the pencil
30, Oct 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!