Submission #615755
Source Code Expand
#include <iostream> #include <vector> #include <string> #include <sstream> #include <algorithm> #include <map> #include <set> #include <cstdio> #include <cmath> #define rep(i,l,n) for(lint i=l;i<n;i++) #define rer(i,l,n) for(lint i=l;i<=n;i++) #define all(a) a.begin(),a.end() #define o(a) cout<<a<<endl #define pb(a) push_back(a) #define mk(a,b) make_pair(a,b) #define fi first #define se second using namespace std; typedef long long lint; typedef vector<int> vi; typedef vector<lint> vli; typedef vector<vi> vvi; typedef pair<int,int> pii; int main(){ lint n; cin>>n; o(n/25); }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | treeone |
Language | C++ (GCC 4.9.2) |
Score | 60 |
Code Size | 613 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 | 26 ms | 808 KB |
sample_02.txt | AC | 26 ms | 672 KB |
test_01.txt | AC | 26 ms | 920 KB |
test_02.txt | AC | 26 ms | 924 KB |
test_03.txt | AC | 28 ms | 796 KB |
test_04.txt | AC | 25 ms | 792 KB |
test_05.txt | AC | 25 ms | 924 KB |
test_06.txt | AC | 27 ms | 796 KB |
test_07.txt | AC | 25 ms | 800 KB |
test_08.txt | AC | 27 ms | 704 KB |
test_09.txt | AC | 25 ms | 800 KB |
test_10.txt | AC | 27 ms | 800 KB |
test_11.txt | AC | 28 ms | 920 KB |
test_12.txt | AC | 25 ms | 800 KB |
test_13.txt | AC | 26 ms | 700 KB |
test_14.txt | AC | 27 ms | 804 KB |
test_15.txt | AC | 25 ms | 928 KB |