Submission #1982307
Source Code Expand
#include<iostream> #include<string> #include<cstdio> #include<algorithm> #include<cstdlib> #include<cmath> #include<vector> #include<deque> #include<queue> #include<stack> #include<utility> #include<array> #include<cassert> #include<list> #include<experimental/any> #include<cstring> #include<cctype> #include<ctime> #include<cstdbool> #include<cstdint> #include<cstddef> #include<set> #include<unordered_set> #include<bitset> using namespace std; using experimental::any; #define SPEEDY cin.tie(0);ios::sync_with_stdio(false); #define REP(i,n) for(int i=0;i<(n);i++) #define ARREP(i,n,X) for(int i=0;i<(n);i++)cin>>X[i] #define FOR(i,X,n) for(int i=(X);i<(n);i++) #define EREP(i,n) for(int i=1;i<=n;i++) #define BitFOR(N) REP(Bit,1<<(N)) //#define MODE 1 #ifdef MODE #define DEB(X) cout<< #X <<": "<<X<<" "; #define DEB2(X) cout<<X<<" "; #define ARDEB(i,X) cout<< #X <<"["<<i<<"]: "<<X[i]<<" "; #define TFDEB(f) (f)? cout<<"true ":cout<<"false "; #define FORDEB(n,X) for(int i=0;i<(n);i++)ARDEB(i,X) #define END cout<<endl; #else #define DEB(X) {} #define DEB2(X) {} #define ARDEB(i,X) {} #define TFDEB(f) {} #define FORDEB(n,X) {} #define END {} #endif typedef long long int ll; typedef unsigned long long ull; typedef pair<int,int> P; #define ALL(X) X.begin(),X.end() struct edge{int to,cost;}; //struct edge{int from,cost,to;}; struct P2{int x,y;}; #define BIT(Bit,n) bitset<n>(Bit) #define Endl endl #define YN(f) cout<<((f)?"Yes":"No")<<endl const int MOD7=1000000007; const int INF=100000000; const int SET=1000; int main(){ int a,b; cin>>a>>b; if(a+b>=10){ cout<<"error"<<endl; } else cout<<a+b<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Restricted |
User | mamime19 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1719 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02 |
All | a01, a02, b03, b04, b05, b06, b07, b08 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
b03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |