any tricky test cases???
the following is my code:
[cpp]
#include<stdio.h>
void main(void)
{
double x1,x2,x3,x4,y1,y2,y3,y4,a1,b1,a2,b2;
double px,py;
int i,n,check;
while(scanf("%d",&n)!=-1 && n>0)
{
printf("INTERSECTING LINES OUTPUT\n");
for(i=1;i<=n;i++)
{
scanf("%lf%lf%lf%lf%lf%lf%lf ...
Search found 15 matches
- Sat Jan 04, 2003 2:44 am
- Forum: Volume 3 (300-399)
- Topic: 378 - Intersecting Lines
- Replies: 48
- Views: 24068
- Fri Dec 20, 2002 5:08 pm
- Forum: Volume 4 (400-499)
- Topic: 402 - M*A*S*H
- Replies: 56
- Views: 21493
- Wed Dec 04, 2002 11:01 am
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
....
Wrong Answer 0:00.004 64 23448 C++ 122 - Trees on the level
sigh.....
I send again, and wa again...
but thx anyway, Dominik
It must take you a lot of time to test my code
thx again~~
sigh.....
I send again, and wa again...
but thx anyway, Dominik

It must take you a lot of time to test my code
thx again~~
- Mon Dec 02, 2002 7:17 am
- Forum: Volume 3 (300-399)
- Topic: 305 - Joseph
- Replies: 41
- Views: 8180
another way
another way to avoid TLE
you can save the results in an array after calculating
then get the input and output the corresponding answer
like the following:
[c]
#include<stdio.h>
void main(void)
{
int n,i,ans[13];
for(i=0;i<13;i++)
{......}
while(scanf("%d",&n)!=-1 && n>0)
printf("%d\n",ans ...
you can save the results in an array after calculating
then get the input and output the corresponding answer
like the following:
[c]
#include<stdio.h>
void main(void)
{
int n,i,ans[13];
for(i=0;i<13;i++)
{......}
while(scanf("%d",&n)!=-1 && n>0)
printf("%d\n",ans ...
- Wed Nov 27, 2002 3:52 am
- Forum: Volume 1 (100-199)
- Topic: 195 - Anagram
- Replies: 242
- Views: 58188
....
sorry, i tried what you said, Balon
but it failed.
you can try the input "aAb", and see what happened.
thx anyway
but it failed.
you can try the input "aAb", and see what happened.
thx anyway
- Sun Nov 24, 2002 11:46 am
- Forum: Volume 4 (400-499)
- Topic: 492 - Pig-Latin
- Replies: 213
- Views: 49433
help
why I got RTE???
who can help me??? :cry:
[c]
#include<stdio.h>
#include<string.h>
#include<ctype.h>
void main(void)
{
char s[10000];
int i,j,count;
while(gets(s))
{
count=0;
for(i=0;i<strlen(s);i++)
{
if((s >='A' && s <='Z') || (s <='z' && s >='a'))
{
while(((s >='A' && s <='Z') || (s ...
who can help me??? :cry:
[c]
#include<stdio.h>
#include<string.h>
#include<ctype.h>
void main(void)
{
char s[10000];
int i,j,count;
while(gets(s))
{
count=0;
for(i=0;i<strlen(s);i++)
{
if((s >='A' && s <='Z') || (s <='z' && s >='a'))
{
while(((s >='A' && s <='Z') || (s ...
- Sun Nov 24, 2002 11:26 am
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
thx
thx, epsilon0....
I will try to make my code more readable.
I will try to make my code more readable.

- Thu Nov 21, 2002 8:30 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
^^
epsilon0....I totally agree with you
and luckily, my code posted above just did what you mentioned
(you can take a look......though it's not easy to understand...
)
but to my surprise, I got WA.....
this is why I post my code here.......T_T....
and luckily, my code posted above just did what you mentioned
(you can take a look......though it's not easy to understand...

but to my surprise, I got WA.....

this is why I post my code here.......T_T....
- Wed Nov 20, 2002 2:11 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
sorry~~
I can't use private message....
can you give me your email??
my email is atias@pchome.com.tw
thx~~
I can't use private message....

can you give me your email??
my email is atias@pchome.com.tw
thx~~
- Tue Nov 19, 2002 4:27 am
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
- Mon Nov 18, 2002 1:30 pm
- Forum: Volume 1 (100-199)
- Topic: 195 - Anagram
- Replies: 242
- Views: 58188
195.....Output Limit Exceed....
I don't know why I got OLE...
can anyone help me??
#include<stdio.h>
#include<string.h>
#include<ctype.h>
void main(void)
{
int i,j,c,temp;
char s[5000],t;
void perm(char a[5000],int k,int n);
while(scanf("%d",&c)!=-1 && c>0)
{
for(temp=1;temp<=c;temp++)
{
scanf("%s",s);
for(i=strlen ...
can anyone help me??
#include<stdio.h>
#include<string.h>
#include<ctype.h>
void main(void)
{
int i,j,c,temp;
char s[5000],t;
void perm(char a[5000],int k,int n);
while(scanf("%d",&c)!=-1 && c>0)
{
for(temp=1;temp<=c;temp++)
{
scanf("%s",s);
for(i=strlen ...
- Mon Nov 18, 2002 1:26 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
- Mon Nov 18, 2002 2:54 am
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
....
I fix the bug....but still got WA....><
I also find something strange...
can two nodes have the same value??
ex: (5,) (4,L) (4,R) ()
my code will print 5 4 4
thx for help~~

I also find something strange...
can two nodes have the same value??
ex: (5,) (4,L) (4,R) ()
my code will print 5 4 4
thx for help~~
- Sun Nov 17, 2002 12:16 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
??
but.....epsilon0,
if I don't misunderstand, I don't think my code would neglect what you metioned.
Can you give me some test cases?
or can you try my code and tell me what's wrong?
thx a lot~
if I don't misunderstand, I don't think my code would neglect what you metioned.
Can you give me some test cases?
or can you try my code and tell me what's wrong?
thx a lot~
- Wed Nov 13, 2002 12:38 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22044
HELP
here is my code for 122. I got WA, too.
can anyone give me some test cases or help me with my code???
[cpp]
#include<stdio.h>
#include<string.h>
void main(void)
{
int i,sum,v[256],count=0,ch;
char c,temp,t[257],ad[257][257];
void tree(char tr[257][257],int n[256],int co);
for(i=0;i<256;i ...
can anyone give me some test cases or help me with my code???
[cpp]
#include<stdio.h>
#include<string.h>
void main(void)
{
int i,sum,v[256],count=0,ch;
char c,temp,t[257],ad[257][257];
void tree(char tr[257][257],int n[256],int co);
for(i=0;i<256;i ...