首页
题库
公司真题
专项练习
面试题库
在线编程
面试
面试经验
AI 模拟面试
简历
求职
学习
基础学习课
实战项目课
求职辅导课
专栏&文章
竞赛
搜索
我要招人
发布职位
发布职位、邀约牛人
更多企业解决方案
在线笔面试、雇主品牌宣传
登录
/
注册
mikoto_
获赞
1
粉丝
0
关注
7
看过 TA
7
北京邮电大学
2025
游戏后端
IP属地:北京
暂未填写个人简介
私信
关注
拉黑
举报
举报
确定要拉黑mikoto_吗?
发布(61)
评论
刷题
mikoto_
关注TA,不错过内容更新
关注
北京邮电大学 游戏后端
@爱打瞌睡的柯基:
字节 大模型算法 一二三面 面经
点赞 48
评论 12
0
点赞
评论
收藏
分享
03-02 10:49
北京邮电大学 游戏后端
刷题使我快乐!
2024-03-02
在牛客打卡3天,今天学习:刷题 2 道/代码提交 4 次
每日监督打卡
0
点赞
评论
收藏
分享
2022-03-14 23:24
北京邮电大学 游戏后端
2022-03-14
在牛客打卡2天,今天学习:刷题 1 道/代码提交 1 次
每日监督打卡
0
点赞
评论
收藏
分享
2019-08-22 16:25
已编辑
北京邮电大学 游戏后端
[A*,启发式搜索] [SCOI2005] 骑士精神
链接:https://ac.nowcoder.com/acm/problem/20247来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 在一个5×5的棋盘上有12个白色的骑士和12个黑色的骑士, 且有一个空位。在任何时候一个骑士都能按照骑士的走法(它可以走到和它横坐标相差为1,纵坐标相差为2或者横坐标相差为2,纵坐标相差为1的格子)移动到空 位上。 给定一个初始的棋盘,怎样才能经过...
0
点赞
评论
收藏
分享
2019-08-22 15:06
北京邮电大学 游戏后端
A*!Astar!
2019-08-22
在牛客打卡1天,今天也很努力鸭!
0
点赞
评论
收藏
分享
2019-08-22 16:25
已编辑
北京邮电大学 游戏后端
[二分,multiset] 2019 Multi-University Training Contest 10 Welcome Party
Welcome Party Time Limit: 4000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 875 Accepted Submission(s): 194 Problem Description The annual welcome party of the Department of Computer Science and Technology is coming soon! Many students have been...
0
点赞
评论
收藏
分享
2019-08-22 16:25
已编辑
北京邮电大学 游戏后端
[概率] HDU 2019 Multi-University Training Contest 10 - Valentine's Day
Valentine's Day Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Special Judge Problem Description Oipotato loves his girlfriend very much. Since Valentine's Day is coming, he decides to buy some presents ...
0
点赞
评论
收藏
分享
2019-08-22 16:25
已编辑
北京邮电大学 游戏后端
[dfs] HDU 2019 Multi-University Training Contest 10 - Block Breaker
Block Breaker Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0 Problem Description Given a rectangle frame of size n×m. Initially, the frame is strewn with n×m square blocks of size 1×1. Due to the fric...
0
点赞
评论
收藏
分享
2019-08-22 16:25
已编辑
北京邮电大学 游戏后端
[bfs,深度记录] East Central North America Regional Contest 2016 (ECNA 2016) D Lost in Translation
Problem D Lost in Translation The word is out that you’ve just finished writing a book entitled How to Ensure Victory at a Programming Contest and requests are flying in. Not surprisingly, many of these requests are from foreign countries, and while you are versed in many programming languages, mo...
0
点赞
评论
收藏
分享
2019-08-22 16:25
已编辑
北京邮电大学 游戏后端
[状态压缩,折半搜索] 2019牛客暑期多校训练营(第九场)Knapsack Cryptosystem
链接:https://ac.nowcoder.com/acm/contest/889/D来源:牛客网 时间限制:C/C++ 2秒,其他语言4秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 Amy asks Mr. B problem D. Please help Mr. B to solve the following problem. Amy wants to crack Merkle–He...
0
点赞
评论
收藏
分享
2019-08-22 16:26
已编辑
北京邮电大学 游戏后端
[dfs] 2019牛客暑期多校训练营(第十场) Coffee Chicken
题目地址: https://ac.nowcoder.com/acm/contest/890/B 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 524288K,其他语言1048576K 64bit IO Format: %lld 题目描述 Dr. JYY has just created the Coffee Chicken strings, denoted as S(n). They are quite similar to the Fibonacci soup --- today's soup is made by mingl...
0
点赞
评论
收藏
分享
2019-08-22 16:26
已编辑
北京邮电大学 游戏后端
[二分] Codefoces Anton and Making Potions
Anton and Making Potions time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Anton is playing a very interesting computer game, but now he is stuck at one of the levels. To p...
0
点赞
评论
收藏
分享
2019-08-22 16:26
已编辑
北京邮电大学 游戏后端
[模板] 线段树
1 #include<bits/stdc++.h> 2 using namespace std; 3 typedef long long ll; 4 const int amn=1e5+5; 5 int num[amn]; 6 struct Segment_Tree{ 7 ll l,r,sum,lazy,len; 8 #define ls rt<<1 9 #define rs rt<<1|1 10 #define trl(rt) tr[rt].l 11 #define trr(rt) tr[rt].r ...
0
点赞
评论
收藏
分享
2019-08-22 16:26
已编辑
北京邮电大学 游戏后端
[线段树]Codeforces 339D Xenia and Bit Operations
Xenia and Bit Operations time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Xenia the beginner programmer has a sequence a, consisting of 2n non-negative integers: a1, a2, ....
0
点赞
评论
收藏
分享
2019-08-22 16:29
已编辑
北京邮电大学 游戏后端
[图中找环] Codeforces 659E New Reform
New Reform time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Berland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cit...
0
点赞
评论
收藏
分享
1
2
3
4
5
关注他的用户也关注了:
牛客网
牛客企业服务