C-Authentication program will helps to add an authentic step before getting into your program. This can be used as a security check in any C program.

##### Customization In Code

In the given code for Authentication in C language, you can specify following properties/values as per your choice.

• Number of maximum attempts

## C – Guess the secret sentence character by character

Here you will get complete source code guessing a character in a secret sentence or word in C Programming language. you can set your secret message or sentence in the code and then you can tell your friend to start guessing that secret message after executing the code.

One of my Facebook Page’s fan Faster Msr posted this on my page, so I coded to implement this using C Programming language.

## C program for all number conversion.

I have created a C program for all number conversion, its a small application using C language. I have used printf’s various format specifiers to minimize the code and utilizing the available features of printf function.

###### These are some of format specifiers used in the code.
• %d => for signed decimal integer.
• %o => unsigned octal integer.
• %X => unsigned hexadecimal integer.
###### The number conversions supported by this code are listed below.
• Binary to Octal
• Binary to Decimal
• Octal to Binary
• Octal to Decimal
• Decimal to Binary
• Decimal to Octal

## Love and Friendship calculator using C/C++

Love and Friendship calculator is a small C or C++ application which implements a school-time logic. When we are in school time we play with our names and calculate some percentage. I also implemented one of them logic to calculate Love and friendship.

The Logic which i have implemented is as follows.

• Two names n1 and n2 are taken from the user. And one choice for friendship or love calculation.
• If  user choose friendship then we make a string n1+ friend + n2.
• If user choose love then we make a string n1 + love + n2.
• Then we start manipulation over the concatenated string from left to right.
• We count occurrence of each character (except space) until all characters are traversed and keep that count of each character in an array.
• Now we have an array containing count of each character. now we perform operation on this array.
• we start adding first element of array with last element of array, second element with second last element of the array and so on.
• Keep continue the above step until we get array with only two elements.
• Now we have percentage. if percentage is higher then 100% we manipulate it until we get percentage less than  or equal to 100%.