4 solutions
-
1
#include<bits/stdc++.h> using namespace std; int main() { int n,a,b; // a = 行,b = 列。先输入行,在输入列。 cin>>n>>a>>b; for(int i = 1;i <= n;i++) { cout<<"("<<a<<","<<i<<") "; } cout<<endl; for(int i = 1;i <= n;i++) { cout<<"("<<i<<","<<b<<") "; } cout<<endl; for(int i = 1;i <= n;i++) { for(int j = 1;j <= n;j++) { if(i - j == a - b) { cout<<"("<<i<<","<<j<<") "; } } } cout<<endl; for(int i = n;i >= 1;i--) { for(int j = 1;j <= n;j++) { if(i + j == a + b) { cout<<"("<<i<<","<<j<<") "; } } } return 0; }
-
1
#include<bits/stdc++.h> using namespace std; int main() { int n,a,b; cin>>n>>a>>b; for(int i=1;i<=n;i++){ cout<<"("<<a<<","<<i<<")"; } cout<<endl; for(int i=1;i<=n;i++){ cout<<"("<<i<<","<<b<<")"; } cout<<endl; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i-j==a-b){ cout<<"("<<i<<","<<j<<")"; } } } cout<<endl; for(int i=n;i>=1;i--){ for(int j=1;j<=n;j++){ if(i+j==a+b){ cout<<"("<<i<<","<<j<<")"; } } } return 0; }
-
0
#include<bits/stdc++.h> using namespace std; int main() { int n,a,b; cin>>n>>a>>b; for(int i=1;i<=n;i++) { cout<<"("<<a<<","<<i<<") "; } cout<<endl; for(int i=1;i<=n;i++) { cout<<"("<<i<<","<<b<<") "; } cout<<endl; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i-ja-b) { cout<<"("<<i<<","<<j<<") "; } } } cout<<endl; for(int i=n;i>=1;i--) { for(int j=1;j<=n;j++) { if(i+ja+b) { cout<<"("<<i<<","<<j<<") "; } } }
return 0;
}$$
-
0
#include<bits/stdc++.h> using namespace std; int main() { int n,a,b; cin>>n>>a>>b; for(int i=1;i<=n;i++) { cout<<"("<<a<<","<<i<<") "; } cout<<endl; for(int i=1;i<=n;i++) { cout<<"("<<i<<","<<b<<") "; } cout<<endl; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i-j==a-b) { cout<<"("<<i<<","<<j<<") "; } } } cout<<endl; for(int i=n;i>=1;i--) { for(int j=1;j<=n;j++) { if(i+j==a+b) { cout<<"("<<i<<","<<j<<") "; } } } return 0; }
- 1
Information
- ID
- 902
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 1
- Tags
- (None)
- # Submissions
- 198
- Accepted
- 37
- Uploaded By