Submission #615939
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII; typedef pair<LL, LL> PLL;
typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<VVI> VVVI;
typedef vector<LL> VLL; typedef vector<VLL> VVLL; typedef vector<VVLL> VVVLL;
typedef vector<double> VD; typedef vector<VD> VVD; typedef vector<VVD> VVVD;
typedef vector<string> VS; typedef vector<VS> VVS; typedef vector<VVS> VVVS;
typedef vector<bool> VB; typedef vector<VB> VVB; typedef vector<VVB> VVVB;
typedef vector<PII> VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL> VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;
#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N) for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a) { OSS oss; oss << a; return oss.str(); };
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int DX[] = {1, 0, -1, 0};
const int DY[] = {0, -1, 0, 1};
const double EPS = 1e-12;
// const double PI = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}
int main(void) {
int N;
cin >> N;
int cnt = 0;
LL x = 25;
while (x <= N) {
cnt++;
x += 25;
}
cout << cnt << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - ニコニコ数 |
User |
snakazawa |
Language |
C++11 (GCC 4.9.2) |
Score |
60 |
Code Size |
2249 Byte |
Status |
AC |
Exec Time |
49 ms |
Memory |
924 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Score / Max Score |
0 / 0 |
60 / 60 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
Subtask1 |
sample_01.txt, sample_02.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 |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
26 ms |
800 KB |
sample_02.txt |
AC |
24 ms |
924 KB |
test_01.txt |
AC |
26 ms |
800 KB |
test_02.txt |
AC |
25 ms |
760 KB |
test_03.txt |
AC |
24 ms |
796 KB |
test_04.txt |
AC |
23 ms |
796 KB |
test_05.txt |
AC |
23 ms |
804 KB |
test_06.txt |
AC |
26 ms |
920 KB |
test_07.txt |
AC |
26 ms |
916 KB |
test_08.txt |
AC |
49 ms |
732 KB |
test_09.txt |
AC |
48 ms |
800 KB |
test_10.txt |
AC |
38 ms |
728 KB |
test_11.txt |
AC |
48 ms |
724 KB |
test_12.txt |
AC |
31 ms |
920 KB |
test_13.txt |
AC |
26 ms |
732 KB |
test_14.txt |
AC |
25 ms |
796 KB |
test_15.txt |
AC |
25 ms |
668 KB |