I am not sure of a solution for this, but ain't this an NP-complete problem?
On 6/19/07, ihinayana [EMAIL PROTECTED] wrote:
Description:
Given a group of rectangles with different integer width and
height,such as 5*4, 2*3,1*7,etc. The total number of rectangles is
like 10 or more.The
On May 28, 6:21 pm, sl7fat [EMAIL PROTECTED] wrote:
hi i have an algorthim code and i have to find the time complixcity of
the code so can you plz help me ASAP the code is written done ,,
# include iostream.h
void main()
{
int a[10][4]=
{{ 16,17,19,13},
since your input is of fixed size, your algorithm always runs in
constant time. If the # of students and # of courses are variable, the
algorithm is O(n^2).
satya.
On 5/28/07, sl7fat [EMAIL PROTECTED] wrote:
hi i have an algorthim code and i have to find the time complixcity of
the code so
thanx for ur help :D
On May 28, 5:22 pm, Satya [EMAIL PROTECTED] wrote:
since your input is of fixed size, your algorithm always runs in
constant time. If the # of students and # of courses are variable, the
algorithm is O(n^2).
satya.
On 5/28/07, sl7fat [EMAIL PROTECTED] wrote:
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
I think a regular expression is just too hard, a CFG might be easier . Let
me know if you have a solution for regular expression
On 3/14/07, Ravi [EMAIL PROTECTED] wrote:
what will be a regular expression(non-UNIXone please) for the set of
languages which have number of 0s divisible by 5 and
A DFA is possible I guess which is interesting, see if the following
DFA works, since the existence of the DFA relates to the existence of
a Regular Expression Describing the language
State/Input 01
q00 q10 q01
q10 q20
If the DFA works then it can be converted to a regular expression
using standard techniques like the one described in
http://www.cs.colostate.edu/~whitley/CS301/L3.pdf
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
On 3/15/07, Ravi [EMAIL PROTECTED] wrote:
what will be a regular expression(non-UNIX one please) for the set of
languages which have number of 0s divisible by 5 and number of 1s
divisible by 2. The set of alphabets is {0,1}.
The following is based on `Parallel Regular Expressions'. If I
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
1. u should calculate the k variable, that is
if i+j=3 (i=1, j=2, or vice versa) then k=3
if i+j=4 (i=1, j=3, or vice versa) then k=2
if i+j=5 (i=2, j=3, or vice versa) then k=1
2. the last question give the answer to the last 2:
T(m) = 1 if n = 1
2*T(m - 1) + 1 if n 1
is the reccurence
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 frnz...
i'm very glad to c this site..
i'm a beginner can anyone suggest me a good book for DATA
STRUCTURES..., presently i'm practicing C++.
i'm very much thankful to u, if u do this...
--~--~-~--~~~---~--~~
You received this message because you are
Hi
there are plenty of websites that fetch you data and i feel that everything is just a click away.So just choose books if you want else just start learning via tutorials.
All the best.
Sriram.N
On 7/9/06, hosseingt [EMAIL PROTECTED] wrote:
hii'm a begginer.can anyone guide me how to start in
There is a lot of detail available on-line. If you google Dictionary
of Algorithms and Data Structures, and visit there, you'll be amazed
at the depth of the info.
A good book (not too hard, but something that covers the basics), is a
great asset to have. Perhaps someone here can recommend a
Norbert wrote:
I'm unable to solve this problem correctly. Please help me:
You have chess board of size N x M and a lot of bricks of size K x 1.
How many bricks can you place on this board (brick edges must be
pallarel to board edges)
Thanks for help
Chessboards are always perfectly
If M = N and M = K, then the solution is
N * (M/K) + (M - M/K*K) * (N/K)
Use integer division
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
On 6/23/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
If M = N and M = K, then the solution isN * (M/K) + (M - M/K*K) * (N/K)Use integer division
This solution is not corrent.
for example, M = N = 4, K = 2
N * (M/K) + (M - M/K*K) * (N/K) = 4 * ( 4 / 2 ) + ( 4 - 4 / 2 * 2 ) * ( 4 / 2 ) = 8
if the question is complete then the answer shd' be (N/K) * M bricksam i right??On 6/17/06, Norbert
[EMAIL PROTECTED] wrote:I'm unable to solve this problem correctly. Please help me:
You have chess board of size N x M and a lot of bricks of size K x 1.How many bricks can you place on this board
Sorry, you're wrong. Consider board of size N = 1, M = 5 and K = 2.
If you round down (N/K) then you have RESULT = 0. If you round up then
you have 5. Also wrong.
On 6/17/06, prashant bhargava [EMAIL PROTECTED] wrote:
if the question is complete then the answer shd' be (N/K) * M bricks
am i
There's another example if you use floating point arithmetic. N = 10,
M = 10, K = 4. Correct answer is 24, not 25
On 6/17/06, Norbert [EMAIL PROTECTED] wrote:
Sorry, you're wrong. Consider board of size N = 1, M = 5 and K = 2.
If you round down (N/K) then you have RESULT = 0. If you round up
Could u plz explain how u r getting the answer 24 (for ur 2nd reply) ?? I really didn't understand.plz explainOn 6/17/06, Norbert
[EMAIL PROTECTED] wrote:There's another example if you use floating point arithmetic. N = 10,
M = 10, K = 4. Correct answer is 24, not 25On 6/17/06, Norbert [EMAIL
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:
The answer to the first question is 2. When you take the modulus of a
negative number, think of it as rounding down to a multiple of the
divisor and taking the remainder. If you round down -22 to a multiple
of 3, you get -24, and the difference between -22 and -24 is 2, your
remainder.
I'm not
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
Hello, I have a fairly new site that may be of use to you:
http://www.wizardsolutionsusa.com
There we have all kinds of help resources including a forum. It only
takes 90 seconds to sign
up at the forum and post your questions or help someone out. We are
always looking for new
moderators, so if
301 - 330 of 330 matches
Mail list logo
