Primitive Root of a Prime Number n Modulo n in C++

sudhir sharma
Updated on 03-Feb-2020 10:29:48

1K+ Views

In this problem, we are given a prime number N. our task is to print the primitive root of prime number N modulo N.Primitive root of prime number N is an integer x lying between [1, n-1] such that all values of xk (mod n) where k lies in [0, n-2] are unique.Let’s take an example to understand the problem, Input: 13 Output: 2To solve this problem, we have to use mathematical function called Euler’s Totient Function.Euler’s Totient Function is the count of numbers from 1 to n which are relatively prime to the number n.A number i is relatively ... Read More

Primorial of a Number in C++

sudhir sharma
Updated on 03-Feb-2020 10:24:24

524 Views

In this problem, we are given a number n. Our task is to print its primorial number.Primorial number (Pn#) is a number that is the product of first n prime numbers.Primorial number is similar to factorial of a number n. The difference is that factorial can be any number but in case of primorial number, all prime numbers are used.Let’s take an example to understand the problem, Input: N = 4 Output 210 Explanation: Primorial number, Pn# = 2 * 3 * 5 * 7 = 210To solve this problem, we have to find the first n prime numbers. Print ... Read More

Print in Place of Characters for Reading Passwords in C

sudhir sharma
Updated on 03-Feb-2020 10:20:11

662 Views

In this problem, we are given a string password. Our task is to print * in place of characters of the password.Let’s take an example to understand the problem,Input: password Output ********To solve this problem, we will traverse the password we have entered and print * in place of characters of the password.ExampleThe below program will show the implementation of our solution Live Demo#include #include int main() {    char password[50] = "password";    int length = strlen(password);    printf("Password : ");    for(int i = 0; i

Search in Rotated Sorted Array II in C++

Arnab Chakraborty
Updated on 03-Feb-2020 10:18:57

269 Views

Consider we have an array sorted in ascending order. That is rotated at some pivot unknown to us beforehand. For example, if the array is like [0, 0, 1, 2, 2, 5, 6], this might become [2, 5, 6, 0, 0, 1, 2]. We have a target value to search. If that is found in the array, then return true, otherwise return false. So if the array is like [2, 5, 6, 0, 0, 1, 2], and target is 0, then the output will be 0Let us see the steps −low := 0 and high := size of arraywhile low ... Read More

Print Kth Least Significant Bit of a Number in C++

sudhir sharma
Updated on 03-Feb-2020 10:17:46

452 Views

In this problem, we are given two numbers n and k. Our task is to print the kth least significant bit of the number n.Let’s take an example to understand the problemInput: n = 12 , k = 3 Output 1 Explanation: Let’s see the binary representation of n: 12 = 1100Now, 3rd least significant bit is 1.To solve this problem we will use the binary bits of the number. And yield the kth bit of the number. For this, we will use binary shifting of the number and left-shift the number (k-1) times. Now on doing end operation of ... Read More

Print 1, 2, 3 Infinitely Using Threads in C

sudhir sharma
Updated on 03-Feb-2020 10:15:24

528 Views

Here, we have to print 1 2 3 sequences repeatedly infinite number of times using threads in the c programming language.Let’s see the sample output that we want from our code, 1 2 3 1 2 3 1 2 3 1 2 3For this, we will have to use three threads that are running side by side in the C programming language. And a variable that is initialized to one in the first thread whose value will be updated based on its last value. And run an infinite loop in the function.ExampleLet’s see the program to implement our solution, #include ... Read More

Print 2D Coordinate Points in Ascending Order with Frequencies in C++

sudhir sharma
Updated on 03-Feb-2020 10:09:17

218 Views

In this problem, we are given 2 arrays x[] , y[] such that (x, y) gives a cordinate of a point in 2D plane. Our task is to print all points along with their frequencies of occurence.Let’s take an example to understand the problemInput: x[]={0, 1, 1, 0, 0} ; y[]={1, 2, 2, 2, 1} Output (0, 1) = 2 (1, 2) = 2 (0, 2) = 1To solve this problem, we need to store frequency of occurence of each point. So this we need to use map data-structure. The key of the map is (x[i], y[i]), mapped value is ... Read More

Print 2D Matrix in Different Lines Without Curly Braces in C/C++

sudhir sharma
Updated on 03-Feb-2020 09:58:11

298 Views

Here, we will see the code that will print a 2D matrix in c/c++ programming language without using curly braces.Curly braces are separators in a programming language that are used to define separate code blocks in the program. Without curly braces defining scopes is difficult in c/c++.Let’s see the basic code and sample output to print 2D matrix.Example Live Demo#include using namespace std; int main() {    int arr[2][2] = {{12, 67},    {99, 5}};    int n = 2, m = 2;    for (int i = 0; i < m; i++){       for (int j = 0; j < n; j++){          cout

Usage of CSS list-style-image Property

karthikeya Boyini
Updated on 03-Feb-2020 07:33:54

57 Views

The list-style-image specifies an image for the marker rather than a bullet point or number. You can try to run the following code to implement list-style-image property:Example                            Karnataka          Hyderabad          

Usage of CSS list-style-position Property

Chandu yadav
Updated on 03-Feb-2020 07:32:59

92 Views

The list-style-position property indicates whether the marker should appear inside or outside of the box containing the bullet points. If the text goes onto a second line, the text will wrap underneath the marker, for the value inside.Example If the text goes onto a second line, the text will be aligned with the start of the first line, for the value outside.                            Maths          Science          

Advertisements