OJ Board

Use simple merge sort. As I did, apply merge sort to count the swaps..

What's the problem...
Output is okay for the test cases..
But wrong answer!!
Where's the bug ?

Help me to find it out..
Thanks in advance..


Here's my code...


#include<iostream>
#include<math.h>

using namespace std;

int main(void)
{
int t,c=1;
unsigned long long n,k,mod,w,i,sum,f,ans;
cin ...

Now I've got Accepted.
Thanks for helping.

Yes, Bro..
I'm trying it now Bigmod method.

Thanks!!
I've fixed it. Got that point.

#include<stdio.h>
#include<math.h>
#define mod 1000000007

int main()
{
int n,i;
unsigned long m,p;
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%lu",&m);
p=pow(2,(m-1));
printf("Case #%d: %lu\n",i,(m*p)%mod);
}
return 0;
}