oj.uz

Submission #510026

# Submission time Handle Problem Language Result Execution time Memory
510026 2022-01-14T14:14:25 Z NeroZein Tarifa (COCI16_tarifa) C++17
50 / 50
 1 ms 204 KB 
#include <bits/stdc++.h>
#define endl "\n"
#define sz = s.size()
using ll = long long;
const int Z = 1e6+9;
const int INF = 1e9+9;
const int mod = 1e9+7;
using namespace std;
ll fp (ll x , ll y){
    if (y == 0) return 1;
    if (y == 1) return x;
    ll ret = fp(x , y/2) % mod;
    if (y % 2) ret *= x;
    return ret;
}
ll x , n , mn , mx , sum , ans , dif , t , k ;
int main(){

    ios::sync_with_stdio(0);cin.tie(NULL);

    cin >> x >> n;
    x *= (n+1);
    for (int i = 0; i < n; i++){
        cin >> ans ;
        x -= ans;
    }
    cout << x << endl ;
    return 0 ;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct