eolymp
bolt
Try our new interface for solving problems
Problems

Lost card

published at 6/15/18, 9:33:36 pm

Пока задача проверялась аж ладошки вспотели -_-

published at 2/16/24, 7:30:47 am

n, *cards = map(int, input().split()) total_sum = sum(cards) expected_sum = n * (n + 1) // 2 missing_card = expected_sum - totalsum print(missingcard)

published at 2/16/24, 7:58:58 am

include <bits/stdc++.h>

using namespace std; int main () { int k=0,n,a,d; cin>>n; d=n-1; for (int i=1;i<=n;i++) { k=k+i; } while (d--) { cin>>a; k=k-a; } cout<<k; }