Submission #400247


Source Code Expand

#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

int main() {
  int N; cin >>N;
  cout <<(N / 10) + (N % 10) <<endl;
  return 0;
}

Submission Info

Submission Time
Task A - 加算王
User alotofwe
Language C++ (GCC 4.9.2)
Score 100
Code Size 712 Byte
Status AC
Exec Time 29 ms
Memory 920 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 25 ms 804 KB
subtask0-sample02.txt AC 24 ms 804 KB
subtask0-sample03.txt AC 25 ms 796 KB
subtask1-01.txt AC 26 ms 808 KB
subtask1-02.txt AC 24 ms 920 KB
subtask1-03.txt AC 26 ms 800 KB
subtask1-04.txt AC 26 ms 812 KB
subtask1-05.txt AC 25 ms 920 KB
subtask1-06.txt AC 26 ms 808 KB
subtask1-07.txt AC 25 ms 840 KB
subtask1-08.txt AC 29 ms 796 KB
subtask1-09.txt AC 26 ms 808 KB
subtask1-10.txt AC 25 ms 800 KB
subtask1-11.txt AC 26 ms 800 KB
subtask1-12.txt AC 26 ms 672 KB