Submission #1628353
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; typedef pair<ll, P> PP; static const double EPS = 1e-8; static const double PI = 4.0 * atan(1.0); static const ll INF = 1023456789; #define REP(i,n) for(int i=0;i<n;++i) #define REPR(i,n) for(int i=n-1;i>=0;--i) #define FOR(i,s,n) for(int i=s;i<n;++i) #define FORR(i,s,n) for(int i=n-1;i>=s;--i) #define ALL(c) (c).begin(),(c).end() #define CLEAR(v) memset(v,0,sizeof(v)) #define MP(a,b) make_pair((a),(b)) #define ABS(a) ((a)>0?(a):-(a)) #define F first #define S second int main(int argc, char **argv) { string s; cin >> s; REP(i, s.length()) if (i % 2 == 0) cout << s[i]; cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - OddString |
User | yupotown |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 773 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
0_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 6 ms | 512 KB |
1_007.txt | AC | 6 ms | 512 KB |