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