我该如何解决这个逻辑问题? [英] How do I solve this logical question ?

查看:76
本文介绍了我该如何解决这个逻辑问题?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

所以我有一个任务,有8种颜色,我需要找到第9个

这些是颜色的十六进制代码

1)#AA0099? #009966 =#AA99FF

2)#339900? #990066 =#AA9966

3)#006699? #EF4321 =#??????

我需要采取哪些措施来获取最后的颜色以及为什么?



< b>我尝试了什么:



我似乎无法解决问题我已尝试添加它们但无法得到它,不知道我做错了还是不一样请帮助

so i have a task there are 8 colors given and i need to find 9th one
these are the hex codes for colors
1) #AA0099 ? #009966 = #AA99FF
2) #339900 ? #990066 = #AA9966
3) #006699 ? #EF4321 = #??????
what actions do i have to do to get the last color and why ?

What I have tried:

I can't seem to solve the problem I've tried adding them up but couldn't get it, don't know if I'm doing it wrong or its the different thing please help

推荐答案

也许你可以用这个仔细检查你的计算?

十六进制到十进制转换器 [ ^ ]
Maybe you can just double check your calculations with this?
Hexadecimal to Decimal Converter[^]


你应该检查二元运算符和,或,xor和not。一旦你弄清楚哪个算子适用于前两个答案,就很容易弄清楚第三个问题的答案是什么。
You should review the binary operators "and", "or", "xor", and "not". Once you figure out what operator applies to the first two answers, it's easy to figure out what the answer to the third problem is.


你要将十六进制转换为二进制

You are to convert the hex to binary
  #AA0099   1010 1010 0000 0000 1001 1001
? #009966   0000 0000 1001 1001 0110 0110
  =======   =============================
= #AA99FF   1010 1010 1001 1001 1111 1111



并确定使用了哪种操作。在这个例子中,或者也可以适合,+太......

对第二个例子做同样的事情。


and figure out which operation is used. In this example, or can fit, + too ...
Do the same with second example.


这篇关于我该如何解决这个逻辑问题?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