SGU105【找规律】

飘摇的尘土

于 2016-05-17 14:48:07 发布

阅读量525

点赞数

分类专栏：数学文章标签： SGU105

本文链接：https://blog.csdn.net/R1986799047/article/details/51436022

版权

数学专栏收录该内容

111 篇文章 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<=2³¹ - 1).

Output

Write answer to the output.

Sample Input

Sample Output

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
int main()
{
	long long n,ans,i;
	while(scanf("%I64d",&n)!=EOF){
		//2 3 5 6 8 9
		if(n%3==0){
			printf("%lld\n",(n/3)*2);
		}
		else {
			long long temp=0;
			for(i=n+1;true;++i){
				if((i*(i+1)/2)%3==0)temp++;
				if(i%3==0)break;
			}
			printf("%lld\n",(i/3)*2-temp);
		}
	}
	return 0;
}