#include<iostream.h>
void main()
{
char a,b;
cout<<"Entr the values of a & b";
cin>>a>>b;
if(strcmp(a,b))
cout<<"Both a & b are the same";
else
cout<<"A & b are different";
}
why u all waisting time... First understand problem then solve.
Problem is like that
suppose B = "iwantto"
A = "Hiwannachatoopsthatiswhy"
Now here all character of B is in A string...
Okay!!!
//assuming both the strings in same case
int main()
{
string A;
string B;
int count = 0;
char repeatChar='$';
cout<<"Enter string A";
cin>>A;
cout<<"Enter the string B";
cin>>B;
if(A.length()<B.length())
{
cout<<"Length of string A is small than B, so all the charaters of the B can't be there in A";
exit(0);
}
int A_length = A.length();
int B_length = B.length();
for(int i=0; i<B_length; i++)
{
for(int j=0; j<A_length; j++)
{
if(A[j] == B[i])
{
if(repeatChar == A[j])
;
else
{
count++;
repeatChar = A[j];
break;
}
}
}
}
if(count==B_length)
cout<<"string A has all the chars of string B";
else
cout<<"string A doesn't have all chars of string B";
return 0;
}
char B_str[] = "aaaaaa";
char A_str[] = "a"
// For the above case, this function should return true
char B_str[] = "aB";
char A_str[] = "aaaaaBaaaaaa"
// For the above case, this function should return true
int B_chars[256]; //for all unique chars in B_str
/* Init B_chars[] */
for( int i = 0; i < 256; i++ )
B_chars[i] = 0;
/* Get characters in B_str */
for( int i = 0; i < strlen(B_str); i++ )
B_chars[(int) B_str[i]]++;
/* check if A_str has which of them */
for( int i = 0; i < strlen(A_str); i++ )
B_chars[(int) A_str[i]] = 0;
/* If any of the B_chars[] has non-zero entry */
for( int i = 0; i < 256; i++ )
{
if( B_chars[i] != 0 )
{
return (false);
}
}
/* Otherwise return true */
return (true);
//This works for strings of a fixed length(here 10)..Its
written in assumption that strings are given in same case
completely(ie,india,INdia will be false witout modifican..
#include<stdio.h>
#include<string.h>
main(){
char a1[10],a2[10],cn[10]={0,0,0,0,0,0,0,0,0,0};
int i,j,k,l,c=0;
printf("enter string B\n");
scanf("%s",a1);
printf("enter string A\n");
scanf("%s",a2);
for(i=0;i<strlen(a1);i++){
for(j=0;j<strlen(a2);j++){
if(a1[i]==a2[j]){
c++;
cn[i]=1;
}}}
for(k=0;k<strlen(a1);k++){
if(cn[k]==0){
printf("FALSE\n");exit(0);}}
printf("TRUE\n");}
In the following pgm add a stmt in the function fun such
that the address of
'a' gets stored in 'j'.
main(){
int * j;
void fun(int **);
fun(&j);
}
void fun(int **k) {
int a =0;
/* add a stmt here*/
}
main()
{
{
unsigned int bit=256;
printf("%d", bit);
}
{
unsigned int bit=512;
printf("%d", bit);
}
}
a. 256, 256
b. 512, 512
c. 256, 512
d. Compile error
Given an array of size N in which every number is between 1
and N, determine if there are any duplicates in it. You are
allowed to destroy the array if you like.