#include <stdio.h>
main()
{	
	int	a,b,c,big;
	printf("Enter Three numbers");
	scanf("%d%d%d",&a,&b,&c);
	if(a>b)
		if(a>c)
			big=a;
		else
			big=c;
	else
		if(b>c)
			big=b;
		else
			big=c;
	printf("Largest of %d,%d and %d = %d",a,b,c,big);
return 0;
}

 /*
 * Mail.java
 *
 * Created on January 1, 2003, 1:58 AM
 *
 * To change this template, choose Tools | Template Manager
 * and open the template in the editor.
 */

package ocricket.bean;

import java.util.Date;
import java.util.Properties;

import javax.mail.Message;
import javax.mail.MessagingException;
import javax.mail.Session;
import javax.mail.Transport;
import javax.mail.internet.InternetAddress;
import javax.mail.internet.MimeMessage;

/**
 * 
 * @author Dheeraj
 */
public class Mail {

	public  void sendMail(String toemail, String subject, String body)
			throws MessagingException {
		String host = "mail.ofindia.in";
		String user = "ocricket@ofindia.in";
		String pass = "86qx3@i48fg6";
		// Create properties, get Session
		Properties props = System.getProperties();
		props.put("mail.host", host);
		props.put("mail.transport.protocol.", "smtp");
		props.put("mail.smtp.auth", "true");
		props.put("mail.smtp.", "true");
		props.put("mail.smtp.port", "25");
		props.put("mail.smtp.socketFactory.fallback", "false");
		Session mailSession = Session.getDefaultInstance(props, null);
		Message msg = new MimeMessage(mailSession);
		msg.setFrom(new InternetAddress(user));
		InternetAddress[] address = { new InternetAddress(toemail) };
		msg.setRecipients(Message.RecipientType.TO, address);
		msg.setSubject(subject);
		msg.setSentDate(new Date());
		msg.setText(body);
		Transport transport = mailSession.getTransport("smtp");
		transport.connect(host, user, pass);
		transport.sendMessage(msg, msg.getAllRecipients());
		transport.close();

	}

}

int array[MAX]; //where MAX is upper limit....
//then
while(count<=reqCount)
  { 
     int c=rand();
     if(array[c%MAX]!=c%MAX)
       array[c%MAX]=c%MAX,count++;
  }

#include <iostream>

using namespace std;

