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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
/*⚠️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?*/
namespace SoloLearn
{
class Program
{
static void Main(string[] args)
{
int odious = 0;
for (int i=0;i<10000;i++){
int n = 0;
//Converting to binary
string binary = Convert.ToString(i,2);
foreach (char c in binary ){
//Counting "1"
if(c.Equals('1')){
n++;
}
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run