Submission #4032079
Source Code Expand
//$g++ -std=c++11 Template.cpp
//#include <bits/stdc++.h>
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <iomanip>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define ROF(i, j, k) for(int i = (int)(j); i >= (int)(k); --i)
#define FORLL(i, n, m) for(long long i = n; i < (long long)(m); i++)
#define SORT(v, n) sort(v, v+n)
#define REVERSE(v) reverse((v).begin(), (v).end())
using namespace std;
using ll = long long;
const ll MOD=1000000007LL;
typedef pair<int, int> P;
ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
priority_queue<int> q_descending;
priority_queue<int, vector<int>, greater<int> > q_ascending;
int kuku[11][11];
int
main(void){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
n = 2025 - n;
FOR(i, 1, 10) FOR(j, 1, 10) {kuku[i][j] = i*j; kuku[j][i] = i*j;}
//FOR(i, 1, 10) {FOR(j, 1, 10) {cout << kuku[i][j] << " ";} cout << endl;}
FOR(i, 1, 10) FOR(j, 1, 10) if(n == kuku[i][j]) cout << i << " x " << j << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 九九足し算 |
User |
motacapla |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1684 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 |