Test Cases
CPU | Memory | Verdict | |||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 4 ms | 3412 kb | Accepted | ||||||||
2 | 4 ms | 3520 kb | Accepted | ||||||||
3 | 4 ms | 3440 kb | Accepted | ||||||||
4 | 4 ms | 3264 kb | Accepted | ||||||||
5 | 4 ms | 3488 kb | Accepted | ||||||||
6 | 5 ms | 3436 kb | Accepted | ||||||||
Source Code
program.cpp
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll brouteForces(ll n,ll a,ll b,ll c) { if(n<=1)return c; return a+b+brouteForces(n-1,a,b,c); } ll optimize(ll n,ll a,ll b,ll c) { ll ans=((n-1)*a)+((n-1)*b)+c; return ans; } void solve(ll t) { ll n,a,b,ans; cin >> a >> b; ans = a + b; cout << ans << "\n"; } int main() { //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); ll t,i; ll a,b; cin >> a >> b; cout << (a+b) << "\n"; return 0; }