제출 #1157312

#제출 시각아이디문제언어결과실행 시간메모리
1157312tamzidTarifa (COCI16_tarifa)C++20
50 / 50
0 ms328 KiB
#include <bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> using ll = long long; #define pb push_back #define F first #define S second #define vii vector<int> #define vl vector<long long> #define cinv(v) for (auto &it : v) cin >> it; #define coutv(v) for (auto &it : v) cout<<it<<" ";cout<<endl; using namespace std; using namespace __gnu_pbds; template<class T> using ordset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; void solve() { int x,n; cin>>x>>n; int ans = (n+1)*x; for(int i=0;i<n;++i) { int y; cin>>y; ans-=y; } cout<<ans; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); //int t;cin>>t;while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...