/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 536.0 KiB
#2 Accepted 1ms 344.0 KiB
#3 Accepted 1ms 536.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Accepted 1ms 436.0 KiB
#7 Accepted 1ms 536.0 KiB
#8 Accepted 1ms 304.0 KiB
#9 Accepted 1ms 544.0 KiB
#10 Accepted 1ms 532.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define int             long long
#define pb              push_back
#define endl            '\n'
#define ff              first
#define ss              second
#define debug           cout<<"HERE"<<endl;
void edm()
{
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("outputtt.txt","w",stdout);
    #endif
}
void solve()
{
    string s;cin>>s;
    vector<int>v;
    int n;cin>>n;
    string cur = "";
    for(auto i:s)
    {
        if(i=='.')
        {
            if(cur.size())
            {
                int nn = stoll(cur);
                v.pb(nn);
            }
            cur = "";
            break;
        }
        else if(i!='+')
        {
            cur+=i;
        }
        else
        {
            if(cur.size())
            {
                int nn = stoll(cur);
                v.pb(nn);
            }
            cur = "";
        }
    }
    if(v.size()==1)
    {
        v.pb(v[0]+1);
    }
    int d = v[1] - v[0];
    int nth = v[0] + (n-1)*d;
    int sum = n * (v[0] + nth);
    sum = sum/2;
    // int sum = ((2*v[0] + (n-1)*d) * n)/2;
    cout<<sum<<endl;
}
int32_t main()
{
    //edm();
    int t = 1;
    // cin>>t;
    for(int i=1;i<=t;i++)
    {
        solve();
    }
}

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 15:53:57
Judged At
2025-09-02 15:53:57
Judged By
Score
100
Total Time
1ms
Peak Memory
544.0 KiB