Down two opposite sides of the board, except for the two squares on
the same end:

2x2: x x
     - -

3x3: x - x
     x - x
     - - -

4x4: x - - x
     x - - x
     x - - x
     - - - -

Dave

On Feb 4, 12:12 pm, Rahul Verma <rahulverma....@gmail.com> wrote:
> @king
> Can you pls told me that wat would be the position at where bishops
> might place in the 2X2, 3X3, 4X4 chessboard.....
>
> On Feb 4, 8:39 pm, subramania jeeva <subramaniaje...@gmail.com> wrote:
>
>
>
> > Use python for arithmetic operation of large numbers.. :)
>
> > Cheers
> >           ~ Jeeva ~
>
> > On Fri, Feb 4, 2011 at 8:32 PM, Manmeet Singh <mans.aus...@gmail.com> wrote:
> > > C/C++ user : Take input in a char array or string(if using C++) : a
> > > now do string addition. : a = a + a;
> > > now do string substraction. : a = a - 2.
>
> > > Java user : Use BigInt class
>
> > > On Fri, Feb 4, 2011 at 8:12 PM, Logic King 
> > > <crazy.logic.k...@gmail.com>wrote:
>
> > >> please help me solve the problem on SPOJ
>
> > >>https://www.spoj.pl/problems/BISHOPS/
>
> > >> The logic of the problem is very easy i.e. 2*n-2
> > >> but i am getting WA bcoz i am not able to deal with the large inputs.[?]
> > >> plz help me how to get this AC.........
>
> > >> #include<stdio.h>
> > >> int main()
> > >> {
> > >>     long long int n,bmax;
> > >>     while(scanf("%lld",&n)!=EOF)
> > >>     {
> > >>         if(n==1)
> > >>         printf("%d\n",1);
> > >>         else
> > >>         {
> > >>         bmax=(2*n)-2;
> > >>         printf("%lld\n",bmax);
>
> > >>         }
> > >>     }
> > >> return 0;
> > >> }
>
> > >> --
> > >> You received this message because you are subscribed to the Google Groups
> > >> "Algorithm Geeks" group.
> > >> To post to this group, send email to algogeeks@googlegroups.com.
> > >> To unsubscribe from this group, send email to
> > >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2Bunsubscribe@googlegroups
> > >>  .com>
> > >> .
> > >> For more options, visit this group at
> > >>http://groups.google.com/group/algogeeks?hl=en.
>
> > >  --
> > > You received this message because you are subscribed to the Google Groups
> > > "Algorithm Geeks" group.
> > > To post to this group, send email to algogeeks@googlegroups.com.
> > > To unsubscribe from this group, send email to
> > > algogeeks+unsubscr...@googlegroups.com<algogeeks%2Bunsubscribe@googlegroups
> > >  .com>
> > > .
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.
>
> >  325.png
> > < 1KViewDownload- Hide quoted text -
>
> - Show quoted text -

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to