Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.HashMap;
- import java.util.Map;
- import java.lang.Thread;
- public class Solution1{
- private static volatile int x = 0, y = 0, r1 = 0, r2 = 0;
- public static void main(String[] args) {
- int i = 0;
- int cnt = 100;
- HashMap<String, Integer> m = new HashMap<String, Integer>();
- while (i < cnt){
- x = 0; y = 0; r1 = 0; r2 = 0;
- Thread t1 = new Thread(() -> {
- x = 1;
- r1 = y;
- });
- Thread t2 = new Thread(() -> {
- y = 1;
- r2 = x;
- });
- t2.start();
- t1.start();
- i++;
- if (r1 == 0 && r2 == 0) {
- m.merge("00", 1, Integer::sum);
- } else if (r1 == 0 && r2 == 1) {
- m.merge("01", 1, Integer::sum);
- } else if (r1 == 1 && r2 == 0) {
- m.merge("10", 1, Integer::sum);
- } else if (r1 == 1 && r2 == 1) {
- m.merge("11", 1, Integer::sum);
- }
- System.out.println(!(r1 == 0 && r2 == 0));
- }
- for (Map.Entry<String, Integer> entry : m.entrySet()) {
- System.out.println(entry.getKey()+" : "+entry.getValue() + " " + !(r1 == 0 && r2 == 0));
- }
- }
- }
- /*
- res1:
- true
- false
- false
- false
- false
- true
- false
- false
- false
- true
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- true
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- true
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- 11 : 1 true
- 00 : 96 true
- 10 : 3 true
- true
- false
- true
- false
- false
- true
- false
- false
- false
- false
- false
- true
- true
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- false
- 00 : 96 false
- 01 : 1 false
- 10 : 3 false
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement