Submission #2122830


Source Code Expand

// #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES	// M_PI=3.1415...
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
#include <iomanip>	// 20桁出力 cout << setprecision(20) << double;
#include <queue>
#include <bitset>	// bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <numeric>
#include <random>
using namespace std;

typedef long long LL;
typedef pair<LL, LL> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VL;
typedef vector<VL> VVL;				// VVL v(100,VL(100,0));
typedef vector<pair<LL, LL> > VP;
typedef vector<string> VS;
typedef map<int, int> MAPII;
typedef multimap<int, char, greater<int> > MuMAPIC;
typedef multimap<int, string, greater<int> > MuMIS;
typedef pair<LL, pair<P, P> > PP;

#define INF 999999999999999997		// 少し加算したらオーバーフローする
#define MP make_pair
#define FAST_IO  cin.tie(0); ios::sync_with_stdio(false);
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORL(i,a,b) for(LL i=(a);i<(b);i++)
#define FOR_REV(i,a,b) for(int i=(a);i>=(b);i--)
#define foreach_it(type,it,c) for(type::iterator it=c.begin(),c_end=c.end();it!=c_end;++it)
#define FOR_ITR(d) for(auto itr=d.begin(),d_end=d.end();itr!=d_end;++itr)	// C++11
#define O(s) cout<<s<<endl;

#define DUMP_VVI(b) if(dbgF){FOR(i,0,b.size()){FOR(j,0,b[i].size())printf("%d ",b[i][j]);puts("");}}
#define D_OUT(str,value) if(dbgF){cout<<str<<" : "<<value<<endl;}

template<class T>T IN() { T d; cin >> d; return d; }

LL gcd(LL a, LL b) { return (b > 0) ? gcd(b, a%b) : a; } // 最大公約数(Greatest Common Divisor)
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; } // 最小公倍数(Least Common Multiple)
bool uruu(LL Y) { return (((Y % 4 == 0 && Y % 100 != 0) || Y % 400 == 0) ? true : false); } // うるう年判定

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
int dxx[8] = { 0,1,1,1,0,-1,-1,-1 };
int dyy[8] = { 1,1,0,-1,-1,-1,0,1 };

// vector注意
// vec[i][j]の形に入力を入れるとき、vecは初期化してある必要がある.

// ------------------- include, typedef, define END. -------------------

LL A(LL m, LL n) {
	if (m == 0)
		return n + 1;
	else if (n == 0)
		return A(m - 1, 1);
	else
		return A(m - 1, A(m, n - 1));
}

int main() {
	FAST_IO;
	bool dbgF = true; // for D_OUT(str, value)  ... cout<< str <<" : "<< value <<endl;

	LL m, n;
	cin >> m >> n;
	cout << A(m, n) << endl;

	return 0;
}

Submission Info

Submission Time
Task A - Wikipedia
User conchan_akita
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2722 Byte
Status TLE
Exec Time 2103 ms
Memory 1152 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 48
TLE × 12
Set Name Test Cases
All 99_generated_0, 99_generated_1, 99_generated_10, 99_generated_11, 99_generated_12, 99_generated_13, 99_generated_14, 99_generated_15, 99_generated_16, 99_generated_17, 99_generated_18, 99_generated_19, 99_generated_2, 99_generated_20, 99_generated_21, 99_generated_22, 99_generated_23, 99_generated_24, 99_generated_25, 99_generated_26, 99_generated_27, 99_generated_28, 99_generated_29, 99_generated_3, 99_generated_30, 99_generated_31, 99_generated_32, 99_generated_33, 99_generated_34, 99_generated_35, 99_generated_36, 99_generated_37, 99_generated_38, 99_generated_39, 99_generated_4, 99_generated_40, 99_generated_41, 99_generated_42, 99_generated_43, 99_generated_44, 99_generated_45, 99_generated_46, 99_generated_47, 99_generated_48, 99_generated_49, 99_generated_5, 99_generated_50, 99_generated_51, 99_generated_52, 99_generated_53, 99_generated_54, 99_generated_55, 99_generated_56, 99_generated_57, 99_generated_58, 99_generated_59, 99_generated_6, 99_generated_7, 99_generated_8, 99_generated_9
Case Name Status Exec Time Memory
99_generated_0 AC 1 ms 256 KB
99_generated_1 AC 1 ms 256 KB
99_generated_10 AC 1 ms 256 KB
99_generated_11 AC 1 ms 256 KB
99_generated_12 AC 1 ms 256 KB
99_generated_13 AC 1 ms 256 KB
99_generated_14 AC 1 ms 256 KB
99_generated_15 AC 1 ms 256 KB
99_generated_16 AC 1 ms 256 KB
99_generated_17 AC 1 ms 256 KB
99_generated_18 AC 1 ms 256 KB
99_generated_19 AC 1 ms 256 KB
99_generated_2 AC 1 ms 256 KB
99_generated_20 AC 1 ms 256 KB
99_generated_21 AC 1 ms 256 KB
99_generated_22 AC 1 ms 256 KB
99_generated_23 AC 1 ms 256 KB
99_generated_24 AC 1 ms 256 KB
99_generated_25 AC 1 ms 256 KB
99_generated_26 AC 1 ms 256 KB
99_generated_27 AC 1 ms 256 KB
99_generated_28 AC 1 ms 256 KB
99_generated_29 AC 1 ms 256 KB
99_generated_3 AC 1 ms 256 KB
99_generated_30 AC 1 ms 256 KB
99_generated_31 AC 1 ms 256 KB
99_generated_32 AC 1 ms 256 KB
99_generated_33 AC 1 ms 256 KB
99_generated_34 AC 1 ms 256 KB
99_generated_35 AC 1 ms 256 KB
99_generated_36 AC 1 ms 256 KB
99_generated_37 AC 1 ms 256 KB
99_generated_38 AC 1 ms 256 KB
99_generated_39 AC 1 ms 256 KB
99_generated_4 AC 1 ms 256 KB
99_generated_40 AC 1 ms 256 KB
99_generated_41 AC 1 ms 256 KB
99_generated_42 AC 1 ms 256 KB
99_generated_43 AC 1 ms 256 KB
99_generated_44 AC 1 ms 256 KB
99_generated_45 AC 1 ms 256 KB
99_generated_46 AC 4 ms 256 KB
99_generated_47 AC 822 ms 768 KB
99_generated_48 TLE 2103 ms 1152 KB
99_generated_49 TLE 2103 ms 1152 KB
99_generated_5 AC 1 ms 256 KB
99_generated_50 TLE 2103 ms 1152 KB
99_generated_51 TLE 2103 ms 1152 KB
99_generated_52 TLE 2103 ms 1152 KB
99_generated_53 TLE 2103 ms 1152 KB
99_generated_54 TLE 2103 ms 1152 KB
99_generated_55 TLE 2103 ms 1152 KB
99_generated_56 TLE 2103 ms 1152 KB
99_generated_57 TLE 2103 ms 1152 KB
99_generated_58 TLE 2103 ms 1152 KB
99_generated_59 TLE 2103 ms 1152 KB
99_generated_6 AC 1 ms 256 KB
99_generated_7 AC 1 ms 256 KB
99_generated_8 AC 1 ms 256 KB
99_generated_9 AC 1 ms 256 KB