Search found 6 matches

by abcman13
Sat Feb 22, 2014 9:10 am
Forum: Volume 126 (12600-12699)
Topic: 12653 - Buses
Replies: 4
Views: 979

Re: Problem 12653(Bus Coloring)

Thank you. The problem was caused by an overflow.
by abcman13
Mon Nov 04, 2013 4:15 am
Forum: Volume 114 (11400-11499)
Topic: 11475 - Extend to Palindrome
Replies: 32
Views: 14403

Re: 11475 - Extend to Palindromes

Hello everyone. Would anyone mind helping me out? What I do is run KMP over the given string searching for the longest occurence of "rev" ( the reverse of the string given ). After I find the max overlap, I take the first longitud - max_occurence characters of the string given, proceed to reverse sa...
by abcman13
Wed Jul 31, 2013 11:44 pm
Forum: Volume 5 (500-599)
Topic: 514 - Rails
Replies: 79
Views: 25425

Re: 514 wa

Could someone help me find the reason why this fails? It has passes all the test cases on this thread but is wrong according to the judge. Algorithm: 1. Receive max value (t) 2. Checks whether it is necessary to print the extra line to seperate test cases. 3. Recieves first value of permutation and ...
by abcman13
Sat Jul 20, 2013 1:19 am
Forum: Volume 7 (700-799)
Topic: 727 - Equation
Replies: 156
Views: 36006

Re: 727 - Equation

thanks for the help. my code was accepted.
by abcman13
Fri Jul 19, 2013 7:37 am
Forum: Volume 7 (700-799)
Topic: 727 - Equation
Replies: 156
Views: 36006

Re: 727 - Equation

hello all. could one of you help me find the cause of a runtime error with my code? i ran all the test cases on this thread succesfully on my computer (im running windows 7, not quite sure if that's important).

Code: Select all

accepted
by abcman13
Thu Jul 11, 2013 1:20 am
Forum: Volume 112 (11200-11299)
Topic: 11287 - Pseudoprime Numbers
Replies: 11
Views: 5200

Re: 11287 - Pseudoprime numbers

hey guys, any suggestions on what i could do to correct my code? #include <stdio.h> #include <math.h> long long int a,p; int prime[40000],arr[40000]; long long int sq(long long int n); long long int mod(long long int m); int isprime(); int main() { int l,i,j,k,f; long long int q; for(i=3,prime[1]=2,...

Go to advanced search