sgu 105. Div 3 找规律

最新推荐文章于 2024-03-13 20:29:07 发布

superkunn

最新推荐文章于 2024-03-13 20:29:07 发布

阅读量188

点赞数

分类专栏：水-------------------- sgu !!!!!!!!!!

本文链接：https://blog.csdn.net/superkunn/article/details/80135326

版权

sgu !!!!!!!!!! 同时被 2 个专栏收录

50 篇文章 0 订阅

订阅专栏

水--------------------

24 篇文章 0 订阅

订阅专栏

105. Div 3

time limit per test: 0.25 sec.
memory limit per test: 4096 KB

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<=N<=231 - 1).

Output

Write answer to the output.

Sample Input

Sample Output

#include <bits/stdc++.h>

using namespace std;

void solve(){
    int n;
    scanf("%d",&n);
    printf("%d",n/3*2+(n%3==2));
}

int main(){
    solve();
    return 0;
}