Search found 162 matches

by newton
Thu Jul 19, 2007 12:04 pm
Forum: Volume 101 (10100-10199)
Topic: 10127 - Ones
Replies: 32
Views: 12504

i am also interested to know?

neo_thohin
if you cant explaine about Bhagsash upopado
delete your post......









dont use any language [that is not english]..
good luck
by newton
Thu Jul 19, 2007 10:51 am
Forum: Volume 107 (10700-10799)
Topic: 10700 - Camel trading
Replies: 32
Views: 14287

i am sure the answer is 160000 and 16000.

Code: Select all


long long is enough to solve the problem.






simple. ....simply the best
by newton
Wed Jul 18, 2007 3:42 pm
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 26132

ohh that was a chilly mistake.

i am extremely sorry..




thank you very much.
by newton
Wed Jul 18, 2007 2:59 pm
Forum: Volume 1 (100-199)
Topic: 160 - Factors and Factorials
Replies: 205
Views: 24725

thanx a lot.


it is accepted.
by newton
Tue Jul 17, 2007 3:29 pm
Forum: Volume 107 (10700-10799)
Topic: 10789 - Prime Frequency
Replies: 38
Views: 21327

thank you verymuch mr Jan.
first time the same code was Wrong to UVA



keep helping
by newton
Tue Jul 17, 2007 7:14 am
Forum: Volume 4 (400-499)
Topic: 495 - Fibonacci Freeze
Replies: 222
Views: 30694

how much digits the 5000th fibonacci number takes??
what is urs minimum time and memory to solve it??
how is it possible to solve it in 0.00 sec and min mem??




advanced thanx!!






simple, simply the best!!
by newton
Mon Jul 16, 2007 2:22 pm
Forum: Volume 109 (10900-10999)
Topic: 10940 - Throwing cards away II
Replies: 28
Views: 14269

dear,

should i use cerculer linklist algorithm in this problem ??


thanx
by newton
Sat Jul 14, 2007 11:46 am
Forum: Volume 7 (700-799)
Topic: 727 - Equation
Replies: 156
Views: 34785

Code: Select all


ACCEPTED
by newton
Wed May 23, 2007 3:48 pm
Forum: Volume 100 (10000-10099)
Topic: 10038 - Jolly Jumpers
Replies: 445
Views: 79241

hi rocky

in the problem there is a comments....

Code: Select all

The definition implies that any sequence of a single integer is a jolly jumper.

so how

Code: Select all

1 2

Not joly

may u expalin please?






" i like logic "
by newton
Tue May 22, 2007 2:51 pm
Forum: Volume 5 (500-599)
Topic: 583 - Prime Factors
Replies: 171
Views: 36853

dear nymo i have changed everything you told but still got RE #include <stdio.h> #include <math.h> #include <string.h> int prime[100001],array[100001]; void set_prime() { int i,j; memset(prime,0,sizeof(prime)); for(i=2;i<=100000;i++) { for(j=2;i*j<=sqrt(100000);j++) prime[i*j]=1; } j = 0; for(i=2;i<...
by newton
Sat May 05, 2007 10:30 am
Forum: Off topic (General chit-chat)
Topic: I win !!
Replies: 361
Views: 123539

ohh dear m2laoo again Compiler ERROR! what is these while (1) { printf("m2lajoo is the winner\n newton is simply a loser"); } :D :D :wink: how can compiler compile :D :D :wink: chang the code as i told in my previous post. quick.... newton................................ simply the best (winner)
by newton
Mon Apr 30, 2007 3:47 pm
Forum: Off topic (General chit-chat)
Topic: I win !!
Replies: 361
Views: 123539

hi m2lajoo.... this is WA code. what does the loop while(1)do { ................... ....................bla bla } means? is it perfectly while or do-while loop? rather than it will be while(1) { printf("newton is the woner\n"); } to be AC code. :D :D :D newton...........................................
by newton
Sat Mar 31, 2007 3:35 pm
Forum: Volume 5 (500-599)
Topic: 583 - Prime Factors
Replies: 171
Views: 36853

i have chaned it but got signal 8 (RE) #include <stdio.h> #include <math.h> #include <string.h> int prime[100001],array[100001]; void set_prime() { int i,j; memset(prime,0,sizeof(prime)); for(i=2;i<=100000;i++) { for(j=2;i*j<=sqrt(100000);j++) prime[i*j]=1; } j = 0; for(i=2;i<=100000;i++) if(prime[i...
by newton
Sat Mar 31, 2007 3:22 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31757

i used normal sieve mathod to count. that is the number and digit prime or not. but OJ says memory limit exceded. now how can i minimize the memory limit? if i changed the prime[10000001] to prime[1000001] it gets CE! but why? #include<stdio.h> #include<math.h> void set_prime(void); long sod(long); ...
by newton
Sat Mar 31, 2007 12:28 pm
Forum: Volume 110 (11000-11099)
Topic: 11059 - Maximum Product
Replies: 96
Views: 37262

why and how 2?
pls

Go to advanced search