CodeForces 569A 第六周比赛C踢

【CodeForces 569A 第六周比赛C踢】的更多相关文章

CodeForces 569A 第六周比赛C踢

C - C Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 569A Description Little Lesha loves listening to music via his smartphone. But the smartphone doesn't have much memory, so Lesha lis…

CodeForces 478B 第六周比赛B题

B - B Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description n participants of the competition were split into m teams in some manner so that each team has at least one participant. After the competition each pair…

Codeforces 559A 第六周 O题

Description Gerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to . Then he measured the length of its sides, and found that each of them is equal to an integer number of centimeters. Th…

CodeForces 569A 第八次比赛 C题

Description Little Lesha loves listening to music via his smartphone. But the smartphone doesn't have much memory, so Lesha listens to his favorite songs in a well-known social network InTalk. Unfortunately, internet is not that fast in the city of E…

LightOJ 1317 第六周比赛A题

A - A Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Description You probably have played the game "Throwing Balls into the Basket". It is a simple game. You have to throw a ball into a basket from a certain dis…

HUAS 2017暑假第六周比赛-题解

A.Parenthesis 括号匹配的问题有一种经典的做法. 将左括号看成1,右括号看成-1,做一遍前缀和sum. 括号序列是合法的当且仅当\(sum[n]=Min(sum[1],sum[2]....sum[n])=0\)时成立. 于是问题变成了交换两个括号后如何维护sum数组的值. 实际上交换a和b之后只会影响到\((sum[a],sum[a+1]....sum[b-1])\). 1.\(s[a]=(,s[b]=)\) 对应的区间减2. 2.\(s[a]=),s[b]=(\) 对应的区间加2.…

【FOL】第六周

最近太忙,三周(第四.五.六周)一起记录一下. 1.完成了键盘的输入,顺便把之前鼠标输入改了一下(最早是在渲染循环里面处理鼠标事件) 2.UI控件方面,做了个Edit控件,把之前的Label.Image.Button完善了一下 3.Delphi与lua方面的交互做了些修改,减少数据的多次处理,本来自己写了个数据存取对象,后来也都统一改成用msgpack. 4.网络方面,增加了一个gate服务器,客户端加了个fol.net.gate的context. 5.业务方面,做了login.chat.mai…