Oenheng的博客

Trailing Zeroes (III) Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1138 uDebug Description You task is to find minimal natu

时间限制: 1 Sec  内存限制: 128 MB 提交: 63  解决: 20 [提交][状态][讨论版] 题目描述 QAQ有一个区间[L, R]。已知QAQ很喜欢长度为奇数的区间，现在请你告诉他有多少个长度为奇数的子区间。 对于区间[2 4]来讲，它的子区间有[2 2] [2 3] [2 4] [3 3] [3 4] [4 4]共6个。 为了简化题目，QAQ所给的区间里面全是非负整

F 圆周率用acos(-1.0) 使用longlong Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1331 uDebug Description Agent J is preparing to st

D 圆周率用acos(-1.0) 使用longlong Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1136 uDebug Description There is sequence 1, 12, 1

H 圆周率用acos(-1.0) 使用longlong Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1109 uDebug Description We define b is a Divisor o

E 圆周率用acos(-1.0) 使用longlong Time Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1225 uDebug Description A palindromic number or num

B 圆周率用acos(-1.0) 使用longlong Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1305 uDebug Description A parallelogram is a quadrilateral

圆周率用acos(-1.0) 使用longlong Time Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1182 uDebug Description Given an integer n, first we represen

Description See the picture below. You are given AB, AC and BC. DE is parallel to BC. You are also given the area ratio between ADE and BDEC. You have to find the value of AD. Input Input

Description You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk. Input Input starts with an integer T (≤ 1000), d

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 597A Description Find the number of k-divisible numbers on the segment [a, b]. In ot

Fibsieve`s Fantabulous Birthday Time Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1008 uDebug Description Fibsieve had a fantabulous (yes

Jam's math problem Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 5615 Description Jam has a math problem. He just learned factorization.

Ekka Dokka Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1116 uDebug Description Ekka and his friend Dokka decided to buy a

Positive Negative Sign Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1294 uDebug Description Given two integers: n and m and

时间限制: 1 Sec  内存限制: 128 MB 提交: 56  解决: 34 [提交][状态][讨论版] 题目描述 QAQ有一个整数序列，元素个数有N个，分别为1，2，3 ... N-1，N。 假定用数组a[]来依次记录N个元素，那么区间[i, j]的价值 = sum(i, j) * Check(i, j)。 其中sum(i, j) = a[i] + ... + a[j]，表示区间