Submission #62994253
Source Code Expand
Copy
#include <bits/stdc++.h>//#include <atcoder/all>using namespace std;#define rep(i,n) for(ll i=0; i<n; i++)#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)#define rrep(i,n) for(ll i=n-1; i>=0; i--)#define fi first#define se second#define pcnt __builtin_popcountlltypedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef pair<int,int> Pii;typedef pair<ll,ll> Pll;typedef pair<ll,Pll> PlP;template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}string zero_padding(int val, int nf){ ostringstream sout;sout << setfill('0') << setw(nf) << val; return sout.str();};const ld eps = 1e-10;
#include <bits/stdc++.h> //#include <atcoder/all> using namespace std; #define rep(i,n) for(ll i=0; i<n; i++) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rrep(i,n) for(ll i=n-1; i>=0; i--) #define fi first #define se second #define pcnt __builtin_popcountll typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> Pii; typedef pair<ll,ll> Pll; typedef pair<ll,Pll> PlP; template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; } template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; } template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";} template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);} string zero_padding(int val, int nf){ ostringstream sout;sout << setfill('0') << setw(nf) << val; return sout.str();}; const ld eps = 1e-10; const ll INF = 1e18; ull mo = 1000000007; ld PI=asin(1)*2; //using namespace atcoder; int main(){ string S; cin >> S; string ans = ""; for(auto c:S){ if(c == '2') ans += '2'; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 22222 |
User | zssa |
Language | C++ 20 (gcc 12.2) |
Score | 100 |
Code Size | 1142 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 3560 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample00.txt, sample01.txt, sample02.txt |
All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample00.txt | AC | 1 ms | 3560 KB |
sample01.txt | AC | 1 ms | 3496 KB |
sample02.txt | AC | 1 ms | 3460 KB |
testcase00.txt | AC | 1 ms | 3468 KB |
testcase01.txt | AC | 1 ms | 3436 KB |
testcase02.txt | AC | 1 ms | 3560 KB |
testcase03.txt | AC | 1 ms | 3488 KB |
testcase04.txt | AC | 1 ms | 3464 KB |
testcase05.txt | AC | 1 ms | 3476 KB |
testcase06.txt | AC | 1 ms | 3460 KB |
testcase07.txt | AC | 1 ms | 3532 KB |
testcase08.txt | AC | 1 ms | 3428 KB |
testcase09.txt | AC | 1 ms | 3476 KB |
testcase10.txt | AC | 1 ms | 3456 KB |
testcase11.txt | AC | 1 ms | 3452 KB |
testcase12.txt | AC | 1 ms | 3488 KB |
testcase13.txt | AC | 1 ms | 3492 KB |
testcase14.txt | AC | 1 ms | 3468 KB |