Subscription pricing
TWO QUESTIONS TO ASK! Thank you in advance!
/N->P
/O->P
/K->P
/N->J
/O->J
.
.
.
.
.
0
PT Questions
TWO QUESTIONS TO ASK! Thank you in advance!
/N->P
/O->P
/K->P
/N->J
/O->J
.
.
.
.
.
6 comments
@saberhossinei210 said:
I'd probably do J/O* to remind me that O in is N in
*! Another great way! Thank you!!! :)
@akikookmt881 said:
@donamhyun690 said:
@akikookmt881 said:
@donamhyun690 said:
TWO QUESTIONS TO ASK! Thank you in advance!
Let's say I want to find all "OR pairs" within /N->/O->J->/K->P. Is the following list a complete "OR pairs":
/N->P
/O->P
/K->P
/N->J
/O->J
I think this is ok.
If we are given /N->/O->J in IN/OUT game,is it okay to represent this as N/O/J in one slot of IN group?
I think you shouldn't represent it that way.
N/O/J looks like if N is in the IN group, O and J are free to go anywhere. But it isn't the case here.
If /A->B, we would represent that as A/B in IN group though... Right?
Then @akikookmt881, how would you represent it? N/O and O/J in IN group??
(Thank you always!)
For /N->/O->J, I would just represent O/J in the IN slot and write O --> N closer to it. You can't write "N/O and O/J in IN group" because N and O don't have OR relationship.
Even if they do (if the rule said /N --> O, /O --> J), I would represent only O/J in the IN slot because if you write N/O and O/J, they take up two slots, and you may miss the case where O is in and N and J are out.
Your way sounds superb. Thank you!
I'd probably do J/O* to remind me that O in is N in
@donamhyun690 said:
@akikookmt881 said:
@donamhyun690 said:
TWO QUESTIONS TO ASK! Thank you in advance!
Let's say I want to find all "OR pairs" within /N->/O->J->/K->P. Is the following list a complete "OR pairs":
/N->P
/O->P
/K->P
/N->J
/O->J
I think this is ok.
If we are given /N->/O->J in IN/OUT game,is it okay to represent this as N/O/J in one slot of IN group?
I think you shouldn't represent it that way.
N/O/J looks like if N is in the IN group, O and J are free to go anywhere. But it isn't the case here.
If /A->B, we would represent that as A/B in IN group though... Right?
Then @akikookmt881, how would you represent it? N/O and O/J in IN group??
(Thank you always!)
For /N->/O->J, I would just represent O/J in the IN slot and write O --> N closer to it. You can't write "N/O and O/J in IN group" because N and O don't have OR relationship.
Even if they do (if the rule said /N --> O, /O --> J), I would represent only O/J in the IN slot because if you write N/O and O/J, they take up two slots, and you may miss the case where O is in and N and J are out.
@akikookmt881 said:
@donamhyun690 said:
TWO QUESTIONS TO ASK! Thank you in advance!
Let's say I want to find all "OR pairs" within /N->/O->J->/K->P. Is the following list a complete "OR pairs":
/N->P
/O->P
/K->P
/N->J
/O->J
I think this is ok.
If we are given /N->/O->J in IN/OUT game,is it okay to represent this as N/O/J in one slot of IN group?
I think you shouldn't represent it that way.
N/O/J looks like if N is in the IN group, O and J are free to go anywhere. But it isn't the case here.
If /A->B, we would represent that as A/B in IN group though... Right?
Then @akikookmt881, how would you represent it? N/O and O/J in IN group??
(Thank you always!)
@donamhyun690 said:
TWO QUESTIONS TO ASK! Thank you in advance!
Let's say I want to find all "OR pairs" within /N->/O->J->/K->P. Is the following list a complete "OR pairs":
/N->P
/O->P
/K->P
/N->J
/O->J
I think this is ok.
If we are given /N->/O->J in IN/OUT game,is it okay to represent this as N/O/J in one slot of IN group?
I think you shouldn't represent it that way.
N/O/J looks like if N is in the IN group, O and J are free to go anywhere. But it isn't the case here.