Submission #2229666
Source Code Expand
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <list>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define FOR(i, m, n) for(int i = int(m);i < int(n);i++)
#define REFOR(i, m, n) for(int i = int(n - 1);i >= int(m);i--)
#define REP(i,n) for(int i = 0; i < int(n); i++)
#define REREP(i,n) for(int i = int(n - 1); i >= 0; i--)
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define PAIR pair<int,int>
#define MP make_pair
#define VP vector<pair<int,int>>
#define VS vector<string>
#define MAP map<int,int>
#define QUE queue<int>
#define DEQ deque<int>
#define PQUE priority_queue<int> //5,5,4,3,3,2,...
#define REPQUE priority_queue<int, vector<int>, greater<int>> //1,1,2,3,4,4,5,...
#define SUM(obj) accumulate((obj).begin(), (obj).end(), 0)
#define SORT(obj) sort((obj).begin(), (obj).end()) // 1,2,3,4,5...
#define RESORT(obj) sort((obj).begin(), (obj).end(), greater<int>()) // 5,4,3,2,1...
#define UB(obj,n) upper_bound((obj).begin(), (obj).end(), n) //itr > n
#define LB(obj,n) lower_bound((obj).begin(), (obj).end(), n) //itr>= n
const ll MOD = (ll)1e9 + 7;
const ll INF = (ll)1e17;
int gcd(int a, int b) {
if (a == 0 || b == 0) return 0;
if (a < b) swap(a, b);
while (b != 0) {
a = a%b;
swap(a, b);
}
return a;
}
int lcm(int a, int b) {
if (a == 0 || b == 0) return 0;
return a / gcd(a, b)*b;
}
vector<bool> Eratosthenes(int N) {
vector<bool> Eratosthenes(N + 1, true);
Eratosthenes[0] = false;
if (N == 0) return Eratosthenes;
Eratosthenes[1] = false;
for (int i = 1; i*i <= N; i++) if (Eratosthenes[i]) for (int j = 2 * i; j <= N; j += i) Eratosthenes[j] = false;
return Eratosthenes;
}
bool pcheck(int N) {
if (N == 0 || N == 1) return false;
for (int i = 2; i*i <= N; i++) if (N % i == 0) return false;
return true;
}
////combination mod-------------------------------------------------------------------------
//
//vector<ll> f;//erase this line when you use!
//
////vector including modulus of N!
//vector<ll> factorial(ll N, ll quotient) {
// vector<ll> factorial(N + 1, 1);
// for (ll i = 1; i <= N; i++) {
// factorial[i] *=factorial[i - 1]*i;
// factorial[i] %= quotient;
// }
// return factorial;
//}
//
////repeat square method y = x^n mod quotient
//ll rsm(ll x,ll n,ll quotient){
// ll y = 1;
// while (n > 0) {
// if ((n & 1) == 1) {
// y *= x;
// y %= quotient;
// }
// x *= x;
// x %= quotient;
// n >>= 1;
// }
// return y;
//}
//
////modulus of nCk - combination mod
//ll nCk(ll n, ll k, ll quotient) {
//
// ll nCk = (f[n] % quotient);
// nCk *= rsm(f[k], quotient - 2, quotient);
// nCk %= quotient;
// nCk *= rsm(f[n - k], quotient - 2, quotient);
// return (nCk % quotient);
//}
////------------------------------------------------------------
////union-find---------------------------------------------------
//int node[10];
//
//int root(int n) {
// if (node[n] == n) return n;
// else return node[n] = root(node[n]);
//}
//
//void unite(int n, int m) {
// if (n > m) swap(n, m);
// n = root(n);
// m = root(m);
// if (n == m) return;
// else node[m] = n;
//}
//-------------------------------------------------------------
//void dijkstra(int start) {
// priority_queue<PAIR, vector<PAIR>, greater<PAIR>> pq;
// dist[start][start] = 0;
// pq.push({ 0,start });
// while (!pq.empty()) {
// int from = pq.top().second;
// pq.pop();
// REP(i, edge[from].size()) {
// int to = edge[from][i].first;
// if (dist[start][to] > dist[start][from] + edge[from][i].second) {
// dist[start][to] = dist[start][from] + edge[from][i].second;
// pq.push({ dist[start][from] + edge[from][i].second,to });
// }
// }
// }
//}
void ANS(bool flag) {
cout << ((flag) ? "YES" : "NO") << endl;
}
void Ans(bool flag) {
cout << ((flag) ? "Yes" : "No") << endl;
}
void ans(bool flag) {
cout << ((flag) ? "yes" : "no") << endl;
}
int main() {
int N;
cin >> N;
VI T(N);
REP(i, N) cin >> T[i];
cout << *min_element(T.begin(), T.end()) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - おいしいたこ焼きの食べ方 |
User |
ningenMe |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4533 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
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 |