OJ Board

Cant find a critical case. So far ive tested all i could think of an find.
Any help?
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int windowPropertyCheck(char sequence[102],int size,int width)
{
int check=-1;
int patternCheck=-1;
char patterns[100][100];
int numOfPatterns=0 ...

Got ac, my optimized combination number calculation was skipping over one additional lettertype when i encountered the one i should skip over.(30!/15!=30*29...*16, and i did this, but if it was A, i would skip over Bs bcs of one mistakenly placed iteration.)

I am getting WA for unknown reasons.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int combinations(int size,int letterCounters[30])
{
int i;
int max=-1;
long long numerator=1;
long long denominator=1;
long long factorials[20];
factorials[0]=1;
for(i=1;i<20;i ...

Got an accepted, thank you. Managed to get it already yesterday. There was some sort of problem with this one 1 2 2 3 3 4. After i solved it, reverted 1 1 1 to not acceptable, i got AC.

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

int cmpfunc (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}

int plotEdge(int vertexA, int vertexB)
{
int firstA,lastA;
int firstB,lastB;
int i,k;
int length=-1;
firstA=lastA=firstB=lastB=1;
for(i=1;firstA>vertexA||lastA<vertexA;i ...

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

int plotEdge(int vertexA, int vertexB)
{
int firstA,lastA;
int firstB,lastB;
int i,k;
int length=-1;
firstA=lastA=firstB=lastB=1;
for(i=1;firstA>vertexA||lastA<vertexA;i++)
{
firstA=firstA+i;
lastA=lastA+i+1;
}
for(k=1;firstB>vertexB||lastB<vertexB ...

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

int main()
{
int pictureA[1024];
int pictureB[1024];
char current;
int cases;
scanf("%d",&cases);
fgetc(stdin);
for(;cases>0;cases--)
{
int multiplier=1024;
int i;
int hlbka=-1;
int k[5];
int blackpix=0;
for(i=0;i<5;i++)
{
k[i]=0;
}
i=0 ...

Hello, I used the bellman ford modified to find minimal weight instead of full weight. I cant find a critical test case that gives me WA, all the other cases ive found on the internet are correct. Pls help.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader ...

Didnt know. Thx for the reply

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

typedef struct
{
int time;
int start;
}event;

int main()
{
int events,rulen,done;
int i,k;
int temp;
int rules[100000][3];
/*int **rules;*/
event *array;
k=1;
while((temp=fgetc(stdin))!=EOF&&(temp!='\n'))
{
ungetc(temp,stdin);
scanf("%d",&events ...

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

int main()
{
int arrivee,arriveo;
int leavee,leaveo;
int time;
int expres[100000][2];
int ordinary[100000][2];
int i,j,k,l;
int write;
int starte,startl,starta;
scanf("%d%d%d%d%d",&arrivee,&arriveo,&leavee,&leaveo,&time);
i=j=k=l=starte=startl=write ...