Submission #1585712
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n; cin >> n;
ll sum = 0;
rep(i, 1, 10) rep(j, 1, 10) sum += i * j;
ll result = sum - n;
rep(i, 1, 10) rep(j, 1, 10) {
if (i * j == result) {
cout << i << " x " << j << endl;
}
}
}
Submission Info
Submission Time |
|
Task |
C - 九九足し算 |
User |
drafear |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1562 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 |