Submission #1061319
Source Code Expand
#include <iostream> #include <string> #include <queue> #include <stack> #include <algorithm> #include <list> #include <vector> #include <complex> #include <utility> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <climits> #include <bitset> #include <ctime> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <cassert> #include <cstddef> #include <iomanip> #include <numeric> #include <tuple> #include <sstream> #include <fstream> using namespace std; #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++) #define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++) #define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--) #define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--) #define DEBUG(C) cerr << #C << " = " << C << endl; using LL = long long; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<LL>; using VVL = vector<VL>; using VD = vector<double>; using VVD = vector<VD>; using PII = pair<int, int>; using PDD = pair<double, double>; using PLL = pair<LL, LL>; using VPII = vector<PII>; template<typename T> using VT = vector<T>; #define ALL(a) begin((a)), end((a)) #define RALL(a) rbegin((a)), rend((a)) #define SORT(a) sort(ALL((a))) #define RSORT(a) sort(RALL((a))) #define REVERSE(a) reverse(ALL((a))) #define MP make_pair #define FORE(a, b) for (auto &&a : (b)) #define FIND(s, e) ((s).find(e) != (s).end()) #define EB emplace_back template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;} template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;} const int INF = 1e9; const int MOD = INF + 7; const LL LLINF = 1e18; int main(void) { int N; cin >> N; cout << N / 25 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | sekiya9311 |
Language | C++11 (GCC 4.9.2) |
Score | 60 |
Code Size | 1844 Byte |
Status | AC |
Exec Time | 17 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 | 17 ms | 800 KB |
sample_02.txt | AC | 16 ms | 800 KB |
test_01.txt | AC | 16 ms | 796 KB |
test_02.txt | AC | 16 ms | 800 KB |
test_03.txt | AC | 16 ms | 924 KB |
test_04.txt | AC | 16 ms | 792 KB |
test_05.txt | AC | 16 ms | 800 KB |
test_06.txt | AC | 16 ms | 916 KB |
test_07.txt | AC | 16 ms | 920 KB |
test_08.txt | AC | 16 ms | 672 KB |
test_09.txt | AC | 16 ms | 796 KB |
test_10.txt | AC | 16 ms | 792 KB |
test_11.txt | AC | 16 ms | 800 KB |
test_12.txt | AC | 16 ms | 800 KB |
test_13.txt | AC | 17 ms | 792 KB |
test_14.txt | AC | 16 ms | 800 KB |
test_15.txt | AC | 16 ms | 796 KB |