王旻宇

URL：http://codeforces.com/contest/425/problem/A                                                                  A. Sereja and Swaps                                time limit per test          

无力吐槽的水题，水到你都不敢相信会有

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements ofnums except nums[i]. Solve it without division and in O(

Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. For example: Given n = 13, Return 6, because digit 1 occurred in the follow

Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space? 用o(1)的space来创建一个反向的链表，也能AC，时间是36ms，代码如下： class Solution { public: bool isPa

Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"]. Credits: Special thanks to @jianchao.li.fighter fo

Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = "anagram", t = "nagaram", return true. s = "rat", t = "car", return false. Note: You may assum

Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. Assume that the total a

第一题 将考研分数分类 #include int main(){ int t, a, b, c, d, s; scanf("%d", &t); while(t--){ scanf("%d %d %d %d", &a, &b, &c, &d); s = a + b + c + d; if(a < 60 || b <60