code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(){
ll S;
cin>>S;
ll digit=0;
ll d=S;
while(d!=0){
digit++;
d/=10;
}
vector<ll> s(digit);
rep(i,digit){
s[i]=S%10;
S/=10;
}
reverse(s.begin(),s.end());
ll ans;
ll... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
template <class RandomIt>
RandomIt partition_(RandomIt first, RandomIt last) {
using T=typename RandomIt::value_type;
T x=last[-1];
RandomIt it=first-1;
for (RandomIt it2=first; it2<last-1; ++it2)
... | 0 |
#include <iostream>
#include<string>
using namespace std;
class Dice{
public:
int num[6],t;//t=top
/*
dice.num[0] = ???
dice.num[1] = ???
dice.num[2] = ???
dice.num[3] = ???
dice.num[4] = ???
dice.num[5] = ???*/
void North(){
t = num[0];
num[0] = num[1];//??????1?????¨???
num[1] = num[5];//?????... | #include <iostream>
#include <vector>
using namespace std;
class Dice
{
public:
vector<int> diceNum;
Dice(vector<int>& inputs);
void toW();
void toS();
void ParallelRotation();
};
Dice::Dice(vector<int>& inputs)
{
diceNum=inputs;
}
void Dice::toW()
{
swap(diceNum[0],diceNum[3]);
swap(dic... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <cstring>
#include <sstream>
#include <iomanip>//小数精度 cout << fixed << setprecision(5) << tmp << endl;
using namespace std;
#define ll long long
#define vvi vector< v... | #include <bits/stdc++.h>
using namespace std;using ll=int_fast64_t;using ld=long double;using pll=pair<ll,ll>;using pld=pair<ld,ld>;
const ll INF=1LL<<60;void solve();int main(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(10);solve();}
#define foreach(i,a) for(auto &i:a)
#define SELECTOR(_1,_2,_3,_... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, x, res = 0;
cin >> N >> x;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a+N);
for (int j = 0; j < N; j++) {
if (j == N -1) {
if (x == a[j]) {
res++;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
cout << (n+k-1)/k - n/k << endl;
} |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h... | 1 |
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int> st;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
auto itr = st.lower_bound(a);
if (itr == st.begin()) {
st.insert(a);
} else {
itr--;
st.erase(itr);
st.insert(a);
}
}
int ans = st.size()... | // Made by Luis Miguel Baez
// es.luismiguelbaez@gmail.com
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull... | 1 |
#include<iostream>
using namespace std;
int cnt;
void insertionSort(int* a, int n, int g){
int i, j, v;
for(i = g; i < n; i++){
v = a[i];
j = i - g;
while((j >= 0) && (a[j] > v)){
a[j + g] = a[j];
j = j - g;
cnt++;
};
a[j + g] = v;
}
}
... | #include<bits/stdc++.h>
using namespace std;
int main() {
using LL = long long;
int N;
cin >> N;
vector<LL> A(N);
for(auto& i: A) cin >> i;
const LL NG = -1e18;
vector<map<int, LL>> memo(N);
function<LL(int,int)> dfs = [&](int i, int n) {
if(n == 0) return 0ll;
if(N <= i) return NG;
if(N ... | 0 |
#include <stdio.h>
int main()
{
int n,m,b[1000],a[1000];
int sum[1000]={0};
scanf("%d %d",&n,&m);
for(int i=0;i<=n-1;i++){
scanf("%d",&a[i]);
}
for(int j=0;j<=m-1;j++){
scanf("%d",&b[j]);
}
for(int j=0;j<=m-1;j++){
for(int i=0;i<=n-1;i++){
if(b[j]>=a[i]) {sum[i]=sum[i]+1;b... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define ZERO(a) memset(a,0,sizeof(a))
#define pb push_back
int rank[1020];
int main() {
int n, m;
ZERO(rank);
cin >> n >> m;
vector<int> v;
rep(i,n) {
int cost; scanf... | 1 |
#include<bits/stdc++.h>
#define REP(i,n) for(long long i=0;i<n;++i)
#define FOR(i,a,b) for(long long i=a;i<b;++i)
using namespace std;
using point = pair< int,int >;
using ll = long long;
int main(){
int n;
int c;
int graph[11];
while (~scanf("%d", &n)) {
if (!n) break;
fill(graph, grap... | #include <bits/stdc++.h>
using namespace std;
const int M = 1e6;
set<int> adj[M];
int nd, indeg[M];
bool vis[M];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
map<pair<int, int>, int > mp;
int mat[n][n - 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1... | 0 |
#include<bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
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... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
int main(){
fast;
string s;
cin>>s;
int fre[26]={0};
for(int i=0;i<s.length();i++)
fre[s[i]-97]++;
for(int i=0;i<26;i++)... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pi> vpi;
typedef vector<vi> vii;
typedef map<int, int> mp;
typedef multiset<int> mset;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef ... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77;
int A[N];
int F(int a,int b){
string x = to_string(a);
string y = to_string(b);
return max(x.length(),y.length());
}
int32_t... | 1 |
#include<iostream>
using namespace std;
int InsertionSort(int* a, int n, int g)
{
int tmp, j, count = 0;
for (int i = g; i < n; i++)
{
tmp = a[i];
for (j = i - g; j >= 0 && a[j] > tmp; j -= g)
{
a[j + g] = a[j];
count++;
}
a[j + g] = tmp;
}
return count;
}
int ShellSort(int* a, int n)
{
int m,... | #define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define al... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
int N;
int dubling[22][100005];
int X[100005];
int L;
int main()
{
cin >> N;
for ( int i = 0; i < N; i++ ) cin >> X[i];
cin >> L;
for ( int i = 0; i < N; i++ ) {
dubling[0][i] = upper_bound(X, X + N, X[i] + L) - X - ... | 0 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main(){
ll N; string A, B, C; cin >> N >>... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long
#define endl "\n"
#define all(x) (x).begin(),(x).end()
const int MOD = 1e9+7;
const int mxN = 2e5+3;
void solve... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t A, B, K;
cin >> A >> B >> K;
for(int i=0; i<K; i++){
if(i%2==0){
A=2*(A/2);
B+=A/2;
A/=2;
}
else{
B=2*(B/2);
A+=B/2;
B/=2;
}
}
cout << A << " " << B << endl;
} | #include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main()
{
double x1,x2,y1,y2,p;
cin>>x1>>y1>>x2>>y2;
x1=x2-x1;
y1=y2-y1;
x1=sqrt(x1*x1+y1*y1);
cout<<setprecision(10)<<x1<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
int n,m,flag;
char s[1010][1010],ans[1010][1010];
void solve7() {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main()
{
//ios::sync_with_stdio(false);cin.tie(nullptr);ios_base::sync_with_stdio(false);
int n, m, c = 0, x;
map<int, ll> mp;
mp[0]++;
cin >> n >> m;
while (n--)
cin >> x,
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL =... | 1 |
#include <cstdio>
#include <cstring>
#define maxn 200010
using namespace std;
const long long inf = 0x3f3f3f3f3f3f3f3f;
inline long long min(long long a, long long b) {return a < b ? a : b;}
inline long long abs(long long a) {return a > 0 ? a : -a;}
int n, k, x, y;
int q, last;
long long V[maxn << 2][3], cov[maxn << 2]... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int dp[85][85][40000]={};
int grid[85][85];
int main(){
int h,w;
cin>>h>>w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>grid[i][j];
}
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
... | 0 |
/**
* author: souzai32
* created: 02.08.2020 15:41:51
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long int x,y;
cin >> x >> y;
long long int count=0;
while(1){
if(x==y) break;
else if(x<y){
... | #include <cstdio>
const long long mod=998244353ll;
const int MSIZE=4000000;
void ad(long long &a,long long b){a+=b;a%=mod;}
void mn(long long &a,long long b){a+=mod-b;a%=mod;}
void ml(long long &a,long long b){a*=b;a%=mod;}
long long sq(long long a){return a*a%mod;}
long long pw(long long a,long long n)
{
return ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
ll n,S;
ll a[N],p[N],tag[N];
ll ans;
int main(){
cin>>n>>S;
for (int i=1;i<=n;i++)
scanf("%lld%lld",&a[i],&p[i]);
int l=1,r=n;
while (a[l]<=S&&S<=a[r]){
if (p[l]>=p[r]){
if (!tag[l])ans+=a[r]-a[l],tag[l]=1;
p[l]+=p[r];
... | //
// Created by Mahmoud Rashad on 11/27/19.
//
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<pair<ii, ii>> vii;
const int MAXN = 1003;
int vis[MAXN];
int mark[MAXN], checkID;
vector<int> adjList[MAXN];
vector<int> inProgress;
bool ret;
bool check... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x%y) : x;
}
int main() {
int n, m, x, y; cin >> n >> m >> x >> y;
int x_max = x;
int y_min = y... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> xs(n + 1), ys(m + 1);
cin >> xs[0] >> ys[0];
for (int i = 1; i <= n; ++i)
cin >> xs[i];
for (int i = 1; i <= m; ++i)
cin >> ys[i];
if (*max_element(xs.begin(), xs.end... | 1 |
#include<iostream>
int main(){
int x;
std::cin >> x;
std::cout << x*x*x << "\n";
return 0;
} | #include<iostream>
using namespace std;
int64_t cubic(const int64_t x) {
return x*x*x;
}
void print(const int64_t x) {
cout << x << endl;
}
int main() {
int64_t x;
cin >> x;
//print x^3
print(cubic(x));
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> v(n);
for(int i = 0;i<n;i++)
{
cin>>v[i];
}
int minsofar = INT_MAX;
int count = 0;
for(int i = 0;i<n;i++)
{
minsofar = min(minsofar,v[i]);
if(v[i] <= minsofar)
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,p,q,r;
cin >> a >> b >> c;
p = a+b;
q = a+c;
r = b+c;
if(p>=q){
if(q >= r){
cout << r;
}else{
cout << q;
}
}else{
if(p >= r){
cout << r;
}else{
... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v(3);
for(int &e : v) cin >> e;
sort(v.begin(), v.end());
cout << v[0] + v[1];
}
| 1 |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define rep(i, s, t) for(i = s; i <= t; ++i)
#define dep(i, s, t) for(i = s; i >= t; --i)
using namespace std;
const double Pi = acos(-1.);
const int N = 110;
int n;
struct D{double x, y, f;} d[N], e[N];
double ans[N];
bool cmp(D a, D b) {return ... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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 rep(i, n) for(int i=0;i<n;++i)
... | 0 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#ifdef LOCAL
#include "/media/brayand/7801-B00D/debugger.h"
#else
template<typename... Args>
void db(Args... args){}
#endif
const int MOD = 1e9+7;
const int BAS = 331;
string A[30];
string rA[30];
string B[30];
const int MAXN = 2e5+100;
int mp... | #define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algori... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
double r, g,re;
cin >> r >> g;
re = 2 * g - r;
cout<<re;
} | #include <iostream>
#include<cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
double a, b;
cin >> ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
struct Value {
int depth, cost;
Value() { }
Value(int depth, int cost) {
this->depth = depth;
this->cost = cost;
}
};
int n, k;
int a[100000];
vector<int> et[100000];
Value dfs(int p, int ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
template<class T> T gcd(const T& a,const T& b){ return b==0?a:gcd(b,a%b); }
int main(){
int n,k; scanf("%d%d",&n,&k);
vector<int> a(n);
rep(i,n) scanf("%d",&a[i]);
int g=a[0];
rep(i,n-1) g=gcd(g,a[i+1]);
puts(k%g==0&&k<=*m... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
cin >> str;
int number_of_instruction;
cin >> number_of_instruction;
for (int i = 0; i < number_of_instruction; ++i)
{
string instruction;
int param1, param2;
string temp_str = "";
string replace_str = "";
cin >> ins... | #include <bits/stdc++.h>
int main() {
char str[1024];
char ope[256];
char obj[1024];
int q;
int a, b;
char temp;
scanf("%s", str);
scanf("%d", &q);
for(int i = 0; i < q; ++i) {
scanf("%s", ope);
if( strcmp("replace", ope) == 0 ) {
scanf("%d %d", &a, &b);
scanf("%s", obj);
... | 1 |
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
main(){
int a,b,c,n,x,y,z,w,i;
for(;scanf("%d%d%d%d",&a,&b,&c,&n)>3;){
vector<int>A(a,2);
vector<int>B(b,2);
vector<int>C(c,2);
vector<tuple<int,int,int> >v;
for(i=0;i<n;i++){
scanf("%d%d%d%d",&x,&y,&z,&w);
if(w)A[x-1]=B[y-1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
ll l,r;cin>>l>>r;
vector<int> vec;
int ans=2020;
for(int i=l;i<=min(r,l+2040)-1;i++){
for(int j=i+1;j<=min(r,l+2040);j++){
ans=min(ans,((i%2019)*(j%2019... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
using namespace std;
set<int> guest;
int n, m;
vector<int> people[501];
int main()
{
while((cin >> n >> m) && n && m)
{
int a, b;
int t;
for(int i=0;i<m;i++)
{
cin >> a >> b;
... | #include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
int n,m;
int g[500][500];
int main(){
while(scanf("%d%d",&n,&m),n){
for(int i=0;i<n;i++)
for(int j=0;j<n;j++) g[i][j]=100000;
for(int i=0;i<m;i++){
int a,b;
scanf("%d%d",&a,&b);
g[a... | 1 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
class Dice
{
public:
int label[6], tmp;
void in()
{
rep(i, 6) scanf("%d", &label[i]);
}
void rollS()
{
tmp = label[0];
... | #include<stdio.h>
#include<string.h>
typedef struct {
char direction[100];
int num1,num2,num3,num4,num5,num6;
}DICE_t;
int main(){
int n;
scanf("%d",&n);
DICE_t a[n];
for(int x=0;x<n;x++){
scanf("%d %d %d %d %d %d",&a[x].num1,&a[x].num2,&a[x].num3,&a[x].num4,&a[x].num5,&a[x].num6);
}
int x,y;
for(x=0;x<(n... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int a,b,c;
cin >> a >> b >> c;
rep(i,10){
int cnt = 0;
if(i==a)cnt++;
if(i==b)cnt++;
if(i==c)cnt++;
if(cnt==2){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
retu... | #include<stdio.h>
int main()
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a==b&&a!=c&&b!=c){
printf("Yes");
}
else if(a==c&&a!=b&&c!=b)
printf("Yes");
else if(b==c&&b!=a&&c!=a)
printf("Yes");
else if(a==b&&a==c&&b==c)
printf("No");
else if(a!=b&&a!=c&&b!=c)
printf("No");
return 0;
} | 1 |
#include <bits/stdc++.h>
int main() {
long long k;
std::cin >> k;
std::cout << 50 << std::endl;
const auto p = k / 50 + 50, q = p - 1 - (k % 50);
for (int i = 0; i < k % 50; i++) {
std::cout << p << " ";
}
for (int i = k % 50; i < 50; i++) {
std::cout << q << " ";
}
... | #include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int n;
int a;
int ans=1000000000;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
int k=0;
while(a%2==0){
a=a/2;
k++;
}
ans=min(ans,k);
}
cout<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){//aとbの最大公約数を返す//計算量は0(log(max(a,b))
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){//aとbの最小公倍数を返す//計算量は0(log(max(a... | 0 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
retur... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a, b, c, N;
int flag[3][1000], judge[1000], info[301];
while(cin >> a >> b >> c , a+b+c){
fill_n(info,301,2);
cin >> N;
for(int i = 0 ; i < N ; i++ ){
for(int j = 0 ; j < 3 ; j++) cin >> flag[j][i];
cin >> judge[... | #include<iostream>
using namespace std;
int main(){
int a[1111], b[1111], c[1111], d[1111], p[333], n;
while(cin >> a[0] >> b[0] >> c[0], *a+=*b+*c){
for(int i=332;i;) p[i--] = 2;
cin >> n;
for(int i=0;i++<n;) cin >> a[i] >> b[i] >> c[i] >> d[i];
for(int i=0;i++<n;){
for(int j=0... | 1 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
usi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,Q,K;
cin>>N;
vector<vector<pair<int,int>>> A(N);
for(int i=1;i<N;i++){
int a,b,c;
cin>>a>>b>>c;
A[a-1].push_back({b-1,c});
A[b-1].push_back({a-1,c});
}
cin>>Q>>K;
vector<int> B(N,-1);
queue<int> q;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
//constructor: LCA(graph);
template<class T>
class LCA_weight {
private:
int n;
int D = 30; //hight
vector<int> depth; //depth from root
vector<vector<pair<int,T>>> hen; //tree
vector<vecto... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
string S; cin >>S;
ll ans = INF;
rep(i,S.size()-2){
ll ints = stoi(S.substr(i,3));
ans = min(ans,abs(753 - int... | #include <bits/stdc++.h>
using namespace std;
int intinput() {
int x;
cin >> x;
return x;
}
vector<int> forintinput(int n) {
vector<int> x(100000);
for(int i = 0;i < n;i++) cin >> x[i];
return x;
}
int main(){
vector<int> s(10);
string ss;
cin >> ss;
for(int i = 0;i < ss.length();i++){
s[i] = ss.at(i) - '0'... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); ... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(3);
int k, y;
for(int i=0;i<3;i++) cin >> x.at(i);
cin >> k;
sort(x.begin(), x.end());
y = x.at(2);
for(int i=0;i<k;i++) y = 2*y;
cout << x.at(0) + x.at(1) + y << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
typedef pair<double, double> P;
const ll INF = 10e17;
#defin... | #include<stdio.h>
#include<string.h>
int main(){
int a,b,total=0;
scanf("%d %d",&a,&b);
char s[a+b+2];
scanf("%s", &s);
for(int i=0; i<a+b+1 ;i++){
if(i!=a){
if(s[i]>=48 && s[i]<=57){
total++;
}
}
else {
if(s[i] == '-'){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int cnt;
int sum;
string ans="War";
vector<int> a(n);
rep(i,n){
cin>>a[i];
}
vector<int> b(m);
rep(i,m){
cin>>b[i];
}
for(int i=x+1;i<y;i++){
cnt=0;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
// blue input
int n;
cin >> n;
vector<string> blue(n);
for(int i = 0; i < n; i++) {
cin >> blue.at(i);
}
// red input
int m;
cin >> m;
vector<string> red(m);
for(int i = 0; i < m; i++) {
cin >> red.a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dfs(ll prev, ll now, vector<vector<ll>>& adj, vector<ll>& dp, set<ll>& st) {
if (dp[now] > 0) return dp[now];
if (st.find(now) != st.end()) return -1;
st.insert(now);
ll ret = 0;
for (auto i : adj[now]) {
if (i == prev) continue;
ll x = df... | 0 |
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
string s;
void input() {
cin >> s;
}
void solve() {
string ans = "No";
if (s.find('7') != string::npos)
ans = "Yes";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if(N%10 == 7||N%100 == 70||N%100 == 71||N%100 == 72||N%100 == 73||N%100 == 74||N%100 == 75||N%100 == 76||N%100 == 78||N%100 == 79||N/100 == 7){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b)... | #include <bits/stdc++.h>
using namespace std;
int main (){
int k,x;
cin >> k >> x;
for(int i=1;i<=k*2-1;i++){
cout << x-k+i << " ";
}
cout << endl;
} | 1 |
/**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
const int64_t dxs[] = {-1, 1, 0, 0};
const int64_t dys[] = {0, 0, -1, 1};
int main() {
... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int n, a[3], cnt, ed;
int f[50][1 << 17], ans = 1;
inline int add(const int &x, const int &y) {
return x + y < mod ? x + y : x + y - mod;
}
inline int sub(const int &x, const int &y) {
return x - y < 0 ? x - y + mod : x - y;... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int n=s.size();
for(int i=0;i<(1<<(n-1));i++){
int ans=s[0]-'0';
vector<char> enzan;
for(int j=0;j<n-1;j++){
if(i&(1<<j)){
ans-=s[j+1]-'0';
enzan.push_back('-');
}else{
ans+=s[j+1]-'0';
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, prime[10001], p[10001];
fill(prime, prime+10001, 1);
fill(p, p+10001, 0);
prime[0] = 0;
prime[1] = 0;
for(int i=2; i<10001; i++){
if(prime[i] == 1){
if(prime[i-2] == 1) p[i] = 1;
for(int j=2; i*j<10001; j++){
prime[i*j... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
ll y;
cin >> n >> y;
int a,b,c;
a=-1;
b=-1;
c=-1;
int cnt=0;
for(int i=0;i<=n;i++){
for(int j=0;j<=n-i;j++){
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int data[100],cnt=0,n;
cin >> n;
for(int i=0;i<n;i++) cin >> data[i];
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(data[j]<data[j-1]){
swap(data[j],data[j-1]);
cnt++;
}
}
}
for(int i=0;i<n;i++){
cout ... | 0 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mu... | #include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<cstring>
#include<fstream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const int MAXN=1e5+5;
int tot,head[MAXN];
LL dist[MAXN];
bool vis[MAXN... | 1 |
#include<iostream>
#include<sstream>
using namespace std;
int s2d(string buf){
istringstream iss(buf);
double x;iss >> x;
return x;
}
int main(){
string buf;
while(cin>>buf){
int i;
for(i=0;i<buf.size();i++) if(buf[i]==',') buf[i]=' ';
stringstream ss(buf);
double d[12];
for(i=0;i<12;i++){... | #include<stdio.h>
#include<string.h>
int main()
{
int m,n, N;
int dice[101][101];
scanf("%d", &N);
for (n = 0; n < N; n++)
{
for (m = 0; m < 6; m++)
{
scanf("%d", &dice[n][m]);
}
}
int i = 4, tmp, j = 4;
for (n = 0; n < N - 1; n++)
{
for (m = n + 1; m < N; m++)
{
while (i--)
{
if (dice[... | 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;
}
typedef long long int ll;
#defi... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,Q;
string S;
cin >> N;
cin >> S;
cin >> Q;
vector<int> k(Q);
for (int i = 0; i < Q ; i++){
cin >> k.at(i);
}
for (int i = 0; i < Q ; i++){
long long dnum = 0,mnum = 0,dmnum = 0,ans = 0;
for (int j = 0 ; j < N ; j++){
... | 0 |
#include <bits/stdc++.h>
#include<math.h>
#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> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n, l ;
cin >> n >> l ;
vector<int> vec (n) ;
... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
#define FOR(i,k,n) for(int i = (k);i < (n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) begin(x),end(x)
using namespace std;
using namespa... | 0 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
void read(int &x) {
char ch; bool ok;
for(ok=0,ch=getchar(); !isdigit(ch); ch=getchar()) if(ch=='-') ok=1;
for(x=0; isdigit(ch); x=x*10+ch-'0',ch=getchar()); if(ok) x=-x;
}
#define rg register
const int maxn=1e5+10;bool vi... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
int a[100000];
vector <int> children[100000];
int d[100000];
bool done[100000];
void... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main(){
int N,T; cin>>N>>T;
vector<pair<int,int>> AB;... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int K, T;
cin >> K >> T;
priority_queue<pair<int, int>> q;
int ai;
for (int i = 0; i < T; i++)
{
cin >> ai;
q.push(make_pair(ai, i + 1));
}
int res = 0;
int prev = 0;
for (int i = 0; i < K; i++)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N ;i++){
cin >> A.at(i);
}
sort(A.begin(),A.end());
int x=0;
for(int i=0; i<N-1 ; i++){
if(A.at(i)==A.at(i+1)){
cout << "NO" << endl;
x=1;
break;
}
}
... | #include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
using namespace std;
usi... | 1 |
#include<stdio.h>
int main() {
char ktae1[106];
char ktae2[108];
scanf("%s %s", &ktae1, &ktae2);
printf("%s%s", ktae2, ktae1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long N;
cin >> N;
N--;
string name = "";
char digit = 'a';
while (N >= 0) {
if (N % 26 != 0) {
digit = 'a' + N % 26;
} else {
digit = 'a';
}
name = digit + name;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int k, t;
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<cstdlib>
#define LL long long
#define LD long double
using namespace std;
const int NN=200 +117;
const int MM=1 +117;
int read(){
int fl=1,x;char c;
for(c=getchar();(c<'0'||c>'9')&&c!='-... | 0 |
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define F first
#define S second
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
using namespace std;
ll mod=1e9 +7;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=0){
if(exponent&1) an... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
int e;
while(cin >> e, e){
int x, y, z;
int ans = INT_MAX;
for(z = 0; z*z*z <= e; z++){
y = sqrt(e-pow(z, 3));
x = e - pow(z, 3) - pow(y,2);
ans = min(ans, x+y+z);
}
cout... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T... | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(void){
int n,m;
while(cin>>n>>m,n||m){
vector<set<int> > friends(n+1);
for(int i=0,a,b;i<m;++i){
cin>>a>>b;
friends[a].insert(b);friends[b].insert(a);
}
set<int> myfriends;
for(set<int>::iterator it=friends[1].begin();i... | #include<iostream>
using namespace std;
int main(){
int n,p;
while(1){
cin>>n>>p;
if(n+p==0) break;
int a[50]={},s=p;
int i=0,vic,f=0;
while(1){
if(i==n) i=0;
if(f==1) break;
if(p<=0){
if(a[i]==s){
f=1;
vic=i;
}
if(p==0){
p+=a[i];
a[i]=0;
}
}
else{
a[i]+... | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <i... | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<long long> A(N);
for (int i = 0; i < N; i++) std::cin >> A[i];
long long xor_A = 0;
for (int i = 0; i < N; i++) xor_A ^= A[i];
std::vector<long long> v(N);
for (int i = 0; i < N; i++) v[i] = A[i] & ~... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#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 rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin()... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
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; retu... | 1 |
#include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>
#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define INF 1844674407370955161
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (... | //thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int Mod = 1000000007;
int n, D;
string s;
long long dp[MaxN], tmp[MaxN];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
cin >> D;
n = s.size();
for (int i = s[0] ... | 0 |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<string>
using namespace std;
int main(){
long long int k,x,a;
cin>>k>>x;
for(int i=1;i<=(2*k-1);i++)
{a=x-k+i;
cout<<a<<" ";
}
cout<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
ty... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct rev_vector {
const int magic = 123456;
vector<int> pk;
int l, r;
rev_vector(){
pk.resize(3 * magic);
l = magic;
r = l;
}
void shift_right(){
l--;
pk[l] = 0;
}
int& operator [](int pos){
while(pos + l <= r) pk[r++] = 0;
return pk[pos + l];
}
vo... | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(... | 0 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,b=0;
cin>>n;
a=n;
while(a>0){
b+=a%10;
a/=10;
}
if(n%b==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return(0);
... | 0 |
#include <bits/stdc++.h>
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define sz(x) ((int)(x)... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
class BinaryIndexedTree {
private:
int n;
vector<int64> xs;
public:
BinaryIndexedTree(int n) : n(n), xs(n) {}
// Adds x to the i-th element.
void Add(int i, int64 x) {
int cur = i;
while (cur < n) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define int long long
typedef long long ll;
int color[200000];
int n,m;
vector<vector<int>> v(200000);
/*
bool dfs(int nn, int pre, int c){
for(int x:v[nn]){
if(x==pre) continue;
if(color[x]==-1) colo... | #include <bits/stdc++.h>
using namespace std;
class UnionFind {
public:
std::vector<int> parent;
UnionFind(int n) : parent(n, -1) {}
int root(int x) {
if (parent[x] < 0) return x;
return parent[x] = root(parent[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
int size(int x) { ... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <climits>
#include <utility>
typedef long long ll;
using namespace std;
const ll MOD = 998244353LL;
const ll MAX = 2000010LL;
ll fac[MAX], finv[MA... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
const long long MOD = 998244353;
const int FACT_MAX = 1000000;
long long fact[FACT_MAX];
long... | 1 |
#include <bits/stdc++.h>
using namespace std;
#ifdef Adrian
#include "debug.h"
#else
#define debug(...) 9999
#endif
typedef long long ll;
typedef long double ld;
typedef complex<ld> point;
#define F first
#define S second
#define ii pair<ll,ll>
template <typename G>
struct triple{G F, S, T;};
#define iii triple<int... | #include<bits/stdc++.h>
using namespace std;
int H,W,Ans,top,stop[2010][2010];
bool g[2010][2010];
struct Point{
int x,y;
Point() {}
Point(int x,int y):x(x),y(y) {}
}P[2010];
int main()
{
#ifdef h10
freopen("F.in","r",stdin);
freopen("F.out","w",stdout);
#endif
int i,j;
char c;
scanf("%d%d",&H,&W);
for (i=1... | 0 |
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitse... | #include<bits/stdc++.h>
using namespace std;
const int maxn=100010;
int n,t[2],a[5][maxn],to[maxn];
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
cin>>n;
for(int i=1; i<=3; i++)
for(int j=1; j<=n; j++)
cin>>a[i][j];
for(int i=1; i<=n; i++)
{
to[i]=a[2][i]/3+1;
... | 1 |
#pragma GCC optimze("Ofast")
#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 ll long long
#define pp pair<ll,ll>
#define ppp pair<ll,pp >
#define t... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int mod=998244353;
#define N 321
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,a[N],dp[... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end... | #include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int n;
long long ans,a,b,x[100009];
int main(){
scanf("%d%lld%lld",&n,&a,&b);
for(int i=1;i<=n;i++)scanf("%lld",&x[i]);
for(int i=2;i<=n;i++)ans+=min(a*(x[i]-x[i-1]),b);
printf("%lld\n",ans);
return 0;
}... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <climits>
using namespace std;
#define rep(i,l,r) for(int i=l;i<r;i++)
#define repb(i,r,l) for(int i=r;i>l;i--)
#define ll long long
#define ull unsigned long long
#define ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
using ll = long long;
void solve()
{
string s;
cin >> s;
rep(bit, 1 << 3)
{
int tmp = s[0] - '0';
string ans;
ans += s[0];
rep(i, 3)
{
... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
bool Bsearch(int key, int A[], int len) {
int l = 0, r = len - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (A[mid] > key)
r = mid - 1;
else if (A[mid] < key)
l = mid + 1;
else
return true;
}
return false;
}
int main() {
int n, ... | #include<iostream>
using namespace std;
int main(){
int n,a[10000],m,b,ans=0;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
cin>>m;
while(m--){
cin>>b;
for(int i=0;i<n;i++)
if(a[i]==b){ans++;break;}
}
cout<<ans<<endl;
return 0;
} | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll sum = 0;
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
int a[1010],p[1010];
int main(){
int N,M,l,max=0,r;
cin>>N>>M;
for(int i=0;i<N;i++) cin>>a[i];
for(int i=0;i<M;i++){
cin>>l;
for(int j=0;j<N;j++){
if(a[j]<=l){
p[j]++;
break;
}
}
}
for(int i=0;i<N;i++){
if(max<p[i]){
max=p[i];
r=i+1;
}
... | 0 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <stdlib.h>
#include <math.h>
using namespace std;
int main (void)
{
long m,min,max,p[10000],g[10000],kkk,rrr;
f... | #if 1
#include <bits/stdc++.h>
#else
#include "../../bits/stdc++.h"
#endif
#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 REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
using namespace std;
typedef pair<int, int> P;
#define pb push_back
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define SZ(x) ((int)(x).size())
#define PB push_back
template <typename T>
void Puts(T x) {
cout << x << endl;
}
struct Node {
vector<int> parents;
vector<int> children;
int value;
};
in... | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define fi first
#define se second
#define pb push_back
//#define int long long
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
const int N = 1e5 + 10;
const int oo = 1e18;
int n, m, root, cnt;
int deg[N], ans[N], dp... | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld = l... | 0 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
constexpr ll INFL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
int n;... | #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>
#include<functional>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n)... | 0 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int64_t m = s.size();
vector a(1, 0L);
i... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n... | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
int main()
{
//abc_160a();
//abc_161a();
//abc_162a();
abc_163a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && ... | #include <bits/stdc++.h>
using namespace std;
int main () {
double a;
cin >> a;
cout << 2*a*3.14159265359 << endl;
}
| 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
typedef long long ll;
using namespace std;
int main()
{
int days[] = {31,29,31,30,31,30,31,31,30,31,30,31};
string week[] = {"Thursday","Friday","Saturday","Sund... | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
typedef long lon... | 0 |
#include <iostream>
#include <algorithm>
#include <iterator>
#include <iomanip>
#include <cmath>
#include <vector>
#include <numeric>
#include <cstdio>
#include <bitset>
#include <map>
#include <string>
#include <valarray>
// #include <cctype>
using namespace std;
typedef pair<int, int> Coordinate;
typedef vector<Coo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | 1 |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... | #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>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
typed... | #include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gpu_hash_map<int,... | 0 |
#define MYDEBUG
//
#include <bits/stdc++.h>
#ifdef MYDEBUG
#define dbp(x) cout<<#x<<": "<<x<<endl
#define dbp2(x,y) cout<<#x<<","<<#y<<": "<<x<<","<<y<<endl
#define dbp3(x,y,z) cout<<#x<<","<<#y<<","<<#z<<": "<<x<<","<<y<<","<<z<<endl
#define dbp4(w,x,y,z) cout<<#w<<","<<#x<<","<<#y<<","<<#z<<": "<<w<<","<<x<<","<<y<<"... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
#include <array>
#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <vector>
using namespace std;
template<typename Itr>
auto merge(Itr first1, const ... | 1 |
#include<bits/stdc++.h>
#define LLI long long int
#define MOD 1000000007
#define de(x) if( x && x == MODE)
#define MODE 0
using namespace std;
char K[100007] = {};
int D;
LLI dp[100007][107] = {};
int main() {
int i,j;
scanf("%s", K+1);
scanf("%d", &D);
int N = strlen(K+1);
K[0] = '0';
int pr... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
const ... | 1 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int n;
while(cin >> n){
range(i,1,n+1){
int x = i;
if(x % 3 == 0) cout << " " << x;
... | // AOJ ITP 1_5_D
#include<cstdio>
void call( int n )
{
int i = 1;
do
{
int x = i;
if( x % 3 == 0 )
printf( " %d", i );
else
{
do
{
if( x % 10 == 3 )
{
printf( " %d", i );
break;
}
x /= 10;
} while( x );
}
}while( ++i <= n );
puts("");
return;
}
int main()
{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num, max, a, b=0;
cin >> num >> max;
vector<long long> list2;
for (long long i=0; i<num; i++) {cin >> a; list2.push_back(a);}
sort(list2.begin(),list2.end());
reverse(list2.begin(),list2.e... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
ll ceil1(ll n,ll m){if(n%m==0){return n/m;}return n/m +1;}
/*
ll factor(ll n){
vll ans;
if(n==2)ans.pb(2);
else
{for... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct Kruskal {
Kruskal() = default;
explicit Kruskal(int n) { init(n); }
struct UnionFind {
vector<int> p, r;
UnionFind() = default;
UnionFind(int size) { init(size); }
void init(int size) {
p.resize(size);
... | #include <iostream>
#include <vector>
#include <algorithm>
#include<string>
using namespace std;
struct Edge{
int P1;
int P2;
int Wei;
};
int main(void){
vector<Edge> EdgeCol;
int V, E;
cin >> V >> E;
if (V == 1){cout << 0<<endl;return 0;}
vector<int>Select(V,0);
for (int i = 0; i < E; ++i){
int ... | 1 |
#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;
constexpr int INF = 2e9;
int main() {
int n, q;
string s;
cin >> n >> s >> q;
while (q--) {
int k;
cin >> k;
ll a = 0, b = 0, c = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
using ll = long long;
using V = vector<int>;
using Vll = vector<ll>;
using VV = vector<V>;
using VVll = vector<Vll>;
char s[1000000];
ll t[3][1000001];
int main() {
int n, q;
scanf(... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
c... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int i = 0;
char a[20];
scanf("%s", a);
while (1) {
i++;
if (a[i] == '\0') break;
}
i--;
while (i != -1) {
printf("%c", a[i]);
i--;
}
printf("\n");
return (0);
} | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string input;
std::getline(std::cin, input);
std::reverse(input.begin(), input.end());
std::cout << input + '\n';
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,M;
cin >> N >> M;
vector<int> divisor_list(0);
for (int i = 1; i * i <= M; i++)... | #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 a,b;
cin >> a >> b;
if(a%b == 0) cout << 0 << endl;
else cout << 1 << endl;
}
| 0 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
using namespace std;
class Point
{
private:
int m_x;
int m_y;
public:
void setX(int x);
void setY(int y);
int getX();
int getY();
Point(int x, int y) {
setX(x);
set... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
int m;
int c;
int e;
while(cin >>n>>m){
if(n==0&&m==0){break;}
int a[m];
int b[m];
c=0;
while(c<m){
cin >>a[c]>>b[c];
c=c+1;}
int d[n];
d[0]=3;
c=1;
while(c<n){
d[c]=0;
c=c+1;}
c=0;
while(c<m){
if(a[c]==1){d[b[c]-1]=2;}
if(b[c]==1){d[a[c]-1]=... | 0 |
#include<bits/stdc++.h>
using namespace std;
int a[100005],b[100005],c[100005];
vector<int>d[100006];
void dfs(int v,int s) {
a[v]=a[s]+1;
b[v]=1;
c[v]=s;
for(auto x:d[v]) {
if(x==s) continue;
dfs(x,v);
b[v]=max(b[v],b[x]+1);
}
}
int main(){
int n,u,v;
cin>>n>>u>>v;
for(int i=1;i<n;i++) {
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for(ll i = n-1; i >= 0LL; i--)
#define FOR(i, n, m) for(ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.