\n also flushes the standard output buffer. If it is not present, it is
possible that you have previously entered data in it. Flushing also means
it forces printf to print on the screen as soon as \n is processed.
Otherwise it is buffered output and you can never predict how long would OS
buffe
http://placement.freshersworld.com/placement-papers/Persistent-/Placement-Paper-Whole-Testpaper-1884
question no. 4 in 5th section
On Thursday, September 6, 2012 4:40:08 PM UTC+5:30, isandeep wrote:
>
> Can you send the link to the question.
>
> On Thu, Sep 6, 2012 at 4:35 PM, te
M UTC+5:30, atul007 wrote:
>
> seems output should be 20.
>
> On Thu, Sep 6, 2012 at 3:26 PM, tendua >wrote:
>
>> from the set {a,b,c,d,e,f} find number of arrangements for 3 alphabets
>> with no data repeated?
>> Answer given is 360. but how?
>>
>
from the set {a,b,c,d,e,f} find number of arrangements for 3 alphabets with
no data repeated?
Answer given is 360. but how?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d
If nodes are numbered then simply make a boolean array and make the
corresponding element true after visiting the node. If nodes are string
then go for hashing. In Java you can use HashMap otherwise it'll take a
little more effort to implement it.
--
You received this message because you are
@Shilpa:
following your proposed algorithm answer to input matrix:
1 1 1
1 1 1
1 1 1
should be 27
but correct answer would be 6. It's an easy task to check out all
possible 6 states manually.
If you find the seventh way please post it.
On Jul 14, 11:31 pm, Rishabh Maurya wrote:
> It can be done i
We are given n by n boolean matrix ( n <= 20). Output of matrix should
be such that every row and every column should have only one true
value ( true=1, false=0). Input matrix can have any number of 1's and
there will be no row or column having all zero values. Example: let
n=4
Input Matrix:
1 0 1
swap(int *a, int *b)
> {
> *a ^= *b;
> *b ^= *a;
> *a ^= *b;
> }
>
> On Jul 12, 3:25 pm, Dave wrote:
>
>
>
>
>
>
>
> > @Tendua: The statement *a ^= *b ^= *a ^= *b violates the sequence
> > point rule, whic
# include
void swap(int *a, int *b)
{
*a ^= *b ^= *a ^= *b;
}
int main()
{
int a=45, b= 56;
// a ^= b ^= a ^= b;
swap(&a,&b);
printf("%d %d",a,b);
}
This code gives output 0, 45
While if we uncomment the line in main function
regarding question to the generic macro to swap int, float, double
# define swap(a,b) ((a)^=(b)^=(a)^=(b))
On Jul 12, 10:08 pm, Aniket Dutta wrote:
> c=a+b
> then find b=c-a;
> if this b equals previous one then ok else overflow
>
> On 7/9/11, John Hayes wrote:
>
> > regarding question relate
10 matches
Mail list logo
