there is an O(n) solution !!!Plz can u give ny hints for that...
thanx !
Search found 2 matches
- Tue Jul 10, 2007 8:47 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11134 - Fabled Rooks
- Replies: 12
- Views: 7279
plz .. O(n)
there is an O(n) solution !!!Plz can u give ny hints for that...
thanx !
- Mon May 22, 2006 7:03 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10932 - Calculator
- Replies: 19
- Views: 13322
hey can anyone temme y i am getting WA!! i
//I use long double anyway !!! can u plz temme y my prog showing WA :-(
//Any critical test cases are appreciated!!
#include<stdio.h>
long double ans[1000]={0};char O[500];int ap,Ap,Op;
long double V[26]={0};
int rank(char a)
{
switch(a)
{
case '+':
case '-':
return 1;
default:
return 2 ...
//Any critical test cases are appreciated!!
#include<stdio.h>
long double ans[1000]={0};char O[500];int ap,Ap,Op;
long double V[26]={0};
int rank(char a)
{
switch(a)
{
case '+':
case '-':
return 1;
default:
return 2 ...