Hi,
I need some help on parsing techniques. Ive been trying to solve 10932 Calculator and frequently getting WA. I used the algorithm stated in the following link. I use the Postfix notation.
LINK:
Algorithm # http://www.codepedia.com/1/Art_Expressions_p1
Their Implementation # http://www ...
Search found 4 matches
- Wed Oct 19, 2005 7:33 pm
- Forum: Algorithms
- Topic: Expression Evaluator and Parsing
- Replies: 2
- Views: 2523
- Mon Oct 10, 2005 5:04 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10508 - Word Morphing
- Replies: 35
- Views: 15528
10508 WA
hi all,
I am getting WA in 10508. my approach is simple. i just calculate the distance of all the strings from the 1st string ( distance means the number of different letters between 2 strings ).
Then I output the given strings in increasing order of the distance from the the 1st string.
Now i am ...
I am getting WA in 10508. my approach is simple. i just calculate the distance of all the strings from the 1st string ( distance means the number of different letters between 2 strings ).
Then I output the given strings in increasing order of the distance from the the 1st string.
Now i am ...
- Sat Jul 09, 2005 8:22 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10719 - Quotient Polynomial
- Replies: 51
- Views: 25066
- Thu Jul 07, 2005 5:50 am
- Forum: Volume 107 (10700-10799)
- Topic: 10719 - Quotient Polynomial
- Replies: 51
- Views: 25066
10719 Quotient Polynomial getting TLE
How on earth can i get TLE in 10719 ... any ideas ????
heres my code
#include<stdio.h>
#include<math.h>
#include<ctype.h>
#define MAXN 10020
long p[MAXN],q[MAXN],r;
char input[MAXN*12];
void swap(long &a,long &b)
{
long temp;
temp=a;
a=b;
b=temp;
}
long read_p()
{
long i,j,n;
gets ...
heres my code
#include<stdio.h>
#include<math.h>
#include<ctype.h>
#define MAXN 10020
long p[MAXN],q[MAXN],r;
char input[MAXN*12];
void swap(long &a,long &b)
{
long temp;
temp=a;
a=b;
b=temp;
}
long read_p()
{
long i,j,n;
gets ...