Re: [gcj] why can't the residents of Saudi Arabia participate in Google Code jam?

2013-03-11 Thread Registered user
Bcoz there is chance of Explosion On Mon, Mar 11, 2013 at 10:03 PM, Konjoh Elvis wrote: > Sorry about that. > > > 2013/3/10 Iyabo Forrest > >> im pretty sure Saudi Arabia is a google subsidiary. >> On Mar 9, 2013 4:52 PM, "Saif Alharthi" wrote: >> > >> > hello , i was reading the terms and

Re: [gcj] Re: Google Code Jam 2013

2013-03-11 Thread Registered user
12 hours to go ... On Tue, Mar 12, 2013 at 11:28 AM, ADEGEYE MAYOWA wrote: > when is the registration starting/ > > > On Friday, 19 October 2012 16:49:34 UTC+1, Onufry Wojtaszczyk (Onufry) > wrote: >> >> Hello, all! >> We will be announcing Google Code Jam 2013 shortly. The schedule we have >> in

[gcj] Can anyone provide me the source code or link to code .

2013-03-10 Thread Registered user
Problem statement : Given N points of 2d Plane . you are required to find the k nearest point to a given point. After some search i came to know that i need to implement KD tree , but cannot understand how ?? Note: Efficient algorithm required , not Brute force . so if anyone can help me plz .. T

[gcj] can anyone explain the logic to approach this question. Lights Off

2013-02-22 Thread Registered user
problem statement link : http://www.codechef.com/problems/E2 -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-code+unsubscr...@googlegroups.com. To post

Re: [gcj] Future of Google Sites?

2013-02-04 Thread Registered user
Bartholomew Furror . Like On Mon, Feb 4, 2013 at 11:37 PM, Bartholomew Furrow wrote: > This mailing list is the wrong place to ask this question. A Google > search about Google Sites doesn't show anything to me about it shutting > down, so I'm assuming it isn't. :-) > > > On Mon, Feb 4, 2013 at

Re: [gcj] Re: CODECRACKER 2013 [codecracker.in]

2013-02-01 Thread Registered user
R u gone Mad, u r trying to clash with the timings of Facebook HackerCup 2013 .. u participate yourself. On Sat, Feb 2, 2013 at 12:06 AM, Wilber Torres wrote: > What is the page of judge online ? > > http://mukti.in/ mi browser canno't open > > > On Fri, Feb 1, 2013 at 7:28 AM, saurabh araiyer

Re: [gcj] In C , how do i create an array of size 10^9 ???

2013-01-27 Thread Registered user
terns can be discovered. > > Regards, > phunter > > On Sun, Jan 27, 2013 at 2:56 AM, Registered user > wrote: > > In C , how do i create an array of size 10^9 ??? > > > > -- > > You received this message because you are subscribed to the Google Groups >

[gcj] In C , how do i create an array of size 10^9 ???

2013-01-27 Thread Registered user
In C , how do i create an array of size 10^9 ??? -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googleg

Re: [gcj] matrix doubt .....

2012-07-14 Thread Registered user
; > By this way, you can easily enumerate moving up/down/left/right instead of > writing them four times. It more efficient for coding and less probable to > introduce bugs (due to typo or copy/paste). It is a good practical to > replace similar logicals and duplicate blocks with loop. >

[gcj] travelling salesman problem , any idea PLZ

2012-07-10 Thread Registered user
what algorithm should i go for to solve travelling salesman problem where number of cities can be upto 1000. and what to do if multiple ( i.e more than one salesman ) can be allowed to the deliver the grocery items. in a limited time of say 3 hours. the salesman travel through the vechile which

[gcj] matrix doubt .....

2012-06-28 Thread Registered user
final int[] mx = {0, 0, 1, -1}; final int[] my = {1, -1, 0, 0}; i found the above line of code, in many solution that was related to matrix (NxM). but i could not understand how it is being used. can any one explain a bit. or give any link reference where i can find some short of explanation r

Re: [gcj] Re: Command line tool issues during qualification round

2012-06-08 Thread Registered user
i m unable to login to link given by u : http://codejam-publictest.appspot.com/codejam/contest/35001/dashboard how do i login to this : i dont have LDAP username and password . On Sat, Jun 9, 2012 at 7:42 AM, jbernadas wrote: > A new version of the commandline has been pushed into the reposit

Re: [gcj] Solution list updated with solutions to problems A, B and C from today's Code Jam

2012-05-26 Thread Registered user
and where can we get the solution for problem D-large input. this is what i have been asking since one week how to solve the problems of larger matrix ( problems of matrix based on dfs ) Not even the top scorers solved :( On Sat, May 26, 2012 at 10:17 PM, Luke Pebody wrote: > The list of so

[gcj] Round 2 : enjoyed.... but alas....

2012-05-26 Thread Registered user
The last problem D large input could not be solved by anyone They could have solved it , if they would have had answered my questions. :p -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to google-co

[gcj] All the best for tomorrow, see u thr in the scoreboard...... :)

2012-05-25 Thread Registered user
All the best for tomorrow, see u thr in the scoreboard.. :) -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsu

[gcj] in java : number of test cases not given , dont mind i m just a begineer, i m here to learn from u all....

2012-05-24 Thread Registered user
how do i stop processing input how should i accept this input, no. of test cases not given i used below code but its giving error... plz help while(1==1) { i=scan.nextInt(); j=scan.nextInt(); //some processing n output } 1 10 100 200 201 210 900 1000 -- You received this message becaus

Re: [gcj] any good java coder here.....

2012-05-24 Thread Registered user
ns. My Maths instincts tell > me the answer is probably always going to be nm, nm-1 or nm-2 depending on > parity. I would use my brute forces to verify and/or correct that and try > and work out how to build such a path. > > > > On 24 May 2012, at 07:26, Registered user >

Re: [gcj] any good java coder here.....

2012-05-23 Thread Registered user
my understanding your logic > complexity is 5^n. It will give trouble in any language. > > > On Thu, May 24, 2012 at 11:31 AM, Registered user < > imregistere...@gmail.com> wrote: > >> why it is that sometimes java just gives up >> >> the problem sta

[gcj] any good java coder here.....

2012-05-23 Thread Registered user
why it is that sometimes java just gives up the problem statement is here : http://www.codeforces.com/contest/111/problem/E my solution at the below link : atleast when the loop finishes it must termininate but what the hell is in the below link code ,,, it works for small matrix upto 6x6 b

Re: [gcj] matrix traversesal of larger dimension ??? plz help

2012-05-20 Thread Registered user
yes , i need longest path. in a matrix of NxM ( 1000x1000) . On 5/20/12, Ioana Antoche wrote: > I would use bfs in stead of dfs, anyway something iterrative not recursive. > În data de 20.05.2012 11:36, "Registered user" a > scris: > >> how do i traverse a 2d matr

[gcj] Re: matrix traversesal of larger dimension ??? plz help

2012-05-20 Thread Registered user
sry forgot to mention , actually i had to find the longest path form source to destination in the matrix .. On 5/20/12, Registered user wrote: > how do i traverse a 2d matrix of larger dimension ( say 1000x1000 ). i > used dfs that showed correct answer for smaller dimension matr

[gcj] matrix traversesal of larger dimension ??? plz help

2012-05-20 Thread Registered user
how do i traverse a 2d matrix of larger dimension ( say 1000x1000 ). i used dfs that showed correct answer for smaller dimension matrix but when larger dimension matrix came then error popped up "Stack over flow .. :( " -- You received this message because you are subscribed to the Google Groups

Re: [gcj] DP approach

2012-05-20 Thread Registered user
is dis not contrary : decrease decrease. If we could only decrease the heights, this was a very easy question. but in current case heights can be decreased as well. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, s

[gcj] Re: BitSet in Java . how to use BitSet in the matrix form in java.....

2012-05-19 Thread Registered user
or boolean matrix : boolean bit[][]=new boolean(); what is the correct syntax... i cant use int bcoz memory is concerned as i need only boolean value so either to use BitSet or boolean . But how use it in matrix form ??? plz help.. On 5/19/12, Registered user wrote: > how to use BitSet in

[gcj] BitSet in Java . how to use BitSet in the matrix form in java.....

2012-05-19 Thread Registered user
how to use BitSet in the matrix form in java. how to get and set the value int BitSet matrix -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this grou

Re: [gcj] unsolvable problem

2012-05-18 Thread Registered user
can anyone plz tell how to use FASTOUTPUT to stdout. i have used here fast input but dont know how to use fastoutput. so i used System.out i know this is not the fast method to output... anyone plz help... -- You received this message because you are subscribed to the Google Groups "Google Code

Re: [gcj] unsolvable problem

2012-05-18 Thread Registered user
import java.io.*; import java.util.Scanner; public class Main{ static int parr[][]=null,block[][]=null; static int n,m,s,d,q,mindist=0,dist=0; public static void main(String args[]) throws java.lang.Exception { Parserdo

Re: [gcj] unsolvable problem

2012-05-18 Thread Registered user
the third sample output must be 8. On 5/18/12, vivek dhiman wrote: > Please help me solve this problem for cases with high number of nodes. I am > getting time limit exceeded. > > Ms.Kox enjoys a nice job of her interest, but she does not like to waste > much time on going-to/coming-from office.

Re: [gcj] In C++ dynamic array creation

2012-05-16 Thread Registered user
p; > for(int j=0; j temp.push_back(0); > arr2d.push_back(temp); > } > > Now you can use arr2d as simple as an array. > > arr2d[i][j] = any_value; > > Similarly you can create any dimensional arrays dynamically. > > On Tue, May 15, 2012 at 6:18 PM

[gcj] changing case of letter using BITWISE operators...

2012-05-16 Thread Registered user
this is the code for changing lower case to upper case. can u write something similar to dis for changing upper to lower case ,( i mean using BITWISE operators such type of operators ^ , | , & , ~ , ! ) #include #include using namespace std; int main() { string str; cin>>str; unsigned int i, n

[gcj] In C++ dynamic array creation

2012-05-15 Thread Registered user
how to create 2d or 3d array dynamically , giving the size at run time : for global array -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, s

Re: [gcj] topcoder , codeforces ... solution

2012-05-10 Thread Registered user
well u did not mention how to view the solutions submitted by the spoj users On 5/9/12, Luke Pebody wrote: > I'm a www.spoj.pl man. > On 8 May 2012 19:59, "Registered user" wrote: > >> kudos to u all my frnds :) >> >> also if you know some mor

Re: [gcj] topcoder , codeforces ... solution

2012-05-08 Thread Registered user
> by the points they earned. Double click it to view their code. >> >> I am sorry but I don't know much about CodeForce. >> >> On Tue, May 8, 2012 at 7:36 PM, Registered user > > wrote: >> >>> anyone having any idea , where can i view solutions

[gcj] topcoder , codeforces ... solution

2012-05-08 Thread Registered user
anyone having any idea , where can i view solutions submitted by others for the problems of these sites , topcode , codeforces -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to google-code@googlegroups.

[gcj] code jam winner or top top 50 finalists......

2012-05-01 Thread Registered user
what is the probability that among top finalists being offered to work for google as employees . or the winner is being offered job anyone one having any knowledge about past winner was offered job or whatever -- You received this message because you are subscribed to the Google Groups

Re: [gcj] Re: why is C++ the most common language amongst GCJ winning entries?

2012-05-01 Thread Registered user
lets plz close this thread... the person who asked has got the ans. and now plz do not reply anymore to this. lets have some mercy on the traffic. this thread is closed... On 1 May 2012 12:18, "Luke Pebody" wrote: > Agreed. I think Problem B could have been coded in Brainf*ck or something > like

[gcj] where can i clear my algorithm doubts ??? such type of algorithmic questions ... plz give any site ??

2012-04-30 Thread Registered user
where can i clear my algorithmic doubts ??? such type of algorithmic questions as in ACM/ICPC GCJ topcoder codeforces codechef etc ... plz give any site ?? is there any forum where users are ready to help ?? -- You received this message because you are subscribed to the Google Groups "Google C

[gcj] Registered user wants to chat

2012-04-30 Thread Registered user
--- Registered user wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-1620cfecbf-b38c36e181-NnCa6CbqO_WhLCrgeaQYIA

[gcj] any one has any idea about dis line of code , is it correct ????

2012-04-27 Thread Registered user
this is a c++ code : any one has any idea about dis line of code , is it correct and what it is doing , declaring an array of what dimension . short int dist[15][15][15][15][15][15][4][4]; -- You received this message because you are subscribed to the Google Groups "Google Code Jam" gro

[gcj] can anyone give some idea or hint how should i approach this problem. how should i procceed... cant get what logic should i apply . Plz Help.....

2012-04-20 Thread Registered user
can anyone give some idea or hint how should i approach this problem. how should i procceed... cant get what logic should i apply . Plz Help. thnks in advance.. Problem: Recently, with the release of the ultimate computing device bytePad, a platform game with the simple name "Rotation Puzz

Re: [gcj] What if we remove an edge from a graph

2012-04-20 Thread Registered user
i think if u mark the path which u want to block as visited beforehand then u may get it, m not sure but i think it should work. or if possilbe give the sample input / output cases , den i may solve it On 4/20/12, Andrey Ponomarev wrote: > Hypothesis 1: after eliminating one edge e' the sho

Re: [gcj] which IDE do top scorers use for C++.

2012-04-19 Thread Registered user
On Thu, Apr 19, 2012 at 4:52 PM, abhishek purwar > wrote: > >> @Luke Well said! ;) >> >> >> On Thu, Apr 19, 2012 at 4:43 PM, vivek dhiman >> wrote: >> >>> haha! >>> >>> On Thu, Apr 19, 2012 at 4:38 PM, Luke Pebody >&

[gcj] which IDE do top scorers use for C++.

2012-04-19 Thread Registered user
which IDE do top scorers use for C++. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com.

[gcj] Someone plz explain the conept for the problem Make it smooth, how to approach

2012-03-23 Thread Registered user
the link for the problem is : http://code.google.com/codejam/contest/544101/dashboard#s=p1 i cant understand what logic should i use : Recursion seems to be too tedious, the solutions submitted by the contestants are without reursion but couldnt follow them... -- You received this message b

[gcj] Re: Null String problem:-

2012-03-23 Thread Registered user
yes as Amahdy said : just introduce one more line n ur program will run correctly it works someone plz explain why it is so import java.util.Scanner; /**  *  * @author Pardeep  */ public class Reverse {    public void test(){        int n=0,l=0,i=0;             int j=0,c