0! = 1
am i right? i think so is not possible this case.
Search found 28 matches
- Thu Jul 07, 2005 8:29 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10856 - Recover Factorial
- Replies: 17
- Views: 17118
- Mon Mar 07, 2005 2:25 am
- Forum: Volume 107 (10700-10799)
- Topic: 10725 - Triangular Square
- Replies: 21
- Views: 13278
10725
My AC:
53847.577293
210.276309
4.962898
2.986635
39.376414
2.986541
53847.577293
210.276309
4.962898
2.986635
39.376414
2.986541
- Wed Dec 15, 2004 5:36 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10789 - Prime Frequency
- Replies: 38
- Views: 27523
10789 ac
Thanks i get AC
no problem with my code
isPrime() don't work ..
while ( retorno && (d*d < n) ) // in my isPrime 9 is prime
no problem with my code

isPrime() don't work ..
while ( retorno && (d*d < n) ) // in my isPrime 9 is prime
- Tue Dec 14, 2004 10:02 am
- Forum: Volume 107 (10700-10799)
- Topic: 10789 - Prime Frequency
- Replies: 38
- Views: 27523
- Mon Dec 13, 2004 8:22 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10789 - Prime Frequency
- Replies: 38
- Views: 27523
10789 - Prime Frequency
i don't understand ... where to be wrong?
[cpp]
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
[/cpp]
thanks ... for help
[cpp]
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
[/cpp]
thanks ... for help
- Wed Oct 13, 2004 7:04 am
- Forum: Volume 107 (10700-10799)
- Topic: 10721 - Bar Codes
- Replies: 26
- Views: 16767
10721
Thanks ...
I'm search my mistake ..
Schindler
I'm search my mistake ..
Schindler
- Tue Oct 12, 2004 11:11 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10721 - Bar Codes
- Replies: 26
- Views: 16767
10721 - Bar Codes
I need input critical and outpu correct please. 
my teste ==>
7 4 2
7 4 3
14 7 4
50 20 25
50 5 4
my output ==>
4
16
603
2017909539
0
Thanks Schindler

my teste ==>
7 4 2
7 4 3
14 7 4
50 20 25
50 5 4
my output ==>
4
16
603
2017909539
0
Thanks Schindler
- Thu Sep 30, 2004 12:39 pm
- Forum: Other words
- Topic: Admins: ID error
- Replies: 5
- Views: 2712
MY ID
46270 don't work
- Thu Sep 30, 2004 6:42 am
- Forum: Volume 107 (10700-10799)
- Topic: 10725 - Triangular Square
- Replies: 21
- Views: 13278
10725 Stolen
My name is Luiz Fernando Schindler
in the site of the ACM I get AC in problem 10725 I looked at time 0:00:074 when I go to look my name in ranklist has only one Renato Ramalho with this time... I was to look in problem 10714 it was in my position. What it happened?
List of 1 solved problems:
100 ...
in the site of the ACM I get AC in problem 10725 I looked at time 0:00:074 when I go to look my name in ranklist has only one Renato Ramalho with this time... I was to look in problem 10714 it was in my position. What it happened?
List of 1 solved problems:
100 ...
- Thu Sep 30, 2004 6:34 am
- Forum: Off topic (General chit-chat)
- Topic: MY ID ....
- Replies: 9
- Views: 4845
MY ID ....
My name is Luiz Fernando Schindler,
I get AC in problem 10725 I looked at time 0:00:074 when I go to look my name in ranklist has only one Renato Ramalho with this time... I found odd I was to look in problem 10714 it was in my position. What it happened?
I lost all problem to Renato Ramalho now ...
I get AC in problem 10725 I looked at time 0:00:074 when I go to look my name in ranklist has only one Renato Ramalho with this time... I found odd I was to look in problem 10714 it was in my position. What it happened?
I lost all problem to Renato Ramalho now ...
- Sat Sep 25, 2004 2:18 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10725 - Triangular Square
- Replies: 21
- Views: 13278
10725
little joey thanK .. I got AC
I had really not seen the detail.

- Sat Sep 25, 2004 12:33 am
- Forum: Volume 107 (10700-10799)
- Topic: 10725 - Triangular Square
- Replies: 21
- Views: 13278
10720
[cpp]
//---------------------------------------------------------------------------
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
//---------------------------------------------------------------------------
int main(int argc, char* argv[])
{
long L[3];
double s ...
//---------------------------------------------------------------------------
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
//---------------------------------------------------------------------------
int main(int argc, char* argv[])
{
long L[3];
double s ...
- Fri Sep 24, 2004 11:09 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10725 - Triangular Square
- Replies: 21
- Views: 13278
10725
I try to place in the sides that are been valid.
However for case 999 1000 5 my equation not calculates value 23,742773 in none of the sides
What it is missing? or made a mistake in my code ..
[cpp]
scanf("%ld%ld%ld",L,L+1,L+2);
s = (L[0] + L[1] + L[2]) / (double) 2.00;
a = sqrt(s * (s-L[0 ...
However for case 999 1000 5 my equation not calculates value 23,742773 in none of the sides
What it is missing? or made a mistake in my code ..
[cpp]
scanf("%ld%ld%ld",L,L+1,L+2);
s = (L[0] + L[1] + L[2]) / (double) 2.00;
a = sqrt(s * (s-L[0 ...
- Fri Sep 24, 2004 8:23 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10725 - Triangular Square
- Replies: 21
- Views: 13278
10725
legend12 find u your problem?
my out put is == your
999 1000 5
23.742773 (wrong why???????) :cry:
my input test
7
2 2 2
6 6 6
999 999 999
999 1000 5
10 6 8
7 7 8
5 4 3
output
0.861561
7.754051
214959.743945
23.742773
11.755102
11.477323
2.938776
Somebody can say which to me "simple ...
my out put is == your
999 1000 5
23.742773 (wrong why???????) :cry:
my input test
7
2 2 2
6 6 6
999 999 999
999 1000 5
10 6 8
7 7 8
5 4 3
output
0.861561
7.754051
214959.743945
23.742773
11.755102
11.477323
2.938776
Somebody can say which to me "simple ...
- Thu Sep 23, 2004 11:18 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10720 - Graph Construction
- Replies: 49
- Views: 38179
10720
sorry, forget say ...
1:
vImp = 0;
2:
use qsort(v+1,n,sizeof(v[0]),comp)
// v + 1 if C or C++ array
int comp (const void* a, const void* b)
{
return *(type*) b - *(type*) a;
}

1:
vImp = 0;
2:
use qsort(v+1,n,sizeof(v[0]),comp)
// v + 1 if C or C++ array
int comp (const void* a, const void* b)
{
return *(type*) b - *(type*) a;
}