摘要： Imagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago 阅读全文

摘要： Transmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system 阅读全文

摘要： The cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham 阅读全文

摘要： A prince of the Science Continent was imprisoned in a castle because of his contempt for mathematics when he was young, and was entangled in some math 阅读全文

摘要： There's a beach in the first quadrant. And from time to time, there are sea waves. A wave ( xx , yy ) means the wave is a rectangle whose vertexes are 阅读全文

摘要： 题目描述 给出一个 n * n 的邻接矩阵A. A是一个01矩阵 . A[i][j]=1表示i号点和j号点之间有长度为1的边直接相连. 求出从 1 号点 到 n 号点长度为k的路径的数目. 输入描述: 第1行两个数n,k (20 ≤n ≤ 30,1 ≤ k ≤ 10)第2行至第n+1行，为一个邻接矩 阅读全文

摘要： Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text pp. Her job is relatively simple -- just to find the first 阅读全文

摘要： 题目描述 一个学校里老师要将班上 NN 个同学排成一列，同学被编号为 $1～N$ ，他采取如下的方法： 先将 11 号同学安排进队列，这时队列中只有他一个人； 2-N2−N 号同学依次入列，编号为i的同学入列方式为：老师指定编号为i的同学站在编号为 1-(i -1)1−(i−1) 中某位同学（即之前 阅读全文

摘要： D. Concatenated Multiples You are given an array aa, consisting of nn positive integers. Let's call a concatenation of numbers xx and yy the number th 阅读全文

摘要： C. Maximal Intersection time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output C. Maximal Inter 阅读全文