Cat Noku has obtained a map of the night sky. On this map, he found a constellation with n stars numbered from 1to n. For each i, the i-th star is located at co...

There are n sharks who grow flowers for Wet Shark. They are all sitting around the table, such that sharks i andi + 1 are neighbours for all i from 1 to n - 1. ...

题There are 2N white balls on a table in two rows, making a nice 2-by-N rectangle. Jon has a big paint bucketfull of black paint. (Don’t ask why.) He wants to ...

Today, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, ...

Theater stage is a rectangular field of size n × m. The director gave you the stage's plan which actors will follow. For each cell it is stated in the plan if t...

海洋包围的小岛，岛内的有湖，'.'代表水，'*'代表陆地，给出的n*m的地图里至少有k个湖，求填掉面积尽量少的水，使得湖的数量正好为k。...

http://codeforces.com/problemset/problem/723/B

n个数，用最少的次数来改变数字，使得1到m出现的次数的最小值最大。输出最小值和改变次数以及改变后的数组。

A gourmet came into the banquet hall, where the cooks suggested n dishes for guests. The gourmet knows the schedule: when each of the dishes will be served.

<template><input v-model="initial" v-on:input="change"></input></template><script>export default {name: "test",data: () => ({initial: "Initial Value"})......