結果
問題 | No.339 何人が回答したのか |
ユーザー | not_522 |
提出日時 | 2016-11-23 15:26:47 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 5,077 bytes |
コンパイル時間 | 1,633 ms |
コンパイル使用メモリ | 168,284 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-05 12:47:50 |
合計ジャッジ時間 | 3,080 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 1 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 1 ms
5,376 KB |
testcase_26 | AC | 1 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 2 ms
5,376 KB |
testcase_36 | AC | 1 ms
5,376 KB |
testcase_37 | AC | 2 ms
5,376 KB |
testcase_38 | AC | 2 ms
5,376 KB |
testcase_39 | AC | 2 ms
5,376 KB |
testcase_40 | AC | 2 ms
5,376 KB |
testcase_41 | AC | 1 ms
5,376 KB |
testcase_42 | AC | 1 ms
5,376 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 1 ms
5,376 KB |
testcase_45 | AC | 1 ms
5,376 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 1 ms
5,376 KB |
testcase_48 | AC | 1 ms
5,376 KB |
testcase_49 | AC | 2 ms
5,376 KB |
testcase_50 | AC | 2 ms
5,376 KB |
testcase_51 | AC | 2 ms
5,376 KB |
testcase_52 | AC | 1 ms
5,376 KB |
testcase_53 | AC | 1 ms
5,376 KB |
testcase_54 | AC | 2 ms
5,376 KB |
testcase_55 | AC | 2 ms
5,376 KB |
testcase_56 | AC | 2 ms
5,376 KB |
testcase_57 | AC | 2 ms
5,376 KB |
testcase_58 | AC | 2 ms
5,376 KB |
testcase_59 | AC | 1 ms
5,376 KB |
testcase_60 | AC | 1 ms
5,376 KB |
testcase_61 | AC | 2 ms
5,376 KB |
testcase_62 | AC | 1 ms
5,376 KB |
testcase_63 | AC | 1 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct Initializer { Initializer() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15); } } initializer; template<typename T> inline istream& operator>>(istream &s, vector<T> &v) { for (T &t : v) s >> t; return s; } template<typename T> inline ostream& operator<<(ostream &s, const vector<T> &v) { for (const T &t : v) s << t << endl; return s; } template<typename T> inline T min(vector<T>& v) {return *min_element(v.begin(), v.end());} template<typename T> inline T max(vector<T>& v) {return *max_element(v.begin(), v.end());} template<typename T> inline int min_element(vector<T>& v) {return min_element(v.begin(), v.end()) - v.begin();} template<typename T> inline int max_element(vector<T>& v) {return max_element(v.begin(), v.end()) - v.begin();} template<typename T> inline void sort(vector<T>& v) {sort(v.begin(), v.end());} template<typename T, typename Function> inline void sort(vector<T>& v, Function func) {sort(v.begin(), v.end(), func);} template<typename T> inline void rsort(vector<T>& v) {sort(v.rbegin(), v.rend());} template<typename T> inline void reverse(vector<T>& v) {reverse(v.begin(), v.end());} template<typename T> inline void unique(vector<T>& v) {v.erase(unique(v.begin(), v.end()), v.end());} template<typename T> inline void nth_element(vector<T>& v, int n) {nth_element(v.begin(), v.begin() + n, v.end());} template<typename T> inline bool next_permutation(vector<T>& v) {return next_permutation(v.begin(), v.end());} template<typename T> inline int find(vector<T>& v, T t) {return find(v.begin(), v.end(), t) - v.begin();} template<typename T> inline int in(vector<T> v, T t) {return find(v, t) != (int)v.size();} template<typename T> inline int lower_bound(vector<T>& v, T t) {return lower_bound(v.begin(), v.end(), t) - v.begin();} template<typename T> inline int upper_bound(vector<T>& v, T t) {return upper_bound(v.begin(), v.end(), t) - v.begin();} template<typename T> inline T accumulate(const vector<T>& v, function<T(T, T)> func = plus<T>()) {return accumulate(v.begin(), v.end(), T(), func);} template<typename T> inline void adjacent_difference(vector<T>& v) {adjacent_difference(v.begin(), v.end(), v.begin());} template<typename T> inline void adjacent_difference(vector<T>& v, vector<T>& u) {adjacent_difference(v.begin(), v.end(), u.begin());} template<typename T> inline void partial_sum(vector<T>& v, vector<T>& u) {partial_sum(v.begin(), v.end(), u.begin());} template<typename T> inline T inner_product(vector<T>& v, vector<T>& u) {return inner_product(v.begin(), v.end(), u.begin(), T(0));} template<typename T> inline int count(const vector<T>& v, T t) {return count(v.begin(), v.end(), t);} template<typename T, typename Function> inline int count_if(const vector<T>& v, Function func) {return count_if(v.begin(), v.end(), func);} template<typename T, typename Function> inline void remove_if(vector<T>& v, Function func) {v.erase(remove_if(v.begin(), v.end(), func), v.end());} template<typename T, typename Function> inline bool any_of(vector<T> v, Function func) {return any_of(v.begin(), v.end(), func);} template<typename T> inline vector<T> subvector(vector<T>& v, int a, int b) {return vector<T>(v.begin() + a, v.begin() + b);} template<typename T> inline int kinds(const vector<T>& v) {return set<T>(v.begin(), v.end()).size();} template<typename T> inline void iota(vector<T>& v) {iota(v.begin(), v.end(), T());} template<typename T> inline T gcd(T t) { return t; } template<typename T, typename... S> inline T gcd(T t, S... s) { return __gcd(t, gcd(s...)); } template<typename T> inline T lcm(T t) { return t; } template<typename T, typename... S> inline T lcm(T t, S... s) { T l = lcm(s...); return t / gcd(t, l) * l; } template<typename T> inline T floor(T a, T b) { return a / b * b <= a ? a / b : a / b - 1; } template<> inline float floor(float a, float b) { return floor(a / b) * b <= a ? floor(a / b) : floor(a / b) - 1; } template<> inline double floor(double a, double b) { return floor(a / b) * b <= a ? floor(a / b) : floor(a / b) - 1; } template<> inline long double floor(long double a, long double b) { return floor(a / b) * b <= a ? floor(a / b) : floor(a / b) - 1; } template<typename T> inline T ceil(T a, T b) { return floor(a + b - 1, b); } template<typename T> inline T round(T a, T b) { return floor(a + b / 2, b); } template<typename T> inline T mod(T a, T b) { return a - floor(a, b) * b; } template<typename T> inline T factorial(T n) { return n <= 1 ? 1 : factorial(n - 1) * n; } template<typename T> inline T square(T n) { return n * n; } template<typename T> inline T cube(T n) { return n * n * n; } template<typename T> inline T norm(T x1, T y1, T x2, T y2) { return square(x1 - x2) + square(y1 - y2); } inline long long sqrt(long long n) { return sqrt((long double)n); } int main() { int n, g = 100; cin >> n; vector<int> a(n); cin >> a; for (int& i : a) g = gcd(g, i); cout << 100 / g << endl; }