Search found 2 matches
Search found 2 matches • Page 1 of 1
- Fri Jan 26, 2007 12:17 am
- Forum: Volume 102 (10200-10299)
- Topic: 10229 - Modular Fibonacci
- Replies: 53
- Views: 17484
Hi Could anyone tell me how to solve tihs problem ? I've got our Fn by using O(lg) algorithm and I know that (a*b*c)%n==((a%n)*(b%n)*(c%n))%n but I don't know how to use it? Should I find prime factors of this number and use them to calculate Fn%m - I think that 2147483647th fibbonacii is too big fo...
- Mon Jul 24, 2006 2:54 pm
- Forum: Volume 6 (600-699)
- Topic: 612 - DNA Sorting
- Replies: 122
- Views: 17034
Can anyone help me ? I tried all inputs from board for this program and it gets everything right. I don't know what is wrong with it. heeelp plx here is my code #include<cstdio> #include<algorithm> #define MAXAMOUNT 105 #define MAXLENGHT 55 using namespace std; char array[MAXAMOUNT][MAXLENGHT]; int ...