Submission #400224
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
const int MX = 100005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
int main(){
int a;
scanf("%d",&a);
cout<<a/10+a%10<<endl;
return 0;
}
Submission Info
Submission Time
2015-05-09 21:00:30+0900
Task
A - 加算王
User
snuke
Language
C++ (GCC 4.9.2)
Score
100
Code Size
1347 Byte
Status
AC
Exec Time
25 ms
Memory
928 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:48:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
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
796 KB
subtask0-sample02.txt
AC
24 ms
796 KB
subtask0-sample03.txt
AC
25 ms
800 KB
subtask1-01.txt
AC
25 ms
924 KB
subtask1-02.txt
AC
25 ms
800 KB
subtask1-03.txt
AC
25 ms
924 KB
subtask1-04.txt
AC
23 ms
800 KB
subtask1-05.txt
AC
23 ms
736 KB
subtask1-06.txt
AC
22 ms
928 KB
subtask1-07.txt
AC
23 ms
928 KB
subtask1-08.txt
AC
24 ms
924 KB
subtask1-09.txt
AC
23 ms
672 KB
subtask1-10.txt
AC
24 ms
800 KB
subtask1-11.txt
AC
24 ms
796 KB
subtask1-12.txt
AC
24 ms
800 KB