結果
問題 | No.2784 繰り上がりなし十進和 |
ユーザー |
👑 |
提出日時 | 2024-06-14 21:47:03 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,812 ms / 2,000 ms |
コード長 | 3,053 bytes |
コンパイル時間 | 16,610 ms |
コンパイル使用メモリ | 328,096 KB |
最終ジャッジ日時 | 2025-02-21 21:51:26 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 36 |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} struct Number{ vector<int> a; Number(string s = "000000"){ a.resize(6); rep(i, 6) a[i] = s[i] - '0'; } Number operator*(int c) const { Number res; rep(i, 6) res.a[i] = (a[i] * c) % 10; return res; } Number operator+(Number right) const { Number res; rep(i, 6) res.a[i] = (a[i] + right.a[i]) % 10; return res; } }; int main(){ vector<Number> s; rep(i, 6){ string t; cin >> t; Number number(t); s.push_back(t); } set<vector<int>> se; vector<int> var(6); for(var[0] = 0; var[0] < 10; var[0]++){ for(var[1] = 0; var[1] < 10; var[1]++){ for(var[2] = 0; var[2] < 10; var[2]++){ for(var[3] = 0; var[3] < 10; var[3]++){ for(var[4] = 0; var[4] < 10; var[4]++){ for(var[5] = 0; var[5] < 10; var[5]++){ Number res; rep(i, 6){ res = res + s[i] * var[i]; } se.insert(res.a); } } } } } } cout << se.size() << "\n"; return 0; }