URI / BEE CROWD 1073 - Even Square Solution in C,C++,Python | URI - BEECROWD - BEE 1073 Solution in C,C++,Python

                                                                                            beecrowd | 1073

Even Square

Adapted by Neilor Tonin, URI Brazil

                                                                                             Timelimit: 1

Read an integer N. Print the square of each one of the even values from 1 to N including N if it is the case.

Input

The input contains an integer N (5 < N < 2000).

Output

Print the square of each one of the even values from 1 to N, as the given example.

Be carefull! Some language automaticly print 1e+006 instead 1000000. Please configure your program to print the correct format setting the output precision.

Input Sample	Output Sample
6	2^2 = 4 4^2 = 16 6^2 = 36

URI / BEE CROWD 1073 - Even Square Solution in C,C++,Python | URI - BEECROWD - BEE 1073 Solution in C,C++,Python

                                         Demonstration:

Even numbers are those numbers that can be divided into two equal groups or pairs and are exactly divisible by 2.

Here we apply a range-based for loop which provides all the integers available in the input interval.

After this, a check condition for even numbers is applied to filter all the odd numbers and square the even number. 

Finally, print the result. 

N.B: Don't copy paste the code as same. Just try to understand it and try yourself.

  URI / BEE 1073 Solution in C :   

URI / BEECROWD Online Judge 1073 Solve  in C :

#include<stdio.h>
int main()
{
	int n,i;
	scanf("%d",&n);
	for(i=2;i<=n;i+=2)
	{
	    printf("%d^2 = %d\n",i,i*i);
	}
	return 0;
}

  URI / BEE 1073 Solution in C++ :   

URI / BEECROWD Online Judge 1073 Solve  in C++ :

#include <iostream>

using namespace std;

int main(){
    int x;
    
    cin >> x;
    
    for(int i = 1; i <= x; i++){
            if(i%2 == 0){
                   cout << i << "^2 = " << i*i << "\n";
                 }
    }
    
    return 0;
}

  URI / BEE 1073 Solution in Python :   

URI / BEECROWD Online Judge 1073 Solve  in Python :

n= int(input())
for i in range(1,n+1):
    if(i%2==0):
        print(f"{i}^2 = {pow(i,2)}")

Previous Post:

URI / BEE CROWD 1072 - Interval 2 Solution in C,C++,Python | URI - BEECROWD - BEE 1072 Solution

Next Post:

URI / BEE CROWD 1074 - Even or Odd Solution in C,C++,Python | URI - BEECROWD - BEE 1074 Solution in C,C++,Python

 

Ashraf URI/BEE Problem Solution