_Zlrrr - 博客园

2018年11月2日

摘要： https://leetcode.com/problems/roman-to-integer/description/ Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For exa 阅读全文

posted @ 2018-11-02 21:17 _Zlrrr 阅读(104) 评论(0) 推荐(0)

#Leetcode# 9. Palindrome Number

摘要： https://leetcode.com/problems/palindrome-number/description/ Determine whether an integer is a palindrome. An integer is a palindrome when it reads th 阅读全文

posted @ 2018-11-02 21:16 _Zlrrr 阅读(135) 评论(0) 推荐(0)

#Leetcode# 7. Reverse Integer

摘要： https://leetcode.com/problems/reverse-integer/description/ Given a 32-bit signed integer, reverse digits of an integer. Example 1: Example 2: Example 阅读全文

posted @ 2018-11-02 21:14 _Zlrrr 阅读(106) 评论(0) 推荐(0)

POJ 3360 H-Cow Contest

摘要： http://poj.org/problem?id=3660 N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows 阅读全文

posted @ 2018-11-02 13:14 _Zlrrr 阅读(313) 评论(0) 推荐(0)

2018年11月1日

#Leetcode# 1.Two Sum

摘要： https://leetcode.com/problems/two-sum/description/ Given an array of integers, return indices of the two numbers such that they add up to a specific t 阅读全文

posted @ 2018-11-01 19:23 _Zlrrr 阅读(146) 评论(0) 推荐(0)

2018年10月30日

POJ 3734 Blocks

摘要： http://poj.org/problem?id=3734 Description Panda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he s 阅读全文

posted @ 2018-10-30 20:10 _Zlrrr 阅读(244) 评论(0) 推荐(0)

POJ 3268 D-Silver Cow Party

摘要： http://poj.org/problem?id=3268 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party 阅读全文

posted @ 2018-10-30 20:07 _Zlrrr 阅读(245) 评论(0) 推荐(0)

POJ 2253 Frogger

摘要： http://poj.org/problem?id=2253 Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on 阅读全文

posted @ 2018-10-30 20:05 _Zlrrr 阅读(174) 评论(0) 推荐(0)

矩阵快速幂 -- 斐波那契数列

摘要： #include using namespace std; const int mod = 1e9 + 7; int N; struct Matrix{ long long m[2][2]; }; Matrix Mul(Matrix A, Matrix B) { Matrix ret; for(int i = 0; i < 2; i ++) { f... 阅读全文

posted @ 2018-10-30 14:22 _Zlrrr 阅读(238) 评论(0) 推荐(0)

2018年10月29日

HDU 2217 Visit

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2217 Problem Description Wangye is interested in traveling. One day, he want to make a visit to somedifferen 阅读全文

posted @ 2018-10-29 20:42 _Zlrrr 阅读(210) 评论(0) 推荐(0)

丧心病狂工科女

公告