程序列表 | 编程示例

Area of Rectangle = Width * Height
                  = 10 * 5
                  = 50

Volume = (4.0/3.0) * pie * (radius * radius * radius); 
       = (4.0/3.0) * 3.14 * 48 * 48 * 48
       = 463433.132812 

Area of Pentagon = (5.0/2.0) * s * a
                 = (5.0/2.0) * 13 * 5
                 = 162.5

Area of Parallelogram = base * height;
                      = 4 * 18
                      = 72

Area of Square = a2 
               = 132
               = 169

Volume = 4 * pie * (radius * radius);
       = 4 * 3.14 * 37 * 37
       = 17210.285714

Volume = pie * radius * radius * height/3;
       = 3.14 * 38 * 38 * 35/3
       = 48766.666667

Volume of cube = side3
               = 43
               = 64

Volume of the cylinder = pie * radius2 * height
                       = 3.14 * 38* 38 * 35
                       = 146300.000000

CGPA percentage is = 86.070000

Temperature in Fahrenheit = 53.6

Number of years = days / 365;
                = 799 / 365
                = 2

Temperature in Celsius= ((54-32)*5)/9 = 12.22222

Area of Equilateral Triangle = ( 1.73 * a * a) / 4
                             = ( 1.73 * 5 * 5) / 4
                             = 10.81250

Area of Triangle = (b * h) / 2
                 = (5 * 12) / 2
                 = 30.0

Area of Triangle = (b * h) / 2
                 = (5 * 8) / 2
                 = 20.0

Perimeter of Rectangle = 2 * ( a + b);
                       = 2 * (5 + 4)
                       = 18.00000

Simple Interest = 51000.000

Surface Area Of Cube = 6 * 5 * 5=150.00000

Surface Area OfCuboid = 2 * (l * w+ w * h + h * l)
                      = 2 * (2 * 3 + 3 * 5 + 5 * 2)
                      = 62.00000

Surface Area of Cylinder = 2 Π (r + h)
Here, r = radius, h = height, and Π ( pie ) = 3.14
        = 2 * 3.14 * ( 2.0 + 5.0)
        = 44.00000

11 + 72 + 53 = 1 + 49 + 125 = 175
175 is a disarium number

82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1
82 is a happy number number

156 is a Harshad number

Disarium numbers between 1 and 100 are: 1 2 3 4 5 6 7 8 9 89

List of happy numbers between 1 and 100: 1 7 10 13 19 23 28 31 32 44 49 68 70 79 82 86 91 94 97 100

Pronic numbers between 1 and 100: 2 6 12 20 30 42 56 72 90

Elements of original array: 1 2 3 4 5
Elements of new array: 1 2 3 4 5

Element | Frequency
       1|2
       2|4
       8|1
       3|1
       5|1

Original array: 1 2 3 4 5
Array after left rotation: 4 5 1 2 3

Duplicate elements in given array:
2
3
8

Elements of given array: 1 2 3 4 5

Original array: 1 2 3 4 5
Array in reverse order: 5 4 3 2 1

Elements of given array present on even position:
2
4

Elements of given array present on odd position:
1
3
5

Largest element present in given array: 75

Number of elements present in given array: 5

Smallest element present in given array: 7

Sum of all the elements of an array: 15

Original array: 1 2 3 4 5
Array after right rotation: 3 4 5 1 2

Elements of original array: 5 2 8 7 1
Elements of array sorted in ascending order: 1 2 5 7 8

Elements of original array: 5 2 8 7 1
Elements of array sorted in descending order: 8 7 5 2 1

Addition of two matrices: [2 1 2]
                          [6 8 7]
                          [2 7 4]

Subtraction of two matrices: [2 5 3]
                             [1 1 0]
                             [0 1 2]

Given matrix is an identity matrix

Given matrix is a sparse matrix

Matrices are equal

Lower triangular matrix: [1 0 0]
                         [8 6 0]
                         [4 5 6]

Upper triangular matrix: [1 2 3]
                         [0 6 4]
                         [0 0 6]

