usaco Combination Lock
来源:互联网 发布:一键获取淘宝联盟 编辑:程序博客网 时间:2024/05/16 08:21
w我不知道咋回事思路不清晰这题前面不知道在写什么。没什么好说的枚举就行了。
/*ID: jinbo wuLANG: C++TASK: combo*/#include<bits/stdc++.h>using namespace std;int a[2][3];int n;bool judge(int f,int c,int i){if(min((i-a[f][c]+n)%n,(a[f][c]-i+n)%n)<3)return true;if(min((i-a[f][c]+n)%n,(a[f][c]-i+n)%n)<3)return true;if(min((i-a[f][c]+n)%n,(a[f][c]-i+n)%n)<3)return true;return false;} int main(){int cnt=0;int flag=0;freopen("combo.in","r",stdin);freopen("combo.out","w",stdout);scanf("%d",&n);scanf("%d %d %d",&a[0][0],&a[0][1],&a[0][2]);scanf("%d %d %d",&a[1][0],&a[1][1],&a[1][2]);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int k=1;k<=n;k++){if(judge(0,0,i)&&judge(0,1,j)&&judge(0,2,k)){cnt++;flag=1;} if(judge(1,0,i)&&judge(1,1,j)&&judge(1,2,k)&&!flag){cnt++;}flag=0;}printf("%d\n",cnt);}
0 0
- USACO 1.3 Combination Lock
- USACO Combination Lock
- USACO Combination Lock
- USACO 1.3 Combination Lock
- USACO 1.3 Combination Lock
- USACO-1.3:Combination Lock
- USACO 1.3-Combination Lock
- USACO Combination Lock
- usaco Combination Lock
- USACO 1.3 Combination Lock
- USACO 1.4 Combination Lock
- USACO Combination Lock 解题报告
- USACO Section 1.3 Combination Lock
- USACO Section 1.3 Combination Lock
- USACO 1.3.4 Combination Lock
- USACO Combination Lock 解题日志
- USACO-Section1.2 Combination Lock
- USACO-Section 1.3 Combination Lock[...]
- LeetCode -- Range Sum Query - Immutable
- jenkins+tomcat配置(初学,有错误,还请指正)
- Hibernate中使用 Serializable id
- Python selenium 三种等待方式详解(必会)
- python SQLite3 插入数据问题
- usaco Combination Lock
- 换硬币问题
- python学习笔记 filter和sorted
- 数据库(3):MySQL优化GROUP BY-松散索引扫描与紧凑索引扫描
- leet code - Third Maximum Number
- hdu 2065 指数型生成函数
- html5笔记之classList
- [整理]VC编译程序时出现the source files are both configured to produce the output file....
- codeforces732E Sockets(贪心)