text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << (X%T == 0? T+X:X-T);
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int a,b; cin>>a>>b;
if(b%a==0) cout<<a+b<<endl;
else cout <<b-a<<endl;
}
|
#include <cstdio>
int main(){
int L,min=233,ans=0; scanf("%d",&L);
for (int i=0;i<20;i++) if ((1<<i)&L) min=i,ans++;
ans+=min*2; if (min==19) ans--;
printf("20 %d\n",ans);
for (int i=1;i<=min;i++) printf("%d %d %d\n%d %d %d\n",i,i+1,0,i,i+1,1<<i-1);
int x=min==19?524288:0;
for (int i=0;i<19;i++) if (1<<i&L) printf("%d %d %d\n",i+1,20,x),x+=1<<i;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
void print3(int x, int y, int z) {
printf("%d %d %d\n",x,y,z);
}
int main() {
int l;
cin >> l;
int n = 0;
while(l >= (1 << n)) {
n++;
}
int m = (n-1)*2 + __builtin_popcount(l) - 1;
cout << n << " " << m << endl;
rep(i,1,n) {
print3(i,i+1,0);
print3(i,i+1,1<<(i-1));
}
int k = l;
rep(i,0,n-1) {
if (l & (1 << i)) {
k -= (1<<i);
print3(i+1,n,k);
}
}
return 0;
}
|
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
struct edge {
int src;
int dst;
int cost;
};
int main() {
int L, N, M;
cin >> L;
vector< edge > e;
N = floor(log2(L)) + 1;
M = 0;
for (int i = 1; i < N; i++) {
e.push_back((edge){i, i + 1, 0});
e.push_back((edge){i, i + 1, int(pow(2, i - 1))});
M += 2;
}
for (int i = N - 1; i >= 1; i--) {
if (L - pow(2, N - 1) >= pow(2, i - 1)) {
e.push_back((edge){i, N, int(L - pow(2, i - 1))});
L -= pow(2, i - 1);
M++;
}
}
cout << N << " " << M << endl;
for (int i = 0; i < M; i++) {
cout << e[i].src << " " << e[i].dst << " " << e[i].cost << endl;
}
}
|
#include <stdio.h>
int main(){
int L;
int n,e=0;
scanf("%d",&L);
for(n=0;L>=2<<n;n++)
if(L&1<<n)
e++;
printf("%d %d\n",n+1,e+2*n);
e=0;
for(int i=0;L>=2<<i;i++){
printf("%d %d %d\n",i+1,i+2,0);
printf("%d %d %d\n",i+1,i+2,1<<i);
if(L&1<<i){
printf("%d %d %d\n",i+1,n+1,(1<<n)+((1<<i)-1)&L);
// printf("%d %d %d\n",i+1,n+1,(1<<n)+e);
e+=1<<i;
}
}
}
|
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll p2[50] = {};
ll pow2(ll n){
if(n==0 || n==1) return n+1;
if(p2[n] != 0) return p2[n];
else return pow2(n/2)*pow2(n/2)*pow2(n-2*(n/2));
}
int main()
{
ll l,n=0,m=0,k[30];
cin >> l;
while(pow2(n)<=l) n++;
m=2*(n-1);
for(ll i=0;i<n;i++){
k[i]=(l%pow2(i+1)-l%pow2(i))/pow2(i);
if(i<n-1 && k[i]==1) m++;
}
cout<< n << " " << m<<endl;
for(ll i=1;i<n;i++) cout<< i << " " << i+1 << " " << 0 << endl << i << " " << i+1 << " " << pow2(n-i-1) << endl;
for(ll i=0;i<n-1;i++){
if(k[i]==1) cout<< 1 << " " << n-i << " " << l-l%pow2(i+1) << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll l;
struct edge {
ll from,to,weight;
edge(ll from, ll to, ll weight) : from(from), to(to), weight(weight){}
};
int main(void) {
cin >> l;
vector<edge> e;
ll cnt;
ll max_n=0;
for(cnt=1;(1LL<<cnt)<=l;cnt++){
e.push_back(edge(cnt,cnt+1,0));
e.push_back(edge(cnt,cnt+1,(1LL<<cnt-1)));
max_n+=1LL<<cnt-1;
}
ll cur;
while(max_n!=l-1){
cur=log2(l-max_n-1)+1;
DEBUG{
cout << cur << endl;
}
e.push_back(edge(cur,cnt,max_n+1));
max_n+=(1LL<<cur-1);
}
cout << cnt << " " << e.size() << endl;
for(auto x:e){
printf("%lld %lld %lld\n",x.from, x.to, x.weight);
}
return 0;
}
|
#include <bits/stdc++.h>
#define INF (1<<30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int main(){
int l;
cin >> l;
int cnt = 0;
int k;
for( k = 0; (1<<k) <= l; k++ ){
if( (1<<k) & l ){
++cnt;
}
}
cout << k << " " << 2*(k-1)+cnt-1 << endl;
for( int i = 0; i < k-1; ++i ){
cout << i+1 << " " << i+2 << " " << (1<<i) << endl;
cout << i+1 << " " << i+2 << " " << 0 << endl;
}
int herum = l;
for( int i = 0; i < k-1; ++i ){
if( (1<<i) & l ){
herum -= (1<<i);
cout << i+1 << " " << k << " " << herum << endl;
}
}
return 0;
}
|
// I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
}
signed main(){
init_io();
ll l,n=0;
cin >> l;
vector<TP> ans;
ll r=1,c=0,rc=1;
while(r<=l){
r*=2;
c++;
}
r/=2;
c--;
for(int i=0;i<c;i++){
n++;
ans.push_back(TP(n,n+1,0));
ans.push_back(TP(n,n+1,rc));
rc*=2;
}
ll v = r;
n++;
rc/=2;
for(int i=n-2;i>=0;i--){
//cout << l<<"de "<<r<<" "<<rc<<endl;
if(l-r>=rc){
ans.push_back(TP(i+1,n,v));
v+=rc;
l-=rc;
}
rc/=2;
}
cout << n <<" "<<ans.size()<<endl;
for(auto tp:ans){
cout << get<0>(tp)<<" "<<get<1>(tp)<<" "<<get<2>(tp)<<endl;
}
}
|
// https://atcoder.jp/contests/abc108/tasks/arc102_b
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DUMP(a, n) REP(_i, n) printf("%d%c", a[_i], _i + 1 == n ? '\n' : ' ')
#define DUMP2D(a, n, m) REP(_i, n) REP(_j, m) printf("%d%c", a[_i][_j], _j + 1 == m ? '\n' : ' '); puts("")
const int L_MAX = 1e6;
const int N_MAX = 20;
int L;
int N;
int M;
int bs[N_MAX];
struct edge { int from, to, len; };
vector<edge> es;
void solve() {
N = 0, M = 0;
for (int l = L; l > 0; l >>= 1) {
bs[N++] = l & 1;
}
int k = L;
REP(i, N - 1) {
es.push_back({i + 1, i + 2, 0});
es.push_back({i + 1, i + 2, 1 << i});
if (bs[i]) {
k ^= 1 << i;
es.push_back({i + 1, N, k});
}
}
M = es.size();
printf("%d %d\n", N, M);
REP(i, M) printf("%d %d %d\n", es[i].from, es[i].to, es[i].len);
}
void input() {
scanf("%d", &L);
}
int main() {
input();
solve();
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<functional>
#include<map>
#include<cstdlib>
#include<complex>
#include<numeric>
#include<set>
#include<deque>
#include<queue>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Int L;
cin >> L;
L--;
Int k = 1;
vector<vector<Int>> ans;//from, to , 重み
while (true) {
if ((1LL<<k)-1<=L) {
ans.push_back({ k,k + 1,0 });
ans.push_back({ k,k + 1,1LL<<(k-1) });
k++;
}
else {
break;
}
}
Int rest = L - ((1LL << (k-1)) - 1);//残り通り数
for (Int i = 25; i >= 0; i--) {
if (rest>=(1LL<<i)) {
ans.push_back({ i + 1,k,L - (1LL << i) + 1 });
rest -= (1LL << i);
L -= (1LL << i);
}
}
Int len = ans.size();
cout << k << " " << len << "\n";
for (Int i = 0; i < len; i++) {
cout << ans[i][0]<<" "<<ans[i][1]<<" "<<ans[i][2] << "\n";
}
}
|
#include <bits/stdc++.h>
#define sp ' '
#define nyan "(=^・ω・^=)"
#define mkp make_pair
#define intmax 2147483647
#define llmax 9223372036854775807
#define lP pair<ll,ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
const int mod = 1000000007;
int L, t;
vector<pair<pair<int, int>, int>>v;
int main() {
cin >> L;
for (int i = 1; i != 19; ++i) {
v.push_back(mkp(mkp(i, i + 1), 0));
v.push_back(mkp(mkp(i, i + 1), 1 << (i - 1)));
}
if (L&(1 << 19)) {
v.push_back(mkp(mkp(19, 20), 0));
v.push_back(mkp(mkp(19, 20), 1 << 18));
t += 1 << 19;
}
for (int i = 19; i; --i) {
if (L&(1 << i - 1)) {
v.push_back(mkp(mkp(i, 20), t));
t += 1 << i - 1;
}
}
cout << 20 << sp << v.size() << endl;
for (int i = 0; i != v.size(); ++i)
cout << v[i].first.first << sp << v[i].first.second << sp << v[i].second << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
typedef long long ll;
int main(){
int l; cin >> l;
vector<tuple<int, int, int>> ans;
int r = log2(l);
for(int i = 1; i <= r; i++){
ans.push_back(make_tuple(i, i+1, 0));
ans.push_back(make_tuple(i, i+1, 1<<(i-1)));
}
for(int i = r; i >= 1; i--){
int a = l - (1<<(i-1));
if(a < (1<<r)) continue;
ans.push_back(make_tuple(i, r+1, a));
l = a;
}
int n = r+1;
int m = ans.size();
cout << n << " " << m << endl;
for(auto t : ans) cout << get<0>(t) << " " << get<1>(t) << " " << get<2>(t) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long i = 0; i < n; i++)
#define erep(i, n) for(long i = 1; i <= n; i++)
const long MOD = 1000000007;
#define all(a) a.begin(), a.end()
#define show(ans) cout << ans << endl;
int main() {long L;
cin >> L;
vector<long> ans1, ans2, ans3;
long r = 1;
while(pow(2, r) <= L) r++;
r--;
erep(i, r){
ans1.push_back(i); ans2.push_back(i+1); ans3.push_back(0);
ans1.push_back(i); ans2.push_back(i+1); ans3.push_back(pow(2, i-1));
// cout << i << ' ' << i+1 << ' ' << 0 << endl;
// cout << i << ' ' << i+1 << ' ' << pow(2, i-1) << endl;
}
long X = L - (pow(2, r));
long tmp = pow(2, r);
for(long i = r-1; i >= 0; i--){
if((1 << i) & X){
// cout << i+1 << ' ' << r+1 << ' ' << tmp << endl;
ans1.push_back(i+1); ans2.push_back(r+1); ans3.push_back(tmp);
tmp += pow(2, i);
}
}
cout << r+1 << ' ' << ans1.size() << endl;
rep(i, ans1.size()){
cout << ans1[i] << ' ' << ans2[i] << ' ' << ans3[i] << endl;
}
// show(ans);
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int l;
const int n = 20;
int m = 0;
vector<int> et[n];
vector<int> ec[n];
int main() {
int i, j;
cin >> l;
int mul = 1;
for (i = n - 2; i >= 1; i--) {
et[i].push_back(i + 1);
ec[i].push_back(mul);
et[i].push_back(i + 1);
ec[i].push_back(0);
mul *= 2;
m += 2;
}
int offset = 0;
for (i = 1; i < n; i++) {
mul = (1 << (n - 1 - i));
while (offset + mul <= l) {
et[0].push_back(i);
ec[0].push_back(offset);
offset += mul;
m++;
}
}
cout << n << " " << m << endl;
for (i = 0; i < n; i++) {
for (j = 0; j < et[i].size(); j++) {
cout << i + 1 << " " << et[i][j] + 1 << " " << ec[i][j] << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
//#undef int
#define mk make_pair
#define pb push_back
typedef pair<int, int> pii;
const int mod = 1000000007;
const int INF = 1000000009;
const long long INFL = 1000000000000000018ll;
int L;
signed main()
{
cin >> L;
int n = 1, cnt = 0ll;
while(n <= L){
n *= 2;
cnt++;
}
n /= 2;
int l = L;
int M = 0ll;
while(l){
if(l & 1ll){
M++;
}
l >>= 1;
}
printf("%lld %lld\n", cnt, M - 1 + (cnt - 1) * 2);
int a = 1;
for(int i = 1; i < cnt; i++){
printf("%lld %lld %lld\n", i, i + 1, a);
printf("%lld %lld %lld\n", i, i + 1, 0);
a *= 2ll;
}
l = L;
for(int i = cnt - 2; i >= 0; i--){
if(L & (1ll << i)){
printf("%lld %lld %lld\n", i + 1, cnt, L - (1ll << i));
L -= (1ll << i);
}
}
return 0;
}
/*
*/
|
// review
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
ll l;
void solve() {
int n = 0;
while (l >= pow(2, n)) {
n++;
}
vector<vector<ll> > v;
for (int i=1;i<n;i++) {
v.push_back({i, i+1, (ll)pow(2, i-1)});
v.push_back({i, i+1, 0});
}
for (int i=n-1;i>0;i--) {
if (l - pow(2, i-1) >= pow(2, n-1)) {
v.push_back({i, n, (ll)(l - pow(2, i-1))});
l -= pow(2, i-1);
}
}
cout << n << " " << v.size() << endl;
for (int i=0;i<v.size();i++) {
cout << v[i][0] << " " << v[i][1] << " " << v[i][2] << endl;
}
}
int main() {
cin >> l;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mod=1e9+7;
int main(){
int l;
cin>>l;
int ansnode=0;
vector <pair<P,int>> ansv;
int kasu=l;
int longe=floor(log2(l));
int cnt=0;
while(cnt<longe){
ansv.push_back({{cnt+1,cnt+2},0});
ansv.push_back({{cnt+1,cnt+2},pow(2,cnt)});
cnt++;
}
ansnode=cnt+1;
int mpass=ansnode-1;
int mainpass=pow(2,longe);
while(kasu>mainpass){
if(kasu-pow(2,mpass)>=mainpass){
ansv.push_back({{mpass+1,ansnode},kasu-pow(2,mpass)});
kasu=kasu-pow(2,mpass);
}
mpass--;
}
cout << ansnode << " " <<ansv.size() <<endl;
rep(i,ansv.size()){
cout << ansv[i].F.F << " " <<ansv[i].F.S << " " << ansv[i].S << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,l;
cin >> l;
int x = 0;
int nn = l;
while(nn>0){
x++;
nn >>= 1;
}
n = x;
m = 0;
vector<vector<pair<int, int>>> G(n);
for(int i = 1; i < n;i++){
G[i].push_back({i + 1, 1 << (i-1)});
G[i].push_back({i + 1, 0});
m += 2;
}
for(int i = n-1; i >= 1;i--){
if(l - (1<<(i-1))>=1<<(x-1)){
m++;
G[i].push_back({n, l - (1 << (i-1))});
l -= 1 << (i-1);
}
}
printf("%d %d\n", n, m);
for(int i = 1; i < n; i++) {
for(pair<int,int> p:G[i]){
printf("%d %d %d\n", i, p.first, p.second);
}
}
return 0;
}
|
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <map>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
struct edge{ll from, to, weight;};
int main(){
ll L;
cin >> L;
ll N = floor(log2(L))+1;
vector<edge> E;
for(ll i = 1; i <= N-1; i++){
edge e;
e.from = i, e.to = i+1, e.weight = 1<<(i-1);
E.push_back(e);
e.weight = 0;
E.push_back(e);
}
ll max = (1<<(N-1)) - 1;
while(max!=L-1){
edge e;
e.from = floor(log2(L-max-1))+1, e.to = N; e.weight = max+1;
E.push_back(e);
max += 1<<(e.from-1);
}
cout << N << " " << E.size() << endl;
for(auto e: E){
cout << e.from << " " << e.to << " " << e.weight << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
struct Edge {
int a, b, c;
void print() {
cout << a << ' ' << b << ' ' << c << endl;
}
};
int n;
int b;
int sum;
Edge e[61];
int E;
int main() {
cin >> n;
int temp = n;
while (temp) {
temp >>= 1;
++b;
}
for (int i = 1; i < b; ++i) {
e[E++] = Edge {i, i + 1, 1 << (b - i - 1)};
e[E++] = Edge {i, i + 1, 0};
}
int cur = 1 << (b - 1);
for (int i = 2; i <= b; ++i) {
if (cur + (1 << (b - i)) - 1 < n) {
e[E++] = Edge {1, i, cur};
cur += (1 << (b - i));
}
}
cout << b << ' ' << E << endl;
for (int i = 0; i < E; ++i) {
e[i].print();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003;
int main(){
int L;cin>>L;
int N,cnt=-1;
for(int i=1;;i++){
if((1<<i)>L){
N=i;
break;
}
}
for(int i=0;i<N;i++){
if(L&(1<<i)) cnt++;
}
cout<<N<<" "<<2*(N-1)+cnt<<endl;
for(int i=1;i<N;i++){
cout<<i<<" "<<i+1<<" "<<0<<endl;
cout<<i<<" "<<i+1<<" "<<(1<<(N-i-1))<<endl;
}
int now=(1<<(N-1));
for(int i=N-2;i>=0;i--){
if(L&(1<<i)){
cout<<1<<" "<<N-i<<" "<<now<<endl;
now+=(1<<i);
}
}
}
|
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
signed main() {
int L; cin >> L;
vector<tuple<int, int, int> > G;
for(int i = 1; i <= 18; ++i) {
G.push_back(make_tuple(i, i + 1, 0));
G.push_back(make_tuple(i, i + 1, (1 << (i - 1))));
}
int Z = L, sum = 0;
for(int i = 19; i >= 1; --i) {
while(Z >= (1 << (i - 1))) {
G.push_back(make_tuple(i, 20, sum));
sum += (1 << (i - 1));
Z -= (1 << (i - 1));
}
}
cout << 20 << " " << G.size() << endl;
for(int i = 0; i < G.size(); ++i) {
cout << get<0>(G[i]) << " " << get<1>(G[i]) << " " << get<2>(G[i]) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
struct Edge{
int from,to,cost;
};
int main() {
int L; cin >> L;
int p = 20;
while(L<(1<<p)){
p--;
}
int N = p+1;
vector<Edge> ans;
FOR(i,1,p+1){
ans.push_back({i, i+1,0});
ans.push_back({i, i+1, (1<<(i-1))});
}
while(p>0){
if(L-(1<<(p-1)) >= (1<<(N-1)) ){
L -= (1<<(p-1));
ans.push_back({p, N, L});
}
p--;
}
cout << N << " " << ans.size() << endl;
for(auto x: ans){
cout << x.from << " " << x.to << " " << x.cost << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
struct edge{ int to, cost; };
int main()
{
int L;
cin >> L;
// 2^r <= L なる最大の r を求める
int tmp = L, r = 0;
while(tmp > 1){
tmp /= 2;
++r;
}
int N = r+1, M = 0;
vector<vector<edge>> G(N);
// i -> i+1 に 0 と 2^i の辺を張ることで
// 0 ~ 2^r-1 までの経路を作れる
REP(i, N-1){
G[i].push_back({i+1, 0});
G[i].push_back({i+1, (int) pow(2, i)});
M += 2;
}
// 残りの辺を張る
for(int i = N-2; i >= 0; --i){
int length = L - pow(2, i);
if( length >= pow(2, r)){
G[i].push_back({N-1, length});
L -= pow(2, i);
++M;
}
}
cout << N << " " << M << endl;
REP(i, N){
for(auto e: G[i]) cout << i+1 << " " << e.to+1 << " " << e.cost << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main(){
LL L;cin >> L;
int r = 0;
LL uku = 1;
while(L >= uku){
r++;
uku *= 2;
}
r--;
vector<pair<pair<int,int>,int>> Edge;
for(int a = 1;a <= r;a++){
Edge.push_back(make_pair(make_pair(a,a+1),pow(2,a-1)));
Edge.push_back(make_pair(make_pair(a,a+1),0));
}
for(int t = r;t >= 1;t--){
// cout<<t<<" "<<L-pow(2,t-1)<<" "<<pow(2,r)<<endl;
if(L-pow(2,t-1) >= pow(2,r)){
Edge.push_back(make_pair(make_pair(t,r+1),L-pow(2,t-1)));
L-=pow(2,t-1);
}
}
cout<<r+1<<" "<<Edge.size()<<endl;
for(int a = 0;a < Edge.size();a++){
cout<<Edge.at(a).first.first<<" "<<Edge.at(a).first.second<<" "<<Edge.at(a).second<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while ('0'>ch||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do {(t*=10)+=ch-'0';ch=getchar();} while ('0'<=ch&&ch<='9'); t*=f;
}
const int maxn=100;
int n,a[maxn],b[maxn],c[maxn],tot;
int lg,d[maxn];
void add(int x,int y,int z) {
a[++tot]=x; b[tot]=y; c[tot]=z;
}
int main() {
read(n);
for (int i=0;i<20;i++)
if (n&(1<<i)) d[++lg]=i;
for (int i=1;i<=d[lg];i++)
add(i,i+1,0),add(i,i+1,(1<<(i-1)));
n=(1<<d[lg]);
for (int i=lg-1;i>=1;i--)
add(d[i]+1,d[lg]+1,n),n+=(1<<d[i]);
printf("%d %d\n",d[lg]+1,tot);
for (int i=1;i<=tot;i++)
printf("%d %d %d\n",a[i],b[i],c[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
struct edge {
int from, to, cost;
};
int main(){
int l;
cin >> l;
if(l == 2) {
cout << 2 << " " << 2 << endl;
cout << 1 << " " << 2 << " " << 0 << endl;
cout << 1 << " " << 2 << " " << 1 << endl;
return 0;
}
int n = l -1;
vector<int> a;
while(n > 1) {
a.push_back(n%2);
n /= 2;
}
reverse(a.begin(),a.end());
int s = a.size();
vector<edge> v;
rep(i,s) {
v.push_back(edge{i,i+1,1<<(s-1-i)});
v.push_back(edge{i,i+1,0});
}
int b = 1<<s;
rep(i,s) {
if(a[i] == 1) {
v.push_back(edge{0,i+1,b});
b += 1<<(s-i-1);
}
}
v.push_back(edge{0,s,b});
cout << s+1 << " " << v.size() << endl;
for(auto k : v) {
cout << k.from+1 << " " << k.to+1 << " " << k.cost << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
struct Edge{
int from,to,cost;
};
int main() {
int L; cin >> L;
int p = 20;
while(L<(1<<p)){
p--;
}
int N = p+1;
vector<Edge> ans;
FOR(i,1,p+1){
ans.push_back({i, i+1,0});
ans.push_back({i, i+1, (1<<(i-1))});
}
L -= 1<<(N-1);
while(p>0){
if(L >= (1<<(p-1))){
L -= (1<<(p-1));
ans.push_back({p, N, L+(1<<(N-1)) });
}
p--;
}
cout << N << " " << ans.size() << endl;
for(auto x: ans){
cout << x.from << " " << x.to << " " << x.cost << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int l;
cin >> l;
vector<int> sum_pow2{0}, pow2;
int n = 0;
for (int i = 1; i <= l; i *= 2) {
sum_pow2.push_back(sum_pow2.back() + i);
pow2.push_back(i);
n++;
}
int m = (n - 1) * 2, lim = l;
stringstream sout;
for (int idx = 0, cur = l; cur != 1; idx++, cur /= 2) {
if (cur % 2 == 1) {
lim = lim - 1 - sum_pow2[idx];
sout << idx + 1 << ' ' << n << ' ' << lim << '\n';
m++;
cur--;
}
if (idx < n - 1) {
sout << idx + 1 << ' ' << idx + 2 << ' ' << 0 << '\n';
sout << idx + 1 << ' ' << idx + 2 << ' ' << pow2[idx] << '\n';
}
}
cout << n << ' ' << m << '\n';
cout << sout.str();
}
|
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GCC target("avx,tune=native")
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
const int inf=0x3f3f3f3f;
const double eps=1e-6;
const int mod=1000000007;
typedef long long ll;
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
int calc(int x,int lg){
return lg+lg+__builtin_popcount(x-(1<<lg));
}
int l;
int main(){
cin>>l;int lg;
for(int i=0;i<=20;i++){
if((1<<i)<=l)lg=i;
}
cout<<lg+1<<" "<<calc(l,lg)<<endl;
int n=lg+1;
for(int i=1;i<n;i++)cout<<i<<" "<<i+1<<" "<<(1<<i-1)<<endl;
for(int i=1;i<n;i++)cout<<i<<" "<<i+1<<" "<<0<<endl;
int L=1<<lg,R=l;
for(int i=n-1;i>=1;i--){
int cnt=1<<i-1;
if(R-L>=cnt){
cout<<i<<" "<<n<<" "<<L<<endl;
L+=cnt;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <tuple>
long myPOW2( long p )
{
long result = 1;
for ( long i = 0; i < p; i++ )
{
result *= 2;
}
return ( result );
}
int main()
{
long L;
std::cin >> L;
int r = 0;
long tmpL;
while( myPOW2( r ) <= L ) { ++r; }
long N = r;
std::vector<std::tuple<long, long, long> > v;
for ( int i = 1; i < N; ++i )
{
// 頂点iからi+1へ長さ0の辺と長さ2^iの辺を張る
v.emplace_back( std::make_tuple( i, i + 1, 0 ) );
v.emplace_back( std::make_tuple( i, i + 1, myPOW2( i - 1 ) ) );
}
for ( int t = N - 1; t >= 1; --t )
{
if ( L - myPOW2( t - 1 ) >= myPOW2( r - 1 ) )
{
v.emplace_back( t, N, L - myPOW2( t - 1 ) );
L -= myPOW2( t - 1 );
}
}
std::cout << N << " " << v.size() << std::endl;
for ( auto &&it : v )
{
std::cout << std::get<0>( it ) << " "
<< std::get<1>( it ) << " "
<< std::get<2>( it ) << std::endl;
}
return ( 0 );
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int main(){
int n = 20;
int L;cin >> L;
WeightedGraph G(n);
vector<int> sum(n);
int M = 0;
int n2 = 19;
for(int i = 1; i < n; ++i){
G[i-1].push_back({i,0});
int beki = (1<<(i-1));
sum[i]=sum[i-1]+beki;
if(sum[i]<L){
G[i-1].push_back({i,beki});
M = 2*beki;
++n2;
}
}
for(int i = n-1; i >= 0; --i){
if(sum[i]+M<L){
G[i].push_back({n-1,M});
M += sum[i]+1;
++n2;
}
}
cout << n << " " << n2 << endl;
for(int i = 0; i < n; ++i){
for(auto e : G[i]){
cout << i+1 << " " << e.first+1 << " " << e.second << endl;
}
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <tuple>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
int main() {
int L;
cin >> L;
vi v;
int x = 0;
while (L >= (1 << x)) {
v.push_back(x);
x++;
}
// v.push_back(x);
int n = v.size();
vector<tuple<int, int, int>> es;
REP(i, x) {
if (L < (1 << (i + 1))) break;
es.emplace_back(i, i + 1, 0);
es.emplace_back(i, i + 1, 1 << i);
}
int y = (1 << x - 1);
L -= y;
for (int i = x - 2; i >= 0; i--) {
if (L & (1 << i)) {
es.emplace_back(i, n - 1, y);
y += (1 << i);
// L -= (1 << i);
}
}
cout << n << " " << es.size() << endl;
for (auto& tup: es) {
int i, j, k;
tie(i, j, k) = tup;
cout << i + 1 << " " << j + 1 << " " << k << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const int INF = 1000000005;
const long double EPS = 1e-10;
struct Edge {
int f, t, c;
Edge(int f, int t, int c): f(f), t(t), c(c) {}
};
int main() {
int l;
cin >> l;
int res = 2, n = 1;
while (res <= l) {
res *= 2;
n++;
}
vector<Edge> e;
res /= 4;
int c = res;
FOR(i, 1, n) {
e.push_back(Edge(i, i + 1, c));
e.push_back(Edge(i, i + 1, 0));
c /= 2;
}
l -= res * 2;
c = res * 2;
FOR(i, 2, n + 1) {
if (l >= res) {
e.push_back(Edge(1, i, c));
l -= res;
c += res;
}
res /= 2;
}
int m = e.size();
cout << n << " " << m << endl;
rep(i, m) {
cout << e[i].f << " " << e[i].t << " " << e[i].c << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int L, N;
vector<pair<pair<int, int>, int> > edges;
cin >> L;
//Find most significant bit of L
for (int lg = 20; lg >= 0; lg--) {
if (L & (1 << lg)) {
N = lg;
break;
}
}
//Create graph with N + 1 vertices and 2 * N edges. Node i is connected with node i + 1 with 2 edges, each with weight 0 and 2^(i - 1)
for (int i = 1; i <= N; i++) {
edges.push_back({{i, i + 1}, 0});
edges.push_back({{i, i + 1}, (1 << (i - 1))});
}
//For other on bits in i in L, we add an edge from vertex i + 1 to vertex N + 1 and it's weight is equal to sum of previous on bits
int sum = (1 << N);
for (int lg = N - 1; lg >= 0; lg--) {
if (L & (1 << lg)) {
edges.push_back({{lg + 1, N + 1}, sum});
sum += (1 << lg);
}
}
cout << N + 1 << " " << (int) edges.size() << endl;
for (auto edge: edges)
cout << edge.first.first << " " << edge.first.second << " " << edge.second << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int INF=1<<30;
int main(){
int l;cin>>l;
int keta = log2(l) + 1;
vector<P> g;
vector<int> dist;
// cout << keta << endl;
// cout << fixed << setprecision(10) << pow(2.0,20.0) << endl;
for(int i = 1; i < keta; i++) {
g.pb(mp(i,i + 1));
g.pb(mp(i,i + 1));
dist.pb(pow(2,i - 1));
dist.pb(0);
}
for(int i = keta - 1; i > 0; i--) {
if (l - pow(2,i - 1) >= pow(2,keta - 1)){
g.pb(mp(i, keta));
dist.pb(l - pow(2,i - 1));
l -= pow(2,i -1);
// cout << l << endl;
}
}
cout << keta << " " << g.size() << endl;
for(int i = 0; i < g.size(); i++) {
cout << g[i].fs << " " << g[i].sc << " " << dist[i] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int L;
int p[25], eid;
struct edge{
int v, w, nxt;
}e[200];
void add(int u, int v, int w){
e[eid].v = v;
e[eid].w = w;
e[eid].nxt = p[u];
p[u] = eid++;
}
int main(){
memset(p, -1, sizeof p);
eid = 0;
scanf("%d", &L);
int n = 0, tmp = L;
while(tmp){
n++;
tmp >>= 1;
}
for(int i = 1; i < n; ++i){
add(i, i+1, 0);
add(i, i+1, 1<<(i-1));
}
int w = 1<<(n-1);
for(int i = n - 2; i >= 0; --i){
if(L&(1<<i)){
add( i+1, n, w);
w += 1<<i;
}
}
printf("%d %d\n", n, eid);
for(int i = 1; i <= n; ++i){
for(int j = p[i]; ~j; j = e[j].nxt){
printf("%d %d %d\n", i, e[j].v, e[j].w);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
struct edge {
int u, v, w;
};
int main () {
int L;
cin >> L;
int l = 0;
while((1<<(l+1)) <= L) l++;
if(L == 1) {
printf("2 1\n1 2 0\n");
return 0;
}
int N = l+1;
vector<edge> edges;
for(int i = 1; i <= l; i++) {
edges.push_back(edge{i,i+1,0});
edges.push_back(edge{i,i+1,(1<<(l-i))});
}
int k = L - (1<<l);
int w = (1<<l);
for(int i = 20; i >= 0; i--) {
if((k>>i) & 1) {
edges.push_back(edge{1,N-i,w});
w += 1<<i;
}
}
printf("%d %d\n", N, edges.size());
for(auto e: edges) {
printf("%d %d %d\n", e.u, e.v, e.w);
}
return 0;
}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
using namespace std;
vector<pair<pair<int,int>,int> >a;
int main(){
int l;
cin>>l;
vector<int>v;
int t=0;
while(l){
if(l%2)v.push_back(t);
l/=2;
t++;
}
int n=v.back()+1;
for(int i=1;i<n;i++)
{
a.push_back(make_pair(make_pair(i,i+1),0));
a.push_back(make_pair(make_pair(i,i+1),(1<<(i-1))));
}
int sum=1<<v.back();
for(int i=(int)v.size()-2;i>=0;i--){
int y=v[i]+1;
a.push_back(make_pair(make_pair(y,n),sum));
sum+=1<<v[i];
}
cout<<n<<" "<<a.size()<<endl;
for(int i=0;i<a.size();i++)
cout<<a[i].first.first<<" "<<a[i].first.second<<" "<<a[i].second<<endl;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_map>
#include<stack>
#include<random>
#include<set>
#include<map>
#include<functional>
using namespace std;
#define int long long
#define inf 1145141919
#define rep(i,n) for(int i=0;i<n;i++)
typedef pair<int, int>P;
typedef pair<int, P> PP;
struct edge { int to, cost; };
const long long mod = 1000000007;
vector<edge>G[22];
signed main() {
int l; cin >> l;
int V = 0;
rep(i, 20) {
if ((1 << i) <= l&&l < (1 << (i + 1)))V = i + 1;
}
rep(i, V-1) {
G[i].push_back({ i + 1,0 });
G[i].push_back({ i + 1,1 << i });
}
int nm = 1 << (V-1);
int ed = (V-1)* 2;
for (int i = V - 1; i >= 0; i--) {
if (nm + (1 << i) <= l) {
G[i].push_back({ V-1,nm});
nm += 1 << i;
ed++;
}
}
cout << V << ' ' << ed << endl;
rep(i, V) {
rep(j, G[i].size()) {
cout<<i+1<<' ' << G[i][j].to+1 << ' ' << G[i][j].cost << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxd = 20;
int l, tl, dl, ce, t = 1;
bool b[maxd];
signed main () {
scanf("%d", &l);
tl = l;
while (l) {
if (l & 1) {
b[dl] = 1;
ce++;
}
l >>= 1;
dl++;
}
printf("%d %d\n", dl, (dl - 1) * 2 + ce - 1);
l = tl;
for (int i = 1; i < dl; ++i) {
printf("%d %d %d\n", i, i + 1, 0);
printf("%d %d %d\n", i, i + 1, t);
if (b[i - 1]) {
printf("%d %d %d\n", i, dl, l - t);
l -= t;
}
t <<= 1;
}
}
|
#include "bits/stdc++.h"
#define MOD 1000000007
#define inf 0x3f3f3f3f3f3f3f3f
#define pi acos(-1.0)
#define ri register int
#define int long long
#ifdef ONLINE_JUDGE
const int maxn = 3e5 + 10;
#else
const int maxn = 1e3 + 10;
#endif
using namespace std;
int L;
signed main()
{
ios::sync_with_stdio(false);
cin >> L;
int cnt = 0;
while ((1 << (cnt + 1)) <= L) {
++cnt;
}
vector<vector<int>> edges;
int V = 2;
for (ri i = 1; i <= cnt; ++i) {
edges.push_back({ V - 1, V, 0 });
edges.push_back({ V - 1, V, 1 << (i - 1) });
++V;
}
V -= 1;
int sub = L - (1 << cnt), fuck = 1 << cnt;
for (ri i = 1; i < V; ++i) {
if (sub & 1 << (i - 1)) {
edges.push_back({ i, V, fuck });
fuck += 1 << (i - 1);
}
}
cout << V << " " << edges.size() << endl;
for (auto e : edges) {
cout << e[0] << " " << e[1] << " " << e[2] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define range(a) (a).begin(),(a).end()
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=1e5;
const int inf=1e9;
int main(){
int L;cin>>L;
int n = 0;int cnt = 0;
int temp = L;
while(temp){
n++;
cnt += temp % 2;
temp /= 2;
}
cout<<n<<" "<<2 * (n - 1) + cnt - 1<<endl;
rep(i,1,n){
cout<<i<<" "<<i + 1<<" "<<0<<endl;
cout<<i<<" "<<i + 1<<" "<<(1<<i-1)<<endl;
}
int t = (1<<n-1);
for(int i = n-2; i>=0; i--){
if(L & (1<<i)){
cout<<i + 1<<" "<<n<<" "<<t<<endl;
t += (1<<i);
}
}
}
|
#include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int main(){
int N; cin >> N;
vector<int> bits;
rep(i, 21){
if((1<<i)&N){
bits.push_back(i);
}
}
reverse(bits.begin(), bits.end());
int V = bits[0]+1;
int E = 2*bits[0]+bits.size()-1;
cout << V << " " << E << endl;
rep(i, V-1){
cout << i+1 << " " << i+2 << " " << 0 <<endl;
cout << i+1 << " " << i+2 << " " << (1<<i) << endl;
}
int cost = (1<<(V-1));
rep(i, bits.size()-1){
cout << bits[i+1]+1 << " " << V << " " << cost << endl;
cost+=(1<<bits[i+1]);
}
}
|
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
struct Edge {
int from, to, cost;
};
int main() {
int l;
cin >> l;
int r = log2(l);
vector<Edge> es;
int nv = r + 1, ne = 2 * r;
for (int i = 0; i < r; i++) {
es.push_back(Edge{i + 1, i + 2, 0});
es.push_back(Edge{i + 1, i + 2, 1 << i});
}
int pow_r = 1 << r;
for (int i = r; i >= 1 && l - pow_r > 0; i--) {
int pow_i = 1 << (i - 1);
if (l - pow_r >= pow_i) {
l -= pow_i;
es.push_back(Edge{i, nv, l});
ne++;
}
}
cout << nv << " " << ne << endl;
for (Edge e : es)
cout << e.from << " " << e.to << " " << e.cost << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
queue<pair< pair<int, int>, int> > que;
int main(){
int l;
cin >> l;
int p = 1;
int n = 1;
while(p*2 <= l){
p *= 2;
n += 1;
}
int ans_n = n;
int xx = 1;
for(int i = n-1;i >= 1;i--){
que.push(make_pair(make_pair(i, i+1), 0));
que.push(make_pair(make_pair(i, i+1), xx));
xx *= 2;
}
l = l ^ (1 << (n-1));
int r = n;
int w = p;
int x = 1;
while(l > 0){
if(l & 1){
que.push(make_pair(make_pair(1, r), w));
w += x;
}
x *= 2;
l >>= 1;
r--;
}
cout << ans_n << " " << que.size() << endl;
while(!que.empty()){
pair<pair<int, int> , int> p = que.front();
cout << p.first.first << " " << p.first.second << " "<< p.second << endl;
que.pop();
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll,ll> p;
const int MOD = 1000000007;
int main() {
int L;
cin >> L;
int N = 0;//頂点
int pow = 1;
while (pow <= L) pow *= 2, ++N;
int M = (N-1)*2 + __builtin_popcount(L)-1;
cout<<N<<" "<<M<<endl;
REP(i,N-1){
cout<<i+1<<" "<<i+2<<" "<<0<<endl;
cout<<i+1<<" "<<i+2<<" "<<(1<<i)<<endl;
}
int cur = 1<<(N-1);//N-1からN
for(int i = N-2;i >= 0;i--){
if(L&(1<<i)){
//Lのi bit目が立っているか
cout<<i+1<<" "<<N<<" "<<cur<<endl;
cur += (1<<i);
}
}
}
|
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <cmath>
#include <stack>
typedef long long ll;
#define INF 0x3f3f3f3f
using namespace std;
int N = 0, M = 0, L = 0;
string result;
char temp_char[1024];
void add_edge(int from, int to, int weight)
{
sprintf(temp_char, "%d %d %d\n", from, to, weight);
result += temp_char;
M++;
}
int max_r(int num)
{
int p = 0;
while( (1L << p) <= num)
{
p++;
}
return p - 1;
}
int main(int argc, char *argv[]) {
cin >> L;
int r = max_r(L);
N = r + 1;
for(int i = 1; i <= r; i++)
{
add_edge(i, i + 1, (1 << (i - 1)));
add_edge(i, i + 1, 0);
}
int current = 1 << r;
int remind = L - current;
while(remind)
{
int p = max_r(remind);
add_edge(p + 1, N, current);
current += 1 << p;
remind = L - current;
}
cout << N << " " << M << endl;
cout << result;
}
|
#include <bits/stdc++.h>
// D - All Your Paths are Different Lengths
using namespace std;
vector<pair<pair<int,int>,int>> edges;
int main() {
int L,N,i;
scanf("%d",&L);
N = log2(L) + 1;
for (i = 1;i < N;i++) {
edges.push_back({{i,i + 1},0});
edges.push_back({{i,i + 1},1 << (i - 1)});
}
i = (1 << (N - 1));
while (i < L) {
edges.push_back({{log2(L - i) + 1,N},i});
i += (1 << (int) (log2(L - i)));
}
printf("%d %d\n",N,edges.size());
for (pair<pair<int,int>,int> p : edges)
printf("%d %d %d\n",p.first.first,p.first.second,p.second);
return 0;
}
|
// practice with Dukkha
#include <algorithm>
#include <iostream>
using namespace std;
int ii[60], jj[60], ww[60], m;
void add(int i, int j, int w) {
ii[m] = i;
jj[m] = j;
ww[m] = w;
m++;
}
int main() {
int l; cin >> l;
int k = 0;
while (1 << k + 1 <= l)
k++;
for (int i = 0; i < k; i++) {
int j = i + 1;
add(i, j, 0);
add(i, j, 1 << i);
}
for (int i = 0; i < k; i++)
if (l & 1 << i)
add(i, k, l ^= 1 << i);
cout << k + 1 << ' ' << m << '\n';
while (m--)
cout << ii[m] + 1 << ' ' << jj[m] + 1 << ' ' << ww[m] << '\n';
return 0;
}
|
#include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<deque>
#include<regex>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;
int main(){
ll l;
cin>>l;
ll r=0;
// for (r=1;r<=19;++r) {
// if (l < pow(2,r)) {
// break;
// }
// }
for(int i=1;i<20;i++){
if (l < pow(2,i)) {
break;
}else{
r=i;
}
}
//r--;
vector<vector<ll>> ans;
for(ll i=1;i<=r;i++){
ans.push_back({i,i+1,0});
ans.push_back({i,i+1,static_cast<ll>(pow(2,i-1))});
}
for(ll i=r;i>=1;i--){
if(l-pow(2,i-1)>=pow(2,r)){
ans.push_back({i,r+1,l-static_cast<ll>(pow(2,i-1))});
l-=pow(2,i-1);
}
}
cout<<r+1<<' '<<ans.size()<<endl;
for(auto ea:ans){
cout<<ea[0]<<' '<<ea[1]<<' '<<ea[2]<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int l;
cin >> l;
int p=0;
for(int i=1; i<20; i++){
if(pow(2,i) > l) break;
p += 1;
}
l = l - pow(2,p);
int count = 0;
vector<vector<int>> ans;
for(int i=p; i>=1; i--){
if(l - pow(2,i-1) >= 0){
ans.push_back({i, p+1, l - (int)pow(2,i-1) + (int)pow(2,p)});
count += 1;
l -= pow(2,i-1);
}
}
cout << p+1 << " " << 2*p + count << endl;
for(int i=0; i<p; i++){
cout << i+1 << " " << i+2 << " " << 0 << endl;
cout << i+1 << " " << i+2 << " " << pow(2,i) << endl;
}
for(int i=0; i<count; i++){
cout << ans[i][0] << " " << ans[i][1] << " " << ans[i][2] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int digits(int n){
int count = 0;
while(n > 0){
count ++;
n /= 2;
}
return count;
}
int ketawa(int n){
int sum = 0;
while(n > 0){
sum += n % 2;
n /= 2;
}
return sum;
}
int main(){
int L;
cin >> L;
int N = digits(L);
int M = N * 2 + ketawa(L) - 3;
cout << N << " " << M << endl;
for(int i = 1; i < N; i++){
cout << i << " " << i+1 << " " << 0 << endl;
cout << i << " " << i+1 << " " << (1 << (N - 1 - i)) << endl;
}
for(int i = 2; i <= N; i++){
int a = (L >> (N-i));
if(a % 2) cout << 1 << " " << i << " " << ((a >> 1) << (N-i+1)) << endl;
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<queue>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
#define repr(i, n) for(int i = (n-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define lint long long
struct edge{ int from, to, l; };
int main(){
int L; cin >> L;
int r = 0;
while(1){
if((int)pow(2, r + 1) <= L) r++;
else break;
}
int N = r + 1;
vector<edge> E;
for(int i = N - 1; i >= 1; i--){
if(L - (int)pow(2, i - 1) >= (int)pow(2, r)){
E.push_back(edge{i, N, L - (int)pow(2, i - 1)});
L -= (int)pow(2, i - 1);
}
}
int M = r * 2 + (int)E.size();
cout << N << " " << M << endl;
repn(i, r){
cout << i << " " << i + 1 << " " << 0 << endl;
cout << i << " " << i + 1 << " " << (int)pow(2, i - 1) << endl;
}
for(auto& e : E){
cout << e.from << " " << e.to << " " << e.l << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
deque<int> deq;
void rec(int x) {
deq.push_front(x);
if (x == 1) {
return;
} else if (x % 2 == 1) {
rec(x - 1);
} else {
rec(x / 2);
}
}
struct edge {
int from, to, cost;
};
int main() {
int l;
cin >> l;
rec(l);
vector<edge> e;
int now = 1;
for (auto d: deq) {
if (d == 1) continue;
if (d % 2 == 1) {
e.push_back({1, now, d - 1});
} else {
for (auto &v: e) {
v.cost *= 2;
}
e.push_back({now, now + 1, 1});
e.push_back({now, now + 1, 0});
now++;
}
}
cout << now << " " << e.size() << endl;
for (auto &v: e) {
cout << v.from << " " << v.to << " " << v.cost << endl;
}
return 0;
}
|
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
int main(){
int L;
cin >> L;
int r=(int) log2(L);
int N=r+1;
vector<int> v,u,w;
for(int i=1;i<N;i++){
v.push_back(i);
u.push_back(i+1);
w.push_back(0);
v.push_back(i);
u.push_back(i+1);
w.push_back(pow(2,i-1));
}
for(int i=N-1;i>0;i--){
if(L-pow(2,i-1)>=pow(2,r)){
v.push_back(i);
u.push_back(N);
w.push_back(L-pow(2,i-1));
L-=pow(2,i-1);
}
}
cout << N << ' ' << v.size() << endl;
for(int i=0;i<v.size();i++){
cout << v[i] << ' ' << u[i] << ' ' << w[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int L;
cin >> L;
int n2 = 2;
int keta = 1;
while (n2 <= L) {
n2 = n2 * 2;
keta++;
}
vector<bool> t2(keta,false);
int num1 = -3;
for (int i=0; i<keta; i++) {
if (L%2 == 1) {
t2[keta-1-i] = true;
num1++;
}
L = L/2;
}
int maxx = n2/4;
cout << keta << ' ' << keta * 2 + num1 << endl;
int i = 1;
while (maxx != 0) {
cout << i << ' ' << i+1 << ' ' << maxx << endl;
cout << i << ' ' << i+1 << ' ' << 0 << endl;
maxx = maxx/2;
i++;
}
int size = n2/2;
n2 = size/2;
for (int i=1; i<keta; i++) {
if (t2[i]) {
cout << 1 << ' ' << i+1 << ' ' << size << endl;
size += n2;
}
n2 = n2 / 2;
}
}
|
#include <bits/stdc++.h>
struct Edge {
int from, to, distance;
};
int main()
{
int l;
scanf("%d", &l);
std::vector<Edge> edges;
int n;
for (int i = 0; (1 << (i + 1)) <= l; i++)
{
edges.push_back((Edge){i, i + 1, 0});
edges.push_back((Edge){i, i + 1, 1 << i});
n = i + 1;
}
for (int i = 0; (1 << (i + 1)) <= l; i++)
{
if (!((1 << i) & l)) continue;
edges.push_back((Edge){i, n, (l & ~((1 << i) - 1) - (1 << i))});
}
printf("%d %d\n", n + 1, edges.size());
for (auto &e: edges)
{
printf("%d %d %d\n", e.from + 1, e.to + 1, e.distance);
}
return 0;
}
|
/// referenced: https://beta.atcoder.jp/contests/abc108/submissions/3146147
#include<bits/stdc++.h>
using namespace std;
void print(int u,int v,int w){
printf("%d %d %d\n",u,v,w);
}
int L;
int main(){
cin>>L;
int n=1,r=0;
while(2*n<=L){
n*=2;
++r;
}
int N=r+1;
int M=2*r+__builtin_popcount(L-n);
printf("%d %d\n",N,M);
for(int i=0;i<r;++i){
print(i+1,i+2,0);
print(i+1,i+2,1<<i);
}
for(int t=r-1;L>n;--t){
if(L-(1<<t)>=n){
L-=1<<t;
print(t+1,N,L);
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int L;
cin >> L;
int l = L;
vector<int> digit;
while (l) {
digit.push_back(l%2);
l >>= 1;
}
int size = digit.size();
printf("%d ", size);
vector<pair<pair<int, int>, int> > edges;
int length = 1;
for (int i = 1; i < size; i++) {
edges.push_back(make_pair(make_pair(i, i+1), 0));
edges.push_back(make_pair(make_pair(i, i+1), length));
length *= 2;
}
for (int i = 1; i < size; i++) {
if (digit[size-i-1] == 1) {
edges.push_back(make_pair(make_pair(size-i, size), length));
length += 1<<(size-i-1);
}
}
printf("%d\n", (int)edges.size());
for (const auto &edge : edges) {
printf("%d %d %d\n", edge.first.first, edge.first.second, edge.second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int L;
cin >> L;
int d = 0;
for (int p = 2; p <= L; p *= 2) ++d;
int sum = pow(2, d), res = L - sum;
const int n = d + 1, m = 2 * d + __builtin_popcount(res);
cout << n << ' ' << m << '\n';
for (int i = 1, p = 1; i < n; ++i) {
cout << i << ' ' << i + 1 << ' ' << 0 << '\n';
cout << i << ' ' << i + 1 << ' ' << p << '\n';
p *= 2;
}
// add edge : (i + 1) -- sum --> (n)
for (int i = d - 1; 0 <= i; --i) {
if (res >> i & 1) {
cout << i + 1 << ' ' << n << ' ' << sum << '\n';
sum += pow(2, i);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
int main(){
using ti = tuple<int,int,int>;
int l;
cin >> l;
ve<ti> ans;
int i = 1;
while(pow(2,i)<=l){
ans.push_back(ti(i,i+1,pow(2,i-1)));
ans.push_back(ti(i,i+1,0));
i++;
}
int n = pow(2,i-1);
while(1){
int k = l-n;
int j = 0;
while(k){
k /= 2;
j++;
}
if(j == 0)break;
ans.push_back(ti(j,i,n));
n += pow(2,j-1);
}
sort(ans.begin(), ans.end());
cout << i<<" "<< ans.size() << endl;
rep(i,ans.size()){
printf("%d %d %d\n", get<0>(ans[i]), get<1>(ans[i]), get<2>(ans[i]));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int L, N = 0;
vector<vector<int>> edge;
int main(void){
scanf("%d", &L);
while(1 << N <= L) ++N;
for(int i = 1; i < N; ++i){
edge.push_back({i, i + 1, 1 << (i - 1)});
edge.push_back({i, i + 1, 0});
}
int corrent = (1 << (N - 1)) - 1;
for(int i = N - 1; i >= 1 && corrent != L - 1; i--){
int add = 1 << (i - 1);
if(corrent + add <= L - 1){
edge.push_back({i, N, corrent + 1});
corrent += add;
}
}
printf("%d %d\n", N, (int)edge.size());
for(auto i : edge) printf("%d %d %d\n", i[0], i[1], i[2]);
return 0;
}
|
#include <iostream>
#include <vector>
#include <array>
#include <set>
#include <cmath>
#include <string>
#include <queue>
#include <list>
#include <bitset>
#include <unordered_map>
#include <algorithm>
#include <functional>
#include <iomanip> // std::std::setprecision(X)
#include <limits> //std::numeric_limits<int>::max(), min()
int main (void) {
int L; std::cin >> L;
std::array<bool, 20> k = { false } ;
int digit = 0, c = 0;
int tmpL = L;
while(tmpL) {
if ( tmpL & 1 ) {
k[digit] = true;
c++;
}
tmpL >>= 1;
digit++;
}
int N = digit;
int M = (digit-1)*2 + (c-1);
std::cout << N << " " << M << std::endl;
int t = 1;
for (int i = 1; i < digit; i++) {
std::cout << i << " " << i+1 << " " << 0 << std::endl;
std::cout << i << " " << i+1 << " " << t << std::endl;
if (k[i-1] == true) {
std::cout << i << " " << digit << " " << L - t << std::endl;
L -= t;
}
t <<= 1;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
vector<int> g[21],d[21];
void solve(int x,int l){
if(x==1)return;
if(l&1)g[1].push_back(x),d[1].push_back(l-1);
if(l/2==0)return;
g[x-1].push_back(x);
g[x-1].push_back(x);
d[x-1].push_back(0);
d[x-1].push_back(l/2);
solve(x-1,l/2);
}
int main(){
int l;
scanf("%d",&l);
solve(20,l);
int num=0;
for(int i=1;i<21;i++)num+=g[i].size();
printf("20 %d\n",num);
for(int i=1;i<=20;i++){
for(int j=0;j<g[i].size();j++){
printf("%d %d %d\n",i,g[i][j],d[i][j]);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int cnt;
vector<tuple<int,int,int>>vt;
int main(){
cin>>N;
int l = floor(log2(N));
int high = 1<<l;
int x=1;
while(high/=2){
vt.push_back(make_tuple(x,x+1,0));
vt.push_back(make_tuple(x,x+1,high));
x++;
}
high = 1<<l;
int cur = high;
x=2;
while(high/=2){
if(cur+high<=N){
vt.push_back(make_tuple(1,x,cur));
cur+=high;
}
x++;
}
cout<<l + 1<<' '<<vt.size()<<'\n';
for(auto& tp:vt){
cout<<get<0>(tp)<<' ';
cout<<get<1>(tp)<<' ';
cout<<get<2>(tp)<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
//===
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int L; cin >> L;
int r = 0;
while (L >= (1 << r)) ++r;
--r;
vector<pair<Pii, int>> edges;
for (int i = 0; i < r; ++i) {
edges.emplace_back(make_pair(i + 1, i + 2), 0);
edges.emplace_back(make_pair(i + 1, i + 2), (1 << i));
}
int R = (1 << r);
for (int i = r - 1; i >= 0; --i) {
int s = L - (1 << i);
if (s >= R) {
edges.emplace_back(make_pair(i + 1, r + 1), s);
L = s;
}
}
cout << r + 1 << " " << edges.size() << "\n";
for (const auto& e : edges) {
cout << e.first.first << " " << e.first.second << " " << e.second << "\n";
}
return 0;
}
|
#include<bits/stdc++.h>
int L,M,N,c,i;
int main(){
scanf("%d",&L);
N=floor(log2(L))+1;
M=(N-1)*2+__builtin_popcount(L-(1<<(N-1)));
printf("%d %d\n",N,M);
for(i=1;i<N;i++)printf("%d %d %d\n%d %d %d\n",i,i+1,0,i,i+1,1<<(i-1));
c=1<<(N-1);
for(i=N-2;i>=0;i--)if(L&(1<<i))printf("%d %d %d\n",i+1,N,c),c+=1<<i;
}
|
#include <iostream>
using namespace std;
int main() {
int L; cin >> L;
int l[30], g[30], ToLast[30];
int n=0, m=0;
--L;
while(L>0){
ToLast[n]=L%2;
l[n]=1-L%2;
g[n]=1+L/2;
L=(L+1)/2 - 1;
m += 3-ToLast[n];
++n;
}
cout << n+1 << ' ' << m << endl;
for(int i=0; i<n; ++i){
cout << i+1 << ' ' << i+2 << ' ' << l[i] << endl;
cout << i+1 << ' ' << i+2 << ' ' << g[i] << endl;
if(ToLast[i]==0) cout << i+1 << ' ' << n+1 << ' ' << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int num_digits(int i) {
int n = 0;
while (i > 0) {
i /= 2;
n++;
}
return n;
}
int main() {
int L;
cin >> L;
int N = num_digits(L);
int M = 0;
vector<vector<pair<int, int>>> E(N, vector<pair<int, int>>());
for (int i = 0; i < N - 1; i++) {
int d = pow(2, i);
E[i].push_back({i + 1, 0});
E[i].push_back({i + 1, d});
M += 2;
}
for (int i = 0; i < N - 1; i++) {
if (L & (1 << i)) {
int d = (L >> (i + 1)) << (i + 1);
E[i].push_back({N - 1, d});
M++;
}
}
cout << N << " " << M << endl;
for (int i = 0; i < N; i++) {
for (auto e : E[i]) {
cout << i + 1 << " " << e.first + 1 << " " << e.second << endl;
}
}
return 0;
}
/* vim:set fdm=marker: */
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
const int MOD = 1000000007;
struct Edge {
int from;
int to;
long long cost;
};
vector<Edge> ans;
void bypass(int add, int L) {
if (L <= 0) return;
for (int k = 19; k >= 0; --k) {
if (L >= (1 << k)) {
ans.push_back({k + 1, 20, add});
bypass(add + (1 << k), L - (1 << k));
break;
}
}
}
int main() {
int L;
cin >> L;
for (int i = 1; i < 20; i++) ans.push_back({i, i + 1, 0});
for (int k = 19; k >= 1; k--) {
if (L >= (1 << k)) {
for (int i = 1; i <= k; i++) {
ans.push_back({i, i + 1, 1 << (i - 1)});
}
bypass(1 << k, L - (1 << k));
break;
}
}
cout << 20 << " " << ans.size() << endl;
for (auto e : ans) {
cout << e.from << " " << e.to << " " << e.cost << endl;
}
}
|
#include <stdio.h>
int main()
{
int L, N = 2, M, i = 4, rem = 0, sum = 0;
scanf("%d", &L);
while (L >= i)
i <<= 1, N++;
M = 2 * (N-1), i >>= 1;
if (L != i) {
rem = i = L - i;
while (i)
M += (i&1), i >>= 1;
}
printf("%d %d\n", N, M);
for (i = 1; i < N; i++) {
printf("%d %d 0\n", i, i+1);
printf("%d %d %d\n", i, i+1, 1 << (N-1-i));
}
if (rem) {
for (i = 0; i < N-1; i++)
if (rem & (1<<i)) {
sum += 1<<i;
printf("1 %d %d\n", N-i, L-sum);
}
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
#include<stack>
#include<set>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
using pll = pair<ll,ll> ;
ll INF = 1e15 ;
void chmin(ll &a,ll b){if(a>b) a = b ;}
void chmax(ll &a,ll b){if(a<b) a = b ;}
void YorN(bool a){cout << (a?"YES":"NO") << "\n" ;}
int main(){
ll l ; cin >> l ;
ll a = 0 ;
ll sub = 1 ;
while(sub<=l){
a++ ;
sub *= 2 ;
}
a-- ;
ll n = a+1 ;
ll m = 2*a ;
for(int i=0;i<a;i++) if(l>>i&1) m++ ;
vector<vector<pll>> g(n) ;
for(int i=0;i<n-1;i++){
g[n-2-i].emplace_back(n-1-i,0) ;
g[n-2-i].emplace_back(n-1-i,1<<i) ;
}
a = 1<<n-1 ;
for(int i=n-2;i>=0;i--){
if(l>>i&1){
g[0].emplace_back(n-1-i,a) ;
a += 1<<i ;
}
}
cout << n << " " << m << endl ;
for(int i=0;i<n;i++){
for(int j=0;j<g[i].size();j++){
cout<< i+1 << " " << g[i][j].first+1 << " " << g[i][j].second << endl ;
}
}
}
|
#include <cstdio>
using namespace std;
int is_ok[20];
int main(int argc, char const *argv[])
{
int l;
scanf("%d",&l);
int now = l;
int cnt = 0,cur = 0;
while(l)
{
if(l & 1)
{
is_ok[cnt] = 1;
cur++;
}
l >>= 1;
cnt++;
}
printf("%d %d\n",cnt,(cnt - 1) * 2 + cur - 1);
int t = 1;
l = now;
for(int i = 1;i < cnt; ++i)
{
printf("%d %d %d\n%d %d %d\n",i,i + 1,0,i,i + 1,t);
if(is_ok[i - 1])
{
printf("%d %d %d\n",i,cnt,l - t);
l -= t;
}
t <<= 1;
}
return 0;
}
|
#include<iostream>
#include<math.h>
#include<vector>
using namespace std;
int main() {
int L;
cin >> L;
int r = 0;
int i = L;
while(i != 1) {
i /= 2;
r += 1;
}
int N = r + 1;
vector<vector<int>> result;
vector<int> hen(3, 0);
for(int i = 1; i < N; i++) {
hen[0] = i; hen[1] = i + 1; hen[2] = 0;
result.push_back(hen);
hen[2] = (int)pow(2, (double)i-1);
result.push_back(hen);
}
for(int i = r; i > 0; i--) {
if(L - pow(2, (double)r) >= pow(2, (double)i-1)){
L -= pow(2, (double)i-1);
hen[0] = i; hen[1] = N; hen[2] = L;
result.push_back(hen);
}
}
cout << N << " " << result.size() << endl;
for(int i = 0; i < result.size(); i++)
cout << result[i][0] << " " << result[i][1] << " " << result[i][2] << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
struct edge{ int to, cost; };
int main()
{
int L;
cin >> L;
// グラフの構築の問題では X -> X+1 と X -> 2X の作り方を具体的に導くのが大事
// 2^r <= L なる最大の r を求める
int tmp = L, r = 0;
while(tmp > 1){
tmp /= 2;
++r;
}
int N = r+1, M = 0;
vector<vector<edge>> G(N);
// i -> i+1 に 0 と 2^i の辺を張ることで
// 0 ~ 2^r-1 までの経路を作れる
REP(i, N-1){
G[i].push_back({i+1, 0});
G[i].push_back({i+1, (int) pow(2, i)});
M += 2;
}
// 残りの辺を張る
for(int i = N-2; i >= 0; --i){
int length = L - pow(2, i);
if( length >= pow(2, r)){
G[i].push_back({N-1, length});
L -= pow(2, i);
++M;
}
}
cout << N << " " << M << endl;
REP(i, N){
for(auto e: G[i]) cout << i+1 << " " << e.to+1 << " " << e.cost << endl;
}
return 0;
}
|
/*
ID: jerrywcy
TASK: AtCoder ABC 108 Problem D
LINK: https://abc108.contest.atcoder.jp/tasks/abc108_d
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
int l;
bool te[20];
int main() {
int i,j;
cin>>l;
int tl=l;
int dl=0;
int ce=0;
while (tl){
if (tl&1){
te[dl]=1;
ce++;
}
tl>>=1;
dl++;
}
cout<<dl<<' '<<(dl-1)*2+ce-1<<endl;
long long t=1;
for (i=1;i<dl;i++){
cout<<i<<' '<<i+1<<' '<<0<<endl;
cout<<i<<' '<<i+1<<' '<<t<<endl;
if (te[i-1]){
cout<<i<<' '<<dl<<' '<<l-t<<endl;
l-=t;
}
t<<=1;
}
return 0;
}
|
#include <cstdio>
inline int readin(){
int x=0,c;
for (;(c=getchar())<'0'||c>'9';);
for (;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+c-48;
return x;
}
int main(){
int L=readin();
int min=233,ans=0;
for (int i=0;i<20;i++) if ((1<<i)&L) min=i,ans++;
ans+=min*2;
if (min==19) ans--;
printf("20 %d\n",ans);
for (int i=1;i<=min;i++) printf("%d %d %d\n%d %d %d\n",i,i+1,0,i,i+1,1<<(i-1));
int x=min==19?524288:0;
for (int i=0;i<19;i++) if ((1<<i)&L) printf("%d %d %d\n",i+1,20,x),x+=1<<i;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;
/*
*/
int main()
{
int L;
cin >> L;
int n = 0, pow = 1;
while(pow <= L) pow *= 2, n++;
vector<tuple<int, int, int>> ans;
rep(i, n-1){
ans.pb(mt(i+1, i+2, 0));
ans.pb(mt(i+1, i+2, 1<<i));
}
int cur = 1<<(n-1);
for(int i = n-2; i >= 0; i--){
if(L & 1<<i){
ans.pb(mt(i+1, n, cur));
cur += (1<<i);
}
}
printf("%d %d\n", n, (int)ans.size());
for(auto u : ans){
int a, b, c;
tie(a, b, c) = u;
printf("%d %d %d\n", a, b, c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define rrep(i,s,e) for(int (i) = (s);(i) >= (e);(i)--)
vector<int> u;
vector<int> v;
vector<int> w;
signed main() {
int l;cin>>l;
int tmp = l;
int cnt = 0;
int cost = 1;
while(tmp/2)
{
tmp/=2;
cnt++;
u.push_back(cnt);
v.push_back(cnt+1);
w.push_back(0);
u.push_back(cnt);
v.push_back(cnt+1);
w.push_back(cost);
cost *= 2;
}
int endN = cnt+1;
cnt = 0;
l -= cost;
while(l){
tmp = l;
cnt = 0;
while(tmp/2)
{
tmp/=2;
cnt++;
}
u.push_back(cnt+1);
v.push_back(endN);
w.push_back(cost);
int a=1;
rep(i,0,cnt-1) a*=2;
cost += a;
l -= a;
}
cout << endN << " " << u.size() << endl;
rep(i,0,u.size()-1) cout << u[i] <<" "<<v[i]<<" "<<w[i]<<endl;
}
|
#include<bits/stdc++.h>
int L,M,N,r,c;
int main(){
scanf("%d",&L);
N=floor(log2(L))+1;
r=L-(1<<(N-1));
M=(N-1)*2+__builtin_popcount(r);
c=1<<(N-1);
printf("%d %d\n",N,M);
for(int i=1;i<N;i++)printf("%d %d %d\n%d %d %d\n",i,i+1,0,i,i+1,1<<(i-1));
for(int i=N-2;i>=0;i--)if(L&(1<<i))printf("%d %d %d\n",i+1,N,c),c+=1<<i;
}
|
#include <iostream>
#include <vector>
#include <array>
using namespace std;
typedef long long ll;
ll num_bits(ll x){
ll ret = 0;
for(ret = 0; x > 0; ret++, x /= 2){}
return ret;
}
int main(){
ll l;
cin >> l;
ll k = num_bits(l);
const ll n = k;
vector<array<ll, 3>> edges;
for(ll i = 1; i < k; ++i){
edges.push_back({i, i + 1, 1 << (i - 1)});
edges.push_back({i, i + 1, 0});
}
ll shift = 1 << (k - 1);
l -= shift;
while(l > 0){
k = num_bits(l);
edges.push_back({k, n, shift});
l -= (1 << (k - 1));
shift += 1 << (k - 1);
}
cout << n << ' ' << edges.size() << endl;
for(int i = 0; i < edges.size(); ++i){
cout << edges.at(i).at(0) << ' ' << edges.at(i).at(1) << ' '
<< edges.at(i).at(2) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(long long)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template<class T> void vin(vector<T>& v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
struct Edge {
int s, t, w;
};
int main() {
int L;
cin >> L;
vector<Edge> g;
int r = log2(L);
int n = r + 1;
rep(i, r) {
Edge e1, e2;
e1.s = i+1;
e1.t = i+2;
e1.w = 0;
e2.s = i+1;
e2.t = i+2;
e2.w = pow(2, i);
g.push_back(e1);
g.push_back(e2);
}
int t = n-1;
for (; t>=1; --t) {
int a = pow(2, t-1);
if (L-a>=pow(2, r)) {
Edge e;
e.s = t;
e.t = n;
e.w = L-a;
L -= a;
g.push_back(e);
}
}
cout << n << ' ' << g.size() << endl;
for (auto e : g) {
cout << e.s << ' ' << e.t << ' ' << e.w << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
struct Edge {
int s, e, l;
};
vector<Edge> edge;
int binary_pow(int x, int n) {
if (n == 0)return 1;
else if (n == 1) return x;
else if (n % 2 == 0) {
int tmp = binary_pow(x, n / 2);
return tmp * tmp;
}
else {
int tmp = binary_pow(x, n / 2);
return tmp * tmp *x;
}
}
int main() {
int L;
cin >> L;
int N;
for (N = 1; binary_pow(2, N) <= L; N++);
for (int i = 1; i < N; i++) {
edge.push_back({ i,i + 1,binary_pow(2,i - 1) });
edge.push_back({ i,i + 1,0 });
}
//まだ表現されていない値:len
int len = binary_pow(2, N - 1), index = N - 1;
while (len < L && index > 0) {
if (len + binary_pow(2, index-1) - 1 <= L -1) {
edge.push_back({ index, N,len });
len += binary_pow(2, index-1);
}
index--;
}
cout << N << " " << edge.size() << endl;
for (int i = 0; i < edge.size(); i++) {
cout << edge[i].s << " " << edge[i].e << " " << edge[i].l << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int l;cin>>l;
int t1=l;
int d1=0;
bool te[20];
int ce=0;
rep(i,20)te[i]=0;
while(l)
{
if(l&1)
{
te[d1]=1;
ce++;
}
l>>=1;
d1++;
}
cout<<d1<<" "<<(d1-1)*2+ce-1<<endl;
l=t1;
int t=1;
for(int i=1;i<d1;i++)
{
cout<<i<<" "<<i+1<<" "<<0<<endl;
cout<<i<<" "<<i+1<<" "<<t<<endl;
if(te[i-1])
{
cout<<i<<" "<<d1<<" "<<l-t<<endl;
l-=t;
}
t<<=1;
}
return 0;
}
|
#include<iostream>
#include<sstream>
#include<vector>
#include<iterator>
#include<utility>
#include<cmath>
using namespace std;
int main(void)
{
int L;
cin >> L;
int cntNode = 0;
int cntEdge = 0;
for(int i=1; i*2<=L; i*=2)
cntNode++;
cntNode++;
vector<vector<pair<int, int>>> graph(cntNode, vector<pair<int, int>>());
for(int i=0; i<cntNode-1; i++){
graph[i].push_back(make_pair(i+1, 0));
graph[i].push_back(make_pair(i+1, pow(2, i)));
cntEdge += 2;
}
for(int i=cntNode; i>=0; i--){
int left = L - pow(2, i);
int right = int(pow(2, cntNode-1));
if(left < right)
continue;
graph[i].push_back(make_pair(cntNode-1, left));
L -= pow(2, i);
cntEdge++;
}
cout << cntNode << " " << cntEdge << endl;
for(int i=0; i<cntNode; i++){
for(int j=0; j<graph[i].size(); j++){
int n = graph[i][j].first;
int w = graph[i][j].second;
cout << i+1 << " " << n+1 << " " << w << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int L; cin >> L;
int l[30], g[30];
int n=0, m=0;
--L;
while(L>0){
l[n]=1-L%2;
g[n]=1+L/2;
L=(L+1)/2 - 1;
m += 2+l[n];
++n;
}
cout << n+1 << ' ' << m << endl;
for(int i=0; i<n; ++i){
cout << i+1 << ' ' << i+2 << ' ' << l[i] << endl;
cout << i+1 << ' ' << i+2 << ' ' << g[i] << endl;
if(l[i]==1) cout << i+1 << ' ' << n+1 << ' ' << 0 << endl;
}
return 0;
}
|
#include<cstdio>
using namespace std;
int main(){
int l; scanf("%d", &l);
int n = 1, r = 0;
while(2 * n <= l) { n *= 2; r++; }
int m = 2 * r + __builtin_popcount(l - n);
printf("%d %d\n", r + 1, m);
for(int i = 0; i < r; i++){
printf("%d %d %d\n", i + 1, i + 2, 0);
printf("%d %d %d\n", i + 1, i + 2, 1 << i);
}
for(int i = r - 1; l > n; i--) if(l - (1 << i) >= n){
l -= 1 << i;
printf("%d %d %d\n", i + 1, r + 1, l);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
int main(){
int L;
cin >> L;
int r = 1;
int N = 1;
while (r * 2 <= L) {
r *= 2;
N++;
}
vector<vector<P>> G(N, vector<P>());
r = 1;
int M = 0;
rep(i, N - 1) {
G[i].emplace_back(i + 1, 0);
G[i].emplace_back(i + 1, r);
M += 2;
r *= 2;
}
vector<int> nums(21);
nums[0] = 1;
rep(i, 20) nums[i + 1] = nums[i] * 2;
for (int i = N - 2; i >= 0; --i) {
if (r + nums[i] - 1 < L) {
G[i].emplace_back(N - 1, r);
r += nums[i];
M++;
}
}
cout << N << " " << M << endl;
rep(i, N) {
for (auto j : G[i]) {
cout << i + 1 << " " << j.first + 1 << " " << j.second << endl;
}
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int L;
cin >> L;
int x = 0;
while (1<<x <= L) {
x++;
}
x--;
int cnt = 0;
vector<string> path;
for (int i = 0; i < x; i++) {
path.push_back(to_string(i + 1) + " " + to_string(i + 2) + " 0");
path.push_back(to_string(i + 1) + " " + to_string(i + 2) + " " + to_string(1<<i));
cnt++;
}
int z = (L - (1<<x));
int s = 1<<x;
for (int i = x - 1; i >= 0; i--) {
if (z & (1<<i)) {
path.push_back(to_string(i + 1) + " " + to_string(x + 1) + " " + to_string(s));
s += (1<<i);
}
}
cout << (x + 1) << " " << path.size() << endl;
rep(i, path.size()) {
cout << path[i] << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int L; cin>>L;
int n;
for(n=0;(1<<n)<=L;n++);
vector<vector<pair<int,int>>> G(n);
rep(i,n-1){
G[i].emplace_back(i+1,0);
G[i].emplace_back(i+1,1<<(n-i-2));
}
int sum=1<<(n-1);
rep(i,n-1) if(L>>(n-i-2)&1) {
G[0].emplace_back(i+1,sum);
sum+=1<<(n-i-2);
}
int m=0;
rep(u,n) m+=G[u].size();
printf("%d %d\n",n,m);
rep(u,n) for(auto e:G[u]) printf("%d %d %d\n",u+1,e.first+1,e.second);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<cmath>
using namespace std;
#define rep(i, n) for(long int i = 0; i < n; i++)
struct edge {int from, to, cost;};
int main(){
int l;
cin >> l;
int r = 0;
int k = l;
while(k / 2 != 0){
k /= 2;
r++;
}
vector<edge> G;
k = 1;
rep(i, r){
edge g;
g.from = i + 1;
g.to = i + 2;
g.cost = k;
G.push_back(g);
g.cost = 0;
G.push_back(g);
k *= 2;
}
k = 1;
rep(i, r-1) k *= 2;
int bi = k * 2;
// cout << bi << endl;
for (int i = r; i >= 1; i--){
if (l - k >= bi){
edge g;
g.from = i;
g.to = r + 1;
g.cost = l - k;
G.push_back(g);
l -= k;
}
k /= 2;
}
cout << r + 1 << " " << G.size() << endl;
rep(i, G.size()){
cout << G[i].from << " " << G[i].to << " " << G[i].cost << endl;
}
}
|
#include <iostream>
#include <vector>
#include <tuple>
using namespace std;
long long L; vector<tuple<int, int, int>>G;
int main() {
cin >> L;
for (int i = 1; i <= 18; i++) {
G.push_back(make_tuple(i, i + 1, 0));
G.push_back(make_tuple(i, i + 1, (1 << (i - 1))));
}
int Z = L, sum = 0;
for (int i = 19; i >= 1; i--) {
while (Z >= (1 << (i - 1))) {
G.push_back(make_tuple(i, 20, sum));
sum += (1 << (i - 1)); Z -= (1 << (i - 1));
}
}
cout << 20 << " " << G.size() << endl;
for (int i = 0; i < G.size(); i++) cout << get<0>(G[i]) << " " << get<1>(G[i]) << " " << get<2>(G[i]) << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
constexpr int NINF = std::numeric_limits<int>::min();
using namespace std;
void solve() {
int L;
cin >> L;
L--;
vector<int> v;
vector<tuple<int, int, int>> m;
for (int i = 0; (1 << i) - 1 <= L; i++) {
v.push_back((1 << i) - 1);
}
for (int i = 1; i < v.size(); i++) {
m.emplace_back(i, i + 1, 1 << (i - 1));
m.emplace_back(i, i + 1, 0);
}
int x = 1 << (v.size() - 1);
while (x <= L) {
int i = 1;
while (v[i] + x <= L) {
i++;
}
m.emplace_back(i, v.size(), x);
x = x + v[i - 1] + 1;
}
printf("%ld %ld\n", v.size(), m.size());
for (auto &a : m) {
printf("%lld %lld %lld\n", get<0>(a), get<1>(a), get<2>(a));
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
typedef long long int ll;
using namespace std;
int main(int argc, char const *argv[]) {
int L, now=1, count=0, d=1;
std::cin >> L;
while(now<=L) count++, now*=2;
count--, now/=2;
vvi ans = vv(0, 3, 0, int);
for(int i=0;i<count;i++){
ans.push_back(std::vector<int> {i+1, i+2, d});
ans.push_back(std::vector<int> {i+1, i+2, 0});
d*=2;
}
for(int i=count-1;i>=0;i--){
if((L-(1<<i))>=(1<<count)){
ans.push_back(std::vector<int> {i+1, count+1, L-(1<<i)});
L-=(1<<i);
}
}
std::cout << count+1 << " " << ans.size() << '\n';
for(int i=0;i<ans.size();i++) std::cout << ans[i][0]<<" "<<ans[i][1]<<" "<<ans[i][2] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
using ll = std::int64_t;
using P = std::tuple<int,int>;
int L;
constexpr int N = 20;
int M;
std::vector<P> G[21];
void f(int i, int l){
if(i == N){
return;
}
if(l & 1){
G[i].emplace_back(N, l - 1);
M += 1;
}
if(l >= 2){
G[i].emplace_back(i + 1, 0);
G[i].emplace_back(i + 1, l / 2);
M += 2;
f(i + 1, l / 2);
}
}
int main(){
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> L;
f(1, L);
printf("%d %d\n", N, M);
for(int i=1;i<=N;++i){
for(auto &p : G[i]){
int j, w;
std::tie(j, w) = p;
printf("%d %d %d\n", i, j, w);
}
}
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int tmp[25];
void init(){
tmp[0] = 1;
rep(i,1,22){
tmp[i] = tmp[i-1]*2;
}
}
int main(){
int L;
cin >> L;
init();
vector<int> U;
while(L>0){
U.push_back(L%2);
L /= 2;
}
int N = U.size();
int M = (N-1)*2-1;
rep(i,0,N) if(U[i]==1) M++;
cout << N << " " << M << endl;
reverse(U.begin(),U.end());
int a = 0;
rep(i,0,N){
if(U[i] == 1 && i != 0){
cout << 1 << " " << i+1 << " " << a << endl;
}
if(U[i] == 1) a += tmp[N-i-1];
}
rep(i,1,N){
cout << i << " " << i+1 << " " << 0 << endl;
cout << i << " " << i+1 << " " << tmp[N-i-1] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int L;
cin >> L;
int count = 0, top;//count:1の数 top:最上位の1の位置
int arr[21]={0};
for(int i = 0; i <= 20; i++){
if((L >> i) & 1 == 1){//i桁目が1
arr[count] = i;
count++;
top = i;
}
}
if(count == 1){
cout << top + 1 << " " << top * 2 << endl;
for(int i = 0; i < top; i++){
cout << top - i << " " << top - i + 1 << " " << pow(2, i) << endl;
cout << top - i << " " << top - i + 1 << " " << 0 << endl;
}
}else{
cout << top + 1 << " " << top * 2 + count - 1 << endl;
for(int i = 0; i < top; i++){
cout << top - i << " " << top - i + 1 << " " << pow(2, i) << endl;
cout << top - i << " " << top - i + 1 << " " << 0 << endl;
}
for(int i = 0; i < count - 1; i++){
int temp = L;
temp = temp >> arr[i] + 1;
temp = temp << arr[i] + 1;
cout << 1 << " " << top + 2 - arr[i] - 1 << " " << temp << endl;
}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.