Frequency of odd numbers: 5
Frequency of even numbers: 4

Product of two matrices: [7 7 6]
                         [8 6 5]
                         [6 7 5]

Sum of 1 row: 6
Sum of 2 row: 15
Sum of 3 row: 24
Sum of 1 column: 12
Sum of 2 column: 15
Sum of 3 column: 18

Transpose of given matrix: [1 4 7]
                           [2 5 8]
                           [3 6 9]

Total number of punctuation characters exists in string: 4

vowels = a, e, i, o, u
consonants = b, c, d, f, g, h, j, k, l, m, n, p, q, r, s, t, v, w, x, y, z

str1 = "Grab";
str2 = "Brag";

Both the strings are anagram.

Equal parts of given string are
aaaa
bbbb
cccc

All the permutations of the string are:
ABC
ACB
BAC
BCA
CBA
CAB

All subsets for given string are:
A
AB
ABC
B
BC
C

Longest repeating sequence: bdf

String after removing all the white spaces : Removewhitespaces

String after case conversion : gREAT pOWER

String after replacing spaces with given character: Once-in-a-blue-moon

Total number of characters in a string: 19

Total number of words in the given string: 7

Given string is palindrome.

Second string is a rotation of first string.

Minimum occurring character: a
Maximum occurring character: e

Original string: Dream big
Reverse of given string: gib maerD

Duplicate characters in a given string:
r
e
t
s
i

Duplicate words in a given string:
big
black

Characters and their corresponding frequencies
p-2
i-1
c-2
t-2
u-1
r-2
e-3
f-1

Smallest word: an
Largest word: extraordinary

Most repeated word: computer

Number of words present in given file: 117

Smallest palindromic word: wow
Biggest palindromic word: kayak

Individual characters from given string: characters

Strings before swapping: Good morning
Strings after swapping: morning Good

OddLevelSum = 1 + 4 + 5 + 6 = 16
EvenLevelSum = 2 + 3 = 5
Difference = |16 - 5| = 11

Binary search tree after insertion: 10 30 50 60 70 90
Binary search tree after deleting node 90: 10 30 50 60 70
Binary search tree after deleting node 30: 10 50 60 70
Binary search tree after deleting node 50: 10 60 70

Inorder representation of binary tree: 4 2 5 1 6 3 7
Inorder representation of resulting binary search tree: 1 2 3 4 5 6 7

All leaves are at same level

Both the binary trees are identical

Maximum width of the binary tree: 4

Largest element in the binary tree: 74

Maximum height of given binary tree: 5

Nodes which are at maximum distance:
( 4,9 )
( 5,9 )

Smallest element in the binary tree: 1

Sum of all nodes of binary tree: 31

Total number of possible Binary Search Trees with given key: 42

Binary tree after insertion: 1
Binary tree after insertion: 2 1 3
Binary tree after insertion: 4 2 5 1 3
Binary tree after insertion: 4 2 5 1 6 3 7

Element is present in the binary tree

100
200
300

Nodes of singly linked list: 1 2 3 4

Nodes of singly linked list: 1 2 3 4
Count of nodes present in the list: 4

Original List: 1 2 3 4
Reversed List: 4 3 2 1

Original List: 1 2 3 4
Updated List: 2 3 4
Updated List: 3 4
Updated List: 4
Updated List: List is empty

Original List: 1 2 3 4
Updated List: 1 3 4
Updated List: 1 4
Updated List: 4
Updated List: List is empty

Original List: 1 2 3 4
Updated List: 1 2 3
Updated List: 1 2
Updated List: 1
Updated List: List is empty

Nodes of the singly linked list: 1 2 3 2 1
Given singly linked list is a palindrome

Minimum value node in the list: 1
Maximum value node in the list: 8

Original list: 1 2 
Updated List: 1 3 2 
Updated List: 1 3 4 2 

Adding nodes to the start of the list: 1
Adding nodes to the start of the list: 2 1
Adding nodes to the start of the list: 3 2 1
Adding nodes to the start of the list: 4 3 2 1

