七夜

Problem D - Maximum Product Time Limit: 1 second Given a sequence of integers S = {S1, S2, ..., Sn}, you should determine what is the value of the maximum positive product involving consecutive term

Don't Get Rooked  In chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at most 44) that can

#include #include #include #include #define N 10001 using namespace std; int cmp(const void *x,const void *y) { return *(int *)x - *(int *)y; } int n,m,t; int a[N]; int flag,cou = 0; int main

#include int tot=0,row,line[10],n; void search(int row) //递归搜索可行解 { int i,j; if(row==n) tot++; //当row=n时，说明每一行的皇后都不冲突，即为可行解 else for(i=0;i<n;i++) { int ok=1;

Getting in Line  Computer networking requires that the computers in the network be linked. This problem considers a ``linear" network in which the computers are chained together so

Meta-Loopless Sorts  Background  Sorting holds an important place in computer science. Analyzing and implementing various sorting algorithms forms an important part of the education of

ID Codes  It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakd

The Hamming Distance Problem  The Hamming distance between two strings of bits (binary integers) is the number of corresponding bit positions that differ. This can be found by using XOR o

Problem C Generating Fast, Sorted Permutation Input: Standard Input Output: Standard Output   Generating permutation has always been an important problem in computer science. In this problem yo

Graph Coloring  You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black a

Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first number divided by the second is equal to an integer N

Problem G. Birthday Cake  Background Lucy and Lily are twins. Today is their birthday. Mother buys a birthday cake for them.Now we put the cake onto a Descartes coordinate. Its center is a

It is easy to see that for every fraction in the form (k > 0), we can always find two positive integers x and y, x ≥ y, such that: . Now our question is: can you write a program that counts h

The Settlers of Catan  Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wil