shyoldman的博客

A. GCD Table time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The GCD table G of size n × n for an array o

C. Joty and Chocolate time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Little Joty has got a task to do. She

Problem 2138 久违的月赛之一 Accept: 262    Submit: 553 Time Limit: 1000 mSec    Memory Limit : 32768 KB  Problem Description 好久没举月赛了，这次lqw给大家出了5道题，因为hsy学长宣传的很到位，吸引了n个DDMM们来做，另一位kk学长说，全做对的要给金奖，做对4

Clarke and points Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 480    Accepted Submission(s): 337 Problem Description Clarke is

C. The Monstertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs Will is stuck in the Upside Down, he can still communicate with his mom, Joyce, th...

DZY Loves Partition  Accepts: 154  Submissions: 843 Time Limit: 4000/2000 MS (Java/Others)  Memory Limit: 262144/262144 K (Java/Others)问题描述DZY喜欢拆分数字。他想知道能否把nn拆成恰好kk个不重复的正整数之和。 思考了一会儿之后他发现这个题太简单，于是他想要...

C. Rational Resistancetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMad scientist Mike is building a time machine in his spare time. To finish th...

Coprime SequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1769    Accepted Submission(s): 825Problem DescriptionDo you know what is call...

C. The Meaningless Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSlastyona and her loyal dog Pushok are playing a meaningless game that is in...

链接：https://www.nowcoder.com/acm/contest/139/D 来源：牛客网   题目描述 Two undirected simple graphs and where are isomorphic when there exists a bijection on V satisfying  if and only if {x, y} ∈ E2. Given...

Problem E. Matrix from Arrays Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 884    Accepted Submission(s): 396   Problem Description Kaz...

转载自：https://blog.youkuaiyun.com/dog250/article/details/6612496     说明： 1).本文以TCP的发展历程解析容易引起混淆，误会的方方面面 2).本文不会贴大量的源码，大多数是以文字形式描述，我相信文字看起来是要比代码更轻松的 3).针对对象：对TCP已经有了全面了解的人。因为本文不会解析TCP头里面的每一个字段或者3次握手的细节，也不会解...

C. Marco and GCD Sequence time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output In a dream Marco met an elderly ma

C. Pride time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You have an array a with length n, you can perfo

A. Greed time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Jafar has n cans of cola. Each can is described by

最大的位或 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2377    Accepted Submission(s): 904 Problem Description B君和G君聊天的时候想到了如下的问题。

异或密码 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1868    Accepted Submission(s): 614 Problem Description 晨晨在纸上写了一个长度为N的非负整数序列{a

C. Classroom Watch time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Eighth-grader Vova is on duty today in th

B. Divisiblity of Differences time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output You are given a multiset of n

1110 距离之和最小 V3 基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题  收藏  关注 X轴上有N个点，每个点除了包括一个位置数据X[i]，还包括一个权值W[i]。点P到点P[i]的带权距离 = 实际距离 * P[i]的权值。求X轴上一点使它到这N个点的带权距离之和最小，输出这个最小的带权距离之和。

1109 01组成的N的倍数 基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题  收藏  关注 给定一个自然数N，找出一个M，使得M > 0且M是N的倍数，并且M的10进制表示只包含0或1。求最小的M。 例如：N = 4，M = 100。 Input 输入1个数N。(1  Ou

Subsequence Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16812   Accepted: 7141 Description A sequence of N positive integers (10 < N < 100 000), each o

Humble Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27390    Accepted Submission(s): 12067 Problem Description A number

Ignatius and the Princess II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8871    Accepted Submission(s): 5216 Problem Description

1266 蚂蚁 题目来源： Poj 基准时间限制：1 秒 空间限制：131072 KB 分值: 20 难度：2级算法题  收藏  关注 n只蚂蚁以每秒1cm的速度在长为Lcm的竿子上爬行。当蚂蚁爬到竿子的端点时就会掉落。由于竿子太细，两只蚂蚁相遇时，它们不能交错通过，只能各自反向爬回去。对于每只蚂蚁，我们知道它距离竿子左端的距离xi，但不知

Given an arrayAof positive integers,A[i]represents the value of thei-th sightseeing spot, and twosightseeing spotsiandjhave distancej - ibetween them. Thescoreof a pair (i < j) of si...