code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <cstdio>
using namespace std;
int table[11][11];
int main() {
int N;
while (cin >> N) {
if (N == 0) break;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> table[i][j];
}
}
int total = 0;
for (int i = 0; i < N; i++) {
int... | #include <iostream>
#include<math.h>
using namespace std;
int smallest = 1000000;
int x, threez, N;
int main()
{
while (cin >> N && N != 0) {
smallest = 1000000;
for(int z = 0; pow(z, 3) <= N; z++) {
threez = pow(z, 3);
for(int y = 0; pow(y, 2) <= N - threez; y++) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fa... | 0 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include<bits/stdc++.h>
#define int long long
#define rg register
#define file(x) freopen(x".in","r",stdin);freopen(x".out","w",stdout);
using namespace std;
const int mod=1e9+7;
int read(){
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9') f=(c=='-')?-1:1,c=getchar();
while(c>='0'&&c<='9') x=x*10+c-48,c=ge... | 1 |
#include<stdio.h>
int main (){
int number, A,B,C;
scanf("%d", &number );
A = number / 100;
B = number % 100 / 10;
C = number % 10;
if (A == 7 || B == 7 || C == 7)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | #include<iostream>
using namespace std;
int f(int x){
return x*x;
}
int main(){
int x;
while(cin>>x){
int ans=0;
for(int i=1;i<600/x;i++)ans+=f(i*x)*x;
cout<<ans<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.size() == 3) reverse(N.begin(), N.end());
cout << N << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
getline(cin, s);
for (int i = 0; i < n; i++) {
getline(cin, s);
for (int i = 6; i < s.length(); i++)
if (s[i-6] == 'H' &&
s[i-5] == 'o' &&
s[i-4] == 's' &&
s[i-3] ==... | 0 |
#include <bits/stdc++.h>
using namespace std;
int const M = 1e9 + 7;
vector<int> memo(5500000, -1);
string K; int D;
int count(size_t i, int total, bool upto) {
if (i == K.size()) return total == 0;
// 14 bits for index, 7 bits for total, 1 bit for upto
int key = (i << 9) + (total << 1) + upto;
if (memo[key] >= ... | #include <bits/stdc++.h>
#define name "vd"
#define ini freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout)
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define oo 1e9 + 7;
#define PII pair<int, int>
#define long long long
using namespace std;
const int NMAX = 1e4 + 5;
const int MOD = 1e9 + 7;... | 1 |
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
using namespace std;
const int maxn=1000000+10;
char a[maxn],b[maxn],sta[maxn];
int dl[maxn*3][2];
int i,j,k,l,t,n,m,tot,head,tail,ans,mi,cnt,num;
bool czy;
int main(){
scanf("%d",&n);
scanf("%s",a+1);
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v)... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#de... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define inf (1<<29)
#define MAX_V 100010
using namespace std;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
const int DFS_WHITE = -1; // unvisit... | #include<bits/stdc++.h>
using namespace std;
void display()
{
int a, b, ar[3];
cin>>a>>b;
ar[0] = a+ b, ar[1] = a - b , ar[2] = a * b;
sort(ar, ar + 3);
cout<<ar[2]<<endl;
}
int main(void)
{
display();
}
| 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include<bits/stdc++.h>
#define ll long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define show1(a) cout<<#a<<" = "<<a<<endl
#define show2(a,b) cout<<#a<<" = "<<a<... | 0 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | #include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int main() {
char buf[1<<10];
size_t q;
scanf("%s %zu", buf, &q);
string str(buf);
for (size_t i=0; i<q; ++i) {
size_t a, b;
scanf("%s %zu %zu", buf, &a, &b);
string instr(buf);
if (inst... | 0 |
#define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const ... | #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 repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 1 |
#include <iostream>
#include <vector>
using namespace std;
class BIT {
public:
BIT(int n) : a(n) {}
void add(int p, long long num)
{
while (p < a.size()) {
a[p] += num;
p |= p + 1;
}
}
/* i から j までの和 */
long long sum(int i, int j)
{
long long s = 0, t = 0;
i--;
while (i >= 0) {
s += a[i];
... | #include<atcoder/all>
using namespace atcoder;
#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 main() {
int N, Q; scanf("%d%d", &N, &Q);
fenwick_tree<LL> G(N);
rep(i, N) { int a; scanf("%d", &a); G.add(i, a); ... | 1 |
/*
* Project: AtCoder Beginners Contest 105 A - AtCoder Crackers
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/06/16
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdio>
usin... | #include <iostream>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int c = 1;
int i;
for(i=0;i<n;i++){
if(c<=k) c*=2;
else c+=k;
}
cout << c << "\n";
return 0;
} | 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 dp[105][10];
int mod = 1000000007;
int main() {
int H, W, K; cin >> H >> W >> K;
dp[0][0] = 1;
for (int i = 0; i < H; i++){
for (int j = 0; j < 1<<(W-1);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll H, W;
ll A[85][85], B[85][85];
ll AB[85][85];
const ll D = 160 * 80 + 10; // あり得る長さ
const ll D2 = D * 2; // あり得る値の範囲
t... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<vector<int>> A(H, vector<int>(W)), B(H, vector<int>(W));
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < H... | 1 |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX ... | #include <iostream>
int main(){
std::ios::sync_with_stdio(false);
while(true){
int n, a_score = 0, b_score = 0;
std::cin >> n;
if(n == 0)
break;
for(int i = 0; i < n; ++i){
int a, b;
std::cin >> a >> b;
if(a > b)
a_score += a + b;
else if(a... | 1 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int number;
int sum = 0;
while(1){
cin >> number;
if (number == 0){
break;
}
int array[number][number];
int lastColumn[number];
int lastRow[number];
... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#define PB push_back
using namespace std;
class cond{
public:
cond(int x, int y, int z, int t){a=x;b=y;c=z;r=t;chked=false;}
int a,b,c,r;
bool chked;
};
int main(void){
int a,b,c;
while(cin >> a >> b >> c){
if((a|b|c) == 0) break;
... | 0 |
// ARC100
// D - Equal Cut
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int MAX_N = 200000;
const ll INF = 1e18;
int N;
int A[MAX_N];
ll s[MAX_N + 1];
int search(int a, int b) {
int l = a + 1, r = b - 1;
while (r - l > 1... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | #include "bits/stdc++.h"
#define REP(i,num) for(int 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int d, g;
cin >> d >> g;
vector<pair<int,int>>pc(d);
for (int i = 0; i < d; i++)cin >> pc.at(i).first >> pc.at(i).second;
int ans = 1e10;
for (int bit = 0; bit < (1 << d); bit++) {
vector<pair<int, int>>pcc = pc;
vector<int> l(0... | #include <string>
#include <memory>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
#include <array>
using namespace std;
vector<vector<int>> graph;
vector<int> colors;
vector<bool> used;
bool Dfs(int v, int col, int* sz) {
used[v] = true;
colors[v] = col;
(*sz)++;
bool ans = false;... | 0 |
#include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#d... | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define F first
#define S second
const int N=1e5+5;
ll a[N];
int main()
{
ft
ll t,i,j,n,m,l,r,p,q,s=0;
cin>>n>>l>>r;
for(i=0;i<n;i++)
{
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, h, w;
cin >> n >> h >> w;
cout << (n-h+1)*(n-w+1) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
a=a+b;
c=c+d;
if(a>c)
{
cout<<"Left";
}
else if(a==c)
cout<<"Balanced";
else
cout<<"Right";
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin>>n>>m;
int mx=INT_MIN, mn=INT_MAX;
for(int i=0;i<m;i++){
int l,r; cin>>l>>r;
mx = max(mx, l);
mn = min(mn,r);
}
cout<<max(0,mn-mx+1)<<"\n";
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... | 0 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define mp ... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
lli n = s.size();
if(s.size() == 26){
if(s == "zyxwvutsrqponmlkjihgfedcba") cout << -1 << endl;
else{
string b = s;
next_permutation(s.begin(), s.end());
rep(i,... | 1 |
#include<iostream>
using namespace std;
#define N 10 // üHÌ
int main()
{
double l[N], v[2];
double sum[N];
double position;
int i;
while (scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf",&l[0],&l[1],&l[2],&l[3],&l[4],&l[5],&l[6],&l[7],&l[8],&l[9],&v[0],&v[1]) != EOF) {
sum[0] = l[0];
for (i = 1;... | #include <iostream>
using namespace std;
int main()
{
double l[10], sum, v1, v2;
char c;
while (1) {
for (int i = 0; i < 10; i++) {
cin >> l[i] >> c;
}
if (cin.eof()) break;
cin >> v1 >> c >> v2;
sum = 0;
for (int i = 0; i < 10; i++) {
sum += l[i];
}
sum *= v1 / (v1 + v2);
for (int i =... | 1 |
#include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
using namespace std;
class cLSearch
{
int mn, mq;
string mS, mT;
vector<int> vs, vt;
int ans... | #include <iostream>
using namespace std;
const int NOT_FOUND=-1;
int linerSearch(int key, int A[],int n){
int i=0;
A[n]=key;
while(A[i]!=key)
i++;
if(i==n)
return NOT_FOUND;
else
return i;
}
int main(){
int n,q;
cin >>n;
int S[n+1];
for(int i=0; i<n; i++)
cin>>S[i];
cin >>q;
int T[q+1];
for(i... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
string n;
cin >> n;
int len = n.... | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll cnt[26];
int main()
{
s... | #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... | 1 |
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int n, A[1010000], B[1010000], cnt;
vector<int>E[26];
char p[1010000], q[1010000];
int main(){
int i, pv, ck = 0, res = 0;
scanf("%d",&n);
scanf("%s",p+1);
scanf("%s",q+1);
for(i=1;i<=n;i++){
E[p[i]-'a'].push_back(i)... | #include<stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
int size = A + B + 1;
char str[100];
scanf("%s", str);
int i, count = 0;
if (str[A] == '-')
{
for (i = 0; i < size; i++)
{
if (str[i] >= '0' && str[i] <= '9')
{
... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int inf = 1000000007;
int main() {
ll l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
vector<ll> a(r - l + 1);
rep(i, r ... | 0 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define DEBUG(a) cerr<<#a<<"="<<a<<endl
#define DEBUG_ARRAY(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#define FOR(i, a, b) for(int i = a;i < b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(... | 1 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<cstring>
using namespace std;
typedef long long ll;
int a[100100];
int c[100100];
bool check(int x,int i)
{
if(c[x]<a[i])
{
retur... | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
//PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll po... | 1 |
#include <iostream>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#include <algorithm>
#include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define l long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i]}
using namespace ... | #include <iostream>
using namespace std;
int main()
{
string N;
getline(cin,N);
if(N[0]=='7'||N[1]=='7'||N[2]=='7')
{
cout<<"Yes";
}
else
{
cout<<"No";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
if(N % K == 0)
cout << 0;
else
cout << 1;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <cstdint>
#include <cmath>
using namespace std;
inline namespace atcoder {
using i32 = int32_t; using u32 = uint32_t;
using i64 = int64_t; using u64 = uint64_t;
using f32 = float; using f64 = double;
template <typenam... | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> abcde(5);
int k;
for(int i = 0;i < 5;i++) cin >> abcde.at(i);
cin >> k;
for(int i = 0;i < 5;i++){
for(int j = i + 1;j < 5;j++){
if(k < abcde.at(j) - abcde.at(i)){
cout << ":(" << endl;
return 0;
... | 0 |
#include "bits/stdc++.h"
using namespace std;
static const int MOD = 998244353;
long long Inv(long long a) {
long long res = 1;
long long n = MOD - 2;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
ret... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define mod 998244353
#define inv2 499122177
#define M 1000020
using namespace std;
namespace IO{
int Top=0; char SS[20];
void write(int x){
if(!x){putchar('0');return;} if(x<0) x=-x,putchar('-');
while(... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define num 1000000007
//#define num 998244353
#define REP(i,a,n) for(ll i=a;i<n;i++)
#define inarr(i,a,n,A) for(ll i=a;i<n;i++) { cin>>A[i]; }
#define vll vector<long long>
#define pii pair <int,int>
#define pll pair<long long, long long>
#define vpii vector< pair <int,int>... | #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 long double ld;
typedef pair<int,int> P;
int main() {
string s;
cin >> s;
vector<ll> cnt(26, 0);
ll n = s.size();
ll res = n * (n - 1) / 2;
rep(i,n) cnt[s[i... | 1 |
#include <bits/stdc++.h>
#include <limits>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fi(i, n) for( int i=0 ; i<n ; i++ )
#define f(i, a, b) for( int i=a ; i<b ; i++ )
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
int gcd(int a, int b)
{
if (b == ... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
int w;
cin >> w;
for (int i = 0; i < S.length(); i++) {
if (i % w == 0) {
cout << S[i];
}
}
cout << endl;
}
| 0 |
//
// nomura_a.cpp
// learningCplusplus
//
// Created by Tran Duc Chinh on 2020/04/04.
// Copyright © 2020 Tran Duc Chinh. All rights reserved.
//
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
ll mod = 998244353;
ll INF = 10000... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int mod=1000000007;
const int INF=1001001001... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
int L=a+b;
int R=c+d;
if(L>R){
cout << "Left" << endl;
}
if(L<R){
cout << "Right" << endl;
}
if(L==R){
cout << "Balanced" << endl;
}
}
| 1 |
/*
author : nishi5451
created: 11.08.2020 00:36:47
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string a,b,c;
cin >> a >> b >> c;
if(*a.rbegin()==*b.begin() && *b.rbegin()==*c.begin()){
cout << "YES" << endl... | #include <stdio.h>
int main () {
char a[12];
char b[12];
char c[12];
int lenA = 0, lenB = 0;
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
for(int i = 0; a[i] != '\0'; i++) {
lenA++;
}
for(int i = 0; b[i] != '\0'; i++) {
lenB++;
}
if (a[lenA-1] == b [0] && b[lenB-1] == c[0]) {
printf("YES\n");
... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <limits.h>
#include <queue>
using namespace std;
using P=pair<int,int>;
using PP=pair<P,int>;
const int INF=INT_MAX;
/* RMQ：[0,n-1] について、区間ごとの最小値を管理する構造体
update(i,x): i 番目の要素を x に更新。O(log(n))
query(a,b): [a,b) での最小の要素を取得。O(log(n))
*/
template ... | #include <iostream>
char jukuClass(int, int, int);
int main()
{
while (true) {
int n;
std::cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; ++i) {
int pm, pe, pj;
std::cin >> pm >> pe >> pj;
std::cout << jukuClass(pm, pe... | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
#define MAX 1000
int main(){
int n,m,p[MAX];
while(1){
int f=0,m1=0;
std::cin>>n>>m;
if(n==0&&m==0)
break;
for(int i=0;i<n;++i){
std::cin>>p[i];
m1+=p[i];
}
std::sort(p,p+n,std::greater<int>());
int c=n%m;
for(int i=0;i<n-c;++i){... | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[]={0, 0, 1, -1};
int dx[]={1, -... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> wa(N + 5, 0);
for (int i = 0; i < M; i++) {
int p;
string s;
cin >> p >> s;
if (wa[p] >= 0 && s == "WA") wa[p]++;
else if (wa[p] >= 0 && s == "AC") wa[p] = wa[p] * (-1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> wa(n), al(n);
int ac = 0, pe = 0;
while (m--) {
int p;
string s;
cin >> p >> s;
... | 1 |
//
// main.cpp
// Atcoder1
//
// Created by Hamske on 2020/09/17.
// Copyright © 2020 Author. All rights reserved.
//
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
using namespace std;
//#define pb push_back
//#define mp make_pair
//
//#define F first
//#define S s... | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i=s;i<n;++i)
#define drep(i,s,n) for (int i=n;i>=s;--i)
#define all(x) (x).begin(),(x).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define print(x) cout<<(x)<<endl
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b)
{if (a%b == 0) return(b);
else ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,a,c=1,A[100002]={};A[0]=3;
cin>>N;
for(int i=0;i<N;i++){
scanf("%d",&a);
c*=(A[a]-A[a+1]++);
c%=1000000007;
}
cout<<c<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int MOD=1000000007;
int N;cin>>N;
vector<int> A(N);
for(int i=0;i<N;i++)cin>>A[i];
int a=0,b=0,c=0;
long ans=1;
for(int i=0;i<N;i++){
int m=0;
if(A[i]==a)m++;
if(A[i]==b)m++;
if(A[i]==c)m++;
ans=(ans*m)%MOD;
if(A[i]==a)a+... | 1 |
/**
* created: 03.07.2020 16:00:37
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 202;
int a[N];
int main() {
//ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, l;
scanf("%d %d", &n, &l);
int sum = 0;
for (int i = 1; i <= n; i+... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <set>
using ll = long long;
using namespace std;
// xorの掃き出し法をするためのクラス
// matに基底たちが入る
// Tはbitsetは無理(minしないといけないから)
template <typename T>
class BitLinearSpace {
vector<T> bases; // この中身をsortしちゃうと壊れる
public:
... | #include <iostream>
#include <algorithm>
std::vector<size_t> gaps = {1};
template <typename T>
size_t insertion_sort(T a[], size_t n, size_t gap = 1){
size_t count = 0;
for(size_t i = gap; i < n; i++){
T v = a[i];
int j = i - gap;
while(j >= 0 && a[j] > v){
a[j+gap] = a[j];
j -= gap;
... | 0 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
typedef long long ll;
class Dijkstra {
private:
... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <cstdlib>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pai... | #include <bits/stdc++.h>
/// ____ ____ ____ ____ ____
/// ||a |||t |||o |||d |||o ||
/// ||__|||__|||__|||__|||__||
/// |/__\|/__\|/__\|/__\|/__\|
///
using namespace std;
int gcd (int a, int b)
{
if(b == 0)
return a;
return gcd(b, a % b);
}
int n, k;
int main()
{
ios_base::sync_with_s... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, int> lli;
const ll Inf = 1000000000000000000ll;
const int Maxn = 200005;
const int Maxm = 1048576;
struct node {
ll add;
lli mn;
};
int n, D;
int a[2][Maxn];
node st[2][Maxm];
map <int, ll> M[2];
ll res;
void downOn(int s... | #include<bits/stdc++.h>
#define int long long
using namespace std;int n,d,a[220001],b[220001];main(){cin>>n>>d;for(int i=1;i<=n;i++)cin>>a[i],b[i]=a[i];for(int i=2;i<=n;i++)b[i]=min(b[i],b[i-1]+d);for(int i=n-1;i;i--)b[i]=min(b[i],b[i+1]+d);int pos=min_element(a+1,a+1+n)-a,ans=0;for(int i=pos-1;i;i--)ans+=a[i]+b[i+1]+d... | 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
#define N 1100005
struct node
{
int st,ed,cnt;
char c;
}a[N];
int c[N];
int n,z;
char ch[N],cc[N];
queue<int>q;
int main()
{
//freopen("copy.in","r",stdin);
//freopen(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
int main() {
int x , y;
cin >> x >> y;
int t = abs(abs(x)-abs(y));
if((x > 0 && y < 0) || (x < 0 && y > 0)){
t++;
}
else if((x == 0 || y == 0) && y < ... | 0 |
/**************
* Shell Sort
*************/
#include <iostream>
#include <vector> //??£?¨?
#include <algorithm>
using namespace std;
typedef vector<int> TList;
void insertionSort(TList* A, int g, int* cnt ){
for(unsigned int i=g ; i<(A->size()); i++){
int v = (*A)[i];
int j = i-g;
while(j>=0 && (*A)[j]>v){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int l,r;
cin >> l >> r;
const int num = 2019;
int comp = INT_MAX;
long long ans = 0;
for(long long i=l; i<=r; i++){
for(long long j=l; j<i; j++){
ans = ((i%num) * (j%num))%num;
if(ans < comp){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
} else {
ll ans = 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
... | 1 |
#include <cstdio>
using namespace std;
int main()
{
int n;
bool prime[10001];
for (int i=0; i<=10000; i++) prime[i]=true;
prime[0]=false;
prime[1]=false;
for (int i=2; i<=10000; i++) {
if (!prime[i]) continue;
for (int j=i+i;j<=10000; j+=i) prime[j]=false;
}
while (scanf(... | #include <cstdio>
#include <cmath>
#define buf 10000
using namespace std;
int k=0;
int B[buf];
void Answer(int n);
int PrimeNumber(int n);
int main(void){
int i,n;
char str[buf];
for(i=2;i<buf;i++)
PrimeNumber(i);
for( ;fgets(str,sizeof(str),stdin)!=NULL; ){
sscanf(str,"%d",&n);
if(n==0) break;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
void add(ll &a, ll b)
{
a = (a + b) % MOD;
}
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> x(n);
vector<ll> y(m);
for(int i = 0; i < n; i++)
{
cin >> x[i];
}
for(int i = 0; i < m; i++)
{... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,K;
cin>>N>>K;
vector<ll> vec(N);
for(ll i=0;i<N;i++) {
cin>>vec[i];
}
ll ans=0;
for(ll i=1;i<=min(N,K);i++) {
for(ll j=0;j<=i;j++) {
ll sum=0;
priority_queu... | #include <bits/stdc++.h>
#include <queue>
#include <string>
#include <algorithm>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define repr1(... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e5+5;
int n,s,x[N];long long p[N],ans;
int main(){
scanf("%d%d",&n,&s);
for(int i=1;i<=n;++i)scanf("%d%lld",&x[i],&p[i]);
for(int l=1,r=n,las=0;;){
if(s<x[l]){ans+=x[r]-s;break;}
if(x[r]<s){ans+=s-x[l];break;}
if(p[l]>=p[r]){
if(las!=1)l... | //Author - Rahil Malhotra
#include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#def... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
cin >> str;
int q;
cin >> q;
for(int i = 0; i < q; i++){
string op, p = "";
int a, b;
cin >> op;
if(op == "print"){
cin >> a >> b;
cout << str.substr(a, b -... | #include <iostream>
#include <cstdlib>
using namespace std;
void print(int a, int b, char str[]);
void rev(int a, int b, char str[]);
void rep(int a, int b, char str[], char repstr[]);
int main()
{
char str[1000];
int orderlen;
cin >> str;
cin >> orderlen;
cin.clear();
cin.ignore();
for(int i=0; i<orderlen; i+... | 1 |
#include"bits/stdc++.h"
using namespace std;
const int N=5e3+100;
typedef long long LL;
struct node{
LL h,p;
}a[N];
LL dp[N];
bool cmp(node a,node b){
if(a.h+a.p==b.h+b.p)return a.h<b.h;
return a.h+a.p<b.h+b.p;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<=5050;i++)dp[i]=0x3f3f3f3f3f3f3f3f;
for(int i=1;i... | #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;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | 0 |
#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 <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main () {
int n;
cin >> n;
int a[n];
vector<pair<int, int> > vec[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
for (int j = 0; j < a[i]; j++) {
int x, y;
cin >> x >> y;
ve... | 1 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
lli pow1(lli a,lli b){
lli out = 1;
for(int i = 0;i < b;++i) out = out * a;
return out;
}
void solve(){
lli n;
cin >> n;
n = n - 1;
vec... | #include<iostream>
#include<string>
#include<stdio.h>
#include<cctype>
#include<algorithm>
#include<climits>
#include<cmath>
#include<map>
#include<vector>
#define INF INT_MAX
using namespace std;
long long N;
string name;
int main(){
cin >> N;
while (N != 0){
N--;
name += ('a' + (N % 26));
N /= 26;
}
reve... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,x;
cin>>N>>x;
long long A[N];
for(long long i=0;i<N;i++){
cin>>A[i];
}
long long ans=0;
if(A[0]>x){
ans+=A[0]-x;
A[0]=x;
}
long long temp=0;
for(long long i=1;i<N;i++){
if(A[i-1]+A[i]>x){
temp=A[i-1]+A[i]-x;
... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n;
LLI a, b, x, diff, sum = 0 ;
cin >> n >> x;
cin >> a >> b;
if( a + b > x )
{
diff = a + b - x;
if( diff <= b )
b -= diff;
else
b = 0;
sum += diff;
}
a = b;
for(int i = 2; i < n; i++)
{
cin >> b;... | 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 loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(),in.end()
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } retur... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#de... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N; cin >> N;
ll res = to_string(N).size();
ll A,B;
// A <= B としてA,Bを求める． A <= B より Bの桁数の方が大きいことに注意．
for (ll A=1; A<=sqrt(N); A++){
if (N%A != 0) continue;
B = N/A;
// res = min(ll(to_string(B)... | 0 |
//#define _USE_MATH_DEFINES
//#include <cmath>
#include <iostream>
//#include <stdio.h>
//#include <stdlib.h>
//#include <iomanip>
#include <vector>
#include <string>
//#include <algorithm>
//#include <functional>
//#include <time.h>
#include <sstream>
using namespace std;
bool isthe(string str){
//?????????????????... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
string Caesar(string a) {
for (int b = 0; b < a.length(); b++) {
if (a[b] == 'z')a[b] = 'a';
else if (a[b] >= 'a'&&a[b] < 'z')a[b] = a[b] + 1;
}
return a;
}
int main()
{
string a;
while (getline(cin, a)) {
for (int b = 0; b < 26; b++... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n=0;
cin>>n;
if(n==0)break;
int p[45]={0};
p[0]=1;
p[1]=1;
p[2]=2;
for(int i=3;i<=30;i++){
p[i]=p[i-1]+p[i-2]+p[i-3];
}
int ans=p[n]/3650;
if(p[... | #include<iostream>
using namespace std;
int main(){
int n=1;
int a = 0;
int f = 0;
int quest[10000] = { 1 };
double ans[10000];
int checkc = 0;
int i = 4;
double check[3] = { 1, 2, 4 };
do{
cin >> quest[a];
a++;
} while (quest[a-1] != 0);
while (a > f+1){
switch (quest[f]){
case 1:
ans[f] = 1;
... | 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()
{
int n;
cin >> n;
int ans = (n + 110) / 111 * 111;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 8; i++) {
cout << s.at(i);
}
cout << endl;
}
| 0 |
#include<stdio.h>
int main()
{
printf("100 100\n");
int m,n;
scanf("%d%d",&m,&n);
/*
.*.*.*
******
*.*.*.
......
*/
/*for(int i=0;i<50;i++)
{
for(int j=0;j<100;j++)
{
if(m<n&&(m-n)%2==0)
{
m--;
printf(".");
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool a[1000005],b[1000005];
const int mod=1e9+7;
int main()
{
int n,m;
cin>>n>>m;
long long sum=1;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
if(a[x])
{
cout<<"0";
return 0;
}
a[x]=1;
}
for(int i=0;i<m;i++)
{
int y;
cin>>y;
if(b[y])
{
cout<<"... | #include <iostream>
#include <algorithm>
#include <vector>
#include<string>
#include <set>
#include <map>
#include <queue>
#include <limits.h>
#include <bitset>
#include <cmath>
using namespace std;
#define rip(i, n, s) for (int i = (s);i < ( int )( n ); i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | #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 K;
string S;
cin >> K >> S;
if(S.size()<=K) {
cout << S << endl;
return 0;
}
else{
rep(i,K){
cout << S.at(i);
}
cout << "..."<< endl;
return 0;
... | 0 |
#include<iostream>
using namespace std;
int main() {
int d;
while(cin >> d) {
int ans = 0;
int x = d;
while (x <= 600 - d) {
ans += x * x * d;
x += d;
}
cout << ans << endl;
}
}
| #include <iostream>
#include <cmath>
using namespace std;
int main(){
int d, ans, n;
while(cin >> d){
ans = pow(d, 3);
n = 600 / d - 1;
ans *= n*(n+1)*(2*n+1) / 6;
cout << ans << endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define fi first
#define se second
#define pb push_back
#define ins insert
#define er erase
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int oo = 1e18 + 7, mod = 1e9 + 7, mul = (1 << 30);
int n, pw[... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b... | 1 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000 //1e4
#define base10_5 100000 //1e5
#define base10_6 1000000 //1e6
#... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 1 |
// template version 1.15
using namespace std;
#include <bits/stdc++.h>
// varibable settings
#define int long long
const int INF=1e18;
// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(_... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
typedef long long ll;
using namespace std;
bool is_1pair(int* cards){
sort(cards,cards+5);
map<int,int> freq;... | 0 |
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void dfs(vector<vector<int>>& G, int u, vector<int>& dist) {
for (auto v : G[u]) {
if (dist[v] != -1) continue;
dist[v] = dist[u] + 1;
dfs(G, v, dist);
}
}
int main(void) {
i... | #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... | 1 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define SA... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | 1 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | //
// Created by tac on 2016/10/16.
//
#include <algorithm>
#include <cstdlib>
#include <string>
#include <iostream>
namespace {
void print(const std::string &str,
std::string::size_type a,
std::string::size_type b) {
std::cout << str.substr(a, b - a + 1) << std::endl;
return;
}
const ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
#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()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(... | 1 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
while(cin>>a>>b>>c){
if(a==0&&b==0&&c==0) break;
int ans[a+b+c+1];
for(int i=1;i<=a+b+c;i++) ans[i] = 2;
int n;
cin >> n;
int ag[n],bg[n],cg[n],r[n];
for(int i=0;i<n;i++){
cin >> ag[i] >> bg[i] >> cg[i] >> r[i];
if(r[i]==1) ans[a... | #include<iostream>
#include<cstdio>
#include<map>
#include<vector>
#include<queue>
using namespace std;
#define MP make_pair
#define PB push_back
int main(int argc,char* argv[]){
multimap<int,vector<int> > tab;
vector<int> vec;
int a,b,c,x,i,j,count,n;
int flag[400];
while(cin>>a>>b>>c){
if(a==0 && b==... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 1 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 1e9 + 7;//786433;//998244353;
const double Pi = acos(-1);
const int... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3... | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typed... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)((x).size())
#define jonathan ios_base::sync_with_stdio(0)
#define livingston cin.tie(0)
using namespace std; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N,X;
cin >> N >> X;
vector<long long> A(N);
for(int i = 0; i < N;i++)cin >> A[i];
long long ans = 0;
long long b = 0;
for(int i =1; i < N;i++){
b = max(0LL,A[i-1]+A[i]-X);
ans += b;
A[i]= max(0LL,A[i]-b);... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
int main(){
ll N,A,B,ans=0;
cin>>N>>A>>B;
ll x[N];
for(ll i=0;i<N;i++) cin>>x[i];
for(ll i=0;i<N-1;i++){
if((x[i+1]-x[i])*A>B) ans+=B;
else ans+=(x... | 0 |
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | #include<stdio.h>
#define INF (1<<30)-1
int main(){
int n;
scanf("%d",&n);
int s[n];
int i,j,c=INF;
for(i=0;i<n;i++){
scanf("%d",&s[i]);
if(s[i]<c) c = s[i];
}
for(i=1;i<=c;i++){
int ok = 0;
for(j=0;j<n;j++) if(s[j]%i!=0) ok = 1;
if(ok == 0) printf("%d\n",i);
}
} | 0 |
#include <iostream>
using namespace std;
static int num =0;
void swap(int &a,int &b){
int tmp;
tmp =a;
a = b;
b = tmp;
num++;
}
void bubbleSort(int a[],int n){
int flag = 1;
while(flag){
flag =0;
for(int i=n-1;i>0;i--){
if(a[i]<a[i-1]){
swap(a[i]... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int elem[n];
int cnt=0;
for(int i=0;i<n;i++){
cin>>elem[i];
}
for(int i=0;i<n-1;++i){
for(int j=0;j<n-1-i;++j){
if(elem[j]>elem[j+1]){
++cnt;
elem[j]^=elem[j+1];
elem[j+1]^=elem[j];
elem[j]^=elem[j+1];
}
}... | 1 |
#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<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
const int INF=1001001001;
int main() {
string s;
cin>>s;
int n=s.size();
int stack=0,e=0;
for(int i=0;i<n;i++){
if(s[i]=='S'){stack++;}
else if(stack>0){stack--;e++;}
}
cout<<n-2*e<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i... | 1 |
#include<bits/stdc++.h>
using namespace std;
int n;
class Dice{
private:
int right,left,front,back,bottom,now,flag=1;
int role(int num[6],int num2[6],string str){
for(int i=0;i<str.size();i++){
if(num[0]==num2[0]&&num[1]==num2[1]&&num[2]==num2[2]&&num[3]==num2[3]&&num[4]==num2[4]&&num[5]==num2[5]){
cout<... | // 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 <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
const int mod = 100000000... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
signed main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for( int i = 0; i < N; i++ ) cin >> V.at(i);
int ans = 0;
for( in... | 0 |
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main(){
int H,W,i,j,a;scanf("%d%d",&H,&W);
bool odd[H][W];
for(i=0;i<H;i++){
for(j=0;j<W;j++){
scanf("%d",&a);
odd[i][j] = a&1;
}
}
bool coin = false;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
struct memo {
int x;
int y;
int xx;
int yy;
};
int main() {
int H, W; cin >> H >> W;
vector<vector<int>> a(H, vector<int>(W));... | 1 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 0 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
bool check(ll x, ll pos) { return (x & (1LL << pos)); }
vector <ll> v;
ll gelim(ll X)
{
ll ind = 0;
for(ll i = 60; i >= 0; i--)
{
if((X >> i & 1) == 0)
{
ll x = ind;
while(x < v.size() && !check(v... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
// http://www.prefield.com/algorithm/misc/dice.html
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
dice(int top,int front,int right,int left,int back,int bottom) {
id[TOP] = top; id[FRONT] = front; id[RIGHT] = right... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = -1;
for(int i = 0;i < s.size();i++){
if(s.at(i)=='A'){
n = i;
break;
}
}
int m = -1;
for(int j = 0;j < s.size();j++){
if(s.at(j)=='C'){
m = j;
if(n+1==m){
break;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s;
cin >> s;
int pos = s.find("AC");
if (pos != string:... | 1 |
#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... | #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>;
const int inf{int(1e9)};
int main(void){
ll L, R;
cin >> L >> R;
/*
ll sa = R - L;
L %= 2019;
R %= 2019;
if (L == 0 || L == 2018) c... | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma warning(disable : 4996)
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#incl... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#define vllp vector<pair<pll,... | 1 |
#include<cstdio>
#include<vector>
#include<algorithm>
#define MAXN 200006
using namespace std;
int u,v,deep[MAXN],n,m,sum[MAXN],vis[MAXN],ok;
long long a,q,p,ans;
vector<int> road[MAXN];
void DFS(int x,int father)
{
vis[x]=1;
sum[x]=1;
deep[x]=deep[father]+1;
for(int i=0;i<(int)road[x].size();i++)
{
int nex=road... | #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 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
//const ll... | #include <iostream>
#include <algorithm>
#include <array>
#include <set>
#include <vector>
#include <climits>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> graph[n];
array<int, 3> points[n];
int cost[n];
for (int i = 0; cin >> points[i][0] >> points[i][1]; i++) {
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.