Submission #7053919
Source Code Expand
#include <bits/stdc++.h> #define SORT(a) sort(a.begin(), a.end()) #define RSORT(a) sort(a.rbegin(), a.rend()) #define REP(i, n) for (int i = 0; i < n; i++) #define RREP(i, n) for (int i = n - 1; 0 <= i; i--) #define FOR(i, start, end) for (int i = start; i < end; i++) #define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--) #define ALL(a) a.begin(), a.end() using ll = long long; using namespace std; const int INF32 = 1'050'000'000; const long long INF64 = 4'000'000'000'000'000'000; const int MOD7 = 1'000'000'007; const int MOD9 = 1'000'000'009; template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } void print() { std::cout << '\n'; } template <class H, class... T> void print(H &&head, T &&... args) { std::cout << head; sizeof...(args) == 0 ? std::cout << "" : std::cout << ' '; print(std::forward<T>(args)...); } template <class T> void print(std::vector<T> &v) { for (int i = 0; i < v.size(); i++) { std::cout << v[i]; i == v.size() - 1 ? std::cout << '\n' : std::cout << ' '; } } template <class T> void print(std::vector<std::vector<T>> &v) { for (int i = 0; i < v.size(); i++) { for (int j = 0; j < v[i].size(); j++) { std::cout << v[i][j]; j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' '; } } } int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; int diff = 2025 - N; FOR(i, 1, 10) { FOR(j, 1, 10) { int x = i * j; if (x == diff) print(i, "x", j); } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 九九足し算 |
User | kobyn |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1880 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 |