code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
//const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
// 制約見て！！！デカかったらlong longにすること！
string s;
cin >> s;
int m = 753;
rep(i,s.size()-2){
string sub = s.substr(i,3);
int x = stoi(sub);
m = std::min(m,abs(x-753... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define ... |
#include <iostream>
#include <set>
int main(){
while (true) {
int n; // I will buy n vegetables.
int m; // One bag contains m vegetables.
std::cin >> n >> m;
std::cin.ignore();
if ( n==0 && m==0 ) {
return 0;
}
// input vegeta... | 1 |
//Boxes and Candies
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define YN(flag) (flag?"Yes":"No")
#define... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<tuple>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int ... | 0 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) f... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll MOD = pow(10,... | 1 |
#include <iostream>
#include <tuple>
#include <vector>
int main()
{
int h, w; std::cin >> h >> w;
std::vector<std::vector<int>> a(h, std::vector<int>(w, 0));
std::vector<std::tuple<int, int, int, int>> t;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
std::cin >> a[i][j... | #include<bits/stdc++.h>
#define fo(i,a,b)for(int i=a,_e=b;i<=_e;++i)
#define ll long long
using namespace std;
const int N=505,M=10000;
int n,p[M+5],p2[M+5],mu[M+5],ps;
ll a[N][N],h[N],l[N];
bool b[M+5];
ll gcd(ll x,ll y){
for(;y;y%=x)swap(x,y);
return x;
}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
int main(){
n=500;
... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
#define llong long long
int n,m;
int pos[200200];
int nxt[200200];
llong K;
bool vis[200200];
int sta[200200],top;
double ans[100100];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N);
rep(i,N) cin >> a[i];
double s = 0;
... | 0 |
// https://atcoder.jp/contests/nomura2020/tasks/nomura2020_a
#include<iostream>
#include<vector>//可変長配列
#include<algorithm>//sort,二分探索,など
#include<map>//map(辞書)
using namespace std;
int main(void){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int wake = h1 * 60 + m1;
int sleep = h2 * 60 +... | #define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N; string s, a, b, A, B;
void change(int i){
int j=(N+i-1)%N, k=(i+1)%N;
A[i]=(A[i]=='S')?'W':'S'; a[i]=(a[i]=='o')?'x':'o';
a[j]=(a[j]=='o')?'x':'o'; a[k]=(a[k]=='o')?'x':'o';
B[i]=(B[i]=='S')?'W':'S'; b[i]=(b[i]=='o')?'x':'o';
b[j]=(b[j]=='o')?'x':'o'; b[k]=... | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
char s[N],a[N];
bool ok(char s[],char a[],int n)
{
for (int i=1;i<n-1;i++) {
if (a[i]=='S'&&s[i]=='o' || a[i]=='W'&&s[i]=='x') {
a[i+1]=a[i-1];
} else {
a[i+1]=(a[i-1]=='W')?'S':'W';
}
}
if (a... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, v;
cin >> n;
int* ohash = (int*) calloc(100000, sizeof(int));
int* ehash = (int*) calloc(100000, sizeof(int));
for (int i = 0; i < n/2; i++) {
cin >> v;
ohash[v - 1]++;
cin >> v;
ehash[v - 1]++;
}
int omax = 0, emax = 0;
f... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9+7;
int main(){
int N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i < N; i++)
cin >> A[i];
long long ans = 0;
long long sum = 0;
long long sum2 = 0;
for(int i = 0; i < N; i++){
sum2 = (sum2 + A[i]*A[i]) % (2*mod);
su... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template < typename T > using oset = tree < T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update >;
// find_by_order(k) (k+1)th largest element
// or... | 1 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
static const int NIL = -1;
struct Vertex {
vector<int> link;
int parent = NIL;
int ord;
int lowlink;
bool is_visit = false;
};
class ArticulationPoint {
private:
int n;
vector<Vertex> graph;
int timer = 1;
publ... | #include<bits/stdc++.h>
using namespace std;
#define INF 100010
typedef pair<int,int> P;
vector<int> G[100010];
vector<int> GG[100010];
int V,E,n;
int ord[100010];
int low[100010];
int par[100010];
int lowlink(int x,int p){
ord[x]=n++,par[x]=p;
int ans=ord[x];
for(int i=0;i<G[x].size();i++){
if(G[x][i]==p)co... | 1 |
#include<iostream>
using namespace std;
int main(){
unsigned long long int a,b,c,k;
cin>>a>>b>>c>>k;
unsigned long long int sum=a+b+c;
unsigned long long int term=max(a,max(b,c));
sum-=term;
while(k)
{
term*=2;
k--;
}
cout<<sum+term;
} | #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(){
ll x;
cin >> x;
ll n=x%11;
ll m=x/11;
if(n==0)cout<< 2*m << endl;
else if(n<=6)cout << 2*m+1 << endl;
else cout << 2... | 0 |
#include<bits/stdc++.h>
using namespace std;
inline int read() {
int res=0,fh=1;
char ch=getchar();
while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
if(ch=='-')fh=-1,ch=getchar();
while(ch>='0'&&ch<='9')res=res*10+ch-'0',ch=getchar();
return fh*res;
}
const int maxn=16;
int n,m,mxs,sum[(1<<16)+12],a[maxn][maxn];
... | #include <stdio.h>
#include <vector>
#include <set>
#include <utility>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, l, n, m, a, b, now, min;
scanf("%lld%lld", &n, &m);
vector<ll> vec[n], rev[n];
ll d[n], be[n];
pair<ll, ll> p;
for(i = 0; i < m; ++i) {
scanf("%lld%lld", &a, &b... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
for (int i = 0; i < K; i++) {
vector<int> B(N+1, 0);
for (int j = 0; j < N; j++) {
int left = max(0, j - A.at(j));
int right = min(N, j + A.at(j)... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define INF 1e8
typedef long long int ll;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
int s[m];
char c[m];
rep(i, m) { cin >> s[i]... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii v... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+7;
LL jmp,a,k,n,m,x[N],y[N],p[N],g[N],siz[N],tot,cnt,sum;
bitset <N> vis;
int main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)scanf("%lld",&x[i]),p[i]=i;
for(int i=1;i<=n;i++)y[i]=x[i]-x[i-1];
scanf("%lld%lld",&m,&k);
for(int i=1;i<... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k,s=1;cin>>n>>k;
for(int i=0;i<n;i++)
if(s*2<=s+k)
s*=2;
else s+=k;
cout<<s;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
int A, B;
cin >> A >> B;
if (A <= 8 && B <= 8) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
cout<<fixed<<setprecision(20)<<n*6.28318530717958623200<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int x;
cin>>x;
if (x<=6) {
cout<<1<<endl;
} else {
if (x%11==0) {
cout<<2*(x/11)<<endl;
} else if (x%11<=6) {
cout<<2*(x/11)+1<<endl;
} else {
cout<<2*(x/11)+2<<end... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
double PI = 3.1415926535897932;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// Big two primes
#define X 1001100011100001111ll
#define mod 1000000007
#define ll long long
#define all(a) a.begin(),a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
K = min(K, 50);
vector<int> A(N);
REP(i, N) cin >> A[i];
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n);
for(int i=0; i<n; i++) cin >> a[i];
vector<int> b(n+1);
vector<int> c(n);
int count = 0;
for(int i=1; i<=k; i++){
for(int i=0; i<n; i++){
b[max(1,1+i-a[... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5;
int n,q;
char s[N];
ll dp[N],f[N],sumd[N],summ[N];
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
scanf("%d",&q);
for(int i=1;i<=n;i++)
{
sumd[i]=sumd[i-1]+(s[i]=='D');
summ[i]=summ[i-1]+(s[i]=='M');... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int n, i, j, l[30] = {};
ll ans = 1;
string a;
cin >> a;
n = a.size();
for (i = 0; i < n; i++) {
l[a[i] - 'a']++;
}
for (i = 0; i < 26; i++) for (j = i + 1... | #pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x;}
int f[26];
const int N=2e5+4... | 1 |
#include<bits/stdc++.h>
using namespace std;
vector< int >apply(const vector< int >&v) {
int n = v.size();
vector< int >cu(n, 0);
for (int i = 0; i < n; i++) {
int l = max(i-v[i], 0);
int r = min(i+v[i], n-1);
cu[l]++;
if (r+1 < n) cu[r+1]--;
}
for (int i = 1; i < n;... | #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL)
#define input(arr,n) for(ll i1=0;i1<n;i1++ )cin>>arr[i1]
#define mod 1000000007
#define F first
#define S second
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_po... | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <deque>
#include <map>
#include <iomanip>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <utility>
using namespace std;
int ky[8] = {-1,1,-2,2,-2,2,-1,1};
int kx[8] = {-2,-2,-1,-1,1,1,2,2};
int dy[4] = {-... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <string>
#include <sstream>
using namespace std;
#define MAX_N 10
int n, k;
vector<int> cs;
set<string> ps;
string to_s(int r) {
ostringstream os;
os << r;
return os.str();
}
bool used[MAX_N];
void enumerate(int k_) {
if (k_ == k... | #include <iostream>
using namespace std;
int main(){
while(1){
int n, nums[10] = {0};
cin >> n;
if(!n) break;
for(int i = 0;i < n;i++){
int k;
cin >> k;
nums[k]++;
}
for(int i = 0;i < 10;i++){
if(nums[i] == 0) cout <<... | 0 |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).re... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
template < class BidirectionalIterator >
bool next_combination(BidirectionalIterator first1,
Bidirec... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
int ans = 0;
multiset<int> s(a.begin(), a.end());
while(!s.empty()) {
auto it = prev(s.end());
int a = *it;
s.erase(it);
int b... | #include <bits/stdc++.h>
#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 n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 1e9;
rep(i, n) {
int c = 0;
while (a[i] % 2 == 0) {
a[i] /= 2;
c+... | 0 |
#include <bits/stdc++.h>
#define len(v) ((int)((v).size()))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define chmax(x, v) x = max((x), (v))
#define chmin(x, v) x = min((x), (v))
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
stri... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedS... | 1 |
//Counting of Trees
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define... | /**-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
*-* *-*
*-* Bismillahir Rahmanir Rahim *-*
*-* ... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
ll x;
cin>>x;
if(x<11){
if(x<=6){
cout<<1<<endl;
}else{
cout<<2<<endl;
}
}else{
if(x%11==0){
cout<<2*(x/11... | #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() {
ll x;
cin >... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
int n, u, v; cin >> n >> u >> v;
vector<vector<int>> g(n+1);
rep(i, n-1){
int a, b; cin >> a >> b;
g.a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << "... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const i... | #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);
}
int h[30];
void solve() {
string s; cin >> s;
for (int i = 0; i < (int)s.size(); ++i) {
++h[s[... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
int num[3];
cin >> n;
if (n == 2){
cin >> num[0] >> num[1];
sort(num, num + 1);
for (int i = 1; i < num[0]; i++){
if (num[0] % i == 0 && num[1] % i == 0){
cout << i << endl;
... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 10000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const ull B=100000007;
const int INF=1e9;
int main(){
... | 1 |
#include <stdio.h>
#include <algorithm>
int n;
int a[100010];
int b[100010];
int c[100010];
long long psum_b[100010];
long long ans;
long long find_bc(int st,int ed,int x){
int mid = (st+ed)/2;
if(ed-st<=1){
if(x<c[st]) return n-st;
if(x>=c[ed]) return n-ed-1;
return n-ed;
}
if(c[mid]<=x) return find_bc(mid,e... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N;
int A[3][100001];
LL dp[3][100001] = {};
int main() {
scanf("%d", &N);
rep(j, 3) { rep(i, N) scanf("%d", &A[j][i]); A[j][N] = 1000000001; }
rep(j, 3) sort(A[j... | 1 |
#include <bits/stdc++.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
vi color;
vvi G;
bool dfs(int v, int c) {
if(color[v] != -1) {
if(c%2 == color[v]) {
return true;
} else... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
int n;
string s, temp;
vector<int> vec;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
cout << 0 << "\n";
cout.flush();
cin >> s;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string temp;
string A[N];
cout<<0<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<0<<endl;
return 0;
}
if(temp=="Male"){
A[0]="Male";
}
if(temp=="Female"){
A[0]="Female";
}
cout<<N-1<<endl;
cin>>temp;... | 1 |
/* */
#include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <bitset>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <... | #include <iostream>
#include <vector>
using namespace std;
typedef vector <int> VI;
typedef vector <VI> VVI;
const int dx[5] = { 0, 0, 0, 1, -1 };
const int dy[5] = { 0, 1, -1, 0, 0 };
int w, h;
int sx, sy, gx, gy;
VVI M;
int answer;
//==================================================
// Tõ
//==================... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n,k;
int sssp(int s, int g,vector<vector<int> > ship){
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
vector<bool> used(n+1,false);
q.push(make_pair(0,s));
while(!q.empty()){
int cost=q.top().first,now=q.top().second; q.... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
using namespace std;
class Point
{
private:
int m_x;
int m_y;
public:
void setX(int x);
void setY(int y);
int getX();
int getY();
Point(int x, int y) {
setX(x);
set... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,ans;
while(cin >> a >> b >> c >> d){
ans = 0;
ans+=min(a,b);
ans+=min(c,d);
cout << ans << endl;
}
}
| #include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, ll B, ll C, ll D) {
cout << min(A,B) + min(C,D) << endl;
}
int main() {
ll A;
cin... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, r = 1;
cin >> n >> k;
for (int i = 0; i < n; i++)
r += min(r, k);
cout << r;
} | #include <stdio.h>
int main(){
int n,k,bank = 1;
scanf("%d" , &n);
scanf("%d" , &k);
for(int i = 0 ; i < n ; i++){
if(bank * 2 > bank + k){
bank += k;
}
else{
bank *= 2;
}
}
printf("%d" , bank);
return 0;
} | 1 |
#include <bits/stdc++.h>
#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() {
string S;
cin >> S;
bool a[26];
for (int i = 0; i < 26 ; ++i) a[i] = false;
for (int i = 0; i < S.size(); ++i) {
a[S[i] - 'a'] = true;
}... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<": "<<(x)<<endl
#define INF (int)1e9
#define EPS (double)1e-9
#define MOD ((int)1e9+7)
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vec... | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int x;
scanf("%d", &x);
x = x * x * x;
printf("%d\n", x);
return (0);
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include<bits/stdc++.h>
#define maxn 505050
using namespace std;
typedef long long ll;
struct edge{
ll x,y,z;
}e[maxn*4];
ll ans,pre[maxn],fa[maxn],n,a[maxn],b[maxn],c[maxn],d,p,q;
int l[maxn],r[maxn];
int ffind(int x){
if (pre[x]==x) return x;
pre[x]=ffind(pre[x]); return pre[x];
}
void union_(int u,int... | 1 |
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n;
cin >> x;
long min = x, max = x, sum = x;
for (int i=2; i<=n; i=i+1) {
cin >> x;
sum = sum + x;
if (x < min) min = x;
if (x > max) max = x;
}
cout << min << " " << max << " " << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod... | 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include <iostream>
#include<queue>
#include<string.h>
using namespace std;
#define TATE 1
#define YOKO 0
struct ST {
int x;
int y;
};
int main(void){
int map[101][101];
int board[101][101];
int T[]={0,-1,1,0};
int Y[]={1,0,0,-1};
int w,h,xs,xg,ys,yg,n,color,muki,x,y;
... | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long l... | /*
* Author: ylx
* Lang: c++
* Prog: agc002F
*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void qmax(int &x, int y)
{
if (x < y)
x = y;
}
void qmin(int &x, int y)
{
if (x > y)
x = y;
}
inline ll read()
{
char s;
ll k = 0, base = 1;
while ((s = getchar()) !... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
ll keta(ll a, ll b)
{
int cnt_a = 0, cnt_b = 0;
while (a)
{
cnt... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, long long> pil;
bool cmp(pil lhs, pil rhs)
{
return (lhs.first < rhs.first);
}
int main()
{
int n;
while (cin >> n, n){
vector<pil> p(n);
int cnt = 0;
for (int i = 0; i < n; i++){
int a, b, c;
bool f = true;
cin >> a >> b >> c;
for... | #include <iostream>
using namespace std;
#define N 8
int row[N], col[N], dpos[N * 2 - 1], dneg[N * 2 - 1];
int putQueen(int i) {
int res = 0;
if (i == N) return 1;
if (row[i] != -1) return putQueen(i + 1);
for (int j = 0; j < N; j++) {
if (col[j] || dpos[i + j] || dneg[i - j + (N - 1)]) continue;
ro... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 200011
int main(){
ll n,i;
cin>>n;
ll a[n+9],b[n+9];
for(i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+1+n);
ll s=0,p=0,q=0;
for(i=n;i>1;i--){
if(a[i]==a[i-1] && a[i]!=p){
if(s==0) {
p=a[i];
... | #include<bits/stdc++.h>
using namespace std;
struct node
{
int num,fa,ls,rs;
node(int _num,int _fa)
{
num=_num;
fa=_fa;
ls=rs=-1;
}
};
typedef vector<node> Tree;
Tree T;
void insert(int t,int n)
{
if(T[0].num==INT_MAX)
T[0].num=n;
else if(T[t].num>n)
if(T[t].ls==-1)
{
T[t].ls=T.size();
T.p... | 0 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_... | #include <iostream>
#include <string>
using namespace std;
int roma[128];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
roma['I']=1;
roma['V']=5;
roma['X']=10;
roma['L']=50;
roma['C']=100;
roma['D']=500;
roma['M']=1000;
ios::sync_with_stdio(false);
cin.tie(0);
... | 1 |
#include<cstdio>
int main(){
int n;
for(;;){
scanf("%d",&n);
if(n==0) break;
for(int i=0;i<n;i++){
int p[3];
char r='C';
for(int j=0;j<3;j++){
scanf("%d",&p[j]);
}
int sum=0,sumb=0;
for(int j=0;j<3;j+... | #include <bits/stdc++.h>
#define l(i) (n / 2 - (n - i + 1) / 2)
#define r(i) ((i + 1) / 2)
#define st(i) (i / 2 - 1)
using namespace std;
typedef long long ll;
int n, a[200005];
ll dp[200005][3], ans = -1e16; // j�ķ�Χ��i/2-1��(i+1)/2�����3��
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 998244353;
int main() {
int N;
cin >> N;
vector<ll> a(N);
ll ans = 1LL, sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
ans *= 3LL;
ans %= M;
}
vector<vector<ll... | #include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr <<... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MOD 1000000007
#define N 1000000
#define pb push_back
int a[N][2];
signed main()
{
SPEED;
int n;
cin>>n;
string s[n];
for(int i=0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
const string YES = "Yes";
const string NO = "No";
int main(){
ll n;
cin >... | 1 |
#include<cstdio>
long double sqrt(double);
int main(void){
long double d;
double x1,y1,x2,y2,D;
scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
D=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
sqrt(D);
d=sqrt(D);
printf("% 8.8Lf\n",d);
return 0;
}
long double sqrt(double a){
int i;
long double b=3;
for(i=0;i<256;i++){
b=(b/2)+(a/(2*b));
... | #include<iostream>
#include<cctype>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cctype>
#include<cstring>
#include<utility>
#include<cmath>
const int inf=0x7fffffff;
typedef long long int ll;
using namespace std;
int main()... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define MOD 1000000007
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int k, x;
cin >> k >> x;
int l = x - (k-1);
int r = x + (k-1);
for(int i = l; i < r ;... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#define local
#ifdef local
#include "dbg-macro/dbg.h"
#endif
//#define hacks
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endi... | 1 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
//---------------------------------//
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __... | #include <stdio.h>
int main(){
int a[6],sum=0,min=100;
for (int i=0;i<6;i++) scanf("%d",a+i);
for (int i=0;i<6;i++) sum += a[i];
for (int i=0;i<4;i++) min = (min > a[i])?(a[i]):(min);
sum -= min;
sum -= (a[4] < a[5])?a[4]:a[5];
printf("%d\n",sum);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int sum=1;
for(int i=0; i<N; i++){
if(sum*2 > sum+K) sum+=K;
else sum*=2;
}
cout << sum << endl;
return 0;
}
| #include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define d 1000000007
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
int n,k;
cin >> n;
cin >> k;
int result=1;
while(n>0)
{
result=min(result*2,result+k);
... | 1 |
#include <stdio.h>
#include <string.h>
int main() {
char s[11];
scanf("%s", s);
if (strlen(s)%2==1) printf("No\n");
else {
for (int i=0;s[i]!='\0';i++) {
if (i%2==0&&s[i]!='h'||i%2==1&&s[i]!='i') {
printf("No\n");
return 0;
}
}
... | #include<stdio.h>
int main()
{
int n,i,j=0,k;
char str[1008],temp;
scanf("%d",&n);
temp=getchar();
for(i=0;i<n;i++){
for(j=0;;j++){
str[j] = getchar();
if(str[j] == '\n'){
str[j] = '\0';
break;
}
}
for(k=0;k<j;k++){
if(str[k]=='H' && str[k+1]=='o' && str[k+2]=='s' && str[k+3]=='h' &... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long ;
using P = pair<ll,ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 |
#include <bits/stdc++.h>
#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 n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l.at(i);
int ans = 0;
rep(i, n) rep(j, n) rep(k, n) {
if (i < j && j < k) {
int x = l.at(i... | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
t... | 0 |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string S;
cin >> S;
S[3] = '8';
cout << S << endl;
}
| #include <cstdio>
using namespace std;
int main() {
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
printf("2018/%02d/%02d\n", m, d);
} | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < ... | #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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const ll INF = 100100100100100100;
const ll MAX_V = 1000;
const ll MAX_E = 1000;
vector<ve... | #include<cstdio>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
int p[100010];
vector<pair<ll,ll>> vt;
vector<pair<ll, ll>> vt1;
vector<pair<ll, pair<ll, ll>>> vt2;
int find(int u)
{
if (u == p[u])return u;
return p[u] = find(p[u]);
}
int merge(int u, int v)
{
u = find(u), v = find(v)... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int64_t const INF = 1e18;
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int N; std::cin >> N;
std::vector<int64_t> A(N)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200010;
int a[N], n;
ll sum[N];
ll get(int l, int r){
return sum[r] - sum[l - 1];
}
inline void chkmin(ll& a, ll b){
if(a > b) a = b;
}
inline void chkmax(ll& a, ll b){
if(a < b) a = b;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(... | 1 |
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#define local
#ifdef local
#include "dbg-macro/dbg.h"
#endif
//#define hacks
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endi... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int K, X; cin >> K >> X;
for (int i = X - K + 1; i < X + K; ++i) {
cout << i << " ";
}
cout << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> ... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
using namespace std;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
ll n;
cin>>n;
map<ll,ll> mp;
ll ans=0;
for(ll i=0;i<n;i++)
{
ll x;
cin>>x;
mp[x]++;
}
// cout<<mp[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
set<int> s;
for(int i=0; i<n; i++){
int a;
cin >> a;
if(s.count(a)) s.erase(a);
else s.insert(a);
}
cout << s.size() << endl;
} | 1 |
#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 int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);++i)
#define rep2(i,a,b) for (int i=(a);i<(b);++i)
#define rrep(i,n) for (int i=(n)-1;i>=0;--i)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;--i)
#define chmin(a,b) (a)=min((a),(b));
#de... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 567890, maxm = 1<<20, mod = 1000000007;
int mul(long long a, long long b){
return a * b % mod;
}
int q0[maxn];
int a[maxn];
vector<int> where[maxm];
int main(){
int n; scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", a + i);
for(int i = 1; i <= ... | #include <iostream>
#include <vector>
#include <chrono>
#include <random>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
const int ms = 1 << 20;
const int MOD = 1e9 + 7;
int trans[ms][2];
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int n;
std::cin... | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#define ll long long
int main()
{
ll A, B;
std::cin >> A >> B;
ll sum = A * B;
std::cout << sum << std::endl;
} | // Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
//
//
void solve(){
ll a, b;
cin>>a>>b;
cout<<a*b;
}
int main(){
hs;
... | 1 |
#include <iostream>
#include <string>
int main(){
char s[10];
for (int i = 0; i < 10; i++){
std::cin >> s[i];
if (i == 3){
s[i] = '8';
}
}
for (int i = 0; i < 10; i++){
std::cout << s[i];
}
std::cout << std::endl;
return 0;
} | #include <stdio.h>
int main (){
char year[4],month[2],day[2];
scanf ("%[^/]/ %[^/]/ %s",year,month,day);
printf ("2018/01/%s",day);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int) 2e5 + 20;
#define LL long long
LL n, x;
LL B[maxn], L[maxn], R[maxn];
LL sum[maxn];
LL tsum[maxn];
int rk[maxn];
bool vis[maxn];
int gao(LL score)
{
LL tot = 0;
LL les = score % x;
for(int i = 0; i < n; i++)
{
rk[i] = i;... | #include<bits/stdc++.h>
const int N = 100010;
typedef long long ll;
ll x[N], p[N];
int main(){
int n, s;
scanf("%d%d", &n, &s);
for (int i = 0; i < n; ++ i){
scanf("%lld%lld", &x[i], &p[i]);
}
int sit = std::lower_bound(x, x + n, s) - x;
int left = 0, right = n - 1;
ll ans = 0;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[5]={0};
long double dp[305][305][305];
long double solve(int n1,int n2,int n3)
{
if( (n1<0) || (n2<0) || (n3<0))
return 0;
if(n1==0 && n2==0 && n3==0)
return 0;
if(dp[n1][n2][n3]!=0)
return dp[n1][n2][n3... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#define rep(i,n) Rep(i,0,n)
#define Rep(i,k,n) for(int i=k ; i<n ; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(),v.end())
//const int MOD = 1000000007;
//const int INF = 1<<30;
using namespace std;
int main(){... | 0 |
#include<iostream>
#include<cstring>
#include<cstdio>
#define MN 1000000
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
char s[MN+5],t[MN+5];
int last[MN+5][26],a[MN+5],n,... | #include<bits/stdc++.h>
using namespace std;
int n;
char s[1000100];
char t[1000100];
queue<int>q;
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
scanf("%s",t+1);
int ans=0;
for(int i=1;i<=n;++i)
if(s[i]!=t[i]){ans=1;break;}
if(!ans)
{
puts("0");
return 0;
}
for(int up=n,dn=n;dn;--dn)
{
while(t[dn-1]==... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int N;
cin>>N;
int *vCount=new int[N],*b=new int[N],*c=new int[N+1];
for(int i=0;i<N;++i){
vCount[i]=0;
}
bool yesFlg=true;
int oldA=-1,ci=0;
for(int i=0;i<N;++i){
int a1;
cin... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
ll x;
cin>>n>>x;
vector<ll>a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
int ans=0;
int i=0;
while(x>0 && i<n){
x-=a[i];
if(x>=0)ans++;
i++;
}
if(x>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
type... | #include <bits/stdc++.h>
#define Maxn 100007
using namespace std;
int n,x;
int b[Maxn],l[Maxn],r[Maxn];
bool flag[Maxn];
priority_queue<pair<long long,int> >pq;
long long solve(int id,long long tmp)
{
if (tmp<=0LL) return 0LL;
if (tmp<=1LL*l[id]*b[id])
{
return (tmp+l[id]-1)/l[id];
} else
{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int Max=1e6+7;
ll a[Max]; int n,k;
int main(){
ios::sync_with_stdio(0);
scanf("%d%d",&n,&k);
for(int i=1; i<=n; i++) scanf("%lld",&a[i]);
ll ans=0;
//cout<<"OK"<<endl;
if(a[1]>=0) ans=a[k];
else if(a[n]<=0) ans=-a[n-k... | #include<bits/stdc++.h>
using namespace std;
inline int read(){
char c=getchar(); int res=0;
while(!isdigit(c)) c=getchar();
while(isdigit(c)){ res=(c&15)+(res<<1)+(res<<3); c=getchar(); }
return res;
}
int n,*a,*b;
int main(){
n=read();
a=new int[n]; b=new int[n+1];
pair<int,int>*bound=new ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 5;
int a[NMAX], sol, n, m, s;
int main() {
cin >> n >> m;
for(int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
a[x]++;
a[y + 1]--;
}
for(int i = 1; i <= n; i++) {
s += a[i];
if(s == m)... | #include<bits/stdc++.h>
#define maxn 100005
using namespace std;
int n,m;
int main()
{
int x,y,l=0,r=maxn;
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
l=max(x,l),r=min(y,r);
}
if(l>r)printf("0");
else printf("%d\n",r-l+1);
return 0;
} | 1 |
/*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) fo... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
using namespace std;... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a;
cin>>a;
cout<<a+a*a+a*a*a;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 99824... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template<typename T>
class SegTree {
public:
explicit SegTree(int n, T def) : N(calcN_(n)), def(def), mVal(2*calcN_(n)-1, def) {}
void update(int idx, T value){
int i = N + idx - 1;
update_(mVal[i], value);
... | #pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#defi... | 1 |
#include <vector>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <map>
#include <array>
#include <cmath>
using namespace std;
long long PRIME = 1000000007;
struct info{
long long b;
long long l;
long long u;
long long d_max;
};
bool comp(... | #include <iostream>
#include <cstring>
#include <cstdio>
#define Maxn 4010
#define Maxm 4010
using namespace std;
int read() {
int x = 0,f = 1;
char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while('0' <= c && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
ret... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
/*
int a, b;
cin >> a >> b ;
//*/
//*
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
//*/
/*
if( a < 6 ){
cout << 0 << endl;
} else if (a ... |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
#define rep(a,n) for(ll a = 0;a < n;a++)
static const ll INF = 1e15;
static const ll mod = 1e9+7;
template<typename T>
static inline void chmi... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = int(3e5) + 7;
const int logN = 17;
const int mod = int(1e9) + 7;
typedef pair<int, int> pii;
int p[N][logN + 1]... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
string S;
int w;
cin >> S >> w;
for (int i = 0; i < S.size(); i += w){
cout << S.at(i);
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc112_d.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const ll INF = 1e17;
template<typename T, typename E, typename F, typename G, typename H>
class LazySegmentTree {
int n, height;
F f; G g; H h; const T ti; const E ei;
vector<T> dat; vector<E> laz... | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define mkt make_tuple
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
int n, q, s, t, x, u;
iP a[1<<18];... | 1 |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#de... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K,X;
cin >> K >> X;
for (int i = 0; i < K*2-1; i++) {
if (i == K*2-2){
cout << X - K + 1 + i << endl;
}
else {
cout << X - K + 1 + i << ' ';
}
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int k, x;
cin >> k >> x;
for(int i=x-k+1; i<x+k; i++){
if(i==x+k-1) cout << i << endl;
else cout << i << " ";... | 1 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | //2020年4月17日現在
#include<stdio.h>
#include<cmath>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<complex>
#include<queue>
#include<set>
#include<utility>
#include<iomanip>
#include<limits>
#include<thread>
#include<map>
#include<stack>
#include<numeric>
#include<casse... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int N = 100;
vector<vector<bool>> G(N, vector<bool>(N));
for (int i = 0; i < N / 2; i++) {
for (int j = 0; j < N; j++) {
G[i][j] = 1;
}
}
int i = 0, j = 0;
for (int c = 0; c < A - 1; c++) {
G[i][j] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 1 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
char *ho = "Hoshino";
rep(i,n+1) {
char c, s[2010];
rep(j, 2000) {
scanf("%c", &c);
if(c == '\n') {
s[j] = '\0';
break;
} else {
s[j] = c;... | #include <stdio.h>
#include <string>
#include <iostream>
using namespace std;
int main(int argc, char const* argv[])
{
string find_str("Hoshino"),rep_str("Hoshina"),target;
int n;
cin >> n;
getchar();
for( int i = 0;i < n;i++ ){
getline(cin,target);
for( string::size_type pos = target.find( find_str ); pos... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=2e5+500;
int fa[N],dep[N],siz[N],stack[N],dfs_cnt,top,nid[N],tag[N<<1],a[N<<1],dfn[N],K,kfa[N],n;
int fst[N],nxt[N],to[N],mm;
void ade(int u,int v){to[++mm]=v,nxt[mm]=fst[u],fst[u]=mm;}
void dfs(int u)
{
dep[u]=dep[fa[u]]+1;dfn[u... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
string s;
signed main(){
ios_base::sync_with_stdio(0);
cin>>s;
for(int i=... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int n = s.size();
for(int i = 0; i < n; i++){
if(i < n-1 && s[i] == s[i+1]){
cout << i+1 << " " << i+2 << endl;
return 0;
}else if(i < n-2 && s[i] == s[i+2]){
cout << i+1 << " " << i+3 << endl;
return 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, m, n) for (int i = (m); i < (n); i++)
constexpr long long mod = 998244353;
int main() {
string s; int k; cin >> s >> k;
k = min<int>(k, count(s.begin(), s.end(), '1'));
vector<int> a = { 0 };
for (aut... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 303
const int mod=998244353;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,m,gu,dp[... | 1 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int64_t m = s.size();
vector a(1, 0L);
i... | #include<bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
cs int Mod = 998244353;
int add(int a, int b){ return a + b >= Mod ? a + b - Mod : a + b; }
int dec(int a, int b){ return a - b < 0 ? a - b + Mod : a - b; }
void Add(int &a, int b){ a = add(a,b); }
cs int N = 305;
int n, K; char S[N];
in... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
class Node {
public:
int key;
Node* parent;
Node* left;
Node* right;
Node(int key) {
this->key = key;
this->parent = NULL;
this->left = NULL;
this->right = NULL;
}
void append_left(Node* left) {
this->left = ... | #include <cstdio>
#include <list>
#define N 100
using namespace std;
/** Crazy Motor-Cycle */
struct cmc
{
int a;
int b;
int c;
};
/** Application main entry point. */
int
main (
int argc,
char * argv[ ]
)
{
int i;
for ( ; ; )
{
list<struct cmc> lis;
int d[ 3 * N ];
int a, b, c;
... | 0 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<iostream>
#define llong long long
using namespace std;
inline int read()
{
int x=0; bool f=1; char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=0;
for(; isdigit(c);c=getchar()) x=(x<<3)+(x<<1)+(c^'0');
if(f) return x;
retur... | #include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
using namespace std;
inline int read(){
int v=0,f=1;
char c=getchar();
while (c<'0' || c>'9'){
if (c=='-') f=-1;
c=getchar();
}
while (c>='0' && c<='9'){
v=v*10+c-'0';
c=getchar();
}
return v*... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.