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) prin... |
#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_bac... |
#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});
... |
#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<<... |
#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);
fo... |
#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),... |
#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 ... |
// 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_stdi... |
// 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(... |
#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 MO... |
#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 ma... |
#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);
... |
#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;
wh... |
#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);
... |
#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;
... |
// 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});
}
f... |
#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 m... |
#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)});
... |
#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;
st... |
#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() {
c... |
#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++){
... |
#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))));... |
#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,c... |
#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 ... |
#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++){
... |
#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]... |
#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 << " "... |
#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,c... |
#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;
stringstrea... |
//#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;... |
#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, l... |
#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... |
#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() {
... |
#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;
c... |
#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 ... |
#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 IN... |
#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;
... |
#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<ed... |
#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 <cst... |
#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... |
#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) ... |
#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 >... |
#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(){... |
#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;
#de... |
#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... |
#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... |
#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 = 10000000... |
#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(... |
#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)}... |
// 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;
... |
#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;
... |
#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){
... |
#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 ... |
#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).be... |
#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... |
#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-... |
#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... |
#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)... |
/// 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);
... |
#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<... |
#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);
... |
#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;
in... |
#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, ... |
#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>::m... |
#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",&... |
#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=... |
#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;... |
#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 << ... |
#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++) {
... |
#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) r... |
#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("... |
#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 ... |
#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 ... |
#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;
res... |
#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... |
/*
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){
t... |
#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... |
#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 ... |
#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)
... |
#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... |
#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 ... |
#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 {... |
#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_p... |
#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)
{
... |
#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, ... |
#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] << e... |
#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)... |
#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) {
... |
#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... |
#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) {
... |
#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... |
#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... |
#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;... |
#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... |
#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 ... |
#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(){
... |
#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 << " " <... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.