結果

問題 No.441 和か積
ユーザー satanic
提出日時 2016-11-11 22:36:29
言語 C++14
(gcc 8.3.0)
結果
AC  
実行時間 4 ms
コード長 4,280 Byte
コンパイル時間 955 ms
使用メモリ 1,528 KB
最終ジャッジ日時 2019-10-19 14:04:55

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
99_system_test1.txt AC 3 ms
1,512 KB
99_system_test2.txt AC 3 ms
1,512 KB
99_system_test3.txt AC 3 ms
1,516 KB
99_system_test4.txt AC 3 ms
1,524 KB
99_system_test5.txt AC 3 ms
1,528 KB
99_system_test6.txt AC 3 ms
1,520 KB
99_system_test7.txt AC 3 ms
1,528 KB
99_system_test8.txt AC 3 ms
1,528 KB
a_sample1.in AC 3 ms
1,508 KB
a_sample2.in AC 3 ms
1,512 KB
a_sample3.in AC 3 ms
1,520 KB
b_custom1.in AC 3 ms
1,508 KB
b_custom2.in AC 3 ms
1,520 KB
b_custom3.in AC 4 ms
1,516 KB
b_custom4.in AC 3 ms
1,512 KB
b_custom5.in AC 3 ms
1,508 KB
b_custom6.in AC 3 ms
1,516 KB
b_custom7.in AC 3 ms
1,508 KB
b_custom8.in AC 3 ms
1,512 KB
b_custom9.in AC 3 ms
1,508 KB
c_large1.in AC 3 ms
1,524 KB
c_large2.in AC 3 ms
1,524 KB
c_large3.in AC 3 ms
1,520 KB
c_large4.in AC 3 ms
1,524 KB
c_large5.in AC 4 ms
1,520 KB
c_large6.in AC 4 ms
1,520 KB
c_large7.in AC 3 ms
1,524 KB
challenge01.txt AC 4 ms
1,508 KB
d_random1.in AC 3 ms
1,520 KB
d_random2.in AC 3 ms
1,520 KB
d_random3.in AC 3 ms
1,528 KB
d_random4.in AC 3 ms
1,520 KB
d_random5.in AC 3 ms
1,524 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <array>
#include <chrono>
#include <random>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\t";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& i : v){std::cerr << i << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cerr << j << " ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cerr<<'('<<j.first<<", "<<j.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& i:v){std::cerr<<'('<<i.first<<", "<<i.second<<") ";}std::cout<<"\n";}
#define CHECKTIME(state) {auto start=std::chrono::system_clock::now();state();auto end=std::chrono::system_clock::now();auto res=std::chrono::duration_cast<std::chrono::nanoseconds>(end-start).count();std::cerr<<"[Time:"<<res<<"ns  ("<<res/(1.0e9)<<"s)]\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
#define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a))
#define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a))
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}

#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^19
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238;

class bigNum {
	std::vector<char> digit;
	bigNum(int n) : digit(n, 0){}

};

signed main() {
	INIT;
	VAR(std::string, a, b);
	if ((a.size() == 1 && a[0] == '0' && b.size() == 1 && b[0] == '0') ||
		(a.size() == 1 && a[0] == '2' && b.size() == 1 && b[0] == '2')) {
		OUT('E')BR;
		return 0;
	}
	if ((a.size() == 1 && a[0] == '0') || (b.size() == 1 && b[0] == '0')) {
		OUT('S')BR;
		return 0;
	}
	if ((a.size() == 1 && a[0] == '1') || (b.size() == 1 && b[0] == '1')) {
		OUT('S')BR;
		return 0;
	}
	OUT('P')BR;
	return 0;
}
0