int main()
{
  int i, array[10],randomarray[10];
  cout<<"Enter 10 numbers in any order";
  for (i=0; i<10; i++) {cin>>array[i];randomarray[i]=0;}
  for (i=0;i<10;i++){
    int r=rand()*10;
    if(randomarray[r]<>0
      randomarray[r]=array[i];
    else
      i--;
    }
  for(i=0;i<10;i++) cout<<randomarray[i];
  }

#include <cstdlib> 
#include <iostream>

using namespace std;

int main() 
{ 
    int random_integer = rand(); 
    int a[10];
    for (int i=0;i<10;i++)
        a[i]=rand();
    for (int i=0;i<10;i++)
        cout<<a[i]<<endl; 
    return 0;
}

#include<iostream>

using namespace std;

int main()
{
	int a[10],i,j,check;
	
	cout<<"Enter 10 values: ";
	for (i=0;i<10;i++)
		cin>>a[i];
	
	cout<<"Enter the number to check: ";
	cin>>check;
	
	for (i=0;i<10;i++)
	{
		if(a[i]==check)
		{
			cout<<"Number found at "<<i+1<<"th position.";
			break;
		}
		else if(i==9)
			cout<<"Number not found.";
	}
	
	return 0;
}

#include <iostream>
using namespace std;
int main()
{ xyz:
  float asc[10],num,sub;
  int i,j,p;
  cout<<"Enter 10 numbers in any order:\n";
  for(i=0;i<10;i++)
  { cin>>asc[i];}
  cout<<"Enter the number to be searched:"<<endl;
  cin>>p;
  for(j=0;j<10;j++)
  { sub=asc[i]-p;
    if(sub=0)
    cout<<"The number is at"<<i<<"th position.";
    else
    cout<<"Number not found.";
    cin.get();
  } 
  goto xyz;
}

#include <stdio.h>
#include <conio.h>

void main()
{
 int i,j;
 for(i=1;i<=4;i++)
  {
    for(j=1;j<=i;j++)
    printf("%d\t" , i);
    printf("\n");
  }
 getch();
}

#include<stdio.h>
#include<stdlib.h>

int main(int argc, char *argv[])
{
	float a, b;
	char op;

	if (argc < 4 || argc > 4)
	{
		printf("\nUsage: cal <number1> <operator> <number2>\n");
		printf("\nValid Expressions: + - * /\n");
		printf("\nExample: cal 2 + 2\n");
		exit(1);
	}

	/* Store the Command Line Arguments in Local Variables */
	a = atof(argv[1]);
	b = atof(argv[3]);
	op = *argv[2];

	switch(op)
	{
		case '+':
			printf("\n%f", (float)a+b);
			break;

		case '-':
			printf("\n%f", (float)a-b);
			break;

		case '*':
			printf("\n%f", (float)a*b);
			break;

		case '/':
			printf("\n%f", (float)a/b);
			break;

		default:
			printf("\nInvalid Operator");
			break;
	}

	printf("\n");
	return(0);
}

Data Type               Size            Minimum                 Maximum
char                    1               -128                    127
short int               2               -32768                  32767
int                     4               -2147483648             2147483647
long int                4               -2147483648             2147483647
unsigned char           1               0                       255
unsigned short          2               0                       65535
unsigned int            4               0                       4294967295
unsigned long           4               0                       4294967295

Data Type               Size            Minimum                 Maximum
char                    1               -128                    127
short int               2               -32768                  32767
int                     4               -2147483648             2147483647
long int                4               -2147483648             2147483647
unsigned char           1               0                       255
unsigned short          2               0                       65535
unsigned int            4               0                       4294967295
unsigned long           4               0                       4294967295

#include <iostream>
#include <limits>

using namespace std;

int main () {
	cout << "Data Type\t\tSize\t\tMinimum\t\t\tMaximum\n";
	cout << "char\t\t\t" << sizeof(char) << "\t\t" << CHAR_MIN << "\t\t\t" << CHAR_MAX << endl;
	cout << "short int\t\t" << sizeof(short int) << "\t\t" << SHRT_MIN << "\t\t\t" <<  SHRT_MAX << endl;
	cout << "int\t\t\t" << sizeof(int) << "\t\t" << INT_MIN << "\t\t" << INT_MAX << endl;
	cout << "long int\t\t" << sizeof(long int) << "\t\t" << LONG_MIN << "\t\t" << LONG_MAX << endl;
	cout << "unsigned char\t\t" << sizeof(unsigned char) << "\t\t" << '0' << "\t\t\t" << UCHAR_MAX << endl; 
	cout << "unsigned short\t\t" << sizeof(unsigned short) << "\t\t" << '0' << "\t\t\t" << USHRT_MAX << endl;
	cout << "unsigned int\t\t" << sizeof(unsigned int) << "\t\t" << '0' << "\t\t\t" << UINT_MAX << endl; 
	cout << "unsigned long\t\t" << sizeof(unsigned long) << "\t\t" << '0' << "\t\t\t" << ULONG_MAX << endl;
	return 0;
}

38: 24157817
39: 39088169
40: 63245986
41: 102334155
42: 165580141
43: 267914296
44: 433494437
45: 701408733
46: 1134903170
47: 1836311903
48: -1323752223 (Goes wrong here onwards)

#include<iostream>

using namespace std;

int main()
{
    int prev=0, fib=0, final=1;
    cout<<"1: "<<prev<<endl<<"2: "<<final<<endl;
    for(int i=0;i<=97;i++)
    {
        fib=final+prev;
        prev = final;
        final = fib;
        cout<<i+3<<": "<<fib<<endl;
    }
    cout<<endl<<"Final: "<<fib<<endl;
    return 0;
}

#include<iostream>

using namespace std;

int main()
{
    float prev=0, fib=0, final=1;
    cout.precision(30);
    cout<<"1: "<<prev<<endl<<"2: "<<final<<endl;
    for(int i=0;i<=97;i++)
    {
        fib=final+prev;
        prev = final;
        final = fib;
        cout<<i+3<<": "<<fib<<endl;
    }
    cout<<endl<<"Final: "<<fib<<endl;
    return 0;
}

#include <stdio.h>
#include<conio.h>
void main()
{
	auto	int	dec, bin;
	int	dec_to_bin (int);
	printf("Enter a decimal number \n");
	scanf("%d", &dec);
	bin = dec_to_bin (dec);
	printf("The decimal number is = %d \n", dec);
	printf("The binary number is = %d \n", bin);
}
/*	Funtion to find the binary equivalent	*/
int	dec_to_bin (int d)
{
	auto	int	b,r,k;
		b=0;
		k=0;
		while(d>0)
		{
			r = d % 2;
			d = d / 2;
			b = b + r * k;
			k = k * 10;
		}
		return (b);
getch();
}

This is a single player game. The computer selects a 4 digit number at random and then you have to guess that number. Remember that each digit in the number selected by the computer will be unique. Then when you enter your choice, the computer will give an output which will be telling you the total number of digits and positions of those which are correct.

Suppose the computer has selected the number 2156, and you enter your guess as 1234. Here the numbers 1 and 2 are correct. The positions of those numbers are, however, not correct. So the output will be:-

                2 Numbers Correct.

                0 Positions Correct.

Now if you enter 2134 then the output will be:-

 2 Numbers Correct.

             2 Positions Correct.

Now if you enter 2156 as your number, then all four numbers as well as their positions  are correct, so the output will be:-

           The number Selected By the computer was 2156

#include <stdio.h>
#include<conio.h>
void main()
{
	int a [100]; /* Array Declaration */
	int i,n,max,mini;
	printf("Enter number of elements in the array");
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	max=a[0];
	mini=a[0];
	for(i=1;i<n;i++)
	{
		if(max<a[i])max=a[i];
		if(mini>a[i])mini=a[i];
	}
	printf("\nMaximum element in the array is %d",max);
	printf("\nMinimum element in the array is %d",mini);
getch();
}

#include <stdio.h>
main()
{
	int a [100]; /* Array Declaration */
	int i,n,max,mini;
	printf("Enter number of elements in the array");
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	max=a[0];
	mini=a[0];
	for(i=1;i<n;i++)
	{
		if(max<a[i])max=a[i];
		if(mini>a[i])mini=a[i];
	}
	printf("\nMaximum element in the array is %d",max);
	printf("\nMinimum element in the array is %d",mini);
return 0;

#include <stdio.h>
#define MAX 10
void swap(int *x,int *y)
{
   int temp;
   temp = *x;
   *x = *y;
   *y = temp;
}
void bsort(int list[], int n)
{
   int i,j;
   for(i=0;i<(n-1);i++)
      for(j=0;j<(n-(i+1));j++)
             if(list[j] > list[j+1])
                    swap(&list[j],&list[j+1]);
}
void readlist(int list[],int n)
{
   int i;
   printf("Enter the elements\n");
   for(i=0;i<n;i++)
       scanf("%d",&list[i]);
}

void printlist(int list[],int n)
{
   int i;
   printf("The elements of the list are: \n");
   for(i=0;i<n;i++)
      printf("%d\t",list[i]);
}

void main()
{
   int list[MAX], n;
   printf("Enter the number of elements in the list max = 10\n");
   scanf("%d",&n);
   readlist(list,n);
   printf("The list before sorting is:\n");
   printlist(list,n);
   bsort(list,n);
   printf("The list after sorting is:\n");
   printlist(list,n);
}

/* Stack Implementation using Linked Lists */

#include<stdio.h>
#include<stdlib.h>

/* Structure Declaration:
    Structure for a Stack (Linked List Structure)
    Requires two elements.
    
    One Element member, holding the value that the stack is to be made of
    One Self-Referring Pointer member for making it a Linked List - Stack. */

    typedef struct stacklink

        {
            int element;
            struct stacklink *next;
        } top ;
        
typedef top stack;

/* Create:
    Initializes the stack with a NULL value. */
    
    void create(stack *s)
        {
                 s=NULL;
        }

/* Push:
    Pushes (Inserts) a node into the Stack, using a new temporary node.
    Stack's Push operation is done only on the top of the stack */

    stack *push(stack *s)
        {
            int a=0;
            stack *temp;
            
            printf("\nEnter the element to push into the stack: ");
            scanf("%d",&a);
            
            temp = (stack *)malloc(sizeof(stack));

            temp->element = a;
            temp->next = s;

            return temp;
        }

/* Pop:
    Pops (Deletes) the top-most element out of the Stack.
    Also checks if the stack is empty or not and pops only when there is an element available. */

    stack *pop(stack *s)

        {
            stack *temp;
            
            if(s->next!=NULL)
                {
                    temp = s;
                    printf("\nPopped element is: %d\n",temp->element);
                    s = s->next;
                    free(temp);
                }
            
            else
                {
                    printf("\nNothing to Pop from the stack.\n");
                }
                
            return s;
        }

/* Display:
    Displays the Stack in a pictorial fashion.
    A sample output of the stack via this would look like:
        The List is:
        4 -> 5 -> 6 -> NULL
    Where, NULL represents the END of stack. For an empty stack too, it shows NULL. */
    
    void display(stack *s)

        {    
            int temp=1;
            
            printf("\nThe Stack is:");
            
            if(s->next==NULL)
                {
                    printf("\b empty");
                }
            
            while(s->next!=NULL)
                {
                    if(temp)
                        {
                            printf("\n");
                            temp=0;
                        }
                    
                    printf("%d --> ",s->element);
                    s=s->next;
                    
                    if(s->next==NULL)
                        {
                            printf("NULL");
                            break;
                        }
                }
                
            printf("\n");
        }
        
/* Main Menu:
    Displays a menu-based access system for various operations on the stack.
    The menu looks like:
        1. Create
        2. Push
        3. Pop
        4. Display
        5. Exit
    Each item in the menu calls the appropriate functions of the Stack. */

    int main()

        {
            int choice, key, loc,throw=0;
            stack *temp;
            
            while(1)
                {
                    printf("\nStacks\n-------\n");
                    printf("1. Create\n2. Push\n3. Pop\n4. Display\n5. Exit");
                    printf("\nEnter your choice: ");
                    scanf("%d",&choice);
                    
                    switch(choice)
                        {
                            case 1:
                            
                                temp=(stack *)malloc(sizeof(stack));
                                
                                create(temp);
                                
                                printf("\nNULL Stack created\n");
                                throw=1;
                                
                                break;
                                
                            case 2:
                                if(throw==1)
                                    {
                                        temp=push(temp);
    
                                        display(temp);
                                    }
                                
                                else
                                    {
                                        printf("\nCreate a stack first ..\n");
                                    }
                                
                                break;
                                
                            case 3:
                                
                                if(throw==1)
                                    {
                                        temp=pop(temp);

                                        display(temp);
                                    }
                                
                                else
                                    {
                                        printf("\nCreate a stack first ..\n");
                                    }
                                    
                                break;
                                
                            case 4:

                                if(throw==1)
                                    display(temp);
                                
                                else
                                    printf("\nCreate the stack first ..\n");
                                    
                                break;
                                
                            case 5:
                            
                                return 0;
                                
                            default:
                            
                                printf("\nInvalid choice ...\n");
                                
                        }
                }
        }

#include <iostream.h>
#include <conio.h>
#include <math.h>
int BtoD(long int n);
int BtoO(long int n);
long int DtoB(long int n);
int DtoO(long int n);
long int OtoB(long int n);
int OtoD(long int n);
void main()
{
	clrscr();
	int ch;
	long int n;
	cout<<"\n1.Binary to Decimal";
	cout<<"\n2.Binary to Octal";
	cout<<"\n3.Decimal to Binary";
	cout<<"\n4.Decimal to Octal";
	cout<<"\n5.Octal to Binary";
	cout<<"\n6.Octal to Decimal";
	cout<<"\nEnter the choice -->   ";
	cin>>ch;

	cout<<"\nEnter the number -->   ";
	cin>>n;

	switch (ch)
	{
		case 1:
			cout<<"\nDecimal = ";
			cout<<BtoD(n);							      
			break;
		case 2:
			cout<<"\nOctal = ";
			cout<<BtoO(n);
			break;
		case 3:
			cout<<"\nBinary = ";
			cout<<DtoB(n);
			break;
		case 4:
			cout<<"\nOctal = ";
			cout<<DtoO(n);
			break;
		case 5:
			cout<<"\nBinary = ";
			cout<<OtoB(n);
			break;
		case 6:
			cout<<"\nDecimal = ";
			cout<<OtoD(n);
			break;
		default:
			cout<<"You have entered the wrong choice";
	}
	getch();
}

int BtoD(long int n)
{
	int deci=0;
	int b,p=0;

	while (n>0)
	{
		b=n%10;
		n=n/10;
		deci=deci+b*pow(2,p++);
	}
	return deci;
}

int BtoO(long int n)
{
	int deci=0,oct=0;
	int b,c,p=0,r=0;

	while (n>0)
	{
		b=n%10;
		n=n/10;
		deci=deci+b*pow(2,p++);
	}

	while (deci>0)
	{
		c=deci%8;
		deci=deci/8;
		oct=oct+c*pow(10,r++);
	}
	return oct;
}

long int DtoB(long int n)
{
	long int bin=0;
	int b,p=0;

	while (n>0)
	{
		b=n%2;
		n=n/2;
		bin=bin+b*pow(10,p++);
	}
	return bin;
}

int DtoO(long int n)
{
	int oct=0;
	int b,p=0;

	while (n>0)
	{
		b=n%8;
		n=n/8;
		oct=oct+b*pow(10,p++);
	}
	return oct;
}



long int OtoB(long int n)
{
	long int bin=0;
	int deci=0,b,c,p=0,r=0;

	while (n>0)
	{
		b=n%10;
		n=n/10;
		deci=deci+b*pow(8,p++);
	}

	while (deci>0)
	{
		c=deci%2;
		deci=deci/2;
		bin=bin+c*pow(10,r++);
	}
	return bin;
}

int OtoD(long int n)
{
	int deci=0;
	int b,p=0;

	while (n>0)
	{
		b=n%10;
		n=n/10;
		deci=deci+b*pow(8,p++);
	}
	return deci;
}

def strtodec(a) :
    return ' '.join((ord(i) for i in a))

/*  Project Name :- Bulls and Cows.
	Project Version :- 2.1.0.
	Project Author :- Aditya Shevade.
	Time Started :- 5th of June 2007, 08:07 pm.
	Time Finished :- 5th of June 2007, 09:21 pm.
	Built Using :- Anjuta 1.2.4a.
*/
	
#include<iostream>
#include<cstdio>
#include<cstdlib>

using namespace std;

class BullsAndCows
{
	private:
		
		int ComputerNumber, UserNumber;
		int ComputerReminderUnits, ComputerReminderTens, ComputerReminderHundreds, ComputerReminderThousands;
		int UserReminderUnits, UserReminderTens, UserReminderHundreds, UserReminderThousands;
		int PositionsCorrect, DigitsCorrect;
			
	public:
		
		void NumberInitialisation();
		void InitialiseComputerValues();
		void InitialiseUserValues();
		void UserInput();
		void Calculations();
		void NoOfPositionsCorrect();
		void NoOfDigitsCorrect();
		void CheckWin();
	
		int RandomNumber();
	
};

BullsAndCows x;

main()
{
	cout << "\n\n\t\tWelcome to Bulls and Cows.";
	cout << "\n\t\t\tVersion 2.1.0";
	cout << "\n\n\t\tPress Enter to continue";
	
	getchar();
	
	x.NumberInitialisation();
	
	return 0;
	
}

void BullsAndCows::NumberInitialisation()
{
	do
	{
		srand(time(NULL));
    	ComputerNumber = (rand () % 10000);
		
	}while (ComputerNumber > 10000 || ComputerNumber < 1000);
	
	x.InitialiseComputerValues();
	
}

void BullsAndCows::InitialiseComputerValues()
{	
	ComputerReminderUnits = ComputerNumber % 10;
	ComputerReminderTens = ((ComputerNumber - ComputerReminderUnits) / 10) % 10;
	ComputerReminderHundreds = ((ComputerNumber - (ComputerNumber % 100)) / 100) % 10;
	ComputerReminderThousands = ((ComputerNumber - ComputerNumber % 1000) / 1000);
	
	if (ComputerReminderUnits == ComputerReminderTens || ComputerReminderUnits == ComputerReminderHundreds || ComputerReminderUnits == ComputerReminderThousands || ComputerReminderTens == ComputerReminderHundreds || ComputerReminderTens == ComputerReminderThousands || ComputerReminderHundreds == ComputerReminderThousands)
		x.NumberInitialisation();
	
	else
		x.UserInput();

}

void BullsAndCows::UserInput()
{
	cout << "\n\n\t\tPlease Enter Your Choise.\n\n\t\t\t";
	cin >> UserNumber;
	
	while (UserNumber > 10000 || UserNumber < 1000)
	{
		cout << "\n\n\t\tPlease Enter Valid Values.\n\n\t\t\t";
		cin >> UserNumber;
	}
	
	x.InitialiseUserValues();
	x.Calculations();
	
}

void BullsAndCows::InitialiseUserValues()
{
	PositionsCorrect = 0, DigitsCorrect = 0;
	
	UserReminderUnits = UserNumber % 10;
	UserReminderTens = ((UserNumber - UserReminderUnits) / 10) % 10;
	UserReminderHundreds = ((UserNumber - (UserNumber % 100)) / 100) % 10;
	UserReminderThousands = ((UserNumber - UserNumber % 1000) / 1000);
	
}

void BullsAndCows::Calculations()
{
	x.NoOfPositionsCorrect();
	x.NoOfDigitsCorrect();
	
	cout << "\n\n\t\tNumber of Digits Correct :-" << DigitsCorrect;
	cout << "\n\n\t\tNumber of Positions Correct :-" << PositionsCorrect;
	
	x.CheckWin();
	
}

void BullsAndCows::NoOfPositionsCorrect()
{
	if(UserReminderUnits == ComputerReminderUnits)
		PositionsCorrect++;
	if(UserReminderTens == ComputerReminderTens)
		PositionsCorrect++;
	if(UserReminderHundreds == ComputerReminderHundreds)
		PositionsCorrect++;
	if(UserReminderThousands == ComputerReminderThousands)
		PositionsCorrect++;
	
}

void BullsAndCows::NoOfDigitsCorrect()
{
	if(ComputerReminderUnits == UserReminderUnits || ComputerReminderUnits == UserReminderTens || ComputerReminderUnits == UserReminderHundreds || ComputerReminderUnits == UserReminderThousands)
		DigitsCorrect++;
	if(ComputerReminderTens == UserReminderUnits || ComputerReminderTens == UserReminderTens || ComputerReminderTens == UserReminderHundreds || ComputerReminderTens == UserReminderThousands)
		DigitsCorrect++;
	if(ComputerReminderHundreds == UserReminderUnits || ComputerReminderHundreds == UserReminderTens || ComputerReminderHundreds == UserReminderHundreds || ComputerReminderHundreds == UserReminderThousands)
		DigitsCorrect++;
	if(ComputerReminderThousands == UserReminderUnits || ComputerReminderThousands == UserReminderTens || ComputerReminderThousands == UserReminderHundreds || ComputerReminderThousands == UserReminderThousands)
		DigitsCorrect++;
	
}

void BullsAndCows::CheckWin()
{
	if(PositionsCorrect == 4 && DigitsCorrect == 4)
	{
		char Answer;
		
		cout << "\n\n\t\tCongeratulations, You won!";
		cout << "\n\n\t\tDo you wish to play again?(y/n)";
		cin >> Answer;
		
		while (Answer != 'Y' && Answer != 'y' && Answer != 'N' && Answer != 'n')
		{
			cout << "\n\n\t\tDo you wish to play again?(y/n)";
			cin >> Answer;
		}
		
		if (Answer == 'Y' || Answer == 'y')
			x.NumberInitialisation();
				
		if (Answer == 'N' || Answer == 'n')
		{
			cout << "\n\n\t\tThank You for playing this Game.";
			exit(0);
		}
	
	}
	
	else
		x.UserInput();
	
}

#/usr/bin/env python

"Base-n tools with String support (Base-n not complete yet, sorry)"

"String to Binary [Returns a spaced out Binary value string]"
def strtobin(a):
	b,c='',0
	for each in a:
		c = ord(each)
		b+=dectobin(c)+' '
	return b[:-1]

"String to Decimal [Returns a spaced out Decimal value string]"
def strtodec(a):
	b=''
	for each in a:
		b+=str(ord(each))+' '
	return b[:-1]

"String to Octal [Returns a spaced out Octal value string]"
def strtooct(a):
	b=''
	for each in a:
		b+=dectooct(strtodec(each))+' '
	return b[:-1]

"String to Hexadecimal [Returns a spaced out Hexadecimal value string]"
def strtohex(a):
	b=''
	l=strtodec(a).split(' ')
	for each in l:
		b += hex(int(each)) + ' '
	return b[:-1]

"Hexadecimal to Binary [Returns a Binary value string]"
def hextobin(a):
	return dectobin(hextodec(a))

"Hexadecimal to Decimal [Returns a Decimal value]"
def hextodec(a):
	return int(a,16)

"Hexadecimal to Octal [Returns an Octal value string]"
def hextooct(a):
	return oct(hextodec(a))

"Hexadecimal to String [Returns a string corresponding to each Decimal ASCII value of the Hexadecimal value]"
def hextostr(a):
	b=""
	l=[a.split(" ")]
	for each in l[0]:
		b+=chr(hextodec(each))
	return b

"Octal to Binary [Returns an Octal value string]"
def octtobin(a):
	return dectobin(octtodec(a))

"Octal to Decimal [Returns a Decimal value]"
def octtodec(a):
	return str(int(str(a),8))

"Octal to Hexadecimal [Returns a Hexadecimal value string]"
def octtohex(a):
	a = int(a,8)
	return dectohex(octtodec(a))

"Octal to String [Returns a string based on the Decimal value of the Octal number]"
def octtostr(a):
	return dectostr(octtodec(a))

"Decimal to Binary [Returns a Binary valued string]"
def dectobin(a):
	a,b,c=int(a),'',0
	while(a>0):
		c = a%2
		b+=str(c)
		a=a/2
	return b[::-1]

"Decimal to Octal [Returns a Decimal]"
def dectooct(a):
	return oct(int(a))

"Decimal to Hexadecimal [Returns a Hexadecimal value string]"
def dectohex(a):
	return hex(int(a))

"Decimal to String [Returns a string]"
def dectostr(a):
	if int(a)<256:
		return chr(int(a))
	return None

"Binary to Decimal [Returns a Binary valued string]"
def bintodec(a):
	c=i=0
	a=a[::-1]
	for each in a:
		if each!=None:
			c+=int(each)*pow(2,i)
			i+=1
	return c

"Binary to Octal [Returns an Octal value string]"
def bintooct(a):
	return dectooct(bintodec(a))

"Binary to Hexadecimal [Returns a Binary valued string]"
def bintohex(a):
	return dectohex(bintodec(a))

"Binary to String [Returns a string]"
def bintostr(a):
	b=''
	for each in a.split(' '):
		if dectostr(bintodec(each))!=None:
			b+=dectostr(bintodec(each))+' '
	return b[:-1]

if __name__=='__main__':
	print 'Try calling any function here'