水|坑
XiWenjuan086
这个作者很懒,什么都没留下…
展开
-
计蒜客 程序设计:迷宫(坑多)
有一个n \times mn×m的迷宫,其中.表示空地,*表示障碍物。除此之外,有qq个单向传送门:如果进入格子(a_i,b_i)(ai,bi),那么会被立即传送到(c_i,d_i)(ci,di)。保证每个点至多是一个传送门的入口。如果传送门最终传送到障碍物上,那么将会卡在障碍物上不能移动。在传送门内部传送的花费是00,在空地上每次可以往周围四个格子移动,花费是11。现在我们想知道从(1,1)(1,1)走到(x,y)(x,y)的最短距离。如果无法到达终点...原创 2020-07-08 12:31:40 · 770 阅读 · 0 评论 -
POJ - 2502 Subway(最短路)
You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want ...原创 2020-03-10 18:46:49 · 168 阅读 · 1 评论 -
中国石油大学ACM俱乐部开放训练赛---问题 K: 数学问题(预处理 + 二维前缀和)
问题 K: 数学问题时间限制: 1 Sec内存限制: 128 MB提交: 381解决: 24[状态] [提交] [命题人:外部导入]题目描述我们高中曾经学过何为组合数。 那么,给出整数n,m,g,聪明的你能否求出有多少整数对(i,j),满足g整除吗?(其中0≤i≤n,0≤j≤min(i,m))。 (提示:n!=1×2×⋯×n;特别地,0!=1。)输入第一行一个整数T...原创 2020-03-09 10:57:27 · 246 阅读 · 0 评论 -
中国石油大学ACM俱乐部开放训练赛---问题 B: 奎奎发红包(贪心)
问题 B: 奎奎发红包时间限制: 1 Sec内存限制: 128 MB提交: 2489解决: 390[状态] [提交] [命题人:外部导入]题目描述情人节又到了,又到了一年一度发红包的时间。经大家研究决定,今年让奎奎自愿发红包。俱乐部有n个人(0<n<100000),每个人都有一个单身值v[i]与亲密度t[i](0≤v[i]≤10000,0≤t[i]≤10000...原创 2020-03-08 23:40:10 · 286 阅读 · 0 评论 -
codeforces 1321 C. Remove Adjacent(水 • 思维)
C. Remove Adjacenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a stringssconsisting of lowercase Latin letter...原创 2020-03-02 13:37:27 · 292 阅读 · 0 评论 -
CTU Open Contest 2019 B Beer Bill(模拟)
Beer Billbill.c, bill.cpp, Bill.java, bill.pyPub bills were introduced into daily life long before computers even existed. People tend to think that once a bill has been paid, it is no more than a p...原创 2020-02-22 19:54:15 · 244 阅读 · 0 评论 -
2020牛客寒假算法基础集训营5 Hash (水题)
链接:https://ac.nowcoder.com/acm/contest/3006/H来源:牛客网题目描述这里有一个hash函数const int LEN = 6;int mod;int Hash(char str[]){int res = 0;for (int i = 0; i < LEN; i++){res = ...原创 2020-02-13 19:57:22 · 1328 阅读 · 0 评论 -
CodeForces - 796B Find The Bone (水题)
Zane the wizard is going to perform a magic show shuffling the cups.There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the...原创 2019-10-28 20:09:46 · 163 阅读 · 0 评论 -
Smooth Sequences(暴力 细节)
A sequence of n integers is called smooth, if the absolute values of the differences between successive numbers are at most d. We call a non-smooth sequence semi-smooth, if we can change exactly one n...原创 2019-10-16 21:31:40 · 220 阅读 · 0 评论 -
sdnuoj1536(水题)
1536.How many users on SDNU OJ题目见下图可以用map#include <cstdio>#include <iostream>#include <map>#include <cstring>using namespace std;int main(){ int t,n..原创 2019-02-25 20:12:44 · 276 阅读 · 0 评论 -
sdnuoj1533(水题)
1533.寻找复读机某小队里一共有 n 个人,他们的编号是 1…n,其中有一些人本质上是复读机。底层群员柳予欣发现,如果一个人的本质是复读机,那么他每次发的消息一定跟群里的上一条消息一样,特别地第一个发消息的人一定不是复读机。某不愿透露姓名的管理员现在搞到了一份聊天记录,他想请你找出所有可能是复读机的群友。Input多组输入。每组输入的第一行两个正整数 n,m,表示群里的人数和聊天记录的总条...原创 2019-02-28 19:50:32 · 352 阅读 · 0 评论 -
sdnuoj1053(水题)
1053.水题4Descriptionlg寂寞了lg想家了lg想你了lg发明了一种加法1+1=b2+2=d3+3=fA+1=r…所以他要来难倒syc,但是万能的鲁观已经破解了这一切,所以鲁观告诉你这方法很水你自己判断吧!Input多个测试数据每行2个元素a,bOutput求出每行数据的结果Sample Input1 12 23 3Sample Output...原创 2019-02-18 20:10:08 · 243 阅读 · 0 评论 -
sdnuoj1051(水题)
1051.水题2Description 李观给鲁观写了份只有他能看懂的情书但是木有关系,万能的鲁观已经发现了破解的方法现在你要把这个方法自动化,这就是你的任务嗯但是问题是,情书的内容只有一句话:n 55!w ! pue n a^o7 ! n paau ! Input 一行情书内容(长度不超过100...原创 2019-02-18 17:17:59 · 500 阅读 · 0 评论 -
sdnuoj1208玉玉抓兔子(模拟)
SDNUOJ1208.玉玉抓兔子 Description 围绕着山顶有n个圆形排列的洞,玉玉要吃兔子,兔子说:“可以,但必须找到我,我就藏于这1..n个洞中,你先到1号洞找,第二次隔1个洞(即3号洞)找,第三次隔2个洞(即6号洞)找,以后如此类推,次数不限.”但玉玉从早到晚找了m次,仍没有找到兔子.问:兔子究竟藏在那个洞里?请输出兔子可能存在的洞号。若兔子无处可藏,输出-1。 ...原创 2019-02-18 14:14:31 · 284 阅读 · 0 评论 -
sdnu1250递归
1250.F.陆历川让你A个题DescriptionThis a veryyyyyyyyyyyyyy hard problem.One day, Lulichuan was played in city X with his friend, they like to paly a game called hide and seek,they was playing hide-and-seek,...原创 2019-06-09 21:30:24 · 203 阅读 · 0 评论 -
POJ - 1503(坑人的大数)
Integer InquiryOne of the first users of BIT’s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers....原创 2019-03-13 23:20:13 · 137 阅读 · 0 评论 -
sdnu1103.买彩票(组合数)
Description最近LG的RP爆发,准备买注彩票,而他正好找到了一种看起来不错的彩票。这种彩票需要从1到i中选出j个号码,然后从1到k中选出l个号码。LG想知道他到底可以有多少种选择号码的方法。Input一行四个正整数 i j k lOutput一行 选择号码的方法数(应该不必涉及高精度)Sample Input5 2 7 5Sample Output...原创 2019-07-26 15:00:07 · 406 阅读 · 0 评论 -
v4t3561(拆斐波那契数)
FibonacciDescriptionFibonacci numbers are well-known as follow:Now given an integer N, please find out whether N can be represented as the sum of several Fibonacci numbers in such a way that the su...原创 2019-03-18 19:01:34 · 136 阅读 · 0 评论 -
v4t 1507(题意 水题)
Execution of PaladinDescriptionMurloc is a powerful race in Hearthstone. In the set League of Explorers, a new Paladin ability card called Anyfin Can Happen is released with the ability to summon 7 ...原创 2019-03-17 21:09:36 · 124 阅读 · 0 评论 -
zoj3600(暴力模拟)
Taxi FareLast September, Hangzhou raised the taxi fares.The original flag-down fare in Hangzhou was 10 yuan, plusing 2 yuan per kilometer after the first 3km and 3 yuan per kilometer after 10km. The...原创 2019-05-04 15:38:42 · 197 阅读 · 0 评论 -
hdu2005(日期)
#include<cstdio>#include<iostream>#include<cstring>using namespace std;int main(){ int n,i,y,r,num; char s[15]; while(gets(s)) { n=(s[0]-'0')*1000+(s[1]-'0')*100+(s[2]-'0')*10+(s[3]-'0'); if原创 2019-01-23 14:16:13 · 240 阅读 · 0 评论 -
hdu1002(水题)
A + B Problem III have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of the input contains an integer T(1<=T<=20) wh...原创 2019-03-18 21:38:16 · 362 阅读 · 0 评论 -
hduoj6468(手糊)
zyb的面试Problem Description 今天zyb参加一场面试,面试官听说zyb是ACMer之后立马抛出了一道算法题给zyb:有一个序列,是1到n的一种排列,排列的顺序是字典序小的在前,那么第k个数字是什么?例如n=15,k=7, 排列顺序为1, 10, 11, 12, 13, 14, 15, 2, 3, 4, 5, 6, 7, 8, 9;那么第7个数字就是15.那么,如果你处...原创 2019-03-16 19:22:46 · 147 阅读 · 0 评论 -
sdnuoj1105(椭圆面积 注意输出格式)
1105.椭圆Description有一个中心在原点,一焦点为(c,0)且离心率为j/k的椭圆,求其面积 Input 一行 三个正整数 c j k Output 一行 椭圆面积 保留3位小数 Sample Input 4 7 9 ...原创 2019-02-18 16:22:35 · 195 阅读 · 0 评论 -
CodeForces - 569B(水题)
InventoryCompanies always have a lot of equipment, furniture and other things. All of them should be tracked. To do this, there is an inventory number assigned with each item. It is much easier to cr...原创 2019-03-04 20:43:23 · 219 阅读 · 0 评论