OJ Board

/*@BEGIN_OF_SOURCE_CODE*/
#include<stdio.h>
#include<stdlib.h>

#define BLACK 2
#define WHITE 1

int vertex[102][102];
int flag[102],x[102],max,vertx;

void Coloring(int i,int count)
{
int j;
if(i==vertx){
if(max<count){
max =count;
for(j=0;j<vertx;j++)
if(flag[j]==BLACK) x[j] =1;
else x[j ...

/*@BEGIN_OF_SOURCE_CODE*/
#include<stdio.h>


int main()

{
int n,i,j,k,temp,flag;
long long Coeff[55],sum,root[55];
while(scanf("%d",&n)==1){
for(i = 0;i<n;i++) scanf("%lld",&root ),Coeff = 0;
Coeff[0] = 1;
for(i =n-1;i>0;i--){
Coeff[0] *=root ;
for(j=0;j<n;j++){
sum = 1;
for(k =n-i-1;k ...

hey sjn
Can you see any error in my code? Is there any difference with your code
Pls let me know

you find ABout multiple input in problemset page.see this ,this is a different input format.

1. Length of longest match : 1
2. Length of longest match : 1

/*@BEGIN_OF_SOURCE_CODE*/
#include<stdio.h>
#include<string.h>
#include<ctype.h>
int C[3][65];

int LCS(char Model[][23],char Sample[][23],int n,int m)
{

int i,j;
for(i=0;i<2;i++)
C [0] = 0;

for(j=0;j<=m;j++)
C[0][j] = 0;

for(i=1;i<=n;i++){

for(j=1;j<=m;j++){

if(strcmp(Model ,Sample[j ...

/*@BEGIN_OF_SOURCE_CODE*/
#include<stdio.h>
#include<math.h>


int main()

{
long long n,div,x,y;

while(scanf("%lld%lld",&n,&div)==2){

if(div < 2 || n< 2) printf("Boring!\n");

else {
x = (log10(n)/log10(div));
y = pow(div,x);
if(y != n) printf("Boring!");

else
for( ;n>=1 ;n/=div ...

It seems strange . What is the algorithm of that probelm ? I tried in a similar way but got wa. Will someone explain the algorithm?