emu in blogjava

我想詢問一下google編程競賽的情況，以前沒參加過，還望不吝賜教。Qualification Round是不是舉行一整天？一共有幾道題目？比賽用的程序現(xiàn)在能否down下來練練手？
望回復(fù)！感謝！  回復(fù)  更多評論
  

下個星期的資格賽說明是：
The Qualification Round will be open from Tuesday, September 5, at 12:00 PM (noon) EDT (GMT/UTC -4) through Wednesday, September 6, at 12:00 PM (noon) EDT (GMT/UTC -4). During this 24-hour period, each competitor must complete one randomly generated problem set. All competitors will receive a score for their performance on that one problem set.

如果你已經(jīng)注冊參賽，在確認(rèn)郵件的 PRACTICING FOR THE EVENT 一段中有關(guān)于賽前練手的信息，我收集的題目也可以用來練手。如果你還沒有注冊就抓緊注冊吧，不注冊是不能啟用competition arena來練手的。  回復(fù)  更多評論
  

謝謝！
也就是說每人隨機抽一套題做。我剛注冊了，抽空下點題目看看。你這里的題目我基本都有收集，大多數(shù)題不難，只是用的時間太長。（有時間我會把我的解答貼到這里，還望多多指教）
另外，可否就比賽給小弟一些建議？或者談?wù)勀鷧①惖慕?jīng)驗？
感激不盡！Have a nice day!  回復(fù)  更多評論
  

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


public class ReverseSubstring {
private static String original="";
public static void main(String[] args) throws IOException {
String s=input();
String s1=reversed(s);
System.out.println(findReversed(Reversedsub(s),Reversedsub( s1))+"結(jié)果");
}
static String findReversed(Hashtable orig,Hashtable reversed){

Enumeration enum=orig.elements();
String result=original.substring(0,1);
while(enum.hasMoreElements()){
String s=(String)enum.nextElement();

if( s.equals(reversed.get(s))){
if(s.length()>=result.length()){
result=s;
}

}
}

return result;

}
static Hashtable Reversedsub(String s){
String originals=s;
Hashtable hash=new Hashtable();
for(int m=0;m<originals.length();m++){
for(int i=0;i<originals.length()-m;i++){
String sub= originals.substring(i,i+m+1);

hash.put(sub,sub);
}
}
return hash;
}

static String reversed(String s){
int len=0;
char[] original=s.toCharArray();
len= original.length;
char[] rever=new char[len];
int m=len-1;
for( int i=0;i<=len-1;i++){
rever[i]=original[m];
m--;
}
return new String(rever);
}
static String input() throws IOException{
int first=0;
boolean stop=true;
while(stop){
if(first!=0){
original="輸入出錯請重新輸入";
}
else{
original="請輸入數(shù)據(jù)";
}
System.out.println(original);
BufferedReader input=new BufferedReader(new InputStreamReader(System.in));
original=input.readLine();
if(original.length()==0||original.length()>50){
original="輸入出錯請重新輸入";
}
else{
stop=false;
}
first+=1;
}
return original;
}

}  回復(fù)  更多評論
  

@小貓魚
bool Strstr(const char cStr1[], const char cStr2[], int Start, int Count)
{
char *SubString = (char*)malloc(Count + 1);
memcpy(SubString, cStr2+Start, Count);
SubString[Count] = '\0';
char *find = strstr(cStr1, SubString);
free(SubString);
return find == NULL?false:true;
}

int GetSubString(char cStr[], int iSeatCount)
{
int left=0;
int right=iSeatCount-1;
int startindex = 0;
int last = 0;
int templast = 0;
char ch='\0';
char *ReverseSubstring = (char*)malloc(iSeatCount + 1);
memcpy(ReverseSubstring, cStr, iSeatCount + 1);
while(left <= right)
{
ch = ReverseSubstring[left];
ReverseSubstring[left] = ReverseSubstring[right];
ReverseSubstring[right] = ch;
left++;
right = iSeatCount-1-left;
}
ReverseSubstring[iSeatCount] = '\0';
for (int i=0; i<iSeatCount; i++)
{
templast = 1;
while (Strstr(ReverseSubstring, cStr, i, templast) && templast <= iSeatCount - i)
{
templast++;
}
if ((templast - 1) > last)
{
startindex = i;
last = templast - 1;
}
}
printf("The StartPostion is %d and the last number is %d.\n", startindex, last);
printf("The Max Common String is ");
for (i=0; i<last; i++)
{
printf("%c", *(cStr+startindex+i));
}
printf("\n");
return last;
}  回復(fù)  更多評論