随笔分类 -  思维

2018 ccpc final I. Cockroaches
摘要:I. Cockroaches time limit per test6.0 s memory limit per test256 MB inputstandard input outputstandard output There are N cockroaches in the field. Cockroach i is located at coordinate (xi,yi). No tw... 阅读全文

posted @ 2019-04-21 21:46 cltt 阅读(592) 评论(0) 推荐(0) 编辑

问题 1936: [蓝桥杯][算法提高VIP]最大乘积
摘要:问题 1936: [蓝桥杯][算法提高VIP]最大乘积 时间限制: 1Sec 内存限制: 128MB 提交: 77 解决: 16 问题 1936: [蓝桥杯][算法提高VIP]最大乘积 时间限制: 1Sec 内存限制: 128MB 提交: 77 解决: 16 问题 1936: [蓝桥杯][算法提高V 阅读全文

posted @ 2019-03-21 20:47 cltt 阅读(335) 评论(0) 推荐(0) 编辑

牛客练习赛29 B
摘要:炎热的早上,gal男神们被迫再操场上列队,gal男神们本来想排列成x∗x的正方形,可是因为操场太小了(也可能是gal男神太大了),校长安排gal男神们站成多个4∗4的正方形(gal男神们可以正好分成n个正方形)但是有些gal男神对于这种站法颇有微词,所以他们把衣服脱下来拿在手上摇晃示威,站在一条直线 阅读全文

posted @ 2018-10-21 21:23 cltt 阅读(139) 评论(0) 推荐(0) 编辑

zoj 4056
摘要:At 0 second, the LED light is initially off. After BaoBao presses the button 2 times, the LED light turns on and the value of the counter changes to 1 阅读全文

posted @ 2018-09-18 09:21 cltt 阅读(181) 评论(0) 推荐(0) 编辑

zoj 4054
摘要:#define ll long long const int N =1e5+9; int t; ll ans,tmp; char s[N]; int main() { scanf("%d",&t); while(t--) { scanf("%s",s); int l=strlen(s)... 阅读全文

posted @ 2018-09-18 00:27 cltt 阅读(184) 评论(0) 推荐(0) 编辑

ACM-ICPC 2018 徐州赛区网络预赛 A. Hard to prepare
摘要:262144K After Incident, a feast is usually held in Hakurei Shrine. This time Reimu asked Kokoro to deliver a Nogaku show during the feast. To enjoy th 阅读全文

posted @ 2018-09-12 23:59 cltt 阅读(176) 评论(0) 推荐(0) 编辑

ACM-ICPC 2018 徐州赛区网络预赛 G. Trace
摘要:There's a beach in the first quadrant. And from time to time, there are sea waves. A wave ( xx , yy ) means the wave is a rectangle whose vertexes are 阅读全文

posted @ 2018-09-11 22:23 cltt 阅读(284) 评论(0) 推荐(0) 编辑

ACM-ICPC 2018 南京赛区网络预赛 B. The writing on the wall
摘要:Feeling hungry, a cute hamster decides to order some take-away food (like fried chicken for only 3030 Yuan). However, his owner CXY thinks that take-a 阅读全文

posted @ 2018-09-07 23:32 cltt 阅读(206) 评论(0) 推荐(0) 编辑

The North American Invitational Programming Contest 2018 D. Missing Gnomes
摘要:A family of nn gnomes likes to line up for a group picture. Each gnome can be uniquely identified by a number 1..n1..n written on their hat. Suppose t 阅读全文

posted @ 2018-08-16 15:53 cltt 阅读(148) 评论(0) 推荐(0) 编辑

Wannafly挑战赛21 机器人
摘要:从前在月球上有一个机器人。月球可以看作一个 n*m 的网格图,每个格子有三种可能:空地,障碍,机器人(有且仅有一个),现在地面指挥中心想让机器人在月球上行走,每次可以发送一个指令,为 U-往上走、D-往下走、L-往左走、R-往右走的其中之一。当机器人接收到一个行走指令时,如果即将到达的位置为障碍物, 阅读全文

posted @ 2018-08-11 12:18 cltt 阅读(178) 评论(0) 推荐(0) 编辑

cf 1017C
摘要:C. The Phone Number time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. The Phone Number t 阅读全文

posted @ 2018-08-10 23:29 cltt 阅读(173) 评论(0) 推荐(0) 编辑

cf 1016C
摘要:C. Vasya And The Mushrooms time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Vasya And 阅读全文

posted @ 2018-08-07 09:40 cltt 阅读(170) 评论(0) 推荐(0) 编辑

Nordic Collegiate Programming Contest 2015​ E. Entertainment Box
摘要:Ada, Bertrand and Charles often argue over which TV shows to watch, and to avoid some of their fights they have finally decided to buy a video tape re 阅读全文

posted @ 2018-07-28 17:51 cltt 阅读(177) 评论(0) 推荐(0) 编辑

Nordic Collegiate Programming Contest 2015​ D. Disastrous Downtime
摘要:You're investigating what happened when one of your computer systems recently broke down. So far you've concluded that the system was overloaded; it l 阅读全文

posted @ 2018-07-27 14:51 cltt 阅读(300) 评论(0) 推荐(0) 编辑

hdu 6318
摘要:Long long ago, there was an integer sequence a.Tonyfang think this sequence is messy, so he will count the number of inversions in this sequence. Beca 阅读全文

posted @ 2018-07-26 10:37 cltt 阅读(195) 评论(0) 推荐(0) 编辑

hdu 6301
摘要:Distinct Values Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3105 Accepted Submission(s): 1000 阅读全文

posted @ 2018-07-25 00:09 cltt 阅读(116) 评论(0) 推荐(0) 编辑

有点贪心
摘要:You are given nn strings str1,str2,…,strnstr1,str2,…,strn, each consisting of ( and ). The objective is to determine whether it is possible to permute 阅读全文

posted @ 2018-07-22 15:12 cltt 阅读(181) 评论(0) 推荐(0) 编辑

Down the Pyramid
摘要:Do you like number pyramids? Given a number sequence that represents the base, you are usually supposed to build the rest of the "pyramid" bottom-up: 阅读全文

posted @ 2018-07-19 19:21 cltt 阅读(647) 评论(0) 推荐(0) 编辑

SHIWEITI
摘要:1 //Wannafly挑战赛19(牛客网) 2 //A 队列Q 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 int n,m; 10 const int N=1e5+4; 11 int id[N],a[N]; 12 char s[10]; 13 boo... 阅读全文

posted @ 2018-07-12 19:52 cltt 阅读(199) 评论(0) 推荐(0) 编辑

< 2025年3月 >
23 24 25 26 27 28 1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31 1 2 3 4 5

导航

统计

点击右上角即可分享
微信分享提示