可以排列成矩形的数字称为矩形数字(也称为Pronic数字)。前几个Pronic编号是:
0、2、6、12、20、30、42、56、72、90、110、132、156、182、210、240、272、306、342、380、420、462。 。 。 。 。 。
质子数是两个连续整数的乘积,即数n是x和(x + 1)的积。任务是检查并打印一定范围内的Pronic Numbers。
例子 :
Input : 6
Output : Pronic Number
Explanation: 6 = 2 * 3 i.e 6 is a product
of two consecutive integers 2 and 3.
Input :56
Output :Pronic Number
Explanation: 56 = 7 * 8 i.e 56 is a product
of two consecutive integers 7 and 8.
Input : 8
Output : Not a Pronic Number
Explanation: 8 = 2 * 4 i.e 8 is a product of
2 and 4 which are not consecutive integers.
C++
// C/C++ program to check
// if a number is pronic
#include
#include
using namespace std;
// function to check
// Pronic Number
bool checkPronic(int x)
{
for (int i = 0;
i <= (int)(sqrt(x));
i++)
// Checking Pronic Number
// by multiplying consecutive
// numbers
if (x == i * (i + 1))
return true;
return false;
}
// Driver Code
int main(void)
{
// Printing Pronic Numbers
// upto 200
for (int i = 0; i <= 200; i++)
if (checkPronic(i))
cout << i << " ";
return 0;
}
// This code is contributed
// by Nikita Tiwari.
Java
// Java program to check and
// Print Pronic Number upto 200
import java.io.*;
import java.util.*;
import java.math.*;
class GFG
{
// function to check Pronic Number
static boolean checkPronic(int x)
{
for (int i = 0;
i <= (int)(Math.sqrt(x));
i++)
// Checking Pronic Number
// by multiplying consecutive
// numbers
if (x == i * (i + 1))
return true;
return false;
}
// Driver Code
public static void main(String[] args)
{
// Printing Pronic
// Numbers upto 200
for (int i = 0; i <= 200; i++)
if (checkPronic(i))
System.out.print(i + " ");
}
}
// This code is contributed
// by Nikita Tiwari
Python
# Python program to check
# and print Pronic Numbers
# upto 200
import math
# function to check
# Pronic Number
def checkPronic (x) :
i = 0
while ( i <= (int)(math.sqrt(x)) ) :
# Checking Pronic Number
# by multiplying consecutive
# numbers
if ( x == i * (i + 1)) :
return True
i = i + 1
return False
# Driver Code
# Printing Pronic
# Numbers upto 200
i = 0
while (i <= 200 ) :
if checkPronic(i) :
print i,
i = i + 1
# This code is contributed
# by Nikita Tiwari.
C#
// Java program to check and
// Print Pronic Number upto 200
using System;
class GFG
{
// function to check
// Pronic Number
static bool checkPronic(int x)
{
for (int i = 0;
i <= (int)(Math.Sqrt(x));
i++)
// Checking Pronic Number by
// multiplying consecutive numbers
if (x == i * (i + 1))
return true;
return false;
}
// Driver Code
public static void Main()
{
// Printing Pronic
// Numbers upto 200
for (int i = 0; i <= 200; i++)
if (checkPronic(i))
Console.Write(i + " ");
}
}
// This code is contributed by vt_m.
PHP
Javascript
输出 :
0 2 6 12 20 30 42 56 72 90 110 132 156 182