How many ones u write between 1 to 100?

Answer 1

21?
1 = 1
10 = 1
11 = 2
12 = 1
13 = 1
14 = 1
15 = 1
16 = 1
17 = 1
18 = 1
19 = 1
21, 31, 41, 51, 61, 71, 81, 91, 100 = 9

Answer 2

19 (11 HAS 2)
10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 31, 41, 51, 61, 71, 81, 91

BETWEEN 1 & 100 or FROM 1 to 100?

Answer 3

1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 31, 41, 51, 61, 71, 81, 91, 100....

So I guess that would make it: 20

Oh wait... 21. Because of 11.

Answer 4

Well let's see there's
1
10
11-19
21, 31, 41, 51, 61, 71, 81, 91, 100

So that makes: 20
wait, 21... two 1's in 11

Answer 5

21 times

1
10
11 (there are two 1s here)
12
13
14
15
16
17
18
19
21
31
41
51
61
71
81
91
100

unless you dont count 1 and 100 in which case the answer would be 19 times

Answer 6

i will provide you some psuedocode to help you start up up off. Create an array(we could call it a) with one hundred and one components so the indicies pass from 0-a hundred. whilst a style, n, is inputted, upload one to the nth index of your array. So if the enter type replaced into 8e296a67a37563370ded05f5a3bf3ec8e296a67a37563370ded05f5a3bf3ec. a[8e296a67a37563370ded05f5a3bf3ec8e296a67a37563370ded05f5a3bf3ec] could incorporate the type one million. So in fact, the index type is the type that replaced into inputted and the fee interior the array at that index is the style of instances that type has occurred. then you basically prefer a loop that is going over the array and prints out the style of instances a style has occurred.

Answer 7

21 ones, starting from 1:
1
11-19
21
31
41
51
61
71
81
91
100

Answer 8

19!

Answer 9

14 i think

Answer 10

1,10 10-19
21,31,41,51,61,71,81,91,100.

i thing there are 21

11 has two ones