Submission #10242681


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vll = vector<ll>;
using uint = unsigned int;
using ull = unsigned long long;

template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;

constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;

template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
	for (auto &u : v) os << u << el;
	return (os);
}

template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
	for (auto &u : v) is >> u;
	return (is);
}

template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
	return (is >> p.first >> p.second);
}

int main() {
	ll X;
	cin >> X;
	ll val = 2;
	for (int i = 0; i < X; i++) {
		val = val * 3 - 1;
	}
	cout << val << endl;
	return (0);
}

Submission Info

Submission Time
Task F - Trichotomy
User tinumukiti631
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1513 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
AC × 3
WA × 39
Set Name Test Cases
Sample sample_01.txt
All sample_01.txt, sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
subtask1_01.txt WA 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt WA 1 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt WA 1 ms 256 KB
subtask1_06.txt WA 1 ms 256 KB
subtask1_07.txt WA 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt WA 1 ms 256 KB
subtask1_10.txt WA 1 ms 256 KB
subtask1_11.txt WA 1 ms 256 KB
subtask1_12.txt WA 1 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask1_14.txt WA 1 ms 256 KB
subtask1_15.txt WA 1 ms 256 KB
subtask1_16.txt WA 1 ms 256 KB
subtask1_17.txt WA 1 ms 256 KB
subtask1_18.txt WA 1 ms 256 KB
subtask1_19.txt WA 1 ms 256 KB
subtask1_20.txt WA 1 ms 256 KB
subtask1_21.txt WA 1 ms 256 KB
subtask1_22.txt WA 1 ms 256 KB
subtask1_23.txt WA 1 ms 256 KB
subtask1_24.txt WA 1 ms 256 KB
subtask1_25.txt WA 1 ms 256 KB
subtask1_26.txt WA 1 ms 256 KB
subtask1_27.txt WA 1 ms 256 KB
subtask1_28.txt WA 1 ms 256 KB
subtask1_29.txt WA 1 ms 256 KB
subtask1_30.txt WA 1 ms 256 KB
subtask1_31.txt WA 1 ms 256 KB
subtask1_32.txt WA 1 ms 256 KB
subtask1_33.txt WA 1 ms 256 KB
subtask1_34.txt WA 1 ms 256 KB
subtask1_35.txt WA 1 ms 256 KB
subtask1_36.txt WA 1 ms 256 KB
subtask1_37.txt WA 1 ms 256 KB
subtask1_38.txt WA 1 ms 256 KB
subtask1_39.txt WA 1 ms 256 KB
subtask1_40.txt WA 1 ms 256 KB