code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 |
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#define F first
#define S second
#define PB push_back
using namespace std;
const int MAXN = 10005;
int sz[MAXN], par[MAXN];
vector<pair<int, pair<int, int> > > e;
int getpar(int x)
{
if(par[x] == -1)
return x;
return par[x] = getpar(par[x]);
}
bool add(in... | #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
long long int INF = 1000000000000LL;
#define MAX_V 120000
struct edge{
long long int to, cost;
};
typedef pair<long long int, long long int> P;
vector<edge> G[MAX_V];
long long int d[MAX_V];
void shortest_path(int s, int V){
priori... | 0 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define ALL(x) x.begin(),x.end()
int get_int(){int x;scanf("%d",&x);return x;}
typedef long long ll;
const int mod = 998244353;
inline int mul(int x,int y){return 1ll*x*y%... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
cout << n/3 << endl;
} | 0 |
#define _USE_MATH_DEFINES
#include <cmath>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<vector>
#include<cctype>
#define rep(i,start,n) for(int i=start;i<n;i++)
#define And &&
#define Or ||
#define Lb cout<<endl
using namespace std;
int main(void) {
string str; cin >> str;
int q; ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
string S;
cin >> S;
int n;
cin >> n;
for(int i=0; i<n; ++i){
string order;
cin >> order;
if( order == "print"){
int a, b;
cin >> a >... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; ++i) {
int x; cin >> x;
if (pq.size() < k) pq.push(x);
else if (pq.... | /** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
Copyright */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 123456789;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFO... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const ld eps = 1e-9;
const ll MOD = 1000000007;
const i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char a,b,c;
cin>>a>>b>>c;
int ans = 0;
if(a=='R'&&b=='R'&&c=='R')
ans = 3;
else if((a=='R' && b=='R')|| (b=='R'&&c=='R'))
ans= 2;
else if(a=='R'||b=='R'||c=='R')
ans =1;
cout<<ans;
return 0;
}
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long l... | 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author rahdirigs
*/
#include <bits/stdc++.h>
using namespace std;
const int mxN = 310;
double dp[mxN][mxN][mxN];
bool vis[mxN][mxN][mxN];
int N;
class TaskJ {
public:
void solve(std::istream& in, std::ostream& out) {
in... | #include<bits/stdc++.h>
using namespace std;
#define ar array
#define endl '\n'
#define ll long long
#define in insert
#define pb push_back
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(ll i=a;i>... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int n,m;
cin >> n >> m;
if(n == m){
cout << 2*m;
}
else{
cout << 2*max(m,n)-1;
}
} | #include <iostream>
using namespace std;
int main()
{
int a, b, ans = 0;
cin >> a >> b;
ans += max(a , b);
if(a == b) ans += max(a, b);
else ans += ans - 1;
cout << ans << endl;
return 0;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <bitset>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define ALL(g) (g).begin(),... | /*
Problem 33
https://atcoder.jp/contests/abc088/tasks/abc088_d
*/
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 100000000... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
set<int> nums;
int a;
whil... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
const int BIG_NUM = 1e9;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
if(a == b ... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length()%2 != 0) {
cout << "No" << endl;
return 0;
}
else {
for (int i = 0; i < s.length(); i++) {
if (i%2==0 && s[i]!='h' || i%2==1 && s[i]!='i') {
cout << "No" ... | 0 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b, c, d, e, k;
vector<int>at(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x[7];
bool q=true;
for(int i=0;i<6;i++){
cin>>x[i];
}
if(x[4]-x[0]>x[5])q=false;
if(q==true) cout<<"Yay!";
else cout<<":(";
cout<<"\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
string N_str;
cin >> N_str;
... | #include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
int r=0;
for(int i=0;i<3;i++){
if(s[i]=='R')
r=1;
}
for(int i=0;i<2;i++){
if(s[i]=='R'){
if(s[i]==s[i+1])
r++;
}
}
cout<<r<<"\n";
}
| 0 |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#defi... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
static long Gcd(long m, long n)
{
long temp;
while (m % n != 0)
{
temp = n;
n = m % n;... | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
class UnionFind
{
public:
vector<int> parent;
UnionFind(int N)
{
for (int i = 0; i < N; i++)
{
parent.push_back(-1);
}
}
int root(int A)
{
if (parent[A] < 0)
return A;
return par... | 1 |
#include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
#include<queue>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
const int MOD = 1000000007;
#define rep(i,n... | #include<iostream>
using namespace std;
int n, m, k;
int t[100][100], c[100][100];
int INF = 1<<21;
void solve(){
for(int k = 0; k < m; k++){
for(int i = 0; i < m; i++){
for(int j = 0; j < m; j++){
t[i][j] = min(t[i][j], t[i][k] + t[k][j]);
c[i][j] = min(c[i][j]... | 0 |
#include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 998244353;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pi;
int h,w;
int arr[105][105];
bool visited[105][105];
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
int main(){
int white=0;
cin>>h>>w;
for(int i=1; i<=h; i++){
string s;
cin>>s;
for(int j=0; s[j]; j++){
if(s[j]=='.'){
arr[i][j+1] = 1;
... | 1 |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | #include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false)
int a[200000], vs[200000],vs1[100006],p[300000];
vector<int>v[200000];
queue<int>q;
int f(int n)
{
int i, k=0;
vs[n]=1; q.push(n);
while(q.size()){
n=q.front(); q.pop();
for(i=0; i<v[n].size(); i++){
... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
t... |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#inc... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
int n,x;
std::vector<int> vec;
long long int num(){
long long int lli=0;
for(auto v:vec){
lli+=static_cast<long long int>(v);
}
return lli;
}
int main(){
std::cin>>n;
for(int i=0;i<n;++i){
std::cin>>x;
vec.push_back(x);
}
sort(vec.begin(),vec.end());... | /* ░░█ ▄▀█ █ █▀ █░█ █▀█ █▀▀ █▀▀ █▀█ ▄▀█ █▀▄▀█
█▄█ █▀█ █ ▄█ █▀█ █▀▄ ██▄ ██▄ █▀▄ █▀█ █░▀░█ */
// Author : Udit "luctivud" Gupta @ (https://www.linkedin.com/in/udit-gupta-1b7863135/)
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
typedef long long int lld;
typedef ... | 0 |
#include<bits/stdc++.h>
#define ls (p<<1)
#define rs (p<<1|1)
using namespace std;
/*
需要维护的是
a[i]区间最大值
a[i]-i的区间最小值
*/
#define inf 1000000
#define M 200005
int f[M<<2],laz[M<<2],mx[M<<2];
int n,m;
int res,pos;
void up(int p){
mx[p]=max(mx[ls],mx[rs]);
f[p]=min(f[ls],f[rs]);
}
void down(int l,int mid,int r,int ... | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <q... | 1 |
#include<stdio.h>
#include<string.h>
#define PRINT "print"
#define REVER "reverse"
#define REPLA "replace"
int main(){
int a,b,q,i,j,k;
char tmp;
char comm[20],str[1001],p[1001];
scanf("%s %d",str,&q);
for(i=0;i<q;i++){
scanf("%s",comm);
if(strcmp(comm,PRINT) == 0){
scanf("%d %d",&a,&b);
for(j=a;j<=b... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main () {
// input
string str;
cin >> str;
int q;
cin >> q;
string result = str;
int res_len = result.length();
for (int i=0; i<q; i++) {
string order;
int a, b;
cin >> order >... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll K;cin >> K;
ll x = K / 50;
ll y = K % 50;
vector<ll> ans;
cout << 50 << endl;
for (int i = 0;i < 51;i++) {
if (i + y != 50)
ans.push_back(i);
}
for (int i = 0;i < 50;i++) {
cout << ans[i] + x << " ";
}
} | #include "bits/stdc++.h"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/pb_ds/assoc_container.hpp"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define x first
#define y second
#define LEN(x) ((int)(x).size())
#define ALL(x) x.begin(), x.end()
using ll = long... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct edge{
int to,cost;
edge(){
to = 0; cost = 0;
}
edge(int t,int c){
to = t;
cost = c;
}
};
int n;
vector<edge> G[100001];
long long int d[100001];
const long long int INF = 1000000000000;
void Dijkstra(int s){
priori... | #include<stdio.h>
int main(void)
{
int n,pm,pe,pj,i,j,pme,pmej;
scanf("%d",&n);
while(n!=0){
for(i=0;i<n;i++){
scanf("%d %d %d",&pm,&pe,&pj);
pme=(pm+pe)/2;
pmej=(pm+pe+pj)/3;
if(pm==100 || pe==100 || pj==100){
printf("A\n");
}
else if(pme>=90){
printf("A\n");
}
else if(pm... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
vector<int> cnt(26,0);
for(int i = 0; i < s.size(); i++) {
cnt[s[i]-'a'... | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i % 3 ==0 || i % 10 == 3 || (i/10)%10==3|| (i/100)%10==3 || (i/1000)%10==3){
cout << " " << i;
}
}
cout << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1e9+7,inv2=5e8+4;
inline int poww(long long x,int y)
{
long long ret=1;
while(y)
{
if(y&1)ret*=x,ret%=MOD;
x*=x,x%=MOD;
y>>=1;
}
return ret;
}
int n,k;
long long dp[2333][2333];
long long fac[4555555],invfac[4555555];
inline long long c(int a,int b)
... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=(a),_ed=(b);i<=_ed;++i)
#define DREP(i,a,b) for(int i=(a),_ed=(b);i>=_ed;--i)
#define mp(x,y) make_pair((x),(y))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int,int> pii;
inline int read(){
register i... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int a[2010][2010];char s[2010];
int h[2010][2010],r[2010][2010],l[2010][2010];
int top=0,ans=0,st[2010];
int main()
{
int n,m;scanf("%d%d",&n,&m);ans=n;
for(int i=1;i<=n;i++)
{
scanf("%s",s);
for(int j=1;j<=m;j++)a[i][j]=(s[j-1]=='#');
}
for(int i=n;i>=1... | // Have a nice day
// ∠( ᐛ 」∠)
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
template <typename T> inline T read()
{
T sum=0, fl=1; char ch=getchar();
for(; !isdigit(ch); ch=getchar())... | 1 |
#include<stdio.h>
#define N 100
int A[N + 1][N + 1];
int p[N + 1];
int solve(int i, int j)
{
if(!(A[i][j] < 0)){ return A[i][j]; }
if(j == i){ A[i][i] = 0; return 0; }
if(j == i + 1){
A[i][j] = p[i - 1] * p[i] * p[i + 1];
return A[i][j];
}
int min = -1, x;
for(int k = i; k < j;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <lim... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
string s ,t;
cin>>s>>t;
cout<<t<<s<<endl;
return 0;
}
| #include<stdio.h>
int main()
{
char a[105];
char b[105];
scanf("%s %s", &a, &b);
printf("%s%s", &b, &a);
return 0;
} | 1 |
#include "assert.h"
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
vector<vector<ll>> cnt(62, vector<ll>(62, 0));
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (find(s.begin(), s.end(), '.') == s.end()) s.push_... | 1 |
/**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
// c... | /*
Written by Nitrogens
Desire for getting accepted!!
*/
#include <cstdio>
#include <ctime>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <bitset>
#include <stack>
#include <set>
#include <vector>
using namespace std;
ty... | 0 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll a,ll b){
while(b>0){
ll r=a%b;
a=b;
b=r;
}
return a;
}
int main(){
ll a,b;
cin >> a >> b;
ll p=gcd(a,b);
ll i;
ll cp=p;
vector<ll> ans(2000);
ans.at(0)=1;
... | 1 |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
// using namespace atcoder;
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#de... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
int lst[Max];
string ls[Max];
map<string, int> ma1, ma2;
int main()
{
int n, m, g = 0;
cin >> n;
for (int i = 1;i <= n;i++)
{
string t;
cin >> t;
ma1[t]++;
ls[++g] = t;... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i... | //#include "stdafx.h"
#include<bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int a,b,ans,q;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>a>>b;
q=abs(a-b);
ans=16-(a+b);
if(q>ans/2)
cout<<":(\n";
else
cout<<"Yay!\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
int R, G;
cin >> R >>... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a,b,ans=0;
cin >> a >> b;
for(int i = a;i<b+1;i++){
if(i/10000==i%10&&(i/1000-(i/10000)*10)==(i%100-i%10)/10)ans++;
}
cout << ans;
} | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll INF = 10000000000;
int main(){
int v,e;
ll d[100][100];
scanf("%d %d",&v,&e);
fill(d[0],d[0]+10000,INF);
for(int i=0;i<v;i++) d[i][i] = 0;
for(int i=0;i<e;i++){
int s,t;
ll dist;
scanf("%d %d %lld",&s... | 0 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
using namespace std;
int n;
int k;
vector<int> card;
set< string > cd;
set< vector<int> > ccd;
/*
string IteratorToString(vector<int>::iterator begin, vector<int>::iterator end){
string str = "";
char ch[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 |
#include<bits/stdc++.h>
using namespace std;
vector<vector<string>>ans={
{"-1"}, //0
{"-1"}, //1
{"-1"}, //2
{ //3
"..a",
"..a",
"bb."
},
{ ... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define N... | 1 |
#include<iostream>
using namespace std;
int main(){
long long data[2][4000],n,i,f,id,a,b;
while(1){
cin>>n;
if(n==0) break;
for(i=0; i<4000; i++) data[0][i]=-1,data[1][i]=0;
for(i=0;i<n;i++){
cin>>id>>a>>b;
for(f=0;f<i+1;f++){
if(data[0][f]==id){
(a*b<1000000)? (data[1][f]+=(a*b)) : ... | #include<iostream>
#include<string>
using namespace std;
int main( )
{
string str, cmd, p;
int q;
int a, b;
cin>>str;
cin>>q;
while( q-- ) {
cin>>cmd;
if( "print" == cmd ) {
cin>>a>>b;
cout<<str.substr( a, b-a+1 )<<endl;
} else if( "reverse" == cmd ) {
cin>>a>>b;
char t;
for( int i=0; i... | 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 VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n... | /*input
5
3 3 3 3 3
*/
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#inc... | 0 |
#include <stdio.h>
#define INF 10000000
int main(void){
int n,m;
while(scanf("%d %d",&m,&n),n,m){
int i,j;
int a,b,cost,time,c;
int DPc[256][256];
int DPt[256][256];
int k,ans[256];
for(i=0;i<256;i++){
for(j=0;j<256;j++){
if(i==j){
DPc[i][j]=0;
DPt[i][j]=0;
}
else{
DPc[... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
while(1){
int n;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
int pm,pe,pj;
int heikin = 0;
cin >> pm >> pe >> pj;
hei... | 0 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
typedef pair<double, double> P;
const ll INF = 10e17;
#defin... | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define FORW(a, b, c) for(int a = b; a >= c; --a)
#define fi first
#define se second
#define pb push_back
#define int long long
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
const int N = 2e5 + 100;
const int maxN =... | 0 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define inf 0x3f3f3f3f3f3f3f3f
#define pi acos(-1.0)
#define ri register int
#define Abs(x) ((x) < 0 ? (-(x)) : (x))
#define int long long
const int maxn = 2e3 + 10;
inline int Max(int a, int b) { return a > b ? a : b; }
inline int Min(int a, int b) { return a > b ? b : a... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
using namespace std;
#define FOR... | 0 |
#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int&
#define I inline
#define W while
#define N 200
#define LN 63
#define ull unsigned long long
using namespace std;
int n,ans;ull a[N+5],v[L... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1... | 1 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n , x;
cin>>n;
for(int i=1 ; i<=n ; i++){
x=i;
if(i%3==0 && x%10!=3){
cout << " " << i;
} else if(x%10==3) {
cout << " " << i;
} else {
for(int j=0 ; j<(int(log10((double)n))) ; j++){
x/=10;
if(x){
if(x%10==3){ ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s1 = "Hoshino", s2 = "Hoshina";
string::size_type pos;
cin >> n;
cin.ignore();
for (int i = 0; i < n; i++) {
string line;
getline(cin, line);
for (pos = line.find(s1); pos != string::npos; pos = line.find(s1,... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int N,K;
cin >> N >> K;
if(N%K){
cout << "1";
}else{
cout << "0";
}
} | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
c... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 1 |
#include<cstdio>
const int mod=1000000007;
long long power(long long a,int k){
long long ans=1,y=a;
while(k){
if(k%2)
ans=ans*y%mod;
y=y*y%mod;
k=k/2;
}
return ans;
}
long long fun[1<<17],ans=1;
int main(){
long long n,m;
scanf("%lld%lld",&n,&m);
fun[0]=1... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int maxn=(1e5)+10;
const int mod=(1e9)... | 1 |
#include <iostream>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, ... | #include <iostream>
#include <string>
int main() {
std::string s, t; std::cin >> s >> t;
std::cout << (t+s) << std::endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
string str;
cin>>str;
cout<<2018<<str.substr(str.find('7')+1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
string ans = "Yes";
for(int i=0; i<s.size(); i++)
{
if(i%2==0 && s.at(i) != 'h') ans = "No";
else if(i%2==1 && s.at(i) != 'i') ans = ... | 0 |
/**
* @brief 8クイーン問題を扱う
*
* @date 2016/02/29
*/
//****************************************
// 必要なヘッダファイルのインクルード
//****************************************
#include <iostream>
#include <vector>
//****************************************
// 型シノニム
//****************************************
using array1D = std:... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define INIVAL 2147483647
int *a, *ts, c, s, t, v;
void update(int k, int l, int r)
{
if (r<s || t<=l) return;
if (s<=l && r<=t) {
a[k] = v;
ts[k] = c;
} else if (l<r-1) {
update(((k+1)<<1)-1, l, (l+r)>>1);
update((k+1)<<1, (l+r)>>1, r);
... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> num(N, -1);
for (int i=0; i<M; i++) {
int si, ci;
cin >> si >> ci;
si--;
if ((num[si] != -1) && (num[... | 0 |
#include<bits/stdc++.h>
using namespace std;
int n,offset,j,pre,ans;
string s,t;
deque<int> q;
int main()
{
cin>>n>>s>>t;
q.push_back(n);j=n-1;
for (int i=n-1;i>=0;i--)
{
pre=j;
while(j>=0 && (j>i || s[j]!=t[i])) j--;
if (j<0)
{
printf("-1\n");
return 0;
}
if (pre==j)
{
while(!q.empty() && q... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
char s[1010101];
char t[1010101];
stack <int> p[26];
int q[1010101],qs=1,qe=0;
int cc[1010101];
int main()
{
int n,la,now,c=0,ans=0;
scanf("%d",&n);
now=n;
la=n+1;
scanf("%s",s+1);
scan... | 1 |
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <iterator>
#include <fstream>
#include <math.h>
#include <random>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <map>
#include <deq... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
using ll = long long;
using namespace std;
#define LOG_MAX 30
// 1つ先が無い(木の根など)場合、値を負かn以上とする
template <typename T>
class Doubling {
const size_t n;
vector<vector<T>> next;
public:
Doubling() {}
Doubling(vecto... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <tuple>
#include <bitset>
#include <random>
#define REP(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
using... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
int n; scanf("%d",&n);
vector<lint> a(n);
rep(i,n) scanf("%lld",&a[i]);
bool ok=(a[0]==0);
rep(i,n-1) if(a[i+1]-a[i]>=2) ok=false;
if(!ok){
puts("-1");
return 0;
}
lint ans=0;
int pr... | #include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=a;i<b;++i)
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int n, a[3], p;
int main() {
cin >> n;
for_(i,0,n) cin >> a[i];
p = gcd(a[0], a[1]);
if (n == 3) p = gcd(a[2], p);
vector< int > c;
for_(i,1,0 || i*i <= p) {
... | 0 |
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#include <x86intrin.h>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <iomanip>
#include <stack>
#include <map>
#include <set>
//#... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <iostream>
#include <numeric>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
int INF = 1e9;
int main(){
int n... | 0 |
#include <iostream>
#include <vector>
#include<math.h>
#include <algorithm>
using namespace std;
int main()
{
int a;
long long k;
cin>>a;
k=a+a*a+a*a*a;
cout<<k;
} | # include<iostream>
# include<math.h>
using namespace std;
int main()
{
int a,b;
cin>>a;
b=pow(a,1)+pow(a,2)+pow(a,3);
cout<<b<<"\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,a[9]={111,222,333,444,555,666,777,888,999};
cin>>n;
for(int i=0;i<9;i++){
if(n<=a[i]) {
cout<<a[i]<<endl;
re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
#define INF 1010001000
#define loop(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
typedef pair<int, int> i_i;
bool dfs(vector<vector<int> > &g);
int sx, sy, gx, gy;
int w, h;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,... | #include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n;i>=0;i--)
#define INF 100000005
#define MAX 100001
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
//__gcd(a,b), __b... | 0 |
#include<bits/stdc++.h>
#include <algorithm>
#include <complex>
using namespace std;
typedef long long ll;
typedef complex<long double> point;
const ll N = 2e5+5,mod=1e9+7,inf=1e9+5;
long double pi=3.14159265359;
ll a[N],b[N],inv[N],fact[N];
int n,c;
ll fp(int base,int exp){
if(exp==0)return 1;
ll ans=fp(base,... | #include <cstdio>
#include <iostream>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define inver(a) power(a, mod - 2)
using namespace std;
inline char nc()
{
return getchar();
static char buf[100000], *l = buf, *r = buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> voi... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<ll> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
vector<ll> csum{0};
partial_sum(va.begin(), va.end(), back_inserter(csum));
map<ll, ll> cnts;
fo... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
const double PI = 3.14159265... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int R;
cin >>R;
double a=3.14;
cout << 2*R*a << endl;
} | #include <bits/stdc++.h>
using namespace std;
//型名省略
typedef long long ll;
typedef vector<long long> vl;
typedef vector<vector<long long>> vvl;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<string> vs;
//マクロ
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define rep2(i,x,n) for(ll i = (ll) ... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<utility>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<list>
#include<set>
#include<stdlib.h>
#define rep(i,n) for(int i=0;i<(in... | # include <bits/stdc++.h>
using namespace std;
char s[1000010];
char t[1000010];
int n;
queue<int> q;
int main() {
scanf("%d", &n); scanf("%s", s); scanf("%s", t);
if(strcmp(s, t) == 0) { puts("0"); return 0; }
int k = n - 1;
int ans = 0;
int last = -1;
for(int i = n - 1; i >= 0; --i) {
k = min(k, i);
whi... | 0 |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pa... | #include <algorithm>
#include <iostream>
#include <vector>
int main()
{
std::string s;
std::cin >> s;
std::cout << s.substr(0, s.length() - 8) << std::endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
vector<ll> cost(5);
ll N;
cin >> N;
for (int i = 0; i < 5; i++)
{
cin >> cost[i];
}
ll result = (ll) ceil((double) N / *min_element(cost.begin(), cost.end())) + 4;
cout << result << endl;
... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
int mod = 1000000007;
long long sum = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
sum %= mod;
}
long ans = 0;
for(int j = 0; j < n; j++){
sum -= a[j];
if(sum <... | 0 |
#include<bits/stdc++.h>
#define fo(i,a,b) for(register int (i)=(a);(i)<=(b);++(i))
#define rd read()
#define maxn 200001
#define gc getchar()
#define mem(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define pb push_back
#define db double
#define pu puts(" ")
using namespa... | #include <iostream>
//#include <iomanip>
//#include <string>
//#include <vector>
//#include <algorithm>
//#include <utility>
//#include <set>
//#include <map>
//#include <queue>
//#include <bitset>
//#include <math.h>
using namespace std ;
using ll = long long ;
//using ld = long double ;
//using vll = vector<ll> ;
//u... | 1 |
#include <bits/stdc++.h>
#define INF 100000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
ll ans = 0;
vector<bool> used(N, false);
for (ll i = N - 1; i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n,ans=0;cin>>n;
multiset<ll> st;
for(ll i=0,x;i<n;i++)cin>>x,st.insert(x);
while(!st.empty()){
auto itr= st.end();
itr--;
l... | 1 |
#include <bits/stdc++.h>
#define re register
#define SIZE 305
#define INF 0x7f7f7f
using namespace std;
int n;
int a[SIZE];
int cnt[5];
double dp[SIZE*3][SIZE*2][SIZE],ans=0;
inline double dfs(int i,int j,int k)
{
if(dp[i][j][k]!=-1)
return dp[i][j][k];
dp[i][j][k]=0;
double x=i*1.0,y=j*1.0,z=k*1.0;
double m=x+y... | //Author - Rahil Malhotra
#include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#def... | 1 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using G... | //
// Created on 2020/08/10.
//
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint>... | 1 |
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#define ll long long
using namespace std;
int d,dep,m;
ll ans;
int c[20],c0[20];
ll f[20],a[20];
void dfs(int k,ll w,ll s){
if (k==m){
ans+=1ll*(w==d)*s;
return;
}
if (abs(w-1ll*d)>a[k]*20) return;
int ... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=500000004;
con... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin>>n;
ll mi=ll(1e18);
for(int i=0;i<5;i++){
ll a;
cin>>a;
mi=min(mi,a);
}
ll x=n/mi;
if(n%mi==0) x--;
cout<<5+x<<endl;
} | #include <bits/stdc++.h>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const ll Lmax=ll(1e18);
const ll Nmax=1e9;
const ll INF=1e9... | 1 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimization ("Ofast")
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define siz(s) (int)s.size()
template<class T> inline bool chmin(T &a, T b) {
if(a>... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 400005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> vec(N);
for(int i=0;i<N;i++){
cin>>vec.at(i);
}
vector<int> arr(N);
for(int i=0;i<N;i++){
int num=0;
while(vec.at(i)%2==0){
vec.at(i) = vec.at(i)/2;
num+=1;
}
arr.at(i)=num;
}
int ans=... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int N;
cin >> N;
int num[N];
int i = 0, count = 0;
while (i < N)
cin >> num[i++];
int flag=0;
while (true)
{
i = 0;
while (i < N)
{
if (num[i] % 2 != 0)
flag = 1;
num[i] /= 2;
i++;
}
if (flag =... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const int maxn = 1e5+5;
vector<int>tar;
ll v[maxn];
l... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<long long> a(n), base;
for(auto & e : a) cin >> e;
long long all = 0;
for(auto & e : a) all ^= e;
for(auto & e : a) e &= ~all;
for(auto e : a){
for(auto b : base) e = min(e, e ^ b);
if(e){
base.push_back(e);
}
}
sor... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | #include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
... | 1 |
/* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | ... | //#define USE_CPP11
// #define USE_PRINTF
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#includ... | 0 |
#include <stdio.h>
int main()
{
int n,a[5000];
while(1){
int max=-100001;
scanf("%d",&n);
if(n==0)
break;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
for(int i=0;i<n;i++){
int sum=0;
for(int j=i;j<n;j++){
sum+=a[j];
if(max<sum)
max=sum;
}
}
printf("%d\n",max);
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <deque>
#include <numeric>
#include <vector>
using namespace std;
template <typename C>
vector<int> compact(const C& container) {
vector<int> compacten;
int sign = 1;
int acc = 0;
for (auto n : container) {
if (n == 0) { continue; }
if (sign * n > 0) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
//#define _GLIBCXX_DEBUG
signed main() {
int N, A, B, C, D, E; cin >> N >> A >> B >> C... | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
std::vector<std::string> split(std::string &str, char delim) {
std::vector<std::string> result;
std::istringstream is(str);
std::string buf;
while (getline(is, buf, delim)) {
result.push_back(buf);
}
return result;
}
bool inputDataSet(... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define vec(a) vector<int>a
using namespace std;
//fibonacci
int binet(int n)
{
return (pow((1+sqrt(5)),n-1)-pow((1-sqrt(5)),n-... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long,long long>
#define ii pair<int,int>
#define mod 1000000007
#define endl '\n'
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
ll power(ll a,ll b){
ll ans=1;
while(b>0){
if(b%2!=0){
ans=(ans*a... | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#i... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long g=0,n,a,mx=0,k;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a;
mx=max(mx,a);
g=__gcd(g,a);
}
if(k>mx){
cout<<"IMPOSSIBLE";
}
else{
if(k%g==0){
cout<<"POSSIBLE";
}
else{
cout<<"IMPOSSIBLE";
}
}
} | #include<iostream>
#include<tuple>
#include<vector>
#include<algorithm>
#include<cmath>
using std::begin;
using std::end;
int gcd(int n, int m) {
if(n < m) return gcd(m, n);
if(m == 0) return n;
return gcd(m, n % m);
}
void print_kouyakusu(int n) {
std::vector<int> v;
for(int i{1}; i <= std::sqrt(n); ++i)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num){
fact[0] = fact[1] = 1;
for(int i=2; i<=num; i++) fact[i] = fact[i-1]... | #include<bits/stdc++.h>
using namespace std;
int N, mod, i2[10009], i3[10009];//[100][100][100];//[270 * 3][270 * 3][270 * 4];
int add (int x, int y) {int ans = x + y; if (ans >= mod) ans -= mod; return ans;}
int subtract (int x, int y) {if (x >= y) return x - y; return x - y + mod;}
int mul (int x, int y) {return 1... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a,... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin>>k>>s;
if(s.length()<=k) cout<<s<<endl;
else{
for(int i=0;i<k;i++) cout<<s[i];
cout<<"."<<"."<<"."<<endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 0 |
//
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
int f(int n)
{
switch(n){
case 1:
return 1;
break;
case 2:
return 2;
break;
case 3:
return 4;
break;
default:
int a[30];
a[0]=1;
a[1]=2;
a[2]=4;
for(int i=3;i<n;++i){
a[i]=a[i-1]+a... |
#include<iostream>
#include<vector>
using namespace std;
int foot(int);
int main() {
int n;
vector<int>floor;
cin >> n;
while (n != 0) {
floor.push_back(n);
cin >> n;
}
floor.push_back(0);
int i = 0;
while (floor[i] != 0) {
int res = 0;
res = foot(floor[i]) / 3650;
if( foot(floor[i]) % 3650... | 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define l first
#define r second
#define int long long
int n;
string s;
int q;
long long pr[1500000];
vector<pair<int, int> > keks;
long long prr[1500000];
signed main()
{
ios_base::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
bool fin=false;
for(int i=0;i<(Y/10000)+1;i++){
for(int j=0;j<((Y-10000*i)/5000)+1;j++){
if(((Y-10000*i-5000*j)/1000)+i+j==N){
cout << i << " " << j << " " << (Y-10000*i-5000*j)/1000 <<en... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n,d1,d2;
int col[603][603],col1[605][605],col2[605][605];
int dx[4803],dy[4803],cnt;
vector<pair<int,int> > typ[2][2];
void Col(int x,int y,int tar)
{
col[x][y] = tar;
for(int i = 1;i <= cnt; ++ i)
{
int nx = x + dx[i],ny = y + dy[i];
if(nx >= 1 && nx <= n && ... | #include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; ... | #include<bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int h, w; cin >> h >> w;
char s[h+2][w+2];
for(int i = 0; i < w+2; i++) s[0][i] = '.';
for (int i = 1; i <= h; i++)
{
s[i][0] = '.';
for (int j = 1; j <= w; j++)
{
cin >> s[i][j];
}
s[i][h... | 0 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000 //1e4
#define base10_5 100000 //1e5
#define base10_6 1000000 //1e6
#... | #include <iostream>
int main(){
int n, x, t; std::cin >> n >> x >> t;
std::cout << (n + x - 1) / x * t << '\n';
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+23;
vector<int> g[N], ans;
bool bio[N];
int parent[N];
void dfs(int u)... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | 1 |
#include <stdio.h>
int main(){
int num, angka1, angka2, angka3;
scanf("%d", &num);
angka1 = num/100;
angka2 = (num - angka1 * 100)/10;
angka3 = num % (angka1 * 100 + angka2 * 10);
if(angka1 == 7 || angka2 == 7 || angka3 == 7){
puts("Yes");
} else{
puts("No");
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int f(ll a,ll b)
{
return (int)max(log10(a),log10(b));
}
int main()
{
ll N;
cin>>N;
int ans=10;
for(int i=1;i<sqrt(N)+1;i++)
{
if(N%i!=0) continue;
l... | 0 |
#include <stdio.h>
#include <string.h>
int main(void)
{
int i, j;
int n;
int len;
char str[1024];
scanf("%d\n", &n);
for (j = 0; j < n; j++){
fgets(str, 1024, stdin);
len = strlen(str);
for (i = 0; i < len; i++){
if (strncmp(&str[i], "Hoshino", 7) == 0){
strncpy(&str[i], "Hoshina", 7);
}
... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
string str;
cin >> n;
cin.ignore();
while (n > 0){
getline(cin, str);
int len = 0;
while (1){
len = str.find("Hoshino", len);
if (len == -1) break;
str[len + 6] = 'a';
}
cout << str << endl;
n--;
}
return (0)... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<list>
#include <cstring>
#include <functional>
#include<unordered_map>
#include<unordered_set>
#include<bitse... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int n,m,a[300][300],ans=999;
bool ok[301];
int main(){
cin>>n>>m;
rep(i,n)rep(j,m)cin>>a[i][j];
rep(k,m){
int x[301]={};
rep(i,n){
int j=0;
while(ok[a[i][j]])j+... | #include<bits/stdc++.h>
using namespace std;
#define RI register int
const int N=105;
char mp[N][N];
int f[2][N][N][N],a[N][N],n,m,sx,sy,ans;
int gets(int x1,int y1,int x2,int y2)
{return a[x2][y2]-a[x1-1][y2]-a[x2][y1-1]+a[x1-1][y1-1];}
int main()
{
scanf("%d%d",&n,&m);
for(RI i=1;i<=n;++i) {
scanf("%s",mp[i]+1);... | 0 |
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
int n, m;
vector<int> to[N];
int dfn[N], low[N], bel[N], tim, cnt;
stack<int> stk;
bitset< N > vis;
void tarjan(int u)
{
dfn[u] = low[u] = ++tim; stk.push(u); vis.set(u);
for (auto v : to[u])
{
if (!dfn[v])
{
tarjan(v);
low[u] = min(low... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.