Submission #2236846


Source Code Expand

#pragma warning(disable:4996)
#include <bits/stdc++.h>

using namespace std;

//macro
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define EPS (1e-8)
#define equals(a,b)(fabs((a)-(b))<EPS)

using ll = long long;
using ull = unsigned long long;
using vb = vector<bool>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
using vvb = vector<vb>;
using vvi = vector<vi>;
using vvll = vector<vll>;
//func
template<typename A, typename T>void assign2d(A&arr, ll H, ll W, T t) { arr.resize(H); REP(i, H) arr[i].assign(W, t); }
template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { int n = v.size(); REP(i, n)os << v[i] << (i == n - 1 ? "" : " "); return os; }
template <class T = int> inline T IN() { T x; cin >> x; return x; }
template<class T> inline void OUT(const T &x) { cout << x << "\n"; }
void YESNO(bool c) { OUT(c ? "YES" : "NO"); };
void YesNo(bool c) { OUT(c ? "Yes" : "No"); };
struct pre_ { pre_() { cin.tie(nullptr); ios::sync_with_stdio(false); /*cout << fixed << setprecision(6);*/ } } pre__;

int main() {
	int X, Y;
	cin >> X >> Y;
	OUT(Y / X);
	return 0;
}

Submission Info

Submission Time
Task A - おいしいたこ焼きの作り方
User maodao
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1219 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 33
Set Name Test Cases
All rand0.txt, rand1.txt, rand10.txt, rand11.txt, rand12.txt, rand13.txt, rand14.txt, rand15.txt, rand16.txt, rand17.txt, rand18.txt, rand19.txt, rand2.txt, rand20.txt, rand21.txt, rand22.txt, rand23.txt, rand24.txt, rand25.txt, rand26.txt, rand27.txt, rand28.txt, rand29.txt, rand3.txt, rand4.txt, rand5.txt, rand6.txt, rand7.txt, rand8.txt, rand9.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
rand0.txt AC 1 ms 256 KB
rand1.txt AC 1 ms 256 KB
rand10.txt AC 1 ms 256 KB
rand11.txt AC 1 ms 256 KB
rand12.txt AC 1 ms 256 KB
rand13.txt AC 1 ms 256 KB
rand14.txt AC 1 ms 256 KB
rand15.txt AC 1 ms 256 KB
rand16.txt AC 1 ms 256 KB
rand17.txt AC 1 ms 256 KB
rand18.txt AC 1 ms 256 KB
rand19.txt AC 1 ms 256 KB
rand2.txt AC 1 ms 256 KB
rand20.txt AC 1 ms 256 KB
rand21.txt AC 1 ms 256 KB
rand22.txt AC 1 ms 256 KB
rand23.txt AC 1 ms 256 KB
rand24.txt AC 1 ms 256 KB
rand25.txt AC 1 ms 256 KB
rand26.txt AC 1 ms 256 KB
rand27.txt AC 1 ms 256 KB
rand28.txt AC 1 ms 256 KB
rand29.txt AC 1 ms 256 KB
rand3.txt AC 1 ms 256 KB
rand4.txt AC 1 ms 256 KB
rand5.txt AC 1 ms 256 KB
rand6.txt AC 1 ms 256 KB
rand7.txt AC 1 ms 256 KB
rand8.txt AC 1 ms 256 KB
rand9.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB