nyoj791_51CTO博客

nyoj 791 Color the fence(贪心)

Color the fence时间限制：1000 ms | 内存限制：65535 KB难度：2描述Tom has fallen in love with Mary. Now Tom wants to show hi

贪心

#include

git

ide

原创

mb64746762216fd

2023-05-30 00:00:09

31阅读

/*791. Custom Sort StringS and T are strings composed of lowercase letters. In S, no letter occurs more than once.S was sorted in some custom order previously. We want to permute the characters of T s...

数组

i++

字符串

其他

原创

jenslee

2022-02-03 11:27:04

14阅读

791. Custom Sort String

S and T are strings composed of lowercase letters. In S, no lett

leetcode-java

ide

sed

原创

wx62ea2466cca9a

2022-08-03 17:08:20

33阅读

791. Custom Sort String

感觉自己的答案比较intuitive S and T are strings composed of lowercase letters. In S, no letter occurs more than once. S was sorted in some custom order previou

c++

sed

其他

转载

mob604756f0e582

2018-08-28 21:30:00

41阅读

2评论

791. Custom Sort String**

791. Custom Sort String**https://leetcode.com/problems/custom-sort-string/题目描述S and T are sm o...

leetcode

算法

c++

sed

原创

珍妮的选择

2022-05-30 11:06:54

23阅读

791. 高精度加法

给定两个正整数（不含前导 0），计算它们的和。输入格式共两行，每行包含一个整数。输出格式共一行，包含所求的和。数据范围 1≤整数长度≤100000 输入样例： 12 23 输出样例： 35#include<iostream>#include<vector>using namespace std;const int N = 1e6+10; vector<int

c++

算法

框架

#include

数据

原创

CMMKK

2022-10-20 10:26:22

51阅读

791. Custom Sort String

/*791. Custom Sort StringS and T are strings composed of lowercase letters. In S, no letter occurs more than once.S was sorted in some custom order previously. We want to permute the characters of T s...

代码

原创

jenslee

2021-07-09 15:07:19

72阅读

791. 高精度加法

#include <iostream> #include <vector> using namespace std; vector<int> add(vector<int> A, vector<int> B) { vector<int> C; int t = 0; for (int i = 0; i ...

#include

ios

其他

转载

mob60475700473b

2021-08-28 17:54:00

125阅读

2评论

791. 高精度加法

给定两个正整数（不含前导 0），计算它们的和。共两行，每行包含一个

c++

算法

开发语言

Code

#include

原创

mb5dc7e150492dd

2022-12-17 00:17:09

58阅读

791. Custom Sort String

S and T are strings composed of lowercase letters. In S, no letter occurs more than once. S was sorted in some custom order previously. We want to per

sed

IT

转载

mob604756e85b28

2021-04-08 02:53:00

20阅读

2评论

Codeforce 791A - Bear and Big Brother

Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob. Right now, Limak and Bob weigh a and b respectivel

Codeforce

原创

心流灬灬

2021-07-14 15:58:44

176阅读

【codeforces 791A】Bear and Big Brother

【题目链接】:http://codeforces.com/contest/791/problem/A【题意】给你两个数字a和b; a每次乘3,b每次乘2 问你什么时候a第一次大于b 【题解】傻逼模拟题【完整代码】#include using namespace std;#...

#define

c++

#include

i++

题目

转载

mob604756fef1ec

2017-10-04 18:45:00

69阅读

2评论

LeetCode 791. Custom Sort String

原题链接在这里：https://leetcode.com/problems/custom-sort-string/ 题目： S and T are strings composed of lowercase letters. In S, no letter occurs more than once

LeetCode

String

c++

java

sed

转载

mb5fe18f5282239

2019-12-04 08:47:00

130阅读

2评论

[leetcode] 791. Custom Sort String

DescriptionS and T are strings composed of lowercase letters. In S, no letter occurs more tha

字符串

词频

自定义排序

原创

是念

2022-08-11 17:29:23

23阅读

CodeForces 791A Bear and Big Brother

题目链接：http://codeforces.com/contest/791/problem/A 题意：给你一个a，一个b，a每天都乘3，b每天都乘2，问你几天后a超过b 解析：a,b都不大，直接模拟即可#include <cstdio>#include <cstring>#include <algorithm>#include <cmath

codeforces

#include

ios

原创

Richie_LL

2022-11-23 10:04:12

19阅读

[LeetCode] 791. Custom Sort String

order and str are strings composed of lowercase letters. In order, no letter occurs more than once. order was sorted in some custom order previously. ...

leetcode

java

hashmap

counting sort

sort

转载

mob604756e679a4

2021-07-15 00:58:00

143阅读

2评论

Bear and Tree Jumps CodeForces - 791D

http://codeforces.com/problemset/problem/791/D想了好久也没啥思路看题解恍然大悟首先要转换思路正面考虑死路一条自己还揪着不放。。当k为1时就是个裸题就是算一下每条边的左右两边各有多少点可得每条边走了多少次假设在本题中任意两点之间的距离都是k的倍数没有向上取整那按上面的方法算完贡献除k即可除k是因为这里可以一步迈k条边...

树型DP

CodeForces

子树

i++

子节点

原创

wx62a9af7b9205e

2022-06-16 06:25:52

67阅读

CodeForces 791C Bear and Different Names

题目链接：http://codeforces.com/contest/791/problem/C 题意：给你n和k，表示有n个士兵，下面有n-k+1个字符串，表示对i到i+k-1的士兵的判断，如果i到i+k-1的士兵没有名字重复的，那就是YES，否则NO，让你输出一个符合输入的字符串序列解析：首先名字的组成很重要：”[A-Z][a-z]{0,9}”，其次是怎么搞，其实先构造出YES

codeforces

#include

i++

字符串

原创

Richie_LL

2022-11-23 10:04:02

52阅读

RFC791：INTERNET PROTOCOL网络协议

1.引言1.1、动机Internet协议旨在用于数据包交换计算机通信网络的互连系统中。这样的系统被称为“catenet”。互联网协议提供了从

RFC

运维

ip

网络协议

字段

翻译

Danileaf

2022-01-12 17:07:18

564阅读

【codeforces 791D】 Bear and Tree Jumps

【题目链接】:http://codeforces.com/contest/791/problem/D【题意】你可以从树上的节点一次最多走k条边。 (称为跳一次); 树为无权树; 然后问你任意两点之间的条的次数的和为多少; 【题解】如果k=1的话; 问题就是求任意两点之间的距离...

#define

求余

整除

复杂度

c++

转载

mob604756fef1ec

2017-10-04 18:45:00

85阅读

2评论

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

nyoj791

nyoj 791 Color the fence(贪心)

791. Custom Sort String

791. Custom Sort String

791. Custom Sort String

791. Custom Sort String**

791. 高精度加法

791. Custom Sort String

791. 高精度加法

791. 高精度加法

791. Custom Sort String

Codeforce 791A - Bear and Big Brother

【codeforces 791A】Bear and Big Brother

LeetCode 791. Custom Sort String

[leetcode] 791. Custom Sort String

CodeForces 791A Bear and Big Brother

[LeetCode] 791. Custom Sort String

Bear and Tree Jumps CodeForces - 791D

CodeForces 791C Bear and Different Names

RFC791：INTERNET PROTOCOL网络协议

【codeforces 791D】 Bear and Tree Jumps

【codeforces 791B】Bear and Friendship Condition

【codeforces 791C】Bear and Different Names

LWC 73: 791. Custom Sort String

python 电表读数 ddsy791电表读数

NYOJ 20

NYOJ 8

NYOJ 96

NYOJ 113

NYOJ 325

NYOJ 260