OJ Board

Why WA?
#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<assert.h>
#include<algorithm>
#define INF 0x3f3f3f3f
using namespace std;

int n;
int row[5], col[5], vis[5], grid[5][5];
char s[5][5][5];
bool ...

13 12
49
-23
2
15
2
18
0
30
14
11
-23
7
-48
0 0
What about this case, the output is 77 in uva toolkit, an AC program is 125, another AC program is 102, but this program's output is 0 for case 1 1 -41, my WA program is 102. I think my output is correct, two AC program is wrong. Do I misunderstand ...

Get AC

I used DP to solve it. here are some I/O from my code:


4
Bangladesh 1 1
0
Dhaka 2 2
1 1
1 1
CTG 3 3
1 2 3
0 0 3
4 5 1
SYL 5 5
3 56 67 34 67
45 234 56 78 34
0 78 45 0 3
23 56 7 3 12
4 56 34 67 8


output:


Bangladesh: 1
Dhaka: 2
CTG: 4
SYL: 6

Your output is wrong, the answer is
Bangladesh: 1 ...

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

int divide(int, int);
int state[20001], start, end, max;
int main(void)
{
int t, n, i, m;
scanf("%d", &t);
m = 0;
while(t--)
{
scanf("%d", &n);
for(i = 1; i < n; i++)
{
scanf("%d", &state );
}
max = -1;
divide(1, n ...

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

int cmp(const void *, const void *);
void compare(int, int, int);
char str[144][260];
char s[600], t[600];
int main(void)
{
int n, i, k, len, ok;
scanf("%d", &n);
getchar();
for(i = 0; i < n; i ...

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;

int hash(string );
int insert(int );
string st1[1510], st2[1510];
int head[1000003], next[2250010];
string queue[2250010];

int main(void)
{
int t, a, b, i, j, k, cnt = 0;
scanf("%d ...

#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>

int set[1010];
void Qsort(int, int);
int search(int, int, int );

int main(void) {

int t, i, j, k, a, ok;
while(scanf("%d", &t), t)
{
for(i = 0; i < t; i++)
scanf("%d", &set );
Qsort(0, t-1);
ok = 0;
for(i = 0; i ...

For this problem we will only consider arithmetic expressions of the following from:
notice the minus operation, it can't change according to the problem.

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

int visit[101];
int G[101][101];
int weight[101];
int to[101];
int dfs(int , int, int);
int bfs(int , int);
int main(void)
{
int n, i, m, k;
while(scanf("%d", &n), n != -1)
{
memset(G, 0, sizeof(G ...

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

void dfs(int, int, int);
int k;
char s[300][300];

int main(void)
{
int n;
scanf("%d", &n);
while(n--)
{
k = 0;
while(1)
{
if(gets(s[k]), s[k][0] != '\0')
{
if(s[k][0] == '#')
break;
k ...

brianfry713 wrote:There may be up to 1000 teams, why is your sign array size 100?

You are right.Thank you very much. When I try 1000, still RTE, in fact, I tried 1000 before. But this time I try 1010, get AC , but the problen say it is up to 1000 teams, it is confusing !

#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
typedef struct node
{
int n;
struct node* next;
}Node;

void enqueue(Node*);
int dequeue();
Node* newnode();
Node* first, *last;
Node *sign[100];
int a[1000000], p;
int main(void) {

int i, n, k, j, num, m;
char s[10 ...