问题 B: Divisible by 3 规律题
来源:互联网 发布:oracle的级联sql语句 编辑:程序博客网 时间:2024/03/29 20:41
问题 B: Divisible by 3时间限制: 1 Sec 内存限制: 128 MB提交: 291 解决: 86[提交][状态][讨论版]题目描述Let's consider a sequence 1, 12, 123, 1234, 12345, 123456, 1234567, 12345678, 123456789, 12345678910, 1234567891011, ....Write a program that determines how many elements of this sequence among first n are divisible by three.输入One positive integer n (1 ≤ n ≤ 231 - 1).输出You need to print one number you've found.样例输入4样例输出2提示
来源: http://125.221.232.253/JudgeOnline/problem.php?cid=1204&pid=1
/*规律: f(n)%3=[(f(n-1)%3)*10+n%3]%3而数字是以3K+1 3K+2 3(K+1)循环出现的3K+1=1(mod 3)那么 对于下一个序列数就有 1*10+3K+2 = 0(mod 3)最后一个 0*10+3(K+1) = 0(mod 3)所以循环节 1 0 0N个数里一共有N/3组和N%3个余项*/#include <cstdio>int main(void){ int N; while(~scanf("%d",&N)) printf("%d\n",(N/3)*2+(N%3?N%3-1:0)); return 0;}
0 0
- 问题 B: Divisible by 3 规律题
- 问题 B: Divisible by 3
- Divisible by Seven
- C. Divisible by Seven
- Divisible by Seven CodeForces
- 问题 B: Divisible 【模运算】【HPU第一次积分赛】
- Codeforces Round #221 (Div. 2) B. I.O.U. C. Divisible by Seven D. Maximum Submatrix 2 解题报告
- 【LightOJ】1136 - Division by 3(规律)
- lightoj(1136 - Division by 3 )规律
- CodeForces 374A. Divisible by Seven
- CodeForces 375A Divisible By Seven
- codeforce 221 Div2 C - Divisible by Seven
- CF-375A Divisible by Seven
- Code forces 376 C Divisible by Seven
- CodeForces 375A Divisible by Seven
- CodeForces 375A Divisible by Seven
- 【HPUOJ】积分赛(一)B:Divisible
- Codeforces 480B Long Jumps 规律题
- SELECT * FROM `magazine` WHERE CONCAT(`title`,`tag`,`description`) LIKE ‘%关键字%’
- 问题 A: 相约HNUST
- android Fragment 使用
- unity引用dll文件方法
- Android Fragment继承问题的分析
- 问题 B: Divisible by 3 规律题
- 第1章 JAX-RS 2.0 入门
- 数据库的查询
- 转载卓越的教练是如何训练高手的
- 第十五周(1)-阅读程序
- js Class 化
- 最长连续相异子序列 STL.MAP + DP
- 修改应用程序的图标
- 基于selenium的portal自动化认证