Daniel wants to get a 100-day streak on Brilliant.org. He plans to do so in the following manner:
On the first day, he does 1 problem. On the second day, he does 2 problems. On the third day, he does 3 problems. This pattern continues on until the 1 0 th day. On the 1 0 th day, he does 1 + 0 = 1 problem. On the 1 1 th day, he does 1 + 1 = 2 problems. In general, on the a b th day, he does a + b problems. Finally, on the 1 0 0 th day, he does 1 + 0 + 0 = 1 problem, completing his streak.
In total, how many problems did he do?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I thought, for example, in the 47th day you do 4+7=12, 1+2=3 problems. Apparently not =\
Log in to reply
The same at first!
4+7=11 actually :D I did the same mistake too
I think it would have been really funny if this was submitted this after you had solved 901 problems. Cool problem nonetheless!
Oh for second step did mistake
We borrow the old Gauss trick: if you sum the number of problems solved in day x and in day 9 9 − x , when x ranges from 1 to 4 9 , you get 1 8 . So the total number of solved problems is just 5 0 ⋅ 1 8 + 1 = 9 0 1 .
jack if u could elaborate on the gauss trick that would be helpful since i don't knw what that is
Nice trick!
Wow, very clever! I didn't think of that.
Log in to reply
Cool problem. Don't you think that the guy in the cartoon picture at the top of the problem looks just like Daniel Chiu? It's startlingly similar.
very clever!
Hello all,for total number of problems from days [1,100],
as for
[1-10] = 1+2+3+4+5+6+7+8+9+(1+0) = 46
[11-20] = 2+3+4+5+6+7+8+9+10+(2+0) = 56
[21-30] = 3+4+5+6+7+8+9+10+11+(3+0) = 66
[31-40] = 4+5+6+7+8+9+10+11+12+(4+0) = 76
[41-50] = 5+6+7+8+9+10+11+12+13+(5+0) = 86
[51-60] = 6+7+8+9+10+11+12+13+14+(6+0) = 96
[61-70] = 7+8+9+10+11+12+13+14+15+(7+0) = 106
[71-80] = 8+9+10+11+12+13+14+15+16+(8+0) = 116
[81-90] = 9+10+11+12+13+14+15+16+17+(9+0)= 126
[91-100] = 10+11+12+13+14+15+16+17+18+(1+0+0)=127
Since already calculated to 100 days, therefore total problems = 46+56+66+76+86+96+106+116+126+127 = 901
thanks....
There's an easier way to do this
Log in to reply
yes bro,i'm just go on with long ones,hehe....wating time....
The same as mine
i solved it almost the same way 1-91=55 2-92=65 3-93=75 . . 9-99=135 10-100=46
total=901
same as mine
WE first take the sum of the digits in the unit's place of all the numbers,the result will be ( 1 + 2 + . . . . . . + 9 ) ∗ 1 0 = 4 5 0 .
Now we take the sum of the digits along the tens place and the sum will be = 1 0 ∗ 0 + 1 0 ∗ 2 + 1 0 ∗ 3 + . . . . . . 1 0 ∗ 9 = 4 5 0 .
Clearly the only number at the hundredth place is 1 .
So the sum of all the digits is 4 5 0 + 4 5 0 + 1 = 9 0 1 .
very easy, the problem can be made simpler by adding all digits from 1to 99 i.e all 1's + 2's +...+9's so all nos comes 20 times hence sum of digit of 1-99 is=20(1+2+3+...+9)=20(45)=900 and then add fo 100 so answer is 900+1=901
I pretty much just bashed it out. The first one through nine produces forty-five. From there, the eleven through twenty produces fifty-five. Each subsequent group produces ten more than the last. Thus, their total is 4 5 + 5 5 + 6 5 . . . + 1 3 5 ⟹ 9 0 0 . But then you have to add one to account for the one-hundred. Thus, the desired answer is 9 0 1 .
sum=0
for i in range(101):
while i>0:
temp=int(i)%10
print(i)
sum+=temp
print(i,temp,sum)
i/=10
print(sum)
46 (sum of digits in 1 to 10). This will keep increasing by 10. 46+56+66+.... + 126 + 126 + 1 = 901
I solved it using C: int main( ) { int j,i=0,sum=0,k,bSum=0;
for(j=0;j<=9;j++)
{
for(k=0;k<=9;k++)
{
sum=k+i;
bSum+=sum;
}
i++;
}
printf("%d",bSum);
} This provides the sum from 1 to 99, then you add 1 to that to obtain the final result.
Problem Loading...
Note Loading...
Set Loading...
The sum of digits at the unit place from 1 to 100 will be 1 0 × 2 9 × ( 9 + 1 ) = 4 5 0 as the digits in the unit place (i.e., 0 to 9) repeat 10 times.
The sum of digits at tens place will be ( 1 0 × 0 ) + ( 1 0 × 1 ) + … + ( 1 0 × 9 )
= 1 0 × 2 9 × ( 9 + 1 ) = 4 5 0 .
The only number in the hundreds place is 1.So the total no. of problems solved = 450 + 450 + 1 = 9 0 1