Submission #615707
Source Code Expand
#include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <deque> #include <complex> #include <stack> #include <queue> #include <cstdio> #include <cctype> #include <cstring> #include <ctime> #include <iterator> #include <bitset> #include <numeric> #include <list> #include <iomanip> #include <cassert> #if __cplusplus >= 201103L #include <array> #include <tuple> #include <initializer_list> #include <unordered_set> #include <unordered_map> #include <forward_list> #define cauto const auto& #define ALL(v) begin(v),end(v) #else #define ALL(v) (v).begin(),(v).end() #endif using namespace std; namespace{ typedef long long LL; typedef pair<int,int> pii; typedef pair<LL,LL> pll; typedef vector<int> vint; typedef vector<vector<int> > vvint; typedef vector<long long> vll, vLL; typedef vector<vector<long long> > vvll, vvLL; #define VV(T) vector<vector< T > > template <class T> void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){ v.assign(a, vector<T>(b, t)); } template <class F, class T> void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #define REP(i,n) for(int i=0;i<int(n);++i) #define RALL(v) (v).rbegin(),(v).rend() #define MOD 1000000007LL #define EPS 1e-8 void mainmain(){ LL n; cin >> n; LL ans = n / 25; cout << ans << endl; } } int main() try{ // ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(4); mainmain(); } catch(...){}
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | climpet |
Language | C++11 (GCC 4.9.2) |
Score | 60 |
Code Size | 1752 Byte |
Status | AC |
Exec Time | 28 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 | 796 KB |
sample_02.txt | AC | 27 ms | 744 KB |
test_01.txt | AC | 26 ms | 920 KB |
test_02.txt | AC | 26 ms | 792 KB |
test_03.txt | AC | 26 ms | 732 KB |
test_04.txt | AC | 26 ms | 728 KB |
test_05.txt | AC | 28 ms | 796 KB |
test_06.txt | AC | 26 ms | 796 KB |
test_07.txt | AC | 26 ms | 728 KB |
test_08.txt | AC | 26 ms | 732 KB |
test_09.txt | AC | 26 ms | 920 KB |
test_10.txt | AC | 24 ms | 920 KB |
test_11.txt | AC | 25 ms | 920 KB |
test_12.txt | AC | 25 ms | 796 KB |
test_13.txt | AC | 26 ms | 728 KB |
test_14.txt | AC | 23 ms | 924 KB |
test_15.txt | AC | 25 ms | 920 KB |