OJ Board

Code: Select all

        int T;
	cin>>T	
	cin.getline(S,MAX,'\n');
	//This is just to get the rest of the line after T

        while(T--)
	{
		cin.getline(S, MAX, '\n');
		.......
	}
	

Code: Select all

  char str[10000];
  gets(str);
  sscanf(str, "%d", &n);
  while(n--) {
     gets(str);
     process()
  }

Code: Select all

#include <stdio.h>
#include <string.h>
#define MAX 1001
char X[MAX],Y[MAX];
int i,j,m,n,c[MAX][MAX],b[MAX][MAX];

void main() {
	freopen("lp.in","r",stdin);
	freopen("lp.out","w",stdout);
	int n;
	scanf("%d\n",&n);
	int i=0;
	while(i<n){
		gets(X);
		int j =0;
		int byk = strlen(X);
		int awal = byk-1;
		while(awal>=0){
			Y[j] = X[awal];
			j++;awal--;
		}
		Y[j]='\0';
		printf("%d\n",LCSlength());
		i++;
	}
}

Code: Select all

#include<stdio.h>
#include<string.h>
 int chkpalin(char* a,int k,int n)
	{
		int w;
		for(w=k;w<=n;w++)
		 if(a[w]!=a[n+k-w])
			return(0);
		
		return(1);
	}
	main()
	 {

		  char str[1010],c;
		  int i,j,k,n,w,v;
			
		 scanf("%d",&k);
		 getchar();
		for(v=0;v<k;v++)
		 {
			w=0;
			gets(str);
			n=strlen(str);
			for(i=n-1;i>=0;i--)
			 {
				for(j=0;j+i<n;j++)//enumarate all the n*(n+1)/2 substrings chk wheather a[j] to a[i+j] is palindrome or not 
				 {

					w=chkpalin(str,j,i+j);
					if(w==1)
					 break;
				 }
				
				if(w==1)
				  break;
			}
			
			printf("%d\n",i+1);
                   /printf("palindrome is \n");
			for(int x=j;x<=i+j;x++)
			  printf("%c",str[x]);
			 printf("\n");*/
		}
	}

Code: Select all

/* @JUDGE_ID:  60332ER  11151  Java  "Easy algorithm" */

import java.io.*;
import java.util.*;

class Main{
	static int[][] result;
	static String ReadLn (int maxLg)  {
        byte lin[] = new byte [maxLg];
        int lg = 0, car = -1;
        String line = "";

        try{
            while (lg < maxLg){
                car = System.in.read();
                if ((car < 0) || (car == '\n')) break;
                lin [lg++] += car;
            }
        }
        catch (IOException e){
            return (null);
        }

        if ((car < 0) && (lg == 0)) return (null);  
        return (new String (lin, 0, lg));
    }

    static int max(int i, int j){
	
	return ( (i>=j) ? i:j);
		

    }

    static int longest(String s,int i, int j){
	
	if (i == j) return (result[i][j]=1);
	else if ( i == j-1 ){
		if(s.charAt(i) == s.charAt(j)) 
			return (result[i][j]=2);
		else return (result[i][j]=1); /* Main.max(Main.longest(s,i,j-1),Main.longest(s,i+1,j)); */

	}
	else if(s.charAt(i) == s.charAt(j)){ 
		result[i][j]=2;
		return (2+Main.longest(s,i+1,j-1));
	}
	else{
		return  Main.max((result[i][j-1]=((result[i][j-1]!=-1)? result[i][j-1] : Main.longest(s,i,j-1))),
		       (result[i+1][j]=((result[i+1][j]!=-1)? result[i+1][j]: Main.longest(s,i+1,j))));
		
	}
    }

    public static void main (String args[]){
        Main myWork = new Main();  
        myWork.Begin();            
    }

    void Begin(){
        String input;
	int t,len,mid,i,j;	        
	
	input = Main.ReadLn (255);
	t=Integer.parseInt(input.trim());
	
	/*System.out.println(); */
        while (t!=0){	
		
		input = (Main.ReadLn (257)).trim();
		len = input.length();
		/* System.out.println(input+" "+input.length()); */
        	


		if ( len == 0 ){
			System.out.print(0);
			t--;
		}
		else if ( len == 1){
			System.out.print(1);
			t--;
		}
		else{	
			result = new int[len][len];
			for(int m=0;m<result.length;m++){
				for(int n=0;n<result[m].length;n++){
					result[m][n] =	-1;
				}
			}
			System.out.print(Main.longest(input,0,len - 1));
			t--;
		}
		if(t != 0)
			System.out.print("\n");
	}
    }
}