Submission #615697
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef complex<double> P; typedef pair<int,int> pii; #define REP(i,n) for(ll i=0;i<n;++i) #define REPR(i,n) for(ll i=1;i<n;++i) #define FOR(i,a,b) for(ll i=a;i<b;++i) #define DEBUG(x) cout<<#x<<": "<<x<<endl #define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl #define ALL(a) (a).begin(),(a).end() #define MOD (ll)(1e9+7) #define ADD(a,b) a=((a)+(b))%MOD #define FIX(a) ((a)%MOD+MOD)%MOD int main(){ ll a; cin>>a; cout << (a/25) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | rickytheta |
Language | C++ (GCC 4.9.2) |
Score | 60 |
Code Size | 630 Byte |
Status | AC |
Exec Time | 26 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 | 928 KB |
sample_02.txt | AC | 23 ms | 924 KB |
test_01.txt | AC | 26 ms | 924 KB |
test_02.txt | AC | 24 ms | 800 KB |
test_03.txt | AC | 23 ms | 920 KB |
test_04.txt | AC | 25 ms | 924 KB |
test_05.txt | AC | 26 ms | 804 KB |
test_06.txt | AC | 24 ms | 796 KB |
test_07.txt | AC | 25 ms | 800 KB |
test_08.txt | AC | 23 ms | 928 KB |
test_09.txt | AC | 26 ms | 800 KB |
test_10.txt | AC | 26 ms | 924 KB |
test_11.txt | AC | 23 ms | 676 KB |
test_12.txt | AC | 25 ms | 672 KB |
test_13.txt | AC | 25 ms | 796 KB |
test_14.txt | AC | 24 ms | 924 KB |
test_15.txt | AC | 26 ms | 808 KB |