Submission #5670581


Source Code Expand

Copy
#define DEBUG 0

/**
 * File    : A.cpp
 * Author  : Kazune Takahashi
 * Created : 2019-5-28 11:35:20
 * Powered by Visual Studio Code
 */

#include <iostream>
#include <iomanip>   // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set>
#include <functional>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
// start = std::chrono::system_clock::now();
// double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;

typedef long long ll;

// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};

// const int C = 1e6+10;
// const ll M = 1000000007;

map<char, char> M;

int main()
{
  M['A'] = 'T';
  M['T'] = 'A';
  M['G'] = 'C';
  M['C'] = 'G';
  char c;
  cin >> c;
  cout << M[c] << endl;
}

Submission Info

Submission Time
Task A - Double Helix
User kazunetakahashi
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1305 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 a01, a02
All 100 / 100 a01, a02, b03, b04
Case Name Status Exec Time Memory
a01 1 ms 256 KB
a02 1 ms 256 KB
b03 1 ms 256 KB
b04 1 ms 256 KB