USACO 1.3 Combination Lock
2015-09-19 08:55
239 查看
#include<stdio.h> #define GET_ABS(x) ( (x) > 0 ? (x) : -(x) ) int maxNum; int FJCombination[4]; int masterCombination[4]; int settings[4]; int result; int isCloseEnough(int combination[]){ int dial; for (dial = 1; dial <= 3; dial++){ int delta = GET_ABS(settings[dial] - combination[dial]); if (2 < delta && delta < maxNum - 2) return 0; } return 1; } int main(){ scanf("%d", &maxNum); int indexOfNum; for (indexOfNum = 1; indexOfNum <= 3; indexOfNum++) scanf("%d", &FJCombination[indexOfNum]); for (indexOfNum = 1; indexOfNum <= 3; indexOfNum++) scanf("%d", &masterCombination[indexOfNum]); result = 0; for (settings[1] = 1; settings[1] <= maxNum; settings[1]++) for (settings[2] = 1; settings[2] <= maxNum; settings[2]++) for (settings[3] = 1; settings[3] <= maxNum; settings[3]++) if (isCloseEnough(FJCombination) == 1 || isCloseEnough(masterCombination) == 1) result++; printf("%d\n", result); return 0; }
相关文章推荐
- USACO 3.2.2:Stringsobits
- Rust 1.3 发布
- USACO 3.1 Shaping Regions
- 【解题报告】【USACO】酸奶工厂
- usaco-Calf Flac
- usaco/1.1 Your Ride Is Here
- usaco/1.1 Greedy Gift Givers
- usaco/1.1 Friday the Thirteenth
- usaco/ 1.1 Broken Necklace
- USACO/fact4 3.2.1
- USACO/spin 3.2.3
- USACO/rockers 3.4.4 动态规划
- USACO 2.2 Party Lamps
- USACO 2.2 Runaround Numbers
- USACO 2.2 Subset Numbers
- USACO 2.2 Preface Numbering
- USACO 2.1 Ordered Fractions
- USACO 2.1 Hamming Codes
- USACO 2.1 Healthy Holsteins
- USACO 2.1 Sorting A Three-Valued Sequence