水题
Jianbagengmu
换了id,换了我的人生的态度.
展开
-
Min Number
Now you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i<j≤|n|, here |n| means the le原创 2017-04-04 18:17:21 · 235 阅读 · 0 评论 -
J. Java Beans
J. Java BeansTime Limit: 2000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status FontThere are N little kids sitting in a circle, ea原创 2017-04-17 18:16:10 · 180 阅读 · 0 评论 -
H. Hard to Play
H. Hard to PlayTime Limit: 2000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status FontMightyHorse is playing a music game called os原创 2017-04-17 18:45:23 · 392 阅读 · 0 评论 -
ZOJ 3710Friends
FriendsTime Limit: 2000msMemory Limit: 65536KBThis problem will be judged on ZJU. Original ID: 371064-bit integer IO format: %lld Java class name: MainPrev Submit Status S原创 2017-04-17 23:09:07 · 390 阅读 · 0 评论 -
L - Polynomial Integration HUST - 1575
I guess that everybody has learned the course Calculus(微积分). To tell you the truth, I hate what course because of the endless exercise to do! My teacher was so strict that he assig原创 2017-04-30 21:45:12 · 208 阅读 · 0 评论 -
F - 方程题!! HIT - 1944
看过电视剧《马大帅2》的同学,一定对其中“马大帅代课”一段情节有深刻的印象。当时,马大帅的打工子弟小学的四年级数学老师有事不能上课,马大帅到处找老师找不到,无奈只好亲自出马,代这堂数学课。这堂课本来应该讲方程题,可马大帅一道方程题也不会。结果,在学生的问题面前出尽了洋相,令人忍俊不禁:现在,请你来帮帮可怜的马大帅,解决一些简单的一元一次方程。Input 每组数据占一行。每组数据是一个一元一次方程,原创 2017-05-01 10:06:47 · 640 阅读 · 0 评论 -
F. 80ers' Memory
F. 80ers' MemoryTime Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %lld Java class name: MainSubmit Status Font PID: 18114I guess most of us are so calle原创 2017-04-15 20:17:36 · 584 阅读 · 0 评论 -
A. Second-price Auction
A. Second-price AuctionTime Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %lld Java class name: MainSubmit Status Font PID: 18109Do you know second-price原创 2017-04-15 20:19:19 · 482 阅读 · 0 评论 -
I. A Stack or A Queue?
I. A Stack or A Queue?Time Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %lld Java class name: MainSubmit Status Font PID: 18117Do you know stack and que原创 2017-04-15 20:51:22 · 518 阅读 · 0 评论 -
Lake Counting
Lake CountingTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 238664-bit integer IO format: %lld Java class name: MainPrev Submit St原创 2017-04-16 00:24:00 · 200 阅读 · 0 评论 -
A. Who is Older?
A. Who is Older?Time Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %lld Java class name: MainSubmit Status Font PID: 18229Javaman and cpcs are arguing wh原创 2017-04-16 18:10:22 · 521 阅读 · 0 评论 -
Somali Pirates
Somali PiratesTime Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %lld Java class name: MainSubmit Status Font PID: 18230It is said that the famous Somali原创 2017-04-16 18:11:34 · 231 阅读 · 0 评论 -
Wu Xing
Wu XingTime Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %lld Java class name: MainSubmit Status Font PID: 18235IntroductionThe Wu Xing, or the Five M原创 2017-04-16 21:13:17 · 223 阅读 · 0 评论 -
GPA HDU 4802
GPA Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 4802 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next In c原创 2017-05-02 20:39:33 · 313 阅读 · 0 评论 -
K. Yet Another Story of Rock-paper-scissors
K. Yet Another Story of Rock-paper-scissorsTime Limit: 2000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status Font PID: 18517Akih原创 2017-04-20 22:09:25 · 1110 阅读 · 0 评论 -
Expedition poj 2431
Expedition Time Limit: 1000msMemory Limit: 65536KB This problem will be judged on PKU. Original ID: 2431 64-bit integer IO format: %lld Java class name: Main Prev Submit Status Statistics Next原创 2017-05-06 16:28:21 · 288 阅读 · 0 评论 -
uva 11292
水题#include<iostream> #include<string> #include<set> #include<queue> #include<vector> #include<map> #include<algorithm> #include<cstdio> #include<cstring> #include<cstdlib> #include<原创 2017-05-06 22:14:46 · 348 阅读 · 0 评论 -
A. 这是一道简单的水题~
A. 这是一道简单的水题~pbz最近沉浸在数学中无法自拔,他发现了一种非常有趣的数,这个数的十进制表示形式中只含有8和9,这个数有着很好的寓意,代表了pbz的梦想和期望,他想知道对于任意的给定的正整数N,有多少个正整数M使得N*M所得得数是pbz所想要的数。 Input 第一行给出一个T,表示有T组案例,每个测试用例由一行组成,每行输入一个正整数N(1<=N*M<=1e10)Output 对于原创 2017-05-25 23:16:00 · 345 阅读 · 0 评论 -
A. 烤烙饼--开始签到
A. 烤烙饼–开始签到Y是一名流动早餐车小贩,他对做烙饼非常拿手,每天他都会去采购一定量的面粉,馅料和鸡蛋,作为第二天烙饼的原料。已知一个烙饼需要a克的面粉,b克的馅料,以及c个鸡蛋。而Y今天一共采购了A千克的面粉,B千克的馅料,以及C个鸡蛋,那么他明天一共可以做多少的烙饼呢?Input 输入包括多个案例,每个案例只有一行,包括6个数,A,B,C,a,b,c,均在int范围内。Output 对每原创 2017-05-28 22:11:49 · 407 阅读 · 0 评论 -
B. 精明的朱老板--继续签到
B. 精明的朱老板–继续签到朱老板是个精明又贪心的商人,因为做生意非常成功,他每个季度要给当地政府交大量的税款。税款的计算方式非常特别,政府规定,当你盈利了K元时,你要上交K的最大因数(不包括K本身)作为税款。比如,当朱老板这个季度盈利了6元,那么他就要上交3元作为税款。朱老板想要尽可能的减少上交的份额,于是他利用了政策的漏洞,将每个季度的盈利额分开上报,比如,当月的盈利额为K时,可以分成m1+m2原创 2017-05-28 22:17:04 · 249 阅读 · 0 评论 -
FZU 2088
最长队名 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on FZU. Original ID: 2088 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next Typ原创 2017-05-18 21:32:22 · 447 阅读 · 0 评论 -
圆啊圆
圆啊圆 Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Prev Submit Status Statistics Next Type: NoneTag it! 给出A圆的圆心坐标和其半径,给出B圆上的三点,判断这两个圆是否相切。PS: 运原创 2017-05-20 15:07:07 · 362 阅读 · 0 评论 -
hdu 2069
RPG的错排 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2068 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next 今原创 2017-06-16 22:17:05 · 248 阅读 · 0 评论 -
女装大佬
F. 女装大佬什么样才能算的上牛逼的程序员?当然是女装大佬了.这一天在操场上,有很多男人很多女人和很多的女装大佬.张队长想要把他们排成m列,每列一个人.要求女装大佬必须要在男人和女人中间.并且任意相邻的两个必须是不同的角色.张队长想知道排成m列有多少种方法?Input 一共有T组样例.(T<=1e5)每组样例输入一个数m,代表要排成m列(1<=m<=100000).Output 输出答案,由于答原创 2017-05-21 19:12:25 · 1790 阅读 · 0 评论 -
D. 揠苗助长
D. 揠苗助长阿飞是一个淳朴的农民,但是那里却有点问题。一天他来到地里,发现庄稼的高度参差不齐,他决定好好露一手,让尽可能多的庄稼在同一高度。地里一共有n颗庄稼,阿飞一共有m次机会,他每次都可以选择任意一些庄稼并把它们都拔高1高度。已知阿飞的手法不会让庄稼受到表面上的损伤,求阿飞最多可以让多少颗庄稼高度相同。 Input 案例有多组,首先给出n(1<=n<=10⁵),k(1<=k<=10⁵),表原创 2017-05-21 19:17:02 · 355 阅读 · 0 评论 -
C. 城市重建
C. 城市重建在城市的边缘有n个连续的建筑,包工头阿飞负责把这些建筑的高度改建为一致。他每次会有连续两个操作: 1.在最后一个建筑后面建造一个和当前建筑中第m个建筑高度相同的建筑。 2.拆除当前建筑中最前面的建筑。 阿飞是一个理智的人,他在开工之前想知道他是否能完成这个任务。 Input 案例有多组,第一行给出n和m,(1<=m<=n<=10^5),第二行给出n个数,a1,a2….an(1原创 2017-05-21 20:16:45 · 353 阅读 · 0 评论 -
B. 完美对称
B. 完美对称我们把一个完全对称的字符串称为“完美对称”的字符串,请仔细观察字母表,判断给出的字符串是否“完美对称”。Input 案例有多组,每组给出一个只由大小写字母组成的字符串,长度不大于1000。Output 每行输出一个答案,如果给出的字符串位“完美对称”,输出“Yes”,否则,输出“No”。Sample Input AoA aoa Sample Output Yes No#i原创 2017-05-21 20:17:37 · 444 阅读 · 0 评论 -
A. 奇数和
A. 奇数和给出n个数,求出给出数中的最大和(要求和为奇数)。Input 案例有多组,首先给出一个正整数n,(1<=n<=10⁴),下一行给出n个整数a1,a2…an(-10⁴<=ai<=10⁴)。Output 每行输出一个答案,输出最大的奇数和(题目保证有满足要求的答案)。Sample Input 5 -2 -1 1 2 3 Sample Output 5#include<iostre原创 2017-05-21 20:18:26 · 461 阅读 · 0 评论 -
hdu 1009 详解
FatMouse’ Trade Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 1009 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics原创 2017-05-22 19:59:20 · 400 阅读 · 0 评论 -
hdu 2092 水题还是要有套路的
整数解 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2092 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next Type原创 2017-06-02 17:53:36 · 201 阅读 · 0 评论 -
hdu 2089 垃圾题目毁我青春
不要62 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2089 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next 杭州人原创 2017-06-02 21:33:23 · 242 阅读 · 0 评论 -
HDU 2091 该死的格式 要注意细节
空心三角形 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2091 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next 把一原创 2017-06-02 21:40:25 · 255 阅读 · 0 评论 -
hud 2087
剪花布条 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2087 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next Typ原创 2017-06-03 21:11:09 · 258 阅读 · 0 评论 -
hdu 2073
无限的路 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2073 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next 甜甜从原创 2017-06-04 12:02:54 · 218 阅读 · 0 评论 -
hdu 2203
亲和串 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2203 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next 人随着岁原创 2017-07-10 16:45:53 · 161 阅读 · 0 评论 -
hdu 1338Game Prediction
Game Prediction Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 1338 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics原创 2017-07-10 21:50:13 · 286 阅读 · 0 评论 -
hdu 1999
简易版之最短距离 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2083 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next原创 2017-07-01 15:46:46 · 250 阅读 · 0 评论 -
hdu 2072
单词数 Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2072 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next lily原创 2017-07-01 19:17:25 · 281 阅读 · 0 评论 -
hdu2078
复习时间 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6360 Accepted Submission(s): 4668Problem Description 为了能过个好年,xhd开始复习了,于是每天晚上背着书往教室跑。x转载 2017-07-01 20:01:23 · 357 阅读 · 0 评论 -
螺旋矩阵
#include<stdio.h>#define SIZE 10int main(){ int a[SIZE][SIZE]={0}; int N; scanf("%d",&N); //每条边的下标在x,y上的增量 int dx[]={0,1,0,-1}; int dy[]={1,0,-1,0}; int x=0,y=0,nx,ny,i,k=0原创 2017-07-02 10:16:47 · 236 阅读 · 0 评论