Submission #62995142
Source Code Expand
Copy
#include <iostream> // 基本输入输出流#include <algorithm> // 通用算法(排序、查找、去重、二分查找等)#include <vector> // 动态数组(空间不够会自动扩容)#include <queue> // 队列(先进先出)#include <stack> // 栈(先进后出)#include <set> // 集合(有序不重复)#include <map> // 键值对容器(映射)#include <list> // 双向链表#include <math.h> // 数学函数#include <functional> // 通用的函数绑定和调用机制#define endl '\n'#define pii pair<int, int>#define pdd pair<double, double>#define fi first#define se second#define pb push_back#define eb emplace_back#define int long longusing namespace std;
#include <iostream> // 基本输入输出流 #include <algorithm> // 通用算法(排序、查找、去重、二分查找等) #include <vector> // 动态数组(空间不够会自动扩容) #include <queue> // 队列(先进先出) #include <stack> // 栈(先进后出) #include <set> // 集合(有序不重复) #include <map> // 键值对容器(映射) #include <list> // 双向链表 #include <math.h> // 数学函数 #include <functional> // 通用的函数绑定和调用机制 #define endl '\n' #define pii pair<int, int> #define pdd pair<double, double> #define fi first #define se second #define pb push_back #define eb emplace_back #define int long long using namespace std; const int inf = 1e9 + 7; const int mod = 998244353; const int N = 2e5 + 10, M = N << 1; void solve(){ string s; cin>>s; for(int i=0;i<s.size();i++){ if(s[i]=='2'){ cout<<s[i]; } } cout<<endl; } signed main(){ //重定向输入输出 // freopen("pow.in", "r", stdin); // freopen("pow.out", "w", stdout); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int _ = 1; // cin >> _; // 非多组测试数据请注释该行 while(_--) solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 22222 |
User | Digital_Enigma |
Language | C++ 20 (gcc 12.2) |
Score | 100 |
Code Size | 1274 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 3596 KB |
Compile Error
Main.cpp: In function ‘void solve()’: Main.cpp:29:18: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 29 | for(int i=0;i<s.size();i++){ | ~^~~~~~~~~
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 | 3516 KB |
sample01.txt | AC | 1 ms | 3512 KB |
sample02.txt | AC | 1 ms | 3452 KB |
testcase00.txt | AC | 1 ms | 3408 KB |
testcase01.txt | AC | 1 ms | 3508 KB |
testcase02.txt | AC | 1 ms | 3316 KB |
testcase03.txt | AC | 1 ms | 3312 KB |
testcase04.txt | AC | 1 ms | 3444 KB |
testcase05.txt | AC | 1 ms | 3428 KB |
testcase06.txt | AC | 1 ms | 3448 KB |
testcase07.txt | AC | 1 ms | 3372 KB |
testcase08.txt | AC | 1 ms | 3472 KB |
testcase09.txt | AC | 1 ms | 3416 KB |
testcase10.txt | AC | 1 ms | 3408 KB |
testcase11.txt | AC | 1 ms | 3444 KB |
testcase12.txt | AC | 1 ms | 3596 KB |
testcase13.txt | AC | 1 ms | 3448 KB |
testcase14.txt | AC | 1 ms | 3452 KB |