OJ Board

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

typedef unsigned long long i64;
typedef long long LLD;

i64 dp[66][2][2];
i64 dp2[66][2];
char bit[66];
int len;

i64 solve2(int pos,int has_small)
{
int up,i;
i64 res;
if(pos==len) return 1;
if(dp2[pos][has_small]!=0)
return dp2[pos ...

#include<stdio.h>
#include<math.h>
#define prime(i) ((Prime[i>>5])&(1<<(i&(31))))
#define set(j) (Prime[j>>5]|=(1<<(j&(31))))
#define LIM 86100000
#define SLIM 9278


typedef unsigned long long i64;

i64 Prime[1100000];
i64 pos[5010001],l;


void sieve()
{
i64 i, j, m, n, t,x,k,h;
set(1);
pos[1 ...

How can i solve this problem??? please help....

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MM 30

char matrix[MM][MM];
int vis[MM][MM];
int ret,row,col;

int inx[4]={0,-1,0,1}; //right,up,left,down
int iny[4]={1,0,-1,0};

void set()
{
memset(matrix,0,sizeof(matrix));
memset(vis,0,sizeof(vis));
}

void dfs(int x,int y ...

pls help me out.. :( what's wrong with this one ????
I got WA :(

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MM 200008

int inp[25],track[MM];

int solve(int sum,int n,int val)
{
int i,j,k,l,inx;
track[0]=1;
for(i=1;i<=sum;i++)
{
track[i]=0;
}
for(i=0;i<n;i++)
{
for(j ...