Submission #1178508
Source Code Expand
/*
* template.cpp
*
* Created on: 2016/10/30
* Author: jin
*/
#define MYDEBUG
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <math.h>
#ifdef MYDEBUG
#define debug(x) cout<<#x<<": "<<x<<endl
#else
#define debug(x)
#endif
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define all(x) x.begin(), x.end()
using namespace std;
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
out << "[";
size_t last = v.size() - 1;
for (size_t i = 0; i < v.size(); ++i) {
out << v[i];
if (i != last)
out << ",";
}
out << "]";
return out;
}
class Main{
public:
void ABC031A(){
int A,D;
cin >> A >> D;
if(D<A) swap(A,D);
int ans = (A+1) * D;
cout << ans << endl;
}
void ABC028A(){
int n;
cin >> n;
string ans = "";
if(n<=59) ans="Bad";
else if(60<=n&&n<=89) ans = "Good";
else if(90<=n&&n<=99) ans = "Great";
else ans = "Perfect";
cout << ans << endl;
}
void ABC015B(){
int N;
cin >> N;
vector<int> a(N);
int bug=0;
int total=0;
for(int i=0; i<N; ++i) {
cin >> a[i];
if(a[i]!=0){
total+=a[i];
bug++;
}
}
cout << (total+bug-1)/bug << endl;
}
void ABC006C(){
//a+b+c=N
//2a+3b+4c=M
int N,M;
cin >> N >> M;
int a,b,c;
for(b=0; b<=N; ++b){
//a+c=N-b
//2a+4c=M-3b
a=N-b;
c=0;
int diff = 2*a + 3*b + 4*c - M;
//printf("%d %d %d %d\n",a,b,c,diff);
c-=diff/2;
a+=diff/2;
//printf("%d %d %d %d\n\n",a,b,c,diff);
if(diff%2==1||a<0||c<0){
continue;
}
int n = ABC006C_n(a,b,c);
int m = ABC006C_m(a,b,c);
if(n==N&&m==M){
printf("%d %d %d\n",a,b,c);
return;
}
}
printf("%d %d %d\n",-1,-1,-1);
}
int ABC006C_n(int a, int b, int c){
return a+b+c;
}
int ABC006C_m(int a, int b, int c){
return 2*a+3*b+4*c;
}
void ABC001B(){
int add[] = {0,1,2,3,2,1,2,3,3,2,1};
int A,B;
cin >> A >> B;
int ret = abs(A-B) / 10;
ret += add[abs(A-B)-ret*10];
cout << ret << endl;
}
};
int main() {
Main m;
m.ABC001B();
}
Submission Info
Submission Time |
|
Task |
B - リモコン |
User |
LitMc |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2201 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 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 |
1 ms |
256 KB |
00_maxret.txt |
AC |
1 ms |
256 KB |
00_sample1.txt |
AC |
1 ms |
256 KB |
00_sample2.txt |
AC |
1 ms |
256 KB |
00_sample3.txt |
AC |
1 ms |
256 KB |
01_rnd_00.txt |
AC |
1 ms |
256 KB |
01_rnd_01.txt |
AC |
1 ms |
256 KB |
01_rnd_02.txt |
AC |
1 ms |
256 KB |
01_rnd_03.txt |
AC |
1 ms |
256 KB |
01_rnd_04.txt |
AC |
1 ms |
256 KB |
01_rnd_05.txt |
AC |
1 ms |
256 KB |
01_rnd_06.txt |
AC |
1 ms |
256 KB |
01_rnd_07.txt |
AC |
1 ms |
256 KB |
01_rnd_08.txt |
AC |
1 ms |
256 KB |
01_rnd_09.txt |
AC |
1 ms |
256 KB |
01_rnd_10.txt |
AC |
1 ms |
256 KB |
01_rnd_11.txt |
AC |
1 ms |
256 KB |
01_rnd_12.txt |
AC |
1 ms |
256 KB |
01_rnd_13.txt |
AC |
1 ms |
256 KB |
01_rnd_14.txt |
AC |
1 ms |
256 KB |
01_rnd_15.txt |
AC |
1 ms |
256 KB |
01_rnd_16.txt |
AC |
1 ms |
256 KB |
01_rnd_17.txt |
AC |
1 ms |
256 KB |
01_rnd_18.txt |
AC |
1 ms |
256 KB |
01_rnd_19.txt |
AC |
1 ms |
256 KB |
01_rnd_20.txt |
AC |
1 ms |
256 KB |
01_rnd_21.txt |
AC |
1 ms |
256 KB |
01_rnd_22.txt |
AC |
1 ms |
256 KB |
01_rnd_23.txt |
AC |
1 ms |
256 KB |
01_rnd_24.txt |
AC |
1 ms |
256 KB |
01_rnd_25.txt |
AC |
1 ms |
256 KB |
01_rnd_26.txt |
AC |
1 ms |
256 KB |
01_rnd_27.txt |
AC |
1 ms |
256 KB |
01_rnd_28.txt |
AC |
1 ms |
256 KB |
01_rnd_29.txt |
AC |
1 ms |
256 KB |