code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,k;
cin>>a>>b>>k;
int cnt=0,ans;
for(int i=100;i>0;i--){
if(a%i==0 && b%i==0){
cnt++;
}
if(cnt==k){
ans=i;
break;
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
void graphmake(ll E,matp &G){
rep(i,E){
ll a,b,c;
cin >> a >> b >> c;
G.at(a-1).push_back(P(b-1,c));
G.at(b-1).push_back(P(a-1,c));
}
}
void dijkstra(ll s,vec &d, matp &G,ll V){
priority_queue<P,vector<P>,greater<P>> que;
rep(i,V) d.at(i)=INF;
d.at(s)=0;
que.push(P(0,s));
while(!que.empty()){
P p=que.top();
que.pop();
ll v=p.second;
if(d.at(v)<p.first) continue;
rep(i,G.at(v).size()){
P e=G.at(v).at(i);
if(d.at(e.first)>d.at(v)+e.second){
d.at(e.first)=d.at(v)+e.second;
que.push(P(d.at(e.first),e.first));
}
}
}
}
int main(){
ll N,Q,K;
cin >> N;
matp G(N);
vec d(N);
graphmake(N-1,G);
cin >> Q >> K;
K--;
dijkstra(K,d,G,N);
rep(i,Q){
ll x,y;
cin >> x >> y;
cout << d.at(x-1)+d.at(y-1) << endl;
}
}
| 0 | 31,651,145 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define mem(a,b) memset(a, b, sizeof a)
#define vii vector<pair<int,int>>
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr <<#x<<" = "<<x<<"\n"
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for (int i = a; i<b; ++i)
#define len(s) s.length()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int power(int a,int b,int m=mod)
{int ans=1;while(b>0){if(b&1)ans=(ans*a)%m;a=(a*a)%m;b>>=1;}
return ans;}
void angshuGod()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 1e5+1;
const double pi = acos(-1);
vi adj[N];
bool visited[N];
int arr[N];
int cnt = 0;
void solve(){
int n,m;
cin>>n>>m;
rep(i,1,n+1) cin>>arr[i];
while(m--){
int a,b;
cin>>a>>b;
adj[a].pb(b);
adj[b].pb(a);
}
for(int i = 1;i<=n;i++){
if(adj[i].size()==0) cnt++;
else{
int currHeight = arr[i];
bool flag = true;
for(int x : adj[i]){
if(arr[x]>=currHeight){
flag = false;
break;
}
}
if(flag){
cnt++;
}
}
}
cout<<cnt;
}
int32_t main()
{
angshuGod();
int t;
t = 1;
while(t--){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq;
typedef priority_queue<ll> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
string S;cin>>S;
string ans="";
for(int i=0;i<S.size();i++){
switch(S[i]){
case '0':
case '1':
ans+=S[i];
break;
case 'B':
if(ans.size()>0){
ans.pop_back();
}
break;
}
}
cout<<ans<<endl;
}
| 0 | 2,749,565 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
const int M = 1000005;
int main() {
int x;
cin >> x;
int zy = x / 100;
int per = x % 100;
int cnt = zy;
for(int i = 5; i >= 0; i--){
if(per == 0){
break;
}
if(per % i == 0){
cnt = per / i;
per %= i;
}
}
if(cnt != 0 && zy >= cnt){
cout << 1 << endl;
}else{
cout << 0 << endl;
}
}
|
#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>
#include <iomanip>
using namespace std;
int main()
{
int N, abc, arc;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++)
{
cin >> d.at(i);
}
sort(d.begin(), d.end());
abc = d[d.size() / 2 - 1];
arc = d[d.size() / 2];
cout << arc - abc << endl;
}
| 0 | 75,546,545 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll A, B, C;
cin >> A >> B >> C;
A -= B;
C -= A;
cout << max(0LL, C) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
init();
ll N;
cin >> N;
string S;
cin >> S;
ll left = 0;
ll right = 0;
rep(i, N) {
if (S[i] == '(') {
right++;
} else {
if (right > 0) {
right--;
}
}
}
repr(i, N - 1) {
if (S[i] == ')') {
left++;
} else {
if (left > 0) {
left--;
}
}
}
rep(i, left) {
cout << "(";
}
cout << S;
rep(i, right) {
cout << ")";
}
ENDL;
return 0;
}
| 0 | 42,145,136 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
int n = 0;
for (auto e : vec) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& st) {
int n = 0;
for (auto e : st) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) {
int n = 0;
for (auto e : mp) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& e : vec) is >> e;
return is;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out() { std::cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
std::cerr << head;
if (sizeof...(Tail) != 0) std::cerr << ", ";
debug_out(std::forward<Tail>(tail)...);
}
using namespace std;
using int64 = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
cin >> s;
string tmp;
int last_A = 0;
int first_B = 0;
int num_of_AB = 0;
int B_A = 0;
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B') first_B++;
for (int j = 1; j < s[i].size(); j++) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B') num_of_AB++;
}
if (s[i][s[i].size() - 1] == 'A') last_A++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
B_A++;
}
}
int ans = 0;
if (B_A > 0) {
last_A -= B_A;
first_B -= B_A;
ans += B_A - 1;
if (last_A > 0) {
ans++;
last_A = max(last_A - 1, 0);
}
if (first_B > 0) {
ans++;
first_B = max(first_B - 1, 0);
}
ans += min(last_A, first_B);
} else {
ans += min(last_A, first_B);
}
ans += num_of_AB;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string solve(vector<string>&a, vector<string>&b){
int n = a.size();
int m = b.size();
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
int res = 0;
for(int k = 0; k < m; k++){
for(int l = 0; l < m; l++){
if(i + k < n && j + l < n && a[i+k][j+l] == b[k][l]){
res += 1;
}
}
}
if(res == m*m){
return "Yes";
}
}
}
return "No";
}
int main(){
int n, m;
cin >> n >> m;
vector<string>a(n), b(m);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < m; i++){
cin >> b[i];
}
cout << solve(a, b) << endl;
}
| 0 | 17,343,190 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=20010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int n,T,res,gg;
signed main()
{
n=read(), T=read();
for(ri int i=1;i<=n;i++)
{
int x=read();
res+=x+T;
res-=max(gg,x);
gg=x+T;
}
printf("%lld\n",res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0; (i)<(int)(n); (i)++)
#define frep(i,m,n) for(int (i)=(m); (i)<(int)(n); (i)++)
#define rrep(i,n) for(int (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(int (i)=(n)-1; (i)>(int)(m)-1; (i)--)
#define all(x) (x).begin(), (x).end()
#define sqr(x) (x)*(x)
#define CEIL(a,b) ((a)+(b)-1) /(b)
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const int MAX_N = 101010;
void sort_second(vector<pair<ll, ll>> &A, int N);
ll a_n(ll a, ll n);
void factorial_map(vector<ll> &n, vector<ll> &ninv);
ll inv(ll a);
void prime_map(map<int, int> &a, int n);
void prime_list(int n, vector<int> &primes, vector<bool> &is_prime);
ll gcd_map(map<int, int> a, map<int, int> b);
ll lcm_map(map<int, int> a, map<int, int> b);
ll my_gcd(ll a, ll b);
ll nCk(ll n, ll k);
ll my_abs(ll a);
class Unionfind {
public:
vector<ll> par, siz, rank;
Unionfind();
ll root(ll x);
void merge(ll x, ll y);
bool issame(ll x, ll y);
ll size(ll x);
};
int main() {
ll n, k, ret = 0;
cin >> n >> k;
vector<ll> sum(n+1);
sum[0] = 0;
rep(i, n) {
int a;
cin >> a;
sum[i+1] = sum[i] + a;
}
map<ll, ll> num;
for(int j = 1; j <= n; j++) {
if(j == 1 && k > 1) {
num[0] = 1;
}
if(j > 1) {
if(num.count((sum[j-1]-(j-1))%k)) num[(sum[j-1]-(j-1))%k]++;
else num[(sum[j-1]-(j-1))%k] = 1;
if(j-k >= 0) num[(sum[j-k]-(j-k))%k]--;
}
if(num.count((sum[j]-j)%k)) ret += num[(sum[j]-j)%k];
}
cout << ret << endl;
return 0;
}
void sort_second(vector<pair<ll, ll>> &A, int N) {
rep(i, N) swap(A.at(i).first, A.at(i).second);
sort(all(A));
rep(i, N) swap(A.at(i).first, A.at(i).second);
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count))%MOD ;
}
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for(int i = 1; i < n.size(); i++) n[i] = (n[i-1] * i) % MOD;
ninv[n.size()-1] = inv(n[n.size()-1]);
for(int i = n.size() - 2; i > -1; i--) ninv[i] = (ninv[i+1] * (i+1)) % MOD;
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
void prime_map(map<int, int> &a, int n) {
while((n%2) == 0) {
n /= 2;
if(a.count(2)) a.at(2)++;
else a[2] = 1;
}
for(int i = 3; i*i <= n; i+=2) {
while((n%i) == 0) {
n /= i;
if(a.count(i)) a.at(i)++;
else a[i] = 1;
}
}
if(n != 1) a[n] = 1;
}
ll gcd_map(map<int, int> a, map<int, int> b) {
ll ret = 1;
for(auto p : a) {
auto key = p.first;
auto value = p.second;
if(b.count(key)) {
if(value > b.at(key)) ret *= a_n(key, b.at(key));
else ret *= a_n(key, value);
}
}
return ret;
}
ll lcm_map(map<int, int> a, map<int, int> b) {
ll ret = 1;
for(auto p: a) {
auto key = p.first;
auto value = p.second;
if(b.count(key)) {
if(value > b.at(key)) ret *= a_n(key, value);
else ret *= a_n(key, b.at(key));
}
else {
ret *= a_n(key, value);
}
}
for(auto p: b) {
auto key = p.first;
auto value = p.second;
if(a.count(key)) {
continue;
}
else {
ret *= a_n(key, value);
}
}
return ret;
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll nCk(ll n, ll k) {
ll kfac = 1, ret = 1;
for(int i = 1; i <= k; i++) {
kfac = (kfac * i) % MOD;
}
for(int i = n; i >= n-k+1; i--) {
ret = (ret * i) % MOD;
}
ret = (ret * inv(kfac)) % MOD;
return ret;
}
void prime_list(int n, vector<int> &primes, vector<bool> &is_prime) {
int p = 0;
rep(i, n + 1) is_prime[i] = true;
is_prime[0] = false;
is_prime[1] = false;
for(int i = 2; i <= n; i++) {
if(is_prime[i]) {
primes.push_back(i);
for(int j = 2*i; j <= n; j += i) is_prime[j] = false;
}
}
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
Unionfind::Unionfind() {
par.resize(MAX_N);
siz.resize(MAX_N);
rank.resize(MAX_N);
rep(i, MAX_N) {
par[i] = i;
siz[i] = 1;
rank[i] = 0;
}
}
ll Unionfind::root(ll x) {
if(par[x] == x) return x;
else {
return par[x] = root(par[x]);
}
}
void Unionfind::merge(ll x, ll y) {
x = root(x);
y = root(y);
if(x == y) return;
if(rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
}
else {
par[y] = x;
siz[x] += siz[y];
if(rank[x] == rank[y]) rank[x]++;
}
}
bool Unionfind::issame(ll x, ll y) {
return root(x) == root(y);
}
ll Unionfind::size(ll x) {
return siz[root(x)];
}
| 0 | 62,775,882 |
#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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout << fixed << setprecision(x)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int sumDight(int x) {
int sum = 0;
while (x > 0) {
sum += (x % 10);
x /= 10;
}
return sum;
}
int divideReverse(int x) {
int reverse = 0;
int r;
while (x > 0) {
r = x % 10;
reverse = reverse * 10 + r;
x /= 10;
}
return reverse;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, k;
vector<int> l(101);
cin >> n >> k;
rep(i, n) cin >> l[i];
sort(ALL(l));
reverse(ALL(l));
int sum = 0;
rep(i, k)sum += l[i];
cout << sum << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
int main() {
li a,b;
cin>>a>>b;
if(a<b)swap(a,b);
rep(i,a){
cout<<b;
}
cout<<endl;
return 0;
}
| 0 | 3,447,774 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
int a, b, c; cin >> a >> b >> c;
set<int> st;
int mul = 1;
while (true) {
int mod = (a * mul) % b;
if (mod == c) {
cout << "YES" << endl;
return 0;
} else if (st.find(mod) != st.end()) {
cout << "NO" << endl;
return 0;
}
st.insert(mod);
mul++;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (ll i = 0; i < (o);i++)
#define rep_s(i, o) for (int i = 1; i <= (o);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i++)
#define NUM 1e5
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
template<class T>
bool chmax(T &a, const T &b) {
if (a < b)
{
return b;
}
return a;
}
template<class T>
bool chmin(T &a, const T &b) {
if (a > b)
{
a = b;
return 1;
}
return 0;
}
int main() {
ll n; cin >> n;
vector<ll> t(n); ll same_direction = 0;
cin >> same_direction;
REP(i, 1, n) {
cin >> t[i];
same_direction = lcm(same_direction, t[i]);
}
cout << same_direction << endl;
return 0;
}
| 0 | 9,609,202 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s;
cin >> s;
string t;
for(int i = 0; i < s.size(); i += 2) t.push_back(s[i]);
cout << t << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<list>
int main(){
int n;
std::cin >> n;
std::list<int> out;
for(int i = 0; i < n; i++){
int a;
std::cin >> a;
if(i % 2 == 0){
out.push_back(a);
}else{
out.push_front(a);
}
}
std::size_t size = out.size();
if(size % 2 != 0){
auto iter = out.end();
while(1){
iter--;
if(iter == out.begin()){
std::cout << *iter << std::endl;
break;
}else{
std::cout << *iter << " ";
}
}
}else{
auto iter = out.begin();
while(1){
std::cout << *iter;
iter++;
if(iter == out.end()){
std::cout << std::endl;
break;
}else{
std::cout << " ";
}
}
}
return 0;
}
| 0 | 9,989,196 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H1,M1,H2,M2,K,ans=0,minute=0; cin >> H1 >> M1 >> H2 >> M2 >> K;
cout << 60*(H2-H1) + (M2-M1) -K << endl;
}
|
#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>
#include <math.h>
#include <ios>
#include <iomanip>
#include <numeric>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
using namespace std;
const long long LINF =1e18;
const int INF = 1e9;
int main() {
int n;
cin>>n;
int q;
cin>>q;
vector<vector<int>>g(n,vector<int>());
for (int i = 1; i < n; ++i) {
int a,b;
cin>>a>>b;
a--;b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<ll>root(n,0);
for (int j = 0; j < q; ++j) {
int p;
ll x;
cin>>p>>x;
p--;
root[p] += x;
}
queue<pair<int,int>>bfs;
vector<bool>visit(n,false);
bfs.push({0,0});
while(!bfs.empty()){
int v_n = bfs.front().first;
int v_last = bfs.front().second;
bfs.pop();
visit[v_n] = true;
root[v_n] += v_last;
for (int i = 0; i < g[v_n].size() ; ++i) {
if(visit[g[v_n][i]] == false ){
bfs.push({g[v_n][i],root[v_n]});
}
}
}
for (int k = 0; k < n; ++k) {
cout << root[k] << ( k + 1 < n ? ' ' : '\n' );
}
return 0;
}
| 0 | 89,624,659 |
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (((A <= C) && (C <= B)) ? "Yes" : "No") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a >= b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
ll myctoi(char C) {return C - '0';}
char myitoc(ll N) {return '0' + N;}
#define FINALANS(A) {cout << (A) << endl; exit(0);}
int main()
{
ll N;
cin >> N;
vector<ll> T(N), A(N);
for (ll i = 0; i < N; i++)
{
cin >> T.at(i);
}
for (ll i = 0; i < N; i++)
{
cin >> A.at(i);
}
vector<ll> H(N, -1);
H.front() = T.front();
for (ll i = 1; i < N; i++)
{
if (T.at(i - 1) != T.at(i))
H.at(i) = T.at(i);
}
if (H.back() != -1 && H.back() != A.back())
FINALANS(0);
H.back() = A.back();
for (ll i = N - 2; i >= 0; i--)
{
if (H.at(i) != -1 && H.at(i) > A.at(i))
FINALANS(0);
if (A.at(i) != A.at(i + 1))
H.at(i) = A.at(i);
}
ll ans = 1;
for (ll i = 0; i < N; i++)
{
if (H.at(i) == -1)
{
ans *= min(T.at(i), A.at(i));
ans %= MOD;
}
}
cout << ans << endl;
}
| 0 | 58,881,302 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dd;
const int mod=1e9+7;
const int N = 1e5+5;
string now;
int main(){
cin>>now;
if(now.size() == 2){
if(now[0] == now[1]) cout<<"1 2"<<endl;
else cout<<"-1 -1"<<endl;
return 0;
}
for(int i = 0;i < now.size();i++){
if(i+1 < now.size() && now[i] == now[i+1]) {
cout<<i+1<<" "<<i+2<<endl;
return 0;
}
else if(i+2 < now.size() && now[i] == now[i+2]){
cout<<i+1<<" "<<i+3<<endl;
return 0;
}
}
cout<<"-1 -1"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 2e5 + 7;
const double eps = 1e-9;
const long double pi = 3.1415926535897932384626433832795;
const long double e = 2.71828182845904523536028747135266;
inline ll read()
{
ll kr = 1, xs = 0;
char ls;
ls = getchar();
while (!isdigit(ls))
{
if (!(ls ^ 45))
kr = -1;
ls = getchar();
}
while (isdigit(ls))
{
xs = (xs << 1) + (xs << 3) + (ls ^ 48);
ls = getchar();
}
return xs * kr;
}
inline ull readull()
{
ull xs = 0;
char ls;
ls = getchar();
while (!isdigit(ls))
ls = getchar();
while (isdigit(ls))
{
xs = (xs << 1) + (xs << 3) + (ls ^ 48);
ls = getchar();
}
return xs;
}
inline void writeull(ull x)
{
if (x < 0)
{
x *= -1;
putchar('-');
}
if (x >= 10)
writeull(x / 10);
putchar('0' + x % 10);
}
inline void write(ll x)
{
if (x < 0)
{
x *= -1;
putchar('-');
}
if (x >= 10)
write(x / 10);
putchar('0' + x % 10);
}
char a[MAXN];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--)
{
scanf("%s",a);
int now=0;
for (int i=0;a[i];i++){
now+=(a[i]-'0');
now%=9;
}
if(!now) printf("Yes\n");
else printf("No\n");
}
return 0;
}
| 0 | 7,107,877 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
bool flag;
int num;
cin >> N >> A;
num = N % 500;
if(A >= num){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
#ifdef DEBUG_
#include "../program_contest_library/memo/dump.hpp"
#else
#define dump(...)
#endif
const ll INF = 1LL<<60;
int main(void) {
ll n;
cin >> n;
vector<ll> a(1LL<<n);
REP(i, 1LL<<n) cin >> a[i];
auto merge = [](PII x, PII y) {
vector<ll> v({x.first, x.second, y.first, y.second});
sort(ALL(v));
return PII(v[3], v[2]);
};
vector<PII> dp(1LL<<n);
REP(i, 1LL<<n) dp[i].first = a[i];
REP(i, n) REP(j, 1LL<<n) if(j&(1LL<<i)) dp[j] = merge(dp[j], dp[j^(1LL<<i)]);
ll ma = 0;
FOR(i, 1, 1LL<<n) {
chmax(ma, dp[i].first+dp[i].second);
cout << ma << "\n";
}
cout << flush;
return 0;
}
| 0 | 74,528,204 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
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 = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
int N;
int main() {
cin >> N;
int ans = 0;
int ansnum = 1;
repe(i, 1, N) {
int num = i;
int cnt = 0;
while (num % 2 == 0) {
++cnt;
num /= 2;
};
if (chmax(ans, cnt)) {
ansnum = i;
}
}
cout << ansnum;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define ZERO(a) memset(a, 0, sizeof(a))
const ll INF = 1LL << 60;
const ll MM = 1000000000; const ll MOD = MM + 7; const ll MMM=9223372036854775807;
#define ADD(a,b) a = (a + ll(b)) % MOD
#define MUL(a,b) a = (a * ll(b)) % MOD
ll GCD(ll x, ll y){ if(y == 0) return x; else return GCD(y, x % y);}
ll LCM(ll x, ll y){ return x / GCD(x, y) * y;}
template<class T> inline bool chmin(T& a, T b){ if(a > b){ a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b){ if(a < b){ a = b; return true;} return false;}
template<typename A, size_t N, typename T> void FILL(A (&array)[N], const T &val){ fill( (T*)array, (T*)(array+N), val );}
using Graph = vector<vector<ll>>;
ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
ll ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
string s, t; cin >> s >> t;
sort(all(s));
sort(all(t));
reverse(all(t));
if(s.size() == t.size() && s == t){
cout <<"No" <<endl;
return 0;
}
rep(i, max(s.size(), t.size())){
if(i >= s.size()){
cout << "Yes"<<endl;
return 0;
}
else if(i >= t.size()){
cout << "No"<<endl;
return 0;
}
if(s[i] - t[i] < 0){
cout << "Yes" << endl;
return 0;
}
else if(s[i] - t[i] > 0){
cout << "No"<<endl;
return 0;
}
}
}
| 0 | 2,096,540 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
if (x < 1200) {
puts("ABC");
} else {
puts("ARC");
}
return 0;
}
|
#include<bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <map>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define SI(a) scanf("%d",&a)
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long ll;
const int mod = 998244353;
const int maxn = 110;
using namespace std;
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a*(b/gcd(a,b));}
inline int read(){
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*f;
}
ll quick_pow(ll x,ll n,ll mod){
ll res = 1;
while(n > 0){
if(n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string str[maxn];
int n,m;
cin>>n>>m;
for(int i = 0;i < n;i++)cin>>str[i];
sort(str,str+n);
for(int i = 0;i < n;i++)cout<<str[i];
return 0;
}
| 0 | 9,832,926 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define MOD 1000000007
int main(){
int n;
cin >> n;
map<int,int> mp;
rep(i,n){
int a;
cin >> a;
mp[a]++;
}
int cnt=0;
for(auto x:mp){
if(x.second%2==0) cnt++;
}
if(cnt%2==0) cout << mp.size() << endl;
else cout << mp.size()-1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<int> dict(N);
for (int i=0; i < N; i++) {
int x ;
cin >> x;
dict.at(x)++;
}
int length;
for (int i=0; i < N; i++) {
if (dict.at(i)){
length = i;
}
}
int ng_flag = 0;
if(length%2 == 0){
for(int i = length; i > length/2 ; i--){
if(dict.at(i) <= 1){
ng_flag = 1;
}
}
if(dict.at(length/2)!=1){
ng_flag = 1;
}
for(int i = 0; i < length/2 ; i++){
if(dict.at(i)){
ng_flag = 1;
}
}
}else{
for(int i = length; i > (length+1)/2 ; i--){
if(dict.at(i) <= 1){
ng_flag = 1;
}
}
if(dict.at((length+1)/2)!=2){
ng_flag = 1;
}
for(int i = 0; i < (length+1)/2 ; i++){
if(dict.at(i)){
ng_flag = 1;
}
}
}
if(ng_flag){
cout << "Impossible" << endl;
} else {
cout << "Possible" << endl;
}
}
| 0 | 80,267,067 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int count = 0;
int nokori = 15 - s.size();
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') count++;
}
cout << (count + nokori >= 8 ? "YES" : "NO") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
char a, b;
int main() {
cin >> a >> b;
if (a > b) {
cout << '>' << endl;
} else if (a < b) {
cout << '<' << endl;
} else {
cout << '=' << endl;
}
return 0;
}
| 0 | 10,370,885 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll MOD = 1000000007;
int main()
{
ll N;
cin >> N;
vector<ll> D(N);
REP(i, N) cin >> D[i];
if (D[0] != 0) {
PRINT(0);
return 0;
}
map<ll, ll> m;
REP(i, N) m[D[i]]++;
ll ans = 1;
FOR(i, 1, N) {
ans *= m[D[i]-1];
ans %= 998244353;
}
PRINT(ans);
return 0;
}
|
#include<iostream>
#include<cstring>
using namespace std;
#define INF -2000000000
int main() {
int n, b[1000],c[1000][4];
memset(b, -128, sizeof(b));
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
for (int i = 1; i <= n; i++) {
cout << "node " << i << ": key = " << b[i] << ", ";
if (b[i / 2] >= INF) {
cout << "parent key = " << b[i / 2] << ", ";
}
if (b[i * 2] >= INF) {
cout << "left key = " << b[i * 2] << ", ";
}
if (b[i * 2 + 1] >= INF) {
cout << "right key = " << b[i * 2 + 1] << ", ";
}
cout << endl;
}
return 0;
}
| 0 | 63,411,668 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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>;
int main(void) {
ll L, R;
cin >> L >> R;
ll ans =2020;
ll r = min(L + 2019, R);
for (ll i = L; i < r; ++i) {
for (ll j = i + 1; j <= r; ++j) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void chmin (int& a, int b) {
if (a > b) a = b;
}
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i < S.size()-2; i++) {
if (S[i] > '7') {
chmin(ans, (S[i]-'7') * 100 + (S[i+1]-'5') * 10 + S[i+2]-'3');
} else if (S[i] < '7') {
chmin(ans, ('7'- S[i]) * 100 + ('5'-S[i+1]) * 10 + '3'-S[i+2]);
} else {
if (S[i+1] > '5') {
chmin(ans, (S[i]-'7') * 100 + (S[i+1]-'5') * 10 + S[i+2]-'3');
} else if (S[i+1] < '5') {
chmin(ans, ('7'- S[i]) * 100 + ('5'-S[i+1]) * 10 + '3'-S[i+2]);
} else {
if (S[i+2] >= '3') {
chmin(ans, (S[i]-'7') * 100 + (S[i+1]-'5') * 10 + S[i+2]-'3');
} else {
chmin(ans, (S[i]-'7') * 100 + (S[i+1]-'5') * 10 + '3'-S[i+2]);
}
}
}
}
cout << ans << endl;
}
| 0 | 19,446,938 |
#include<iostream>
#include<vector>
#include<numeric>
using namespace std;
int main() {
int n, m;double p;
while (cin >> n >> m >> p&&n&&m) {
vector<int> x;
int cnt = 0,y;
for (int i = 0; i < n; i++) {
cin >> y;
x.push_back(y);
}
double money = 100*accumulate(x.begin(), x.end(), 0);
money = money*(100 - p);
if (x[m-1]==0)cout << 0 << endl;
else cout << (int)(money / (double)x[m-1]/100.0) << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int i,h,a=0,b=0,c=0;
for(i=0;i<10;i++){
cin >> h;
if(a<h){
c=b;
b=a;
a=h;
}else if(b<h){
c=b;
b=h;
}else if(c<h){
c=h;
}
}
cout << a << endl << b << endl << c << endl;
return 0;
}
| 0 | 95,173,176 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
signed main(){
ll n;cin>>n;
string s;cin>>s;
string t;cin>>t;
ll ans=2*n;
rep(i,n){
bool f=1;
rep(j,n-i){
if(s[i+j]!=t[j])f=0;
}
if(f){
ans=n+i;
break;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
ll ni(ll a,ll b){
if(b==0) return 1;
else if(b%2==0) return ni(a,b/2)*ni(a,b/2);
else return ni(a,b-1)*a;
}
int main(){
int n; cin >> n;
map<int,int> p;
for(int i=2; i<=n; i++){
int now=i;
for(int j=2; j<=sqrt(i); j++){
while(now%j==0){
p[j]++;
now/=j;
}
}
if(now!=1) p[now]++;
}
int num4=0;
int num2=0;
int num24=0;
int num14=0;
int num74=0;
for(auto x : p){
if(x.second>=4) num4++;
if(x.second>=2) num2++;
if(x.second>=14) num14++;
if(x.second>=24) num24++;
if(x.second>=74) num74++;
}
int ans=(num4*(num4-1)/2)*(num2-2);
ans+=num14*(num4-1);
ans+=num24*(num2-1);
ans+=num74;
cout << ans << endl;
return 0;
}
| 0 | 57,509,420 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str;
int n;
while(cin >> str){
if(str=="-") break;
cin >> n;
for(int i=0,h;i<n;i++){
cin >> h;
string cat = str.substr(0,h);
str.erase(0,h);
str+=cat;
}
cout << str << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmin(T1 &a, const T2 &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr ll INF = 0x3f3f3f3f3f3f3f3fLL;
constexpr ll mod = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
map<ll, ll> mp;
rep(i, N) { ++mp[A[i]]; }
ll all = 0;
map<ll, ll> sub;
for (auto e : mp) {
all += e.second * (e.second - 1) / 2;
sub[e.first] = max(
0ll, e.second - 1);
}
rep(i, N) { cout << all - sub[A[i]] << endl; }
}
| 0 | 83,770,562 |
#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; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
int n; cin >> n;
vector<ll> a(n), b(n); rep(i,n) cin >> a[i], b[i] = a[i];
sort(all(b));
ll ans = 0;
rep(i,n){
ll id = lower_bound(all(b),a[i]) - b.begin();
if((i-id)%2 != 0) ans++;
}
cout << ans/2 << endl;
return 0;
}
|
#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 ctoi(char c){
switch (c){
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default: return 0;
}
}
int main(){
string N;
cin >> N;
ll K;
cin >> K;
ll len = N.size();
vector<vector<ll> > dp1(len + 1, vector<ll>(4));
vector<vector<ll> > dp2(len + 1, vector<ll>(4));
rep(i,len + 1){
rep(j,4){
dp1[i][j] = 0;
dp2[i][j] = 0;
}
}
dp1[1][1] = 1;
dp2[1][0] = 1;
dp2[1][1] = ctoi(N[0]) - 1;
for (ll i = 1; i < len; i++){
if (ctoi(N[i]) == 0){
dp1[i + 1][1] = dp1[i][1];
dp1[i + 1][2] = dp1[i][2];
dp1[i + 1][3] = dp1[i][3];
dp2[i + 1][0] = dp2[i][0];
dp2[i + 1][1] += dp2[i][0] * 9;
dp2[i + 1][1] += dp2[i][1];
dp2[i + 1][2] += dp2[i][1] * 9;
dp2[i + 1][2] += dp2[i][2];
dp2[i + 1][3] += dp2[i][2] * 9;
dp2[i + 1][3] += dp2[i][3];
}
else{
dp1[i + 1][1] = dp1[i][0];
dp1[i + 1][2] = dp1[i][1];
dp1[i + 1][3] = dp1[i][2];
dp2[i + 1][1] += dp1[i][0] * (ctoi(N[i]) - 1);
dp2[i + 1][1] += dp1[i][1];
dp2[i + 1][2] += dp1[i][1] * (ctoi(N[i]) - 1);
dp2[i + 1][2] += dp1[i][2];
dp2[i + 1][3] += dp1[i][2] * (ctoi(N[i]) - 1);
dp2[i + 1][3] += dp1[i][3];
dp2[i + 1][0] += dp2[i][0];
dp2[i + 1][1] += dp2[i][0] * 9;
dp2[i + 1][1] += dp2[i][1];
dp2[i + 1][2] += dp2[i][1] * 9;
dp2[i + 1][2] += dp2[i][2];
dp2[i + 1][3] += dp2[i][2] * 9;
dp2[i + 1][3] += dp2[i][3];
}
}
cout << dp1[len][K] + dp2[len][K] << endl;
}
| 0 | 77,165,129 |
#include <iostream>
#include <cassert>
#include <limits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <array>
#include <map>
#include <set>
#include <deque>
#include <list>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <climits>
#include <cstring>
#include <bitset>
#include <stack>
#include <queue>
#define MOD (1e9 + 7);
#define PI (3.14159265358979323846)
using ll = int64_t;
using ull = uint64_t;
using namespace std;
[[maybe_unused]] static auto __x = [](){ios_base::sync_with_stdio(0); cin.tie(0);};
int main() {
string a;
cin >> a;
unordered_set<char> s;
for (char ch : a) s.insert(ch);
cout << (s.size() == 2 ? "Yes" : "No");
}
|
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define ALL(v) v.begin(),v.end()
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cout<<v[i]<<" "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<int, int> P;
struct Edge{ll from, to, cost;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
if(n%i==0)res=false;
return res;
}
vector<P> G[101000];
ll N, K, Q;
map<ll, ll> dist;
void gen_dist(ll f, ll c){
ll S = G[c].size();
rep(i, S){
ll v = G[c][i].first;
ll cost = G[c][i].second;
if(v==f)continue;
dist[v] += dist[c] + cost;
gen_dist(c, v);
}
}
int main(){
cin >> N;
rep(i, N-1){
ll a, b, c;
cin >> a >> b >> c;
a--;b--;
G[a].push_back({b, c});
G[b].push_back({a, c});
}
cin >> Q >> K;
K--;
dist[K] = 0;
gen_dist(-10, K);
llvec x(Q, 0);
llvec y(Q, 0);
rep(i, Q){
cin >> x[i] >> y[i];
x[i]--;y[i]--;
}
rep(i, Q){
cout << dist[x[i]] + dist[y[i]] << endl;
}
return 0;
}
| 0 | 48,699,566 |
#include<iostream>
#include<climits>
#include<vector>
#include<list>
#include<functional>
#include<algorithm>
#include<string>
#include<cmath>
#include<complex>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
class question {
public:
int H;
vector<int> h;
void ans() {
cin >> H;
h.resize(H);
REP(i, H) cin >> h[i];
REP(i, H) {
int key = h[i];
int parent = i == 0 ? INT_MAX : h[(i - 1) / 2];
int left = (2 * i + 1 < H) ? h[2 * i + 1] : INT_MAX;
int right = (2 * i + 2 < H) ? h[2 * i + 2] : INT_MAX;
cout << "node " << i + 1 << ": key = " << key << ", ";
if (parent < INT_MAX) cout << "parent key = " << parent << ", ";
if (left < INT_MAX) cout << "left key = " << left << ", ";
if (right < INT_MAX) cout << "right key = " << right << ", ";
cout << "\n";
}
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
question q;
q.ans();
return 0;
}
|
#include<stdio.h>
int main()
{
long long a,b,c,k;
while(~scanf("%lld %lld %lld %lld", &a, &b, &c, &k))
{
if(k/2 == (k+1)/2)
printf("%lld\n", a-b);
else
printf("%lld\n", b-a);
}
return 0;
}
| 0 | 53,906,587 |
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i, a, b) for(int i=a; i < b;i++)
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <deque>
using namespace std;
void newline() {cout << endl;}
template <typename T>
void display(T input){cout << input;}
template <typename T>
void put(T input){display(input); newline();}
deque<string> v;
int solve(){
int cnt=0;
bool r=false, l=false;
string prev=v.front();
v.pop_front();
while(!v.empty()){
string now=v.front();
v.pop_front();
if(prev=="lu" && now=="ru" || prev=="ru" && now=="lu"){cnt++;}
if(prev=="ld" && now=="rd" || prev=="rd" && now=="ld"){cnt++;}
prev=now;
}
return cnt;
}
int main() {
int n;
while(cin >> n && n){
rep(i, 0, n){
string s; cin >> s;
v.push_back(s);
}
put(solve());
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod=1e9+7;
int mod2=998244353;
signed main(){
while(true){
int n,m;
cin>>n>>m;
if(!n&&!m)break;
vector<pair<int,int> > a(n);
for(int i=0;i<n;i++){
cin>>a[i].second>>a[i].first;
}
sort(a.begin(),a.end(),greater<pair<int,int> >());
int sum=0;
int ans=0;
for(int i=0;i<n;i++){
sum+=a[i].second;
if(sum-a[i].second<=m&&sum>m){
ans+=(sum-m)*a[i].first;
}else if(sum>m)ans+=a[i].first*a[i].second;
}
cout<<ans<<endl;
}
}
| 0 | 70,133,625 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
#define pb push_back
#define ppb pop_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const int N = 1e5 + 667;
vi v;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
v.pb(1);
v.pb(1);
v.pb(1);
v.pb(2);
v.pb(1);
v.pb(2);
v.pb(1);
v.pb(5);
v.pb(2);
v.pb(2);
v.pb(1);
v.pb(5);
v.pb(1);
v.pb(2);
v.pb(1);
v.pb(14);
v.pb(1);
v.pb(5);
v.pb(1);
v.pb(5);
v.pb(2);
v.pb(2);
v.pb(1);
v.pb(15);
v.pb(2);
v.pb(2);
v.pb(5);
v.pb(4);
v.pb(1);
v.pb(4);
v.pb(1);
v.pb(51);
int k;
cin >> k;
cout << v[k-1];
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 2000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}
int V, E, d[110][110];
int main() {
ios::sync_with_stdio ( false );
cin.tie ( 0 );
cin >> V >> E;
rep(i, 0, V) rep(j, 0, V) {
d[i][j] = INF;
d[i][i] = 0;
}
rep(i, 0, E) {
int s, t, u;
cin >> s >> t >> u;
d[s][t] = u;
}
rep(k, 0, V) rep(i, 0, V) rep(j, 0, V) {
if (d[i][k] != INF && d[k][j] != INF) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
rep(i, 0, V) {
if (d[i][i] < 0) {
printf("NEGATIVE CYCLE\n");
return 0;
}
}
rep(i, 0, V) {
rep(j, 0, V) {
if (d[i][j] != INF) printf("%d", d[i][j]);
else printf("INF");
if (j != V-1) printf(" ");
else printf("\n");
}
}
return 0;
}
| 0 | 70,000,354 |
#include <iostream>
#include <vector>
using namespace std;
vector<int> M[10000];
vector<int> m[10000];
int mark[10000]={0};
int main(){
int V;
int E;
int s,t;
cin >> V >> E;
for(int i=0;i<E;i++){
cin >> s >> t;
M[s].push_back(t);
m[t].push_back(s);
}
for(int i=0;i<V;i++){
for(int j=0;j<V;j++){
if(m[j].size()==0&&mark[j]!=1){
mark[j]=1;
cout << j <<endl;
for(int k=0;k<M[j].size();k++){
for(int l=0;l<m[M[j][k]].size();l++){
if(m[M[j][k]][l]==j){
m[M[j][k]].erase(m[M[j][k]].begin() + l);
}
}
}
break;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
void solve()
{
int mx=50000000;
int n,x,m;
cin>>n>>x>>m;
mx=min(mx,n);
int prev=x;
int ans=x;
unordered_map<int,int> mp;
mp[x]=1;
int ok=0;
int freeze=0;
vector<int> res;
res.pb(x);
for(int i=2;i<=mx;i++)
{
prev*=prev;
prev%=m;
if(!mp[prev])
{
mp[prev]=1;
res.pb(prev);
}
else if(!ok)
{
ok=1;
freeze=prev;
}
ans+=prev;
}
if(prev==0)
{
cout<<ans<<endl;
}
else if(prev==1)
{
ans+=n-mx;
cout<<ans<<endl;
}
else
{
int i=0;
n-=mx;
if(n==0)
{
cout<<ans<<endl;
return;
}
vector<int> cyc;
int yes=0;
for(int i=0;i<res.size();i++)
{
if(res[i]==freeze)
{
yes=1;
}
if(yes)
cyc.pb(res[i]);
}
for( i=0;i<cyc.size();i++)
{
if(cyc[i]==prev)
{
i++;
break;
}
}
for(;i<cyc.size();i++)
{ if(n==0)
break;
ans+=cyc[i];
n--;
}
if(n==0)
{
cout<<ans<<endl;
return;
}
int sum=0;
int r=cyc.size();
for(int i=0;i<r;i++)
{
sum+=cyc[i];
}
if(r==0)
{
cout<<ans<<endl;
return;
}
int f=(n/r);
f*=sum;
ans+=f;
n=n%r;
for(i=0;i<n;i++)
{
ans+=cyc[i];
}
cout<<ans<<endl;
}
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| 0 | 95,610,023 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t H,W;
cin >> H >> W;
if (W==1 || H ==1){
cout << 1 << endl;
}
else if (H%2==1 && W%2==1){
cout << W*(H/2)+W/2+1 << endl;
}
else {
cout << H*W/2 << endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
typedef long long llong;
using namespace std;
int main() {
char iptNum[1100];
int sum = 0;
while (1) {
fgets(iptNum, 1100, stdin);
if (iptNum[0] == 48)break;
sum = 0;
for (int i = 0;48<= iptNum[i]&&iptNum[i]<=57 ; i++)sum += iptNum[i] -= 48;
cout << sum << '\n';
}
return 0;
}
| 0 | 41,877,983 |
#include <bits/stdc++.h>
#define dcout cout << fixed << setprecision(15)
#define rep(i, a) for(int i = 0; i < a; i++)
#define arep(i, x) for(auto i : x)
#define all(v) v.begin(), v.end()
#define int long long
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
using namespace std;
signed main() {
int n;
cin >> n;
VE a;
rep(i, n) {
int enter;
cin >> enter;
a.pb(enter);
}
int ans = 0;
rep(i, n - 1) {
if(a[i + 1] == a[i]) {
a[i + 1] = 10001;
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#define LL long long
#define ull unsigned long long
#define PI acos(-1.0)
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pLL pair<LL,LL>
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define SQR(a) ((a)*(a))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))
#define vi vector <int>
#define vL vector <LL>
#define LB(a,x) (lower_bound(all(a),x)-a.begin())
#define UB(a,x) (upper_bound(all(a),x)-a.begin())
#define prec(n) fixed << setprecision(n)
#define MEM(a,x) memset(a,x,sizeof(a))
#define SORT(v) sort(v.begin(),v.end())
#define REV(v) reverse(v.begin(),v.end())
#define Unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,b) for(int i=0;i<b;i++)
#define IT(it,x) for(it=x.begin();it!=x.end();it++)
int main()
{
LL a,b,c,d;
cin>>a>>b>>c>>d;
LL z = (c*d)/__gcd(c,d);
a--;
LL cnt = b/d-a/d + b/c-a/c -b/z+a/z;
cnt=(b-a)-cnt;
cout<<cnt;
}
| 0 | 42,124,829 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> p(n);
for(int i=0;i<n;i++)cin>>p[i];
int ans=1;
int m=p[0];
for(int i=1;i<n;i++){
if(p[i]<=m){
ans++;
m=p[i];
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int inf = 1000000000+7;
int n,m;
cin >> n >> m;
int x;
int ans1=0;
int ans2=0;
for(int i=1;i<=n;i++){
cin >> x;
ans1 = (ans1+(n - 2*i +1)*x)%inf;
}
for(int i=1;i<=m;i++){
cin >> x;
ans2 = (ans2 +(m - 2*i +1)*x)%inf;
}
cout << (ans1*ans2)%inf;
return 0;
}
| 0 | 10,107,869 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
char a,b;
cin>>a>>b;
if(a>b)cout<<'>';
else if(a<b)cout<<'<';
else cout<<'=';
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <stdlib.h>
#include <set>
#include <atcoder/dsu>
typedef long long ll;
using namespace std;
using namespace atcoder;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
dsu d(n);
for (int i = 0; i < q; i++) {
int t, u, v;
cin>>t>>u>>v;
if (t == 0) {
d.merge(u, v);
}
else {
if (d.same(u, v)) {
cout << 1 << endl;
}
else {
cout << 0 << endl;
}
}
}
return 0;
}
| 0 | 22,312,784 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int r, g;
cin >> r >> g;
cout << 2 * g - r << endl;
return 0;
}
|
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i,n) for(int i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long int ll;
typedef long double ld;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
int main(void) {
string s; int k; cin >> s >> k;
int dp[110][2][4],n = s.size();
Fill(dp, 0);
dp[0][0][0] = 1;
rep(i, n) {
rep(j, 2) {
rep(l, 4) {
int nm = s[i] - '0';
rep(d, 10) {
int nl = l,nj = j;
if (d!=0) nl++;
if (nl > k)continue;
if (nj == 0) {
if (nm < d) continue;
if (nm > d) nj = 1;
}dp[i + 1][nj][nl] += dp[i][j][l];
}
}
}
}cout << dp[n][0][k] + dp[n][1][k] << endl;
}
| 0 | 16,026,091 |
#include <iostream>
using namespace std;
int n;
int f,r;
int B ,F,R,V;
int array[4][10][10];
void Array(int b,int f,int r)
{
array[b-1][f-1][r-1] += V;
}
void input()
{
for(int i=0; i<n; i++)
{
cin >> B >> F >> R >> V;
Array(B,F,R);
}
}
int main()
{
cin >> n;
for(int z=0; z<4; z++){
for(int i=0; i<3; i++){
for(int j=0; j<10; j++)
{
array[z][i][j] = 0;
}
}
}
input();
for(int z = 0; z < 3; z++){
for(int i=0; i<3; i++){
for(int j=0; j<10; j++)
{
cout << " " << array[z][i][j];
}
cout << endl;
}
cout << "####################\n";
}
for(int i=0; i<3; i++){
for(int j=0; j<10; j++)
{
cout << " " << array[3][i][j];
}
cout << endl;
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> mon(N+1,0);
vector<long long> hero(N,0);
for(int i = 0;i < N + 1;i++){
cin >> mon.at(i);
}
for(int i = 0;i < N;i++){
cin >> hero.at(i);
}
long long count = 0,x = 0,y = 0;
for(int i = 0;i < N;i++){
x = min(mon.at(i),hero.at(i));
count += x;
hero.at(i) -= x;
if(hero.at(i) != 0){
y = min(mon.at(i + 1),hero.at(i));
count += y;
mon.at(i + 1) -=y;
}
}
cout << count << endl;
}
| 0 | 16,020,897 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
string s;
cin >> s;
char alph[26] = {0};
rep(i, s.size())
{
int d;
d = s[i] - 'a';
alph[d]++;
}
rep(i, 26)
{
if (alph[i] == 0)
{
char out = i + 'a';
cout << out << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define pi 3.1415926535
#define endl "\n"
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define ll long long
#define llu unsigned long long
#define setbits(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define sz(x) (int)x.size()
#define tc int test_case; cin >> test_case; while(test_case--)
#define f(i,a,n) for(int i = a ; i < n ; i++)
#define rf(i,n,a) for(int i = n-1 ; i >= a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define get(a,n) f(i,0,n) cin >> a[i];
#define show(a,n) f(i,0,n) cout << a[i] << " "; cout << endl;
#define sp(x) fixed << setprecision(10) << x
#define nitro ios:: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define trace(x) cerr << '>' << #x << ':' << (x) << "\n"
#define trace2(x,y) cerr<< '>' << #x << ':' << (x) << " | " << #y << ':' << (y) << "\n"
#define trace3(a,b,c) cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define trace4(a,b,c,d) cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<pii,int> ppi;
typedef vector<pii> vpi;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
const int inf = 1e9;
const ll inf64 = 1e18;
const int mod = inf + 7;
const int N = 2e5 + 10;
int main()
{
nitro;
int n;
cin >> n;
ll ans = 0;
for(int i = 1; i < n; i++)
{
int x = (n-1)/i;
ans += x;
}
cout << ans;
}
| 0 | 39,801,005 |
#include <stdio.h>
void judge(int x, int y, int z);
int pow2(int x);
int main(void)
{
int dataset;
scanf("%d", &dataset);
int side1, side2, side3;
while (dataset--){
scanf("%d %d %d", &side1, &side2, &side3);
judge(side1, side2, side3);
}
return 0;
}
void judge(int x, int y, int z)
{
enum {YES, NO} yn;
if (pow2(x) == pow2(y) + pow2(z)){
yn = YES;
} else if (pow2(y) == pow2(z) + pow2(x)){
yn = YES;
} else if (pow2(z) == pow2(x) + pow2(y)){
yn = YES;
} else {
yn = NO;
}
if (yn == YES){
printf("YES\n");
} else {
printf("NO\n");
}
}
int pow2(int x)
{
return x * x;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
random_device rnd;
mt19937 mt(rnd());
uniform_int_distribution<int>engine(mi,ma);
return engine(mt);
}
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
bool prime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
int modpow(int a,int b){
if(b==0)return 1;
if(b%2)return modpow(a,b-1)*a%mod;
int memo=modpow(a,b/2);
return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
kaijo.resize(n+1);
invkaijo.resize(n+1);
kaijo[0]=1;
for(int i=1;i<=n;i++){
kaijo[i]=kaijo[i-1]*i;
kaijo[i]%=mod;
}
rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
if(a<b)return 0;
if(a<0||b<0)return 0;
return kaijo[a]*invkaijo[a-b]%mod*invkaijo[b]%mod;
}
int inv(int x){
x=modpow(x,mod-2);
return x;
}
signed main(){
cin.tie(0);ios::sync_with_stdio(false);
int n=1,len;
bool flag=false;
for(int i=1;i<=11;i++){
cout<<"? "<<n<<endl;
char ret;
cin>>ret;
if(ret=='N'){
flag=true;
len=i-1;
break;
}
n*=10;
}
if(!flag){
int n=2;
for(int i=1;i<=11;i++){
cout<<"? "<<n<<endl;
char ret;
cin>>ret;
if(ret=='Y'){
len=i;
break;
}
n*=10;
}
}
int ok=1,ng=1;
rep(_,len-1)ng*=10;
ok=ng*10;
ng--;
while(ok-ng>1){
int mid=(ok+ng)/2;
cout<<"? "<<10*mid<<endl;
char ret;
cin>>ret;
if(ret=='Y'){
ok=mid;
}
else{
ng=mid;
}
}
cout<<"! "<<ok<<endl;
return 0;
}
| 0 | 20,574,043 |
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<(S)<<endl
#define ck(a,b) (0<=(a)&&(a)<(b))
using namespace std;
int main(){
int m,nmin,nmax;
while(cin>>m>>nmin>>nmax,m){
int P[201];
int maxg=0;
int ans;
REP(i,0,m) cin>>P[i];
REP(i,nmin,nmax+1){
int gap=P[i-1]-P[i];
if(gap>=maxg){
maxg=gap;
ans=i;
}
}
p(ans);
}
return 0;
}
|
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
ll gcd(ll a, ll b) {
if (b == 0) { return a; }
if (a < b) { return gcd(b, a); }
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) *b;
}
struct edge {
ll ind;
ll to;
ll d;
};
int main() {
ll A, B;
cin >> A >> B;
if (A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) { cout << "Possible"; }
else { cout << "Impossible"; }
system("PAUSE");
}
| 0 | 1,759,023 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ';
pr(b);
}
int ans = 0;
int main()
{
int a, b, c;
cin >> a >> b >> c;
pr((a + b + c) - max(a, max(b, c)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
int main(){
ll n;
cin >> n;
ll a[n] = {};
ll cnt = 0,memo = 0;
rep(i,0,n) cin >> a[i];
sort(a,a+n);
rep(i,0,n){
if(i > 0 && memo*2 < a[i]){
cnt = 0;
}
cnt++;
memo += a[i];
}
cout << cnt << endl;
return 0;
}
| 0 | 44,408,188 |
#include<bits/stdc++.h>
using namespace std;
long long k=9,n;
struct node
{
long long a,b;
};
queue<node>Q;
int main()
{
cin>>n;
for(int i=1;i<=9;i++)
{
node tmp;
tmp.a=tmp.b=i;
Q.push(tmp);
}
while(!Q.empty())
{
node tmp=Q.front();
Q.pop();
long long a=tmp.a,b=tmp.b,t=tmp.a%10;
if(b==n)
{
cout<<a;
return 0;
}
for(int i=0;i<=9;i++)
{
if(abs(i-t)<=1)
{
node cur;
cur.a=a*10+i;
cur.b=++k;
Q.push(cur);
}
}
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
int height,width;
while(true){
cin >> height >> width;
if(height == 0 && width == 0)break;
for(int i = 0; i < height; i++){
for(int j = 0; j < width; j++){
cout << "#";
}
cout << "\n";
}
cout << "\n";
}
return 0;
}
| 0 | 72,184,125 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a[5],ans;
for(int i=0;i<3;i++){
cin>>a[i];
}
sort(a,a+3);
ans=a[2]*10;
ans+=a[0]+a[1];
cout<<ans<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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;
vector<pair<int64_t,int64_t>>func(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int N;
cin>>N;
vector<int>d(N);
for(int i=0;i<N;i++){
cin>>d[i];
}
int ans=0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
ans+=d[i]*d[j];
}
}
cout<<ans<<endl;
return 0;
}
| 0 | 94,732,552 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
int main(){
ll N,M;
cin>>N>>M;
ll votesum=0;
vector<ll>vote(N);
rep(i,N){
cin>>vote[i];
votesum+=vote[i];
}
ll sum=0;
rep(i,N){
if(votesum/(4.0*M)<=vote[i])sum++;
}
if(M<=sum)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#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>;
int main(){
int N, K, n = 1;
cin >> N;
cin >> K;
rep(i, N)
{
if(n <= K){
n *= 2;
}else{
n += K;
}
}
cout << n << endl;
return 0;
}
| 0 | 38,123,999 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
int main(){
int n;
cin >> n;
vector<ll>a(n);
ll p = 0;
rep(i,n){
cin >> a[i];
p ^=a[i];
}
rep(j,60){
if((p>>j)&1){
rep(i,n){
if((a[i]>>j)&1){
a[i] ^= (1LL<<j);
}
}
}
}
rep(i,min(60,n)){
sort(a.begin(),a.end(),greater<ll>());
ll c = -1;
rep(j,60){
if((a[i]>>j)&1){
c = j;
}
}
if(c==-1)break;
rep(j,n){
if(i!=j){
if((a[j]>>c)&1){
a[j]^=a[i];
}
}
}
}
sort(a.begin(),a.end(),greater<ll>());
int m = min(n,60);
cerr << bitset<60>(p) << endl;
rep(i,n){
cerr << bitset<60>(a[i]) << endl;
}
ll q = 0;
rep(i,m){
q ^=a[i];
}
cout << q + (p^q) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
ll n;
cin>>n;
vector<ll> v;
v.pb(0);
while(n--){
ll k;
cin>>k;
v.pb(k);
}
sort(v.begin(),v.end());
ll ans=0;
for(ll i=1;i<v.size();i++){
if(v[i]!=v[i-1]){
ans+=1;
}
}
cout<<ans-!(ans&1);
return 0;
}
| 0 | 69,782,264 |
#define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef _DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#else
#define debug(...)
#endif
#define rep(index,num) for(int index=0;index<(int)num;index++)
#define rep1(index,num) for(int index=1;index<=(int)num;index++)
#define brep(index,num) for(int index=(int)num-1;index>=0;index--)
#define brep1(index,num) for(int index=(int)num;index>0;index--)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl=(ll)1e+18+1;
int INF=1e+9+1;
int main(){
int M,N,A[2001];
scan(N>>M);
int sum=0;
rep(i,N) scan(A[i]),sum+=A[i];
int ans=0;
rep(i,N) if(A[i]*4*M>=sum) ans++;
if(ans>=M) prin("Yes");
else prin("No");
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <ios>
#include <iomanip>
#include <numeric>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
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 ll;
using namespace std;
const long long LINF =1e18;
const int INF = 1e9;
ll gcd(ll a,ll b){
if(b == 0){
return a;
}
return gcd(b,a %b);
}
int main() {
int n;
cin>>n;
ll x;
cin>>x;
for (int i = 1; i < n; ++i) {
ll a;
cin>>a;
x = gcd(x,a);
}
cout<<x<<endl;
return 0;
}
| 0 | 3,586,897 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,n;
cin>>x>>n;
int sa=0;
int frag2=0;
vector<int> num(n);
for(int i=0;i<n;i++)
{
cin>>num.at(i);
}
for (int i = 0; i < 100; i++)
{
int frag=0;
int frag2=0;
for (int j = 0; j < n; j++)
{
if (num.at(j)==x+i)
{
frag++;
frag2=1;
}
if (num.at(j)==x-i)
{
frag++;
frag2=2;
}
}
if (frag>1)
{
sa++;
}
else
{
if (frag2<2)
{
cout<<x-sa<<endl;
}
else{
cout<<x+sa<<endl;
}
break;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,sum=0;
cin>>n;
string s= to_string(n);
for(int i=0;i<s.length();i++)
{
sum+=s[i]-'0';
}
if(n%sum==0)
{
cout<<"Yes"<<"\n";
}
else
{
cout<<"No"<<"\n";
}
return 0;
}
| 0 | 96,910,225 |
#include<cstdio>
const int N=1e5+9;
int L[17][N],R[17][N],n,t,q,X[N],ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",X+i);
scanf("%d",&t);
for(int i=1,it=1;i<=n;++i){
while(it<n&&X[it+1]-X[i]<=t)++it;
R[0][i]=it;
}
for(int i=n,it=n;i;--i){
while(it>1&&X[i]-X[it-1]<=t)--it;
L[0][i]=it;
}
for(int i=1;i<17;++i)
for(int j=1;j<=n;++j)
R[i][j]=R[i-1][R[i-1][j]],L[i][j]=L[i-1][L[i-1][j]];
for(scanf("%d",&q);q--;printf("%d\n",ans)){
int x,y;ans=1;
scanf("%d%d",&x,&y);
if(x<=y){
for(int i=16;~i;--i)
if(R[i][x]<y)ans+=1<<i,x=R[i][x];
}else{
for(int i=16;~i;--i)
if(L[i][x]>y)ans+=1<<i,x=L[i][x];
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e2+5 , M = 1e5+5 , MOD = 1e9+7;;
int n , k;
ll A[N] , sum[N] , bit[N][M] , dp[N][M];
void add(int x , int y , int val){
for(int i = y ; i < M ; i+=i&-i) bit[x][i] = (bit[x][i]+val)%MOD;
}
ll query(int x , int y){
ll r = 0;
for(int i = y ; i > 0 ; i-=i&-i) r = (r+bit[x][i])%MOD;
return r;
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0);
cin >> n >> k;
for(int i = 1 ; i <= n ; i++){cin >> A[i]; sum[i] = (sum[i-1]+A[i])%MOD;}
for(int i = 0 ; i <= n ; i++) dp[i][0] = 1;
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= min(sum[i],(ll)k) ; j++){
dp[i][j] = ((query(i-1,j)-query(i-1,max((ll)0,j-A[i]-1))+MOD)%MOD + (A[i] >= j))%MOD;
add(i,j,dp[i][j]);
}
cout << dp[n][k] << "\n";
}
| 0 | 83,276,144 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<char> v;
string s;
cin >> s;
for (char c: s) {
if (c != 'B') v.emplace_back(c);
else if (!v.empty()) v.pop_back();
}
string res(begin(v), end(v));
cout << res << "\n";
}
|
#include <iostream>
#include <bits/stdc++.h>
#define lli unsigned long long int
using namespace std;
#define S second
#define F first
#define pb push_back
#define M1 1000000007
#define M2 998244353
#define pint pair<int,int>
#define setit set<int>::iterator seti
#define mapit map<int,int> ::iterator mapi
#define MP make_pair
#define MT make_tuple
#define PI 3.14159265358979323846
#define mini(x,y) (y + ((x - y) & ((x - y) >>(sizeof(int) * CHAR_BIT - 1))))
#define maxi(x,y) (x - ((x - y) & ((x - y) >> (sizeof(int) * CHAR_BIT - 1))))
#define fr(j,a,b) for(j=a;j<b;j++)
int power(int x, unsigned int y, int p)
{ int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{ if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lli t, n, g, b, i, x, j;
cin >> n;
n--;
n = (n * (n + 1)) / 2;
cout << n;
}
| 0 | 40,972,945 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
long long N; cin >> N;
long long a[55];
long long cnt = 1;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
long long ans = 0;
while (cnt > 0) {
cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= N) {
cnt = a[i] / N;
a[i] %= N;
for (int j = 0; j < i; j++) {
a[j] += cnt;
}
for (int j = i + 1; j < N; j++) {
a[j] += cnt;
}
ans += cnt;
}
}
}
cout << ans;
}
|
#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 MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e18;
int main(){
ll H,W;
cin >> H >> W;
ll ans = INF;
FOR(i,1,H){
ll s1 = i * W;
ll s2, s3;
s2 = (H-i) * (W/2);
s3 = (H-i) * (W-(W/2));
ans = min(ans, max(s1, max(s2,s3)) - min(s1, min(s2,s3)));
s2 = (H-i)/2 * W;
s3 = (H-i-(H-i)/2) * W;
ans = min(ans, max(s1, max(s2,s3)) - min(s1, min(s2,s3)));
}
ll tmp;
tmp = H; H = W; W = tmp;
FOR(i,1,H){
ll s1 = i * W;
ll s2, s3;
s2 = (H-i) * (W/2);
s3 = (H-i) * (W-(W/2));
ans = min(ans, max(s1, max(s2,s3)) - min(s1, min(s2,s3)));
s2 = (H-i)/2 * W;
s3 = (H-i-(H-i)/2) * W;
ans = min(ans, max(s1, max(s2,s3)) - min(s1, min(s2,s3)));
}
cout << ans << endl;
}
| 0 | 40,769,604 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main()
{
int n,i,j;
cin>>n;
int sum=(n*(n+1))/2;
for(i=2;i<=n;i++)
{
for(j=i;j<=n;j+=i) sum+=(j);
}
cout<<sum;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
const char C[10][6] = {
{},
{'.',',','!','?',' ', 5 },
{'a','b','c', 0 , 0 , 3 },
{'d','e','f', 0 , 0 , 3 },
{'g','h','i', 0 , 0 , 3 },
{'j','k','l', 0 , 0 , 3 },
{'m','n','o', 0 , 0 , 3 },
{'p','q','r','s', 0 , 4 },
{'t','u','v', 0 , 0 , 3 },
{'w','x','y','z', 0 , 4 },
};
int n;
cin >> n;
for(int i=0 ; i<n ; ++i ){
char s[1025];
cin >> s;
char c = 0;
int pos = -1;
for(int j=0 ; s[j] ; ++j ){
int button = s[j] - '0' ;
if( button == 0 ){
if( c != 0 ) cout << c ;
pos = -1;
c = 0;
}else{
pos++;
c = C[ button ][ pos % (int)(C[button][5]) ];
}
}
cout << endl;
}
}
| 0 | 61,922,759 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll n;
cin >> n;
string s;
cin >> s;
if(n % 2){
cout << "No";
return 0;
}
for(ll i = 0; i < n / 2; i ++){
if(s[i] != s[i+ n/2]){
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, max1 = 0, max2 = 0, pos = 0, k;
cin >> n;
for(int i = 1;i <= n;i++){
cin >> k;
if(max1 <= k){
pos = i;
max2 = max1;
max1 = k;
}else if(max2 < k){
max2 = k;
}
}
for(int i = 1;i <= n;i++){
if(pos == i){
cout << max2 << '\n';
}else{
cout << max1 << '\n';
}
}
return 0;
}
| 0 | 93,552,900 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false) ;
cin.tie(NULL) ;
int n = 0 , k = 0 ;
cin >> n >> k ;
vector<int> height(n+1), cost(n+1, INT_MAX) ;
for(int i = 1 ; i <= n ; i++)
cin >> height[i] ;
cost[1] = 0 ;
for(int i = 2 ; i <= n ; i++)
for(int j = 1 ; j <= k ; j++)
if(i-j > 0)
cost[i] = min(cost[i-j] + abs(height[i]-height[i-j]) , cost[i]) ;
cout << cost[n] ;
}
|
#include <bits/stdc++.h>
#define reg register
#define pr std::pair<ll, int>
#define fi first
#define se second
#define FIN(s) freopen(s, "r", stdin)
#define FOUT(s) freopen(s, "w", stdout)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define lep(i, l, r) for (int i = l; i < r; ++i)
#define irep(i, r, l) for (int i = r; i >= l; --i)
#define ilep(i, r, l) for (int i = r; i > l; --i)
#define Rep(i, n) rep(i, 1, n)
#define Lep(i, n) lep(i, 1, n)
#define IRep(i, n) irep(i, n, 1)
#define ILep(i, n) ilep(i, n, 1)
typedef long long ll;
typedef long double ld;
namespace modular {
const int MOD = 1000000007;
inline int add(int x, int y) { return (x += y) >= MOD ? x -= MOD : x; }
inline void inc(int &x, int y) { (x += y) >= MOD ? x -= MOD : 0; }
inline int mul(int x, int y) { return 1LL * x * y % MOD; }
inline int qpow(int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = mul(x, x))
if (y & 1)
ans = mul(ans, x);
return ans;
}
};
namespace Base {
template <typename Tp> inline Tp input() {
Tp x = 0, y = 1;
char c = getchar();
while ((c < '0' || '9' < c) && c != EOF) {
if (c == '-')
y = -1;
c = getchar();
}
if (c == EOF)
return 0;
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x *= y;
}
template <typename Tp> inline void read(Tp &x) { x = input<Tp>(); }
template <typename Tp> inline void chmax(Tp &x, Tp y) { x < y ? x = y : 0; }
template <typename Tp> inline void chmin(Tp &x, Tp y) { x > y ? x = y : 0; }
};
using namespace Base;
#define MAX_N 200007
#define V std::vector
int N;
int sz[MAX_N];
ll d[MAX_N];
pr a[MAX_N];
V<int> G[MAX_N];
std::map<ll, int> mp;
void dfs1(int x, int las) {
sz[x] = 1;
for (int y : G[x])
if (y != las) {
dfs1(y, x);
sz[x] += sz[y];
d[x] += d[y] + sz[y];
}
}
bool dfs2(int x, int las) {
if (mp[d[x]] != x)
return false;
for (int y : G[x])
if (y != las) {
d[y] = d[x] + N - 2 * sz[y];
if (!dfs2(y, x))
return false;
}
return true;
}
void solve() {
std::sort(a + 1, a + N + 1);
Rep(i, N) sz[i] = 1, mp[a[i].fi] = a[i].se;
ILep(i, N) {
int u = a[i].se, s = N - 2 * sz[u], v;
if (mp.count(a[i].fi - s)) {
v = mp[a[i].fi - s];
sz[v] += sz[u];
G[u].push_back(v);
G[v].push_back(u);
} else
return puts("-1"), void();
}
dfs1(1, 0);
if (!dfs2(1, 0))
return puts("-1"), void();
Rep(i, N) {
for (int j : G[i])
if (i < j)
printf("%d %d\n", i, j);
}
}
int main() {
#ifdef LOCAL
FIN("in");
#endif
read(N);
Rep(i, N) read(a[i].fi), a[i].se = i;
solve();
return 0;
}
| 0 | 86,744,919 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = pow(double (x1 - x2), 2);
double y = pow(double (y1 - y2), 2);
double dis = sqrt(double (x + y));
printf("%lf\n", dis);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#define LL long long
#define ull unsigned long long
#define PI acos(-1.0)
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pLL pair<LL,LL>
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define SQR(a) ((a)*(a))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))
#define vi vector <int>
#define vL vector <LL>
#define LB(a,x) (lower_bound(all(a),x)-a.begin())
#define UB(a,x) (upper_bound(all(a),x)-a.begin())
#define prec(n) fixed << setprecision(n)
#define MEM(a,x) memset(a,x,sizeof(a))
#define SORT(v) sort(v.begin(),v.end())
#define REV(v) reverse(v.begin(),v.end())
#define Unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,b) for(int i=0;i<b;i++)
#define IT(it,x) for(it=x.begin();it!=x.end();it++)
vector<int>v;
int main()
{
int n;
cin>>n;
int cnt=0;
double s=0;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
s=a[0];
for(int i=1; i<n; i++)
{
s+=a[i];
s=s/2;
}
cout<<prec(10)<<s;
}
| 0 | 18,586,874 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define uniq(v) v.erase(unique(v.begin(),v.end()),v.end())
#define lb(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define ub(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
using Pair = pair<ll,pair<int,int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod=1000000007;
const ld pi=acos(-1.0);
const ll INF = 1LL<<61;
template<class T>bool chmax(T &a, const T &b) {
if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) {
if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
int ans=0;
for(int i=a;i<=b;i++){
string s=to_string(i);
if(s[0]==s[4]&&s[1]==s[3]) ans++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX_N 50
int v[MAX_N];
int n;
int k;
int favour_left[MAX_N][MAX_N + 1];
int favour_right[MAX_N][MAX_N + 1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
int i;
for(i = 0; i < n; ++i){
cin >> v[i];
}
int j;
for(i = 1; i <= n; ++i){
priority_queue<int, vector<int>, greater<int> > q;
int max_sum = 0;
for(j = 0; j < i; ++j){
max_sum += v[j];
q.push(v[j]);
}
favour_left[i - 1][i] = max_sum;
for(j = i; j < n; ++j){
if(v[j] > q.top()){
max_sum -= q.top();
q.pop();
max_sum += v[j];
q.push(v[j]);
}
favour_left[j][i] = max_sum;
}
}
for(i = 1; i <= n; ++i){
priority_queue<int, vector<int>, greater<int> > q;
int max_sum = 0;
for(j = 0; j < i; ++j){
max_sum += v[n - 1 - j];
q.push(v[n - 1 - j]);
}
favour_right[i - 1][i] = max_sum;
for(j = i; j < n; ++j){
if(v[n - 1 - j] > q.top()){
max_sum -= q.top();
q.pop();
max_sum += v[n - 1 - j];
q.push(v[n - 1 - j]);
}
favour_right[j][i] = max_sum;
}
}
int max_favour = 0;
int p, q;
for(i = 0; i < n; ++i){
for(p = i + 1; p >= 0; --p){
int op_left = i + 1 + (i + 1 - p);
if(op_left > k){
break;
}
max_favour = max(max_favour, favour_left[i][p]);
}
}
for(j = 0; j < n; ++j){
for(q = j + 1; q >= 0; --q){
int op_right = j + 1 + (j + 1 - q);
if(op_right > k){
break;
}
max_favour = max(max_favour, favour_right[j][q]);
}
}
for(i = 0; i < n; ++i){
for(j = 0; j < n && i + j + 1 < n; ++j){
for(p = i + 1; p >= 0; --p){
int op_left = i + 1 + (i + 1 - p);
if(op_left > k){
break;
}
for(q = j + 1; q >= 0; --q){
int op_right = j + 1 + (j + 1 - q);
if(op_left + op_right > k){
break;
}
max_favour = max(max_favour, favour_left[i][p] + favour_right[j][q]);
}
}
}
}
cout << max_favour << '\n';
return 0;
}
| 0 | 99,967,570 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i,a,b) for (int i=(a); i < (b); ++i)
#define FORR(i,a,b) for (int i=(a); i > (b); --i)
#define FOR_ALL(i,c) for (__typeof((c).begin()) i=(c).begin(); \
i != (c).end(); ++i)
#define FOR_ALLR(i,c) for (__typeof((c).rbegin()) i=(c).rbegin(); \
i != (c).rend(); ++i)
#define SZ(array) (sizeof(array)/sizeof(array[0]))
#define lc(x) (x<<1)
#define rc(x) (x<<1 | 1)
#define lowbit(x) (x & (-x))
typedef long long LL;
typedef map<int,int> MII;
typedef pair<int,int> PII;
typedef set<int> SI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<int> VI;
typedef vector<string> VS;
template <class C>
inline bool in_(const typename C::key_type& k, const C& A)
{ return A.find(k) != A.end(); }
inline bool in_(const string& s, const string& S)
{ return S.find(s) != string::npos; }
const int maxn = 1e5+5;
int A[maxn],B[maxn];
int main()
{
int N,K;
while (cin >> N >> K) {
LL ans = 0;
FOR(i,0,N) {
cin >> A[i] >> B[i];
if ((A[i]&K) == A[i])
ans += B[i];
}
FORR(i,30,0) {
const int x = 1<<i;
LL res = 0;
if (K & x) {
const int mask = (K^x) | (x-1);
FOR(i,0,N) if ((mask&A[i]) == A[i])
res += B[i];
}
ans = max(ans,res);
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
const int kNil = -1;
enum class Color {
kWhite,
kGrey,
kBlack,
};
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_type w;
bool operator<(const Edge<T> & rhs) const {
if (w != rhs.w) { return w < rhs.w; }
if (u != rhs.u) { return u < rhs.u; }
return v < rhs.v;
}
};
template <class Edge>
void DFSVisitTopological(const typename vector<Edge>::size_type node_now,
typename vector<Edge>::size_type & time,
const vector<vector<Edge>> & adjacency_list,
vector<int> & d,
vector<int> & f,
vector<Color> & color,
vector<int> & parent,
vector<typename vector<Edge>::size_type> & result) {
color[node_now] = Color::kGrey;
d[node_now] = time++;
for (const auto & e: adjacency_list[node_now]) {
if (color[e.v] == Color::kWhite) {
parent[e.v] = node_now;
DFSVisitTopological(e.v, time, adjacency_list, d, f, color, parent, result);
}
}
color[node_now] = Color::kBlack;
f[node_now] = time++;
result.push_back(node_now);
}
template <class Edge>
vector<typename vector<Edge>::size_type> DFSTopological(
const vector<Edge> & edges,
typename vector<Edge>::size_type node_num) {
using size_type = typename vector<Edge>::size_type;
vector<vector<Edge>> adjacency_list(node_num, vector<Edge>());
for (const auto & e: edges) {
adjacency_list[e.u].push_back(e);
}
vector<int> d(node_num);
vector<int> f(node_num);
vector<Color> color(node_num, Color::kWhite);
vector<int> parent(node_num);
vector<size_type> result;
size_type time = 0;
for (unsigned i = 0; i < node_num; ++i) {
if (color[i] == Color::kWhite) {
DFSVisitTopological(i, time, adjacency_list, d, f, color, parent, result);
}
}
reverse(result.begin(), result.end());
return result;
}
int main(int argc, char const *argv[]) {
using w_type = unsigned;
vector<Edge<w_type>> edges;
unsigned V, E;
cin >> V >> E;
for (unsigned i = 0; i < E; ++i) {
unsigned u, v;
w_type w;
cin >> u >> v;
edges.emplace_back(u, v, 1);
}
auto result = DFSTopological(edges, V);
for (const auto & e: result) {
cout << e << endl;
}
return 0;
}
| 0 | 67,081,206 |
#include<bits/stdc++.h>
using namespace std;
void c_p_c()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
int a, b;
cin >> a >> b;
int p = a * b;
if (p & 1)
cout << "Odd";
else
cout << "Even";
}
|
#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 rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int DP[105][5][2];
int main() {
string S;
int K;
cin>>S>>K;
DP[0][1][0] = 1;
DP[0][1][1] = S[0]-'1';
for(int i=1;i<S.size();++i) {
for(int j=0;j<=3;++j) {
if(S[i]=='0') {
if(j-1>=0) DP[i][j][1] = DP[i-1][j][1] + DP[i-1][j-1][1]*9;
else DP[i][j][1] = DP[i-1][j][1];
DP[i][j][0] = DP[i-1][j][0];
}
else {
if(j-1>=0) DP[i][j][1] = DP[i-1][j][1] + DP[i-1][j-1][1]*9 + DP[i-1][j][0] + DP[i-1][j-1][0]*(S[i]-'1');
else DP[i][j][1] = DP[i-1][j][1] + DP[i-1][j][0];
if(j-1>=0) DP[i][j][0] = DP[i-1][j-1][0];
}
}
DP[i][1][1] += 9;
}
cout<<DP[S.size()-1][K][1]+DP[S.size()-1][K][0]<<endl;
}
| 0 | 86,958,463 |
#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
int main(void)
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%f\n",sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2)));
}
|
#include <iostream>
#include <climits>
#include <algorithm>
using namespace std;
int main() {
long long dist[105][105];
for (int i = 0; i < 105; ++i) {
for (int j = 0; j < 105; ++j) {
dist[i][j] = INT_MAX;
if (i == j) dist[i][j] = 0;
}
}
int v, e, s, t, d;
cin >> v >> e;
for (int i = 0; i < e; ++i) {
cin >> s >> t >> d;
dist[s][t] = d;
}
for (int k = 0; k < v; ++k) {
for (int i = 0; i < v; ++i) {
for (int j = 0; j < v; ++j) {
if (dist[i][k] != INT_MAX && dist[k][j] != INT_MAX)
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
for (int i = 0; i < v; ++i) {
if (dist[i][i] < 0) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
for (int i = 0; i < v; ++i) {
for (int j = 0; j < v; ++j) {
if (dist[i][j] == INT_MAX) cout << "INF" << (j != v - 1 ? " " : "");
else cout << dist[i][j] << (j != v - 1 ? " " : "");
}
cout << endl;
}
return 0;
}
| 0 | 77,030,430 |
#include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Srep(i,a,n) for(int i = (a); i < (n); i++)
using namespace std;
int main(){
int n;
bool ans=false;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
Vsort(a);
rep(i,n-1) if(a[i] == a[i+1]) ans=true;
ans ? cout << "NO" : cout << "YES";
}
|
#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;
int ii() { int x; if (scanf("%d", &x)==1) return x; else return 0; }
long long il() { long long x; if (scanf("%lld", &x)==1) return x; else return 0; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); }
void od(double x) { printf("%.15f ", x); }
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}}
void br() { putchar('\n'); }
#define begin_end(a) a.begin(),a.end()
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; i++ )
#define rep(i,n) REP(i,0,n)
#define m_p(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define p_b push_back
#define SZ(x) ((int)(x).size)
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
int main(){
ll N = il();
ll left_min = 0;
string left_min_s;
cout << 0 << endl;
cin >> left_min_s;
if (left_min_s == "Vacant") return 0;
ll q = (0 + N-1) / 2;
cout << q << endl;
string q_s;
cin >> q_s;
if (q_s == "Vacant") return 0;
ll left_max;
string left_max_s;
if ((q+1)%2==1){
if (left_min_s != q_s){
left_max = q;
left_max_s = q_s;
left_min = 0;
left_min_s = left_min_s;
}
else{
left_max = N;
left_max_s = left_min_s;
left_min = q;
left_min_s = q_s;
}
}
else{
if (left_min_s == q_s){
left_max = q;
left_max_s = q_s;
left_min = 0;
left_min_s = left_min_s;
}
else{
left_max = N;
left_max_s = left_min_s;
left_min = q;
left_min_s = q_s;
}
}
rep(i, 18){
q = (left_min + left_max) / 2;
cout << q << endl;
cin >> q_s;
if (q_s == "Vacant") return 0;
if ((q-left_min+1)%2==1){
if (left_min_s != q_s){
left_max = q;
left_max_s = q_s;
left_min = left_min;
left_min_s = left_min_s;
}
else{
left_max = left_max;
left_max_s = left_max_s;
left_min = q;
left_min_s = q_s;
}
}
else{
if (left_min_s == q_s){
left_max = q;
left_max_s = q_s;
left_min = left_min;
left_min_s = left_min_s;
}
else{
left_max = left_max;
left_max_s = left_max_s;
left_min = q;
left_min_s = q_s;
}
}
}
}
| 0 | 63,773,377 |
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
ll n;
string s;
cin >> n >> s;
map<char,ll> m;
rep(i,n)
{
m[s[i]]++;
}
ll ans = 1;
ll mo = 1000000007;
for(auto it: m)
{
ans = ans * (it.second + 1) % mo;
}
cout << ans - 1 << endl;
return 0;
}
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
}
long long Combi::nPk_modp(long long n, long long k, long long p)
{
ll ans = 1;
for(long long i = k; i <= n; i++)
{
ans = (ans * i) % p;
}
return ans;
};
|
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define ll long long int
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0,lim-1);
return uid(rang);
}
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
const int mod = 1000000007;
int arr[100005], n, k;
int dp[100005];
int frog(int i)
{
if(i == n)
return 0;
if(dp[i] != -1)
return dp[i];
int mini = 1e9;
for(int x = i+1; x<=min(n, i+k); x++)
{
mini = min(mini, abs(arr[x] - arr[i]) + frog(x));
}
return dp[i] = mini;
}
void solve() {
cin>>n>>k;
memset(dp, -1 , sizeof(dp));
for(int i = 1; i<=n; i++)
cin>>arr[i];
cout<<frog(1)<<endl;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
solve();
return 0;
}
| 0 | 75,902,630 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n; std::cin >> n;
int x = n * 800, y = n / 15 * 200;
std::cout << x - y << "\n";
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v).begin(),(v).end()
#define COUT(x) cout<<(x)<<"\n"
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> vec(n+2,0);
REP(i,n)cin >> vec[i+1];
ll ans = 0;
for(int i=0;i<n+1;i++){
ans += abs(vec[i+1]-vec[i]);
}
for(int i=1;i<n+1;i++){
COUT(ans+abs(vec[i+1]-vec[i-1])-abs(vec[i]-vec[i-1])-abs(vec[i+1]-vec[i]));
}
return 0;
}
| 0 | 60,684,511 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
ll n; cin >> n;
map<ll, int> pf;
for (ll div = 2; div * div <= n; div++) {
while (n % div == 0) {
pf[div]++;
n /= div;
}
}
if (n > 1) pf[n]++;
int ans = 0;
for (auto &it: pf) {
int i = 1;
while (it.second - i >= 0) {
ans++;
it.second -= i++;
}
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);i++)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;i--)
#define lb lower_bound
#define ub upper_bound
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const ll mod = 1000000007;
const ll INF = 1000000099;
const ll LINF = (ll)(1e18 +99);
vector<ll> dx={-1,1,0,0},dy={0,0,-1,1};
template<typename T,typename U> void chmin(T& t, const U& u){if(t>u)t=u;}
template<typename T,typename U> void chmax(T& t, const U& u){if(t<u)t=u;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T mpow(T a, T n) {
T res = 1;
for(;n;n>>=1) {
if (n & 1) res = res * a;
a = a * a;
}
return res;
}
signed main(){
ll n,k,ans=0;cin>>n>>k;
vector<ll> a(n),b(n);
rep(i,0,n)cin>>a[i]>>b[i];
rep(i,0,32){
ll res=0,tar=k;
if((k&mpow(2ll,i))>0){
tar^=(mpow(2ll,i));
tar|=(mpow(2ll,i))-1;
cerr<<tar<<endl;
}else if(i==31){
tar=k;
}else{
continue;
}
rep(j,0,n){
if((tar|a[j])<=tar)res+=b[j];
}
ans=max(ans,res);
cerr<<ans<<endl;
}
cout<<ans<<endl;
}
| 0 | 70,249,724 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
for(int i = 1;i <= n;i++){
long long y = n/i;
ans += i * y * (y + 1) / 2;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i < n;i++)cin >> a[i];
ll money = 1000;
for(int i = 0;i < n;i++){
int st = a[i];
int now = a[i];
int j = i;
while(j < n && now <= a[j]){
now = a[j];
j++;
}
int end = a[j-1];
money += (money / st) * end - money / st * st;
i = j-1;
}
cout << money << endl;
}
| 0 | 97,270,274 |
#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>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
ll cnt[100005];
int main() {
init();
ll N,M;
cin >> N >> M;
rep(i,M){
ll a, b;
cin >> a >> b;
cnt[a]++, cnt[b]++;
}
bool isok = true;
repe(i,1,N+1){
if (cnt[i] % 2) isok = false;
}
cout << (isok ? "YES" : "NO") << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rrep(i, n) for(ll i = (ll)(n-1); i >= 0; i--)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef long long ll;
using namespace std;
ll rec(ll n,ll x){
ll res=0;
if(x==0||n==x)return 0;
if(n>2*x){
ll nn=(n-x)%x;
res=rec(nn+x,x)+3*(n-x-nn);
}
else if(n<2*x){
ll nx=x%(n-x);
res=rec(nx+n-x,nx)+3*(x-nx);
}
else {
res=3*x;
}
return res;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n,x;cin>>n>>x;
cout<<rec(n,x)<<endl;
return 0;
}
| 0 | 65,066,299 |
#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 di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
if (n%k != 0) cout << 1 << endl;
else cout << 0 << endl;
return 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) for(ll i=begin;i<=end;i++)
#define rlp(i,begin,end) for(ll i=end;i>=begin;i--)
#define prec(n) fixed<<setprecision(n)
#define initial(a,i) memset(a,i,sizeof(a))
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define F first
#define S second
#define all(a) (a).begin(),(a).end()
#define BPC(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
ll gcd(ll a,ll b) {if (a==0) return b;return gcd(b%a,a);}
ll power(ll x,ll n)
{
ll result = 1;
while (n)
{
if (n & 1)
result = result * x;
n = n / 2;
x = x * x;
}
return result;
}
void solution(ll compte)
{
string s;
cin>>s;
if(s[2]==s[3] && s[4]==s[5])
cout<<"Yes\n";
else
cout<<"No\n";
}
int main()
{
ll compte = 1;
solution(compte);
compte++;
return 0;
}
| 0 | 94,857,547 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
typedef pair<ll,pair<ll,ll>> p;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
static const int MAX_SIZE = 1 << 17;
int C[30];
int main(){
bool flagT[110000],flagA[110000];
ll A[110000],T[110000];
int N;
cin>>N;
for(int i=1;i<=N;i++){
cin>>T[i];
}
for(int i=1;i<=N;i++){
cin>>A[i];
}
for(int i=2;i<=N;i++){
if(T[i]>T[i-1]) flagT[i]=true;
else flagT[i]=false;
}
for(int i=N-1;i>=1;i--){
if(A[i]>A[i+1]) flagA[i]=true;
else flagA[i]=false;
}
flagT[1]=true;
flagA[N]=true;
ll ans=1;
for(int i=1;i<=N;i++,ans%=MOD){
if(flagA[i] && flagT[i]){
if(A[i]!=T[i]){
cout<<0<<endl;
return 0;
}
}else if(!flagA[i] && !flagT[i]){
ans*=min(A[i],T[i]);
}else{
if(flagA[i] && A[i]>T[i] || flagT[i] && T[i]>A[i]){
cout<<0<<endl;
return 0;
}
}
}
cout<<ans<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
#define rot(s, k) rotate(s.begin(), s.begin()+ s.size()-(k%s.size()), s.end());
map<int, int> yes;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<int> arr(n);
for(int i{}; i<n; i++){
int x; cin >> x;
arr[i] = x;
++yes[x];
}
ll tp = 0;
for(auto x : yes){
if(x.second)
tp += 1.0*x.second*(x.second-1)/2;
}
for(int i{}; i<n; i++){
ll p = 1.0*(yes[arr[i]])*(yes[arr[i]]-1)/2;
ll nw = 1.0*(yes[arr[i]]-1)*(yes[arr[i]]-2)/2;
cout << tp - p + nw << "\n";
}
}
| 0 | 55,174,570 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> x(N), y(M);
for (int i = 0; i < N; i++) cin >> x[i];
for (int i = 0; i < M; i++) cin >> y[i];
string ans = "War";
for (int Z = X + 1; Z <= Y; Z++) {
bool ok = true;
for (int i = 0; i < N; i++) {
if (x[i] >= Z) ok = false;
}
for (int j = 0; j < M; j++) {
if (y[j] < Z) ok = false;
}
if (ok) ans = "No War";
}
cout << ans << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
int main(){
vector<int> vec(0);
int n,k,tmp=0,ans=0;cin>>n>>k;
string s;cin>>s;
bool flag;if(s[0]=='1')flag=true;else flag=false;
for(int i=0;i<n;i++){
if(flag){
if(s[i]=='1')tmp++;
else{
vec.pb(tmp);tmp=1;flag=false;
}
}
else{
if(s[i]=='0')tmp++;
else{
vec.pb(tmp);tmp=1;flag=true;
}
}
}
vec.pb(tmp);
tmp=0;int sz=vec.size();
if(s[0]=='1'){
if(vec.size()/2<=k)ans=n;
else{
for(int i=0;i<2*k+1;i++)tmp+=vec[i];
ans=max(ans,tmp);
int pt=2*k+1;
while(pt+1<sz){
tmp-=vec[pt-2*k-1]+vec[pt-2*k];
tmp+=vec[pt]+vec[pt+1];
ans=max(ans,tmp);
pt+=2;
}
if(s[n-1]=='0'){
tmp-=vec[pt-2*k-1]+vec[pt-2*k];
tmp+=vec[pt];
ans=max(ans,tmp);
}
}
}
else{
if((vec.size()+1)/2<=k)ans=n;
else{
for(int i=0;i<2*k;i++)tmp+=vec[i];
ans=max(ans,tmp);
int pt=2*k;
bool fi=true;
while(pt+1<sz){
if(fi){
tmp-=vec[0];
fi=false;
}
else{tmp-=vec[pt-2*k]+vec[pt-2*k-1];}
tmp+=vec[pt]+vec[pt+1];
ans=max(ans,tmp);
pt+=2;
}
if(s[n-1]=='0'){
tmp-=vec[pt-2*k];
if(pt-2*k-1>=0)tmp-=vec[pt-2*k-1];
tmp+=vec[pt];
ans=max(ans,tmp);
}
}
}
cout<<ans<<endl;
}
| 0 | 83,825,795 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 1e9 + 7;
const int INF = 2e18;
signed main() {
int N;
cin >> N;
vector<int> A(N);
cin >> A;
int sum = accumulate(A.begin(), A.end(), 0LL);
int base = N * (N + 1) / 2;
if (sum % base != 0) {
cout << "NO" << endl;
return 0;
}
vector<int> dif;
for (int i = 0; i < N; i++) {
if (i == 0) dif.push_back(A[i] - A[N - 1]);
else dif.push_back(A[i] - A[i - 1]);
}
int calc = sum / base;
for (int & i : dif) i -= calc;
for (auto temp : dif) {
if (abs(temp) % N != 0 || temp > 0) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,n,maxA=0,maxAi=0,submaxA=0; cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(maxA<=a&&submaxA<=a){
submaxA=maxA;
maxA=a;
maxAi=i;
}else if(submaxA<=a){
submaxA=a;
}
}
for(int i=0;i<n;i++) cout<<(maxAi==i?submaxA:maxA)<<endl;
}
| 0 | 9,345,602 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include <fstream>
#include <cassert>
using namespace std;
typedef int i32;
typedef long long i64,ll;
typedef long double ld;
#define BR "\n"
#define ALL(c) (c).begin(),(c).end()
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,l,r) for(int i=(int)l;i<(int)(r);++i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#ifdef NDEBUG
#define DUMP(x)
#define DUMPLN(x)
#define DEBUG(x)
#define DEBUGLN(x)
#define LINE()
#define LINELN()
#define CHECK(exp,act)
#define STOP(e)
#else
#define DUMP(x) cerr << #x << " = " << (x)
#define DUMPLN(x) DUMP(x) <<endl
#define DEBUG(x) DUMP(x) << LINE() << " " << __FILE__
#define DEBUGLN(x) DEBUG(x)<<endl
#define LINE() cerr<< " (L" << __LINE__ << ")"
#define LINELN() LINE()<<endl
#define CHECK(exp,act) if(exp!=act){DUMPLN(exp);DEBUGLN(act);}
#define STOP(e) CHECK(e,true);if(!(e)) exit(1);
#endif
template<class T> inline string toString(const vector<T>& x) {
stringstream ss;
REP(i,x.size()){
if(i!=0)ss<<" ";
ss<< x[i];
}
return ss.str();
}
template<class T> inline string toString(const vector<vector<T> >& map) {
stringstream ss;
REP(i,map.size()){
if(i!=0)ss<<BR;
ss<< toString(map[i]);
}
return ss.str();
}
template<class K,class V> string toString(map<K,V>& x) {
string res;stringstream ss;
for(auto& p:x)ss<< p.first<<":" << p.second<<" ";
return ss.str();
}
string BITtoString(int bit){
stringstream ss;
while(bit!=0){ss<<(bit%2);bit/=2;}
string res=ss.str();reverse(ALL(res));
return res;
}
template<typename T,typename V> inline T pmod(T v,V MOD){
return (v%MOD+MOD)%MOD;
}
#define nextInt(n) scanf("%d",&n)
#define defInt(n) int n;nextInt(n)
#define nextLong(n) scanf("%lld",&n)
#define defLong(n) ll n;nextLong(n)
#define nextDouble(n) scanf("%lf",&n)
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
class Main{
public:
int N;
void run(){
while(true){
int W,H;cin >> W >> H;if(W==0 && H ==0)break;
vector<string> board(H);
REP(y,H)cin >> board[y];
vector<vector<bool>> passed(H,vector<bool>(W));
queue<pair<int,int>> que;
REP(y,H)REP(x,W){
if(board[y][x]=='@'){
que.push(make_pair(y,x));
}
}
int res=0;
while(!que.empty()){
pair<int,int> pos=que.front();que.pop();
if(passed[pos.first][pos.second])continue;
passed[pos.first][pos.second]=true;
res++;
REP(d,4){
int ny=pos.first+dy[d],nx=pos.second+dx[d];
if(IN(0,ny,H) && IN(0,nx,W)){
if(board[ny][nx]=='.'){
que.push(make_pair(ny,nx));
}
}
}
}
cout << res <<endl;
}
}
};
int main(){
cout <<fixed<<setprecision(15);
ios::sync_with_stdio(false);
Main().run();
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
int main(){
ll H,N;
cin >> H >> N;
vector<ll> A(N);
for(ll i = 0;i < N;i++)
cin >> A.at(i);
bool fla = false;
for(ll i = 0;i < N;i++){
if(H <= 0){
fla = true;
break;
}
H -= A.at(i);
}
if(H <= 0)
fla = true;
if(fla)
cout << "Yes" << endl;
else
{
cout << "No" << endl;
}
}
| 0 | 50,127,070 |
#include <iostream>
#include <queue>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
int dy[] = {0, 1, 0, -1};
int dx[] = {1, 0, -1, 0};
using namespace std;
int H, W, N;
char map[1003][1003];
int dist[1003][1003];
int bfs(char s, char t) {
queue<int> que_x, que_y;
rep(y, 1003) rep(x, 1003) dist[y][x] = -1;
rep(y, H) rep(x, W) {
if (s == map[y][x]) {
dist[y][x] = 0;
que_y.push(y);
que_x.push(x);
}
}
int ret = 0;
while (que_x.size()) {
int x = que_x.front();
int y = que_y.front();
que_x.pop();
que_y.pop();
if (map[y][x] == t) {
ret = dist[y][x];
break;
}
rep(k, 4) {
int ny = y + dy[k];
int nx = x + dx[k];
if (ny < 0 || H <= ny) continue;
if (nx < 0 || W <= nx) continue;
if (map[ny][nx] == 'X') continue;
if (dist[ny][nx] != -1) continue;
dist[ny][nx] = dist[y][x] + 1;
que_x.push(nx);
que_y.push(ny);
}
}
return ret;
}
void solve() {
int ans = 0;
ans += bfs('S', '1');
rep(i, N - 1) ans += bfs(i + '1', i + '2');
cout << ans << endl;
}
int main() {
cin >> H >> W >> N;
rep(y, H) cin >> map[y];
solve();
}
|
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; }
else if(k == 1) { return n; }
else return C(n-1,k-1) + C(n-1,k);
}
lint P(lint n, lint k) {
if(k == 1) { return n; }
return (n*(P(n-1,k-1)%1000000007)%1000000007);
}
int main() {
int n,m; cin >> n >> m;
string s;
vector<string> a; for(int i=0;i<n;i++) { cin >> s; a.push_back(s); }
vector<string> b; for(int i=0;i<m;i++) { cin >> s; b.push_back(s); }
for(int i=0;i+m<=n;i++) {
for(int j=0;j+m<=n;j++) {
int chk=1;
for(int k=0;k<m;k++) {
if(a[j+k].substr(i,m) != b[k]) {
chk *= 0;
break;
}
}
if(chk == 1) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
| 0 | 90,090,731 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a, b, c, C;
double S,L,h;
cin>>a>>b>>C;
h = b*sin(C/180*M_PI);
S = a * h / 2;
c = sqrt((pow(a,2)+pow(b,2) - 2 * a * b * cos(C/180*M_PI)));
L = a+b+c;
printf("%10lf\n", S);
printf("%10lf\n", L);
printf("%10lf\n", h);
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
vector<int> a(10);
for (int i = 0; i < 4; i++)
{
cin >> n;
a[n]++;
}
if (a[1] && a[4] && a[7] && a[9])
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
| 0 | 31,837,387 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, a, b, ans = 0;
cin >> n >> m;
vector<int> high(n);
vector<int> view(n,0);
vector<vector<int>> road(m,vector<int>(2));
for (int i = 0; i < n; i++) cin >> high.at(i);
for (int j = 0; j < m; j++){
cin >> a >> b;
a--;
b--;
if(high.at(a) <= high.at(b)) view.at(a)++;
if(high.at(b) <= high.at(a)) view.at(b)++;
}
for(int i = 0; i < n; i++){
if (view.at(i) == 0) ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define fix(f,n) std::fixed<<std::setprecision(n)<<f
ll mod = 1e9 + 7;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
#ifndef ONLINE_JUDGE
template<typename T>
void __p(T a) {
cout<<a;
}
template<typename T, typename F>
void __p(pair<T, F> a) {
cout<<"{";
__p(a.first);
cout<<",";
__p(a.second);
cout<<"}";
}
template<typename T>
void __p(std::vector<T> a) {
cout<<"{";
for(auto it=a.begin(); it<a.end(); it++)
__p(*it),cout<<",}"[it+1==a.end()];
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
__p(a1);
__p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cout<<name<<" : ";
__p(arg1);
cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
int bracket=0,i=0;
for(;; i++)
if(names[i]==','&&bracket==0)
break;
else if(names[i]=='(')
bracket++;
else if(names[i]==')')
bracket--;
const char *comma=names+i;
cout.write(names,comma-names)<<" : ";
__p(arg1);
cout<<" | ";
__f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" ", __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...)
#endif
struct edge{
int a, b, weight;
};
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
long long modInverse(long long a, long long m) {
if(__gcd(a, m) != 1){
throw "modular inverse does not exist.";
}
long long m0 = m;
long long y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long q = a / m;
long long t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
vector<int> sieveOfEratosthenes(int n) {
vector<int> primes;
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p])
primes.push_back(p);
return primes;
}
int add(int a, int b) {
a += b;
if (a >= mod) a -= mod;
return a;
}
int sub(int a, int b) {
a -= b;
if (a < 0) a += mod;
return a;
}
int mul(ll a, int b) {
return (a * b) % mod;
}
int pwr(int x, int e) {
int res = 1;
while (e) {
if (e & 1) {
res = mul(res, x);
}
x = mul(x, x);
e /= 2;
}
return res;
}
vector<vector<int>> adj;
vector<vector<int>> dp;
void dfs(int u, int p){
dp[u][0] = dp[u][1] = 1;
for(int v: adj[u]) if(v != p) {
dfs(v, u);
dp[u][0] = mul(dp[u][0], add(dp[v][0], dp[v][1]));
dp[u][1] = mul(dp[u][1], dp[v][0]);
}
}
void solve() {
int n;
cin >> n;
adj.resize(n);
dp.resize(n, vector<int>(2));
int u ,v;
for(int i = 0; i < n-1; i++){
cin >> u >> v;
u--;
v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(0, -1);
cout << add(dp[0][0], dp[0][1]) << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
}
| 0 | 48,877,548 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
const int MAXN = 100000 + 20, MAXM = 20, MOD = 1000 * 1000 * 1000 + 7;
const long long INF = 1e9 + 10;
int a[MAXN], d[MAXN];
vector <int> vec[MAXN];
bool ok = 0;
void dfs(int u, int par) {
int t = 1;
int cnt = 0;
for (int i = 0; i < vec[u].size(); i++) {
if (vec[u][i] != par) {
dfs(vec[u][i], u);
t += d[vec[u][i]];
if (d[vec[u][i]] % 2 == 1)
cnt++;
}
}
d[u] = t;
if (cnt > 1)
ok = 1;
}
void solve() {
int n;
cin >> n;
for (int i = 1, u, v; i < n; i++) {
cin >> u >> v;
vec[u].push_back(v);
vec[v].push_back(u);
}
dfs(1, 0);
if (n % 2 == 1)
cout << "First" << endl;
else if (ok == 1)
cout << "First" << endl;
else
cout << "Second" << endl;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
}
|
#include<bits/stdc++.h>
#define ll long long
const int N=100005;
using namespace std;
string s,t;
int main(){
cin>>s>>t;
if(s[0]<t[0]) cout<<"<";
else if(s[0]==t[0]) cout<<"=";
else cout<<">";
return 0;
}
| 0 | 75,958,707 |
#include <bits/stdc++.h>
const int MAXN = 100010;
int head[MAXN], to[MAXN << 1], nxt[MAXN << 1], tot;
void addedge(int b, int e) {
nxt[++tot] = head[b]; to[head[b] = tot] = e;
nxt[++tot] = head[e]; to[head[e] = tot] = b;
}
int dfs(int u, int b = 0, int fa = 0) {
int sc = 0;
for (int i = head[u]; i; i = nxt[i]) if (to[i] != fa)
sc += dfs(to[i], fa == 0, u);
if (sc + b > 1) std::cout << "First\n" << std::endl, exit(0);
return sc ^ 1;
}
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
int n; std::cin >> n;
for (int i = 1, t1, t2; i < n; ++i)
std::cin >> t1 >> t2, addedge(t1, t2);
for (int i = 1; i <= n; ++i) if (!nxt[head[i]]) { dfs(i); break; }
std::cout << "Second" << std::endl;
return 0;
}
|
#include <stdio.h>
int main(){
int N;
char S[N];
scanf("%d", &N);
scanf("%s", S);
int yes = 0, no = 0;
if(N % 2 == 0){
for(int i = 0; i < (N / 2); i++){
if(S[i] == S[i + (N / 2)]){
yes++;
}else{
no++;
}
}
if(yes == N / 2){
printf("Yes");
}else{
printf("No");
}
}else{
printf("No");
}
return 0;
}
| 0 | 49,609,753 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long X, long long N, std::set<long long> p)
{
ll m = INT_MAX;
ll ans = X;
for (ll i = 0; i <= 101; i++)
{
if (p.count(i) == 0)
{
if (m > abs(X - i))
{
m = abs(X - i);
ans = i;
}
}
}
cout << ans << endl;
}
signed main()
{
long long X;
scanf("%lld", &X);
long long N;
scanf("%lld", &N);
std::set<long long> p;
for (int i = 0; i < N; i++)
{
ll a;
scanf("%lld", &a);
p.insert(a);
}
solve(X, N, p);
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, x;
cin >> n >> x;
vector<int> p;
rep(i,n) {
int tmp;
cin >> tmp;
p.push_back(abs(tmp-x));
}
int d = p[0];
rep(i,n-1) {
d = __gcd(d,p[i+1]);
}
cout << d << endl;
return 0;
}
| 0 | 15,052,750 |
#include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;
const double pi = 3.14159265359;
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 5;
bool compare(const pair<int, int>&i, const pair<int, int>&j)
{
return i.second < j.second;
}
string s, t;
void solve()
{
cin >> s >> t;
cout << t << s;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1;
for (int i=1; i<=t; i++)
{
solve();
}
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <list>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void)
{
int N;
cin >> N;
int64_t a[100000];
int64_t p = 1;
for (int i = 0; i < N; ++i)
{
cin >> a[i];
if (a[i] == 0)
{
cout << 0;
return 0;
}
}
for (int i = 0; i < N; ++i)
{
if (a[i] <= 1000000000000000000/p)
{
p *= a[i];
}
else
{
cout << (-1);
return 0;
}
}
cout << p;
return 0;
}
| 0 | 17,396,359 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
ll a,b,k;cin>>a>>b>>k;
rep(i,k){
if(i%2==0){
b+=a/2;
a/=2;
}
else {
a+=b/2;
b/=2;
}
}
cout<<a<<" "<<b<<endl;
}
|
#include<iostream>
#include<deque>
using namespace std;
long long N, A, B;
int main(){
cin >> N >> A >> B;
if(A + B > N + 1 || A * B < N){
cout << -1 << endl;
return 0;
}
deque<long long> res;
int cnt = 0;
long long resid = N - (A + B - 1);
for(int b = 0; b < B - 1; b++){
int tmp = 1 + min(A - 1, resid);
for(int a = 0; a < tmp; a++){
res.push_front(cnt + tmp - a);
}
cnt += tmp;
resid -= tmp - 1;
}
for(int a = 0; a < A; a++){
res.push_front(cnt + A - a);
}
for(auto itr = res.begin(); itr != res.end(); ++itr){
cout << *itr << " ";
}
cout << endl;
}
| 0 | 11,199,363 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using P=pair<int, int>;
struct UnionFind
{
vector<int> uni;
UnionFind(int n) : uni(n, -1) {}
int root(int a)
{
if (uni[a] < 0) return a;
return uni[a] = root(uni[a]);
}
bool connect(int a, int b)
{
a = root(a);
b = root(b);
if (a == b) return false;
if (uni[a] > uni[b])
{
a ^= b;
b ^= a;
a ^= b;
}
uni[a] = uni[a] + uni[b];
uni[b] = a;
return true;
}
bool isConnect(int a, int b)
{
return root(a) == root(b);
}
int size(int a)
{
return -uni[root(a)];
}
};
signed main(void)
{
int n;
int m;
int mx;
cin >> n >> m;
UnionFind uf(n);
rep(i, m)
{
int a, b;
cin >> a >> b;
a--; b--;
if (!uf.isConnect(a, b)) uf.connect(a, b);
}
mx = 0;
rep(i, n)
mx = max(mx, uf.size(i));
cout << mx << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define INFTY (1<<30)
using namespace std;
int h,heap[22000001];
void maxheap(int i){
int l,r,lage;
l=i*2;
r=i*2+1;
lage=i;
if(l<=h&&heap[l]>heap[lage])lage=l;
if(r<=h&&heap[r]>heap[lage])lage=r;
if(lage!=i){
swap(heap[i],heap[lage]);
maxheap(lage);
}
return;
}
void increasekey(int i,int key){
if(key<heap[i])return ;
heap[i]=key;
while(i>1&&heap[i/2]<heap[i]){
swap(heap[i/2],heap[i]);
i=i/2;
}
}
void insert(int key){
h++;
heap[h]=-INFTY;
increasekey(h,key);
}
int extract(){
int maxv;
if(h<1) return -INFTY;
maxv=heap[1];
heap[1]=heap[h];
h--;
maxheap(1);
return maxv;
}
int main(){
int key;
string com;
cin >> com;
while(com!="end"){
if(com=="insert"){
scanf("%d",&key);
insert(key);
}else{
printf("%d\n",extract());
}
cin >> com;
}
return (0);
}
| 0 | 72,084,286 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using vvi=vector<vi>;
using vs=vector<string>;
int main() {
int N,A,B; cin >>N >>A >>B;
cout <<((B-A)%2==0 ? "Alice":"Borys") <<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,0,n)
#define _rrange(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define bit(n) (1LL<<(n))
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf = INT_MAX;
const ll INF = LLONG_MAX;
const ll MOD = 1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b, const ll mod=MOD) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b, const ll mod=MOD) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b, const ll mod=MOD) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b, const ll mod=MOD) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
vi H(n); cin >> H;
vector<vi> G(n);
rep(_, m){
int a, b; cin >> a >> b;
a--, b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
int res = 0;
rep(v, n){
int mx = 0;
for(auto& nv : G[v]){
chmax(mx, H[nv]);
}
if(H[v] > mx){
res++;
}
}
cout << res << endl;
return 0;
}
| 0 | 66,758,296 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
long long n, fn;
int main() {
cin >> n;
fn = 1;
for (int i = 0; n > 1; n--) {
fn *= n;
}
cout << fn << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define co(x) cout << x << '\n'
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bitcount(x) (int)__builtin_popcount(x)
#define sz(x) (int)x.size()
#define all(a) a.begin(),a.end()
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
int n,m,r;
signed main()
{
cin >> n >> m >> r ;
vi a(r);
vector <vi> dis(n+1,vi (n+1,1e9));
for (int &it: a) cin >> it ;
for (int i=1;i<=m;i++){
int x, y, c ;
cin >> x >> y >> c ;
dis[x][y] = dis[y][x] = min(dis[x][y], c) ;
}
for (int k=1;k<=n;k++) {
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++) {
dis[i][j] = min( dis[i][j], dis[i][k]+dis[k][j] ) ;
}
}
}
int ans = 1e9 ;
sort(all(a));
do {
int sum = 0;
for (int i=1;i<r;i++){
sum += dis[a[i]][a[i-1]];
}
ans = min(ans, sum) ;
}
while (next_permutation(a.begin(),a.end()));
co ( ans ) ;
return 0;
}
| 0 | 95,879,270 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#define _USE_MATH_DEFINES
#include<math.h>
#include<unordered_map>
#define min(a,b) (a)>(b)?(b):(a)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
int main()
{
vector<string> input;
while (true)
{
string s;
cin >> s;
if (s == "-")
{
break;
}
else
{
input.push_back(s);
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int r;
cin >> r;
input.back() = input.back() + input.back();
string temp;
for (int j = 0; j != input.back().size(); j++)
{
if (r <= j&&j < (input.back().size() / 2 + r))
{
temp += input.back()[j];
}
}
input.back() = temp;
}
}
}
for (auto& s : input)
{
cout << s << endl;
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namespace std;
#define mod 1000000007
int root[10001];
int getroot(int n)
{
if(root[n] == -1) return n;
else return root[n] = getroot(root[n]);
}
void unite(int x, int y)
{
x = getroot(x);
y = getroot(y);
if(x == y) return;
if(x > y) swap(x, y);
root[y] = x;
}
int main()
{
int n, q;
cin >> n >> q;
for(int i = 0; i < n; i++){
root[i] = -1;
}
for(int i = 0; i < q; i++){
int c, x, y;
cin >> c >> x >> y;
if(c == 0){
unite(x, y);
} else {
cout << (getroot(x) == getroot(y)) << endl;
}
}
return 0;
}
| 0 | 93,737,179 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
for ( int i = 0; i < N; ++i){
int c = S[i] - '0';
int c2 = i % 2;
if ( c != c2 ) ++ans;
}
int ans2 = 0;
for ( int i = 0; i < N; ++i){
int c = S[i] - '0';
int c2 = (i+1) % 2;
if ( c != c2 ) ++ans2;
}
cout << min(ans,ans2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= int(a); i--)
#define WRAP(y, x, h, w) (0 <= y && y < h && 0 <= x && x < w)
#define ALL(x) (x).begin(), (x).end()
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
int main()
{
int n, p;
string s;
cin >> n >> p >> s;
if (p == 2 || p == 5) {
ll ans = 0;
REP(i, n)
{
if ((s[i] - '0') % p == 0) {
ans += (i + 1);
}
}
cout << ans << endl;
return 0;
}
vector<ll> amari(p, 0);
amari[0] = 1;
ll a = 0;
ll ten = 1;
REP(i, n)
{
a += (s[n - 1 - i] - '0') * ten;
a %= p;
amari[a]++;
ten = (ten * 10) % p;
}
ll ans = 0;
REP(i, p)
{
ans += amari[i] * (amari[i] - 1) / 2;
}
cout << ans << endl;
}
| 0 | 18,408,737 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)
vector<vector<int>> edges;
int dfs(int i,int p = -1) {
int g = 0;
for (int& j : edges[i]) if (j != p) {
g ^= dfs(j,i)+1;
}
return g;
}
int main() {
int n;
cin >> n;
edges.resize(n);
for (int i = 0;i < n-1;++i) {
int u,v;
cin >> u >> v;
u--;v--;
edges[u].push_back(v);
edges[v].push_back(u);
}
cout << (dfs(0) ? "Alice" : "Bob") << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define IO if(fopen("input.txt","r")) freopen("input.txt","r",stdin),freopen("output.txt","w",stdout)
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define mii map<ll,ll>
#define ff first
#define ss second
#define fill(a,b) memset(a, b, sizeof(a))
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define max3(a,b,c) max(c,max(a,b))
#define min3(a,b,c) min(c,min(a,b))
#define print2d(dp,n,m) for(int i=0;i<=n;i++){for(int j=0;j<=m;j++)cout<<dp[i][j]<<" ";cout<<"\n";}
const long long M = 100005, inf = 2000000000000000000;
using namespace std;
void solve(){
ll a[M],b[M],c[M],dp[M],dp2[M],dp3[M];
ll n,i;
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i]>>b[i]>>c[i];
}
dp[1]=a[1];
dp2[1]=b[1];
dp3[1]=c[1];
for(i=2;i<=n;i++){
dp[i]=a[i]+max(dp2[i-1],dp3[i-1]);
dp2[i]=b[i]+max(dp[i-1],dp3[i-1]);
dp3[i]=c[i]+max(dp[i-1],dp2[i-1]);
}
cout<<max3(dp[n],dp2[n],dp3[n])<<endl;
return;
}
signed main(){
IO;
boost;
ll t;
t=1;
while(t--){
solve();
}
}
| 0 | 46,752,692 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p) cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v) cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v) cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m) cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m) cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
void solve(){
int a[3];
FOR(3) cin >> a[i];
sort(a,a+3);
cout << a[0] + a[1];
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf=vector<vector<int>>;
using Graf_l=vector<list<int>>;
Graf g(200010);
vector<ll> x(200010,0);
vector<bool> vis(200010,false);
void dfs(int p,ll y){
if(vis[p]==true){
return;
}
vis[p]=true;
x[p]+=y;
if(g[p].empty()){
return;
}
rep(i,g[p].size()){
dfs(g[p][i],x[p]);
}
return;
}
int main()
{
int n,q;
cin >> n >> q;
int a,b;
ll p,val;
rep(i,n-1){
cin >> a >> b;
g[a-1].push_back(b-1);
g[b-1].push_back(a-1);
}
rep(i,q){
cin >> p >> val;
x[p-1]+=val;
}
dfs(0,0);
rep(i,n){
cout << x[i] << " ";
}
cout << endl;
}
| 0 | 78,138,877 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(x) cout << #x << " = " << (x) << endl
#define vuni(v) v.erase(unique(v.begin(), v.end()), v.end());
#define mins(m, s) m.insert(make_pair(s, 1));
#define mfin(m, s) m.find(s) != m.end()
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
if(ans >= 0) {
cout << ans << endl;
} else {
cout << 0 << endl;
}
return 0;
}
|
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
llong ans=0;
for(int i=0; i<=25; i++){
for(int j=0; j<=25; j++){
if(i*4+j*7==N){
ans++;
}
}
}
if(ans>0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
| 0 | 48,193,232 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
long a,b;
cin>>a>>b;
double z;
long x = a/b;
long y = a%b;
z = (double)a/(double)b;
cout<<x<<" "<<y<<" "<<fixed << setprecision(8)<<z<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 1'000'000 + 1;
int main() {
int n;
cin >> n;
vector<int> a(n), p(MX);
for (int &i : a) {
cin >> i;
p[i]++;
}
int pw = 1;
for (int i = 2; i < MX; i++) {
int cnt = 0;
for (int j = i; j < MX; j += i) cnt += p[j];
if (cnt > 1) {
pw = 0;
break;
}
}
if (pw) {
cout << "pairwise coprime" << endl;
return 0;
}
int g = 0;
for (int i : a) g = gcd(g, i);
if (g == 1) {
cout << "setwise coprime" << endl;
} else {
cout << "not coprime" << endl;
}
return 0;
}
| 0 | 93,917,158 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main(){
int N;
cin >> N;
int max_n = 0;
for(int i = 0; i < 7; i++){
if(pow(2, i) <= N) max_n = max(max_n, (int)pow(2, i));
}
cout << max_n << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
} else {
return 0;
}
}
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
const ll INF = 1LL<<60;
int H, W;
vector<string> fi;
ll solve() {
vector<vector<ll>> dp(H, vector<ll>(W, INF));
if (fi[0][0] == '#') dp[0][0] = 1;
else dp[0][0] = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
for (int dir = 0; dir < 2; dir++) {
int ni = i + dx[dir], nj = j + dy[dir];
if (ni >= H || nj >= W) continue;
int add = 0;
if (fi[ni][nj] == '#' && fi[i][j] == '.') add = 1;
chmin(dp[ni][nj], dp[i][j]+add);
}
}
}
return dp[H-1][W-1];
}
int main() {
cin >> H >> W;
fi.resize(H);
for (int i = 0; i < H; i++) {
cin >> fi[i];
}
cout << solve() << endl;
}
| 0 | 55,996,517 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
#include <climits>
using namespace std;
int main(){
long long a, b;
cin >> a >> b;
cout << 98 << ' ' << 99 << endl;
a--, b--;
for(int i = 0; i < 49; ++i){
for(int j = 0; j < 99; ++j){
if(!(i % 2) || !(j % 2) || !b){
cout << '.';
}
else{
cout << '#';
b--;
}
}
cout <<endl;
}
for(int i = 0; i < 49; ++i){
for(int j = 0; j < 99; ++j){
if(!(i % 2) || !(j % 2) || !a){
cout << '#';
}
else{
cout << '.';
a--;
}
}
cout <<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>>board(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++)cin >> board.at(i).at(j);
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (board.at(i).at(j) == '.')continue;
bool up = false, left = false, right = false, down = false;
if (i != 0)if (board.at(i - 1).at(j) == '#')up = true;
if (j != 0)if (board.at(i).at(j - 1) == '#')left = true;
if (j != w - 1)if (board.at(i).at(j + 1) == '#')right = true;
if (i != h - 1)if (board.at(i + 1).at(j) == '#')down = true;
if (!(up || left || right || down)) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
| 0 | 87,255,154 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,b,c,x;
while(cin>>n>>a>>b>>c>>x,n||a||b||c||x){
vector<int> y(n);
for(int i=0;i<n;i++) cin>>y[i];
int cnt=0,idx=0;;
while(true){
if(x==y[idx]) idx++;
if(idx==n) break;
cnt++;
if(cnt>10000) break;
x = (a*x+b)%c;
}
if(cnt>10000) cout<<-1<<endl;
else cout<<cnt<<endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
while (true) {
ll cnt = 0;
for (int i = 0; i < n; i++) {
cnt += a[i] / n;
a[i] = a[i] % n - a[i] / n;
}
ans += cnt;
bool flag = true;
for (int i = 0; i < n; i++) {
a[i] += cnt;
if (a[i] >= n) flag = false;
}
if (flag) break;
}
cout << ans << "\n";
return 0;
}
| 0 | 84,430,301 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
#define mp make_pair
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
ll N; scanf("%lld", &N);
ll ans = 0;
for (ll i = 1; i * i <= N; i++){
if (N % i != 0) continue;
ll a = i, m = N / i - 1;
if (a < m) ans += m;
}
printf("%lld\n", ans);
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
const int INF = 1001001001;
const long long LINF = 1001002003004005006ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,k;
cin >> n >> k;
int a[n];
rep(i,n)cin >> a[i];
ll s[n+1];
s[0]=0;
rep(i,n)s[i+1]=s[i]+a[i];
rep(i,n+1)s[i]-=i;
rep(i,n+1){
s[i]%=k;
}
map<int,int> mp;
ll ans = 0;
rep(i,n+1){
if(i<k){
ans += mp[s[i]];
mp[s[i]]++;
}else{
mp[s[i-k]]--;
ans += mp[s[i]];
mp[s[i]]++;
}
}
cout << ans << endl;
}
| 0 | 42,190,148 |
#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>
#include <iomanip>
using namespace std;
int main()
{
int64_t N, Y, mm, gg, sen;
cin >> N >> Y;
Y /= 1000;
for (int man = 0; man <= N; man++)
{
mm = man * 10;
for (int gosen = 0; gosen <= N - man; gosen++)
{
gg = gosen * 5;
sen = N - man - gosen;
if (mm + gg + sen == Y)
{
cout << man << " " << gosen << " " << sen << endl;
return 0;
}
}
}
cout << "-1 -1 -1" << endl;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
ll ft(ll a, ll b) {
return (a + ((a % b) ? (b - a % b) : 0)) / (b);
}
int main() {
int K; cin >> K;
ll A[K]; rep(i, K) cin >> A[i];
ll L = 2, R = 3;
bool ok = true;
for(int i = K - 2; i >= 0; --i) {
ll mult = ft(L, A[i]) * A[i];
if(L <= mult && mult <= R) {
L = mult;
R = ll(R / A[i]) * A[i] + A[i] - 1;
} else {
ok = false;
break;
}
}
if(A[K - 1] != 2) ok = false;
if(ok) cout << L << ' ' << R << endl;
else cout << -1 << endl;
}
| 0 | 89,066,102 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
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) { a = b; return true; } return false; }
void Main(){
string n;
cin >> n;
REP(i, n.size()) {
if (n[i] == '7') {
cout << "Yes" << en;
return;
}
}
cout << "No" << en;
return;
}
int main(void){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
int t=1;
REP(_,t) Main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[100005],bas[65];
bool b[65];
int main()
{
int n;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%lld",&arr[i]);
for (int j=60;j>=0;j--)
{
if (arr[i]&(1LL<<j))
b[j]^=1;
}
}
long long ans=0;
for (int i=0;i<=60;i++)
{
if (b[i])
{
ans+=(1LL<<i);
for (int j=0;j<n;j++)
{
if (arr[j]&(1LL<<i))
arr[j]^=(1LL<<i);
}
}
}
for (int i=0;i<n;i++)
{
for (int j=60;j>=0;j--)
{
if (arr[i]&(1LL<<j))
arr[i]^=bas[j];
}
for (int j=60;j>=0;j--)
{
if (arr[i]&(1LL<<j))
{
bas[j]=arr[i];
break;
}
}
}
long long mx=0;
for (int i=60;i>=0;i--)
{
if (!(mx&(1LL<<i)))
mx^=bas[i];
}
printf("%lld ",ans+2*mx);
}
| 0 | 75,174,556 |
#include <iostream>
#include <vector>
#include <array>
#include <set>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <list>
#include <stack>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include <bitset>
#include <cctype>
#include <iomanip>
#include <limits>
#include <regex>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef long long ll;
ll gcd ( ll a, ll b ) { if ( b == 0 ) return a; else return gcd ( b, a%b ); }
ll lcm ( ll a, ll b ) { return a * b / gcd(a, b); }
int main (void) {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int A, B, C; std::cin >> A >> B >> C;
if ( C >= A && C <= B ) std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
struct Edge
{
int to;
ll cost;
Edge(int t, ll w) : to(t), cost(w) {}
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, int>;
void dijkstra(const Graph &G, int s, vector<ll> &dis, vector<int> &prev)
{
int N = G.size();
dis.resize(N, INF);
prev.resize(N, -1);
priority_queue<P, vector<P>, greater<P>> pq;
dis[s] = 0;
pq.emplace(dis[s], s);
while (!pq.empty())
{
P p = pq.top();
pq.pop();
int V = p.second;
if (dis[V] < p.first)
{
continue;
}
for (auto &e : G[V])
{
if (dis[e.to] > dis[V] + e.cost)
{
dis[e.to] = dis[V] + e.cost;
prev[e.to] = V;
pq.emplace(dis[e.to], e.to);
}
}
}
}
int main(){
int n;
cin >> n;
Graph G(n);
rep(i, n-1)
{
int a, b;
ll c;
cin >> a >> b >> c;
a--;
b--;
G[a].push_back(Edge(b, c));
G[b].push_back(Edge(a, c));
}
int q,k;
cin >> q >> k;
vector<ll> mincost;
vector<int> prev;
k--;
dijkstra(G, k, mincost, prev);
rep(i, q)
{
int x, y;
cin >> x >> y;
x--;
y--;
cout << mincost[x] + mincost[y] << endl;
}
return 0;
}
| 0 | 6,871,963 |
#include<iostream>
using namespace std;
#define ll long long
#include<bits/stdc++.h>
#define mod 1000000007
void grid(ll int n,ll int m,string s[])
{
ll int dp[n+1][m+1];
memset(dp, 0, sizeof(dp));
int f=0;
for(int i=0;i<m;i++)
{
if(s[0][i]=='#')
f=1;
if(f==0)
dp[0][i]=1;
}
f=0;
for(int i=0;i<n;i++)
{
if(s[i][0]=='#')
f=1;
if(f==0)
dp[i][0]=1;
}
for(ll int i=1;i<n;i++)
{
for(ll int j=1;j<m;j++)
{
if(s[i][j]=='#')
dp[i][j] = 0;
else
dp[i][j] = (dp[i-1][j]%mod + dp[i][j-1]%mod)%mod;
}
}
cout<<dp[n-1][m-1]%mod<<endl;
}
int main()
{
ll int n,m;
cin>>n>>m;
string s[n];
for(ll int i=0;i<n;i++)
cin>>s[i];
grid(n,m,s);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
int main() {
string s,t;
cin>>s>>t;
int n=s.size();
vector<ll> v(26,-1);
vector<ll> r(26,-1);
bool ok=true;
rep(i,n){
int s1=s[i]-'a';
int t1=t[i]-'a';
if (v[s1]>=0) {
if (v[s1]!=t1){
ok=false;
break;
}
}
if (r[t1]>=0) {
if (r[t1]!=s1){
ok=false;
break;
}
}
v[s1]=t1;
r[t1]=s1;
}
if (ok==true)cout<<"Yes";
else cout<<"No";
}
| 0 | 1,062,133 |
#include <iostream>
using namespace std;
int main(){
long K;
long a[50];
cin >> K;
cout << 50 << endl;
for(int i = 0; i < 50; i++){
if(i >= 50 - K%50) a[i] = i+1;
else a[i] = i;
a[i] += K/50;
cout << a[i] << ' ';
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n; cin>>n;
vector<int> v(n);
rep(i,n) cin>>v[i];
int cnt=0;
for(int i=1; i<n-1; i++){
if(v[i-1]==v[i]&&v[i]==v[i+1]) {cnt++; v[i]=0;}
}
for(int i=0; i<n-1; i++){
if(v[i]==v[i+1]) {cnt++; v[i]=-1;}
}
cout<<cnt<<endl;
}
| 0 | 29,878,008 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool to_I[200000];
bool to_N[200000];
int main() {
int N, M;
cin >> N >> M;
int a, b;
for (int i=0; i<M; i++) {
cin >> a >> b;
if (a == 1) to_I[b] = true;
if (b == 1) to_I[a] = true;
if (a == N) to_N[b] = true;
if (b == N) to_N[a] = true;
}
string ans = "IMPOSSIBLE";
for (int i=2; i<N; i++) {
if (to_I[i] && to_N[i]) ans = "POSSIBLE";
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int A[N];
int d[N] = {0};
for(int i=0;i<N;i++){
cin>>A[i];
d[A[i]-1] += 1;
}
int size = 0;
for(int i=0;i<N;i++){
if(d[i]!=0){
size+=1;
}
}
int kakikae = 0;
if (K-size>=0){
}
else{
sort(d,d+N);
for(int i=N-size;i<N-K;i++){
kakikae += d[i];
}
}
cout<<kakikae<<endl;
}
| 0 | 55,030,895 |
#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(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
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; }
int main()
{
int N, M;
cin >> N >> M;
vi A(N);
int sum = 0;
rep(i, N) {
cin >> A[i];
sum += A[i];
}
sort(ALL(A));reverse(ALL(A));
rep(i, M)
{
if(A[i]*4*M < sum)
{
cout << "No" << endl;return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll sum = 0;
for (auto x : arr) sum += x;
ll mid1 = sum / n, mid2 = mid1 + 1;
ll ans = 0;
for (int i = 0; i < n; i++) ans = ans + (arr[i] - mid1) * (arr[i] - mid1);
ll temp = 0;
for (int i = 0; i < n; i++) temp = temp + (arr[i] - mid2) * (arr[i] - mid2);
cout << min(ans, temp) << endl;
}
| 0 | 31,307,022 |
#include<bits/stdc++.h>
using namespace std;
int k[15],s[15][15];
int p[15];
int n,m;
int ans;
int check(int x){
for(int i=0;i<m;i++){
int l=0;
for(int j=0;j<k[i];j++){
l^=((x>>s[i][j])&1);
}
if(l!=p[i])
return 0;
}
return 1;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d",&k[i]);
for(int j=0;j<k[i];j++){
scanf("%d",&s[i][j]);
s[i][j]--;
}
}
for(int i=0;i<m;i++)
scanf("%d",&p[i]);
ans=0;
for(int i=0;i<(1<<n);i++){
if(check(i))
ans++;
}
cout<<ans<<"\n";
}
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld ;
using namespace std;
class DSU {
public :
vector<int> par ;
vector<int> r ;
int ans = 0 ;
DSU(int n) {
par.assign(n+1,0) ;
r.assign(n+1,0) ;
for(int i = 0 ; i <= n ; ++i) {
par[i] = i ;
r[i] = 1 ;
}
}
int get(int n) {
return par[n] = (par[n] ==n ? n : get(par[n])) ;
}
void set_union(int a, int b) {
a = get(a) ;
b = get(b) ;
if(a == b)
return ;
if(r[a] > r[b]) {
swap(a,b) ;
}
par[b] = a ;
r[a] += r[b] ;
ans = max(ans , r[a]) ;
ans = max(ans , r[b]) ;
}
};
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n , m ;
cin >> n >> m ;
DSU fr(n) ;
int a, b ;
while(m--) {
cin >> a >> b ;
fr.set_union(a,b) ;
}
int ans = 0 ;
for(int i = 1 ; i <= n ; ++i)
ans = max(ans, fr.r[i]) ;
cout << ans << "\n" ;
return 0 ;
}
| 0 | 57,831,038 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).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& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
int N, A;
cin >> N >> A;
cout << N * N - A << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<stdlib.h>
#include<utility>
#include<functional>
#include<cfenv>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vint vector<ll>
#define vvint vector<vint>
#define P pair<ll,ll>
#define INT_MAX 2147483647
#define MOD 1000000007
#define PI 3.14159265358979323846
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
#define MAX 1000000000000
int main(void) {
ll n; cin >> n; n--;
string s; cin >> s;
map<char, ll> mp;
ll ng=0;
rep(i, s.size()) {
mp[s[i]]++;
}
for (ll i = 1; i <= n / 2; i++) {
for(ll j = 0; j <= n - 2 * i; j++) {
if (s[j] != s[j + i] && s[j + i] != s[j + 2 * i] && s[j] != s[j + 2 * i]) {
ng++;
}
}
}
cout << mp['R'] * mp['G'] * mp['B'] - ng << endl;
return 0;
}
| 0 | 3,695,706 |
#include <iostream>
#include <iomanip>
int main(){
using namespace std;
int a = 0;
int b = 0;
cin >> a >> b;
int d = a / b;
int r = a % b;
double f = static_cast<double>(a) / static_cast<double>(b);
cout << d << " " << r << " " << fixed << setprecision(5) << f << endl;
return 0;
}
|
#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>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using vecll = vector<ll>;
using boost::irange;
int main()
{
ll h,w,n;
cin>>h>>w>>n;
map<ll,set<ll>> table;
for(ll i:irange(0l,n)) {
int a,b;
cin>>a>>b;
table[a].insert(b);
}
vecll cnt(10, 0);
for(auto itr = begin(table); itr != end(table); ++itr) {
ll r = itr->first;
if (r < 3) continue;
vecint sc;
auto itr2 = itr;
while (itr2 != begin(table) && itr2->first >= r-2) --itr2;
if (itr2->first < r-2) ++itr2;
auto last = next(itr);
for (auto itr3 = itr2; itr3 != last; ++itr3) {
for (auto& c : itr3->second) {
sc.push_back(max(1l,c-2));
sc.push_back(max(1l,c-1));
sc.push_back(c);
sc.push_back(min(w,c+1));
sc.push_back(min(w,c+2));
}
}
boost::sort(sc);
sc.erase(unique(begin(sc),end(sc)), end(sc));
int mw = sc.size();
map<int,int> mi;
for(int i:irange(0,mw)) {
mi[sc[i]] = i;
}
ll lastr = min(r+2, h);
if (last != end(table)) {
lastr = min(lastr, last->first-1);
}
int mh = lastr - (r-2) + 1;
vector<vector<bool>> pmat(mh, vector<bool>(mw));
for (auto itr3 = itr2; itr3 != last; ++itr3) {
int mr = itr3->first - (r-2);
for (auto& c: itr3->second) {
pmat[mr][mi[c]] = true;
}
}
for (int i:irange(0,mh-2)) {
for (int j:irange(0,mw-2)) {
int num = 0;
for (int ki:irange(0,3)) {
for (int kj:irange(0,3)) {
if (pmat[i+ki][j+kj]) ++num;
}
}
++cnt[num];
}
}
}
ll total = (h-2)*(w-2);
ll rem = 0;
for(int i:irange(1,10)) rem += cnt[i];
cnt[0] = total - rem;
for(auto ans:cnt) {
cout<<ans<<endl;
}
return 0;
}
| 0 | 89,536,467 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int A,B,K; cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
if(A%2==1)A--;
A/=2;
B+=A;
}
else{
if(B%2==1)B--;
B/=2;
A+=B;
}
}
cout<<A<<" "<<B<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FAST_IO std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n) fixed << setprecision(n)
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define eb emplace_back
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(a) a.size()
#define len(a) a.length()
#define pi acos(-1.0)
#define g_sin(a) sin(a*pi/180)
#define g_cos(a) cos(a*pi/180)
#define g_tan(a) tan(a*pi/180)
#define ms0(a) memset(a, 0, sizeof(a));
#define ms1(a) memset(a, 1, sizeof(a));
#define msn1(a) memset(a, -1, sizeof(a));
#define msinf(a) memset(a, 0x3f3f3f, sizeof(a));
const int mod1 = 998244353, mod = 1e9+7;
const int MAXN = 1e5 + 5, MAX_M = 2e5 + 5;
#define int long long
int d[MAXN], pos[MAXN], n;
int par[MAXN], sz[MAXN], subd[MAXN];
map<int, int> orc;
bool comp(const int &a, const int &b){
return d[a] > d[b];
}
void Solve() {
cin >> n;
for (int i = 1; i <= n; i++){
cin >> d[i]; pos[i] = i;
orc[d[i]] = i;
}
sort(pos+1, pos+n+1, comp);
for (int i = 1; i < n; i++){
sz[pos[i]] ++;
int parD = d[pos[i]] - n + 2*sz[pos[i]];
if (parD >= d[pos[i]] || !orc.count(parD)){
cout << "-1";
return;
}
par[pos[i]] = orc[parD];
sz[par[pos[i]]] += sz[pos[i]];
subd[par[pos[i]]] += subd[pos[i]] + sz[pos[i]];
}
if (subd[pos[n]] != d[pos[n]]){
cout << -1;
return;
}
for (int i = 1; i < n; i++){
cout << pos[i] << ' ' << par[pos[i]] << endl;
}
}
signed main(){
FAST_IO;
int TC = 1;
while(TC--) Solve();
return 0;
}
| 0 | 51,124,089 |
#include<iostream>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
bool reverse=true;
if(a=='H'){
reverse=false;
}
if(reverse){
cout<<(b=='H'?'D':'H');
}
else{
cout<<b;
}
}
|
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int type_ref, type_mic, type_dis;
cin >> type_ref >> type_mic >> type_dis;
vector<int> price_ref(type_ref);
int mp_ref = 100100;
rep(i, type_ref)
{
cin >> price_ref[i];
mp_ref = min(mp_ref, price_ref[i]);
}
vector<int> price_mic(type_mic);
int mp_mic = 100100;
rep(i, type_mic)
{
cin >> price_mic[i];
mp_mic = min(mp_mic, price_mic[i]);
}
int min_amount = mp_ref + mp_mic;
rep(i, type_dis)
{
int target_ref, target_mic, discount;
cin >> target_ref >> target_mic >> discount;
if (target_ref > type_ref || target_mic > type_mic) continue;
int _min_amount = price_ref[target_ref-1] + price_mic[target_mic-1] - discount;
min_amount = min(min_amount, _min_amount);
}
cout << min_amount << endl;
return 0;
}
| 0 | 56,288,784 |
#include<iostream>
using namespace std;
int main(){
int str[10000],i;
str[1]=1;
for(int i=1;i<i+1;i++){
cin>>str[i];
if(str[i]==0){
for(int a=1;a<i;a++){
cout<<"Case "<<a<<": "<<str[a]<<endl;
}
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define sint(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(i,v.size())cout<<" "<<v[i];cout<<endl
#define sset(s) cout<<#s<<":";each(i,s)cout <<" "<<i;cout<<endl
using namespace std;
typedef pair<int,int>P;
const int MAX_N = 100005;
int main()
{
map<char,int> mp;
mp['q'] = 1,mp['w'] = 1,mp['e'] = 1,mp['r'] = 1,mp['t'] = 1,mp['a'] = 1,mp['s'] = 1,mp['d'] = 1,mp['f'] = 1;
mp['g'] = 1,mp['z'] = 1,mp['x'] = 1,mp['c'] = 1,mp['v'] = 1,mp['b'] = 1;
while(1){
string s;
cin >> s;
if(s == "#"){
break;
}
int ans = 0;
int bf = mp[s[0]];
rep(i,s.length()-1){
if(mp[s[i+1]] != bf){
bf = mp[s[i+1]];
ans++;
}
}
cout << ans << "\n";
}
}
| 0 | 61,835,720 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.