Search found 162 matches

by newton
Fri Jul 04, 2008 12:54 am
Forum: Volume 102 (10200-10299)
Topic: 10282 - Babelfish
Replies: 48
Views: 19640

Re: 10282 - Babelfish

Thank You.
It was really a chilly mistake.

Code: Select all

Accepted
keep posting.
by newton
Thu Jul 03, 2008 2:33 pm
Forum: Volume 5 (500-599)
Topic: 568 - Just the Facts
Replies: 39
Views: 16565

Re: 568 time limit helllp

May anybody explain, why i need to mod the fact by 1000000 rather than 10?
Thanks
by newton
Tue Jun 17, 2008 11:59 am
Forum: Volume 3 (300-399)
Topic: 389 - Basically Speaking
Replies: 94
Views: 22619

Why WA in 389 ??

i cant find any bug. May anybody help me. #include <stdio.h> #include <string.h> int main() { //freopen("in.txt","rt",stdin); char base16[]= "0123456789ABCDEF",num[10000]; int convertedNum[10000],i,j,originalNum,givenBase,base; while(scanf("%s %d %d",num,&givenBase,&base) == 3){ originalNum = 0; int...
by newton
Mon Jun 09, 2008 10:38 pm
Forum: Volume 4 (400-499)
Topic: 488 - Triangle Wave
Replies: 270
Views: 30758

Re: Crazzzzzzzzzzzzy WA...488

There would be only one test case.
You need not to handle it upto EOF.
just change
** You must avoid printing newline at the last of output.

Code: Select all

 while(scanf("%d",&n) ==1){
-------
-------
}
to

scanf("%d",&n);
------
------
by newton
Mon Jun 09, 2008 10:18 pm
Forum: Other words
Topic: Releted ACM on BFS, DFS, Dijkstra, MST, Graph
Replies: 1
Views: 3872

Re: Releted ACM on BFS, DFS, Dijkstra, MST, Graph

Try this BFS and DFS problems 173(h), 208(m), 222(h), 247(m), 260(h), 273(h)(comp geometry), 274(h), 280(e), 298(h), 314(h), 321(h), 336(e), 439(e), 452(e), 521(h), 532(e), 539(e), 589(h), 590(m), 599(m), 615(m), 627(m), 633(h), 677(h), 710(h), 793(m), 794(h), 804(h), 924(e), 928(h), 10021(m), 10039...
by newton
Mon Jun 09, 2008 10:15 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 182860

Re: 100 Time Limit Exceeded

Your calling function is killling much more time.
It would be better if u compute data inside of main.
Try avoiding java, its functions are time killer.
by newton
Sat Jun 07, 2008 8:54 pm
Forum: Algorithms
Topic: Longest Increasing Subsequenc LIS
Replies: 3
Views: 1224

Re: Longest Increasing Subsequenc LIS

how LIS can be computed in O(nlogn)?
thanx
by newton
Thu Jun 05, 2008 9:52 pm
Forum: Algorithms
Topic: Longest Increasing Subsequenc LIS
Replies: 3
Views: 1224

Longest Increasing Subsequenc LIS

Code: Select all

Removed!
by newton
Sun Apr 27, 2008 7:45 pm
Forum: Algorithms
Topic: finding Nth term of a series!
Replies: 2
Views: 1593

finding Nth term of a series!

i would like to know a clue or formula by wich i can get the nth term of a series or sequence. if taking difference between consecutive term again and again i get a constant term C, then how can i make a generalized formula that can return me the nth value? suppos: N = 1 2 3 4 5 term(N)= 2 5 10 17 2...
by newton
Sun Mar 16, 2008 9:53 pm
Forum: Volume 4 (400-499)
Topic: 441 - Lotto
Replies: 13
Views: 6578

Thanks a lot Mr Linux

this is really a fishi problem.
keep postin.
by newton
Fri Mar 14, 2008 9:53 am
Forum: Volume 5 (500-599)
Topic: 536 - Tree Recovery
Replies: 19
Views: 8206

Code: Select all

Accepted !
by newton
Sun Mar 02, 2008 12:36 pm
Forum: Bugs and suggestions
Topic: Lost Password
Replies: 7
Views: 2974

i have forgotten my new judge password. After miling a new password was sent to my mail. Now i want to change it but wat is the way? I tryid going My Account but failed. Now what can i do?


plz help
by newton
Wed Aug 15, 2007 4:20 pm
Forum: Volume 100 (10000-10099)
Topic: 10082 - WERTYU
Replies: 57
Views: 6894

if it is ACC
please remove your code.
by newton
Wed Aug 15, 2007 12:12 pm
Forum: Volume 112 (11200-11299)
Topic: 11258 - String Partition
Replies: 18
Views: 10372

are you talking about signed or unsigned int???
sorry i cant undstnd. may u clarify again.
what abt 2147483648
by newton
Wed Aug 15, 2007 8:51 am
Forum: Volume 112 (11200-11299)
Topic: 11258 - String Partition
Replies: 18
Views: 10372

isnt there anyway without DP. I tryed but it is WA. is there any tricky input? or ......? #include <stdio.h> #include <string.h> #define MAX 4294967295L int main() { char str[200]; long long num,sum,i; int test; scanf("%d%*c",&test); while(test--) { gets(str); sum = 0; num = 0; for(i=0;str[i];i++) {...

Go to advanced search