C/C++ Tricky Programs - GeeksforGeeks

We may come across various tricky programs in our day to day life. May be in technical interviews, coding tests, or in C/C++ classrooms.
Here is a list of such programs :-

Print text within double quotes (” “).
This may seem easy but beginners may get puzzled while printing text within double quotes.

// CPP program to print double quotes

#include<iostream>



int main()

{

   std::cout << "\"geeksforgeeks\"";

   return 0;

}

Output:
```
"geeksforgeeks"
```

To check if two numbers are equal without using arithmetic operators or comparison operators.
The simplest solution for this is using Bitwise XOR operator (^). We know that, for two equal numbers XOR operator returns 0. We will use this trick to solve this problem.

// C program to check if two numbers are equal  
// without using arithmetic operators or  
// comparison operators 
#include<stdio.h> 
  
int main() 
{ 
   int x = 10; 
   int y = 10; 
   if ( !(x ^ y) ) 
      printf(" x is equal to y "); 
   else 
      printf(" x is not equal to y "); 
   return 0; 
} 

Output:

x is equal to y

Print all natural numbers upto N without using semi-colon.
We use the idea of recursively calling main function.

// CPP program to print all natural numbers upto  
// N without using semi-colon 
#include<iostream> 
  
using namespace std; 
int N = 10; 
  
int main() 
{ 
  static int x = 1; 
  if (cout << x << " " && x++ < N && main()) 
  { } 
  return 0; 
} 

Output:

1 2 3 4 5 6 7 8 9 10

Program to find Maximum and minimum of two numbers without using any loop or condition.
The simplest trick is-

// CPP program to find maximum and minimum of 
// two numbers without using loop and any 
// condition. 
#include<bits/stdc++.h> 
  
int main () 
{ 
   int a = 15, b = 20; 
   printf("max = %d\n", ((a + b) + abs(a - b)) / 2); 
   printf("min = %d", ((a + b) - abs(a - b)) / 2); 
   return 0; 
} 

Output:

max = 20
min = 15

Print the maximum value of an unsigned int using One’s Compliment (~) Operator in C.
Here is a trick to find maximum value of an unsigned int using one’s compliment operator:

// C program to print maximum value of 
// unsigned int. 
#include<stdio.h> 
  
int main() 
{ 
   unsigned int max; 
   max = 0; 
   max = ~max; 
   printf("Max value : %u ",  max); 
  return 0; 
}     

To find sum of two integers without using ‘+’ operator.
This is a very easy mathematics trick.
We know that a + b = – (-a-b). So this will work as a trick for us.

// CPP program to print sum of two integers 
// withtout + 
#include<iostream> 
  
using namespace std; 
int main() 
{ 
  int a = 5; 
  int b = 5; 
  int sum = -( -a-b ); 
  cout << sum; 
  return 0; 
} 

Output:

Program to verifies the condition inside if block.

// CPP program to verifies the condition inside if block 
// It just verifies the condition inside if block,  
// i.e., cout << "geeks" which returns a non-zero value,  
// !(non-zero value) is false, hence it executes else 
// Hence technically it only executes else block  
#include<iostream> 
  
using namespace std; 
int main() 
{ 
    if (!(cout << "geeks"))  
    cout <<" geeks ";  
    else
    cout << "forgeeks "; 
      
    return 0; 
} 

Output:

geeksforgeeks

Program to divide an integer by 4 without using ‘/’ operator.
One of the most efficient way to divide an integer by 4 is to use right shift operator (“>>”).

// CPP program to divide a number by 4 
// without using '/' 
#include<iostream> 
  
using namespace std; 
int main() 
{ 
   int n = 4; 
   n = n >> 2; 
   cout << n; 
   return 0; 
}   

Output:

Program to check endianness of the computer.

// C program to find if machine is little 
// endian or big endian. 
#include <stdio.h> 
  
int main()  
{ 
   unsigned int n = 1; 
   char *c = (char*)&n; 
   if (*c)     
       printf("LITTLE ENDIAN"); 
   else
       printf("BIG ENDIAN"); 
   return 0; 
} 

This article is contributed by Smitha Dinesh Semwal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

My Personal Notes

Recommended Posts: