CS
cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/*
⚠️Challenge: how many odious numbers smaller than 10.000 can you find⚠️
odious numbers are non-negative numbers that have an odd number of ones in the binary expansion
# 21 = 10101 = 3
# 50 = 110010 = 3
Challenge: how many odious numbers smaller than 10.000 can you find?
*/
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace SoloLearn
{
class Program
{
static bool isOdious(uint t)
{
//uint count = 0;
bool odd = false;
while (t > 0)
{
if ((t & 1) == 1)
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run