1 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=5; int H[N],w[N]; int main() { for(int i=1;i<=3;i++) cin>>H[i]; //获取每行的值 for(int i=1;i<=3;i++) cin>>w[i]; //获取每列的值 int ans=0; /* abc def ghi */ for(int a=1;a<=30;a++) { for(int b=1;b<=30;b++) { for(int d=1;d<=30;d++) { for(int e=1;e<=30;e++) { int c=H[1]-a-b; int f=H[2]-d-e; int g=w[1]-a-d,h=w[2]-b-e,i=w[3]-c-f; if(min({c,f,g,h,i})>0&&g+h+i==H[3]) { ans++; } } } } } cout<<ans; return 0; }
Information
- ID
- 2466
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 6
- Accepted
- 2
- Uploaded By