Submission #1027029


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
// n次元配列の初期化。第2引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*) array, (T*) (array + N), val);
}
pii Dir[8] = { //移動
	{ 0 ,1 },{ -1 ,0 },{ 1 ,0 },{ 0 ,-1 },
	{ 1 ,1 },{ 1 ,-1 },{ -1 ,1 },{ -1 ,-1 }
};

signed main() {
	int a;
	scanf("%d", &a);
	printf("%d\n", a/25);
	return 0;
} 

Submission Info

Submission Time
Task A - ニコニコ数
User Gear
Language C++14 (Clang++ 3.4)
Score 60
Code Size 1540 Byte
Status AC
Exec Time 18 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 18 ms 928 KB
sample_02.txt AC 16 ms 792 KB
test_01.txt AC 16 ms 928 KB
test_02.txt AC 16 ms 924 KB
test_03.txt AC 16 ms 672 KB
test_04.txt AC 16 ms 716 KB
test_05.txt AC 17 ms 796 KB
test_06.txt AC 18 ms 924 KB
test_07.txt AC 16 ms 672 KB
test_08.txt AC 16 ms 800 KB
test_09.txt AC 18 ms 924 KB
test_10.txt AC 16 ms 800 KB
test_11.txt AC 16 ms 792 KB
test_12.txt AC 18 ms 800 KB
test_13.txt AC 18 ms 924 KB
test_14.txt AC 18 ms 924 KB
test_15.txt AC 18 ms 920 KB