| SGU - 105 Div 3
Submit Status
Description
There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Given first N elements of that sequence. You must determine amount of numbers in it that are divisible by 3. Input Input contains N (1 Output Write answer to the output. Sample Input Sample Output Source |
数学题！找规律！
规律：0,1,1,0,1,1,0,1,1,0,1,1.... （0代表不能被3整除，1代表能被3整除！）
AC代码：
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <cmath>using namespace std;int main(){ int n; scanf("%d", &n); int ans = 0; ans += (n/3)*2; if(n%3==2) ans++; printf("%d\n", ans); return 0;} 
每个人都需要一台速度更快、更稳定的 PC。随着时间的推移，垃圾文件、旧注册表数据和不必要的后台进程会占用资源并降低性能。幸运的是，许多工具可以让 Windows 保持平稳运行。
Copyright 2014-2025 https://www.php.cn/ All Rights Reserved | php.cn | 湘ICP备2023035733号
844
收藏
