Submission #615993
Source Code Expand
#include <iostream> #include <iomanip> #include <sstream> #include <algorithm> #include <functional> #include <iterator> #include <string> #include <bitset> #include <queue> #include <stack> #include <set> #include <map> #include <list> #include <vector> #include <cmath> typedef unsigned long long int ulli; typedef signed long long int slli; const ulli MAX_ULLI = 0xFFFFFFFFFFFFFFFF; const ulli MIN_ULLI = 0x0000000000000000; const slli MAX_SLLI = 0x7FFFFFFFFFFFFFFF; const slli MIN_SLLI = 0x8000000000000000; const ulli MOD = 1e9 + 7; #ifdef __USE_REAL__ typedef long double real; const real MATH_PI = 3.141592653589793238462643383279502884197169399375105820974944; const real MATH_E = 2.718281828459045235360287471352662497757247093699959574966967; const real eps = 1e-14; #endif /* __USE_REAL__ */ #ifdef __DEBUG__ template<typename T, typename U=T> std::string to_string( const std::list<T>& l, std::function<U(T)> conv = [](const T& v){ return v; }, const std::string delim = "," ) { std::stringstream ss; auto itr = l.begin(); while(itr != l.end()) { ss << conv(*itr); ++itr; if(itr != l.end()) ss << delim; } return ss.str(); } template<typename T, typename U=T> std::string to_string( const std::vector<T>& v, std::function<U(T)> conv = [](const T& v){ return v; }, const std::string delim = "," ) { std::stringstream ss; for(ulli i=0; i<v.size(); ++i) { ss << conv(v[i]); if((i + 1) < v.size()) ss << delim; } return ss.str(); } template<typename T, typename U=T> std::string to_string( const std::set<T>& s, std::function<U(T)> conv = [](const T& v){ return v; }, const std::string delim = "," ) { std::stringstream ss; auto itr = s.begin(); while(itr != s.end()) { ss << conv(*itr); ++itr; if(itr != s.end()) ss << delim; } return ss.str(); } #endif template<typename T, class InputIterator> inline bool have( InputIterator first, InputIterator last, const T &val ) { return std::find(first, last, val) != last; } template<class InputIterator, class UnaryPred> inline bool have_if( InputIterator first, InputIterator last, UnaryPred pred ) { return std::find_if(first, last, pred) != last; } int main() { unsigned N; std::cin >> N; std::cout << (N / 25) << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | material |
Language | C++11 (GCC 4.9.2) |
Score | 60 |
Code Size | 2383 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 928 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 | 25 ms | 800 KB |
sample_02.txt | AC | 24 ms | 812 KB |
test_01.txt | AC | 26 ms | 804 KB |
test_02.txt | AC | 24 ms | 800 KB |
test_03.txt | AC | 26 ms | 800 KB |
test_04.txt | AC | 27 ms | 928 KB |
test_05.txt | AC | 28 ms | 916 KB |
test_06.txt | AC | 27 ms | 924 KB |
test_07.txt | AC | 26 ms | 672 KB |
test_08.txt | AC | 28 ms | 796 KB |
test_09.txt | AC | 25 ms | 920 KB |
test_10.txt | AC | 25 ms | 804 KB |
test_11.txt | AC | 27 ms | 804 KB |
test_12.txt | AC | 24 ms | 920 KB |
test_13.txt | AC | 24 ms | 792 KB |
test_14.txt | AC | 25 ms | 796 KB |
test_15.txt | AC | 24 ms | 800 KB |