B Treasure Hunt

 题目链接 : B Treasure Hunt



using namespace std;

const int maxn=1e5+10;

typedef long long ll;
char str[maxn];
int value[5];
int main(){
      int n;
      for(int i=1;i<=3;i++){
        int k=strlen(str);
        for(int j=0;j<k;j++){
    int cur=1;
    for(int i=2;i<=3;i++){
      for(int i=1;i<=3;i++){
            return 0;

    else if(cur==2)
        return 0;


Treasure Hunt


DescriptionnnArcheologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-Ops. Using state-of-the-art technology they are able to determine that the lower floor of the pyramid is constructed from a series of straightline walls, which intersect to form numerous enclosed chambers. Currently, no doors exist to allow access to any chamber. This state-of-the-art technology has also pinpointed the location of the treasure room. What these dedicated (and greedy) archeologists want to do is blast doors through the walls to get to the treasure room. However, to minimize the damage to the artwork in the intervening chambers (and stay under their government grant for dynamite) they want to blast through the minimum number of doors. For structural integrity purposes, doors should only be blasted at the midpoint of the wall of the room being entered. You are to write a program which determines this minimum number of doors. nAn example is shown below: nnInputnnThe input will consist of one case. The first line will be an integer n (0 <= n <= 30) specifying number of interior walls, followed by n lines containing integer endpoints of each wall x1 y1 x2 y2 . The 4 enclosing walls of the pyramid have fixed endpoints at (0,0); (0,100); (100,100) and (100,0) and are not included in the list of walls. The interior walls always span from one exterior wall to another exterior wall and are arranged such that no more than two walls intersect at any point. You may assume that no two given walls coincide. After the listing of the interior walls there will be one final line containing the floating point coordinates of the treasure in the treasure room (guaranteed not to lie on a wall).nOutputnnPrint a single line listing the minimum number of doors which need to be created, in the format shown below.nSample Inputnn7 n20 0 37 100 n40 0 76 100 n85 0 0 75 n100 90 0 90 n0 71 100 61 n0 14 100 38 n100 47 47 100 n54.5 55.4 nSample OutputnnNumber of doors = 2

Google Treasure Hunt 2008 素数


题目:连续 5 个素数之和rn 连续 13 个素数之和rn 连续 275 个素数之和rn 连续 1187 个素数之和rn 求出同时符合以上4个条件的数。rnrn技巧:用数组里的一个位保存一个数是否是素数。rn结果:5615741rn计算用时:17秒 (AMD 2600+)rnrn[code=Delphi(Pascal)]rnunit GoogleHunt5u;rnrninterfacernrnusesrn Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,rn StdCtrls, Spin, SearchDir;rnrntypern TForm1 = class(TForm)rn Button1: TButton;rn Edit1: TEdit;rn Label3: TLabel;rn Label2: TLabel;rn Edit3: TEdit;rn procedure Button1Click(Sender: TObject);rn procedure FormCreate(Sender: TObject);rn privatern Private declarations rn publicrn Public declarations rn end;rnrnvarrn Form1: TForm1;rnrnfunction IsPrime(V: DWORD): Boolean;rnrnimplementationrnrn$R *.DFMrnrnvarrn bitArr: array [0..HIGH(DWORD) div 32] of DWORD;rnrn InitMax: DWORD = 3;rnrnfunction IsPrimeFromBit(V: DWORD): Boolean;rnvarrn p: integer; // 下标rn m: integer; // 余rn mask: DWORD;rnbeginrn if V = DWORD(-1) thenrn sleep(0); // ERRORrn while InitMax < V dorn beginrn if IsPrime(InitMax + 2) thenrn beginrn Inc(InitMax, 2);rn p := InitMax shr 5;rn m := InitMax and $1F;rn mask := 1 shl m;rn bitArr[p] := bitArr[p] or mask;rn endrn elsern Inc(InitMax, 2);rn end;rn p := V shr 5;rn m := V and $1F;rn if m = 0 thenrn beginrn Result := False;rn Exit;rn end;rn mask := 1 shl m;rn if p < 0 thenrn Sleep(1);rn Result := bitArr[p] and mask <> 0;rnend;rnrnfunction IsPrime(V: DWORD): Boolean;rnvarrn i: integer;rn max: DWORD;rnbeginrn max := Round(Sqrt(V));rn i := 3;rn while i <= max dorn beginrn if IsPrimeFromBit(i) thenrn if V mod i = 0 thenrn beginrn Result := False;rn Exit;rn end;rn Inc(i);rn end;rn Result := True;rnend;rnrnfunction NprePrime(V: DWORD; n: integer): integer;rnbeginrn if IsPrimeFromBit(V) thenrn Dec(n, 2)rn elsern Dec(n);rn Dec(V);rn while n > 0 dorn beginrn if IsPrimeFromBit(V) thenrn beginrn Dec(n);rn if n = 0 thenrn beginrn Result := V;rn Exit;rn end;rn end;rn Dec(V);rn if V = 2 thenrn beginrn Result := V;rn Exit;rn endrn end;rnend;rnrnfunction GetNextPrime(V: DWORD): DWORD;rnbeginrn Inc(V);rn while not IsPrimeFromBit(V) dorn beginrn Inc(V);rn end;rn Result := V;rnend;rnrnfunction SumNPrime(V: DWORD; n: integer): DWORD;rnbeginrn Result := V;rn Dec(n);rn while n > 0 dorn beginrn V := GetNextPrime(V);rn Inc(Result, V);rn Dec(n);rn end;rnend;rnrnfunction IsNPrimeSum(V: DWORD; n: integer): Boolean;rnvarrn stV: DWORD;rn sumN: DWORD;rnbeginrn stV:= NprePrime((V div n), n);rn repeatrn sumN := SumNPrime(stV, n);rn stV := GetNextPrime(stV);rn until sumN >= V;rn Result := sumN = V;rnend;rnrnprocedure TForm1.Button1Click(Sender: TObject);rnlabel repgo;rnconstrn Cnt1 = 5;rn Cnt2 = 13;rn Cnt3 = 275;rn Cnt4 = 1187;rnvarrn stV: DWORD;rn st: DWORD;rnbeginrn st := GetTickCount();rn stV := SumNPrime(2, Cnt4);rn while True dorn beginrn Edit1.Text := 'Calc... ' + IntToStr(stV);rn Application.ProcessMessages();rn if IsNPrimeSum(stV, Cnt1) thenrn if IsNPrimeSum(stV, Cnt2) thenrn if IsNPrimeSum(stV, Cnt3) thenrn if IsNPrimeSum(stV, Cnt4) thenrn beginrn Edit1.Text := IntToStr(stV);rn Break;rn end;rn if stV and 1 = 0 then // 偶数rn Inc(stV)rn elsern Inc(stV, 2);rn end;rn st := GetTickCount() - st;rn Edit3.Text := IntToStr(st div 1000);rnend;rnrnprocedure TForm1.FormCreate(Sender: TObject);rnbeginrn FillChar(bitArr, sizeof(bitArr), 0);rn bitArr[0] := $C; // 2,3 are Primernend;rnrnend.rn[/code]

Google Treasure Hunt 2008 走格式题解


题目: 34x68的格子,从左上角到右下角,有多少种走法。规则:只能向右或向下行走。rn解题方法: 从一个格子到右下角的走法数量,等于它右边格子与下边格子的走法数量之和,从最下边的格子或最右边的格子到右下角只有一种走法。rn结果: 0294692427022540894366527900rn计算用时: 瞬间rn注: 用String做大数计算。rnrn[code=Delphi(Pascal)]rnunit GoogleHunt2u;rnrninterfacernrnusesrn Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,rn StdCtrls, Spin;rnrntypern TForm1 = class(TForm)rn SpinEdit1: TSpinEdit;rn Label1: TLabel;rn Label2: TLabel;rn SpinEdit2: TSpinEdit;rn Button1: TButton;rn Edit1: TEdit;rn Label3: TLabel;rn procedure Button1Click(Sender: TObject);rn procedure FormCreate(Sender: TObject);rn privatern Private declarations rn publicrn Public declarations rn end;rnrnvarrn Form1: TForm1;rnrnimplementationrnrn$R *.DFMrnrnvarrn VArr: array [0..100, 0..100] of string;rnrnfunction BigIntAdd(V1, V2: string): string;rnvarrn i: integer;rn max1, max2: integer;rn max: integer;rn v: integer;rnbeginrn if V1[1] = '0' thenrn max1 := Length(V1) - 1rn elsern max1 := Length(V1);rn if V2[1] = '0' thenrn max2 := Length(V2) - 1rn elsern max2 := Length(V2);rn if max1 > max2 thenrn max := max1 + 1rn elsern max := max2 + 1;rnrn while Length(V1) < max dorn beginrn V1 := '0' + V1;rn end;rn while Length(V2) < max dorn beginrn V2 := '0' + V2;rn end;rnrn SetLength(Result, max);rn v := 0;rn for i := max downto 1 dorn beginrn v := Byte(V1[i]) + Byte(V2[i])-Byte('0')*2 + v;rn Result[i] := Char((v mod 10) + Byte('0'));rn v := v div 10;rn end;rnend;rnrnfunction CountRoute(W, H: integer): string;rnbeginrn if (W = 1) or (H = 1) thenrn Result := '1'rn elsern beginrn if VArr[W-1][H] = '' thenrn beginrn VArr[W-1][H] := CountRoute(W-1, H);rn VArr[H][W-1] := VArr[W-1][H];rn end;rn if VArr[W][H-1] = '' thenrn beginrn VArr[W][H-1] := CountRoute(W, H-1);rn VArr[H-1][W] := VArr[W][H-1];rn end;rn Result := BigIntAdd(VArr[W-1][H], VArr[W][H-1]);rn end;rnend;rnrnprocedure TForm1.Button1Click(Sender: TObject);rnvarrn W, H: integer;rnbeginrn W := SpinEdit1.Value;rn H := SpinEdit2.Value;rn Edit1.Text := CountRoute(W, H);rnend;rnrnprocedure TForm1.FormCreate(Sender: TObject);rnbeginrn FillChar(VArr, sizeof(VArr), 0);rnend;rnrnend.rn[/code]rn


  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他