oj.uz

답안 #167569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
167569 2019-12-09T02:44:37 Z Flying_dragon_02 Tarifa (COCI16_tarifa) C++14
50 / 50
 2 ms 504 KB 
#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;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct