暴力
文章平均质量分 77
古宇hhhh
一直想着自己的梦
展开
-
hdu 5461 Largest Point
Problem Description Given the sequence A with n integers t1,t2,⋯,tn. Given the integral coefficients a and b. The fact that select two elements ti and tj of A and i≠j to maximize the value of at2i+btj原创 2017-01-20 20:23:48 · 172 阅读 · 0 评论 -
zoj 3610 Yet Another Story of Rock-paper-scissors 忽悠。。
Akihisa and Hideyoshi were lovers. They were sentenced to death by the FFF Inquisition. Ryou, the leader of the FFF Inquisition, promised that the winner of Rock-paper-scissors would be immune from原创 2017-08-17 18:02:02 · 247 阅读 · 0 评论 -
UESTC - 929
Post officeTime Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Submit StatusThere are N(N≤1000)N(N≤1000) villages along a straight road, numbered原创 2017-08-17 18:13:36 · 246 阅读 · 0 评论 -
hdu 4749 Parade Show (暴力水 (正解应该是kmp变形))
Parade ShowTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2085 Accepted Submission(s): 843Problem Description 2013 is t原创 2017-08-22 12:39:57 · 284 阅读 · 0 评论 -
CodeForces - 763A Timofey and a tree (树性质的应用)
A. Timofey and a treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach New Year Timofey and his friends原创 2017-08-22 19:56:05 · 375 阅读 · 0 评论 -
CodeForces - 765B Code obfuscation 水题。
B. Code obfuscationtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputKostya likes Codeforces contests very m原创 2017-08-22 20:31:05 · 346 阅读 · 0 评论 -
长沙理工大学第十二届ACM大赛 L 选择困难症 (优化点的暴力)
题目描述小L有严重的选择困难症。早上起床后,需要花很长时间决定今天穿什么出门。假设一共有k类物品需要搭配选择,每类物品的个数为Ai,每个物品有一个喜欢值Vj,代表小L对这件物品的喜欢程度。小L想知道,有多少种方案,使得选出来的总喜欢值>M需要注意,每类物品,至多选择1件,可以不选。输入描述:多组输入每组数据第一行输入k M(k<=6,1<=M<=1原创 2017-09-04 17:42:54 · 887 阅读 · 0 评论 -
长沙理工大学第十二届ACM大赛 D 小M和天平
题目描述小M想知道某件物品的重量,但是摆在他面前的只有一个天平(没有游标)和一堆石子,石子可以放左边也可以放右边。他现在知道每个石子的重量。问能不能根据上述条件,能不能测出所问的重量。输入描述:多组数据,第一行一个数N,表示石子个数。(1输出描述:对于每组数据,输出"YES"或者"NO"示例1题目本身挺难的。。可是数据给的太小了。。原创 2017-09-04 21:02:08 · 832 阅读 · 0 评论 -
长沙理工大学第十二届ACM大赛 J 武藏牌牛奶促销
题目描述武藏牌牛奶为了吸引顾客,推出优惠活动,可以使用x个空的瓶身,**或者**y个瓶盖,去商店换一瓶全新的武藏牌牛奶。注意,一瓶牛奶包含了瓶身和瓶盖。现在小萌老师有a个空的瓶身和b个瓶盖,她想喝到尽可能多的牛奶,你知道她到底能喝到多少瓶完整的牛奶吗?输入描述:多组输入每组数据第一行包含4个正整数x y a b(1输出描述:对于每组数据,输出一行,表示小萌老师原创 2017-09-04 21:06:20 · 1329 阅读 · 0 评论 -
长沙理工大学第十二届ACM大赛 C 安卓图案解锁
栗主席(lizi)是某xxxx大学的一个不得了的程序猿,然而没想到吧,他竟然有女盆友,我们假设为QAQ!!!那天,QAQ问栗子:你的小米5s的图像解锁密码到底是多少?栗子:嘛?我仔细想想... QAQ:你仿佛在逗我......栗子:我的图像解锁用过好多次密码,后来都是用指纹解锁,所以忘记密码辣。但是我记得可能是那几个密码QAQ:那你务必告诉我...栗子: ...原创 2017-09-04 21:11:13 · 716 阅读 · 0 评论 -
hrbust 1962 Rectangular Pizza (结构体排序)
Rectangular PizzaTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 87(55 users)Total Accepted: 55(54 users)Rating: Special Judge: NoDescription原创 2017-09-05 16:30:45 · 256 阅读 · 0 评论 -
hrbust 1283 又见皇后
又见皇后Time Limit: 3000 MSMemory Limit: 65536 KTotal Submit: 122(33 users)Total Accepted: 45(25 users)Rating: Special Judge: NoDescription国际象棋中原创 2017-09-15 18:09:51 · 290 阅读 · 0 评论 -
Gym - 101149J Panoramic Photography (暴力)
J. Panoramic Photographytime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputMost of the students of the law school prefer原创 2017-09-02 20:44:06 · 290 阅读 · 0 评论 -
zoj 3609 Modular Inverse
The modular modular multiplicative inverse of an integer a modulo m is an integer xsuch that a-1≡x (mod m). This is equivalent to ax≡1 (mod m).InputThere are multiple test cases. The first line原创 2017-08-17 17:50:39 · 218 阅读 · 0 评论 -
zoj 3603 Draw Something Cheat
Have you played Draw Something? It's currently one of the hottest social drawing games on Apple iOS and Android Devices! In this game, you and your friend play in turn. You need to pick a word and d原创 2017-08-17 17:34:35 · 174 阅读 · 0 评论 -
hrbust 哈理工 统计地雷数量
暴力扫图一开始将图形清空遍历图中’。‘的8个方向点G - 统计地雷数量Time Limit: 1000 MS Memory Limit: 65536 KB64-bit integer IO format: %lld , %llu Java class name: Main[Submit] [Status]DescriptionC++群原创 2017-01-21 17:07:09 · 411 阅读 · 0 评论 -
防守阵地 II
#include#include#define rr 1000000int a[rr+5],sum[rr+5],ssum[rr+5];int main(){ int n,m,q; while(~scanf("%d%d%d",&n,&m,&q)) { sum[0]=ssum[0]=0; for(int i=1;i<=n;i++)原创 2017-02-15 16:35:38 · 273 阅读 · 0 评论 -
Timofey and cubes (水题)
Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number ai, which is written on it. Timofey put all the cubes in a row and went to u原创 2017-04-07 12:46:06 · 384 阅读 · 0 评论 -
UVA 7340 Sum of MSLCM
思路在代码上。。。1.筛法求素打表4000ms++2.技巧哈。。。20ms++#include#include#define N 20000001long long num[20000002];long long sum[N+1];void init(){ for(int i=1;i<=N;i++) { for(int j=i;j<=N;j原创 2017-04-18 17:29:59 · 396 阅读 · 0 评论 -
zoj 3869 Ace of Aces (水题)
There is a mysterious organization called Time-Space Administrative Bureau (TSAB) in the deep universe that we humans have not discovered yet. This year, the TSAB decided to elect an outstanding membe原创 2017-04-30 11:39:40 · 247 阅读 · 0 评论 -
J - Convert QWERTY to Dvorak ZOJ - 3878 (模拟)
Edward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Caps Lock key, so Edward never presses the broken Caps Lock key. Luckily, all the ot原创 2017-04-30 13:51:38 · 531 阅读 · 0 评论 -
FZU - 2212 Super Mobile Charger
While HIT ACM Group finished their contest in Shanghai and is heading back Harbin, their train was delayed due to the heavy snow. Their mobile phones are all running out of battery very quick. Luckily原创 2017-05-01 10:52:00 · 211 阅读 · 0 评论 -
hrbust 2256 南西群岛海域·冲之岛近海(暴力)
南西群岛海域·冲之岛近海Time Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 165(63 users)Total Accepted: 59(53 users)Rating: Special Judge: NoDescription原创 2017-05-18 21:51:52 · 300 阅读 · 0 评论 -
整数划分 (dfs)
将正整数n表示成一系列正整数之和:n=n1+n2+...+nk,其中n1>=n2>=...>=nk>=1。正整数n的这种表示称为正整数n的划分。求正整数n的不同划分个数。例如,正整数6有如下11种不同的划分:6: 6; 5+1; 4+2; 4+1+1; 3+3; 3+2+1; 3+1+1+1; 2+2+2; 2+2+1+1; 2+1+1+1+1; 1+1+1+1+1+1.Input多组测试数据原创 2017-06-05 12:47:41 · 643 阅读 · 0 评论 -
hdu 5703 Desert 水题
DesertTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1240 Accepted Submission(s): 876Problem DescriptionA tourist gets lost原创 2017-08-16 17:27:55 · 266 阅读 · 0 评论 -
hdu 5704 Luck Competition 水题
Problem DescriptionParticipants of the Luck Competition choose a non-negative integer no more than 100 in their mind. After choosing their number, let K be the average of all numbers, and M be原创 2017-08-16 18:05:59 · 1050 阅读 · 2 评论 -
hdu 5705 Clock
ClockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1020 Accepted Submission(s): 362Problem DescriptionGiven a time HH:MM:SS原创 2017-08-16 18:35:30 · 371 阅读 · 0 评论 -
zoj 3600 Taxi Fare
Taxi FareTime Limit: 2 Seconds Memory Limit: 65536 KBLast September, Hangzhou raised the taxi fares.The original flag-down fare in Hangzhou was 10 yuan, plusing 2 yuan per kilometer aft原创 2017-08-17 17:18:31 · 256 阅读 · 0 评论 -
hdu 5952 Counting Cliques
Counting CliquesTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2630 Accepted Submission(s): 966Problem DescriptionA clique i原创 2017-10-07 17:39:21 · 234 阅读 · 0 评论