Thank_you

未归档

BFS标记路径(1) C F 水题(20) dfs(1) SDNUOJ(26) string(1) vector(1) 一点发现(3) 一点算法(3) 冒泡排序(1) 强制改变类型(1) 快速幂（取模）(1) 所谓函数(1) 数组a[-1](1) 栈stack(1) 线性筛(1) 队列queue(1) 随笔(1)

/ 注册

全部文章 / 未归档（共62篇）

A. System Administrator

Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers’ performance, Poly...

2019-01-09

0 383

A2. Good Matrix Elements

The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers th...

2019-01-08

0 714

A. Domino piling

You are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed...

2019-01-08

0 543

A. Word Capitalization

Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word. Note, that during capitalizati...

2019-01-08

0 512

A. Golden Plate

You have a plate and you want to add some gilding to it. The plate is a rectangle that we split into w×hw×h cells. There should be kk gilded rings, th...

2019-01-07

0 353

A. Way Too Long Words

Sometimes some words like “localization” or “internationalization” are so long that writing them many times in one text is quite tiresome. Let’s cons...

2019-01-07

0 479

山东师范大学 2019/1/7 C语言考试题部分答案

最后一题写 void sort(int x[], int y) 我写的冒泡排序，课本上还有快速排序 void sort(int x[], int y) { for(int i = 0; i <= y - 1; ++i) for(int j = i + 1; j <...

2019-01-07

0 470

A. Dice Rolling

这题完全考英文翻译！！！ Mishka got a six-faced dice. It has integer numbers from 22 to 77 written on its faces (all numbers on faces are different, so this is an...

2019-01-06

0 521

A. Scarborough Fair

Willem is taking the girl to the highest building in island No.28, however, neither of them knows how to get there. Willem asks his friend, Grick for ...

2019-01-06

0 422

SDNUOJ 小部分题解

当时写的如 ** 一般，现在整理，一点一点规范… 1010 #include<stdio.h> int main() { int n, i, space, line, star; scanf("%d", &n); for(line =...

2019-01-04

0 589