Hi,
An approach could be to guess the answer `A` and check if in `A` time, all
the tasks can be completed.
For checking, just iterate through the k people, the number of tasks
completed would be `A`/k[i] (integer division) for everyone.
If sigma(`A`/k[i]) >= N, `A` works. Now do a binary search to
Hi All,
Has anybody solved the following problem?
https://www.careercup.com/question?id=5196860946907136
-Pawan
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an
Hello,
I have been trying to solve this http://www.spoj.com/problems/HASHIT/problem
on SPOJ. I am getting Wrong Answer on submission, but my solution work fine
on the sample.
Please tell me where I am wrong. Here http://ideone.com/lMSw94 is my code.
Thanks in advance.
Amit Tiwari
BIT Mesra
--
any body know about juniper networks internship written test pattern..
please help me.
--
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
guys plzz help me wid the java book that i shld start ???
--
--
Ratan | Final Year | Information Technology | NIT 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
khalid mugal - A Programmers guide to Java certification
--
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
the very best book...no doubt..Khalid Mughal.
On Sat, Sep 22, 2012 at 2:10 PM, Ravi Ranjan ravi.cool2...@gmail.comwrote:
khalid mugal - A Programmers guide to Java certification
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
Hello,
I am working on PHP/HTML/ XML-RPC.
I have a website, where one link shows the list of files as checkboxes and
a submit button below that.
I am stuck at point where when submit button is clicked, it has to go to
another .php page and execute whatever is there in that .php file.
Form
Hi,
You need to correct ur form tag. Try:
form name=somename id=someid method=post action=theotherfile.php
Thanks,
Vandana
On Mon, Jul 16, 2012 at 12:42 PM, Nandita Raman
nandita.rama...@gmail.comwrote:
Hello,
I am working on PHP/HTML/ XML-RPC.
I have a website, where one link shows the
connect ur form with the file you want to get redirected to by:
form method=POST action=NAME_OF_FILE.php
input type=submit/
/form
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
http://www.codechef.com/problems/VOTERS
Here is my solution
Dont know y i m getting Runtime error..plz check..
#includecstdio
#includealgorithm
using namespace std;
int main()
{
int a,b,c,x[50001],i;
int s[11],count;
s[11]=0;
count=0;
#includecstdio
using namespace std;
int a,b,c,x[51],i;
int s[101],count;
int main()
{
scanf(%d%d%d,a,b,c);
for(i=0;ia;i++)
{
scanf(%d,x[i]);
s[x[i]]++;
}
for(i=0;ib;i++)
{
scanf(%d,x[i]);
s[x[i]]++;
}
It was telling that error after doing some modifications...
Yeah i think bharat u r saying correct...
I will try it...
Thanks for reply...
On Sat, Mar 31, 2012 at 11:45 AM, bharat b bagana.bharatku...@gmail.comwrote:
u should get an error: argument of type ‘void* (TraCISagar::)(void*)’ does
u should get an error: argument of type ‘void* (TraCISagar::)(void*)’ does
not match ‘void* (*)(void*)’ ...
The function which is threaded should be either static or global in pthread
implementation ...
On Tue, Mar 27, 2012 at 7:20 PM, Sagar Pareek sagarpar...@gmail.com wrote:
Thanks for reply
Thanks for reply
but tell me two thing , is it true or not?
is NULL is not equal to (void*)0 ??
AND
int a=20;
int b=(int)a ; // Whats wrong in here??
Similarly for
void * TraCISagar::sender(void* a);
then while calling in pthread as
pthread_create(thread1,NULL,(void*)sender,NULL)
instead of
Hello all,
I need help regarding thread implementation in C++
Here is my sample code...
*class TraCISagar : public BasicModule1 {
public:
.
.
void activity();
void* sender(void*);
.
.
};
void* TraCISagar::sender(void* a)
{
.
.
.
}
void TraCISagar::activity()
I think is error is in the 4th argument u r passing in this line *
pthread_create(thread1,NULL,(void*)sender,(void*)0);*
The 4th argument is expecting the address of the arguments , but the
address he is getting is 0 , which is not granted by OS . Tht address is
used by OS I guess .
Instead*
The problem is with the third argument in
*pthread_create(thread1,NULL,(void*)sender,(void*)0);*
*
*
It should just be sender or sender.
*pthread_create(thread1,NULL,sender,(void*)0);*
Thanks,
Senthil.
On Mon, Mar 26, 2012 at 5:25 PM, Sagar Pareek sagarpar...@gmail.com wrote:
Hello all,
I
Yaa Senthil is right , I overlooked it . In 3rd argument also it is
expecting an address while u r passing the pointer .
--
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
+1 techcoder,plzzz mail me 2..thanks in advance
Regards,
Payal Gupta
On Mon, Sep 12, 2011 at 11:01 AM, sukran dhawan sukrandha...@gmail.comwrote:
+1 to tech coder
On Mon, Sep 12, 2011 at 10:50 AM, tech coder techcoderonw...@gmail.comwrote:
if somebody has the preparation material and
if somebody has the preparation material and videos provided by
Careercup.com. Then please send me.
thanks.
--
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
+1 to tech coder
On Mon, Sep 12, 2011 at 10:50 AM, tech coder techcoderonw...@gmail.comwrote:
if somebody has the preparation material and videos provided by
Careercup.com. Then please send me.
thanks.
--
tech codYou received this message because you are subscribed to the Google
Groups
hi frnds
can any body tell me how a student can appear for amazon or microsoft , if
these comanies are not coming to the campus.
--
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.
go to this link and upload ur resume...they will call if they feel it is
good
http://www.india.amazon.com/Careers/
http://www.india.amazon.com/Careers/
On Mon, Aug 1, 2011 at 11:58 PM, coder dumca coder.du...@gmail.com wrote:
hi frnds
can any body tell me how a student can appear for amazon
can any one tell the best compiler for c and c++...
Thanks,
G. Shashank Reddy
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/g2ZE6Sm9p-MJ.
To post to this
In windows you can choose codeblocks or best is use linux gnu compiler
On Wed, Jun 15, 2011 at 8:50 PM, shashankreddy509
shashankreddy...@gmail.com wrote:
can any one tell the best compiler for c and c++...
Thanks,
G. Shashank Reddy
--
You received this message because you are
intel icc compiler
On Wed, Jun 15, 2011 at 08:20:39AM -0700, shashankreddy509 wrote:
can any one tell the best compiler for c and c++...
Thanks,
G. Shashank Reddy
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view
i need compiler for windows 7...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/Y9OZdeYwmggJ.
To post to this group, send email to
I would recommend you to read complete Java Reference book by Herbert
Schildt, it will take you nicely through the basics of creating window
based applications. First read the chapters on Applets and AWT and
then you should be able to easily and naturally graduate to using
Swing.
On Thu, Jun 9,
@naveen Thanks for the prompt reply
I am already aware of Applets and AWT and have started getting acquainted to
Swing
but the problem lies where to start from. Its like I want a small example or
few starting steps.
Complete Reference is the book that i refer.
On Thu, Jun 9, 2011 at 1:48 PM,
As soon as i type Java Swing PDFs in google, i get lots of results.
See if anyone of them can help you.
No tutorial i am having as such specifically for Swing.
On Thu, Jun 9, 2011 at 1:53 PM, snehi jain snehijai...@gmail.com wrote:
@naveen Thanks for the prompt reply
I am already aware of
i Did that before asking for help on the group.
anyways thanks :)
Swing isnt necessary, someone referred so i am trying to learn it.
Any info regarding desktop or phone apps. will be appreciated.
On Thu, Jun 9, 2011 at 2:00 PM, Navneet Gupta navneetn...@gmail.com wrote:
As soon as i type Java
Hi Snehi...Follow following links to kick-start your Swing!!
http://www.herongyang.com/Swing/Introduction-First-Swing-Program-SwingHello.html
http://www.herongyang.com/Swing/Introduction-First-Swing-Program-SwingHello.html
http://www.dreamincode.net/forums/topic/206319-first-swing-application/
hey Karan... thanks a lot
the links are helpful :)
its an app. that can help in building one's vocab.
its basically a thought right now. Will ask more when things start taking
desired shape a little bit.
On Thu, Jun 9, 2011 at 4:59 PM, karan sachan karansac...@gmail.com wrote:
Hi Snehi...Follow
Hi Guys ,
Can any one give link for tutorial or videos about
segment trees. I am unable to understand the basic idea behind it .
Regards,
vinod
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Question :Let A[1..n] be an array of integers. Design an efficient
divide and conquer algorithm to determine if A contains a majority
element, i.e an element appears more than n/2 times in A. What is the
time complexity of your algorithm?
Answer:
a[1..n] is an array
int majorityElement(int a[],
You have N marbles and K slots. You have to follow the below mentioned
rules :
1. You can put in a marble or take out a marble from slot numbered
1 at any time.
2. You can put in a marble or take out a marble from slot numbered
i only if there exists a marble at the slot i - 1.
3. The
Hi,
I hope this is correct. Please correct if I am wrong.
Short answer:
Let a = (k-n)/(n-1)
Let b = (k-n)%(n-1)
steps = (n-1)(a)(a+1)/2 + b
Put = steps + n
Remove = steps
Explanation:
Example with n = 3 k =10:
Start by putting balls in 1,2,3
1 2 3 x x x x x x
Now move balls from 1-3 to
You are given n coins, at least one of which is bad. All the good
coins weigh the same, and
all the bad coins weigh the same. The bad coins are lighter than the
good coins.
Find the exact number of bad coins by making O(logn)^2 weighings on a
balance. Each
weighing tells you whether the total
Problem D: Numbered Grid
A grid of size N rows and M columns is filled with numbers, one in
each cell. You start at the centre of the cell at the top-left corner
(1,1) and your destination is the centre of the cell at the bottom-
right corner(N,M). In each step, you are only allowed to move to
its a dp prob...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
I am trying to solve this problem, got some idea but am not
clear...please give your input...
http://www.codechef.com/problems/MONEY
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Hey anyone doing topcoder srm 375, please help me out in medium
question, question is..
Rabbits often feel lonely, so one group of rabbits decided to gather
together and play a game. The game is played on a horizontal row of N
cells (N = 2), numbered 0 to N - 1 from left to right. Each cell is
can you specify the question name or link of question on topcoder
--
Regards
Jitendra Kushwaha
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 algoge...@googlegroups.com.
To unsubscribe
Contest in running and you are posting the 550 points problem? Its unfair.
Ask after it gets over.
On 6 July 2010 17:30, crazysaikat crazysai...@gmail.com wrote:
Hey anyone doing topcoder srm 375, please help me out in medium
question, question is..
Rabbits often feel lonely, so one group of
Hi
I need to find x that will minimize Ax-b=0, under the inequality
constraints Cxd.
Actually the constraints in my problem are only upper and lower bounds
to x values.
x is 4x1 vector, A is about 100x4 (and b is of course 100x1(.
What is the appropriate algorithm?
Is there any C / C++ code
i attempting to solve a problem where a triangle contains many
white triangles and black triangles inside it.
it is required to find the largest white triangle.
the whole question can be found at :
http://acm.uva.es/p/v5/585.html
my code is pasted below :
can anyone please test my code and
hello friends i m trying to solve problem
http://online-judge.uva.es/p/v5/523.html
in this problem i using floyd's algorithm i m able to figure out total cost
but i m not able to figure out the path . may be the reason that i did not
understand the algorithm fully and i use it as a black box
Hi,
could anybody help me to solve this problem
http://acm.zju.edu.cn/show_problem.php?pid=1002
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
hi everybody i m trying to solve this problem but i can't sovle it ...plz
suggest me algorithm to solve it .
link http://students.iitk.ac.in/programmingclub/iopc/problems/
or problem itself is
Two electron are confined in a 1D infinite potential well. Each start from
opposite ends with
Question:
Given a program which can generate one of {1, 2, 3, 4, 5} randomly.
How can we get another generator which can generate one of
{1,2,3,4,5,6,7} randomly?
Thank you!
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the
Hi guys
I'm recently trying to study the Hopcroft-Karp Algorithm
that can compute the maximum matching of a bipartite
graph in O(sqrt(n)*m) complexity.
However I find it not so easy to understand.
Can anybody help me explaining how the algorithm works
or give me a working implementation of HK
hello to all you guys out there
i am a newbie to ACM
and i after i going to solve my first problem today
in http://acm.uva.es/p/v1/100.html
i write a program and i think it works corectly
but the Judge say me wrong answer wrong answer.
i would be grateful if you helping me
tanx in advance
Hi all. I have this problem with analysis of algorithms, I thought
maybe I could get some help here... It's not defined *that* strictly,
so I guess I shouldn't be looking for an exact solution. This is how it
goes:
hi guys need help..please
1. each student in a group of n students is scheduled to work one
shift, where each shift is a single congiguous interval of time. there
can be multiple shifts going on at once. devise an effiecient algorithm
to choose a smallest subset of these n students to form a
55 matches
Mail list logo
