Submission #3982961
Source Code Expand
#include <bits/stdc++.h> // #include <iostream> // #include <vector> // #include <map> // #include <algorithm> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) template<typename T> T mod(T a, T b){ return (a + b) % b; } template<typename T> T gcd(T a, T b){ if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b){ return a * b / gcd(a,b); } // n を素因数分解 map<ll, ll> factor(ll n){ map<ll, ll> mp; for (ll i = 2; i*i <= n; i++) { while (n % i == 0) { mp[i]++; n /= i; } } if (n > 1) { mp[n]++; } return mp; } // 文字列に "hoge" が含まれているか // string str = "hogepiyo"; // if (str.find("hoge") != string::npos) { // cout << "文字列が含まれています" << endl; // } // char to string // char c = 'a'; // string str = {c}; void solve(){ int a,b; cin >> a >> b; cout << b << " " << a << endl; return; } int main(int argc, char const* argv[]) { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - スワップ |
User | goropikari |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1214 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 764 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | sample_01.txt, sample_02.txt, test_13_69.txt, test_16_44.txt, test_40_40.txt, test_49_31.txt, test_51_74.txt, test_83_60.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 6 ms | 764 KB |
sample_02.txt | AC | 1 ms | 256 KB |
test_13_69.txt | AC | 1 ms | 256 KB |
test_16_44.txt | AC | 1 ms | 256 KB |
test_40_40.txt | AC | 1 ms | 256 KB |
test_49_31.txt | AC | 1 ms | 256 KB |
test_51_74.txt | AC | 1 ms | 256 KB |
test_83_60.txt | AC | 1 ms | 256 KB |