ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
1800 | spoj#ADFRUITS Advanced Fruits | 0 / 0 | (None) | |
2972 | spoj#BLOPER2 Operators (new ver) | 0 / 0 | (None) | |
3825 | spoj#FAKEHASH Faketorial Hashing | 0 / 0 | (None) | |
2820 | spoj#GCJ082A Cheating a Boolean Tree | 0 / 0 | (None) | |
3602 | spoj#HOUSEBUY House Buying Optimizations | 0 / 0 | (None) | |
3890 | spoj#KDIV K-Divisors | 0 / 0 | (None) | |
447 | spoj#MKJUMPS Making Jumps | 0 / 0 | (None) | |
2677 | spoj#SPIKES Spiky Mazes | 0 / 0 | (None) | |
3800 | spoj#SUBSUMP Yet Another Subset Sum Problem | 0 / 0 | (None) | |
1079 | spoj#UCI2009D Digger Octaves | 0 / 0 | (None) | |
163 | spoj#VONNY Vonny and her dominos | 0 / 0 | (None) |
By signing up a SAST OJ universal account, you can submit code and join discussions in all online judging services provided by us.