Submission #7074896
Source Code Expand
#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
os << "(";
os << p.first << ", " << p.second;
return os << ")";
}
template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
os << "[";
if (v.size() == 0) return os << "]";
for (int i = 0; i < v.size() - 1; i++) {
os << v.at(i) << ", ";
}
return os << v.at(v.size() - 1) << "]";
}
template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
os << "{";
if (s.begin() == s.end()) return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
os << "{";
if (s.begin() == s.end()) return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
os << "{";
if (m.begin() == m.end()) return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
os << "{";
if (m.begin() == m.end()) return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
lint pow(lint num, lint e, lint MOD) {
lint res = 1;
lint cur_num = num;
while (e) {
if (e & 1) {
res *= cur_num;
res %= MOD;
}
cur_num *= cur_num;
cur_num %= MOD;
e >>= 1;
}
return res;
}
int main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
lint N;
cin >> N;
lint kuku_sum = 0;
range(i, 1, 10) range(j, 1, 10) kuku_sum += i * j;
lint diff = kuku_sum - N;
// cout << diff << "\n";
set<plint> possible_pairs;
range(i, 1, 10) {
if (diff % i == 0 && diff / i <= 9) possible_pairs.emplace(i, diff / i);
}
for (const auto& p : possible_pairs) {
cout << p.first << " x " << p.second << "\n";
}
}
Submission Info
Submission Time |
|
Task |
C - 九九足し算 |
User |
tmsausa |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3109 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, test_1953.txt, test_1971.txt, test_1977.txt, test_1983.txt, test_1989.txt, test_1990.txt, test_1993.txt, test_1995.txt, test_1997.txt, test_1998.txt, test_2001.txt, test_2009.txt, test_2013.txt, test_2017.txt, test_2019.txt, test_2020.txt, test_2022.txt, test_2024.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
test_1953.txt |
AC |
1 ms |
256 KB |
test_1971.txt |
AC |
1 ms |
256 KB |
test_1977.txt |
AC |
1 ms |
256 KB |
test_1983.txt |
AC |
1 ms |
256 KB |
test_1989.txt |
AC |
1 ms |
256 KB |
test_1990.txt |
AC |
1 ms |
256 KB |
test_1993.txt |
AC |
1 ms |
256 KB |
test_1995.txt |
AC |
1 ms |
256 KB |
test_1997.txt |
AC |
1 ms |
256 KB |
test_1998.txt |
AC |
1 ms |
256 KB |
test_2001.txt |
AC |
1 ms |
256 KB |
test_2009.txt |
AC |
1 ms |
256 KB |
test_2013.txt |
AC |
1 ms |
256 KB |
test_2017.txt |
AC |
1 ms |
256 KB |
test_2019.txt |
AC |
1 ms |
256 KB |
test_2020.txt |
AC |
1 ms |
256 KB |
test_2022.txt |
AC |
1 ms |
256 KB |
test_2024.txt |
AC |
1 ms |
256 KB |