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

Untitled diff

Created 11 years agoDiff never expires

2 removals

Lines
Total
Removed

Characters
Total
Removed

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

77 lines

2 additions

Lines
Total
Added

Characters
Total
Added

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

77 lines

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <string>

#include <map>

#include <set>

#include <vector>

#include <algorithm>

#include <queue>

#include <bitset>

#include <stack>

#include <iostream>

#include <fstream>

#include <cmath>

#define sqr(a) ((a)*(a))

#define odd(a) ((a)&1)

#define foru(i,n) for (int i=0;i<(n);i++)

#define ford(i,n) for (int i=(n)-1;i>=0;i--)

#define forab(i,l,r) for (int i=(l);i<=(r);i++)

#define forabd(i,r,l) for (int i=(r);i>=(l);i--)

#define F first

#define S second

#define all(x) x.begin(),x.end()

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

#define pii pair<int,int>

#define pb push_back

#define mp make_pair

#define ll long long

const double eps=1e-19;

const double PI=acos(-1.0);

const int INF=1000*1000*1000+7;

const int MAXN = 100500;

using namespace std;

struct ver{

int pr;

long long sum_kv;

long long sum_way;

long long kol;

long long rast;

};

int n;

vector< pii > g[MAXN];

ver a[MAXN];

long long ans;

vector<int> mas_ans;

int va, vb, vc;

int main()

{

//freopen("bfs.in", "r", stdin);

//freopen("bfs.out", "w", stdout);

//Vot tut problema

scanf("%d", &n);

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

{

scanf("%d%d%d", &va, &vb, &vc);

if(i%100==0)

printf("%d\n", i);

//va--; vb--;

//g[va].pb(mp(vb,vc));

//g[vb].pb(mp(va,vc));

}

//printf("%d\n", mas_ans.size());

//for (int i=0; i<sz(mas_ans); i++)

// printf("%d ", mas_ans[i]+1);

puts("ok");

return 0;

}

Saved diffs

Original text

Open file

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <iostream>
#include <fstream>
#include <cmath>
 
#define sqr(a) ((a)*(a))
#define odd(a) ((a)&1)
#define foru(i,n) for (int i=0;i<(n);i++)
#define ford(i,n) for (int i=(n)-1;i>=0;i--)
#define forab(i,l,r) for (int i=(l);i<=(r);i++)
#define forabd(i,r,l) for (int i=(r);i>=(l);i--)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(__X) (int)__X.size()
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define ll long long
 
const double eps=1e-19;
const double PI=acos(-1.0);
const int INF=1000*1000*1000+7;
const int MAXN = 100500;
 
using namespace std;
 
struct ver{
    int pr;
    long long sum_kv;
    long long sum_way;
    long long kol;
    long long rast;
};
 
int n;
vector< pii > g[MAXN];
ver a[MAXN];
long long ans;
vector<int> mas_ans;
int va, vb, vc;
 
int main()
{
        //freopen("bfs.in", "r", stdin);
        //freopen("bfs.out", "w", stdout);
                
        //Vot tut problema
 
        scanf("%d", &n);
        for (int i=1; i<n; i++)
        {
            scanf("%d%d%d", &va, &vb, &vc);

printf("%d\n", i);
 
            //va--; vb--;
            //g[va].pb(mp(vb,vc));
            //g[vb].pb(mp(va,vc));
        }
        
        //printf("%d\n", mas_ans.size());
        //for (int i=0; i<sz(mas_ans); i++)
    //    printf("%d ", mas_ans[i]+1);
    puts("ok");
        return 0;
}

Changed text

Open file