每一段连续的0 有多少全0substring呢？观察计算可知是其长度N的连续加和至0，也就是N + N-1 + N-2 。。。。+ 1 class Solution:"""@param str: the string@return: the number of substrings """def stringCount(self, string):# Write your code here.p

给大家推荐个靠谱的公众号程序员探索之路，大家一起加油 /* 愚人节的礼物 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6456    Accepted Submission(s): 3922 Problem Descriptio

想到坐标的转换是重点。参看pku 2265 bee maja #include  < iostream > #include  < cmath > #include  < algorithm > using   namespace  std; //  1 is inlayer 0 //  east ,west ,... void  getPos( int &  x, int &  y,