Answer / sharath kumar

#include <stdio.h>

int main(void)
{
if (printf("%c ", 59))
{
}
return 0;
}

Answer / ameya

Answer #1 and #2 are wrong. They dont work on Turbo C. If
anybody knows the write answer please email me the code.

Answer / lakshmi

void main()
{
if(getche()){}
}
you can input ; at run time and itll be printed on output
screen.

Answer / ceeemor

#include<iostream>

using namespace std;

int main() {

cout << char(59) << endl;

}

Answer / subash

include<stdio.h>
include<conio.h>
void main()
{
if(printf(";"))
{
}
}


Because If statements executes the result atleast once whether
the condition is wrong.....Try and tell..It is working..I worked

Answer / sorabh

#include<stdio.h>
#include<list>
#include<vector>

using namespace std;
char str[100002];
int dist[100002];
int n;

void BFS(int s)
{
vector<bool> visited(10,false);
list<int> queue;
dist[s] = 0;
queue.push_back(s);

while(!queue.empty())
{
s = queue.front();
queue.pop_front();

vector<int> temp; temp.clear();
if(s==0) temp.push_back(1);
else if(s==n-1) temp.push_back(n-2);
else { temp.push_back(s-1); temp.push_back(s+1);}
int sz=temp.size();
for(int i=0; i<sz; i++)
{
int node=temp[i];
if(1+dist[s]<dist[node]) {
dist[node] = 1+dist[s];
if(node==0) return;
queue.push_back(node);
}
}
if(!visited[str[s]-48]) {
sz=pos[str[s]-48].size();
for(int i=0; i<sz; i++)
{
int node=pos[str[s]-48][i];
if(1+dist[s]<dist[node]) {
dist[node] = 1+dist[s];
if(node==0) return;
queue.push_back(node);
}
}
visited[str[s]-48]=true;
}
}
}

int main()
{
scanf("%s",str);
n=strlen(str);
for(int i=0; i<n; i++) {
pos[str[i]-48].push_back(i);
dist[i] = INT_MAX;
}
BFS(n-1);
printf("%d",dist[0]);
return 0;
}

Answer / vivek

#include<stdio.h>
void main()
{
if(printf("semicolon"))
{}
}

Answer / jatin

printf("use of semicolon is like this\;\n");

Answer / ravi

main()
{
if(printf(";"))
{
}
}

Answer / poorna

#include<stdio.h>
void main()
{
while( printf("%c", 59), 0)
{
}
}

How to read a directory in a C program?

4 Answers  

Give a one-line C expression to test whether a number is a power of 2.

10 Answers   Microsoft,

Give a very good method to count the number of ones in a 32 bit number. (caution: looping through testing each bit is not a solution)

7 Answers   Microsoft,

what will be the position of the file marker? a: fseek(ptr,0,SEEK_SET); b: fseek(ptr,0,SEEK_CUR);

2 Answers  

Who could write how to find a prime number in dynamic array?

1 Answers  

Cau u say the output....?

1 Answers  

int i,j; for(i=0;i<=10;i++) { j+=5; assert(i<5); }

3 Answers   Cisco, HCL,

main() { static char names[5][20]={"pascal","ada","cobol","fortran","perl"}; int i; char *t; t=names[3]; names[3]=names[4]; names[4]=t; for (i=0;i<=4;i++) printf("%s",names[i]); }

2 Answers  

Write a C function to search a number in the given list of numbers. donot use printf and scanf

5 Answers   Honeywell, TCS,

main() { static int a[3][3]={1,2,3,4,5,6,7,8,9}; int i,j; static *p[]={a,a+1,a+2}; for(i=0;i<3;i++) { for(j=0;j<3;j++) printf("%d\t%d\t%d\t%d\n",*(*(p+i)+j), *(*(j+p)+i),*(*(i+p)+j),*(*(p+j)+i)); } }

1 Answers  

#define square(x) x*x main() { int i; i = 64/square(4); printf("%d",i); }

4 Answers   Google, HCL, Quick Heal, WTF,

find simple interest & compund interest

2 Answers