may be u can try to find a more general formula for the series..which just
depends on 'n'...
On Sat, Mar 19, 2011 at 11:48 PM, cegprakash wrote:
> Here is my code for TRICOUNT problem
>
> //http://www.spoj.pl/problems/TRICOUNT/
> //cegprak...@gmail.com
>
> #include
> #include
> using namespace s
Here is my code for TRICOUNT problem
//http://www.spoj.pl/problems/TRICOUNT/
//cegprak...@gmail.com
#include
#include
using namespace std;
unsigned long long start,end,arr[101],arr2[101];
//number of triangles facing upwards=arr
//number of triangles facing downwards=arr2
int main(){
