龙崎的专栏

HUST - 1017Exact coverTime Limit: 15000MS Memory Limit: 131072KB 64bit IO Format: %lld & %llu[Submit]   [Go Back]   [Status]  DescriptionThere is an N*M mat

DescriptionFOTILE得到了一个长为N的序列A，为了拯救地球，他希望知道某些区间内的最大的连续XOR和。即对于一个询问，你需要求出max(Ai xor Ai+1 xor Ai+2 ... xor Aj)，其中l为了体现在线操作，对于一个询问(x,y)：l = min ( ((x+lastans) mod N)+1 , ((y+lastans) mod N)+1 

1771. Yet Another N-Queen ProblemProblem code: NQUEENAfter solving Solution to the n Queens Puzzle by constructing, LoadingTime wants to solve a harder version of the N-Queen Problem. Some

Language:DefaultSudokuTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 4393 Accepted: 2133DescriptionA Sudoku grid is a 16x16 grid of cells grou

Language:DefaultSquare DestroyerTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3234 Accepted: 1381DescriptionThe left figure below shows a comp

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

kuangbin大神的题解

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

ZOJ Problem Set - 3209Treasure MapTime Limit: 2 Seconds      Memory Limit: 32768 KBYour boss once had got many copies of a treasure map. Unfortunately, all the copies are now broken to man

FZU - 1686神龙的难题Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u[Submit]   [Go Back]   [Status]  Description这是个剑与魔法的世界.英雄和魔物同在,动荡和安定并存

A - Sudoku ExtensionSudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9 x 9 grid so that each column, each row, and each of the nine 3 x 3 boxes (also called bl