/ SeriousOJ /

Record Detail

Wrong Answer


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

Code


/*
 *  Copyright (c) 2025 Parag Kishor Shornob
 *   All rights reserved.
 */
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< string > vi;
typedef pair<int,int> pii;

#define yes "YES\n"
#define no "NO\n"
#define pb push_back
#define pop pop_back
#define fastin ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define input(v) for(auto &i  : v) cin>>i;
#define all(x) (x).begin(),(x).end()

char ee = '\n';
void printVec(vector<string> &a){
    for(auto pp : a) cout<<pp <<" " ;
    cout<<ee;
}
ll power(ll base , ll exp){
    ll result=1;
    while(exp>0){
       if(exp%2==1){
        result *=base;
       }
       base  *=base ;
       exp/=2;

    }
    return result;

}

void  solve(){
    string s ; cin>>s ;
    ll a = s[0]-'0';
    ll b = s[2]-'0';
    ll n ; cin>>n ;
    ll ans =a;
    ll d= b-a;
    ll sum =a;
    cout<<a<<" " <<b<< ee;
    for(int i = 1 ; i<n ; i++){

        ans  +=d ;
    sum+=ans;
    //cout<<"sum" <<sum<<ee;

       }

    cout<<sum<<ee;


}

signed main() {
    fastin;
    ll tt=1 ;
   //cin>> tt;
    while(tt--) solve();


}

Information

Submit By
Type
Submission
Problem
P1231 Busy Friend
Contest
LUCC Presents Kick & Code Intra LU Programming Contest
Language
C++17 (G++ 13.2.0)
Submit At
2025-09-01 07:00:18
Judged At
2025-09-01 07:00:18
Judged By
Score
0
Total Time
1ms
Peak Memory
532.0 KiB