結果
問題 | No.722 100×100=1000 |
ユーザー |
![]() |
提出日時 | 2018-08-03 23:12:05 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,062 bytes |
コンパイル時間 | 1,349 ms |
コンパイル使用メモリ | 158,472 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-29 19:22:48 |
合計ジャッジ時間 | 2,258 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 27 |
ソースコード
#include "bits/stdc++.h"//#include <iostream>//#include <vector>//#include <string>using namespace std;#define repi(i,a,b) for(int i=(a), i##_len=(b); i<i##_len; ++i)#define rep(i,n) repi(i,0,n)#define repi_(i,a,b) for(int i=(a), i##_len=(b); i<=i##_len; ++i)#define rep_(i,n) repi_(i,0,n)#define all(x) (x).begin(),(x).end()#define vsort(v) sort((v).begin(), (v).end())#define gsort(v) tsort(v); reverse((v).begin(), (v).end())#define vrev(v) reverse((v).begin(), (v).end())#define siz(v) ((int)(v).size())#define ers(v, n) (v).erase((v).begin() + n)#define cnt(v, n) count(all(v), n)#define vmin(v) *min_element(v.begin(), v.end())#define vmax(v) *max_element(v.begin(), v.end())#define contain(q) !q.empty()#define cont(q) !q.empty()//#define qpop(q, a, b) a=q.back().first;b=q.back().second;q.pop()//#define pqpop(p, a, b) a=q.top().first;b=q.top().second;q.pop()#define el "\n"#define sp " "#define co(x) cout<<(x)<<el#define coc(c, a, b) if(c)co((a));else co((b))#define cosp(x) cout<<(x)<<' '#define YES(c) coc(c,"YES", "NO")#define Yes(c) coc(c,"Yes", "No")#define yes(c) coc(c,"yes", "no")#define POSSIBLE(c) coc(c, "POSSIBLE", "IMPOSSIBLE")#define Possible(c) coc(c, "Possible", "Impossible")#define possible(c) coc(c, "possible", "impossible")#define inf INT_MAX#define pb push_back#define pq priority_queue#define np next_permutation#ifdef tqktmp_2#define gc() getchar(); getchar()#else#define gc() 1#endifconst unsigned int bf0 = (1 << 0);const unsigned int bf1 = (1 << 1);const unsigned int bf2 = (1 << 2);const unsigned int bf3 = (1 << 3);const unsigned int bf4 = (1 << 4);const unsigned int bf5 = (1 << 5);const unsigned int bf6 = (1 << 6);const unsigned int bf7 = (1 << 7);typedef long long lint;typedef vector<int> ivec; typedef vector<string> svec;typedef vector<vector<int>> ivvec;typedef pair<int, int> P;const intdx8[8] = { 0,1,1,1,0,-1,-1,-1 },dy8[8] = { 1,1,0,-1,-1,-1,0,1 },dx4[4] = { 0,1,0,-1 },dy4[4] = { 1,0,-1,0 };template<class T>inline bool maxi(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>inline bool mini(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }#define P3 pair<P, lint>//int main() {// cin.tie(0);// ios::sync_with_stdio(0);//// lint n, x; cin >> n >> x;// ivec a; int in;// rep(i, n) {// cin >> in;// a.pb(in);// }// vsort(a);// lint ans = 0;// rep(i, n) {// repi(j, i, n) {// if (a[j] > x - a[i])break;// if (a[i] + a[j] == x) {// if (i == j)ans--;// ans += 2;// }// }// }// co(ans);// gc();//}int dig(int a) {lint re = 0;while (a / 10) {a /= 10; re++;}if (re < 2)re = 2;return re;}int main() {cin.tie(0);ios::sync_with_stdio(0);lint a, b; cin >> a >> b;bool den[2] = {1,1};if (!(a % (lint)pow(10, dig(a))))den[0] = 0;if (!(b % (lint)pow(10, dig(b))))den[1] = 0;//co(den[0] || den[1]);if (den[0]||den[1]) {if (a*b < -99999999 || 99999999 < a*b) {co("E");}else co(a*b);}else {co(a*b / 10);}gc();}