fenychn0206/OI-Codes
1
0
Fork 0
mirror of https://github.com/wczffl-503/OI-Codes.git synced 2025-07-08 02:13:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

d

Browse Source
This commit is contained in:
Fengyi Chen
2024-05-14 22:28:09 +08:00
parent 4d5ff00243
commit 4b8c0c58eb
11 changed files with 298 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
XSM OJ 重庆小码王集团OJ/数字组合.cpp
View File

@ -1,12 +1,23 @@
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
cout <<n<<n<<n<<" "<<n<<n<<n<<" "<<n<<n<<n<<" "<<n<<n<<n<<endl;
cout <<" "<<n<<" "<<n<<" "<<n<<" "<<" "<<n<<" "<<n<<" "<<n<<endl;
cout <<n<<n<<n<<" "<<n<<" "<<n<<" "<<n<<n<<n<<" "<<n<<" "<<n<<endl;
cout <<n<<" "<<" "<<n<<" "<<n<<" "<<n<<" "<<" "<<n<<" "<<n<<endl;
cout <<n<<n<<n<<" "<<n<<n<<n<<" "<<n<<n<<n<<" "<<n<<n<<n<<endl;
return 0;
}
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N; ++j) {
for (int k = 0; k <= N; ++k) {
if (i != j && j != k && i != k && (i * 100 + j * 10 + k) % 2 != 0 && i != 0) {
++count;
}
}
}
}
cout << count << endl;
return 0;
}