#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 2000001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int x;
cin >> x;
int n;
cin >> n;
int sm = x;
for (; n > 0; n--)
{
int t;
cin >> t;
sm += x - t;
}
cout << sm << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Unexpected end of file - int32 expected |
2 |
Incorrect |
4 ms |
384 KB |
Unexpected end of file - int32 expected |
3 |
Incorrect |
5 ms |
384 KB |
Unexpected end of file - int32 expected |
4 |
Incorrect |
5 ms |
384 KB |
Unexpected end of file - int32 expected |
5 |
Incorrect |
5 ms |
384 KB |
Unexpected end of file - int32 expected |
6 |
Incorrect |
4 ms |
384 KB |
Unexpected end of file - int32 expected |
7 |
Incorrect |
5 ms |
384 KB |
Unexpected end of file - int32 expected |
8 |
Incorrect |
5 ms |
384 KB |
Unexpected end of file - int32 expected |
9 |
Incorrect |
5 ms |
384 KB |
Unexpected end of file - int32 expected |
10 |
Incorrect |
4 ms |
384 KB |
Unexpected end of file - int32 expected |