Submission #598660
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define MP(x,y) make_pair((x), (y))
#define MIN(a,b) (a < b ? a : b)
#define MAX(a,b) (a > b ? a : b)
#define AMIN(a,b) if(b < a) (a) = (b)
#define AMAX(a,b) if(b > a) (a) = (b)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define bitcount(b) __builtin_popcount(b)
#define GCD(a,b) (__gcd(a,b))
#define GCD3(a,b,c) (GCD(GCD(a,b), c))
#define LCM(a,b) (a/GCD(a,b)*b)
#define LCM3(a,b,c) LCM(LCM(a,b),c)
#define MOD 1000000007
typedef long long ll;
// -------------------------------------
int main() {
int m;
cin >> m;
if (m < 100) {
_P("00\n");
}
else if (m <= 5000) {
_P("%02d\n", m / 100);
}
else if (m <= 30000) {
_P("%02d\n", 50 + m / 1000);
}
else if (m <= 70000) {
_P("%02d\n", (m / 1000 - 30) / 5 + 80);
}
else {
_P("89\n");
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 視程の通報 |
User |
shiratty8 |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
1363 Byte |
Status |
AC |
Exec Time |
27 ms |
Memory |
924 KB |
Judge Result
Set Name |
all |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
all |
00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01.txt |
AC |
25 ms |
796 KB |
00_sample_02.txt |
AC |
23 ms |
800 KB |
00_sample_03.txt |
AC |
24 ms |
740 KB |
test_01.txt |
AC |
26 ms |
796 KB |
test_02.txt |
AC |
23 ms |
800 KB |
test_03.txt |
AC |
24 ms |
920 KB |
test_04.txt |
AC |
24 ms |
800 KB |
test_05.txt |
AC |
24 ms |
800 KB |
test_06.txt |
AC |
24 ms |
800 KB |
test_07.txt |
AC |
25 ms |
800 KB |
test_08.txt |
AC |
24 ms |
800 KB |
test_09.txt |
AC |
24 ms |
796 KB |
test_10.txt |
AC |
25 ms |
800 KB |
test_11.txt |
AC |
25 ms |
916 KB |
test_12.txt |
AC |
24 ms |
804 KB |
test_13.txt |
AC |
25 ms |
864 KB |
test_14.txt |
AC |
24 ms |
800 KB |
test_15.txt |
AC |
24 ms |
796 KB |
test_16.txt |
AC |
25 ms |
924 KB |
test_17.txt |
AC |
24 ms |
796 KB |
test_18.txt |
AC |
25 ms |
924 KB |
test_19.txt |
AC |
24 ms |
800 KB |
test_20.txt |
AC |
26 ms |
872 KB |
test_21.txt |
AC |
23 ms |
800 KB |
test_22.txt |
AC |
25 ms |
804 KB |
test_23.txt |
AC |
23 ms |
800 KB |
test_24.txt |
AC |
25 ms |
924 KB |
test_25.txt |
AC |
27 ms |
800 KB |
test_26.txt |
AC |
24 ms |
800 KB |
test_27.txt |
AC |
24 ms |
800 KB |
test_28.txt |
AC |
24 ms |
800 KB |
test_29.txt |
AC |
24 ms |
800 KB |
test_30.txt |
AC |
23 ms |
864 KB |
test_31.txt |
AC |
24 ms |
796 KB |
test_32.txt |
AC |
25 ms |
800 KB |
test_33.txt |
AC |
23 ms |
796 KB |
test_34.txt |
AC |
24 ms |
800 KB |
test_35.txt |
AC |
24 ms |
800 KB |