Search found 108 matches

by Angeh
Tue Oct 26, 2010 11:07 pm
Forum: Volume 118 (11800-11899)
Topic: 11828 - Palindrome Again
Replies: 6
Views: 2278

Re: 11828 - Palindrome Again

Oh sorry i meant result+=DP1 [MM] * DP2[j][M] ; i think my problem is in Defining The DP1 and DP2 ... The Code Below ... Would you please give some hint where is my fault ... //Fill DP1 ...mm number of Missmatch ... FOR(k,1010)for(int mm=0;mm<1010;mm+=2){ if(k>mm)continue; int MM=mm/2; if(k<MM){ DP1...
by Angeh
Tue Oct 26, 2010 3:42 pm
Forum: Volume 118 (11800-11899)
Topic: 11828 - Palindrome Again
Replies: 6
Views: 2278

Re: 11828 - Palindrome Again

Thanks Mak For Your help ... I make The DP1 and DP2 table ... Then For each K sum up DP1 [k][MM] + =DP1 [k-1][MM] +DP1 [k-2][MM]....DP1 [0][MM] Then For each case the result is MM = mismatch ... M= match for(i=0...i<=k , j=k-i ) result+=DP1 [MM] + DP2[j][M] ..... am i Right ,....?? and This is How i...
by Angeh
Mon Oct 18, 2010 8:15 pm
Forum: Volume 114 (11400-11499)
Topic: 11413 - Fill the Containers
Replies: 13
Views: 6523

Re: 11413 - Fill the Containers

Whats The Problem With This Problem ... ??????????????????????????????????????????? :(((((((((((( #include<iostream> using namespace std; #define FOR(i,n) for(int i=0;i<n;++i) int in[1024],n,m; bool f(int S){ int C=0; int s=0; FOR(i,n){ if(s+in[i]>S )s=in[i],C++; else s+=in[i]; } C++; if(C<=m)return...
by Angeh
Thu Oct 14, 2010 11:26 am
Forum: Volume 118 (11800-11899)
Topic: 11829 - L's in a Circle
Replies: 6
Views: 2078

Re: L's in a Circle

I Searched and studied Things about Trenary Search ... But Still it is not so Clear for me ...
would you please mail me Your Source code ... I want to study your code ... and Learn things ...
angeh.a2@gmail.com ...
Thanks a lot
by Angeh
Thu Oct 14, 2010 10:38 am
Forum: Volume 118 (11800-11899)
Topic: 11852 - Knight's Trip
Replies: 7
Views: 3335

Re: 11852 - Knight's Trip

sent
by Angeh
Wed Oct 13, 2010 11:45 pm
Forum: Volume 118 (11800-11899)
Topic: 11829 - L's in a Circle
Replies: 6
Views: 2078

Re: L's in a Circle

Distance of two upper Block ... ??
by Angeh
Wed Oct 13, 2010 8:09 pm
Forum: Volume 118 (11800-11899)
Topic: 11829 - L's in a Circle
Replies: 6
Views: 2078

Re: L's in a Circle

No Response ... ?
by Angeh
Tue Oct 12, 2010 1:54 pm
Forum: Volume 118 (11800-11899)
Topic: 11829 - L's in a Circle
Replies: 6
Views: 2078

11829 - L's in a Circle

hi , How to Solve this Problem ...
is seems to be Binary Search (Bisection )
but i cant figure the relation :(

can any one help me?
by Angeh
Tue Oct 12, 2010 1:48 pm
Forum: Volume 118 (11800-11899)
Topic: 11840 - Tic-tac-toe
Replies: 5
Views: 3566

Re: 11840 - Tic-tac-toe

solved that also .... is there any other problems to solve like with this method ... ??
by Angeh
Mon Oct 11, 2010 7:25 pm
Forum: Volume 118 (11800-11899)
Topic: 11840 - Tic-tac-toe
Replies: 5
Views: 3566

Re: 11840 - Tic-tac-toe

Thanks Leo for reply and for those nice links ... :* :)) I love This Problem ...it was very Nice Got AC ! do you know how to solve the Problem ... 11534 - Say Goodbye to Tic-Tac-Toe i think it is somthing like this problem but not so easy ... { .... Keep Posting and learning from each other .... }
by Angeh
Sun Oct 10, 2010 7:35 pm
Forum: Volume 118 (11800-11899)
Topic: 11860 - Document Analyzer
Replies: 15
Views: 4918

Re: 11860-Document Analyzer

use roling ...
O(n)
by Angeh
Sun Oct 10, 2010 5:28 pm
Forum: Volume 118 (11800-11899)
Topic: 11859 - Division Game
Replies: 8
Views: 3047

Re: 11859 - Division Game

Count the piles ...
See Problem 10165 ...
its The same as this problem ...
Use Xor Principle for Solving nim ...
by Angeh
Sun Oct 10, 2010 5:23 pm
Forum: Volume 118 (11800-11899)
Topic: 11851 - Celebrity Split
Replies: 9
Views: 2844

Re: 11851 - Celebrity Split

split the numbers in 2 Group do an n^3 algorithm for each Group ... ... .... Leonids post ....
think about differances ... in reach Group ....
by Angeh
Sun Oct 10, 2010 8:31 am
Forum: Volume 118 (11800-11899)
Topic: 11840 - Tic-tac-toe
Replies: 5
Views: 3566

11840 - Tic-tac-toe

any hints how to solve this problem /.??
Thanks ...
by Angeh
Sun Oct 10, 2010 8:04 am
Forum: Volume 118 (11800-11899)
Topic: 11866 - Triangle
Replies: 6
Views: 2283

Re: 11866 - Triangle

Thanks for your replay
the number of Triples Between X,Y . is
n=Y-X...
Triples Between X,Y = n*(n+1)*(2n+1)/6
am i right ????????

Go to advanced search