Submission #615712
Source Code Expand
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <unordered_map>
#include <iterator>
#include <functional>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}
const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;
int n, m;
int main(int argc, char *argv[]){
ios::sync_with_stdio(false);
while(cin >> n){
cout << n/25 << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - ニコニコ数 |
User |
zerokugi |
Language |
C++11 (GCC 4.9.2) |
Score |
60 |
Code Size |
2518 Byte |
Status |
AC |
Exec Time |
28 ms |
Memory |
932 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 |
28 ms |
800 KB |
sample_02.txt |
AC |
23 ms |
800 KB |
test_01.txt |
AC |
24 ms |
928 KB |
test_02.txt |
AC |
23 ms |
928 KB |
test_03.txt |
AC |
24 ms |
800 KB |
test_04.txt |
AC |
26 ms |
736 KB |
test_05.txt |
AC |
23 ms |
916 KB |
test_06.txt |
AC |
23 ms |
932 KB |
test_07.txt |
AC |
23 ms |
920 KB |
test_08.txt |
AC |
23 ms |
804 KB |
test_09.txt |
AC |
24 ms |
800 KB |
test_10.txt |
AC |
25 ms |
800 KB |
test_11.txt |
AC |
23 ms |
800 KB |
test_12.txt |
AC |
25 ms |
800 KB |
test_13.txt |
AC |
22 ms |
928 KB |
test_14.txt |
AC |
24 ms |
780 KB |
test_15.txt |
AC |
23 ms |
732 KB |