Submission #615736


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
#include <complex>
#include <numeric>
using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n) for(int i=(int)n-1; 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(c) (c).begin(), (c).end()

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef vector<int> vi;

const int INF = 1e9;
const int MOD = 1e9+7;

int main(void){
    ll n;
    cin >> n;
    cout << n / 25 << endl;	
	return 0;
}

Submission Info

Submission Time
Task A - ニコニコ数
User no15_renne
Language C++ (GCC 4.9.2)
Score 60
Code Size 830 Byte
Status AC
Exec Time 27 ms
Memory 928 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 60 / 60
Status
AC × 2
AC × 17
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 27 ms 796 KB
sample_02.txt AC 26 ms 800 KB
test_01.txt AC 26 ms 676 KB
test_02.txt AC 26 ms 792 KB
test_03.txt AC 26 ms 792 KB
test_04.txt AC 27 ms 800 KB
test_05.txt AC 27 ms 804 KB
test_06.txt AC 25 ms 796 KB
test_07.txt AC 24 ms 920 KB
test_08.txt AC 26 ms 672 KB
test_09.txt AC 25 ms 796 KB
test_10.txt AC 24 ms 800 KB
test_11.txt AC 25 ms 800 KB
test_12.txt AC 27 ms 800 KB
test_13.txt AC 25 ms 800 KB
test_14.txt AC 26 ms 928 KB
test_15.txt AC 24 ms 676 KB