# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167569 | Flying_dragon_02 | Tarifa (COCI16_tarifa) | C++14 | 2 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair< int, int > ii;
const int N = 1e2 + 5;
int x, n, p[N], sum;
int main() {
cin.tie(0), ios_base::sync_with_stdio(0);
cin >> x >> n;
for(int i = 1; i <= n; i++) {
cin >> p[i];
sum += x;
sum -= p[i];
}
cout << sum + x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |