Compare text

Find the difference between two text files

Real-time editor

Hide unchanged lines

Disable line wrap

Layout

Diff precision

Syntax highlighting

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

okcoder30-RMNTREV-TLE-Fix

Created 4 years agoDiff never expires

4 removals

Lines
Total
Removed

Characters
Total
Removed

To continue using this feature, upgrade to Diffchecker Pro View Pricing

66 lines

3 additions

Lines
Total
Added

Characters
Total
Added

To continue using this feature, upgrade to Diffchecker Pro View Pricing

67 lines

#include<bits/stdc++.h>

using namespace std;

#define ff first

#define ss second

#define int long long

#define pb push_back

#define pii pair<int,int>

#define vi vector<int>

#define mii map<int,int>

#define pqb priority_queue<int>

#define pqs priority_queue<int,vi,greater<int> >

#define setbits(x) __builtin_popcountll(x)

#define zrobits(x) __builtin_ctzll(x)

#define inf 1e18

#define ps(x,y) fixed<<setprecision(y)<<x

#define mk(arr,n,type) type *arr=new type[n];

#define f(x) int x; cin>>x; while(x--)

#define rep(i,a,b) for (long long i=a;i<b;i++)

#define rof(i,a,b) for (int i=(a-1);i>=b;i--)

#define multiply(n) ((n*(n+1))/2)

#define BLOCK 555

#define sz(x) (int)(x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setIO(string name = "") {

ios_base::sync_with_stdio(0); cin.tie(0);

if(sz(name)){

freopen((name+".in").c_str(), "r", stdin);

freopen((name+".out").c_str(), "w", stdout);

}

void solve()

{

int n,k;

cin>>n>>k;

k=min(k,n);

string s;

cin>>s;

vector<int>v;

string res="";

int i=0;

while(i<k/2){

res=s[i]+res;

res += s[i];

res=s[k-i-1]+res;

res += s[k-i-1];

i++;

}

reverse(res.begin(), res.end());

if (k % 2!=0)

res=s[i]+res;

for (int i=k;i<n;i++)

{

res+=s[i];

}

cout<<res<<endl;

}

int32_t main()

{

int t;

cin>>t;

rep(i,0,t)

solve();

return 0;

}

Saved diffs

Original text

Open file

#include<bits/stdc++.h>
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define f(x)            int x; cin>>x; while(x--)
#define rep(i,a,b)      for (long long i=a;i<b;i++)
#define rof(i,a,b)		for (int i=(a-1);i>=b;i--)
#define multiply(n)     ((n*(n+1))/2)
#define BLOCK           555
#define sz(x) (int)(x).size()
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

void setIO(string name = "") { 
    ios_base::sync_with_stdio(0); cin.tie(0); 
    if(sz(name)){
        freopen((name+".in").c_str(), "r", stdin); 
        freopen((name+".out").c_str(), "w", stdout);
    }
}

void solve()
{
    int n,k;
    cin>>n>>k;
    k=min(k,n);
    string s;
    cin>>s;
    vector<int>v;
    string res="";
    int i=0;
    while(i<k/2){
        res=s[i]+res; 
        res=s[k-i-1]+res;
        i++;
    }
    if (k % 2!=0)
        res=s[i]+res;
    for (int i=k;i<n;i++)
    {
        res+=s[i];
    }
    cout<<res<<endl;
}
int32_t main()
{
    int t;
    cin>>t;
    rep(i,0,t)
        solve();
    return 0;
}

Changed text

Open file

#include<bits/stdc++.h>
using namespace std;

void solve()
{
    int n,k;
    cin>>n>>k;
    k=min(k,n);
    string s;
    cin>>s;
    vector<int>v;
    string res="";
    int i=0;
    while(i<k/2){
        res += s[i]; 
        res += s[k-i-1];
        i++;
    }
    reverse(res.begin(), res.end());
    if (k % 2!=0)
        res=s[i]+res;
    for (int i=k;i<n;i++)
    {
        res+=s[i];
    }
    cout<<res<<endl;
}
int32_t main()
{
    int t;
    cin>>t;
    rep(i,0,t)
        solve();
    return 0;
}