/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 364.0 KiB
#3 Wrong Answer 1ms 532.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
// const int MOD = 998244353;
const int N = 1e6 + 9;
//    const uint M=(1<<31)

// int pref_xor[N];

// int a[N];
// int cnt[30][2];
//    vector<int>v(n);
//    bitset<M>a;

// vector<int> v(n + 1);
// bool vis[N];

void pari_na_kisu()

{
    string s;
    cin >> s;
    int n;
    cin >> n;
    int x = s[0] - '0';
    int x1 = s[2] - '0';
    int d = x1 - x;
    //cout<<2*x<<'\n';
    int z = (2 * x) + ((n - 1) * d);
    int res = ((n*z) / 2) ;
    cout << res << '\n';
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    // cout << "Case " << (++cs) << ": ";
    pari_na_kisu();
}

Information

Submit By
Type
Submission
Problem
P1231 Busy Friend
Contest
LUCC Presents Intra LU Junior Programming Contest - Replay
Language
C++17 (G++ 13.2.0)
Submit At
2025-09-02 16:34:08
Judged At
2025-09-02 16:34:08
Judged By
Score
10
Total Time
1ms
Peak Memory
532.0 KiB