题目链接点这儿
题目不长。。。我顺便放过来了。。。(其实是自己概括题意太麻烦了。。。
105. Div 3 time limit per test: 0.25 sec. 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 4 Sample Output 2 |
所以第i个数能否被3整除,就是判断i*(i+1)/2能否被3整除,要么是i能被3整除,要么是i+1能被3整除。
统计个数的话,也就很容易了
下面放代码。。。
#include <bits/stdc++.h>
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)>(b)?(b):(a))
#define rep(i,initial_n,end_n) for(int (i)=(initial_n);(i)<(end_n);i++)
#define repp(i,initial_n,end_n) for(int (i)=(initial_n);(i)<=(end_n);(i)++)
#define reep(i,initial_n,end_n) for((i)=(initial_n);(i)<(end_n);i++)
#define reepp(i,initial_n,end_n) for((i)=(initial_n);(i)<=(end_n);(i)++)
#define eps 1.0e-9
#define MAX_N 1010
using namespace std;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef __int64 ll;
typedef unsigned __int64 ull;
int main() {
int n;
scanf("%d", &n);
int ans = n / 3 * 2;
if(n%3 == 2) ans++;
printf("%d\n", ans);
return 0;
}