第一次刷SGU,当然,实力还差的很远,毕竟这个是给OIer省选用的,没事和pyj来一起艹。。。感觉自己还是有很多要学的
101,A+B,,,,Duang~
105
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<=N<=231 - 1).
Output
Write answer to the output.
Sample Input
4
Sample Output
2
解题思路:
这道题还蛮有点意思,感觉会拿while去跑每一位,但是没这么做,感觉这样做就是多余的,只要从1,12,123,1234,12345,123456,统计出这些数字对于mod3的结果,
为100100,,,,所以规律就出来了,
cin>>n;
long long ans = 0;
if ( n%3==0 )
{
ans = n/3*2;
}
else
{
ans = n/3*2+n%3-1;
}
cout<<ans<<endl;