Submission #1022371
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define FOR(i,a,n) for(int i=a,i##_len=(int)n;i<i##_len;++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i=((int)(n)-1);i>=0;--i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define SZ(c) ((int)c.size())
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0}, DY[9]={-1,0,1,0,-1,1,1,-1,0};
const int INF=1e9*2; const long long INFLL=1e18*2;
template<class T> ostream& operator << (ostream &os, const vector<T> &v) {
ITR(i,v) os << *i << (i==end(v)-1 ? "" : " "); return os; }
template<class T> istream& operator >> (istream &is, vector<T> &v) {
ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
is >> p.second >> p.first; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
signed main() {
int A,B;
cin>>A>>B;
if(B<A) swap(A,B);
B-=A;
A=0;
int ans=0;
ans+=B/10;
B%=10;
if(B==0);
else if(B==1) ans+=1;
else if(B==2) ans+=2;
else if(B==3) ans+=3;
else if(B==4) ans+=2;
else if(B==5) ans+=1;
else if(B==6) ans+=2;
else if(B==7) ans+=3;
else if(B==8) ans+=3;
else if(B==9) ans+=2;
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - リモコン |
User |
algon |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
1726 Byte |
Status |
AC |
Exec Time |
19 ms |
Memory |
928 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_maxdiff.txt, 00_maxret.txt, 00_sample1.txt, 00_sample2.txt, 00_sample3.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt |
Case Name |
Status |
Exec Time |
Memory |
00_maxdiff.txt |
AC |
19 ms |
740 KB |
00_maxret.txt |
AC |
18 ms |
804 KB |
00_sample1.txt |
AC |
16 ms |
804 KB |
00_sample2.txt |
AC |
17 ms |
672 KB |
00_sample3.txt |
AC |
19 ms |
800 KB |
01_rnd_00.txt |
AC |
19 ms |
804 KB |
01_rnd_01.txt |
AC |
16 ms |
804 KB |
01_rnd_02.txt |
AC |
18 ms |
800 KB |
01_rnd_03.txt |
AC |
18 ms |
800 KB |
01_rnd_04.txt |
AC |
18 ms |
800 KB |
01_rnd_05.txt |
AC |
18 ms |
800 KB |
01_rnd_06.txt |
AC |
17 ms |
804 KB |
01_rnd_07.txt |
AC |
17 ms |
800 KB |
01_rnd_08.txt |
AC |
17 ms |
676 KB |
01_rnd_09.txt |
AC |
17 ms |
804 KB |
01_rnd_10.txt |
AC |
18 ms |
796 KB |
01_rnd_11.txt |
AC |
18 ms |
796 KB |
01_rnd_12.txt |
AC |
18 ms |
928 KB |
01_rnd_13.txt |
AC |
17 ms |
804 KB |
01_rnd_14.txt |
AC |
18 ms |
800 KB |
01_rnd_15.txt |
AC |
18 ms |
844 KB |
01_rnd_16.txt |
AC |
16 ms |
796 KB |
01_rnd_17.txt |
AC |
19 ms |
800 KB |
01_rnd_18.txt |
AC |
18 ms |
796 KB |
01_rnd_19.txt |
AC |
18 ms |
804 KB |
01_rnd_20.txt |
AC |
19 ms |
800 KB |
01_rnd_21.txt |
AC |
18 ms |
676 KB |
01_rnd_22.txt |
AC |
19 ms |
704 KB |
01_rnd_23.txt |
AC |
17 ms |
804 KB |
01_rnd_24.txt |
AC |
18 ms |
804 KB |
01_rnd_25.txt |
AC |
16 ms |
676 KB |
01_rnd_26.txt |
AC |
16 ms |
800 KB |
01_rnd_27.txt |
AC |
19 ms |
800 KB |
01_rnd_28.txt |
AC |
18 ms |
804 KB |
01_rnd_29.txt |
AC |
18 ms |
804 KB |