OJ Board

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

#define SIZE 10000

typedef struct
{
char direction;
int ant_no;
double location;
}STATUS;

typedef struct
{
int r;
int l;
}PAIR;

bool compare1(STATUS i ...

#define _CRT_SECURE_NO_WARNINGS


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

void initialize(bool *flag)
{
int i;
for (i = 0; i < 26; i++)
flag = false;

return;
}


int main(void)
{
int i, store, n_stack;

bool flag[26];
char input[1001];

int test_case;


test_case = 1 ...

Getting Wrong answer:Help me
#include<stdio.h>
#include<string.h>


int coins[] = { 50, 25, 10, 5, 1 };
int dp[6][7490];
int makeAmount(int i, int amount);
int main(void)
{
int amount;
memset(dp, -1, sizeof(dp)); //
while(1)// (scanf("%d", &amount) != EOF)
{
scanf("%d", &amount);
printf("%d\n ...

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
bool flag[26];
int par[26];
int findRef(int x);
void findUnion(char a, char b);
int main(void)
{
int i,j,t;
char s[3];
scanf("%d",&t);
gets(s);
gets(s);
while (t--)
{
for (i = 0; i < 26; i++)
par[i] = i;
memset(flag ...

Please Somebody help me.I am getting timelimit exit.

#define _CRT_SECURE_NO_WARNINGS
#define MAX 200
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<utility>
#include<vector>
#include<queue>

using namespace std;
int bfs(int source, int destinition, vector<int> map[]);
bool ...

http://ideone.com/O9F7IB
I have fixed what you mentioned(Not to return the address of local variable from find_path).But still wrong answer.Can you tell me the input case for which my code fails.

Why I am getting wrong answer:
my code:

#include<stdio.h>
#include<string.h>
int l[1001][1001];
char s[1001];
char t[1001];
int max(int, int);
int findlcs(int, int);
char* find_path(int, int, int);
void initialize(char*, int);
int main(void)
{
//freopen("in.txt", "r", stdin);
char *parser ...