Submission #400235


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

int main() {
  string s;
  R s;
  pr(s[0]-'0'+s[1]-'0');
  
  
  return 0;
}

Submission Info

Submission Time
Task A - 加算王
User kzyKT
Language C++ (GCC 4.9.2)
Score 100
Code Size 753 Byte
Status AC
Exec Time 27 ms
Memory 928 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 15
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt
All subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 27 ms 920 KB
subtask0-sample02.txt AC 25 ms 732 KB
subtask0-sample03.txt AC 23 ms 924 KB
subtask1-01.txt AC 24 ms 808 KB
subtask1-02.txt AC 24 ms 924 KB
subtask1-03.txt AC 24 ms 924 KB
subtask1-04.txt AC 25 ms 808 KB
subtask1-05.txt AC 23 ms 792 KB
subtask1-06.txt AC 24 ms 800 KB
subtask1-07.txt AC 24 ms 796 KB
subtask1-08.txt AC 25 ms 732 KB
subtask1-09.txt AC 23 ms 804 KB
subtask1-10.txt AC 25 ms 928 KB
subtask1-11.txt AC 24 ms 924 KB
subtask1-12.txt AC 23 ms 920 KB