code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
#if DEBUG
template <typename Iter>
void debug_iter(Iter begin, Iter end);
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, size_t N>
void debug(const std::array<T, N>& a) {
debug_iter(a.begin(), a.end());
}
template <typename T>
void debug(cons... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair <int, int>;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define each(i, mp) for (auto &i : mp)
const int INF = 1001001001;
int main()
{
int a;
cin >> a;
ll ans =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pint pair<int, int>
#define pll pair<ll, ll>
#define vint vector<int >
#define vll vector<ll >
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i,n) for (int i = 0; i < (n); ++i)
const int I... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ran 1001001
struct Node {
int pre, det, suf;
Node() {}
} info[ran];
int n;
char s[ran];
Node analysis() {
int len = strlen(s);
int h = 0;
int mi = 0;
for(int i=0;i<len;i++) {
if(s[i]=='(') h++;
else h--;
mi = min(mi, h);
}
Node res;
res.pre = -... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define vll vector<ll>
#define ld long double
#define pll pair<ll,ll>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#d... | 1 |
#include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
int main()
{
int k;cin>>k;
vector<int> x(k);
vector<int> y(k);
int i,j;
rep(i,k)cin>>y[i]>>x[i];
vector<int> a(8-k);
rep(i,8-k)a[i]=i;
vector<in... | #include <cstdio>
long long x[100001],p[100001],ans,n,s;
int main(){
scanf("%d%d",&n,&s);
for(int i=1;i<=n;i++)
scanf("%d%d",&x[i],&p[i]);
int i=1,j=n;
while(i<=j){
if(s<=x[i]){
printf("%lld",x[j]-s+ans);
return 0;
}else if(s>=x[j]){
printf("%lld",ans+s-x[i]);
return 0;
}
if(p[i]>=p[j]){
an... | 0 |
/*
In the name of Allah
MohammadErfan Gooneh
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) for (int i = 0; i < n; i++) cout << a[i] << " "; cout << endl;
#... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B > C + D) {
printf("Left\n");
} else if (A + B < C + D) {
printf("Right\n");
} else {
printf("Balanced\n");
}
} | 0 |
//used C i/o for faster peformance
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
int x,y,z,n,m,road[200005],rail[200005],connect[200005];
pair<pair<int,int>,int> total[200005];
int root (int ind) {
if (road[ind] == ind) return ind; else
return road[ind] = root(road[ind]);
}
void o... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb pus... | 1 |
/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG //FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vec... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define FIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(in) in.begin(), in.end()
ll base[65];
void smallAns(ll x){
for(ll i = 60 ; i >= 0 ; i--){
if((x>>i) & 1){
if(base[i] == 0){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int> > vvint;
typedef vector<pair<int, int> > vpii;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for(int i = 0; i < k; i++) {
if(i % 2 == 0) {
if(a % 2 != 0) {
a--;
}
int h = a / 2;
a = h;
b += h;
} else {
... | 0 |
#include <cstdio>
#include <cstring>
#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
using namespace std;
typedef long long LL;
const int N = 110;
int d[N], cd;
LL f[N][N][2][2];
LL dfs(int l, int r, int g0, int g1, int gf)
{
if (l < r) return (g0 == g1);
if (l ==... | #include <iostream>
#include <string>
using namespace std;
int main()
{
long long N;
cin >> N;
long long c = N*(N+1)/2;
long long j = N / 3;
long long k = N / 5;
long long l = N / 15;
c = c - 3*j*(j+1)/2 - 5*k*(k+1)/2 + 15*l*(l+1)/2;
cout << c;
}
| 0 |
#include <algorithm>
#include <vector>
#include <iostream>
#include <iomanip>
#include <map>
#include <queue>
#include <string>
#include <cmath>
#include <numeric>
#include <set>
#include <bitset>
#include <cstdint>
#include <unordered_map>
using namespace std;
using i64 = int64_t;
using ui64 = uint64_t;
using d64 = l... | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int V,E,r;
const int Inf = 10000*100000+100;
ll C[100010];
int main(){
while(cin >> V >> E >> r && V >0){
vector< vector< P > > v(V+10);
for(int i=0;i<E;i++){
ll s,t,d;
... | 1 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | #include <bits/stdc++.h>
#define N 200001
using namespace std;
typedef unsigned ui;
typedef long long ll;
typedef unsigned long long ul;
struct point { int x, y; } ps[N];
ui fs[N];
ui uf(ui x) { return fs[x] ? fs[x] = uf(fs[x]) : x; }
bool uu(ui x, ui y) {
x = uf(x); y = uf(y);
if (x != y) fs[x] = y;
return x != ... | 0 |
/// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) fo... | #include <bits/stdc++.h>
using namespace std;
const int N = 220000;
int n;
long long a[N], sum[N];
int L[N], R[N];
inline long long calc(int st, int en, int p, int q) {
long long s = sum[en] - sum[st - 1];
long long s1 = sum[q] - sum[p - 1];
long long s2 = s - s1;
return abs(s1 - s2);
}
int main() {
ios::sync_... | 1 |
#include <bits/stdc++.h>
#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 fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
/* ちゃんと考えてわかって実装 */
int main(void){
ll d, g;
cin >> d >> g;
vector<P> pc;
for(int i=0; i<d; i++){
ll tmpp, tmpc;
cin >> tmpp >> tmpc;
pc.push_back(P(tmpp, tmpc));
}
ll ans = 10000... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int P[2];
for(int i = 0; i < 2; i++){
vector<int> point(10);
for(int j = 0; j < 10; j++){
cin >> point[j];
}
sort(point.rbegin(), point.rend());
P[i] = point[0] + point[1] + point[2];
}
cout <... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> p[2];
int tmp;
for(int j=0;j<2;j++){
for(int i=0;i<10;i++){
cin >> tmp;
p[j].push_back(tmp);
}
sort(p[j].begin(),p[j].end(),greater<int>());
int sum=0;
for(int i=0;i<3;i++)
sum+=p[j][i];
cout << sum;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 1e6 + 10, MAX = 30;
int n;
string s, t;
vector <int> indx[MAX];
int nxt[MAXN];
bitset <MAXN> b;
int32_t main () {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> s >> t;
for (int i = 0; i <... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int n,ans;
char a[1000005],t[1000005];
int pre;
queue<int>Q;
int same(){
for(int i=1;i<=n;i++){
if(a[i]!=t[i])return 0;
}return 1;
}
int main(){
scanf("%d",&n);
scanf("%s",a+1);
... | 1 |
#include <cstdio>
#include <cstring>
#define rep(i, n) for(i=0;i<(n);++i)
int a[11][11], n, i, j, t;
int main()
{
while (scanf("%d", &n), n) {
memset(a, 0, sizeof(a));
rep(i, n) rep(j, n) {
scanf("%d", &t); a[i][j] = t; a[n][j] += t; a[i][n] += t;
}
rep(i, n) a[n][n] += a... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
char sub(char ch){
if(ch=='a')return 'z';
el... | 0 |
#include<bits/stdc++.h>
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
using namespace std;
const int N=105;
char mp[N][N];
int n,m,ex,ey,ans,dp[N][N][N];
int sr[N][N],sc[N][N];
void mx(int &x,int y){x<y?x=y:0;}
int main(){
scanf("%d%d",&n,&m);
memset(dp,233,sizeof(dp));
For(i,1,n) scanf("%s",mp[i]+1);
For... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1000000007;
int solve() {
int N, M; cin >> N >> M;
ll r = 0, c = 0;
vector<bool> nr(N*M, false), nc(N*M, false);
for (int i = 0; i < N; i++) {
int x; cin >> x; x--; if (nr[x]) return 0;
nr[x] = true;
}
for (int i = 0; i ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin>>S;
int Ans=0;
if(S=="SUN"){Ans=7;}
else if(S=="MON"){Ans=6;}
else if(S=="TUE"){Ans=5;}
else if(S=="WED"){Ans=4;}
else if(S=="THU"){Ans=3;}
else if(S=="FRI"){Ans=2;}
else {A... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define ra... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string a(int aa, int b) {
if(aa <= 8 && b <= 8) {
return "Yay!";
}
return ":(";
}
int main() {
int aa, b;
cin >> aa >> b;
cout << a(aa, b);
}
| #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
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; }
ll mod= 1e9 + 7;
... | 1 |
#include <cstdio>
using namespace std;
int main()
{
char mp[15][15] = {0};
int pi, pj;
int cnt;
while (scanf("%s", mp[1]) != EOF){
cnt = 0;
for (int i = 2; i <= 12; i++) scanf("%s", mp[i]);
for (int i = 1; i <= 12; i++){
for (int j = 0; j < 12; j++){
if (mp[i][j] == '1'){
if(mp[i-1][j] != ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int i=0;
int ac=0;
while((i<s.size()-1)&&(ac==0)){
if((s.at(i)=='A')&&(s.at(i+1)=='C')){
ac++;
}
i++;
}
if(ac==1){
cout << "Yes" << endl;
}
else{
cout <<... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define SORT(v) sort(ALL(v))
//#define scanf scanf_s
typedef pair<int, int> P;
int n,m,q;
int a[105];
int main()
... | #include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int main(){
int n, dp[50];
while(cin>>n,n!=0){
fill(dp,dp+50,0);
dp[0]=0,dp[1]=1,dp[2]=1,dp[3]=2;
for(int i=3;i<=n+1;i++)dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
int ans=d... | 0 |
#include<bits/stdc++.h>
#define mems(a,x) memset(a,x,sizeof(a))
#define first fi
#define second se
using namespace std;
typedef long long ll;
const int mod=1e9+7,N=105;
const double eps=1e-8,pi=3.1415926535898;
ll inv(ll x){return x==1?x:(mod-mod/x)*inv(mod%x)%mod;}
ll inv(ll x,ll mod){return x==1?x:(mod-mod/x)*inv(mod... | #include <bits/stdc++.h>
using namespace std;
#define DBG cerr << '!' << endl;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i)
#define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define S... | 1 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#... | #include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
namespace SCC {
const vector<vector<size_t>> *map, *revMap;
vector<size_t> parent, topological;
vector<bool> visit;
size_t n, current;
size_t find(size_t p) {
size_t &q = parent[p];
if (p == q) return p;
return q ... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,m;
cin>>n>>m;
vector<int>a(n);
rep(i,n)cin>>a[i];
vector<ll>sum(n+1);
for(int i=1; i<=n; ++i){
sum[i]=sum[i-1]+a[i-1];
}
map<... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mod = 1e9+7;
int main()
{
int n;
cin>>n;
vector<ll> a(n);
ll s1 = 0, s2 = 0;
for (int i=0; i<n; i++) {
cin>>a[i];
s1 += a[i];
s2 += (a[i] * a[i]);
s1 %= mod;
s2 %= mod;
}
ll res = (... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n, q;
cin >> n >> q;
... | #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> // int64_t, int*_t
#include <cstd... | 1 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define each(it,v) for(auto &it : v)
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vl vector<long>
#define P pair<int,int>
using namespace std;
#define pi 3.141592... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 200000 + 10;
char s[N]; int n;
int lef[N];
int main() {
scanf("%d%s", &n,s+1);
if(s[1] == 'W') return !printf("0\n");
lef[1]=1;
for(int i=2;i<=2*n;i++){
if(s[i]==s[i-1]) lef[i]=1^lef[i-1];
else lef[i]=lef[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000005;
char a[maxn],b[maxn];
int q[maxn],head,tail;
int main()
{
int n;
scanf("%d",&n);
scanf("%s%s",a+1,b+1);
if(strcmp(a+1,b+1)==0)
{
puts("0");
return 0;
}
int ans=0;
head=tail=maxn-2;
//q[tail++]=n+1;
... | #include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cmath>
#include <complex>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include... | //#pragma GCC optimize(2)
//#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define N 100005
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<22,stdin),p1 == p2)?EOF:*p1++)
using namespace std ;
//char buf[(1 << 22)] , *p1 = buf , *p2 = buf ;
inline int read ()
{
char c = getchar () ; int x = 0 , f = 1 ;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n,k;
int a[200005],b[200005];
int main(){
cin>>n>>k;
for(int i=0;i<n;++i){
cin>>a[i];
}
if(k>50){
for(int i=0;i<n;++i){
cout<<n<<' ';
}
cout<<'\n';
return 0;
}
for(int i=0;i<k;++i){
memset(b,0,sizeof(b));
for(int i=0;i<n;++i){
int l=max(0,i-a[... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
int main(){
int n,q; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;... | #include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, m, a, b;
vector<int> g[N], ans(N + 1);
vector<int> minCircle(int s) {
int d[N] = {0}, f[N] = {0};
queue<int> q;
q.push(s);
while(!q.empty()) {
int p = q.front();q.pop();
for(int c : g[p]) {
if(!d[c]) {
... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
voi... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_... | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int card[4];
char c;
while(cin >> card[0] ){
for(int i=1;i<5;i++){
cin >> c >> card[i];
}
sort(card, card+5);
int two = 0;
boo... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int num, v, n, m, len, cnt;
vector<long long> vc[2];
while(cin >> n){
if(n == 0) break;
vc[0].clear();
vc[1].clear();
len = 0;
for(int i=0; i<n; i++){
cin >> num >> v >> m;
for(int j=0; j<=len; j++){
i... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
double n,m,l;
cin>>n>>m>>l;
if(l==0){
cout << std::setprecision(20) <<(m-1)/n<<endl;
}else{
cout << std::setprecision(20) <<(m-1)*(2*(n-l))/(n*n)<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int a,b,c;
int main(){
cin>>a>>b>>c;
if (((a < c) && (b > c)) || ((a > c) && (b < c))){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | #include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std;
template<c... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n;
long long int m;
while (cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
long long int b;
vector<long long int> ss;
ss.push_back(0);
for (int i = 0; i < n; i++) {
cin >> b;
if ... | #include<bits/stdc++.h>
using namespace std;
#define il inline
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define gc getchar()
#define ll long long
#define int long long
#define ri register int
#define rc register char
#define rb register bool
#define rp(i,x,y) for(ri i=x;i<=y;++i)
#define my(i,x,y) for(ri i=x;i>=y;--... | 0 |
#include <iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define min(A,B) ((A)<(B)?(A):(B))
int dp[2000][2000];
int EditDistance(char *s,char *t)
{
int i,j,cost;
int slength=strlen(s);
int tlength=strlen(t);
dp[0][0]=0;
for(i=1;i<=slength;i++) ... | #include <iostream>
#include <string>
using namespace std;
int n, m, solve[1010][1010];
string s1, s2;
int l1, l2, tmp;
int dp(int n, int m) {
if (solve[n][m] >= 0) return solve[n][m];
else if (n == 0 || m == 0) solve[n][m] = max(n, m);
else {
tmp = min(dp(n - 1, m), dp(n, m - 1... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
typedef pair<int, int> pii;
typedef double db;
const int N = 5020;
int D, d[N], len; //d[]数组存储D的每一位数字。
ll ans, f[N][2][2];
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define ll long long
#define For(i, j, k) for(int i = j; i <= (int)k; ++ i)
#define Forr(i, j, k) for(int i = j; i >= (int)k; -- i)
#define INF 0x3f3f3f3f
using namespace std;
ll tar, Ans = 0;
ll p[20];
inline void file(){
freopen("arc075_F.in",... | 1 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | // 2020-07-04 23:45:06
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(vector<ll>& A) {
int n = A.size();
vector<ll> C(n+1);
for ( int i = 0; i < n; i++ ) {
C[i+1] = C[i] + A[i];
}
auto diff = [](ll m1, ll m2) {
return max(m1,m2) - min(m1,m2);
};
int i1,i2,i3;
ll... | #include<bits/stdc++.h>
#define lowbit(i) ((i)&(-(i)))
#define lson(i) ((i)<<1)
#define rson(i) ((i)<<1|1)
#define sqr(x) ((x)*(x))
#define fi first
#define se second
#define mp(x,y) make_pair((x),(y))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef pair<int,int> ... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int m... | /*
*/
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using ... | 0 |
#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;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FASTIO ios_base::sync_with_stdio(0);cin.t... | #include <bits/stdc++.h>
#include <atcoder/all>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
using namespace atcoder;
int main(){
int n,q;
std::cin >> n >> ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,X,T;
cin>>N>>X>>T;
if(N % X ==0){
cout<<(N/X)*T<<endl;
}
else if(N % X !=0){
cout<<((N/X)+1)*T<<endl;
}
} | // Created by new_sm
//
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
s.find_by_order(x) xth element in set
x.order_of_key(x) number of elements <x*/
#include<bits/stdc++.h>
using namespace std;
#d... | 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 K = 50;
char r[K*2][K*2];
void solve() {
int a, b; scanf("%d%d", &a, &... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
#define all(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,k,n) for(int i=(k);i<(n);++i)
int main() {
int A, B; cin >> A >> B; A--, B--;
vector<string> g(50,string(100,'#'));
vector<st... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
const int MOD = 1e+9 + 7;
int main()
{
int N, X, Y, Z;
cin >> N >> X >> Y >> Z;
long long ans = 1;
REP(i, ... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
#define N 4000011
const int p=1e9+7;
int n,k,dp[2002][2002],inv[N],f[N],finv[N];
inline int C(int nn,int mm)
{
if(mm==nn||mm==0)return 1;if(nn<mm)return 0;... | 0 |
#include <bits/stdc++.h>
using namespace std;
int MAX_N=262144*2;
vector<int64_t> seg(MAX_N*2-1);
int64_t qu(int a,int b,int k,int l, int r){
if(r<=a||b<=l){
return 0;
}
else if(a<=l&&r<=b){
return seg[k];
}
else{
int64_t X=qu(a,b,k*2+1,l,(l+r)/2);
int64_t Y=qu(a,b,k*2+2,(l+r)/2,r);
retur... | #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).rend... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int n,m;
cin>>n>>m;
int ans;
for(int i = m/n; i >= 1; i--){
if((m-n*i)%i==0) {ans=i; break;}
}
cout<<ans<<endl;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templ... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#define MOD 1000000007
using namespace std;
int main(){
long long int r=0,c=0;
long long int n,m; cin >> n >> m;
vector<int> row(n), col(m);
for(int i=0;i<n;i++) cin >> row[i];
for(int i=0;i<m;i++) cin >> col[i];
sort(row.begin(), row.end(), greater<i... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <queue>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<... | 0 |
/**
* author: FromDihPout
* created: 2020-06-21
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long an... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long int ll;
int main()
{
int n;
ll a, b, x, d, op = 0 ;
cin >> n >> x;
cin >> a >> b;
if( a + b > x )
{
d = a + b - x;
if( d <= b ){
b -= d;
}
else
{
b = 0;
}
... | 1 |
#include <iostream>
using namespace std;
int sports[1001];
int money,ans,maxvote,n,m,k;
int vote[1001];
int main(){
cin >> n >> m;
for(int i=1;i<=n;i++){
cin >>sports[i];
}
for(int i=1;i<=m;i++){
cin >> money;
k=1;
while(money<sports[k]){
k++;
}
vote[k]++;
}
ans=1;
maxvote=0;
for(int i=1;i<=n;i++... | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N+1); // 1-indexed
rep... |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int Max_N(1000050);
int N, Temp[26], Last[Max_N][26];
char S[Max_N], T[Max_N];
void init()
{
scanf("%d", &N);
scanf("%s", S + 1);
scanf("%s", T + 1);
memset(Temp, -1, sizeof(Temp));
for (int i = 1;i <= N;++i)
{
Temp[S[i] ... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=5e5;
const int mod=1e9+7;
int a[maxn+5],num[maxn+5],dp[maxn+5];
int x[1<<20],y[1<<20];
int n;
void update(int &x,int y)
{
x=(x+y)%mod;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]),a[i]^=a[i-1],num[i]=num[i-1]+(a[i]==0);
for(int i... | #include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const ll MAX_N = 6e5 + 25, MAX_M = 1500000, MOD = 1e9 + 7;
ll n, ans;
ll Arr[MAX_N];
ll dp[MAX_N];
ll DP[MAX_N];
ll ind;
vector <l... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < n; i++)
typedef long long ll;
// Welcome to my source code!
struct Node {
int key;
Node *parent, *left, *right;
};
Node *root, *NIL;
void insertKey(int key) {
Node *y = NIL;
Node *x = root;
Node *z;
z = new No... | #include <iostream>
using namespace std;
int main() {
int AsPoint, BsPoint, AsCard, BsCard;
int key;
while(true){
cin >> key;
AsPoint = BsPoint = 0;
if(key == 0) return 0;
while(key != 0) {
cin >> AsCard;
cin >> BsCard;
if(AsCard == BsCard... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main(){
ll n,a,b,c,d,e,f,g;
cin>>n>>a>>b>>c>>d>>e;
f=min(min(min(min(a,b),c),d),e);
g=n/f;
if(n%f>0) g++;
cout<<g+4<<endl;
} | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll ... | 0 |
#include <stdio.h>
#include <string.h>
int main() {
char a[11], b[11], c[11];
scanf("%s %s %s", a, b, c);
int l1 = strlen(a);
int l2 = strlen(b);
if(a[l1 - 1] == b[0] && b[l2 - 1] == c[0]) {
puts("YES");
}
else puts("NO");
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int N, ans = 0;
string A, B, C;
cin >> N >> A >> B >> C;
rep(i, N) {
if (A[i] == B[i]) {
if (A[i] != C[i]) ans++;
} else if (A[i] == C[i]) {
an... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int main(){
int N, R;
cin >> N >> R;
int ans;
if(N >= 10){ans = R;}
else{ans = R + (100 * (10 - N));}
cout << ans << en... | 1 |
#include <iostream>
using namespace std;
int main()
{
double U = 3.14;
int R;
cin >> R >> U;
cout << R * 2 * U <<"\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int r; cin >> r;
cout << 2 * r * acos(-1) << endl;
return 0;
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
#define db(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<'\n'
const int inf = 1e9+7;
const int N = 1e6+9;
int main() {
ios_base::sync_with_stdio(0);
int a,b,n;
cin>>n;
// set<int> st;
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return tru... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
// Grid Repainting 2
int h, w; cin >> h >> w;
vector<string> s(h);
vector<vector<bool>> visited(h, vector... | #include<iostream>
using namespace std;
int main(){
int n,m;
int judge;
int max=0;
cin >> n >> m ;
int a[n];
int b[1000]={};
for( int i=0 ; i<n ; i++ ) cin >> a[i] ;
for( int i=0 ; i<m ; i++ ){
cin >> judge ;
for( int j=0 ; j<n ; j++ ){
if( a[j] <= judge ){
b[j]++;
if( max < b[j]) max=b[... | 0 |
#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 <math.h> // sqrt
using namespace std;
typedef long long ll;
int main() {
int N, Q;
string S;
cin >> N >> Q... | #include <bits/stdc++.h>
#define INF 1000000000
typedef long long ll;
using namespace std;
int main()
{
ll n;
cin >> n;
vector<ll> M(n + 1);
cin >> M[0];
for (int i = 1; i < n; i++) {
cin >> M[i] >> M[i];
}
cin >> M[n];
vector<vector<ll>> dp(n, vector<ll>(n, INF));
for (int i = 0; i < n; i++) {
dp[i][i] =... | 0 |
#include<iostream>
using namespace std;
#define MAX 100
#define BLANK 0
#define LONG 4
#define SHORT 2
#define HORIZONTAL 0
#define VERTICAL 1
#define VISITED 9
int field[MAX+2][MAX+2];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void rec(int x,int y,int c)
{
int i;
if(field[x][y]!=c)return;
field[x][y]=VISITED;... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int,int> pr;
int main() {
// your code goes here
int w,h;
while(cin >> w >> h && w!=0){
int xs,ys,xg,yg,n,m,s,sum,c,d,x,y;
int dx[]={0,1,-1,0},dy[]={1,0,0,-1};
cin >> xs>>ys>>xg>>yg >> n;
bool map[102][102]={};
int color[1... | 1 |
#include <iostream>
#include <string>
using namespace std;
int a(char x){
switch (x) {
case 'I': return 1;
case 'V': return 5;
case 'X': return 10;
case 'L': return 50;
case 'C': return 100;
case 'D': return 500;
case 'M': return 1000;
}
return 0;
}
int main(void){
string str;
int ans=0;
int p=0;
... | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
char c[101],m[7]={'I','V','X','L','C','D','M'};
int s,i,j,h,n[7]={1,5,10,50,100,500,1000};
while(gets(c)!=NULL) {
s=0; h=10;
for (i=0;i<strlen(c);i++) {
for (j=0;j<7;j++) if (c[i]==m[j]) break;
s+=n[j];
if (h... | 1 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
vector<int> A(3); cin >> A[0] >> A[1] >> A[2];
int K; cin >> K;
sort(A.begin(),A.end());
for (int i = 0; i < K; ++i) A[2] *= 2;
int sum = A[0] + A[1] + A[2];... | #include<iostream>
#include<string>
using namespace std;
int main(void){
string str;
int q;
cin >> str;
cin >> q;
for (int i=0;i<q;i++){
string c;
cin >> c;
if (c=="print"){
int a,b;
cin >> a >> b;
for (int i=a;i<=b;i++)
cou... | 0 |
#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 << "] " ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
#define ABC 001
#define ... | 1 |
#include<iostream>
#include<cstring>
const int mod=1000000007;
using namespace std;
long long npow(long long x)
{
long long ans=1,n=mod-2;
while(n)
{
if(n&1) ans=ans*x%mod;
x=x*x%mod;
n>>=1;
}
return ans;
}
long long co(long long x,long long y)
{
long long ans=1;
for(int i=0;i<x;i++)
ans=(ans*(y-i))%mod;... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<dequ... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string str;
while(getline(cin, str)) {
for(int i=0; i<25; i++) {
if(str.find("the")!=string::npos) break;
if(str.find("this")!=string::npos) break;
... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
while(getline(cin, s)){
for(int i = 0; i < 26; i++){
for(int i = 0; s[i] != '\0'; i++){
if(s[i] >= 97 && s[i] <= 122) s[i] = (s[i] - 97 + 1) % 26 + 97;
}
if(s.find("the", 0) != string::npos || s.find("this", 0) != string::... | 1 |
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
#define int long long
signed main(){
int a;
while( scanf("%lld", &a) != EOF ){
if(a==0) break;
vector<vector<int>> m(a+1,vector<int>(a+1,0));
for(int i=0;i<a;i++){
... | // C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
// cout.precision(15); cout << fixed;
int main() {
vector<int> A(3); loop(i,0,3) cin >> A[i];
int k; cin >> k;
while (k--) {
sort(A.rbegin(), A.rend());
... | 0 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(min(a,b)<c&&c<max(a,b))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,x;
int ans = 0;
bool flag = false;
cin >> N >> x;
vector<int> vec(N);
for(int i=0;i<N;++i){
cin >> vec.at(i);
}
sort(vec.begin(),vec.end());
for(int i=0;i<N-1;++i){
if(x - vec.at(i) >= 0){
x -= vec.at(i);
ans += 1... | 1 |
#include <cstdio>
#include <string>
using namespace std;
int m;
int d;
string days[] = {"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
int GetNumDay(int m) {
switch (m) {
case 2:
return 29;
case 4:
case 6:
case 9:
case 11:
return 30;
default:
return 31;
}
}
int m... | #include <iostream>
using namespace std;
int main(){
int n;
int count[30];
while(cin >> n, n){
for(int i = 0;i < n;++i){
count[i] = i < 3 ? 1 : 0;
}
for(int i = 0;i < n;++i){
for(int j = 1;j < 4;++j){
if(i + j >= n) break;
coun... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long Int;
int main() {
Int H, W, A, B;
cin >> H >> W >> A >> B;
vector<string> s(H);
if (B > 0) {
rep(i,B) {
if (... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
using namespace std;
typedef unsigned long long ull;
const ull INF = ULLONG_MAX/3;
void latentEvaluation(int ss, vector<ull> &xList, vector<ull> &sxList){
i... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, pair<int, int>>
using ll = long long;
using ld = long double;
const int N = 1e5 + 69;
priority_queue<pii, vector<pii>, greater<pii>> edges;
vector<pair<int,int>> a, b;
ll ans;
int n, cnt;
int par[N], sz[N];
int fpar(int a) {
return (a == par[a] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<p> > x(N, vector<p>());
vector<bool> C(N);
vector<ll> L(N);
for(int i = 0; i < N - 1; i++) {
int... | 0 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for (ll i=0; i<(n); ++i)
#define rep1(i,n) for (ll i=1; i<=(n); ++i)
typedef long long ll;
bool debug=false;
string yes = "Yes";
string no = "No";
const ll mod = 998244353;
const double e = 0.000000001;
int main(){
ll n; cin >> n;
cout... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;... | 1 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5+5;
long long q[MAXN];
struct segtree{
long long seg[5*MAXN];
long long lazy[5*MAXN];
void push(long long curr){
if(lazy[curr]){
seg[2*curr]+=lazy[curr];
seg[2*curr+1]+=lazy[curr];
... | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 200005;
const LL INF = 0x3f3f3f3f3f3f3f3f;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = get... | 1 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
double r,g;
cin>>r>>g;
cout<<2*g-r<<endl;
ret... | 0 |
#include <bits/stdc++.h>
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
unsigned long N;
cin >> N;
auto pw = [&MOD](unsigned long a, unsigned long n = 1000000005){
unsigned long ret = 1;
while(n){
if(n & 1)(ret *= a) %= MOD;
(a... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct edge{
int u; //?????????
int v; //??°??????
int cost; //??????
//???????????????????????§?????§?°???¢????????????
bool operator<(const edge& another) const {
return cost < another.cost;
}
};
const int MAX_N = 100;
const int ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n,a[N],b[N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=n;i>=1;i--) scanf("%d",&b[i]);
for(int i=1;i<=n;i++){
if(a[i]==b[i]){
bool flag=0;
for(in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define matrix vector<vector<char>>
#define zero(n,m) matrix(n , vector<char>(m,'0'))
#define one(n,m) matrix(n , vector<ll>(m,1))
#define pii pair<int,int>
#define point complex<ld>
#define ang... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n; cin >> n;
ll tmp = INF;
rep(i, 5) {
ll a; cin >> a;
tmp = min(tmp, a);
}
if (n%tmp == 0) cout << n/tmp + 4 << endl;... | #pragma region header
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
char ch[20];
int i=0;
while(cin >> ch[i]){
i++;
}
for(int j=i-1 ; j>=0 ; j--){
cout<<ch[j];
}
cout<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
cout << string(s.rbegin(),s.rend()) << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
typedef long long lint;
const int N=1e5+5;
int n,m,val[N],nxt[N],ans[N];
lint q;
bool vis[N];
template <class T> inline T nxi(){
T x=0;
char c;
while(((c=getchar())>'9'||c<'0')&&c!='-');
const bool f=c=='-'&&(c=getchar());
while(x=x*10-48+c,(c=getchar())>='... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L,R;
cin >> L >> R;
int modL = L % 2019;
int modR = R % 2019;
if (R - L >= 2018){
cout << 0 << endl;
return 0;
}
else if (modL > modR){
cout << 0 << endl;
return 0;
}
int N = 2019;
for (int i = modL; i < modR; i++) {
... | 0 |
#include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int n,m;
map<int,vector<pair<int,int> > >G[1<<17];
map<int,int>d[1<<17];
main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b,c;cin>>a>>b>>c;
G[a][c].push_back(make_pair(b,c));
G[b][c].push_back(make_pair(a,c));
G[a][c].push... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
using namespace std;
const int N=5e6;
const int INF=0x3f3f3f3f;
int n,m,cnt;
int len=0;
int lin[N];
int dis[N];
bool vis[N];
map<pair<int,int>,int> id;
struct edge
{
int next,y,v;
}e[N];
inline int read()
{
int x=0,f=1;
char ch=getchar();
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
bool a=false;
for(int i=0;i<S.size()-1;i++){
if(S.at(i)=='A' && S.at(i+1)=='C'){
cout << "Yes" << endl;
a=true;
break;
}
}
if(!a){
cout << "No" << endl;
}
} | 0 |
#include<stdio.h>
int main(void)
{
int a,s,d[10000],f[10000],g[10000],h[10000],i,j,z;
scanf("%d",&a);
scanf("%d",&s);
while(a!=0&&s!=0){
z=0;
for(i=1;i<=s;i++){
g[i]=0;
h[i]=0;
}
for(i=1;i<=s;i++){
scanf("%d %d",&d[i],&f[i]);
if(d[i]==1){
g[f[i]]=1;
h[i]=f[i];
}
// printf("h==%d\n",h[i]);
}
f... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
int main(void)
{
ll n, m;
cin >> n >> m;
vector<ll> s(m),c(m);
rep(i,m) cin >> s[i] >> c[i];
rep(i,1000){
string t = to_string(i);
if(t.size()==n){
bool ok=true... | 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 = 501;
int a[N][N];
struct Move {
int x1, y1, x2, y2;
};
// u... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 1 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n = 0;
cin >> n;
int count = 200;
for (int i = 0;i < n;i++) {
int subcount = 0;
int a =0;
cin >> a;
for (int j = a;j > 1;j /= 2){
if( (j % 2) == 1) {
break;
}
else {
subcount++;
}
}
if (... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a,b;cin >> a >> b;
cout << (a > b ? 2*a-1 : b > a ? 2*b -1 : 2*a);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,s, n) for(int i = s; i < (int)(n); i++)
#define co(x) cout<<x<<endl
#define SQvec(i,j) vector<vector<int>> data(i, vector<int>(j))
#define mod 1000000007
typedef long long int lint;
int main() {
int N,K;
cin >> N >> K;
if(N%K == 0){co(0);}
else{co(1);}... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
const int INF = 1 << 25;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, query;
while (cin >> n >> m , n) {
int cost[101][101], time[101][101];
for (int i = 0; i < m; i++) {
for (int j = 0; j <... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> mato;
vector<int> a;
int main(){
int n,m;
int self;
while(scanf("%d %d",&n,&m) && n && m){
mato.clear();
a.clear();
for(int i=0;i<n;i++){
scanf("%d",&self);
mato.push_back(self);
}
mato.push_back(0);
sor... | 0 |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragm... | #include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=105;
int n,m,a[maxn],b[maxn];
inline char nc(){
static char buf[100000],*p1,*p2;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
int ret=0;bool f=0;char ch=nc();
while(ch>'9'||ch<'0') f^=ch=='-',ch... | 1 |
#include<iostream>
#include<stdio.h>
using namespace std;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
const int mod=1000000007;
int main(){
int d,t,s;
cin>>d>>t>>s;
if(d-t*s<=0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
int x,y;
double z;
cin>>x>>y>>z;
(double(x/z)<=y)?cout<<"Yes":cout<<"No";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll>P;
int main(){
ll N;
cin>>N;
vector<P>Sup;
vector<P>Sdown;
rep(i,N){
string s;
cin>>s;
ll total=0,mini=0;
rep(j,s.size()){
if(s[j]=='('){total++;}
... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 300005
char buf[SIZE];
int num_E[SIZE],num_W[SIZE];
int main(){
int N;
scanf("%d... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int budget = min(A, B) + min(C, D);
cout << budget << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int i = s; i < e; i++)
#define endl '\n'
int main()
{
int n, x, t;
cin >> n >> x >> t;
int ans = (n +x-1)/x * t;
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define zoom ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
bool cmp(pair<ll, ll> a, pair<ll, ll> b) {
return (b.ff + b.ss > ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define IN... | 0 |
#pragma GCC optimize("Ofast","inline")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void r... | #include<iostream>
using namespace std;
int main()
{
int n, a, b, c, d, i, j, team[100], score[100];
cin >> n;
for (i = 1; i <= n; i++) {
team[i] = 0;
}
for (i = 0; i < n*(n - 1) / 2; i++) {
cin >> a >> b >> c >> d;
if (c > d)
team[a] += 3;
else if (c < d)... | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int K,T;
cin>>K>>T;
vector<int> A(T);
for(int i(0);i<T;i++){
cin>>A[i];
}
sort(A.rbegin(),A.rend());
int sum(0);
if(T == 1){
cout << A[0] - 1 <<... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int k,t;
cin >> k >> t;
multiset<int> s;
rep(i,t){
int temp;
ci... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,ans;
cin>>n;
ans=((n-2)*180);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
//ライブラリ始まり
//定数
//円周率
const double PI = 3.1415926535897932384;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
//ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnop... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
using namespace std;
char ss[12][12];
void dfs(int x, int y) {
if (x < 0 || y < 0 || x >= 12 || y >= 12 || ss[y][x] == '0')
return;
ss[y][x] = '0';
dfs(x + 1, y);
dfs(x - 1, y);
dfs(x, y + 1);
dfs... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
int dy[] = {1,0};
int dx[] = {0,1};
struct UnionFind{
vector<int> data;
int __size;
UnionFind(int sz) {
data.assign(sz, -1);
__siz... | 0 |
#include <iostream>
using namespace std;
int main(){
int i;
cin >> i;
if(i >=0 && i <= 1000) {
cout << i * i * i << endl;
}else{
return -1;
}
return 0;
}
| //#include <fsociety>
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <iomanip>... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int A,B; cin >> A >> B; // Aが白
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long a,b; cin >> a >> b;
long long x=__gcd(a,b);
int ans=1;
for(long long i=2;i*i<x;i++){
if(x%i!=0) continue;
ans++;
while(x%i==0){
x/=i;
}
}
if(x!=1) ans++;
cout << ans;
} | 0 |
#include<bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
const int MAXN = 2e5 + 7;
int a[MAXN], b[MAXN], ans[MAXN];
int L[MAXN], R[MAXN];
int main() {
int n; scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
for (int l = 1, ... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
#define rep(i,n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (up... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.