Re: [algogeeks] spoj problem
well i have a doubt the test case says number could be as large as
10 and you have taken int but int does not have such range then how
it is accepted
On Sat, Mar 12, 2011 at 7:57 PM, Logic King crazy.logic.k...@gmail.comwrote:
Here is my solution.i got it AC
#includestdio.h
int gcd(int a, int b)
{ int temp;
while(b)
{
temp = a % b;
a = b;
b = temp;
}
return(a);
}
int main()
{
int n,i,min,ans=0;
scanf(%d,n);
int arr[n],ard[n];
ard[0]=1;
if(n0)
scanf(%d,arr[0]);
for(i=1;in;i++)
{
scanf(%d,arr[i]);
ard[i]=arr[i]-arr[i-1];
if(i==1)
min=ard[i];
else
min=gcd(min,ard[i]);
}
for(i=1;in;i++)
{
ans+=((ard[i]/min)-1);
}
printf(%d,ans);
return 0;
}
On Sat, Mar 12, 2011 at 7:37 PM, Balaji Ramani
rbalaji.psgt...@gmail.comwrote:
Yeah, I too am wondering how to implement more efficiently.
On Sat, Mar 12, 2011 at 7:36 PM, Satyam Kapoor
satyamkapoo...@gmail.comwrote:
@balaji:i hve got ac with gcd method but the time is 0.32 sec
best soln is 0.03
how is that achievable?
--
Satyam Kapoor
B.Tech 2nd year
Computer Science And Engineering
M.N.N.I.T ALLAHABAD
--
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.
--
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.
--
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.
--
*UTKARSH SRIVATAV*
*CSE-3
B-Tech 2nd Year
@MNNIT ALLAHABAD*
--
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.
Re: [algogeeks] spoj problem
i Agree.the test cases for which problem is being jugdged might not have
those larger values.
On Tue, Mar 15, 2011 at 12:20 PM, UTKARSH SRIVASTAV usrivastav...@gmail.com
wrote:
well i have a doubt the test case says number could be as large as
10 and you have taken int but int does not have such range then how
it is accepted
On Sat, Mar 12, 2011 at 7:57 PM, Logic King crazy.logic.k...@gmail.comwrote:
Here is my solution.i got it AC
#includestdio.h
int gcd(int a, int b)
{ int temp;
while(b)
{
temp = a % b;
a = b;
b = temp;
}
return(a);
}
int main()
{
int n,i,min,ans=0;
scanf(%d,n);
int arr[n],ard[n];
ard[0]=1;
if(n0)
scanf(%d,arr[0]);
for(i=1;in;i++)
{
scanf(%d,arr[i]);
ard[i]=arr[i]-arr[i-1];
if(i==1)
min=ard[i];
else
min=gcd(min,ard[i]);
}
for(i=1;in;i++)
{
ans+=((ard[i]/min)-1);
}
printf(%d,ans);
return 0;
}
On Sat, Mar 12, 2011 at 7:37 PM, Balaji Ramani rbalaji.psgt...@gmail.com
wrote:
Yeah, I too am wondering how to implement more efficiently.
On Sat, Mar 12, 2011 at 7:36 PM, Satyam Kapoor satyamkapoo...@gmail.com
wrote:
@balaji:i hve got ac with gcd method but the time is 0.32 sec
best soln is 0.03
how is that achievable?
--
Satyam Kapoor
B.Tech 2nd year
Computer Science And Engineering
M.N.N.I.T ALLAHABAD
--
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.
--
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.
--
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.
--
*UTKARSH SRIVATAV*
*CSE-3
B-Tech 2nd Year
@MNNIT ALLAHABAD*
--
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.
--
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.
[algogeeks] [brain teaser ] 15march
* barbershop **Problem Solution* * *A traveller arrives in a small town and decides he wants to get a haircut. There are only two barbershops in town - one on East Street and one on West Street. The East Street barbershop is a mess, and the barber has the worst haircut the traveller has ever seen. The West Street barbershop is neat and clean, its barber's hair looks as good as a movie star's. Which barbershop does the traveller go to for his haircut, and why? *Update Your Answers at *: Click Herehttp://dailybrainteaser.blogspot.com/2011/03/15march.html Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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.
Re: [algogeeks] spoj problem
@utraksh : 10^9 is well in int limits On Tue, Mar 15, 2011 at 12:56 PM, Satyam Kapoor satyamkapoo...@gmail.comwrote: @utkarsh:teri kismat acchi thi aur kuch nhimaze kar! --- Satyam Kapoor B.Tech-2nd Year MNNIT-Allahabad. -- 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. -- 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.
Re: [algogeeks] [brain teaser ] 15march
the west street barber has a hair style like a star..there r only 2 shop in that town and no one can cut his own hair.. so definitely the west barber went to east shop to cut his hair.. so the east barber is batter than west barber... On Tue, Mar 15, 2011 at 2:28 PM, amit singh amit.lu...@gmail.com wrote: to the east shop because he is busy doing other peoples hair and has no time for himself while the west one has no work and gets his hair done by the east shop barber :P On Tue, Mar 15, 2011 at 1:25 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: * barbershop **Problem Solution* * *A traveller arrives in a small town and decides he wants to get a haircut. There are only two barbershops in town - one on East Street and one on West Street. The East Street barbershop is a mess, and the barber has the worst haircut the traveller has ever seen. The West Street barbershop is neat and clean, its barber's hair looks as good as a movie star's. Which barbershop does the traveller go to for his haircut, and why? *Update Your Answers at *: Click Herehttp://dailybrainteaser.blogspot.com/2011/03/15march.html Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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. -- Amit Kumar Singh Software Engineer Samsung India Software Operations Banglore India -- 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. -- Ashu Agarwal MCA -BIT MESRA (Ranchi) -- 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.
[algogeeks] Re: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers
if m getting question correct then
the our task is to Given a total score n, print out all the
combination to compose n.
Examples:
For n = 1, the program should print following:
1
For n = 2, the program should print following:
1 1
2
For n = 3, the program should print following:
1 1 1
1 2
2 1
3
For n = 4, the program should print following:
1 1 1 1
1 1 2
1 2 1
1 3
2 1 1
2 2
3 1
and so on …
Algorithm:
At first position we can have three numbers 1 or 2 or 3.
First put 1 at first position and recursively call for n-1.
Then put 2 at first position and recursively call for n-2.
Then put 3 at first position and recursively call for n-3.
If n becomes 0 then we have formed a combination that compose n, so
print the current combination
so function looks like
void printCompositions(int n, int i)
{
/ int arr[ARR_SIZE];
if (n == 0)
{
printArray(arr, i);
}
else if(n 0)
{
int k;
for (k = 1; k = MAX_POINT; k++)
{
arr[i]= k;
printCompositions(n-k, i+1);
}
}
}
Please Correct me if i am wrong or you found for any test case it
failing
Thanks Regards
Shashank The Bets Way To Escape From The Problem is to Solve It
CSE, BIT Mesra
--
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.
[algogeeks] Crazy Question, Wants Creative Answer
U r watching an i cricket match.Suddenly the tv goes blank. Write the steps u ll take to find the fault purpose of this question is not to spamming but to taste how creative , innovative crazy one can think well what i found 1) See if some remote button is pressed by someone 2) Check the cable connectors 3) whats about amplifier if installed by operator in house 4) Check with your neighbors if there connection is also not working 5) Else notify the the operator i wants to see from all algogeeks what they think about this Q.. Thanks Regards Shashank -- 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.
[algogeeks] Re: Crazy Question, Wants Creative Answer
Hi, This question was asked in Microsoft written round.. Regards, Param http://teknotron-param.blogspot.com/ On Mar 15, 3:47 pm, bittu shashank7andr...@gmail.com wrote: U r watching an i cricket match.Suddenly the tv goes blank. Write the steps u ll take to find the fault purpose of this question is not to spamming but to taste how creative , innovative crazy one can think well what i found 1) See if some remote button is pressed by someone 2) Check the cable connectors 3) whats about amplifier if installed by operator in house 4) Check with your neighbors if there connection is also not working 5) Else notify the the operator i wants to see from all algogeeks what they think about this Q.. Thanks Regards Shashank -- 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.
[algogeeks] Need immediately Java Developer -- Albany,NY !!!!
Dear Folks, Wishes for the Day !!! We Need consultant for Java Developer Please share suitable profiles to s...@panzersolutions.com *Job Title :Java Developer Location : Albany,NY Duration :9 month Rate : $50/Hr* *MANDATORY EXPERIENCE:* 1. Eight (8) years experience in IT application development with a minimum of four (4) years JAVA Development Kit (JDK 1.5 and above) experience. 2. 12 months experience with developing web services using JAX-WS and JAXB 3.18 months experience in developing applications for IBM WebSphere Application Server 6.1 or above. ASSOCIATED SKILL SETS Candidates must also have four (4) of the preferred skilled sets listed below. Accordingly, candidates not meeting the supporting experiential specifications below will not be considered for the position. 1. Candidate has developed and deployed at least one Web service application on the IBM DataPower appliance model XI-50. 2. Candidate has experience with extracting detailed requirements from people ranging from non-technical to highly technical and turning the requirements into the best of breed solution. 3.Candidate exhibits strong interpersonal skills including communication, innovation, problem solving and possess the ability to be an integral part of a team and work together toward a shared goal 4. Familiarity with WS-I standards, specifically SOAP 1.1 and WS-Security. 5. Experience developing in IBM Message Broker. 6. Two (2) years of experience with, XSL, and XML Schemas 7. Familiarity with IBM MQ Series messaging. 8. Familiarity with IBM Websphere Service Integration Bus. 9. 12 months of experience working as a team’s technical lead. 10. 2 years experience focused on medium to large scale integration/development projects, inclusive of multiple integration points. - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
[algogeeks] Immediate interview need Java Developer with 2+ Years of JSF experience -- CA ......
Dear Folks, Wishes for the Day !!! We Need consultant for Java Developers with JSF Please share suitable profiles to s...@panzersolutions.com *Job Title : Java Developers with JSF Location : San Francisco, CA Duration : 9 month Rate : Market* 8+ Years of IT Exp and 2+ Years of JSF !! Skills: Java, J2EE, HTML, CSS, JavaScript, Unix, JVM, Spring, Hibernate, MySQL, Webservices, Subversion - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
Re: [algogeeks] Brainfuck compiler
I don't know about Windows 7, but there is an interpreter online, in case you want one. http://brainfuck.tk/ On Tue, Mar 15, 2011 at 5:15 PM, cegprakash cegprak...@gmail.com wrote: do anyone knows a brainfuck compiler for windows 7? I need a link to download it. I'm new to this group. Hope you guyz will help. -- 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. -- 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.
[algogeeks] Need immediately .NET Developer -- San Francisco, CA (Only Local to CA)
Dear Folks, Wishes for the Day !!! We Need consultant for .NET Developer Please share suitable profiles to s...@panzersolutions.com *Job Title :.NET Developer Location : San Francisco, CA (Only Local to CA)* *Duration : 6 +Month Rate : Market* REQUIREMENTS: Extensive experience in .NET 3.x/4.0 framework Extensive C# development experience in an 2008/2010 MS Visual Studio environment Expertise in building enterprise applications using Service Oriented Architecture. Expertise in building application using DDD (domain driven design) Expertise in implementing projects using ORM solutions such as nhibernate (not required if all other skills exist) Focus of work should be in Microsoft technologies, including .Net 3.5/4.0, C#, MVP, MVC, Windows Communications Foundation (WCF), Windows Workflow (WF), SQL Server 2008, and Visual Studio 2008/2010. 3 Developers Required – Must have: .Net, NHibernate and as many other bells whistles as possible such C#, MVC, SQL, Nunit etc…. - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
[algogeeks] Need .NET Developer -- San Francisco, CA
Dear Folks, Wishes for the Day !!! We Need consultant for .NET Developer Please share suitable profiles to s...@panzersolutions.com *Job Title :.NET Developer Location : San Francisco, CA Duration : 6 +Month Rate : Market* REQUIREMENTS: Extensive experience in .NET 3.x/4.0 framework Extensive C# development experience in an 2008/2010 MS Visual Studio environment Expertise in building enterprise applications using Service Oriented Architecture. Expertise in building application using DDD (domain driven design) Expertise in implementing projects using ORM solutions such as nhibernate (not required if all other skills exist) Focus of work should be in Microsoft technologies, including .Net 3.5/4.0, C#, MVP, MVC, Windows Communications Foundation (WCF), Windows Workflow (WF), SQL Server 2008, and Visual Studio 2008/2010. 3 Developers – Must have: .Net, NHibernate and as many other bells whistles as possible such C#, MVC, SQL, Nunit etc…. - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
Re: [algogeeks] Brainfuck compiler
Just out of interest. What are you planning to write in brainfuck? On 15 March 2011 14:58, Natansh Verma natansh.ve...@gmail.com wrote: I don't know about Windows 7, but there is an interpreter online, in case you want one. http://brainfuck.tk/ On Tue, Mar 15, 2011 at 5:15 PM, cegprakash cegprak...@gmail.com wrote: do anyone knows a brainfuck compiler for windows 7? I need a link to download it. I'm new to this group. Hope you guyz will help. -- 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. -- 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. -- 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.
Re: [algogeeks] Brainfuck compiler
I used a prgram of c which converts brainfuck program to C progaram which u can compile using gcc On Tue, Mar 15, 2011 at 9:12 PM, Carl Barton odysseus.ulys...@gmail.comwrote: Just out of interest. What are you planning to write in brainfuck? On 15 March 2011 14:58, Natansh Verma natansh.ve...@gmail.com wrote: I don't know about Windows 7, but there is an interpreter online, in case you want one. http://brainfuck.tk/ On Tue, Mar 15, 2011 at 5:15 PM, cegprakash cegprak...@gmail.com wrote: do anyone knows a brainfuck compiler for windows 7? I need a link to download it. I'm new to this group. Hope you guyz will help. -- 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. -- 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. -- 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. -- Kumar Anurag -- 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.
Re: [algogeeks] Brainfuck compiler
@carl : may be this : https://www.spoj.pl/problems/SBSTR1/ On Tue, Mar 15, 2011 at 9:35 PM, kumar anurag anurag.it.jo...@gmail.comwrote: I used a prgram of c which converts brainfuck program to C progaram which u can compile using gcc On Tue, Mar 15, 2011 at 9:12 PM, Carl Barton odysseus.ulys...@gmail.comwrote: Just out of interest. What are you planning to write in brainfuck? On 15 March 2011 14:58, Natansh Verma natansh.ve...@gmail.com wrote: I don't know about Windows 7, but there is an interpreter online, in case you want one. http://brainfuck.tk/ On Tue, Mar 15, 2011 at 5:15 PM, cegprakash cegprak...@gmail.comwrote: do anyone knows a brainfuck compiler for windows 7? I need a link to download it. I'm new to this group. Hope you guyz will help. -- 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. -- 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. -- 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. -- Kumar Anurag -- 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. -- 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.
Re: [algogeeks] Link list Problem
1-2-3-4-5 Start from any position ,have two pointers ,let that be a and b.Let a follow b,so that when b reaches right value ,a will be one node lacking,once b node is to be deleted,get the address of b node pointing and change the address of a pointing to the address b pointing to. 1-2-3-4-5 ^ ^ | | a b -- 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.
[algogeeks] Python tutorials required.
Hello everyone. I'm going to start learning PYTHON. If anyone knows the links or books of the basics,kindly lemme know. Thanks in advance. -Vishnutej.Mylavarapu -- 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.
Re: [algogeeks] Spoj Problem
It fails for input 1,2,3. I think there needs to be one more iteration to
check if the candidate is actually a majority element or not.
Thanks,
Balaji.
On Tue, Mar 15, 2011 at 9:50 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
CAN ANYONE PLEASE TELL ME WHY MY CODE IS GIVING WRONG ANSWER OR SOMEONE WHO
HAS GOT AC IN THIS PROBLEM MAY POST HIS SOLUTION
#includestdio.h
main()
{
long long int n,t,r,count,major,i;
scanf(%lld,t);
while(t--)
{
scanf(%lld,n);
scanf(%lld,r);
major=r;
count=1;
for(i=1;in;i++)
{
scanf(%lld,r);
if(r!=major)
{
count--;
if(count0)
{count=1;
major=r;
}
}
else
{
count++;
}
}
if(count=0)
printf(NO\n);
else
printf(YES%lld\n,major);
}
return 0;
}
--
*UTKARSH SRIVATAV*
*CSE-3
B-Tech 2nd Year
@MNNIT ALLAHABAD*
--
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.
--
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.
Re: [algogeeks] Python tutorials required.
try this link .. it's good for beginner level http://freevideolectures.com/Course/2512/Python-Programming Thank you, Srirang Ranjalkar -- Luck is when hard work meets opportunity On Tue, Mar 15, 2011 at 10:50 PM, Natansh Verma natansh.ve...@gmail.comwrote: The best books would be by Mark Lutz - Learning Python and Programming Python. Otherwise, head to the site www.python.org Natansh On Tue, Mar 15, 2011 at 10:43 PM, Vishnutej mylavarapu.vishnu...@gmail.com wrote: Hello everyone. I'm going to start learning PYTHON. If anyone knows the links or books of the basics,kindly lemme know. Thanks in advance. -Vishnutej.Mylavarapu -- 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. -- 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. -- 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.
Re: [algogeeks] Python tutorials required.
Resource to learn python http://www.slideshare.net/kracekumar/learn-python-7173668 http://www.slideshare.net/kracekumar/workshop-programs -- 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.
Re: [algogeeks] Spoj Problem
hey link to the problem??
On Tue, Mar 15, 2011 at 10:50 PM, Balaji Ramani
rbalaji.psgt...@gmail.comwrote:
It fails for input 1,2,3. I think there needs to be one more iteration to
check if the candidate is actually a majority element or not.
Thanks,
Balaji.
On Tue, Mar 15, 2011 at 9:50 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.com wrote:
CAN ANYONE PLEASE TELL ME WHY MY CODE IS GIVING WRONG ANSWER OR SOMEONE
WHO HAS GOT AC IN THIS PROBLEM MAY POST HIS SOLUTION
#includestdio.h
main()
{
long long int n,t,r,count,major,i;
scanf(%lld,t);
while(t--)
{
scanf(%lld,n);
scanf(%lld,r);
major=r;
count=1;
for(i=1;in;i++)
{
scanf(%lld,r);
if(r!=major)
{
count--;
if(count0)
{count=1;
major=r;
}
}
else
{
count++;
}
}
if(count=0)
printf(NO\n);
else
printf(YES%lld\n,major);
}
return 0;
}
--
*UTKARSH SRIVATAV*
*CSE-3
B-Tech 2nd Year
@MNNIT ALLAHABAD*
--
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.
--
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.
--
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.
Re: [algogeeks] Spoj Problem
http://www.spoj.pl/problems/MAJOR/
http://www.spoj.pl/problems/MAJOR/Thanks,
Balaji.
On Tue, Mar 15, 2011 at 11:00 PM, Akshata Sharma
akshatasharm...@gmail.comwrote:
hey link to the problem??
On Tue, Mar 15, 2011 at 10:50 PM, Balaji Ramani rbalaji.psgt...@gmail.com
wrote:
It fails for input 1,2,3. I think there needs to be one more iteration to
check if the candidate is actually a majority element or not.
Thanks,
Balaji.
On Tue, Mar 15, 2011 at 9:50 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.com wrote:
CAN ANYONE PLEASE TELL ME WHY MY CODE IS GIVING WRONG ANSWER OR SOMEONE
WHO HAS GOT AC IN THIS PROBLEM MAY POST HIS SOLUTION
#includestdio.h
main()
{
long long int n,t,r,count,major,i;
scanf(%lld,t);
while(t--)
{
scanf(%lld,n);
scanf(%lld,r);
major=r;
count=1;
for(i=1;in;i++)
{
scanf(%lld,r);
if(r!=major)
{
count--;
if(count0)
{count=1;
major=r;
}
}
else
{
count++;
}
}
if(count=0)
printf(NO\n);
else
printf(YES%lld\n,major);
}
return 0;
}
--
*UTKARSH SRIVATAV*
*CSE-3
B-Tech 2nd Year
@MNNIT ALLAHABAD*
--
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.
--
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.
--
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.
--
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.
[algogeeks] Need DB2 DBA with AIX -- Baltimore,MD
Dear Folks, Wishes for the Day !!! We Need consultant for DB2 DBA with AIX Please share suitable profiles to s...@panzersolutions.com *Job Title : DB2 DBA with AIX Location : Baltimore,MD Duration : 6 Months Rate : Market* Required Skills: DB2 DBA with AIX - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
[algogeeks] Need immediately Documentum Consultant -- TX
Dear Folks, Wishes for the Day !!! We Need consultant for Documentum Consultant Please share suitable profiles to s...@panzersolutions.com *Job Title :Documentum Consultant Location : Houston, TX Duration : 6 Months Rate : Market* Required Skills: Documentum Consultant - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
Re: [algogeeks] Brainfuck compiler
Ahhh I see. Thanks On 15 March 2011 16:11, Ankur Khurana ankur.kkhur...@gmail.com wrote: @carl : may be this : https://www.spoj.pl/problems/SBSTR1/ On Tue, Mar 15, 2011 at 9:35 PM, kumar anurag anurag.it.jo...@gmail.comwrote: I used a prgram of c which converts brainfuck program to C progaram which u can compile using gcc On Tue, Mar 15, 2011 at 9:12 PM, Carl Barton odysseus.ulys...@gmail.comwrote: Just out of interest. What are you planning to write in brainfuck? On 15 March 2011 14:58, Natansh Verma natansh.ve...@gmail.com wrote: I don't know about Windows 7, but there is an interpreter online, in case you want one. http://brainfuck.tk/ On Tue, Mar 15, 2011 at 5:15 PM, cegprakash cegprak...@gmail.comwrote: do anyone knows a brainfuck compiler for windows 7? I need a link to download it. I'm new to this group. Hope you guyz will help. -- 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. -- 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. -- 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. -- Kumar Anurag -- 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. -- 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. -- 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.
Re: [algogeeks] Brainfuck compiler
@ kumar anurag : Can you please upload the code... On Wed, Mar 16, 2011 at 12:35 AM, Carl Barton odysseus.ulys...@gmail.comwrote: Ahhh I see. Thanks On 15 March 2011 16:11, Ankur Khurana ankur.kkhur...@gmail.com wrote: @carl : may be this : https://www.spoj.pl/problems/SBSTR1/ On Tue, Mar 15, 2011 at 9:35 PM, kumar anurag anurag.it.jo...@gmail.comwrote: I used a prgram of c which converts brainfuck program to C progaram which u can compile using gcc On Tue, Mar 15, 2011 at 9:12 PM, Carl Barton odysseus.ulys...@gmail.com wrote: Just out of interest. What are you planning to write in brainfuck? On 15 March 2011 14:58, Natansh Verma natansh.ve...@gmail.com wrote: I don't know about Windows 7, but there is an interpreter online, in case you want one. http://brainfuck.tk/ On Tue, Mar 15, 2011 at 5:15 PM, cegprakash cegprak...@gmail.comwrote: do anyone knows a brainfuck compiler for windows 7? I need a link to download it. I'm new to this group. Hope you guyz will help. -- 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. -- 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. -- 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. -- Kumar Anurag -- 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. -- 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. -- 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. -- 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.
Re: [algogeeks] Spoj Problem
tahnks balaji i have got ac in this problem my prog is same only in
the end i have taken a loop and
@ akshata the link for the prob is https://www.spoj.pl/problems/MAJOR/
MY CODE IS
#includestdio.h
main()
{
long long int n,t,r[100],count,major,i;
scanf(%lld,t);
while(t--)
{
scanf(%lld,n);
scanf(%lld,r[0]);
major=r[0];
count=1;
for(i=1;in;i++)
{
scanf(%lld,r[i]);
if(r[i]!=major)
{
count--;
if(count0)
{count=1;
major=r[i];
}
}
else
{
count++;
}
}
/*if(count=0)
printf(NO\n);
else
printf(YES%lld\n,major);*/
count=0;
for(i=0;in;i++)
{
if(r[i]==major)
count++;
}
if(countn/2)
printf(YES %lld\n,major);
else
printf(NO\n);
}
scanf(%lld,r[0]);
return 0;
}
On Tue, Mar 15, 2011 at 10:34 AM, Balaji Ramani
rbalaji.psgt...@gmail.comwrote:
http://www.spoj.pl/problems/MAJOR/
http://www.spoj.pl/problems/MAJOR/Thanks,
Balaji.
On Tue, Mar 15, 2011 at 11:00 PM, Akshata Sharma
akshatasharm...@gmail.com wrote:
hey link to the problem??
On Tue, Mar 15, 2011 at 10:50 PM, Balaji Ramani
rbalaji.psgt...@gmail.com wrote:
It fails for input 1,2,3. I think there needs to be one more iteration to
check if the candidate is actually a majority element or not.
Thanks,
Balaji.
On Tue, Mar 15, 2011 at 9:50 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.com wrote:
CAN ANYONE PLEASE TELL ME WHY MY CODE IS GIVING WRONG ANSWER OR SOMEONE
WHO HAS GOT AC IN THIS PROBLEM MAY POST HIS SOLUTION
#includestdio.h
main()
{
long long int n,t,r,count,major,i;
scanf(%lld,t);
while(t--)
{
scanf(%lld,n);
scanf(%lld,r);
major=r;
count=1;
for(i=1;in;i++)
{
scanf(%lld,r);
if(r!=major)
{
count--;
if(count0)
{count=1;
major=r;
}
}
else
{
count++;
}
}
if(count=0)
printf(NO\n);
else
printf(YES%lld\n,major);
}
return 0;
}
--
*UTKARSH SRIVATAV*
*CSE-3
B-Tech 2nd Year
@MNNIT ALLAHABAD*
--
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.
--
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.
--
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.
--
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.
--
*UTKARSH SRIVATAV*
*CSE-3
B-Tech 2nd Year
@MNNIT ALLAHABAD*
--
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.
Re: [algogeeks] Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! *
arjookumar2009ar...@gmail.com On 3/13/11, Srinivas Baravatula prodi...@gmail.com wrote: -- Forwarded message -- From: ZEAL DECESSUS zealg...@gmail.com Date: Sun, Mar 13, 2011 at 12:15 PM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: Adnan Chowdhury adnanchowdhu...@gmail.com, Srinivas Baravatula prodi...@gmail.com, bireshw...@gmail.com, eaali.551 eaali@gmail.com -- Forwarded message -- From: anuja srivastava emmaaa...@gmail.com Date: Sun, Mar 13, 2011 at 11:55 AM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: $nigdha $ingh sammy.sing...@gmail.com, $@ty@m kr!$#n@ ~~\ u have lost me\~~ samesat...@gmail.com, Gaurav Sant zealg...@gmail.com, Gaurav raheja gaurav1may1...@gmail.com, Garima garimajaiswa...@gmail.com, ۩♫♣♠☻ÅÄЯÐỂЄ☺♪♦♥۩ aardee.ru...@gmail.com, *ArPiTa* ... rockingi...@gmail.com, Abhinesh Srivastava abhines...@gmail.com, apeksha katti appuka...@gmail.com, APURVA...W@YBEYOND DE$CR!PT!ON maish...@gmail.com, Avantika srivastava avantika.lik...@gmail.com, Lage Raho.. Abhinav Bhai... abhinav@gmail.com, TiMe 2 rIsE bAcK FrOm My AsHeS srivastava.sri...@gmail.com, varun.. life has takn a U-turn for U varun20...@gmail.com, «╬♥ÁŶÚŚℋℳÁÁŃ♥╬« «╬♥ŚℛℐVÁŚŤÁV♥╬« ayushmaan2...@gmail.com, ♥♫¤█ ♣KAI♣ █¤♫♥ i m a nut bt i screw well... nishanktheh...@gmail.com, Apoorve Mathur my lyf s my msg! naughtyangl...@gmail.com, tRIShA__ STAndNG alonE HapPILy** trishathetr...@gmail.com, Purva:dhoop bina saaya bhi sar se nahi utarta tulip...@gmail.com, !SoUmIl!~ some blessings stay life long !!! akonsoumi...@gmail.com, @bhay_Pratap_ $ingh abhayprata...@gmail.com, zaheen: wandering... zahee...@gmail.com, IMRAN ●๋•m ک✝íll álőńểツ imranpi...@gmail.com, SaUmYa-Contended Wid Little,Yet Wishing More! saumya0...@gmail.com, chaitanya mohan chaitanya_mohan2...@yahoo.co.in, Charu Goyal charugoya...@gmail.com, мя. ηανєєη●•ツ • » ιѕтｿℓє ρнσтσgяαρнєя « • naveenkhatore@gmail.com, ^^^ Neha shukla ^^^ nsnehashuk...@gmail.com, *^nEhA nAvLaNi^* neha.28...@gmail.com -- Forwarded message -- From: komal gupta komalbl...@gmail.com Date: Sat, Mar 12, 2011 at 11:31 AM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: PRIYANKA DEANE priyankade...@gmail.com, Ashish Gupta ashish.kumar.gu...@gmail.com, i lov my atitute an its al dat maters~ gaurav.smackc...@gmail.com, AKSHAY KUMAR GUPTA winsaks...@gmail.com, AnuJA SriVaStAvA emmaaa...@gmail.com, .Akanksha... Singh triad.akank...@gmail.com, Amit Agarwal...bindaas anshubhaiya...@rediffmail.com, Akash Sharma akash_smart_coo...@yahoo.com, AmIShA \RuM of HearT...\ amishaang...@gmail.com, Aparna Srivastava aparna_sr...@rediffmail.com -- Forwarded message -- From: komal gupta komalbl...@gmail.com Date: Sat, Mar 12, 2011 at 11:29 AM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: pooja srivastava poojasrivastav...@gmail.com -- Forwarded message -- From: apoorva sawlani sawlani.apoo...@gmail.com Date: Fri, Mar 11, 2011 at 9:16 PM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: Ankit Arora ankit.aa...@yahoo.co.in, arora.ankit...@gmail.com, ashwani jaiswal ashwani.jaiswa...@gmail.com, akash.dixi...@yahoo.in, kunal anand INSOMNIAC kunal_anan...@yahoo.com, astha21...@gmail.com, Ali Ahmad Roll No. 6 ali.p...@gmail.com, Amit Sawlani amitsawl...@gmail.com, vaishali agarwal ag.vaish...@gmail.com, bindas mirchi bindasmir...@gmail.com, CHIRAG suchdeva chiragsuchdeva201...@gmail.com, Deepak deepak2...@gmail.com, dilip sadhwani kool_estran...@yahoo.com, Gundeep Malhotra Welcome Ruhaan my love malhotragund...@gmail.com, Garvit prakash garvitprak...@yahoo.co.in, gandhi.ja...@gmail.com, Garima Sawlani garima.sawl...@gmail.com, hitear...@gmail.com, HARSH AWASTHI try to make happy everyone harsh.vikas1...@gmail.com, HiM@N$Hu **ThE sAiLoR mAn** rishu@gmail.com, Himanshu Sawlani himanshu.sm...@gmail.com, ●๋•hw í ฬ!รђ dá✝ ย ςยﾜ ђƹคг ๓ƹ ฬƹภ เ รคאஇ ntn.s...@gmail.com, kUsHaL KrIpLaNi. njoin lyf... kushal...@gmail.com, kaustubh rocks kaustubhrock...@gmail.com, life is smooth.. its jst d way u tak it.. komalbl...@gmail.com, mridul girdhar mridul@gmail.com, manojrloh...@gmail.com, manu_bvm...@rediffmail.com, Manish Keshwani dmad...@gmail.com, MANISH VERMA manishverma0...@gmail.com, mayur raitani mayur.rait...@rediffmail.com, mohit garg mgar...@gmail.com, Monty ~ %*@# cOnfU$eD go4mo...@gmail.com, naina singh cutenaina.sin...@gmail.com, nehakar...@ibibo.com, ni...@galgotiasbschool.in, Neha Raitani (Bansal) neha1...@gmail.com, ηєєтιкα αgαяωαℓ neetikaagarwa...@gmail.com, pratik raj pratik...@gmail.com, Paulomi Das paulomidas.rbl...@gmail.com, prashant tiwari prashantdancelo...@gmail.com, priyank tandon priyanktand...@gmail.com, Purva:dhoop bina saaya
[algogeeks] Re: Link list Problem
the whole point of linked list is to use reference. so just simply replace values of current node with the next node's and have the pointer pointing to the node that's next to next. 1-2-3-4-tail saying you wanna remove 2, you have the pointer pointing to 3 and became 1-3-4-tail On Mar 13, 12:53 pm, UMESH KUMAR kumar.umesh...@gmail.com wrote: hi Given a singly Link list but Head of the List is unknown so my question is that How to delete a given node from the List??? -- 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.
Re: [algogeeks] Brainfuck compiler
the code is attached , u can covert bf program to c , more info is in the file On Wed, Mar 16, 2011 at 12:43 AM, Saikat Debnath crazysai...@gmail.comwrote: @ kumar anurag : Can you please upload the code... On Wed, Mar 16, 2011 at 12:35 AM, Carl Barton odysseus.ulys...@gmail.comwrote: Ahhh I see. Thanks On 15 March 2011 16:11, Ankur Khurana ankur.kkhur...@gmail.com wrote: @carl : may be this : https://www.spoj.pl/problems/SBSTR1/ On Tue, Mar 15, 2011 at 9:35 PM, kumar anurag anurag.it.jo...@gmail.com wrote: I used a prgram of c which converts brainfuck program to C progaram which u can compile using gcc On Tue, Mar 15, 2011 at 9:12 PM, Carl Barton odysseus.ulys...@gmail.com wrote: Just out of interest. What are you planning to write in brainfuck? On 15 March 2011 14:58, Natansh Verma natansh.ve...@gmail.com wrote: I don't know about Windows 7, but there is an interpreter online, in case you want one. http://brainfuck.tk/ On Tue, Mar 15, 2011 at 5:15 PM, cegprakash cegprak...@gmail.comwrote: do anyone knows a brainfuck compiler for windows 7? I need a link to download it. I'm new to this group. Hope you guyz will help. -- 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. -- 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. -- 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. -- Kumar Anurag -- 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. -- 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. -- 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. -- 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. -- Kumar Anurag -- 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. /* * BF2C * Copyright (C) 2003 Thomas Cort * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ /* * Program Name: BF2C * Version: 1.0 * Date: 2003-03-18 * Description: Converts Brainfuck source to C source * License: GPL * Web page: http://www.brainfuck.ca * Download:
[algogeeks] Immediate interviews Need Java Developer // Austin,TX // $48/Hr
Dear Folks, Wishes for the Day !!! We Need consultant for Java Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Java Developer Location : Austin,TX Duration : 6+Months Rate : $48/Hr* Skills: EJB2.0 to EJB3.0) and debugging skills, advantageous, ksh and other scripting languages Working knowledge of Oracle Database systems Database management and reporting skills - familiarity with SQL querying, PL/SQL, ODBC connectivity, SQL Server Reporting Services (SSRS) knowledge. Working experience (Linux, HPUX) Web application development experience, GUI, etc. - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
[algogeeks] Need Java Developer -- Austin,TX -- $48/Hr
Dear Folks, Wishes for the Day !!! We Need consultant for Java Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Java Developer Location : Austin,TX Duration : 6+Months Rate : $48/Hr* Skills: EJB2.0 to EJB3.0) and debugging skills, advantageous, ksh and other scripting languages Working knowledge of Oracle Database systems Database management and reporting skills - familiarity with SQL querying, PL/SQL, ODBC connectivity, SQL Server Reporting Services (SSRS) knowledge. Working experience (Linux, HPUX) Web application development experience, GUI, etc. - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
[algogeeks] Need SSIS/SSRS developer with CRM // TX ........
Dear Folks, Wishes for the Day !!! We Need consultant for SSIS/SSRS developer with CRM Please share suitable profiles to s...@panzersolutions.com *Job Title : SSIS/SSRS developer with CRM Location : Houston, TX Duration : 6+Months Rate : Market* Required Skills Must have experience with Cognos along with SSRS/SSIS and CRM - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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.
Re: [algogeeks] Crazy Question, Wants Creative Answer
- Check whether only the screen has gone blank or the sound is gone as well. - Check by changing the channel. - Check if other applianes are working or the electricity is gone. - Check the TV power connection. - I'll wait for some time, if only this channel has gone blank. Nikhil Jindal https://sites.google.com/site/aboutnikhiljindal/ On Tue, Mar 15, 2011 at 4:17 PM, bittu shashank7andr...@gmail.com wrote: U r watching an i cricket match.Suddenly the tv goes blank. Write the steps u ll take to find the fault purpose of this question is not to spamming but to taste how creative , innovative crazy one can think well what i found 1) See if some remote button is pressed by someone 2) Check the cable connectors 3) whats about amplifier if installed by operator in house 4) Check with your neighbors if there connection is also not working 5) Else notify the the operator i wants to see from all algogeeks what they think about this Q.. Thanks Regards Shashank -- 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. Please access the attached hyperlink for an important electronic communications disclaimer: http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php -- 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.
Re: [algogeeks] SPoj maximum sum subseuence
Hey Ankur,
Why dont u just modify the findx function itself to return the frequency of
occurence of maxsum as well.
On Sun, Mar 13, 2011 at 12:26 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote:
https://www.spoj.pl/problems/MAXSUMSQ/
Hi in above problem , i am getting TLE but according to given contraints ,
i think my code is good enough to run. Can any body help me here
#include vector
#include map
#include algorithm
#include cstring
#include iostream
#include cstdio
#include cmath
#include cstdlib
#include climits
#define VI vector int
typedef long long int LL;
using namespace std;
VI v;
LL x,nos;
//finding maximum sum subsequence
LL findx()
{
int sz=v.size();
LL maxsum=INT_MIN;
int maxstart=0,maxend=0;
LL currentsum=0;
int currentstart=0,currentend=0;
int freq=0;
for(currentend=0;currentendsz;currentend++)
{
currentsum=currentsum+v[currentend];
if(currentsum==maxsum) {
freq++;
}
if(currentsummaxsum)
{
maxsum=currentsum;
maxstart=currentstart;
maxend=currentend;
freq=0;
}
if(currentsum0)
{
currentstart=currentend+1;
currentsum=0;
}
}
return maxsum;
}
// main Program
int main()
{
// freopen(input.txt,r,stdin);
int test;
int num;
map LL , LL m;
cintest;
LL sum=0;
int n;
int i;
while(test--)
{
sum=0;
nos=0;
m.clear();
m[0]=1;
scanf(%d,n);
v.resize(n);
for(i=0;in;i++)
{
scanf(%d,v[i]);
}
x=findx();
nos=0;
//Remove this for loop. No need.
for(i=0;in;i++)
{
sum=sum+v[i];
nos=nos+m[sum-x];
m[sum]++;
}
coutx nosendl;
}
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.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
This shld help.
Cheers
Nikhil Jindal
https://sites.google.com/site/aboutnikhiljindal/
Please access the attached hyperlink for an important electronic communications
disclaimer: http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php
--
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.
Re: [algogeeks] Print Hello infinite..................
thanks a ton for the info... we didnt know about that :P...
btw for ur info.. we are not supposed to use loops as well..
On Fri, Mar 11, 2011 at 7:10 PM, Abhishek Mallick
abhishek.mallick2...@gmail.com wrote:
#include stdio.h
int main()
{
while(printf(Hello));
return 0;
}
On Thu, Mar 10, 2011 at 11:58 AM, Nishant Agarwal
nishant.agarwa...@gmail.com wrote:
#includestdio.h
void print1();
void print2()
{
printf(Hello\n);
print1();
}
void print1()
{
printf(Hello\n);
print2();
}
int main()
{
print1();
}
On Thu, Mar 10, 2011 at 11:47 AM, nidhi jain
nidhi.jain311...@gmail.comwrote:
@abhishek:isn't it recursion?
--
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.
--
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.
--
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.
--
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.
Re: [algogeeks] Print Hello infinite..................
@nidhi: yup.. u r rite.. sorry..my bad...
On Thu, Mar 10, 2011 at 11:58 AM, Nishant Agarwal
nishant.agarwa...@gmail.com wrote:
#includestdio.h
void print1();
void print2()
{
printf(Hello\n);
print1();
}
void print1()
{
printf(Hello\n);
print2();
}
int main()
{
print1();
}
On Thu, Mar 10, 2011 at 11:47 AM, nidhi jain
nidhi.jain311...@gmail.comwrote:
@abhishek:isn't it recursion?
--
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.
--
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.
--
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.
Re: [algogeeks] SPOJ PROBLEM
Can you explain your code ?
On Thu, Mar 10, 2011 at 10:22 AM, UTKARSH SRIVASTAV usrivastav...@gmail.com
wrote:
WELL I HAVE DONE THIS PROBLEM .HERE IS THE CODE
#includestdio.h
#includealgorithm
using namespace std;
main()
{
long long int t[2][2010],price[2010],r,c,i,j,n;
scanf(%lld,n);
for(i=0;in;i++)
{
scanf(%lld,price[i]);
}
for(r=n-1,c=0;r=0c=n-1;r--,c++)
{
for(i=r,j=n-1;i=0j=c;j--,i--)
t[i1][j]=max(price[i]*(n+i-j)+t[(i+1)1][j],price[j]*(n+i-j)+t[i1][j-1]);
}
printf(%lld\n,t[0][n-1]);
return 0;
}
On Wed, Mar 9, 2011 at 5:10 PM, Algoose chase harishp...@gmail.comwrote:
Hi,
Any solution other than brute force(exponential growth) for this problem ?
On Sun, Mar 6, 2011 at 6:42 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.com wrote:
can anyone please tell me why i am getting wrong answer for
problem.https://www.spoj.pl/problems/TRT/
.
.
.
MY CODE IS THIS AND TO BE TESTED IN gcc COMPILER
#includestdio.h
double a[2100];
double fun(long long int m,long long int n,double count)
{
double k,l;
count++;
if(m==n)
{
return count*a[m];
}
if((k=(fun(m+1,n,count)))(l=(fun(m,n-1,count
{
return (count*a[m]+k);
}
else
{
return (count*a[n]+l);
}
}
int main()
{
long long int i,m,n;
double ans,c=0;
scanf(%lld,n);
for(i=1;i=n;i++)
{
scanf(%lf,a[i]);
}
m=1;
ans=fun(m,n,c);
printf(%.0lf\n,ans);
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.
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.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
UTKARSH SRIVATAV
CSE-3
B-TECH 2nd YEAR
MNNIT ALLAHABAD
--
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.
--
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.
Re: [algogeeks] Python tutorials required.
My suggestion: - Dive into python - http://diveintopython.org/ On Tue, Mar 15, 2011 at 2:23 PM, Srirang Ranjalkar srira...@gmail.comwrote: try this link .. it's good for beginner level http://freevideolectures.com/Course/2512/Python-Programming Thank you, Srirang Ranjalkar -- Luck is when hard work meets opportunity On Tue, Mar 15, 2011 at 10:50 PM, Natansh Verma natansh.ve...@gmail.comwrote: The best books would be by Mark Lutz - Learning Python and Programming Python. Otherwise, head to the site www.python.org Natansh On Tue, Mar 15, 2011 at 10:43 PM, Vishnutej mylavarapu.vishnu...@gmail.com wrote: Hello everyone. I'm going to start learning PYTHON. If anyone knows the links or books of the basics,kindly lemme know. Thanks in advance. -Vishnutej.Mylavarapu -- 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. -- 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. -- 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. -- Wesley Mesquita Computer Engineer http://www.wesleymesquita.com Mobile: +55 11 95249272 -- 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.
[algogeeks] what to learn python or perl
Hello everyone. I'm confused what to learn perl or python.I want to learn a scripting language. If anyone knows which is best among python or perl kindly suggest me. also send me the links or books of the basics,kindly let me know. Thanks in advance. AplomB -- 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.
Re: [algogeeks] Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! *
On 16/03/2011, arjoo kumar 2009ar...@gmail.com wrote: arjookumar2009ar...@gmail.com On 3/13/11, Srinivas Baravatula prodi...@gmail.com wrote: -- Forwarded message -- From: ZEAL DECESSUS zealg...@gmail.com Date: Sun, Mar 13, 2011 at 12:15 PM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: Adnan Chowdhury adnanchowdhu...@gmail.com, Srinivas Baravatula prodi...@gmail.com, bireshw...@gmail.com, eaali.551 eaali@gmail.com -- Forwarded message -- From: anuja srivastava emmaaa...@gmail.com Date: Sun, Mar 13, 2011 at 11:55 AM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: $nigdha $ingh sammy.sing...@gmail.com, $@ty@m kr!$#n@ ~~\ u have lost me\~~ samesat...@gmail.com, Gaurav Sant zealg...@gmail.com, Gaurav raheja gaurav1may1...@gmail.com, Garima garimajaiswa...@gmail.com, ۩♫♣♠☻ÅÄЯÐỂЄ☺♪♦♥۩ aardee.ru...@gmail.com, *ArPiTa* ... rockingi...@gmail.com, Abhinesh Srivastava abhines...@gmail.com, apeksha katti appuka...@gmail.com, APURVA...W@YBEYOND DE$CR!PT!ON maish...@gmail.com, Avantika srivastava avantika.lik...@gmail.com, Lage Raho.. Abhinav Bhai... abhinav@gmail.com, TiMe 2 rIsE bAcK FrOm My AsHeS srivastava.sri...@gmail.com, varun.. life has takn a U-turn for U varun20...@gmail.com, «╬♥ÁŶÚŚℋℳÁÁŃ♥╬« «╬♥ŚℛℐVÁŚŤÁV♥╬« ayushmaan2...@gmail.com, ♥♫¤█ ♣KAI♣ █¤♫♥ i m a nut bt i screw well... nishanktheh...@gmail.com, Apoorve Mathur my lyf s my msg! naughtyangl...@gmail.com, tRIShA__ STAndNG alonE HapPILy** trishathetr...@gmail.com, Purva:dhoop bina saaya bhi sar se nahi utarta tulip...@gmail.com, !SoUmIl!~ some blessings stay life long !!! akonsoumi...@gmail.com, @bhay_Pratap_ $ingh abhayprata...@gmail.com, zaheen: wandering... zahee...@gmail.com, IMRAN ●๋•m ک✝íll álőńểツ imranpi...@gmail.com, SaUmYa-Contended Wid Little,Yet Wishing More! saumya0...@gmail.com, chaitanya mohan chaitanya_mohan2...@yahoo.co.in, Charu Goyal charugoya...@gmail.com, мя. ηανєєη●•ツ • » ιѕтｿℓє ρнσтσgяαρнєя « • naveenkhatore@gmail.com, ^^^ Neha shukla ^^^ nsnehashuk...@gmail.com, *^nEhA nAvLaNi^* neha.28...@gmail.com -- Forwarded message -- From: komal gupta komalbl...@gmail.com Date: Sat, Mar 12, 2011 at 11:31 AM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: PRIYANKA DEANE priyankade...@gmail.com, Ashish Gupta ashish.kumar.gu...@gmail.com, i lov my atitute an its al dat maters~ gaurav.smackc...@gmail.com, AKSHAY KUMAR GUPTA winsaks...@gmail.com, AnuJA SriVaStAvA emmaaa...@gmail.com, .Akanksha... Singh triad.akank...@gmail.com, Amit Agarwal...bindaas anshubhaiya...@rediffmail.com, Akash Sharma akash_smart_coo...@yahoo.com, AmIShA \RuM of HearT...\ amishaang...@gmail.com, Aparna Srivastava aparna_sr...@rediffmail.com -- Forwarded message -- From: komal gupta komalbl...@gmail.com Date: Sat, Mar 12, 2011 at 11:29 AM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: pooja srivastava poojasrivastav...@gmail.com -- Forwarded message -- From: apoorva sawlani sawlani.apoo...@gmail.com Date: Fri, Mar 11, 2011 at 9:16 PM Subject: Fwd: Fw: Fwd: : PLEASE SIGN AND FORWARD!!! * To: Ankit Arora ankit.aa...@yahoo.co.in, arora.ankit...@gmail.com, ashwani jaiswal ashwani.jaiswa...@gmail.com, akash.dixi...@yahoo.in, kunal anand INSOMNIAC kunal_anan...@yahoo.com, astha21...@gmail.com, Ali Ahmad Roll No. 6 ali.p...@gmail.com, Amit Sawlani amitsawl...@gmail.com, vaishali agarwal ag.vaish...@gmail.com, bindas mirchi bindasmir...@gmail.com, CHIRAG suchdeva chiragsuchdeva201...@gmail.com, Deepak deepak2...@gmail.com, dilip sadhwani kool_estran...@yahoo.com, Gundeep Malhotra Welcome Ruhaan my love malhotragund...@gmail.com, Garvit prakash garvitprak...@yahoo.co.in, gandhi.ja...@gmail.com, Garima Sawlani garima.sawl...@gmail.com, hitear...@gmail.com, HARSH AWASTHI try to make happy everyone harsh.vikas1...@gmail.com, HiM@N$Hu **ThE sAiLoR mAn** rishu@gmail.com, Himanshu Sawlani himanshu.sm...@gmail.com, ●๋•hw í ฬ!รђ dá✝ ย ςยﾜ ђƹคг ๓ƹ ฬƹภ เ รคאஇ ntn.s...@gmail.com, kUsHaL KrIpLaNi. njoin lyf... kushal...@gmail.com, kaustubh rocks kaustubhrock...@gmail.com, life is smooth.. its jst d way u tak it.. komalbl...@gmail.com, mridul girdhar mridul@gmail.com, manojrloh...@gmail.com, manu_bvm...@rediffmail.com, Manish Keshwani dmad...@gmail.com, MANISH VERMA manishverma0...@gmail.com, mayur raitani mayur.rait...@rediffmail.com, mohit garg mgar...@gmail.com, Monty ~ %*@# cOnfU$eD go4mo...@gmail.com, naina singh cutenaina.sin...@gmail.com, nehakar...@ibibo.com, ni...@galgotiasbschool.in, Neha Raitani (Bansal) neha1...@gmail.com, ηєєтιкα αgαяωαℓ neetikaagarwa...@gmail.com, pratik raj pratik...@gmail.com, Paulomi Das paulomidas.rbl...@gmail.com, prashant tiwari
Re: [algogeeks] what to learn python or perl
Hello Python vs Perl been battle for more than 20 years.Perl is been around 23+ years(not sure,people say 25 years pls check) and python for 21 years. Python would be my choice 1.Python achieves code readability. 2.Python can do what perl can do. more on this fight you can find here http://infohost.nmt.edu/~tcc/help/lang/python/vsperl.html http://www.linuxjournal.com/article/3882 -- 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.
Re: [algogeeks] what to learn python or perl
I vote for python. On Wed, Mar 16, 2011 at 10:03 AM, kracekumar ramaraju kracethekingma...@gmail.com wrote: Hello Python vs Perl been battle for more than 20 years.Perl is been around 23+ years(not sure,people say 25 years pls check) and python for 21 years. Python would be my choice 1.Python achieves code readability. 2.Python can do what perl can do. more on this fight you can find here http://infohost.nmt.edu/~tcc/help/lang/python/vsperl.html http://www.linuxjournal.com/article/3882 -- 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. -- regards, chinna. -- 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.
[algogeeks] Find the first K smallest element from 1 million sized array ...Amazon Question..
Asked in Amazon interview.. Find the first K smallest element from 1 million sized array . Assume your ram memory is so small that it cannot accommodate all 1 Million element at once. Guys provide your inputs on the same... Thanks, Ankit -- 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.
Re: [algogeeks] Print Hello infinite..................
@All:
it is not possible.
as you your target program contain finite number of instraction and execute
some instruction many times. what ever tips you are using in your high lavel
program must convet to Assembly program contains some GOTO (ultimately all
loop converted into JUMP call)or Use stack to execute print statement
several time.
On Fri, Mar 11, 2011 at 2:14 PM, Abhishek Sharma jkabhishe...@gmail.comwrote:
@nidhi: yup.. u r rite.. sorry..my bad...
On Thu, Mar 10, 2011 at 11:58 AM, Nishant Agarwal
nishant.agarwa...@gmail.com wrote:
#includestdio.h
void print1();
void print2()
{
printf(Hello\n);
print1();
}
void print1()
{
printf(Hello\n);
print2();
}
int main()
{
print1();
}
On Thu, Mar 10, 2011 at 11:47 AM, nidhi jain
nidhi.jain311...@gmail.comwrote:
@abhishek:isn't it recursion?
--
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.
--
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.
--
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.
--
DIPANKAR DUTTA
M-TECH,Computer Science Engg.
EC Dept,IIT ROORKEE
Uttarakhand , India – 247667
---
website:http://people.iitr.ernet.in/shp/09535009/Website/index.html
ph no-09045809987
Lab: 286454
email:dipan...@iitr.ernet.in
--
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.
Re: [algogeeks] Find the first K smallest element from 1 million sized array ...Amazon Question..
use heap tree to slove this.. plz see careercup post.. On Wed, Mar 16, 2011 at 10:31 AM, Ankit Sinha akki12...@gmail.com wrote: Asked in Amazon interview.. Find the first K smallest element from 1 million sized array . Assume your ram memory is so small that it cannot accommodate all 1 Million element at once. Guys provide your inputs on the same... Thanks, Ankit -- 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. -- DIPANKAR DUTTA M-TECH,Computer Science Engg. EC Dept,IIT ROORKEE Uttarakhand , India – 247667 --- website:http://people.iitr.ernet.in/shp/09535009/Website/index.html ph no-09045809987 Lab: 286454 email:dipan...@iitr.ernet.in -- 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.
Re: [algogeeks] Re: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers
use DP see careercup.. On Tue, Mar 15, 2011 at 10:43 PM, albert theboss alberttheb...@gmail.comwrote: @bittu : many over lapping sub problems available in ur case ... better try dp to get the efficient solution... @all : suggest algo for the case without repetition. -- 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. -- DIPANKAR DUTTA M-TECH,Computer Science Engg. EC Dept,IIT ROORKEE Uttarakhand , India – 247667 --- website:http://people.iitr.ernet.in/shp/09535009/Website/index.html ph no-09045809987 Lab: 286454 email:dipan...@iitr.ernet.in -- 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.
Re: [algogeeks] Interesting DP Question
hey which is similar to knapsack problem ,which we study design and analysis of algorithms On Tue, Mar 15, 2011 at 3:51 PM, bittu shashank7andr...@gmail.com wrote: You have n1 items of size s1, n2 items of size s2, and n3 items of size s3. You’d like to pack all of these items into bins each of capacity C, such that the total number of bins used is minimized. Thanks Shashank -- 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. -- 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.
Re: [algogeeks] Re: 10 digit problem
correct On Mon, Mar 14, 2011 at 1:37 PM, bittu shashank7andr...@gmail.com wrote: i don't think another answer 50 is best answer according to your constraints may sum1 else can think but i found its correct Thanks Shashank -- 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. -- DIPANKAR DUTTA M-TECH,Computer Science Engg. EC Dept,IIT ROORKEE Uttarakhand , India – 247667 --- website:http://people.iitr.ernet.in/shp/09535009/Website/index.html ph no-09045809987 Lab: 286454 email:dipan...@iitr.ernet.in -- 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.
