Submission #3994683
Source Code Expand
#include<iostream> #include<algorithm> #include<string> #include<vector> #include<cmath> #include<map> #include<iomanip> #define int long long #define ll getchar();getchar();return 0; using namespace std; bool prime(int n) { int cnt = 0; for (int i = 1; i <= sqrt(n); i++) { if (n%i == 0)cnt++; } if (cnt != 1)return false; else return n != 1; } int gcd(int x, int y) { int ans; for (int i = (min(x, y)); i >= 1; i--) { if (x%i == 0 && y%i == 0) { ans = i; break; } } return ans; } int yakusuunowa(int n) { int ans = 0; for (int i = 1; i <= n; i++) { if (n%i == 0)ans += i; } return ans; } int lcm(int x, int y) { return x * y / gcd(x, y); } int ketanowa(int n) { int cnt = 0, sum = 0; for (int i = 10; i <= n * 10; i *= 10) { if (i == 10)cnt += n % i; else sum += (n%i - n % (i / 10)) / (i / 10); } return cnt + sum; } signed main() { string s; int t; cin >> s >> t; if(t%5==0)cout << s[t / 5-1] << s[4] << endl; else cout << s[t / 5] << s[t % 5 - 1] << endl; ll }
Submission Info
Submission Time | |
---|---|
Task | A - 25個の文字列 |
User | sanadayukimura73 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1060 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |
test-01.txt | AC | 1 ms | 256 KB |
test-02.txt | AC | 1 ms | 256 KB |
test-03.txt | AC | 1 ms | 256 KB |
test-04.txt | AC | 1 ms | 256 KB |
test-05.txt | AC | 1 ms | 256 KB |
test-06.txt | AC | 3 ms | 384 KB |
test-07.txt | AC | 1 ms | 256 KB |
test-08.txt | AC | 1 ms | 256 KB |
test-09.txt | AC | 1 ms | 256 KB |
test-10.txt | AC | 1 ms | 256 KB |
test-11.txt | AC | 1 ms | 256 KB |
test-12.txt | AC | 1 ms | 256 KB |
test-13.txt | AC | 1 ms | 256 KB |
test-14.txt | AC | 1 ms | 256 KB |
test-15.txt | AC | 1 ms | 256 KB |
test-16.txt | AC | 1 ms | 256 KB |
test-17.txt | AC | 1 ms | 256 KB |
test-18.txt | AC | 1 ms | 256 KB |
test-19.txt | AC | 1 ms | 256 KB |
test-20.txt | AC | 1 ms | 256 KB |
test-21.txt | AC | 1 ms | 256 KB |
test-22.txt | AC | 1 ms | 256 KB |
test-23.txt | AC | 1 ms | 256 KB |
test-24.txt | AC | 1 ms | 256 KB |
test-25.txt | AC | 1 ms | 256 KB |
test-26.txt | AC | 1 ms | 256 KB |
test-27.txt | AC | 1 ms | 256 KB |
test-28.txt | AC | 1 ms | 256 KB |
test-29.txt | AC | 1 ms | 256 KB |
test-30.txt | AC | 1 ms | 256 KB |