894B - Ralph And His Magic Field - CodeForces Solution


combinatorics constructive algorithms math number theory *1800

Please click on ads to support us..

Python Code:

mod = 10**9 + 7

def solve():
    n, m, k = map(int, input().split())



    if k == -1:
        if n % 2 == 1 and m % 2 == 0:
            print(0)
            return
        elif n % 2 == 0 and m % 2 == 1:
            print(0)
            return
    
    x = (n - 1) * (m - 1)
    print(pow(2, x, mod))

solve()


Comments

Submit
0 Comments
More Questions

165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts