Div 3
来源:互联网 发布:js select 设置选中值 编辑:程序博客网 时间:2024/05/14 04:25
Description
There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Now you are given two integers A and B, you have to find the number of integers from Ath number to Bth (inclusive) number, which are divisible by 3.
For example, let A = 3. B = 5. So, the numbers in the sequence are, 123, 1234, 12345. And 123, 12345 are divisible by 3. So, the result is 2.
Input
Input starts with an integer T (≤ 10000), denoting the number of test cases.
Each case contains two integers A and B (1 ≤ A ≤ B < 231) in a line.
Output
For each case, print the case number and the total numbers in the sequence between Ath and Bth which are divisible by 3.
Sample Input
2
3 5
10 110
Sample Output
Case 1: 2
Case 2: 67
思路:打表直接会超时,换种方法做;
打出前十几个数会发现这样的一个规律:0 1 2 2 3 4 4 5 6 6 7 8 8……,这时就需要找规律来优化算法;
可以以3为一个周期,则从0到a[i]被3整除的个数为若a[i]被3整除是a[i]/3*2,否则为a[i]/3*2+a[i]%3-1;
代码:
#include<stdio.h>int f(int x){int a=x/3;if(x%3==0)return a*2;elsereturn a*2+x%3-1; }int main(){int t,a,b,mm=1;scanf("%d",&t);while(t--){scanf("%d%d",&a,&b);int c=f(b)-f(a-1);printf("Case %d: %d\n",mm++,c);}return 0; }
- div 3
- Div 3
- Div 3
- div+css (3)
- div 拖动3(1)
- div 拖动3(2)
- div+css(3)结束
- SGU 105 Div 3
- SGU105 Div 3
- [SGU]105. Div 3
- sgu 105 Div 3
- sgu 105 Div 3
- DIV+CSS练习3
- sgu105:Div 3
- 105. Div 3
- SGU 105 Div 3
- 并列3个div
- SGU 105. Div 3
- ubuntu环境安装caffe
- mac虚拟机无法连接本机mysql
- css中浮动与清除
- java时间比较易错点
- ubuntu安装scipy出现的问题:no lapack/blas resources
- Div 3
- 1.4.4节练习
- 《张志俊揭秘太极拳》读书摘编
- OpenCL异构并行计算编程笔记(1):平台、设备与上下文
- poll机制分析--转韦东山
- 欢迎使用CSDN-markdown编辑器
- 2016 广联达面试题4
- FFmpeg使用流程
- Jam's balance