text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
ll l;
string s;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cin >> l;
vector<vector<P>> ans;
ans.resize(21);
ll n = 0;
ll pow[30];
pow[0] = 1;
rep(i, 1, 20){
pow[i] = 2*pow[i-1];
}
rep(i, 1, 19){
ans[i].push_back(P(i+1, 0));
n++;
if(l >= pow[i]){
ans[i].push_back(P(i+1, pow[i-1]));
n++;
}
}
rep(i, 1, 19){
if(l%pow[i] != 0 && l > pow[i]){
ans[i].push_back(P(20, l-pow[i-1]));
n++;
l -= pow[i-1];
}
}
cout << 20 << " " << n << endl;
rep(i, 1, 19){
for(ll j = 0; j < ans[i].size(); j++){
cout << i << " " << ans[i][j].first << " " << ans[i][j].second << endl;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l;
cin >> l;
int n = 1;
while ((1 << n) <= l) {
n++;
}
vector<int> a(0), b(0), c(0);
for (int i = 0; i < n - 1; i++) {
a.push_back(i);
b.push_back(i + 1);
c.push_back(0);
a.push_back(i);
b.push_back(i + 1);
c.push_back(1 << i);
}
for (int i = n - 2, j = l; i >= 0; i--) {
if ((1 << (n - 1)) + (1 << i) <= j) {
a.push_back(i);
b.push_back(n - 1);
c.push_back(j - (1 << i));
j -= (1 << i);
}
}
int m = a.size();
cout << n << " " << m << endl;
for (int i = 0; i < m; i++) {
cout << a[i] + 1 << " " << b[i] + 1 << " " << c[i] << endl;
}
}
|
#include<iostream>
#include<vector>
using namespace std;
vector<int> u;
vector<int> v;
vector<int> w;
int main() {
int L;
cin >> L;
int r = 1, r_count = 0, M = 0;;
while (r * 2 <= L) {
r *= 2;
r_count++;
}
int N = r_count + 1, length = 1;
for (int i = 1; i <= r_count; i++) {
u.push_back(i);
v.push_back(i + 1);
w.push_back(0);
u.push_back(i);
v.push_back(i + 1);
w.push_back(length);
length *= 2;
}
length /= 2;
for (int i = N - 1; i >= 1; i--) {
if (L - length >= r) {
u.push_back(i);
v.push_back(N);
w.push_back(L - length);
L -= length;
}
length /= 2;
}
cout << N << " " << u.size() << endl;
for (int i = 0; i < u.size(); i++) {
cout << u[i] << " " << v[i] << " " << w[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define lowbit(x) ((x)&-(x))
int x;
int n,m;
vector<pair<pair<int,int>,int> > v;
int main(int argc, char const *argv[]){
while(~scanf("%d",&x)){
v.clear();
n = 1;
int tmp = x;
while(tmp - lowbit(tmp) > 0) {
tmp -= lowbit(tmp);
}
for(int i=2,tem=1;tem<tmp;++i,tem<<=1){
// (i-1)->(i) : tem
v.push_back({{i-1,i},tem});
v.push_back({{i-1,i},0});
++n;
}
for(int i=n-2;x > tmp;i--) if(x - (1<<i) >=tmp ){
x -= 1<<i;
v.push_back({{i+1,n},x});
}
printf("%d %d\n",n,v.size());
for(auto x: v){
printf("%d %d %d\n",x.first.first,x.first.second,x.second);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
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, 0, N-1) {
cout << i+1 << " " << i+2 << " " << 0 << endl;
cout << i+1 << " " << i+2 << " " << (1<<i) << endl;
}
int cur = 1<<(N-1);
for(int i = N-2; i >= 0; i--) {
if (L & (1<<i)) {
cout << i+1 << " " << N << " " << cur << endl;
cur += (1<<i);
}
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
long l;
cin >> l;
long r;
for (r=1;r<=19;++r) {
if (l < pow(2,r)) {
break;
}
}
--r;
vector<vector<long>> ans;
for (long i=1;i<=r;++i) {
ans.push_back({i,i+1,0});
ans.push_back({i,i+1,static_cast<long>(pow(2,i-1))});
}
for (long i=r;i>=1;--i) {
if (l - pow(2,i-1) >= pow(2,r)) {
ans.push_back({i,r+1,l-static_cast<long>(pow(2,i-1))});
l -= pow(2,i-1);
}
}
cout << r+1 << ' ' << ans.size() << "\n";
for (auto each_ans : ans) {
cout << each_ans[0] << ' ' << each_ans[1] << ' ' << each_ans[2] << "\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
const ll mo=1000000007;
ll ans=0;
ll dp[0][0];
int main()
{
ll n;
cin >> n;
ll bi[20]={};
ll max,sum,coun=0;
rep(i,20){
if(((n>>i)&1LL)==1){
bi[i]++;
max=i;
coun++;
}
}
cout << max+1<<' '<< max*2+coun-1<< endl;
rep(i,max){
cout << i+1<<' '<<i+2 <<' '<<'0'<< endl;
cout << i+1<<' '<<i+2 << ' '<< (1<<i)<<endl;
}
sum=(1LL<<max);
rep(i,max){
if(bi[i]==1){
cout << i+1<<' '<<max+1 <<' '<<sum<< endl;
sum+=(1LL<<(i));
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
int main(){
int l;
cin>>l;
if(l==2){
cout<<"2 2\n1 2 0\n1 2 1"<<endl;
return 0;
}
int n;
for(int i=19;i>=0;i--){
if((l-1)&(1<<i)){
n=i+1;
break;
}
}
int m=n-1+n-1+1,t=1<<(n-1);
vector<pair<int,int>> ans;
for(int i=2;i<=n;i++){
if((l-1)&(1<<(n-i))){
ans.push_back({i,t});
m++;
t+=1<<(n-i);
}
}
cout<<n<<" "<<m<<endl;
for(int i=1;i<=n-1;i++){
cout<<i<<" "<<i+1<<" "<<0<<endl;
}
for(int i=1;i<=n-1;i++){
cout<<i<<" "<<i+1<<" "<<(1<<(n-i-1))<<endl;
}
for(auto p:ans){
cout<<"1 "<<p.first<<" "<<p.second<<endl;
}
cout<<1<<" "<<n<<" "<<l-1<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
struct f{
int a,b,c;
};
int main(){
int o;
cin>>o;
vector<f> e;
int r=log2(o);
int n=r+1;
for(int i=0;i<r;i++){
e.push_back(f{i+1,i+2,0});
e.push_back(f{i+1,i+2,1<<i});
}
int p=1<<r;
for(int i=r;i>=1 && o-p>0;i--){
int w=1<<(i-1);
if(o-p>=w){
o-=w;
e.push_back(f{i,n,o });
}
}
cout<<n<<' '<<e.size()<<endl;
for(int i=0;i<e.size();i++)
cout<<e[i].a<<' '<<e[i].b<<' '<<e[i].c<<endl;
}
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define ML 1000005
using namespace std;
struct EDGE
{
int u, v, w;
EDGE (const int& nu = 0, const int& nv = 0, const int& nw = 0) : u(nu), v(nv), w(nw) {}
} E[66];
int N = 0, M = 0, L;
int main()
{
int mxp = 0;
scanf("%d", &L);
if(L == 1)
{
printf("%d %d\n%d %d %d\n", 2, 1, 1, 2, 0);
return 0;
}
for(int i=19; i>=0; i--)
if(L>>i & 1)
{
mxp = i;
break;
}
N = mxp + 1;
for(int i=0; i<mxp; i++) E[++M] = EDGE(i+1, i+2, 1<<i), E[++M] = EDGE(i+1, i+2, 0);
for(int i=0; i<mxp; i++)
if(L>>i & 1)
E[++M] = EDGE(i+1, N, ((L>>i)^1)<<i);
//E[++M] = EDGE(1, N, L);
printf("%d %d\n", N, M);
for(int i=1; i<=M; i++) printf("%d %d %d\n", E[i].u, E[i].v, E[i].w);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L; cin >> L;
int N = 2, p = 2;
while (p * 2 <= L) {
N++;
p *= 2;
}
int M = (N - 1) * 2 - 1;
int l = L;
while (l) {
M += l % 2;
l /= 2;
}
cout << N << " " << M << "\n";
p = L - p;
l = L;
for (int i = 1; i < N; i++) {
cout << i << " " << i+1 << " " << 0 << "\n";
cout << i << " " << i+1 << " "<< (1 << i-1) << "\n";
if (1 << i - 1 & p) {
l -= 1 << i-1;
cout << i << " " << N << " " << l << "\n";
}
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
// ref : https://drken1215.hatenablog.com/entry/2018/09/02/020500
int main(){
ll l;
cin >> l;
ll n = 0, p = 1;
while(p <= l) {
p *= 2;
n++;
}
ll 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 << " " << (1ll<<i) << endl;
}
ll now = 1<<(n-1);
rrep(i, n-1){
if (l & (1<<i)) {
cout << i+1 << " " << n << " " << now << endl;
now += (1ll<<i);
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l;
cin >> l;
int n = 20;
vector<vector<int>> ret;
for (int i = 2; i < n; i++) {
ret.push_back({i, i + 1, 0});
ret.push_back({i, i + 1, 1 << n - 1 - i});
}
for (int i = 2; i <= n; i++) {
int x = 1 << n - i;
while (l >= x) {
ret.push_back({1, i, l - x});
l -= x;
}
}
cout << n << " " << ret.size() << endl;
for (auto edge:ret) cout << edge[0] << " " << edge[1] << " " << edge[2] << endl;
return 0;
}
|
#include <bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
//using namespace atcoder;
using namespace std;
int main(void){
ll l;
cin >> l;
ll n = 0;
while ((1 << n) <= l){
n++;
}
vector<tuple<ll,ll,ll>> m(0);
for (ll i = 0; i < n-1; i++){
m.emplace_back(make_tuple(i+1, i+2, 0));
m.emplace_back(make_tuple(i+1, i+2, (1LL << i)));
}
ll t = l % (1LL << (n-1));
ll k = 0;
for (ll i = 0; i < n; i++){
if ((t >> i) & 1){
k |= (1 << i);
m.emplace_back(make_tuple(i+1, n, (1LL << (n-1)) + t - k));
}
}
cout << n << " " << m.size() << endl;
for (auto p : m){
ll u = get<0>(p);
ll v = get<1>(p);
ll w = get<2>(p);
cout << u << " " << v << " " << w << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
vector<int> getBit(int n){
vector<int> ret;
while(n){
ret.push_back(n&1);
n >>= 1;
}
reverse(ret.begin(), ret.end());
return ret;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int l;
cin>>l;
if(l == 2){
cout<<"2 2\n1 2 0\n1 2 1\n";
exit(0);
}
vector<int> bit = getBit(l - 1);
int n = bit.size();
vector<pair<int, pair<int, int> > >edges;
for(int i = n - 1; i >= 1; i--){
edges.push_back({0, {i, i + 1}});
edges.push_back({1<<(n - 1 - i), {i, i + 1}});
}
for(int i = 2; i <= n; i++){
int val = (l-1)>>(n - i);
if(val&1){
edges.push_back({(val>>1)<<(n - i + 1), {1, i}});
}
}
edges.push_back({l - 1, {1, n}});
cout<<n<<" "<<edges.size()<<'\n';
for(auto pp : edges){
cout<<pp.second.first<<" "<<pp.second.second<<" "<<pp.first<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int L;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>L;
int hi=0;
const int N = 20;
vector<pair<int,int>> v;
for (int i=2; i<=N; i++) {
int ways = 1<<(N-i);
while (hi+ways<=L) {
v.push_back({i, hi});
hi += ways;
}
}
int nodes = N;
int edges = (N-2)*2 + (int)v.size();
cout<<nodes<<" "<<edges<<"\n";
for (int i=2; i<N; i++) {
int wei = 1<<(N-1-i);
cout<<i<<" "<<i+1<<" "<<wei<<"\n";
cout<<i<<" "<<i+1<<" "<<0<<"\n";
}
for (auto ed: v) {
cout<<1<<" "<<ed.first<<" "<<ed.second<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct edge {
int from;
int to;
int len;
};
int main() {
int l;
cin >> l;
int r = 0;
for ( int i = 1; i*2 <= l; i*=2 ) { r++; }
int r2 = 1 << r;
if ( r > 19 ) { r = 19; }
int n = r+1;
vector<edge> es;
for ( int i = 1; i < n; i++ ) {
edge t;
t.from = i;
t.to = i+1;
t.len = 0;
es.push_back(t);
t.len = 1 << (i-1);
es.push_back(t);
}
for ( int i = n-1; i >= 1; i-- ) {
int s = l - (1 << (i-1));
if ( s < r2 ) { continue; }
edge t;
t.from = i;
t.to = n;
t.len = s;
es.push_back(t);
l = s;
}
cout << n << ' ' << es.size() << endl;
for ( int k = 0; k < es.size(); k++ ) {
cout << es[k].from << ' ' << es[k].to << ' ' << es[k].len << endl;
}
return 0;
}
|
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<vector>
#include<math.h>
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define ll long long
using namespace std;
int l;
struct nod
{
int to,val;
};
vector<nod>g[25];
int main()
{
int n=0,m=-1;
scanf("%d",&l);
int x=l;
while(x)
{
n++;
if(x&1)m++;
x>>=1;
}
m+=2*(n-1);
for(int i=1;i<n;i++)
{
g[i].push_back((nod){i+1,0});
g[i].push_back((nod){i+1,1<<(n-i-1)});
}
int sum=(1<<(n-1))-1;
for(int i=n-2;i>=0;i--)
{
if((1<<i)&l)
{
g[1].push_back((nod){n-i,sum+1});
sum+=(1<<i);
}
}
printf("%d %d\n",n,m);
for(int i=1;i<n;i++)
{
for(int j=0;j<g[i].size();j++)
{
printf("%d %d %d\n",i,g[i][j].to,g[i][j].val);
}
}
}
|
#include <iostream>
#include <cstring>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void){
int l, b = 1, cnt = 0;
vector<int> u, v, w;
cin >> l;
while (b <= l) {
b *= 2; cnt++;
}
for (int i = 1; i <= cnt - 1; i++) {
u.push_back(i); v.push_back(i + 1); w.push_back(pow(2, i - 1));
u.push_back(i); v.push_back(i + 1); w.push_back(0);
}
l -= b / 2;
int n = cnt, k = b / 2;
while (l != 0) {
cnt = 0;
b = 1;
while (b <= l) {
b *= 2; cnt++;
}
u.push_back(cnt); v.push_back(n); w.push_back(k);
k += b / 2;
l -= b / 2;
}
cout << n << " " << u.size() << endl;
for (int i = 0; i < u.size(); i++) cout << u[i] << " " << v[i] << " " << w[i] << endl;
}
|
#include <cstdio>
using namespace std;
int a[300],b[300],c[300];
int m;
void push(int aa,int bb,int cc){
m++;
a[m]=aa;
b[m]=bb;
c[m]=cc;
}
int main() {
int L;
scanf("%d",&L);
L--;
int x=1,n=20;
while(L>=0){
if (L==0){
if (x<n)
push(x,n,0);
break;
}
if (L==1){
push(x,n,0);
push(x,n,1);
break;
}
if (L%2==0)
push(x,n,L);
L=(L+1)/2;
push(x,x+1,0);
push(x,x+1,L);
L--;
x++;
}
printf("%d %d\n",n,m);
for (int i=1;i<=m;i++)
printf("%d %d %d\n",a[i],b[i],c[i]);
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define REP(i,n) for(int i=0;i<n;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 pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define SORT(x) sort((x).begin(),(x).end())
#define INF 99999999999
#define MOD (int)(1e9)+7
using namespace std;
int dy[4]={1, 0, -1, 0};
int dx[4]={0, 1, 0, -1};
int32_t main(){
int l;
cin >> l;
int r=0;
while((1 << r+1) <= l) r++;
int n = r+1;
cout << n << " ";
vector<int> fr, to, len;
REP(i, r){
fr.pb(i+1);
to.pb(i+2);
len.pb(0);
fr.pb(i+1);
to.pb(i+2);
len.pb(1 << i);
}
for(int i=n-1; i>0; i--){
if(l-(1 << (i-1))>=(1 << r)){
fr.pb(i);
to.pb(n);
len.pb(l-(1 << (i-1)));
l-=(1 << (i-1));
}
}
cout << fr.size() << endl;
REP(i, fr.size()){
cout << fr[i] << " " << to[i] << " " << len[i] << endl;
}
}
|
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#include <random>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
const int INF = (1 << 30) - 1;
const ll INFLL= (1LL << 61) - 1;
const int MOD = 1000000007;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int L;
cin>>L;
int r=0,tmp=1;
while(2*tmp<=L){
tmp*=2;r++;
}
vector<tuple<int,int,int>> ans;
REP(i,r){
ans.emplace_back(i+1,i+2,1<<i);
ans.emplace_back(i+1,i+2,0);
}
for(int i=r;i>=1;i--){
if(L-(1<<(i-1))>=(1<<r)){
ans.emplace_back(i,r+1,L-(1<<(i-1)));
L-=(1<<(i-1));
}
}
cout<<r+1<<' '<<ans.size()<<endl;
for(auto e:ans){
cout<<get<0>(e)<<' '<<get<1>(e)<<' '<<get<2>(e)<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<tuple<int,int,int>> q;
int main() {
int l;
cin >> l;
int ncnt = 1;
while (pow(2,ncnt)-1 < l) {
ncnt++;
}
int node[ncnt];
for (int i;i < ncnt;i++) {
node[i] = pow(2,i) - 1;
if (i != ncnt-1) {
q.push_back(make_tuple(i+1,i+2,0));
q.push_back(make_tuple(i+1,i+2,pow(2,i)));
}
}
int nmax = node[ncnt-1] + 1;
for (int i = ncnt - 1;i >= 0;i--) {
if (node[i] + nmax < l) {
q.push_back(make_tuple(i+1,ncnt,nmax));
if (node[i] + nmax == l - 1) {
break;
}
nmax += node[i] + 1;
}
}
cout << ncnt << " " << q.size() << endl;
for (int i = 0;i < q.size();i++) {
cout << get<0>(q[i]) << " " << get<1>(q[i]) << " " << get<2>(q[i]) << endl;
}
}
|
#include <iostream>
#include <cstring>
using namespace std;
int main() {
int l;
cin >> l;
int tl = l;
int dl = 0;
bool te[20];
int ce = 0;
memset(te, 0, sizeof(te));
while (l) {
if (l & 1) {
te[dl] = true;
ce++;
}
l >>= 1;
dl++;
}
cout << dl << " " << (dl-1)*2+ce-1 << endl;
l = tl;
int t = 1;
for (int 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 <bits/stdc++.h>
using namespace std;
struct Edge {
int from, to, cost;
};
int main() {
int l;
cin >> l;
int r = log2(l);
vector<Edge> edges;
int n = r + 1;
for (int i = 0; i < r; i++) {
edges.push_back(Edge{i + 1, i + 2, 0});
edges.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;
edges.push_back(Edge{i, n, l});
}
}
cout << n << " " << edges.size() << endl;
for (Edge e : edges) cout << e.from << " " << e.to << " " << e.cost << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct data {
long long from, to, dis;
};
long long x, n = 0;
vector<data> v;
void solve();
int main() {
cin >> x;
solve();
cout << n << " " << v.size() << endl;
for(int i = 0; i < v.size(); ++i)
cout << v[i].from + 1 << " " << v[i].to + 1 << " "
<< v[i].dis << endl;
return 0;
}
void solve() {
long long now = 0;
while(1LL << (n + 1) <= x) ++n;
for(int i = 0; i < n; ++i) {
v.push_back({i, i + 1, 1 << i});
v.push_back({i, i + 1, 0});
}
x -= (1LL << n);
++n;
now = 1LL << (n - 1);
for(int i = n - 2; i >= 0; --i)
if(1LL << i <= x) {
v.push_back({i, n - 1, now});
x -= 1LL << i;
now += 1LL << i;
}
}
|
#include <iostream>
#include <cmath>
using namespace std;
int L;
int M;
int main(void) {
cin >> L;
int N = 1;
int num = 1;
for (;; N++) {
num *= 2;
if (num > L) { break; }
}
cout << N ;
//==================== M
M = 2 * (N - 1);
int A = L - num / 2;
while (A) {
int j = 0;
int m = 1;
for (;; j++) {
if (m <= A && A <2 * m) { break; }
m *= 2;
}
//cout << "j= " << j << endl;
M++;
A -= pow(2, j);
}
cout <<" " <<M << endl;
//=============================
for (int i = 1; i <= N - 1; i++) {
cout << i << " " << i + 1 << " " << 0 << endl;
}
int w = 1;
for (int i = N; i >= 2; i--) {
cout << i - 1 << " " << i << " " << w << endl;
w *= 2;
}
A = L - num / 2;
while (A) {
int j = 0;
int m = 1;
for (;; j++) {
if (m <= A && A <2 * m) { break; }
m *= 2;
}
//cout << "j= " << j << endl;
cout << 1 << " " << N - j << " " << L - A << endl;
A -= pow(2, j);
}
//system("pause");
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main () {
long L;
vector<string> ans;
cin >> L;
for (int i = 1; i < 20; i++) {
if (L == 1) {
ans.push_back(to_string(i) + " " + to_string(i + 1) + " 0");
continue;
}
if (L % 2 != 0) {
ans.push_back(to_string(i) + " 20 " + to_string(L - 1));
L--;
}
L /= 2;
ans.push_back(to_string(i) + " " + to_string(i + 1) + " " + to_string(L));
ans.push_back(to_string(i) + " " + to_string(i + 1) + " " + to_string(0));
}
cout << 20 << " " << ans.size() << endl;
for (string s: ans) {
cout << s << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
int main(){
ll l;
cin>>l;
if(l==2){
cout<<"2 2"<<endl;
cout<<"1 2 0"<<endl;
cout<<"1 2 1"<<endl;
return 0;
}
l--;
vector<ll> bt;
ll t=l;
ll cnt=0;
while(t){
cnt+=t%2;
bt.pb(t%2);
t/=2;
}
ll n=bt.size();
cout<<n<<" "<<(n-1)*2+cnt<<endl;
ll k=pow(2,n-2);
for(int i=0;i<n-1;i++){
cout<<i+1<<" "<<i+2<<" "<<0<<endl;
cout<<i+1<<" "<<i+2<<" "<<k<<endl;
k/=2;
}
cout<<1<<" "<<n<<" "<<l<<endl;
for(int i=0;i<bt.size()-1;i++){
if(bt[i]==0)continue;
l-=pow(2,i);
cout<<1<<" "<<n-i<<" "<<l<<endl;
}
return 0;
}
|
#include"bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
int n = 2;
int m = 2;
map<P, vector<int>> e;
void dfs(int l) {
if (l == 2) {
e[P(1, 2)].push_back(0);
e[P(1, 2)].push_back(1);
} else if (l % 2 == 0) {
dfs(l / 2);
for (auto edge: e) {
P p = edge.first;
for (int i = 0; i < e[p].size(); i++) {
e[p][i] *= 2;
}
}
e[P(n, n + 1)].push_back(0);
e[P(n, n + 1)].push_back(1);
n += 1;
m += 2;
} else {
dfs(l - 1);
e[P(1, n)].push_back(l - 1);
m++;
}
}
void Main() {
int l;
cin >> l;
dfs(l);
cout << n << " " << m << endl;
for (auto edge: e) {
P p = edge.first;
for (int i = 0; i < e[p].size(); i++) {
cout << p.first << " " << p.second << " " << edge.second[i] << endl;
}
}
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int L, L_, N, M, R;
cin >> L;
N = 0;
M = -2;
L_ = L;
while(L_!=0) {
N++;
M += 2;
L_ /= 2;
}
R = L-pow(2,N-1);
for(int i=0; i<N; i++) {
if (R & (1<<i)) {
M++;
}
}
cout << N << " " << M << endl;
for(int i=0; i<N-1; i++) {
cout << i+1 << " " << i+2 << " " << 0 << endl;
cout << i+1 << " " << i+2 << " " << pow(2,i) << endl;
}
int res = pow(2,N-1);
for(int i=N-1; i>=0; i--) {
if (R & (1<<i)) {
cout << i+1 << " " << N << " " << res << endl;
res = res + pow(2,i);
}
}
return 0;
}
|
#include <bits/stdc++.h>
// #include <atcoder/all>
// #LIB#
using namespace std;
// using namespace atcoder;
using ll = long long;
#define double long double
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x, c) for (auto&& x : (c))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
#ifdef ONLINE_JUDGE
#define endl _endl
const char _endl = (cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout.precision(16), '\n');
#endif
int main() {
ll l;
cin >> l;
vector<tuple<ll, ll, ll>> edges;
ll gn = 1;
while (l >= 2) {
if (l & 1) {
edges.emplace_back(gn, -1, l - 1);
--l;
}
edges.emplace_back(gn, gn + 1, 0);
edges.emplace_back(gn, gn + 1, l / 2);
++gn;
l /= 2;
}
cout << gn << " " << edges.size() << endl;
itr(e,edges){
auto [ea, eb, ec] = e;
cout << ea << " " << (eb == -1 ? gn : eb) << " " << ec << endl;
}
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Range(container) container.begin(), container.end()
#define Cin(T, x) T x; cin >> x;
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i];
#define Cout(val) cout << (val) << "\n";
using namespace std;
using ll = long long;
int main(void){
Cin(int, l);
vector<int> bits;
while(l){
bits.push_back(l & 1);
l >>= 1;
}
int n = (int)bits.size();
int m = 2*(n-1) + accumulate(Range(bits), -1);
printf("%d %d\n", n, m);
for(int i = 1; i < n; i ++){
printf("%d %d 0\n", i, i+1);
printf("%d %d %d\n", i, i+1, 1 << (i-1));
}
int need = 1 << (n-1);
for(int i = n-1; i > 0; i --){
if(bits[i-1] == 0) continue;
printf("%d %d %d\n", i, n, need);
need += 1 << (i-1);
}
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
vector<ll>F, T, W;
ll N;
void push(ll f, ll t, ll w){
F.push_back(f);
T.push_back(t);
W.push_back(w);
}
void show(){
cout << N << " " << F.size() << endl;
for(ll i = 0; i < F.size(); i++){
cout << F[i] << " " << T[i] << " " << W[i] << endl;
}
}
int main(){
ll L;
cin >> L;
ll mx[22] = {};
for(ll i = 2; i <= 21; i++){
mx[i] = (1LL << (i - 1)) - 1;
}
for(N = 1; ;N++)if(mx[N + 1] >= L)break;
for(ll i = 1; i < N; i++){
push(i, i + 1, 0);
push(i, i + 1, 1 << (i - 1));
}
for(ll i = mx[N] + 1; i < L; i++){
ll sz = L - i;
ll from = 1;
for(;;from++)if(i + mx[from + 1] >= L)break;
push(from, N, i);
i += mx[from];
}
show();
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
typedef tuple<int, int, int> TP;
int main() {
int L; cin >> L;
int k = 1, N = 0;
while (k <= L) {
k *= 2; ++N;
}
int r = N - 1;
int kr = k/2;
vector<TP> es;
k = 1;
for (int i = 1; i < N; ++i) {
es.push_back({i, i + 1, 0});
es.push_back({i, i + 1, k});
k *= 2;
}
k /= 2;
for (int i = N - 1; i > 0; --i) {
if (L - k >= kr) {
es.push_back({i, N, L - k});
L -= k;
}
k /= 2;
}
cout << N << " " << es.size() << endl;
for (auto [u, v, w] : es) {
cout << u << " " << v << " " << w << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int L;
vector<P> G[30]; // const, to
vector<bool> op; // T: x2, F: +1
int s,t,now,e;
void gen_op(int num){
if(num == 2) return;
if(num%2 != 0){
gen_op(num-1);
op.push_back(false);
}else{
gen_op(num/2);
op.push_back(true);
}
return;
}
void make_graph(){
for (int i = 0;i < op.size();i++){
if(op[i]){
for (int j = s;j < t;j++){
for (int k = 0;k < G[j].size();k++){
G[j][k].first *= 2;
}
}
G[t].push_back(P(0,t+1));
G[t].push_back(P(1,t+1));
t++;
e += 2;
now *= 2;
}else{
G[s].push_back(P(now,t));
now += 1;
e++;
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> L;
G[1].push_back(P(0,2));
G[1].push_back(P(1,2));
s = 1;
t = 2;
now = 2;
e = 2;
gen_op(L);
make_graph();
cout << t << " " << e << endl;
for (int i = s;i < t;i++){
for (int j = 0;j < G[i].size();j++){
cout << i << " " << G[i][j].second << " " << G[i][j].first << endl;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <tuple>
#include <cmath>
using namespace std;
int main()
{
int L;
cin >> L;
int N = (int)log2(L) + 1;
vector<tuple<int, int, int>> v;
for (int i = 1; i <= N-1; i++) {
v.push_back(make_tuple(i, i+1, 0));
v.push_back(make_tuple(i, i+1, 1<<(N-1-i)));
}
int bit = 1 << (N - 1);
int pos = 1;
int curr = 1 << (N - 1);
int rest = L - (1 << (int)log2(L));
while (bit) {
if (rest & bit) {
v.push_back(make_tuple(1, pos, curr));
curr += 1 << (N-pos);
}
pos++;
bit >>= 1;
}
cout << N << " " << v.size() << endl;
for (auto tup : v) {
int u, v, w;
tie(u, v, w) = tup;
cout << u << " " << v << " " << w << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define sz(x) (int)(x).size()
using iii = tuple<int, int, int>;
int l;
void solve() {
int n = 0;
for (int i = 20; i >= 0; i--)
if (l & (1 << i)) { n = i + 1; break; }
vector<iii> edges;
for (int i = 0; i < n - 1; i++) {
edges.push_back(iii(i + 1, i + 2, 0));
edges.push_back(iii(i + 1, i + 2, (1 << i)));
}
int cur = (1 << (n - 1));
for (int i = 0; i < n - 1; i++) if (l & (1 << i)) {
edges.push_back(iii(i + 1, n, cur));
cur += (1 << i);
}
assert(cur == l);
printf("%d %d\n", n, sz(edges));
for (int i = 0; i < sz(edges); i++) {
printf("%d %d %d\n", get<0>(edges[i]), get<1>(edges[i]), get<2>(edges[i]));
}
}
int main() {
scanf("%d", &l);
solve();
}
|
#include<iostream>
#include <algorithm>
#include<string>
#include <bitset>
#include <vector>
#include <functional>
#include <climits>
#include <iomanip>
#include <utility>
#include <stack>
#include <math.h>
using namespace std;
using ll = long long;
int main()
{
ll a, b = 0, c = 0, d = 0;
ll l;
ll memo[2][100];
cin >> l;
while (1)
{
a = 1;
b = 0;
if (c==l)
{
break;
}
while (l - c > a * 2&&b<18)
{
a *= 2;
b++;
}
if (l - c == 1)
{
memo[0][d] = 20;
memo[1][d] = c;
//cout << 1 << " " << 20 << " " << c << endl;
}
else
{
memo[0][d] = 20-b;
memo[1][d] = c;
//cout << 1 << " " << 20 - b << " " << c << endl;
}
c += a;
d++;
}
cout << 20 <<" " <<d+36<< endl;
for (int i = 2; i < 20; i++)
{
cout << i << " " << i + 1 << " " << 0 << endl;
}
for (int i = 2; i < 20; i++)
{
cout << i << " " << i + 1 << " " << pow(2, 19 - i) << endl;
}
for (int i = 0; i < d; i++)
{
cout << 1 << " " << memo[0][i] << " " << memo[1][i] << endl;
}
//cout << c + d << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <climits>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
struct edge {
int v1;
int v2;
int c;
};
int main() {
int l; std::cin >> l;
int n = int(log2(l))+1;
std::vector<edge> es;
for (int i = 1; i < n; i++) {
es.push_back(edge{i-1, i, 0});
es.push_back(edge{i-1, i, int(pow(2, i-1))});
}
for (int m = n-1; m > 0; m--) {
int sub = l - pow(2, m-1);
if (sub >= pow(2, n-1)) {
l -= pow(2, m-1);
es.push_back(edge{m-1, n-1, sub});
}
}
std::cout << n << " " << es.size() << std::endl;
for(auto e : es) {
std::cout << e.v1+1 << " " << e.v2+1 << " " << e.c << std::endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int l;
cin >> l;
vector<string> res = {};
int n = 0;
int pow = 1;
while (pow <= l) {
pow *= 2;
n++;
}
for (int i = 0; i < (n - 1); i++) {
string xx = to_string(i + 1);
string yy = to_string(i + 2);
res.push_back(xx + " " + yy + " 0");
res.push_back(xx + " " + yy + " " + to_string(1<<i));
}
int path = 2 * (n - 1);
int x = 1<<(n - 1);
for (int i = n - 2; i >= 0; i--) {
// 作ることのできるパス
if (l & 1<<i) {
path++;
res.push_back(to_string(i + 1) + " " + to_string(n) + " " + to_string(x));
x += 1<<i;
}
}
cout << n << " " << path << endl;
for (string s : res) {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
int d = 2;
while ((N >> d) != 0) d++;
vector<pair<pair<int, int>, int>> ans;
for (int i = 1; i <= 19; i++) ans.push_back({{i, i+1}, 0});
for (int i = 1; i < d; i++) ans.push_back({{i, i+1}, (1 << (i-1))});
int t = (1 << (d-1));
for (int i = 19; i >= 1; i--) {
if (t + ((1 << (i-1)) - 1) < N) {
ans.push_back({{i, 20}, t});
t += (1 << (i-1));
}
}
cout << 20 << " " << ans.size() << endl;
for (auto p : ans) {
cout << p.first.first << " " << p.first.second << " " << p.second << endl;
}
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 hoge = L;
ll cnt = 0;
while(hoge!=0){
hoge = hoge/2;
cnt++;
}
ll N = cnt;
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;
int l;
int main () {
cin >> l;
int n = log2(l) + 1;
int m = __builtin_popcount(l) - 1 + (n - 1) * 2;
int lst = 1;
cout << n << " " << m << endl;
for (int i = 0; i < n - 1; i++) {
cout << i + 1 << " " << i + 2 << " " << 0 << '\n';
cout << i + 1 << " " << i + 2 << " " << lst << '\n';
lst *= 2;
}
int k = __builtin_popcount(l) - 1;
int cur = n - 1;
l -= pow(2, cur);
for (int i = n - 2; i >= 0; i--) {
if (l >= pow(2, i)) {
l -= pow(2, i);
cout << cur << " " << n << " " << lst << '\n';
lst += pow(2, i);
}
cur--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long int ll;
#define INF 1 << 30
#define REP(i,n) for(ll i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(ll i=(k);i<(int)(n);i++)
int l;
int r;
vector<pii> v;
int main(){
cin >> l;
r = log2(l);
int n = r+1;
int m = 2*r;
l -= pow(2,r);
int node = n-1;
int len = pow(2,r);
while(l > 0 && node > 0){
//cout << node <<endl;
if(l>=pow(2,node-1)){
v.push_back(pii(node,len));
m++;
l -= pow(2,node-1);
len += pow(2,node-1);
}
node--;
}
cout << n << " " << m <<endl;
REP(i,n-1){
cout << i+1 << " " << i+2 << " " << pow(2,i) << endl;
cout << i+1 << " " << i+2 << " " << 0 << endl;
}
for(int i = 0; i < v.size();i++){
cout << v[i].first << " " << n << " " << v[i].second << endl;
}
}
|
#include <iostream>
#include <utility>
#include <tuple>
#include <string>
#include <cstdint>
#include <vector>
#include <array>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cassert>
using namespace std;
using i64 = int64_t;
struct E { int v, w; };
int id(int u) { return 20 - u; }
int l;
vector<E> g[20];
int main() {
cin >> l;
for (int u = 19; u > 0; --u) {
g[u].push_back({ u - 1, 0 });
}
for (int i = 0; (1 << (i + 1)) <= l; ++i) {
g[i + 1].push_back({ i, 1 << i });
}
for (int i = 0; i < 19; ++i) {
if ((l & (1 << i))) {
int x = l & ~((1 << (i + 1)) - 1);
if (x != 0) {
g[19].push_back({ i, x });
}
}
}
int size = 0;
for (int u = 0; u < 20; ++u) size += g[u].size();
cout << 20 << ' ' << size << endl;
for (int u = 19; u >= 0; --u) {
for (E e : g[u]) {
cout << id(u) << ' ' << id(e.v) << ' ' << e.w << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
typedef std::pair<int, int> pii;
int n, m, i, j, k, L, cntE;
std::vector<pii> gra[70];
inline void adde(int u, int v, int w) {
gra[u].push_back(std::make_pair(v, w));
cntE++;
}
int main() {
scanf("%d", &L);
int cntV = 0, _L = L;
while (_L) {
cntV++;
_L >>= 1;
}
for (int i = 1; i < cntV; i++) {
adde(i, i + 1, 0);
adde(i, i + 1, 1 << (cntV - i - 1));
}
int sum = 1 << (cntV - 1);
for (int i = cntV - 1; i >= 1; i--) {
if (L & (1 << (i - 1))) {
adde(1, cntV - i + 1, sum);
sum += 1 << (i - 1);
}
}
printf("%d %d\n", cntV, cntE);
for (int i = 1; i <= cntV; i++) {
for (pii E : gra[i]) {
printf("%d %d %d\n", i, E.first, E.second);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> PI;
vector<PI> v;
int main()
{
int l;
cin >> l;
int r;
for( r = 0; r <= 19; r++ ) {
if( (1 << (r + 1) ) > l ) {
break;
}
}
int n = r + 1;
for( int i = 1; i < n; i++ ) {
v.push_back(make_pair( make_pair(i, i + 1), 0 ) );
v.push_back(make_pair( make_pair(i, i + 1), 1 << (i - 1) ) );
}
for( int t = n; t > 0; t-- ) {
if( l - (1 << (t - 1) ) >= (1 << r) ) {
v.push_back(make_pair( make_pair(t, n), l - (1 << (t - 1) ) ) );
l -= 1 << (t - 1);
}
}
cout << n << " " << v.size() << endl;
for( int i = 0; i < v.size(); i++ ) {
cout << v[i].first.first << " " << v[i].first.second << " " << v[i].second << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define SIZE(a) int((a).size();
const int INF=INT_MAX;
struct edge{ll from,to,length;};
int main(){
ll l;cin>>l;
ll copy=l,r=0,n,m;
while(copy>1){
copy/=2;r++;
}
ll _copy=l;
l-=pow(2,r);
n=r+1;m=2*r;
ll t=r;
vll tt(0);
while(l>0){
if(l>=pow(2,t-1)){
l-=pow(2,t-1);
tt.push_back(t);
}
t--;
}
m+=tt.size();
vector<edge> g(m);
rep(i,0,r){
g[i*2].from=i+1;g[i*2].to=i+2;g[i*2].length=0;
g[i*2+1].from=i+1;g[i*2+1].to=i+2;g[i*2+1].length=pow(2,i);
}
rep(i,0,tt.size()){
g[2*r+i].from=tt[i];g[2*r+i].to=n;g[2*r+i].length=_copy-pow(2,tt[i]-1);
_copy-=pow(2,tt[i]-1);
}
cout<<n<<" "<<m<<endl;
rep(i,0,m){
cout<<g[i].from<<" "<<g[i].to<<" "<<g[i].length<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,N) for(i=0;i<N;i++)
typedef long long ll;
typedef struct{
int from,to,cost;
}edge;
int main(void){
int i,n_node=1,n_2=1,L;
cin >> L;
vector<edge> v;
while(2*n_2<=L&&n_node<20){
v.push_back({n_node,n_node+1,n_2});
n_2*=2;
n_node++;
}
int N_2=n_2;
for(i=n_node-1;i>0;i--){
n_2/=2;
if(L-n_2>=N_2){
v.push_back({i,n_node,L-n_2});
L-=n_2;
}
}
REP(i,n_node-1){
v.push_back({i+1,i+2,0});
}
cout << n_node << " " << v.size() << endl;
REP(i,v.size()){
cout << v[i].from << " " << v[i].to << " " << v[i].cost << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int popcount(long long n) { int cnt = 0; for ( ; n; n &= n - 1) cnt++; return cnt; }
int MSB1(long long x) { int d = 0; while ((1LL << d) <= x) d++; return d; }
int main() {
int L; cin >> L;
int n = MSB1(L);
int m = (n - 1) * 2 + popcount(L) - 1;
cout << n << " " << m << endl;
for (int i = 0; i + 1 < n; i++) {
cout << i + 1 << " " << i + 2 << " " << 0 << endl;
cout << i + 1 << " " << i + 2 << " " << (1 << i) << endl;
}
int cur = 1 << (n - 1);
for (int i = n - 2; i >= 0; i--) if (L & (1 << i)) {
cout << i + 1 << " " << n << " " << cur << endl;
cur += 1 << 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]);
//for(auto i : edge) if (i[0]==i[1]&&i[1]==i[2]){}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int l;
int n = 20;
vector<tuple<int, int, int>> ans;
int main(void) {
// Here your code !
scanf("%d", &l);
int r;
for (ll i = 1; i <= n; ++i) {
if ((1 << i) > l) {
r = i - 1;
break;
}
}
for (int i = 0; i < r; ++i) {
int node = i + 1;
ans.push_back(make_tuple(node, node + 1, 0));
ans.push_back(make_tuple(node, node + 1, 1 << i));
}
for (int i = r; i >= 1; --i) {
if (l - (1 << r) >= (1 << (i - 1))) {
ans.push_back(make_tuple(i, r + 1, l - (1 << (i - 1))));
l -= 1 << (i - 1);
}
}
printf("%d %d\n", r + 1, ans.size());
for (auto &e: ans) {
printf("%d %d %d\n", get<0>(e), get<1>(e), get<2>(e));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxn = 22;
vector< pair<int , int > > adj[mxn];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int pw[22];
pw[0] = 1;
for(int i = 1; i < 22; i++)
{
pw[i] = pw[i-1] *2;
}
vector< int > vt;
while(n)
{
vt.push_back(n%2);
n/=2;
}
//reverse(vt.begin() , vt.end());
n = vt.size();
int edge = 0;
for(int i = 1; i < n; i++)
{
adj[i].push_back(make_pair(i+1 , 0));
adj[i].push_back(make_pair(i+1 , pw[i-1]));
edge +=2;
}
int last = pw[n-1];
for(unsigned int i = 0; i < vt.size()-1; i++)
{
if(vt[i]==1)
{
adj[i+1].push_back(make_pair(n , last));
last += pw[i];
edge+=1;
}
}
cout<<n<<" "<<edge<<endl;
for(int i = 1; i <= n; i++)
{
for(auto v: adj[i])
{
cout<<i<<" "<<v.first<<" "<<v.second<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INFL = 1000000000000000010;//10^18 = 2^60
int INF = 2000000000;//10^9
ll MOD = 998244353;
int main() {
int L;
cin >> L;
L--;
int cnt = 0;
int M = 0;
vector<pair<pair<int, int>,int>> ANS(0);
for(int i = 0; i < 20; i++){// 2^cnt <= L < 2^(cnt+1)
if(pow(2, i) - 1 <= L){
cnt = i;
}
}
for(int i = 0; i < cnt; i++){
ANS.push_back({{i+1, i+2}, 0});
ANS.push_back({{i+1, i+2}, pow(2, i)});
}
int V = cnt + 1;//頂点数
M += pow(2, cnt) -1;
while(L != M){
cnt--;
if(L - M >= pow(2, cnt)){
ANS.push_back({{cnt+1, V},M+1});
M += pow(2, cnt);
}
}
cout << V << " " << ANS.size() << endl;
for(int i = 0; i < ANS.size(); i++){
cout << ANS.at(i).first.first << " " << ANS.at(i).first.second << " " << ANS.at(i).second << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
struct edge {
ll src, dst, cost;
edge() {}
edge(ll a, ll b, ll c) : src(a), dst(b), cost(c) {}
};
int main() {
ll L, r = 1;
ll N = 0, M;
vector<edge> G;
cin >> L;
while (r <= L) {
r *= 2;
N++;
}
for (ll i = 1; i < N; i++) {
G.push_back( edge(i, i+1, 0) );
G.push_back( edge(i, i+1, (1<<(i-1))) );
}
ll remain = L - (1<<(N-1));
for (ll i = N-1; i >= 1; i--) {
if (!remain) { break; }
if ( remain >= (1 << (i-1)) ) {
G.push_back( edge(i, N, L-remain) );
remain -= (1 << (i-1));
}
}
M = G.size();
cout << N << " " << M << endl;
for (auto &e: G) {
cout << e.src << " " << e.dst << " " << e.cost << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int l;
cin >> l;
int n = 1;
while(1<<n<=l) ++n;
vector<tuple<int,int,int>> ans;
rep(i,n-1) {
ans.emplace_back(i,i+1,0);
ans.emplace_back(i,i+1,1<<i);
}
l -= 1<<(n-1);
int val = 1<<(n-1);
for(int p = n-2; p>=0; --p){
if(l>=1<<p){
ans.emplace_back(p,n-1,val);
val += 1<<p;
l -= 1<<p;
}
}
cout << n << " " << ans.size() << endl;
rep(i,ans.size()){
int u,v,w;
tie(u,v,w) = ans[i];
printf("%d %d %d\n",u+1,v+1,w);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int l, u[100], v[100], w[100];
int main() {
cin >> l;
int eid = 0, t = 0;
while((1<<t+1) <= l) t++;
for(int i = 1; i <= t; i++) {
u[++eid] = i, v [eid] = i+1, w[eid] = 0;
u[++eid] = i, v [eid] = i+1, w[eid] = (1<<i-1);
}
int r = l-(1<<t), p = (1<<t)-1;
//cout << "r=" << r << " p=" << p << endl;
for(int i = 20; i >= 0; i--) { //边数
if(r-(1<<i) >= 0) {
r -= (1<<i);
int x = p+1;
p += (1<<i);
u[++eid] = i+1, v [eid] = t+1, w[eid] = x;
}
}
cout << t+1 << " " << eid << endl;
for(int i = 1; i <= eid; i++) {
cout << u[i] << " " << v[i] << " " << w[i] << endl;
}
return 0;
}
|
#include<iostream>
#include<climits>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
ll log(ll x, ll n){
if(x==1){
return n;
}else{
return log(x/2, n+1);
}
}
ll beki(ll x , ll n){
ll ans = 1;
for(int i = 0; i < n; i++)
{
ans *= x;
}
return ans;
}
int main(){
ll L;
cin >> L;
ll r = log(L,0);
ll N = r+1;
ll M = 0;
ll buff[60][3];
for(int i = 0; i < N-1; i++)
{
buff[M][0] = i+1;
buff[M][1] = i+2;
buff[M][2] = 0;
buff[M+1][0] = i+1;
buff[M+1][1] = i+2;
buff[M+1][2] = beki(2,i);
M += 2;
}
for(int i = N-1; i >= 1; i--)
{
if (L-beki(2,i-1) >= beki(2,r)){
buff[M][0] = i;
buff[M][1] = N;
buff[M][2] = L - beki(2,i-1);
M++;
L = L - beki(2,i-1);
}
}
cout << N << " " << M << endl;
for(int i = 0; i < M; i++)
{
cout << buff[i][0] << " " << buff[i][1] << " " << buff[i][2] << 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 SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int main(){
int l;
cin>>l;
int keta;
REP(i,25){
if(l<pow(2,i)){
keta = i;
break;
}
}
int x = l;
int a[keta];
REP(i,keta){
a[i] = x%2;
x -= x%2;
x /= 2;
}
int count = 0;
REP(i,keta){
if(a[i]==1){
count++;
}
}
int n,m;
n = keta;
m = count+keta*2-3;
cout<<n<<" "<<m<<endl;
FOR(i,1,n){
cout<<i<<" "<<i+1<<" "<<0<<endl;
cout<<i<<" "<<i+1<<" "<<pow(2,n-i-1)<<endl;
}
int sum = 0;
REP(i,n-1){
if(a[i]==1){
sum += pow(2,i);
cout<<1<<" "<<n-i<<" "<<l-sum<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Edge {
int src, dst, w;
Edge(int _s, int _d, int _w) : src(_s), dst(_d), w(_w) {}
Edge() {}
};
int main() {
cin.tie(0); ios::sync_with_stdio(false);
ll L;
cin >> L;
int d = 0;
for (int p = 2; p <= L; p *= 2) ++d;
const int n = d + 1;
vector<Edge> edge;
for (int i = 1, p = 1; i < n; ++i) {
edge.emplace_back(Edge(i, i + 1, 0));
edge.emplace_back(Edge(i, i + 1, p));
p *= 2;
}
int sum = pow(2, d), res = L - sum;
for (int i = d - 1; 0 <= i; --i) {
if (res >> i & 1) {
edge.emplace_back(Edge(i + 1, n, sum));
sum += pow(2, i);
}
}
// Output
cout << n << ' ' << edge.size() << '\n';
for (const auto &e : edge)
cout << e.src << ' ' << e.dst << ' ' << e.w << '\n';
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int L;
vector<vector<int>> ans;
int r=1,i=1;
cin >> L;
while(2*r<=L){
ans.push_back({i,i+1,0});
ans.push_back({i,i+1,r});
++i;
r*=2;
}
while(r!=L){
int j=log2(L-r);
ans.push_back({j+1,i,r});
r+=pow(2,j);
}
cout << i << " " << ans.size() << endl;
for(int i=0;i<ans.size();++i) {
cout << ans[i][0] << " " << ans[i][1] << " " << ans[i][2] << endl;
}
return 0;
}
|
#include<iostream>
#include<climits>
#include<vector>
#include<list>
#include<functional>
#include<algorithm>
#include<string>
#include<cmath>
#include<complex>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define INF (int)1e9
#define INFL (ll)1e11
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L;
cin >> L;
vector<int> pow2;
int tmp = 1;
while (tmp <= L) {
pow2.push_back(tmp);
tmp *= 2;
}
int N = pow2.size();
int M = 2 * (N - 1);
int i = N - 2;
vector<pair<int, int>> sd;
while (L > pow2[N - 1]) {
if (L - pow2[i] >= pow2[N - 1]) {
L -= pow2[i];
sd.push_back(P(i + 1, L));
M++;
}
i--;
}
cout << N << " " << M << "\n";
for (int i = 1;i < N;i++) {
cout << i << " " << i + 1 << " " << 0 << "\n";
cout << i << " " << i + 1 << " " << pow2[i - 1] << "\n";
}
REP(i, sd.size()) {
cout << sd[i].first << " " << N << " " << sd[i].second << "\n";
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
struct edge{ll from,to,weight;};
int vertex,num=1;
vector<edge> g;
vector<int> v;
void multi_2(){
for(auto &elem : g){
elem.weight *= 2;
}
vertex++;
num *= 2;
g.push_back({vertex,vertex+1,1});
g.push_back({vertex,vertex+1,0});
}
void plus_1(){
g.push_back({1,vertex+1,num});
num++;
}
int main(){
ll L;
cin >> L;
ll tmp = L;
vertex=0;
while(tmp > 0){
v.push_back(tmp%2);
tmp /= 2;
}
reps(i,1,v.size()){
if(v[v.size()-1-i] == 0){
multi_2();
}else{
multi_2();
plus_1();
}
}
cout << vertex+1 << " " << g.size() << endl;
for(auto e : g){
cout << e.from << " " << e.to << " " << e.weight << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
int l, ans = 0;
cin >> l;
int n = 1, m = 0;
while((1 << n) <= l) n++;
vector<int> a(n);
vector<string> s;
for(int i = 1; i < n; i++){
int x = 1 << (i - 1);
s.push_back(to_string(i) + " " + to_string(i + 1) + " 0");
s.push_back(to_string(i) + " " + to_string(i + 1) + " " + to_string(x));
a[i] = a[i - 1] + x;
}
int t = a[n - 1] + 1;
for(int i = n - 1; i >= 0; i--){
if(a[i] + t <= l - 1){
s.push_back(to_string(i + 1) + " " + to_string(n) + " " + to_string(t));
t = a[i] + t + 1;
}
}
m = s.size();
cout << n << " " << m << endl;
for(auto&& i : s){
cout << i << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include<chrono>
#define ll long long
using namespace std;
ll MOD = 1e9 + 7;
ll A, B, H, N, M, L, K, W, X, Y, Z;
ll ans = 0;
int main() {
cin >> L;
vector<tuple<int,int,int>>path;
vector<bool>flag;
while (L != 2) {
if (L & 1) {
L--;
flag.push_back(1);
}
else {
L /= 2;
flag.push_back(0);
}
}
path.push_back(make_tuple(1, 2, 0));
path.push_back(make_tuple(1, 2, 1));
N = 2;
ll l = 2;
for (int i = flag.size() - 1; i >= 0; i--) {
if (flag[i]) {
path.push_back(make_tuple(1, N, l));
l++;
}
else {
for (int j = 0; j < path.size(); j++) {
get<2>(path[j]) *= 2;
}
path.push_back(make_tuple(N, N + 1, 0));
path.push_back(make_tuple(N, N + 1, 1));
N++;
l *= 2;
}
}
cout << N <<" "<< path.size() << endl;
for (tuple<int, int, int> i : path)
cout << get<0>(i) <<" "<< get<1>(i) <<" "<< get<2>(i) << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int l;
cin >> l;
int d;
rep(i, 20){
if(1 & (l >> i))d = i + 1;
}
int n = d;
int m = 2 * (d - 1);
vector<int> u, v, w;
rep(i, d - 1)rep(j, 2){
u.push_back(i+1);
v.push_back(i+2);
w.push_back(j * pow(2, i));
}
for(int i = d - 2; i >= 0; i--){
if(l - pow(2, i) >= pow(2, d - 1)){
u.push_back(i+1);
v.push_back(d);
w.push_back(l - pow(2, i));
l -= pow(2, i);
m++;
}
}
cout << n << ' ' << m << endl;
rep(i, u.size()){
cout << u[i] << ' ' << v[i] << ' ' << w[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
int l;
cin >> l;
int cnt = 0;
while(pow(2, cnt) <= l) cnt++;
vector<vector<int>> ans;
for(int i = 1; i < cnt; i++){
ans.push_back({i, i + 1, 0});
ans.push_back({i, i + 1, (int)pow(2, i - 1)});
}
int now = pow(2, cnt - 1) - 1;
for(int i = cnt - 1; i > 0; i--){
if(l - now > pow(2, i - 1)){
ans.push_back({i, cnt, now + 1});
now += pow(2, i - 1);
}
}
cout << cnt << " " << ans.size() << endl;
REP(i,ans.size()){
cout << ans[i][0] << " " << ans[i][1] << " " << ans[i][2] << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int L;
cin >> L;
vector<tuple<int,int, int>>Ans;
int N = 2;
int pow = 1;
Ans.push_back(make_tuple(N-1,N,0));
Ans.push_back(make_tuple(N - 1, N, pow));
while (pow*4 -1 < L ) {
pow *= 2;
N++;
Ans.push_back(make_tuple(N - 1, N, 0));
Ans.push_back(make_tuple(N - 1, N, pow));
}
L--;
int now = pow * 2 - 1;
while (L != now) {
int num = now + 1;
int powsub = 1;
int count = 0;
while ((powsub * 2 - 1) + num <= L) {
powsub *= 2;
count++;
}
Ans.push_back(make_tuple(1 + count,N, num));
now = num + powsub - 1;
}
cout << N<<" "<<Ans.size()<<endl;
for (int n = 0;n<Ans.size();++n) {
cout << get<0>(Ans[n]) << " "<<get<1>(Ans[n]) << " "<<get<2>(Ans[n]) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
struct data {
int from, to;
int cost;
data(int from, int to, int cost): from(from), to(to), cost(cost) {}
};
int main() {
int L;
cin >> L;
int r = floor(log2(L));
int N = r+1;
vector<data> ans;
REP(i, 1, r+1) {
ans.push_back(data(i, i+1, 0));
ans.push_back(data(i, i+1, pow(2, i-1)));
}
for(int i=N-1; i>=1; i--)
if(L - pow(2, i-1) >= pow(2, r)) {
ans.push_back(data(i, N, L-pow(2, i-1)));
L -= pow(2, i-1);
}
cout << N << ' ' << ans.size() << endl;
for(auto a: ans)
cout << a.from << ' ' << a.to << ' ' << a.cost << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
struct edge
{
int u,v,w;
edge(int u=0,int v=0,int w=0):u(u),v(v),w(w){}
}e[100005];
int main()
{
// freopen("f.in","r",stdin);
// freopen("f.out","w",stdout);
int l,jl1,jl2;
cin>>l;
for(int i=2;(1<<i-1)<=l;i++)
{
jl1=i,jl2=l-(1<<i-1);
}
int n=jl1;
cout<<n<<" ";
int m=0;
for(int i=1;i<jl1;i++)
{
e[++m]=edge(i,i+1,0);
e[++m]=edge(i,i+1,(1<<i-1));
}
int tt=(1<<jl1-1);
for(int i=20;i>=0;i--)if(jl2&(1<<i))
{
jl2^=(1<<i);
e[++m]=edge(i+1,n,tt);
tt+=1<<i;
}
cout<<m<<endl;
for(int i=1;i<=m;i++)
{
printf("%d %d %d\n",e[i].u,e[i].v,e[i].w);
}
return 0;
}
|
#define rep(i,n) for (int i = 0; i < n; i++)
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <math.h>
#include <complex>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const ll INF = 1e18;
struct edge {
int from, to, cost;
};
int main() {
int l; cin >> l;
int r = 30;
while (pow(2, r) > l) r--;
int m = r + 1, cnt = 0;
vector<edge> e;
rep(i, r) {
e.push_back({ i + 1,i + 2,(int)pow(2,i) });
e.push_back({ i + 1,i + 2,0 });
cnt += 2;
}
rep(i, m) {
int j = m - i;
if (j == 0) continue;
if (l - pow(2, j - 1) < pow(2, r)) continue;
e.push_back({ j, m, (int)(l - pow(2, j - 1)) });
cnt++;
l -= pow(2, j - 1);
}
cout << m << " " << cnt << endl;
rep(i, cnt) {
cout << e[i].from << " "<< e[i].to <<" "<< e[i].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};
int log2l = 0;
for (int i = 1; i <= l; i *= 2) {
sum_pow2.push_back(sum_pow2.back() + i);
log2l++;
}
int n = log2l, m = (n - 1) * 2;
int cur = l, lim = l, idx = 0;
stringstream sout;
while (cur != 1) {
if (cur % 2 == 1) {
m++;
cur--;
sout << idx + 1 << ' ' << n << ' ' << lim - 1 - sum_pow2[idx] << '\n';
lim = lim - 1 - sum_pow2[idx];
}
cur /= 2;
idx++;
}
for (int i = 0, pow2 = 1; i < n - 1; ++i, pow2 *= 2) {
sout << i + 1 << ' ' << i + 2 << ' ' << 0 << '\n';
sout << i + 1 << ' ' << i + 2 << ' ' << pow2 << '\n';
}
cout << n << ' ' << m << '\n';
cout << sout.str();
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
using matrix = vector<vector<uint>>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acos(-1);
struct edge {
int from, to, len;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L;
cin >> L;
int N = 0;
vector<edge> ans;
while ((1 << N) <= L)
N++;
for (int i = 0; (L >> i) > 1; i++) {
ans.push_back({N - i - 1, N - i, 0});
ans.push_back({N - i - 1, N - i, 1 << i});
}
int len = (1 << (N - 1));
for (int i = N - 2; i >= 0; --i) {
if (L & (1 << i)) {
ans.push_back({1, N - i, len});
len |= (1 << i);
}
}
printf("%d %d\n", N, ans.size());
for (auto e : ans)
printf("%d %d %d\n", e.from, e.to, e.len);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int l;
cin >> l;
int n = 20;
vector<int> u, v, w;
for(int i = 1; i < 20; i++){
u.emplace_back(i);
v.emplace_back(i + 1);
w.emplace_back(0);
}
int next = 1;
int boundary = 1;
while(true){
if(pow(2, boundary + 1) - 1 < l) boundary++;
else break;
}
for(int i = 1; i <= boundary; i++){
u.emplace_back(i);
v.emplace_back(i + 1);
w.emplace_back(pow(2, i - 1));
}
next = pow(2, boundary);
while(next != l){
int dif = l - next;
boundary = 0;
while(true){
if(pow(2, boundary + 1) - 1 < dif) boundary++;
else break;
}
u.emplace_back(boundary + 1);
v.emplace_back(20);
w.emplace_back(next);
next += pow(2, boundary);
}
cout << n << " " << u.size() << '\n';
for(int i = 0; i < u.size(); i++){
cout << u.at(i) << " " << v.at(i) << " " << w.at(i) << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int L;
cin >> L;
int r = 0;
while(L >> (r + 1)) ++r;
int cnt = __builtin_popcount(L) - 1;
cout << r + 1 << ' ' << 2 * r + cnt << endl;
for(int i=0; i<r; ++i) {
cout << i + 1 << ' ' << i + 2 << ' ' << 0 << endl;
cout << i + 1 << ' ' << i + 2 << ' ' << (1 << i) << endl;
}
for(int i=r-1; i>=0; --i) {
if(L - (1 << i) >= (1 << r)) {
cout << i + 1 << ' ' << r + 1 << ' ' << L - (1 << i) << endl;
L ^= (1 << i);
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int L;
scanf("%d",&L);
int vtx = 0,cp=L,edg;
vector<int> V; //pos of zeros
for(int it,i=0;(it=1<<i)<=L;i++){
if(it&L)
V.push_back(i); //10000 -> 0(0000~1111), the place of 1->0.
vtx = i+1;
edg = 2*(vtx-1) + V.size()-1;
}
printf("%d %d\n",vtx,edg);
for(int i=1;i<vtx;i++){
printf("%d %d %d\n",i,i+1,1<<(vtx-1-i));
printf("%d %d %d\n",i,i+1,0);
}
for(int x:V){
//x : the place of i
int it = 1<<x;
int from =1,to = vtx - x;
int val = L - (L&(2*it-1));
//printf("%d\n",L&(2*it-1));
if(val!=0) printf("%d %d %d\n",from,to,val);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int f (int x) {
int r = 0;
while (r < 19 and (1 << (r + 1)) <= x) r++;
return r;
}
int main() {
int l;
cin >> l;
const int r = f(l);
vector<pair<P, int>> edge;
for (int v = 0; v < r; v++) {
edge.emplace_back(P(v, v + 1), 0);
edge.emplace_back(P(v, v + 1),(1 << v));
}
for (int v = r - 1; v >= 0; v--) {
int val = l - (1 << v);
if (val >= (1 << r)) {
edge.emplace_back(P(v, r), val);
l = val;
}
}
cout << r + 1 << ' ' << edge.size() << '\n';
for (const auto &e : edge) {
int v, u; tie(v, u) = e.first;
cout << v + 1 << ' ' << u + 1 << ' ' << e.second << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int power(int n){
int res=1;
rep(i,0,n) res*=2;
return res;
}
int main(){
int l;
cin>>l;
vector<bool> v;
int a=l;
while(a>0){
v.push_back(a%2);
a/=2;
}
int n=v.size();
reverse(v.begin(),v.end());
//cout<<n<<endl;
vector<int> b,c,d;
rep(i,0,n-1){
b.push_back(i);
c.push_back(i+1);
d.push_back(0);
}
int cur=1;
rep(i,0,n-1){
b.push_back(i);
c.push_back(i+1);
d.push_back(cur);
cur*=2;
}
rep(i,1,n){
if(v[i]){
b.push_back(n-1-i);
c.push_back(n-1);
d.push_back(cur);
cur+=power(n-1-i);
}
}
int e=b.size();
cout<<n<<' '<<e<<endl;
rep(i,0,e){
cout<<b[i]+1<<' '<<c[i]+1<<' '<<d[i]<<endl;
}
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
long long l;
cin>>l;
int n=floor(log2(l));
//long long dp[n]={};
string ans="";
int m=0;
rep(i,n){
ans+=to_string(i+1)+" "+to_string(i+2)+" 0"+"\n";
m++;
ans+=to_string(i+1)+" "+to_string(i+2)+" "+to_string(1<<(n-i-1))+"\n";
m++;
}
long long cmax=(1<<n);
l-=cmax;
int cn;
while (l>=1){
cn=n-floor(log2(l))+1;
ans+="1 "+to_string(cn)+" "+to_string(cmax)+"\n";
m++;
cmax+=(1<<(int)floor(log2(l)));
l-=(1<<(int)floor(log2(l)));
}
cout<<n+1<<" "<<m<<endl<<ans;
return 0;
}
|
#include<bits/stdc++.h>
#define maxn 100005
#define inf (1<<30)
#define mod 1000000007
using namespace std;
typedef long long LL;
int read()
{
char c=getchar();int f=1,sum=0;
while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0' && c<='9'){sum=sum*10+c-'0';c=getchar();}
return sum*f;
}
int L;
int bit[25],sum[25];
void init()
{
sum[0]=bit[0]=1;
for(int i=1;i<=21;i++)
{
bit[i]=bit[i-1]<<1;
sum[i]=sum[i-1]+bit[i];
}
}
int res[25],tot;
int main()
{
init();
L=read();
for(int i=0;bit[i]<=L;i++)
{
if(L&bit[i])
res[++tot]=i;
}
printf("%d %d\n",res[tot]+1,res[tot]*2+tot-1);
for(int i=1;i<=res[tot];i++)
printf("%d %d 0\n",i,i+1);
for(int i=res[tot]+1;i>=2;i--)
printf("%d %d %d\n",i-1,i,bit[res[tot]+1-i]);
int maxa=sum[res[tot]-1];
for(int i=tot-1;i>=1;i--)
{
maxa++;
printf("1 %d %d\n",res[tot]+1-res[i],maxa);
maxa+=sum[res[i]-1];
}
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 998244353
#define INF 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
int main() {
ll l, bs;
cin >> l;
vector<string> v;
REP(i, 21) {
if (pow(2, i) > l) {
bs = i;
break;
}
}
cout << bs;
REP(i, bs - 1) {
v.pb(to_string((i + 1)) + " " + to_string((i + 2)) + " " + to_string(int(pow(2, bs - 2 - i))));
v.pb(to_string((i + 1)) + " " + to_string((i + 2)) + " " + to_string(0));
}
int x = 1 << (bs - 1);
for (int i = bs - 2; i >= 0; i--) {
if ((l >> i) & 1) {
v.pb(to_string(1) + " " + to_string(bs - i) + " " + to_string(x));
x += 1 << i;
}
}
cout << " " << v.size() << endl;
for (auto &a : v) {
cout << a << endl;
}
}
|
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 30
using namespace std;
int n,m,l,now,num[N];
vector<int>son[N],val[N];
int main()
{
int i,j;
cin>>n;
now=n;
for(; n; n/=2)
{
num[++l]=n%2;
}
// reverse(num+1,num+l+1);
// for(i=1;i<=l;i++) cout<<num[i]<<" ";return 0;
for(i=2; i<l; i++)
{
son[i-1].push_back(i);
val[i-1].push_back(0);
son[i-1].push_back(i);
val[i-1].push_back((1 << (i-2)));
}
for(i=l-1; i>=1; i--)
{
if(!num[i]) continue;
now-=(1 << (i-1));
son[i].push_back(l);
val[i].push_back(now);
}
now-=(1 << (l-1));
son[l-1].push_back(l);
val[l-1].push_back(now);
son[l-1].push_back(l);
val[l-1].push_back((1 << (l-2))+now);
for(i=1; i<=l; i++) m+=son[i].size();
cout<<l<<" "<<m<<endl;
for(i=1; i<=l; i++)
{
for(j=0; j<son[i].size(); j++)
{
printf("%d %d %d\n",i,son[i][j],val[i][j]);
}
}
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int L;
vector< vector<int> > ans;
int r = 1, i = 1;
cin >> L;
while( 2*r <= L ) {
ans.push_back( {i,i+1,0} );
ans.push_back( {i,i+1,r} );
i++; r*=2;
}
while( r != L ) {
int j = (int)log2(L-r);
ans.push_back( {j+1,i,r} );
r += (int)pow(2,j);
}
printf("%d %d\n", i, (int)ans.size());
for ( int i = 0; i < ans.size(); i++) {
printf("%d %d %d\n", ans[i][0], ans[i][1], ans[i][2] );
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll,ll,ll> T;
int main() {
ll L; cin >> L;
ll r = 0;
for (ll i = 0; i < 30; i++) {
if (L >= 1 << i) {r = i;}
}
vector<T> es;
for (ll i = 0; i < r; i++) {
es.push_back(T(i+1,i+2,0));
es.push_back(T(i+1,i+2,1 << i));
}
ll leng = 1 << r;
for (ll i = r-1; i >= 0; i--) {
if (L >> i & 1) {
es.push_back(T(i+1,r+1,leng));
leng += (1 << i);
}
}
cout << r+1 << " " << es.size() << endl;
for (ll i = 0; i < es.size(); i++) {
cout << get<0>(es[i]) << " " << get<1>(es[i]) << " " << get<2>(es[i]) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 100;
struct node {
int u, v, w;
} e[100];
int tot = 0;
int b[100];
int main() {
int l;
scanf("%d", &l);
for (int i = 1; i < 20; i++) {
e[tot++] = {i, i + 1, 0};
}
b[0] = 1;
int to = 0;
for (int i = 1; i <= 21; i++) {
b[i] = b[i - 1] * 2;
if (b[i] - 1 < l) to = i;
}
for (int i = 1; i <= to; i++) {
e[tot++] = {i, i + 1, b[i - 1]};
}
int now = b[to];
while (now != l) {
int rest = l - now;
to = 0;
for (int i = 1; i <= 21; i++) {
if (b[i] - 1 < rest) to = i;
}
e[tot++] = {to + 1, 20, now};
now += b[to];
}
printf("%d %d\n", 20, tot);
for (int i = 0; i < tot; i++) {
printf("%d %d %d\n", e[i].u, e[i].v, e[i].w);
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include<algorithm>
#include<sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll MOD_CONST = 1000000007;
const ll BIG_NUM = 1000000000000000000;
int main() {
int l;
cin >> l;
int r = 0;
while (true) {
if ((1 << (r + 1)) <= l) {
r++;
}
else {
break;
}
}
int n = r+1;
set<pair<int,int>> path;
vector<pair<int, int>>toGoalPath;
{
int l_tmp = l;
for (int i = n - 1;i > 0;i--) {
if (l_tmp - (1 << (i - 1)) >= (1 << r)) {
toGoalPath.emplace_back(make_pair(i, l_tmp - (1 << (i - 1))));
l_tmp -= (1 << (i - 1));
}
}
}
int m = 2 * (n - 1) + toGoalPath.size();
cout << n << " " <<m<< endl;
for (int i = 1; i <n ;i++) {
cout << i << " " << i+1 << " " << 0 << endl;
cout << i << " " << i + 1 << " " << (1 <<(i-1)) << endl;
}
for (auto it = toGoalPath.begin(); it != toGoalPath.end(); it++) {
cout << it->first << " " << n << " " << it->second << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int l;
cin >> l;
int n = log2(l);
vector<tuple<int, int, int>> ans;
for (int i = 0; i < n; i++) {
ans.emplace_back(i + 1, i + 2, 0);
ans.emplace_back(i + 1, i + 2, 1 << i);
}
for (int t = n; t >= 0; t--) {
int s = l - (1 << t);
if (s >= 1 << n) {
ans.emplace_back(t + 1, n + 1, s);
l = s;
}
}
cout << n + 1 << " " << ans.size() << endl;
for (auto& e : ans) cout << get<0>(e) << " " << get<1>(e) << " " << get<2>(e) << endl;
}
|
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
int L,cnt;
int st[61],to[61],cost[61];
int main(){
ios::sync_with_stdio(false);
cin>>L;reg int pos=0;
for(reg int i=20;i&&(!pos);i--)if(L&(1<<i))pos=i;
for(reg int i=1;i<pos;i++){
st[++cnt]=i;to[cnt]=i+1;cost[cnt]=0;
st[++cnt]=i;to[cnt]=i+1;cost[cnt]=1<<(i-1);
}
st[++cnt]=pos;to[cnt]=20;cost[cnt]=0;
st[++cnt]=pos;to[cnt]=20;cost[cnt]=1<<(pos-1);
reg int l=1<<pos;
while(l<L){
pos=0;for(reg int i=20;i&&(!pos);i--)if((1<<i)&(L-l))pos=i;
st[++cnt]=pos+1;to[cnt]=20;cost[cnt]=l;l|=1<<pos;
}
cout<<20<<' '<<cnt<<endl;
for(reg int i=1;i<=cnt;i++)
cout<<st[i]<<' '<<to[i]<<' '<<cost[i]<<endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <functional>
using namespace std;
typedef long long int ll;
typedef tuple<int,int,int> edge;
#define repi(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,a) repi(i,0,a)
#define rrep(i,a) for(ll i=a-1;i>=0;i--)
int main(){
int L;
cin >> L;
int N = 1;
int L_ = L;
while(L_ >>= 1) N++;
vector<edge> edges;
repi(i, 1, N){
edges.emplace_back(i, i+1, 0);
edges.emplace_back(i, i+1, 1 << (i-1));
}
L_ = L;
repi(i, 1, N){
if(L_ % 2) edges.emplace_back(i, N, (L_-1) << (i-1));
L_ >>= 1;
}
printf("%d %d\n", N, (int)edges.size());
for(auto it = edges.begin(); it != edges.end(); ++it){
printf("%d %d %d\n", get<0>(*it), get<1>(*it), get<2>(*it));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
struct edge {
int s;
int e;
int w;
edge(int s, int e, int w) {
this->s = s;
this->e = e;
this->w = w;
}
};
int main() {
int L;
cin >> L;
vector<edge> graph;
int r = log2(L);
int n = r + 1;
int x = 1;
for (int i = 1; i < n; ++i) {
graph.push_back(edge(i, i + 1, 0));
graph.push_back(edge(i, i + 1, x));
x <<= 1;
}
int w = 0;
while (L & (x - 1)) {
L = L & (x - 1);
w += x;
r = log2(L);
graph.push_back(edge(r + 1, n, w));
if (r <= 0) break;
x = 1 << r;
}
cout << n << " " << graph.size() << endl;
for (auto& e : graph) {
cout << e.s << " " << e.e << " " << e.w << endl;
}
return 0;
}
static int speedUp = []() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}();
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(),(A).end()
#define ll long long
const ll mod = 1e9+7;
const ll INF = 2*1e18;
const int inf = 1e9+7;
int func(int x,int y){
if(y==0)return 1;
int ret = 1;
for(int i=1;i<=y;i++){
ret*=x;
}
return ret;
}
int main(void){
int L;
cin >> L;
int N,r=1,X=2;
while(X<=L){
r++;
X*=2;
}
r--;
N = r + 1;
vector<tuple<int,int,int>> v;
for(int i = 1;i<N;i++){
v.push_back(make_tuple(i,i+1,0));
v.push_back(make_tuple(i,i+1,func(2,i-1)));
//printf("%d %d %d\n",i,i+1,0);
//printf("%d %d %d\n",i,i+1,func(2,i-1));
}
for(int i=N-1;i>=1;i--){
if( (L-func(2,i-1) ) >=func(2,r) ){
//printf("%d %d %d\n",i,N,L-func(2,i-1));
v.push_back(make_tuple(i,N,L-func(2,i-1)));
L-=func(2,i-1);
}
}
cout << N <<" " << v.size() << endl;
for(int i=0;i<v.size();i++){
cout << get<0>(v[i]) <<" "<< get<1>(v[i]) <<" "<< get<2>(v[i]) <<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
struct edge {
ll from, to, val;
};
signed main() {
ll L;
cin>>L;
vector<edge> edges;
ll d = 0;
while ((1ll << (d+1)) <= L){
d++;
}
rep(i,1,d+1){
edges.push_back({i,i+1,0});
edges.push_back({i,i+1,1LL<<(i-1)});
}
ll val = 1ll << d; //32
for (ll i = d-1; i>=0; i--) {
if ((L & (1ll<<i)) == 0)
continue;
// printf("val=%d\n",val);
edges.push_back({i+1,d+1,val});
val += 1ll << i;
}
printf("%d %d\n", d+1, edges.size());
for(auto e : edges){
printf("%d %d %d\n", e.from, e.to, e.val);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
struct edge{
int u,v,w;
};
int main(){
int L;
cin >> L;
int p = 1;
int c = 0;
while((p<<1)<L) p<<=1,++c;
if(L!=p*2){
p>>=1;
--c;
}
int n = c+2;
vector<edge> ans;
int q = 1;
int sum = 1;
for(int i=n-1;i>=1;i--){
ans.push_back(edge{i,i+1,q});
ans.push_back(edge{i,i+1,0});
q <<= 1;
sum *= 2;
}
for(int i=n-2;i>=0;i--){
if(L>>i&1){
ans.push_back(edge{1,n-i,sum});
sum += (1<<i);
}
}
cout << n << " " << ans.size() << endl;
rep(i,ans.size()){
cout << ans[i].u << " " << ans[i].v << " " << ans[i].w << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <map>
using ll = long long;
using namespace std;
struct edge{int u, v, w;};
int main() {
int l;
cin >> l;
int d = 1 << 20, i = 1;
for ( ; (2 * d & l) == 0; d >>= 1);
vector<edge> ans;
for (int cur=2 * d; d > 0; (i++, d >>= 1)) {
ans.push_back(edge{i, i+1, 0});
ans.push_back(edge{i, i+1, d});
if (l - cur >= d) {
ans.push_back(edge{1, i+1, cur});
cur += d;
}
}
cout << i << ' ' << ans.size() << '\n';
for (auto &e:ans) cout << e.u << ' ' << e.v << ' ' << e.w << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string s;
long long int a[5]={};
string march="MARCH";
for(int i=0;i<n;i++){
cin>>s;
for(int j=0;j<5;j++)
if(s.at(0)==march[j])
a[j]++;
}
long long int ans=0;
for(int i=0;i<3;i++)
for(int j=i+1;j<4;j++)
for(int k=j+1;k<5;k++){
ans+=a[i]*a[j]*a[k];
}
cout<<ans;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#define MAX_A 2333
#define MAX_L 15
#define int long long
using namespace std;
const char c[]="MARCH";
int n;
int f[MAX_A];
char s[MAX_L];
int cal()
{
int ans=0;
for(int i=0;i<5;i++)
{
for(int j=i+1;j<5;j++)
{
for(int k=j+1;k<5;k++)
{
ans+=f[c[i]]*f[c[j]]*f[c[k]];
}
}
}
return ans;
}
signed main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++) scanf("%s",s),f[s[0]]++;
printf("%lld\n",cal());
}
|
#include<iostream>
#include<string>
const char c[5]={'M','A','R','C','H'};
using namespace std;
int main(){
int n;
cin >> n;
string s;
long cnt[5]={0};
for(int i=0;i<n;i++){
cin >> s;
for(int j=0;j<5;j++){
if(s[0]==c[j]) cnt[j]++;
}
}
long long res=0;
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
for(int k=j+1;k<5;k++){
res=res+cnt[i]*cnt[j]*cnt[k];
}
}
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
string S;
char b[5]={'M','A','R','C','H'};
long long a[5]={};
rep(i,N){
cin >> S;
rep(j,5) if(S[0]==b[j]) a[j]++;
}
int c[10]={0,0,0,0,0,0,1,1,1,2};
int d[10]={1,1,1,2,2,3,2,2,3,3};
int e[10]={2,3,4,3,4,4,3,4,4,4};
long long ans=0;
rep(i,10) ans+=a[c[i]]*a[d[i]]*a[e[i]];
cout << ans <<endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(){
int N;
ll M=0,A=0,R=0,C=0,H=0;
cin >> N;
vector<char> S;
string tmp;
while(cin >> tmp){
char f=tmp[0];
if(f=='M'){M++;}
else if(f=='A'){A++;}
else if(f=='R'){R++;}
else if(f=='C'){C++;}
else if(f=='H'){H++;}
}
ll ans=M*A*R +M*A*C +M*A*H +M*R*C +M*R*H+ M*C*H +A*R*C+ A*R*H +A*C*H +R*C*H;
cout << ans;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.