Adding nodes to the end of the list: 1
Adding nodes to the end of the list: 1 2
Adding nodes to the end of the list: 1 2 3
Adding nodes to the end of the list: 1 2 3 4

Originals list: 1 2 3 2 2 4 1
List after removing duplicates: 1 2 3 4

Element is present in the list at the position : 2
Element is not present in the list

Original list: 9 7 2 5 4
Sorted list: 2 4 5 7 9

Original list: 1 2 3 4 5
List after swapping nodes: 1 5 3 4 2

Originals list: 1 2 3 4
List after swapping the first node with last: 4 2 3 1

Count of nodes present in circular linked list: 6

Original List: 1 2 3 4 5 6
Reversed List: 6 5 4 3 2 1

Nodes of the circular linked list: 1 2 3 4

Original List:1 2 3 4
Updated List:2 3 4
Updated List:3 4
Updated List:4
Updated List: List is empty

Original List:1 2 3 4
Updated List:1 2 3
Updated List:1 2
Updated List:1
Updated List: List is empty

Original List:1 2 3 4
Updated List:1 3 4
Updated List:1 4
Updated List:4
Updated List: List is empty

Minimum value node in the list: 1
Maximum value node in the list: 20

Adding nodes to the start of the list: 1
Adding nodes to the start of the list: 2 1
Adding nodes to the start of the list: 3 2 1
Adding nodes to the start of the list: 4 3 2 1

Adding nodes to the end of the list: 1
Adding nodes to the end of the list: 1 2
Adding nodes to the end of the list: 1 2 3
Adding nodes to the end of the list: 1 2 3 4

Original list: 1 2 3 4
Updated List: 1 2 5 3 4
Updated List: 1 2 5 6 3 4

Originals list:1 2 3 2 2 4
List after removing duplicates:1 2 3 4

Element is present in the list at the position : 2
Element is not present in the list

Original list:70 90 20 100 50
Sorted list:20 50 70 90 100

Nodes of generated doubly linked list: 4 2 5 1 6 3 7 

Nodes of the generated doubly linked list: 5 10 20 40 50 12 24 36 48 15 30 45 60 

Nodes of doubly linked list: 1 2 3 4 5 
Count of nodes present in the list: 5

Original List: 1 2 3 4 5 
Reversed List: 5 4 3 2 1 

Nodes of doubly linked list: 1 2 3 4 5

Original List: 1 2 3 4 5 
Updated List: 2 3 4 5 
Updated List: 3 4 5 
Updated List: 4 5 
Updated List: 5 
Updated List: List is empty

Original List: 1 2 3 4 5 
Updated List: 1 2 3 4 
Updated List: 1 2 3 
Updated List: 1 2 
Updated List: 1 
Updated List: List is empty

Original List: 1 2 3 4 5 
Updated List: 1 2 4 5 
Updated List: 1 4 5 
Updated List: 1 5 
Updated List: 5 
Updated List: List is empty

Minimum value node in the list: 1
Maximum value node in the list: 9

Adding a node to the start of the list: 1 
Adding a node to the start of the list: 2 1 
Adding a node to the start of the list: 3 2 1 
Adding a node to the start of the list: 4 3 2 1 
Adding a node to the start of the list: 5 4 3 2 1 

Adding a node to the end of the list: 1 
Adding a node to the end of the list: 1 2 
Adding a node to the end of the list: 1 2 3 
Adding a node to the end of the list: 1 2 3 4 
Adding a node to the end of the list: 1 2 3 4 5

Original list: 1 2 
Updated List: 1 3 2 
Updated List: 1 3 4 2 
Updated List: 1 3 5 4 2 

Originals list: 1 2 3 2 2 4 5 3 
List after removing duplicates: 1 2 3 4 5 

Original List: 1 2 3 4 5 
Updated List: 4 5 1 2 3 

Node is present in the list at the position : 3
Node is not present in the list

Original list: 7 1 4 5 2 
Sorted list: 1 2 4 5 7