I am new to this site and also new to c++ programing . Currently in learning stage. Recently i have appeared in Zonal informatics olympiad and have cleared and shortlisted for 2nd level (Indian computing olympiad) where i have to write programes for 2 problems.I am trying this following problem and every time it is coming as "Time exceeded" . I am not able to debug it. Pls help me out, where i am going wrong. This problem is from IARCS.org
To help Lavanya learn all about binary numbers and binary sequences, her father has bought her a collection of square tiles, each of which has either a 0 or a 1 written on it. Her brother Nikhil has played a rather nasty prank. He has glued together pairs of tiles with 0 written on them. Lavanya now has square tiles with 1 on them and rectangular tiles with two 0's on them, made up of two square tiles with 0 stuck together). Thus, she can no longer make all possible binary sequences using these tiles.
To amuse herself, Lavanya has decided to pick a number N and try and construct as many binary sequences of length N as possible using her collection of tiles. For example if N = 1, she can only make the sequence 1. For N=2, she can make 11 and 00. For N=4, there are 5 possiblities: 0011, 0000, 1001, 1100 and 1111.
Lavanya would like you to write a program to compute the number of arrangements possible with N tiles so that she can verify that she has generated all of them. Since she cannot count beyond 15746, it is sufficient to report this number modulo 15746.
A single line with a single integer N.
A single integer indicating the number of binary sequences of length N, modulo 15746, that Lavanya can make using her tiles.
You may assume that N ≤ 1000000.
Here is a sample input and output corresponding to the example discussed above.
CPU Timelimit: 3 seconds
Memory limit: 64M
Grading style: ioi
My coding :
using namespace std;
int fac(int a)
int tot(int n,int m)
> "Time exceeded"
Usually means that the order of your algorithm is too big.
For every number you do a loop from 0 to n/2, that's O(n)
Inside the loop you call the tot() function.
__ there you execute the factorial. That's O(n) because either `n-m' or `m' are as big as `n'
Total time O(n^2)
Considering that n could be as big as 1e6, the order should be around O(n lg n).
Apart. Integers have a limit in the number they can store, the operations that you're doing will likely overflow.
Thx for your response. As i am totally new and now only started understanding the programes, it would be helpful to me if you can explain me in little bit more detail, and also debug the above code exactly where it is to be changed, so that by seeing the corrected program, i will understand your inputs better. Please support me.