Submission #55255357

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<algorithm>
#include<array>
#include<cmath>
#include<cstring>
#include<iostream>
#include<map>
#include<set>
#include<queue>
#include<vector>
using namespace std;
#define int long long
#define fi first
#define se second
#define pu push_back
#define endl "\n"
typedef pair<int, int> PII;
const int mod=998244353,MOD=1e9+7;
const int N=1e6+10;
bool cmp(PII l,PII r){ if(l.fi!=r.fi) return l.fi<r.fi; else return l.se<r.se;}
int gad(int a,int b){  return b?gad(b,a%b):a;}
map<int,int> mp1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<algorithm>
#include<array>
#include<cmath>
#include<cstring>
#include<iostream>
#include<map>
#include<set>
#include<queue>
#include<vector>
using namespace std;
#define int long long
#define fi first
#define se second
#define pu push_back
#define endl "\n"
typedef pair<int, int> PII;
const int mod=998244353,MOD=1e9+7;
const int N=1e6+10;
bool cmp(PII l,PII r){ if(l.fi!=r.fi) return l.fi<r.fi; else return l.se<r.se;}
int gad(int a,int b){  return b?gad(b,a%b):a;}
map<int,int> mp1;
int n,k;
void solve(){
    int a;
     cin>>n>>k>>a;
     for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        if(i==k){
        cout<<x<<' ';
    cout<<a<<' ';
     }else{
        cout<<x<<' ';
     }
     }
     

} 
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    //cin>>t; 
    while(t--){
        solve();
    }
    return 0;
}        

Submission Info

Judge Result