code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,b,c;
string s,t,q;
cin>>a>>b;
cout<<a+(b-a)*2<<"\n";
return(0);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll k; cin >> k;
queue<ll> que;
rep(i, 9) que.push(i+1);
ll cnt = 0, x = 0;
while(cnt != k){
x = que.front(); que.pop();
if(x%10 != 0) que.push(10*x + x%10 - 1);
que.push(10*x + x%10);
if(x%10 != 9) que.push(10*x + x%10 + 1);
cnt++;
}
cout << x << endl;
return 0;
}
| 0 | 20,790,307 |
#include <iostream>
using namespace std;
#include <string>
#include <cctype>
int main() {
int pTarou = 0, pHanako = 0, n;
string sTarou, sHanako;
cin >> n;
for (int i = 0; i < n; i++){
cin >> sTarou >> sHanako;
if (sTarou > sHanako) pTarou += 3;
else if (sTarou < sHanako) pHanako += 3;
else if (sTarou == sHanako){
pTarou++;
pHanako++;
}
}
cout << pTarou << " " << pHanako << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
int k = 0;
REP(i, S.size()) {
if (S[i] == ')') {
if (0 == k) {
S.insert(S.begin(), '(');
k++;
i++;
}
k--;
} else {
k++;
}
}
k = 0;
for (int i = S.size()-1; i >= 0; i--) {
if (S[i] == '(') {
if (0 == k) {
S.push_back(')');
k++;
}
k--;
} else {
k++;
}
}
cout << S << endl;
}
| 0 | 49,491,231 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define INF_LL 1LL << 60
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); 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; }
void put_double(double obj){printf("%.12f\n",obj);};
template < typename T > std::string to_string( const T& n )
{
std::ostringstream stm ;
stm << n ;
return stm.str() ;
}
int main()
{
int N,M,X,Y;
cin >> N >> M >> X >> Y;
vector<int> x(N);
vector<int> y(M);
rep(i,N) cin >> x[i];
rep(i,M) cin >> y[i];
sort(all(x));
sort(all(y));
REP(i,X+1,Y+1)
{
if(x[x.size()-1] < i && i <= y[0] )
{
cout << "No War" << endl;
return 0;
}
}
cout << "War" << endl;
}
|
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
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;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main(){
ll N,H,W;
cin >> N>>H>>W;
ll x,y;
ll ans = 0;
rep(i,N){
cin >> x>>y;
if(x >= H && y >= W)ans++;
}
cout << ans << endl;
}
| 0 | 81,106,650 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int len = s.size();
bool ok = true;
if(s.at(0) != 'A') ok = false;
int cntc = 0;
for(int i = 1; i < len; i++){
if(isupper(s.at(i))){
if(i == 1 || i == len - 1 || s.at(i) != 'C') ok = false;
if(s.at(i) == 'C') cntc++;
}
}
if(cntc != 1) ok = false;
if(ok) cout << "AC" << endl;
else cout << "WA" << endl;
}
|
#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 vs = vector<string>;
using vvs = vector<vs>;
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);
struct Edge {
Edge(int f, int t, int c) : from(f), to(t), cost(c) {}
int from, to, cost;
};
int n, m; std::cin >> n >> m;
vvi to(n, vi(n, inf)), cost;
vector<Edge> edges;
rep(i, n) to[i][i] = 0;
rep(i, m) {
int a, b, c; std::cin >> a >> b >> c;
--a, --b;
to[a][b] = to[b][a] = c;
edges.pb(Edge(a, b, c));
}
cost = to;
rep(k, n) rep(i, n) rep(j, n) chmin(cost[i][j], cost[i][k] + cost[k][j]);
set<int> used;
rep(i, n) srep(j, i+1, n) {
rep(k, m) {
int a = edges[k].from, b = edges[k].to;
if (cost[i][a]+to[a][b]+cost[b][j] == cost[i][j])
used.insert(k);
if (cost[i][b]+to[a][b]+cost[a][j] == cost[i][j])
used.insert(k);
}
}
std::cout << m-(int)used.size() << "\n";
}
| 0 | 76,147,023 |
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define mod(x) ((x % MOD) + MOD) % MOD
#define int long long int
#define rep(i, a, n) for(int i = a; i < n; ++i)
#define rrep(i, a, n) for(int i = n-1; i >= a; --i)
using namespace std;
typedef pair<int,int> P;
const int INF = 1e18;
const int MOD = 1e9+7;
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;
}
struct edge {
int to, diff;
};
bool dfs(vector<int>& x, vector< vector<edge> >& G, vector<bool>& used, int i) {
rep(j, 0, G[i].size()) {
edge e = G[i][j];
if (used[e.to]) {
if (x[i] + e.diff != x[e.to]) {
return false;
}
} else {
used[e.to] = true;
x[e.to] = x[i] + e.diff;
if (!dfs(x, G, used, e.to)) {
return false;
}
}
}
return true;
}
signed main()
{
int N, M;
cin >> N >> M;
vector< vector<edge> > G(N, vector<edge>());
int l, r, d;
rep(i, 0, M) {
cin >> l >> r >> d;
l--; r--;
G[l].push_back(edge{ r, -d });
G[r].push_back(edge{ l, d });
}
vector<int> x(N);
vector<bool> used(N, false);
rep(i, 0, N) {
if (!used[i]) {
x[i] = 0;
used[i] = true;
if (!dfs(x, G, used, i)) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define EPS (1e-7)
#define INF 1e18
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define PI (acos(-1))
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define rep(i, init, n) for(int i = init; i <(int)(n); i++)
int main() {
ll N, M;
cin >> N >> M;
if ((N % 2) == 1){
REP(i, M){
cout << (i + 1) << " " << (N - i - 1) << endl;
}
}else{
vector<P> v;
int i = 1;
while(v.size()<M+1){
v.push_back(P(i, N + 1 - i));
v.push_back(P(N / 2 - i, N / 2 + i));
i++;
}
REP(i, M) cout << v[i].first << " " << v[i].second << endl;
}
return 0;
}
| 0 | 25,820,194 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, p;
cin >> n >> p;
int odd = 0, evn = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a & 1) {
odd++;
} else {
evn++;
}
}
ll ans;
if (p) {
if (!odd) {
ans = 0;
} else {
ans = 1LL << (n - 1);
};
} else {
if (!odd) {
ans = 1LL << n;
} else {
ans = 1LL << (n - 1);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define REV(v) reverse(v.begin(), v.end())
#define ITER(v) for (auto itr = v.begin(), itr != v.end(); ++itr)
#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()
#define SZ(v) (int)v.size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> memo(N);
REP(i, M) {
int a, b;
cin >> a >> b;
--a;
--b;
memo[a]++;
memo[b]++;
}
string res = "YES";
REP(i, N) if (memo[i] % 2) res = "NO";
cout << res << endl;
return 0;
}
| 0 | 99,953,145 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
vector<vector<char>> a(H,vector<char>(W));
for (int i=0; i<H; i++){
for (int j=0; j<W; j++){
cin>>a.at(i).at(j);
}
}
vector<int> i_remove;
vector<int> j_remove;
for (int i=0; i<H; i++){
bool flag=false;
for (int j=0; j<W; j++){
if (a.at(i).at(j)=='#'){
flag=true;
}
}
if (!flag){
i_remove.push_back(i);
}
}
for (int j=0; j<W; j++){
bool flag=false;
for (int i=0; i<H; i++){
if (a.at(i).at(j)=='#'){
flag=true;
}
}
if (!flag){
j_remove.push_back(j);
}
}
for (int i=0; i<H; i++){
bool flag_i=false;
for (int j=0; j<W; j++){
if ((find(i_remove.begin(),i_remove.end(),i)!=i_remove.end())||(find(j_remove.begin(),j_remove.end(),j)!=j_remove.end())){
} else {
cout<<a.at(i).at(j);
flag_i=true;
}
}
if (flag_i){
cout<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
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 N, K, A[105];
ll DP[105][int(1e5+5)], sum[105][int(1e5+5)];
int main(){
cin >> N >> K;
for (int i = 1; i <= N; i++) cin >> A[i];
DP[0][K] = 1;
sum[0][K] = 1;
for (int i = 1; i <= N; i++){
DP[i][0] = sum[i-1][A[i]];
for (int j = 1; j <= K; j++){
int M = min(j+A[i], K);
DP[i][j] = (sum[i-1][M] - sum[i-1][j-1]) % MOD;
if (DP[i][j] < 0) DP[i][j] += MOD;
}
sum[i][0] = DP[i][0];
for (int j = 1; j <= K; j++){
sum[i][j] = (sum[i][j-1] + DP[i][j]) % MOD;
}
}
cout << DP[N][0] << endl;
return 0;
}
| 0 | 99,874,884 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
int gcd(int x,int y){
if(y==0) return x;
return gcd(y,x%y);
}
int dis2(int x1,int y1,int x2,int y2){
return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
int main(){
ll n;cin>>n;
vector<int> ans;
ll m=1;
while(!((m-1)*m/2<n&&n<=m*(m+1)/2)) m++;
while(n>0){
if(n<=m){
ans.push_back(n);
break;
}else{
ans.push_back(m);
n-=m;
m--;
}
}
sort(ans.begin(),ans.end());
for(int i=0;i<(int)ans.size();i++){
cout<<ans[i]<<endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
void Main() {
long long N;
cin >> N;
map<long long, long long> bars;
for (long long i = 0; i < N; ++i) {
long long A;
cin >> A;
if (bars.count(A) == 0) {
bars.insert(make_pair(A, 0));
}
++bars[A];
}
long long longLength = 0;
long long shortLength = 0;
for (map<long long, long long>::const_reverse_iterator rit = bars.rbegin(); rit != bars.rend(); ++rit) {
long long n = rit->second;
long long length = rit->first;
if (n >= 4 && longLength == 0) {
longLength = length;
shortLength = length;
break;
}
if (n >= 2) {
if (longLength == 0) {
longLength = length;
continue;
}
else if (shortLength == 0) {
shortLength = length;
break;
}
}
}
long long s = longLength * shortLength;
cout << s << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 0 | 37,653,081 |
#include <iostream>
#include <cstdio>
using namespace std;
int n;
int head[200010], to[400010], nxt[400010], cnt;
inline void AddEdge (int u, int v) { ++cnt, to[cnt] = v, nxt[cnt] = head[u], head[u] = cnt; }
long long ans;
inline void Dfs (int u, int p) {
for (int e = head[u]; e; e = nxt[e]) {
int v = to[e];
if (v == p) continue;
if (v < u) ans += 1ll * v * (u - v);
else ans += 1ll * (v - u) * (n - v + 1);
Dfs (v, u);
}
}
int main () {
scanf ("%d", &n);
for (int i = 1; i < n; ++i) {
int u, v; scanf ("%d%d", &u, &v);
AddEdge (u, v), AddEdge (v, u);
}
Dfs (1, 0);
printf ("%lld\n", ans + n);
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int j,l;
l = s.length();
bool i = false;
if( s[2]==s[3] )
if( s[4]==s[5] ){
cout<<"Yes"<<endl;
i = true;
}
if(i==false)
cout<<"No"<<endl;
}
| 0 | 85,601,376 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
using v_int = std::vector<int>;
using v2_int = std::vector<v_int>;
using v_ll = std::vector<ll>;
using v2_ll = std::vector<v_ll>;
using v_string = std::vector<std::string>;
using v_bool = std::vector<bool>;
using v2_bool = std::vector<v_bool>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
const double PI = 3.1415926535897932;
const int INF = 2*(int)1e9;
const ll LINF = (ll)1e18;
const ll MOD = 1000000007;
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
using namespace std;
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p)
{
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
is >> v[i];
}
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
os << v[i];
if(i != len-1) { os << ","; }
}
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
int n;
cin >> n;
v_ll a(n);
cin >> a;
irep(i, n-1) {
a[i+1] += a[i];
}
mll mp;
for(auto sum : a) {
mp[sum]++;
}
ll ans = 0;
for(auto sum : mp) {
if(sum.se >= 1) {
ans += sum.se*(sum.se-1)/2;
if(sum.fi == 0) { ans += sum.se; }
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
ll N;
vector<ll> prime;
ll ans = LINF;
vector<ll> prime_factor(ll N) {
vector<ll> res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
while (N % a == 0) {
N /= a;
res.push_back(a);
}
}
if (N != 1) res.push_back(N);
return res;
}
int main() {
cin >> N;
ll ans = LINF;
for (ll i = 1; i*i <= N; i++) {
if(N % i == 0){
ll left = i;
ll right = N / i;
ans = min(ans,left+right-2);
}
}
cout << ans << endl;
}
| 0 | 93,089,467 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,m,p;
while((cin>>n>>m>>p)&&(n|m|p!=0)){
vector<int> x(n);
int sum=0;
for(int i=0;i<n;i++){
cin >> x[i];
sum += x[i];
}
if(x[m-1]==0) cout << 0 << endl;
else{
int haitou=(sum*(100-p))/x[m-1];
cout << haitou << endl;
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int cnt, a[23][23];
void dfs(int x, int y){
cnt++;
a[x][y] = 1;
if(!a[x + 1][y]) dfs(x + 1, y);
if(!a[x - 1][y]) dfs(x - 1, y);
if(!a[x][y + 1]) dfs(x, y + 1);
if(!a[x][y - 1]) dfs(x, y - 1);
return;
}
int main(){
while(1){
int i, j, w, h, si, sj;
char in;
cin >> w >> h;
if(w == 0)break;
cnt = 0;
for(i = 0; i <= h + 1; i++){
a[i][0] = a[i][w + 1] = 1;
}
for(j = 0; j <= w + 1; j++){
a[0][j] = a[h + 1][j] = 1;
}
i = 1;
j = 1;
while(i <= h){
while(j <= w){
cin >> in;
if(in == '.'){
a[i][j] = 0;
j++;
}else if(in == '#'){
a[i][j] = 1;
j++;
}else if(in == '@'){
si = i;
sj = j;
a[i][j] = 1;
j++;
}
}
i++;
j = 1;
}
dfs(si, sj);
cout << cnt << endl;
}
return 0;
}
| 0 | 32,477,094 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
using namespace std;
int main() {
int n;
float v[51];
cin >> n;
for(int i = 0; i < n; i ++){
cin >> v[i];
}
sort(v,v+n);
for(int i = 1; i < n; i ++){
v[0] = (v[0] + v[1])/2;
v[1] = 10000;
sort(v,v+n);
}
cout << v[0];
return 0;
}
|
# include <iostream>
using namespace std;
int main(){
int a, b, c;
int count;
cin >> a >> b >> c;
if (a != b && b != c && a != c){
count = 3;
}
else {
if ((a == b && b != c) || (a == c && c != b) || (b == c && c != a)){
count = 2;
}
else{
count = 1;
}
}
cout << count << endl;
}
| 0 | 41,719,551 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<ll> X(N);
REP(i, 0, N) cin >> X[i];
int L; cin >> L;
int k = 1; while ((1 << k) < N) k++;
int next[k][N] = {};
REP(i, 0, N) {
int idx = upper_bound(ALL(X), X[i] + L) - X.begin() - 1;
next[0][i] = idx;
}
REP(i, 0, k - 1) {
REP(j, 0, N) {
if (next[i][j] < 0) {
next[i + 1][j] = -1;
} else {
next[i + 1][j] = next[i][next[i][j]];
}
}
}
int Q; cin >> Q;
while (Q--) {
int a, b; cin >> a >> b; a--; b--;
if (a > b) swap(a, b);
int ans = 0;
for (int i = k - 1; i >= 0; i--) {
if (next[i][a] < b) {
ans += (1 << i);
a = next[i][a];
}
}
cout << ans + 1 << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1) a--;
b += a / 2;
a /= 2;
}
else {
if (b % 2 == 1) b--;
a += b / 2;
b /= 2;
}
}
cout << a << " " << b << endl;
return 0;
}
| 0 | 78,200,478 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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 = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int main(){
int l;
cin >> l;
double x = (double)l / 3;
cout << fixed << setprecision(12) << x * x * x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
int x=-1,y=-1,z=-1;
bool can = false;
for(int i=0;i<=N;i++){
for(int j=0;j<=N;j++){
int k = N-i-j;
if(10000*i+5000*j+1000*k==Y && k>=0){
x=i;
y=j;
z=k;
can=true;
}
if(can==true){
break;
}
}
if(can==true){
break;
}
}
cout << x << ' ' << y << ' ' << z << endl;
return 0;
}
| 0 | 80,837,137 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n,m; cin >> n >> m;
int a,b;
priority_queue<int, vector<int>, less<int>> pq;
vector<pair<int, int>> t;
rep(i,n) {
cin >> a >> b;
t.push_back({m-a,b});
}
sort(t.begin(), t.end());
ll ans = 0;
int pqlen = 0;
for (int i = m-1; i >= 0; i--) {
while (n > 0 && i == t[n-1].first) {
pq.push(t[n-1].second);
t.pop_back();
n--;
pqlen++;
}
if (pqlen > 0) {
ans += pq.top();
pq.pop();
pqlen--;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define REV(v) reverse(v.begin(), v.end())
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#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())
#define SZ(v) (int)v.size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, D;
cin >> H >> W >> D;
vector<vector<int>> A(H, vector<int>(W));
vector<P> invA(H * W);
REP(i, H) {
REP(j, W) {
cin >> A[i][j];
A[i][j]--;
invA[A[i][j]] = P(i, j);
}
}
vector<int> dp(H * W);
REP(d, D) {
for (int x = d; x + D < H * W; x += D) {
int i, j, k, l;
tie(i, j) = invA[x];
tie(k, l) = invA[x + D];
dp[x + D] = dp[x] + abs(i - k) + abs(j - l);
}
}
int Q;
cin >> Q;
REP(q, Q) {
int L, R;
cin >> L >> R;
--L;
--R;
cout << dp[R] - dp[L] << endl;
}
return 0;
}
| 0 | 92,425,960 |
#include <stdio.h>
int main() {
int piece;
int apple;
scanf("%i %i", &apple, &piece);
int applepie;
applepie = (apple*3 + piece)/2;
printf("%i\n", applepie);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;
const int N = 1e5+5;
void solve(){
int n;
cin>>n;
ll ans=0;n--;
for (int i = 1; i <=n; ++i){
ans+=(n/i);
}
cout<<ans<<'\n';
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int T=1;
while(T--){
solve();
}
return 0;
}
| 0 | 81,151,793 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define Fast_Input ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<int,null_type,greater<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
int const fx[]= {+1,+0,-1,+1};
int const fy[]= {-1,+1,+0,+0};
const int inf = numeric_limits<int>::max();
const int mx=1e9;
const int mod=1e9+7;
int main()
{
int n,i;
cin >> n;
vector<int>v(n);
for(i=0;i<n;i++)cin >> v[i];
ll prev=v[0],sum=0;
for(i=1;i<n;i++)
{
if(v[i]<prev)
{
sum+=(prev-v[i]);
}
else
prev=v[i];
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("abc170/abc170_b.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int X, Y;
cin >> X >> Y;
rep(i, X + 1) {
if (2 * i + 4 * (X - i) == Y) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| 0 | 86,711,155 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int n,m=1;
int push = -1;
cin >> n;
vector<int> btn(n+1, 0);
for (int i = 0; i < n; i++) cin >> btn.at(i+1);
for (int i = 0; i < n; i++)
{
m = btn.at(m);
if (m == 2)
{
push = i + 1;
break;
}
}
cout << push << endl;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
for(;;) {
int n, m, p;
cin >> n >> m >> p;
if(n == 0) break;
m--;
int s = 0;
int mx = 0;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
s += x;
if(i == m) {
mx = x;
}
}
s *= (100-p);
cout << (mx == 0 ? 0 : (s/mx)) << endl;
}
return 0;
}
| 0 | 41,488,933 |
#include <bits/stdc++.h>
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 lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL<<61;
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; }
ll jou(ll N, ll P){if(P==0) return 1;
if(P%2==0){ll t = jou(N, P/2);return t*t % mod;
}return (N * jou(N, P-1)) % mod;}
int main() {
int n,m;
cin >> n >> m;
vector<ll> p(n,0);
rep(i,2*m){
int x;
cin>>x;
p[x-1]++;
}
rep(i,n){
if(p[i]%2==1){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
int main(void){
while(true){
int m,n,p;
cin>>m>>n>>p;
if(m==0 && n==0 && p==0)break;
int total=0;
int winnum=0;
for(int i=0;i<m;i++){
int x;
cin>>x;
total+=x;
if(i==n-1)winnum=x;
}
total*=100;
total=total*(100-p)/100;
if(winnum!=0){
int ans=(int)total/winnum;
cout<<ans<<endl;
}
else cout<<0<<endl;
}
return 0;
}
| 0 | 61,408,118 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void){
double n,m,d;
cin >> n >> m >> d;
if (d==0.0) printf("%.12lf\n",(m-1)/n);
else printf("%.12lf\n",(n-d)*2*(m-1)/(n*n));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[105],freq[105];
int main() {
int x ,n,element;
cin>>x>>n;
for(int i=0;i<n;i++){
cin>>element;
freq[element]++;
}
if(freq[x]==0){
cout<<x<<endl;
return 0;
}
for(int i=0,j=0;i<=101;i++){
if(freq[i]==0){
arr[j]=i;
j++;
}
}
sort(arr,arr+105);
int low = *lower_bound(arr,arr+105,x);
int mini = low-x;
int ans = low;
for(int i=0;i<x;i++){
if(freq[i]==0){
if(x-i<=mini){
ans=i;
}
}
}
cout<<ans<<endl;
return 0;
}
| 0 | 6,295,135 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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 long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n;
int ans=0;
cin >>n;
cout<<(n+110)/111*111<<endl;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
signed main() {
int W, H;
cin >> W >> H;
vector<int> p(W);
REP(i, W) cin >> p[i];
vector<int> q(H);
REP(i, H) cin >> q[i];
sort(ALL(p));
sort(ALL(q));
p.emplace_back(INF);
q.emplace_back(INF);
int cnt = H+W;
int ans = 0;
int cntp = H+1;
int cntq = W+1;
int pp = 0, qq = 0;
while(cnt--){
if(p[pp] <= q[qq]){
cntq--;
ans += cntp*p[pp]; pp++;
}else{
cntp--;
ans += cntq*q[qq]; qq++;
}
}
cout << ans << endl;
return 0;
}
| 0 | 34,576,799 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF LLONG_MAX
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;
#define ARRAY_MAX 5005
int main(){
ll n;
while(cin >> n,n){
vector<ll> arr(ARRAY_MAX,0);
REP(i,n){
cin >> arr[i+1];
}
arr[0] = 0;
REP(i,n){
arr[i+1] += arr[i];
}
ll maxi = -INF;
for(int i = n;i >= 0;i--){
for(int j = 0;j < i;j++){
maxi = max(maxi,arr[i]-arr[j]);
}
}
cout << maxi << endl;
}
return 0;
}
|
#include <iostream>
void p(int a, int b, int c) {
std::cout << a << ' ' << b << ' ' << c << std::endl;
}
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a > b) {
if (b > c) {
p(c, b, a);
} else {
if (a > c) {
p(b, c, a);
} else {
p(b, a, c);
}
}
} else {
if (b > c) {
if (a > c) {
p(c, a, b);
} else {
p(a, c, b);
}
} else {
p(a, b, c);
}
}
}
| 0 | 11,347,849 |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
using namespace std;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define REP(i,n) for(ll i=0;i<n;i++)
#define REPR(i,n) for(ll i=n-1;i>=0;i--)
typedef long long ll;
#define INF 1e18
int main(){
ll x,y;
cin>>x>>y;
ll lcm=0;
ll a=x,b=y,r=1;
while(b!=0){
r=a%b;
a=b;
b=r;
}
lcm=x/a*y;
for(ll i=0;i<=lcm;i+=x){
if(i%y!=0){
cout<<i<<endl;
return 0;
}
}
cout<<-1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.length();
vector<char> S;
for (int i = 0; i < n; i++) {
if (s[i] == 'B' && S.size() > 0) {
S.pop_back();
} else if (s[i] != 'B') {
S.push_back(s[i]);
}
}
for (int i = 0; i < S.size(); i++) {
cout << S[i];
}
cout << endl;
return 0;
}
| 0 | 92,249,751 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=998244353;
signed main(){
ll n;cin>>n;
vector<ll>a(1LL<<n);
rep(i,1LL<<n)cin>>a[i];
vector<ll>ma1(1LL<<n);
vector<ll>ma2(1LL<<n);
REP(i,1,1LL<<n){
for(int j=i;;j=(j-1)&i){
if(a[j]>=ma1[i]){
ma2[i]=ma1[i];
ma1[i]=a[j];
}else if(a[j]>=ma2[i]){
ma2[i]=a[j];
}
if(j==0)break;
}
}
ll ans=0;
REP(i,1,1LL<<n){
ans=max(ans,ma1[i]+ma2[i]);
cout<<ans<<endl;
}
}
|
#include <iostream>
using namespace std;
int main(){
int N;
long long ans=0, c1=0, c2=0, K;
cin >> N >> K;
int A[N];
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N-1; i++){
for(int j=i+1; j<N; j++){
if(A[i] > A[j]){
c1++;
}
}
}
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
if(A[i] > A[j]){
c2++;
}
}
}
long long m1 = K;
long long m2 = (K * (K - 1) / 2) % 1000000007;
ans = (c1 * m1 + c2 * m2) % 1000000007;
cout << ans << endl;
}
| 0 | 78,909,282 |
#include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
return (f) (begin (ALL), end (ALL), ##__VA_ARGS__); \
}) (x)
using namespace std;
using ll = int64_t;
int main() {
set<int> AB;
REP (i, 2) {
int v;
cin >> v;
AB.insert (v);
}
set<int> ABC {1, 2, 3};
set<int> ans;
set_difference (begin (ABC), end (ABC), begin (AB), end (AB),
inserter (ans, end (ans)));
cout << *begin (ans) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define int lli
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<lli> vli;
typedef vector<pii> vii;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};
const int INF = 1e18;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
#define sz(a) int((a).size())
#define rsz resize
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define f first
#define s second
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define repD(i, a, n) for(int i = a; i >= (n); --i)
#define endl "\n"
#define spc " "
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template <typename T> T lcm(T a, T b){return (a*b)/gcd(a,b); }
void solve(){
string s, t;
cin >> s >> t;
int n = sz(s);
int ans = 0;
rep(i, n){
if(s[i] != t[i]){
ans++;
}
}
cout << ans << endl;
}
signed main(){
fastio;
solve();
return 0;
}
| 0 | 2,893,198 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
using namespace std;
bool solve(){
int a = 0;
for(int i=0;i<2;i++){
string str;
cin>> str;
int num = 1;
for(int j=0;j<str.size();j++){
char c = str[j];
if(c == 'm'){
a += num * 1000;
num = 1;
}else if(c == 'c'){
a += num * 100;
num = 1;
}else if(c == 'x'){
a += num * 10;
num = 1;
}else if(c == 'i'){
a += num * 1;
num = 1;
}else{
num = c - '0';
}
}
}
string ans;
char c2[4] = {'m', 'c', 'x', 'i'};
for(int i=0;i<4;i++){
int n = a % 10;
char c = n + '0';
a /= 10;
if(n != 0) ans += c2[3-i];
if(n >= 2) ans += c;
}
reverse(ans.begin(), ans.end());
cout<< ans<< endl;
return true;
}
int main(){
cout.setf(ios::fixed);
cout.precision(10);
int n;
cin>> n;
for(int i=0;i<n;i++){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
const ll mod = 1000000007;
ll rui(ll p, ll k) {
if(k == 1) {
return p;
}
ll pro;
if(k % 2 == 1) {
ll r = rui(p,(k-1)/2);
pro = r * r % mod;
pro = pro * p % mod;
}
else {
ll r = rui(p,k/2);
pro = r * r % mod;
}
return pro;
}
int main() {
ll x, y;
cin >> x >> y;
if((x+y)%3) {
cout << 0 << endl;
return 0;
}
ll n = (x+y) / 3;
x -= n;
y -= n;
if(x < 0 || y < 0) {
cout << 0 << endl;
return 0;
}
ll mx, mn;
mx = max(x, y);
mn = min(x, y);
ll c, p;
c = p = 1;
rep(i,mn) {
c *= mx + mn - i;
c %= mod;
p *= mn - i;
p %= mod;
}
p = rui(p,mod-2);
cout << c * p % mod << endl;
return 0;
}
| 0 | 79,933,617 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s == "abc")
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
long long dp[100100];
int main() {
int N, M;
cin >> N >> M;
vector<int> stairs(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
stairs[a] = false;
}
for (int i = 0; i < 100100; i++) dp[i] = 0;
dp[0] = 1;
if (stairs[1]) dp[1] = 1;
for (int i = 2; i <= N; i++) {
if (!stairs[i]) continue;
dp[i] += (dp[i - 2] + dp[i - 1]) % mod;
dp[i] %= mod;
}
cout << dp[N] << endl;
}
| 0 | 82,965,952 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
ll n;
cin >> n;
vec p(n);
for(ll i=0;i<n;i++) {
cin >> p[i];
p[i]--;
}
vec a(n);
vec b(n);
for(ll i=0;i<n;i++) {
a[i]=(i+1)*30000;
b[i]=(n-i)*30000;
}
for(ll i=0;i<n;i++) {
a[p[i]]+=i;
}
for(ll i=0;i<n;i++) {
if(i!=0) {
cout << " ";
}
cout << a[i];
}
cout << endl;
for(ll i=0;i<n;i++) {
if(i!=0) {
cout << " ";
}
cout << b[i];
}
cout << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
struct card {char suzi, mozi;};
card hozon[36];
int hyozi(card hai[36],int a){
for(int i = 0;i<a-1;i++){
cout<<hai[i].mozi<<hai[i].suzi<<" ";
}
cout<<hai[a-1].mozi<<hai[a-1].suzi<<endl;
}
int kakunin(card hai[36],card hozon[36],int a){
for(int i = 0;i<a;i++){
if(hai[i].mozi != hozon[i].mozi){
cout<<"Not stable"<<endl;
return 0;
}
}
cout<<"Stable"<<endl;
return 0;
}
int bubble(card hai[36],int a){
int flag = 1;
while(flag){
flag = 0;
for(int i = a-1;i>0;i--){
if(hai[i].suzi <hai[i-1].suzi){
card o;
o = hai[i];
hai[i] = hai[i-1];
hai[i-1] = o;
flag = 1;
}
}
}
hyozi(hai,a);
cout<<"Stable"<<endl;
for(int i = 0;i<a;i++){
hozon[i] = hai[i];
}
}
int selection(card hai[36],int a){
for(int i = 0;i<a-1;i++){
int minj =i;
for(int j = i+1;j<a;j++){
if(hai[minj].suzi>hai[j].suzi){
minj = j;
}
}
card aho;
aho = hai[i];
hai[i] = hai[minj];
hai[minj] = aho;
}
hyozi(hai,a);
kakunin(hai,hozon,a);
}
int main(){
int a;
cin>>a;
card hai[a],hai2[a];
for(int i = 0;i<a;i++){
cin>>hai[i].mozi>>hai[i].suzi;
}
for(int i = 0;i<a;i++){
hai2[i] = hai[i];
}
bubble(hai,a);
selection(hai2,a);
return 0;
}
| 0 | 68,006,431 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r=0, g=0, b=0;
for (char c : s) {
if (c == 'R') ++r;
else if (c == 'G') ++g;
else if (c == 'B') ++b;
}
long long ans = (long long)r * g * b;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
int k = 2*j - i;
if (k < n) {
if (s[i] != s[j] && s[j] != s[k] && s[i] != s[k]) ans--;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#define reep(i,n,m) for(int i=(n);i<(m);i++)
#define rep(i,n) reep(i,0,n)
int main(){
int n;
while(scanf("%d",&n)!=EOF){
int ans=0;
rep(a,10){
rep(b,10){
rep(c,10){
rep(d,10){
if(a+b+c+d==n)
ans++;
}
}
}
}
printf("%d\n",ans);
}
}
| 0 | 38,922,047 |
#include <iostream>
using namespace std;
int main()
{
int n, t, c[6] = {500, 100, 50, 10, 5, 1}, i, s, m, u;
while (cin >> n && n)
{
t = 1000 - n;
m = 0;
while (t)
{
if (t >= 500) s = 0;
else if (t >= 100) s = 1;
else if (t >= 50) s = 2;
else if (t >= 10) s = 3;
else if (t >= 5) s = 4;
else s = 5;
for (i = s; i < 6; i++)
{
u = t / c[i];
m += u;
t -= c[i] * u;
}
}
cout << m << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 1e5 + 5;
int dp[maxn][21] , a[maxn] , n , L;
int ask (int x , int c)
{
int pos = x;
if (dp[pos][0] == -1) return 1e9;
for (int i = 20 ; i >= 0 ; i--){
if (c & (1 << i)){
if (pos == -1 || dp[pos][i] == -1) return 1e9;
pos = dp[pos][i];
}
}
if (pos == -1) return 1e9;
return pos;
}
void solve ()
{
for (int i = 1 ; i <= n ; i++) {
int l = 1 , r = n , mid;
while (l <= r){
mid = l + r >> 1;
if (a[mid] <= a[i] + L) l = mid + 1;
else r = mid - 1;
}
dp[i][0] = r;
}
dp[n][0] = -1;
for (int i = 1 ; i <= 20 ; i++)
for (int j = 1 ; j <= n; j++){
if (dp[j][i - 1] == -1) dp[j][i] = -1;
else dp[j][i] = dp[dp[j][i - 1]][i - 1];
}
}
int main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1 ; i <= n ; i++) cin >> a[i];
cin >> L;
solve ();
int q;cin >> q;
while (q--){
int x , y; cin >> x >> y;
if (x > y) swap(x , y);
int l = 1 , r = n;
while (l <= r){
int mid = l + r >> 1;
if (ask(x , mid) > y) r = mid - 1;
else l = mid + 1;
}
if (ask(x , r) < y) r++;
cout << r << endl;
}
return 0;
}
| 0 | 61,190,597 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b,c;
cin >> a >> b >> c;
int minimum = 100;
int maxim = max(a,max(b,c));
int maxim1 = maxim + 1;
int ans = 0;
if(maxim%2 == (a+b+c)%2){
ans = (3*maxim - (a+b+c))/2;
}
if(maxim1%2 == (a+b+c)%2){
ans = (3*maxim1 - (a+b+c))/2;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << i << " "; cerr << endl;} while(0)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool umax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool umin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}
template<typename A,size_t N,typename T> void FILL(A (&array)[N],const T &val){fill((T*)array,(T*)(array+N),val);}
template<typename T> void FILL(vector<T> &v, const T &x) {fill(v.begin(), v.end(), x);}
template<typename T> void FILL(vector<vector<T>> &v, const T &x) {for(auto &i:v)fill(i.begin(), i.end(), x);}
int n,m;
vector<int> adj[8];
bool visited[8];
int dfs(int from, int d) {
if(d == n) return 1;
int ret = 0;
for(auto u : adj[from]) if(!visited[u]) {
visited[u] = true;
ret += dfs(u, d+1);
visited[u] = false;
}
return ret;
}
int main() {
cin >> n >> m;
rep(i,m) {
int a,b; cin >> a >> b; --a, --b;
adj[a].push_back(b);
adj[b].push_back(a);
}
visited[0] = true;
cout << dfs(0, 1) << endl;
}
| 0 | 57,501,497 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int power(int x, int y){
if(y == 0){
return 1;
}else if(y % 2 == 0){
return power(x * x % MOD, y / 2) % MOD;
}else{
return (x % MOD * power(x * x % MOD, y / 2)) % MOD;
}
}
const int MI = power(2, MOD - 2);
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1;
while(tc--){
int n, k;
cin >> n >> k;
int a[n];
for(int &i : a){
cin >> i;
}
int ans = 0;
for(int i = 0; i < n; i++){
int curr = 0;
for(int j = i + 1; j < n; j++){
if(a[i] > a[j]){
curr++;
}
}
ans = (ans + (curr * k) % MOD) % MOD;
curr = 0;
for(int j = 0; j < n; j++){
if(a[i] > a[j]){
curr++;
}
}
ans = (ans + (curr * ((((k * (k - 1)) % MOD) * MI) % MOD)) % MOD) % MOD;
}
cout << ans << '\n';
}
}
|
#include <iostream>
using namespace std;
int field[20][20];
int w,h;
int bfs(int, int);
int main(){
int x,y;
while(cin>>w>>h&&w!=0&&h!=0){
for(int j=0;j<h;j++){
for(int i=0;i<w;i++){
char c;
cin >> c;
if(c=='.')field[i][j]=1;
else if(c=='#')field[i][j]=-1;
else if(c=='@'){
field[i][j]=0;
x=i;
y=j;
}
}
}
int ans=bfs(x, y);
cout << ans+1 << endl;
}
return 0;
}
int bfs(int x, int y){
int count=0;
if(y-1>=0&&field[x][y-1]==1){
field[x][y-1]=-1;
count++;
count+=bfs(x, y-1);
}
if(y+1<h&&field[x][y+1]==1){
field[x][y+1]=-1;
count++;
count+=bfs(x, y+1);
}
if(x-1>=0&&field[x-1][y]==1){
field[x-1][y]=-1;
count++;
count+=bfs(x-1, y);
}
if(x+1<w&&field[x+1][y]==1){
field[x+1][y]=-1;
count++;
count+=bfs(x+1, y);
}
return count;
}
| 0 | 8,922,289 |
#include <iostream>
#include <vector>
#include <algorithm>
#define INF 1e9
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
rep(i, R) cin >> r[i];
vector<vector<int>> dist(N, vector<int>(N, INF));
rep(i, N) dist[i][i] = 0;
rep(i, M) {
int A, B, C;
cin >> A >> B >> C;
dist[A - 1][B - 1] = C;
dist[B - 1][A - 1] = C;
}
rep(k, N) rep(i, N) rep(j, N) {
if (dist[i][j] > dist[i][k] + dist[k][j]) dist[i][j] = dist[i][k] + dist[k][j];
}
int ans = INF;
sort(r.begin(), r.end());
do {
int cost = 0;
REP(i, R) cost += dist[r[i - 1] - 1][r[i] - 1];
ans = min(ans, cost);
} while (next_permutation(r.begin(), r.end()));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,M;
cin >> N >> M;
vector<int>A(N);
int sum = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];
sum+=A[i];
}
sort(A.rbegin(),A.rend());
for(int i = 0; i < M; i++) {
if(A[i]*4*M < sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| 0 | 31,846,381 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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 long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n;
ll a,b;
ll ans=0ll;
cin >>n;
VP data(n);
rep(i,n){
cin>>a>>b;
data[i]=mp(a+b,a);
}
sort(all(data),greater<pair<ll,ll>>());
rep(i,n){
ans -= data[i].F-data[i].S;
if(i%2==0){
ans+=data[i].F;
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, V) for (int i = 0; i < V; i++)
#define repr(i, V) for (int i = V-1; i >= 0; i--)
#define repval(i, a, V) for (int i = a; i < V ; i++)
#define all(x) x.begin(), x.end()
#define ld long double
#define eps 0.0000000001
#define mod 1000000007
#define inf 1e9
#define vec vector
#define each(i, mp) for(auto& i:mp)
int N, M, R;
int res;
bool used[8];
vec<vec<int>> dist(201, vec<int>(201, inf));
vec<int> r(8);
void dfs(int c, int las, ll d){
if (c == R){
if (res > d){
res = d;
}
return;
}
rep(i, R)if(!used[i])
{
used[i] = true;
if (las == -1){
dfs(c+1, i, 0);
}else{
dfs(c+1, i, d+dist[r[las]][r[i]]);
}
used[i] = false;
}
}
int main(){
cin >> N >> M >> R;
rep(i, R){
cin >> r[i];
r[i]--;
}
rep(i, N) dist[i][i] = 0;
int a, b, c;
rep(i, M){
cin >> a >> b >> c;
a--; b--;
dist[a][b] = c;
dist[b][a] = c;
}
rep(k, N) rep(i, N) rep(j, N) {
if (dist[i][j] > dist[i][k] + dist[k][j]){
dist[i][j] = dist[i][k] + dist[k][j];
}
}
res = inf;
dfs(0,-1,0);
cout << res << endl;
}
| 0 | 12,700,987 |
#include<stdio.h>
void right_triangle(int x, int y, int z);
int main(void)
{
int n;
scanf("%d", &n);
for ( int i = 0; i <n ; ++i){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
right_triangle(a , b, c);
}
return 0;
}
void right_triangle( int x, int y, int z)
{
x *= x;
y *= y;
z *= z;
if (x == y + z|| y == z + x|| z == x + y){
printf("YES\n");
}else{
printf("NO\n");
}
}
|
#include <iostream>
#include <cstdlib>
#include <vector>
#include <math.h>
using namespace std;
int main() {
long N;
cin >> N;
long minimun = 10000;
long f = 100;
for (long i = 1; i * i < N+1; i++) {
long A = i;
long B = (long)N/A;
if (N%A != 0) {
continue;
}
long digit_A = 0;
while (A > 0) {
A = A/10;
digit_A++;
}
long digit_B = 0;
while (B > 0) {
B = B/10;
digit_B++;
}
f = digit_A;
if (f < digit_B) {
f = digit_B;
}
if (minimun > f) {
minimun = f;
}
}
cout << minimun << endl;
}
| 0 | 57,537,487 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>
using namespace std;
typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 27;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)
int main(){
string s;
while(getline(cin, s) && s != "."){
stack<char> st;
bool ok = true;
for(int i = 0; i < (int)s.size(); i++){
if(s[i] == '(') st.push(s[i]);
if(s[i] == '[') st.push(s[i]);
if(s[i] == ')'){
if(st.empty() || st.top() != '('){
ok = false;
}else{
st.pop();
}
}
if(s[i] == ']'){
if(st.empty() || st.top() != '['){
ok = false;
}else{
st.pop();
}
}
}
if(ok && st.empty()) cout << "yes" << endl;
else cout << "no" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#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 w(x) int x; cin>>x; while(x--)
#define fr(i,a,b) for(int i = a; i < b; i++)
#define mod 1000000007
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
}
vi tree[100002];
int dp[100002][2];
int independent(int src, bool is_black, int pr)
{
if (dp[src][is_black] != -1)
return dp[src][is_black];
int ans = 0, w1 = 1, w2 = 1;
for (auto child : tree[src])
{
if (child != pr)
{
w1 = (w1 * independent(child, 0, src)) % mod;
}
}
ans += w1;
if (!is_black)
{
for (auto child : tree[src])
{
if (child != pr)
{
w2 = (w2 * independent(child, 1, src)) % mod;
}
}
ans = (ans + w2) % mod;
}
return dp[src][is_black] = ans;
}
void solve()
{
int n, x, y;
cin >> n;
fr(i, 1, n)
{
cin >> x >> y;
tree[x].pb(y);
tree[y].pb(x);
}
memset(dp, -1, sizeof(dp));
cout << independent(1, 0, -1) << endl;
}
int32_t main()
{
c_p_c();
solve();
return 0;
}
| 0 | 12,231,348 |
#include<iostream>
#include<cstring>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int wa[n+1]={0};
int ac[n+1]={0};
int c=0,w=0;
while(m--){
int q;
string s;
cin>>q>>s;
if(s=="WA")wa[q]++;
else if(s=="AC" && ac[q]==0){
ac[q]++;
c++;
w+=wa[q];
}
}
cout<<c<<" "<<w;
return 0;
}
|
#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
char grid[1005][1005];
# define pii pair<int,int>
int shortestPath[1005][1005];
int R, C;
int dx[] = {-1,0,1,0};
int dy[] = {0,-1,0,1};
bool inside(int r, int c){
return 0<=r && r<R && 0<=c && c<C;
}
int bfs(){
queue<pii> q;
memset(shortestPath, -1, sizeof(shortestPath));
for(int i=0; i<R; i++){
for(int j=0; j<C; j++){
if(grid[i][j] == '#'){
shortestPath[i][j] = 0;
q.push(make_pair(i, j));
}
}
}
int ans = 0;
while(!q.empty()){
pii now = q.front(); q.pop();
int row = now.first;
int col = now.second;
ans = max(ans, shortestPath[row][col]);
for(int d = 0; d < 4; d++){
int nxr = row+dx[d];
int nxc = col+dy[d];
if(!inside(nxr, nxc)) continue;
if(shortestPath[nxr][nxc] != -1) continue;
shortestPath[nxr][nxc] = shortestPath[row][col] + 1;
q.push(make_pair(nxr, nxc));
}
}
return ans;
}
int main() {
cin >> R >> C;
for(int i=0; i<R; i++){
for(int j=0; j<C; j++){
cin >> grid[i][j];
}
}
cout << bfs() << endl;
}
| 0 | 85,993,303 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int next(int n)
{
n++;
int res = n;
int add = 1;
while(n)
{
if(n%10==4)
{
res -= add*4;
res += add*10;
n+=10;
}
add*=10;
n/=10;
}
return res;
}
int ten(int n)
{
int res = 1;
for(int i = 0;i<n;i++)
{
res*=10;
}
return res;
}
int main()
{
int n;
cin >> n;
int tn = ten(n);
int bit = 0;
int A[4];
cin >> A[1] >> A[2] >> A[3];
vector<int> l(n);
for(int i =0 ;i<n;i++)
{
cin >> l[i];
}
int ans = 1001001001;
for(int i = 0;bit<tn;i++)
{
bit = next(bit);
int B = bit;
int cnt[4]={};
int add[4]={};
int j = 0;
while(B)
{
add[B%10]+=l[j++];
cnt[B%10]++;
B/=10;
}
int cost = 0;
for(int i = 1;i<=3;i++)
{
if(cnt[i]==0)cost= 1e9;
cost += 10*max(0,cnt[i]-1);
cost += abs(add[i]-A[i]);
}
ans = min(ans,cost);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,m;
cin>>n;
m=n;
vector<ll> v;
map<ll,ll> mp;
for(int i=2;i<=sqrt(m);i++){
if(n%i==0){
if(v.empty()){
v.push_back(i);
}else{
if(*prev(v.end())!=i){
v.push_back(i);
}
}
mp[i]++;
n/=i;
i--;
}
}
if(n!=1){
v.push_back(n);
mp[n]++;
}
if(m==1){
cout<<0<<endl;
return 0;
}
if(n==m){
cout<<1<<endl;
return 0;
}
ll ans=0;
for(auto a:v){
ll c=mp[a];
for(int i=2;i<100;i++){
if(i*(i+1)/2<=c)continue;
ans+=i-1;
break;
}
}
cout<<ans<<endl;
}
| 0 | 71,329,937 |
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main(void){
int ans=0;
int sum;
int inp;
for(int i=0;i<2;i++){
sum=0;
for(int j=0;j<4;j++){
cin>>inp;
sum+=inp;
}
ans=max(ans,sum);
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define endl "\n"
#define ll long long
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cin.exceptions(cin.failbit);cout.tie(NULL);
using namespace std;
bool isPrime(int n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i += 6)
{
if ((n % i == 0) || (n % (i + 2) == 0))
return false;
}
return true;
}
int mod=1e9+7;
int32_t main()
{
int t=1;
while(t--)
{
int n,k;
cin >> n >> k;
int pref[n+1]={0};
int suf[n+1]={0};
int a[n+1];
for(int i=0;i<=n;i++)
{
a[i]=i;
pref[i]=i;
suf[n-i]=i;
}
for(int i=1;i<=n;i++)
pref[i]+=pref[i-1];
for(int i=n-1;i>=0;i--)
{
suf[n-i]+=suf[n-i-1];
}
int cnt=0;
for(int i=k-1;i<=n;i++)
{
cnt+=(abs(suf[i]-pref[i])+1);
cnt=cnt%mod;
}
cout << cnt;
}
}
| 0 | 21,968,940 |
#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>;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
rep(i,n) cin >> h[i];
ll ans = 0;
rep(i,n) {
ll t = 0;
for(ll j = i+1; j < n; j++) {
if (h[j-1] < h[j]) break;
++t;
}
ans = max(ans, t);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
vector<int>cntS[26];
vector<int>cntT[26];
signed main() {
string S,T;
cin >> S >> T;
for(int i = 0; i < S.size(); i++) {
cntS[S[i]-'a'].push_back(i);
cntT[T[i]-'a'].push_back(i);
}
bool ok = true;
for(int i = 0; i < 26; i++) {
if(cntS[i].size() == 0) {
continue;
}
if(cntS[i].size() != cntT[T[cntS[i][0]]-'a'].size()) {
ok = false;
}
else {
for(int j = 0; j < cntS[i].size(); j++) {
if(cntS[i][j] != cntT[T[cntS[i][0]]-'a'][j]) {
ok = false;
}
}
}
}
if(ok) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0 | 26,513,173 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s, t, r;
int n, a, b;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> t >> a >> b;
if (t == "print")
cout << s.substr(a, b - a + 1) << endl;
else if (t == "reverse")
reverse(s.begin() + a, s.begin() + b + 1);
else {
cin >> r;
s.replace(a, b - a + 1, r);
}
}
}
|
#include <iostream>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,n){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define pii pair<int,int>
#define PI 3.141592653589793
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
int main(){
int H,W,D; cin>>H>>W>>D;
pii p[H*W+1];
REP(i,H){
REP(j,W){
int a; cin>>a;
p[a] = make_pair(i,j);
}
}
int d[H*W+1] = {0};
for(int i=D+1; i<=H*W; ++i){
d[i] = d[i-D] + abs(p[i].first-p[i-D].first) + abs( p[i].second-p[i-D].second );
}
int Q; cin>>Q;
REP(count,Q){
int L,R; cin>>L>>R;
ll ans = d[R]-d[L];
cout << ans << "\n";
}
}
| 0 | 53,883,009 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j;
cin >> n;
vector<ll> A(n);
for(i = 0; i < n; i++) {
cin >> A[i];
}
ll ret = 0;
ll now = 0;
for(ll x : A) {
if(x % (now+1) != 0){
ret += x / (now+1);
} else {
ret += (x / (now+1)) - 1;
}
if(x == now + 1) {
now = x;
}
if(now == 0) now = 1;
}
cout << ret << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
template <class T>
void updatemax(T& a, T b) { if (b > a) a = b; }
int main() {
ull ans=1;
ll N;
cin >> N;
vector<ull> a(N);
rep(i,N) cin >> a[i];
if (find(begin(a), end(a), 0) != end(a)) {
ans = 0;
} else {
double log10 = log(10);
rep(i,N) {
ull p = ans;
ans *= a[i];
if ((log(p)+log(a[i]))/log10 > 18.000001 || ans > 1000000000000000000 || ans < p) {
cout << -1 << endl;
return 0;
}
}
}
cout << ans << endl;
return 0;
}
| 0 | 15,408,269 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
bool judge = true;
cin >> s;
for(int i = 0;i < s.size();i++){
for(int j = i + 1;j < s.size();j++){
if(s.at(i) == s.at(j))judge = false;
}
}
if(judge)cout << "yes" << endl;
else cout << "no" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+7;
int a1[N],a2[N],a3[N];
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
for(int i=0;i<a;i++){
cin>>a1[i];
}
for(int i=0;i<b;i++){
cin>>a2[i];
}
for(int i=0;i<c;i++){
cin>>a3[i];
}
ll sum = 0;
sort(a1,a1+a,greater<int>()); sort(a2,a2+b,greater<int>() ); sort(a3,a3+c,greater<int>() );
for(int i=0;i<x;i++){
sum += a1[i];
}
for(int i=0;i<y;i++){
sum += a2[i];
}
int i=x-1,j=y-1,k = 0;
while(1){
int t = k;
if(i<0&&j<0||k>=c) break;
if(i<0){
if(a2[j]<a3[k]){
sum = sum + a3[k] - a2[j];
j--; k++;
}
}
else if(j<0){
if(a1[i]<a3[k]){
sum = sum + a3[k] - a1[i];
i--; k++;
}
}
else{
if(a1[i] <= a2[j]&&a1[i]<a3[k]){
sum = sum + a3[k] - a1[i];
i--; k++;
}
else if(a2[j] <= a1[i]&&a2[j]<a3[k]){
sum = sum + a3[k] - a2[j];
j--; k++;
}
}
if(t==k) break;
}
cout<<sum<<endl;
}
| 0 | 1,422,745 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,c,k; scanf("%d%d%d",&n,&c,&k);
vector<int> T(n);
rep(i,n) scanf("%d",&T[i]);
sort(T.begin(),T.end());
int ans=0;
queue<int> Q;
rep(i,n) Q.emplace(T[i]);
while(!Q.empty()){
int t=Q.front()+k;
rep(i,c){
if(Q.empty() || t<Q.front()) break;
Q.pop();
}
ans++;
}
printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) cout << endl;
else cout << " ";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
vector<string> v = {"", ".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int q; cin >> q;
while(q > 0) {
q--;
string s; cin >> s;
vector<pair<int, int>> p;
char now = s[0];
int cnt = 1;
for(int i=1;i<(int)(s.size());++i) {
if(s[i] == now) {
cnt++;
} else {
p.push_back({now-'0', cnt});
now = s[i];
cnt = 1;
}
}
p.push_back({now-'0', cnt});
string ans = "";
for(int i=0;i<(int)(p.size())-1;++i) {
if(p[i].first != 0 && p[i+1].first == 0) {
ans.push_back(v[p[i].first][(p[i].second-1) % (int)(v[p[i].first].size())]);
}
}
cout << ans << endl;
}
}
| 0 | 27,003,679 |
#include <iostream>
#include <string>
#include <set>
using namespace std;
int
main()
{
int n;
cin >> n; cin.ignore();
set<string> dict;
for (int i = 0; i < n; i++) {
string line;
getline(cin, line);
if (line[0] == 'f') {
auto found = dict.find(line.substr(5));
cout << (found == dict.end() ? "no" : "yes") << endl;
} else {
dict.insert(line.substr(7));
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
long long int mod=1e9+7,maximum=-1;
char ar[1001][1001];
long long int getmax(long long int n,long long int m)
{
long long int i,j;
long long int dp[n+1][m+1];
for(i=0;i<n+1;i++)
dp[i][0]=0;
for(j=0;j<m+1;j++)
dp[0][j]=0;
dp[0][1]=1;
for(i=1;i<n+1;i++)
{
for(j=1;j<m+1;j++)
{
if(ar[i-1][j-1]=='#')
dp[i][j]=0;
else
{
dp[i][j]=(dp[i-1][j]+dp[i][j-1])%mod;
}
}}
return dp[n][m]%mod;
}
int main()
{
long long int n,m;
cin>>n>>m;
long long int i,j;
for( i=0;i<n;i++)
for(j=0;j<m;j++)
cin>>ar[i][j];
cout<<getmax(n,m)<<"\n";
}
| 0 | 81,355,247 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
int main() {
size_t n;
cin >> n;
set<int> st;
rep(i,n) {
int x;
cin >> x;
st.insert(x);
}
if (st.size() == n) cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,from,n) for(int i = from; i < n; i++)
#define mreps(i,from,n) for(int i = from; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x,val) x.erase(remove(ALL(x), val), x.end())
typedef long long ll;
typedef pair<ll, ll> P;
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; }
ll MOD = 1000000007;
void solve()
{
int n, m, k;
cin >> n >> m >> k;
rep(i, n+1)rep(j, m+1)
{
int b = i*m+j*n-2*i*j;
if(b == k)
{
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
return;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 0 | 4,654,214 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define P 1000000007
#define inf 1e18
int main()
{
string s;
cin >> s;
ll n = s.length();
vector<ll> v;
for (ll i = 0; i < s.length(); i++)
{
if (s[i] == 'W')
v.push_back(i + 1);
}
ll k = (v.size() * (v.size() + 1)) / 2;
for (ll i = 0; i < v.size(); i++)
k = k - v[i];
cout << -1 * k << "\n";
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s,s2;
ll k;
ll ans;
cin>>s>>k;
s2=s+s;
bool all=1;
rep(si,s.size()-1){
if(s[si]!=s[si+1]) all=0;
}
if(all){
ans=(ll)s.size() * k / 2;
}else{
vector<int> vec_s,vec_s2;
int tmp=1;
rep(si,s.size()-1){
if(s[si]==s[si+1]){
tmp++;
}else if(tmp!=1){
vec_s.push_back(tmp);
tmp=1;
}
}
if(tmp!=1){
vec_s.push_back(tmp);
}
tmp=1;
rep(si,s2.size()-1){
if(s2[si]==s2[si+1]){
tmp++;
}else if(tmp!=1){
vec_s2.push_back(tmp);
tmp=1;
}
}
if(tmp!=1){
vec_s2.push_back(tmp);
}
int ch1=0,ch2=0;
for(auto x : vec_s){
ch1+=x/2;
}
for(auto x : vec_s2){
ch2+=x/2;
}
ans=ch1+(ch2-ch1) * (k-1);
}
cout<<ans<<endl;
}
| 0 | 98,602,139 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int n;
vector<int> a;
cin >> n;
a.resize(n);
rep(i,n) cin >> a[i];
sort( a.begin(), a.end() );
cout << a[0];
for( int i=1; i<n; i++ )
cout << " " << a[i];
cout << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <stdio.h>
#include <string.h>
using ll = long long;
using namespace std;
#define int long long
#define CONTAINS(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define LOWER_BOUND(v,a) (lower_bound((v).begin(), (v).end(), (a)))
#define UPPER_BOUND(v,a) (upper_bound((v).begin(), (v).end(), (a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No"); }
void Yes() { cout << "Yes"; }
void No() { cout << "No"; }
const int MOD = 1000000007;
int m_add(int a, int b)
{
return (a + b) % MOD;
}
int m_sub(int a, int b)
{
return (a + MOD - b) % MOD;
}
int m_mul(int a, int b)
{
return (a * b) % MOD;
}
int m_pow(int x, int n)
{
if (n == 0) return 1;
ll res = m_pow((x * x) % MOD, n / 2);
if (n & 1) res = (res * x) % MOD;
return res;
}
int m_divide(int a, int b)
{
return m_mul(a, m_pow(b, MOD - 2));
}
int m_comb(int n, int r)
{
int i;
int p = 1;
for (i = 1; i <= r; i++)
{
p = m_mul(p, (n - i + 1));
p = m_divide(p, i);
}
return p;
}
int m_comb_with_rep(int n, int r)
{
return m_comb(n + r - 1, r);
}
int gcd(int x, int y)
{
int r;
while ((r = x % y) != 0)
{
x = y;
y = r;
}
return y;
}
int N, K;
int temp[100010];
signed main()
{
cin >> N >> K;
int ans = 0;
for (int i = K; i >= 1; i--)
{
int cnt = 0;
int a = K / i;
int aa = m_pow(a, N);
cnt = m_add(cnt, aa);
for (int j = i + i; j <= K; j += i)
{
cnt = m_sub(cnt, temp[j]);
}
temp[i] = cnt;
int b = m_mul(cnt, i);
ans = m_add(ans, b);
}
cout << ans << endl;
}
| 0 | 59,574,158 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define rep(i, a, b) for(int i = int(a); i <= int(b); i++)
#define N 5005
int P[N], C[N];
int main() {
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> P[i];
for(int i = 1; i <= n; i++) cin >> C[i];
ll Ans = -INF;
rep(i, 1, n) {
int p = i;
ll cnt = 0, len = 0, allsum = 0, sum = 0;
while(1) {
++len;allsum += C[p];p = P[p];
if(p == i)break;
}
cnt = 0, sum = 0;
while(1) {
++cnt;sum += C[p];
if(cnt > k)break;
ll num = (k - cnt) / len;
ll scr = sum + max(0LL, allsum) * num;
Ans = max(Ans, scr);
p = P[p];if(p == i)break;
}
}
cout << Ans << endl;
return 0;
}
|
#include<stdio.h>
const int maxn=100005;
const int nil=-1;
struct shu
{
int p,z,y;
};
shu T[maxn];
int n,D[maxn];
void Printf(int u)
{
int i,c;
printf("node %d:",u);
printf(" parent = %d, ",T[u].p);
printf("depth = %d, ",D[u]);
if(T[u].p==nil) printf("root, ");
else if(T[u].z==nil) printf("leaf, ");
else printf("internal node, ");
printf("[");
for (i=0,c=T[u].z;c!=nil;i++,c=T[c].y)
{
if(i) printf(", ");
printf("%d",c);
}
printf("]\n");
}
void deapth(int u,int p)
{
D[u]=p;
if(T[u].y!=nil) deapth(T[u].y,p);
if(T[u].z!=nil) deapth(T[u].z,p+1);
}
int main()
{
int u,d,c,r,huan;
scanf("%d",&n);
for (int i=0;i<n;i++) T[i].p=T[i].z=T[i].y=nil;
for (int i=0;i<n;i++)
{
scanf("%d%d",&u,&d);
for (int j=0;j<d;j++)
{
scanf("%d",&c);
if(j==0) T[u].z=c;
else T[huan].y=c;
huan=c;
T[c].p=u;
}
}
for (int i=0;i<n;i++)
if(T[i].p==nil) r=i;
deapth(r,0);
for (int i=0;i<n;i++) Printf(i);
return 0;
}
| 0 | 24,664,865 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int,int>;
using vpii = vector<pii>;
int main() {
int N; cin >> N;
vector<string> s(N); for (int i = 0; i < N; i++) cin >> s.at(i);
int M; cin >> M;
vector<string> t(M); for (int i = 0; i < M; i++) cin >> t.at(i);
map<string, int> que;
for (int i = 0; i < N; i++) {
que[s.at(i)]++;
}
for (int i = 0; i < M; i++) {
que[t.at(i)]--;
}
int ans = 0;
for (auto ite = que.begin(); ite != que.end(); ite++) {
if (ans < ite -> second) ans = ite -> second;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, step = 5e4;
cin >> n;
int a[n], b[n];
a[0] = b[n - 1] = 1;
for (int i = 1; i < n; i++)
a[i] = a[i - 1] + step, b[n - i - 1] = a[i];
for (int i = 0; i < n; i++) {
int p;
cin >> p;
a[p - 1] += i;
}
for (int x : a)
cout << x << ' ';
cout << '\n';
for (int x : b)
cout << x << ' ';
cout << '\n';
return 0;
}
| 0 | 24,317,984 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll W, H;
cin >> W >> H;
vector<pair<ll, int>> pq(W + H);
for (int i = 0; i < W; i++) {
int p;
cin >> p;
pq[i] = make_pair(p, 0);
}
for (int i = 0; i < H; i++) {
int q;
cin >> q;
pq[W + i] = make_pair(q, 1);
}
sort(pq.begin(), pq.end());
ll cnt0 = 0, cnt1 = 0;
ll ans = 0;
for (int i = 0; i < H + W; i++) {
if (pq[i].second == 0) {
cnt0++;
ans += (H + 1 - cnt1) * pq[i].first;
} else {
cnt1++;
ans += (W + 1 - cnt0) * pq[i].first;
}
}
cout << ans << endl;
}
|
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(int a=b;a<c;a++)
#define in insert
#define len length()
#define si size()
#define lb lower_bound
#define ub upper_bound
#define beg begin()
#define en end()
#define f first
#define s second
#define pr(a) cout<<a
#define pr2(a,b) cout<<a<<" "<<b<<"\n"
#define nx cout<<"\n"
#define int long long
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]"<<endl;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define deb(x...)
#endif
const ll mod = 1000000007;
const ll N = 200005;
const ll mm = 1e+18;
void solve()
{
string s;
cin>>s;
int n=s.len;
int cu=0;
while(cu<n){
if(n-cu>=6){
if(s.substr(cu,6)=="eraser"){
cu+=6;
continue;
}
}
if(n-cu>=5){
if(s.substr(cu,5)=="erase"){
cu+=5;
}
else if(s.substr(cu,5)=="dream"){
if(cu+6<n){
if(s[cu+5]=='e'&&s[cu+6]=='r'){
if(cu+7<n){
if(s[cu+7]=='a'){
cu+=5;
}
else cu+=7;
}
else cu+=7;
}
else cu+=5;
}
else cu+=5;
}
else{
cout<<"NO";
return;
}
}
else{
cout<<"NO";
return;
}
}
cout<<"YES";
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
rep1(_i,t){
solve();
}
return 0;
}
| 0 | 51,774,229 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
int main() {
int a, b, c, d ;
cin >> a >> b >> c >> d;
int ab, cd;
if (a > b) ab = b;
else ab = a;
if (c > d) cd = d;
else cd = c;
cout << ab+cd << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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 (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
vector<int> c(4, 0);
rep(i, 6) {
int v;
cin >> v;
v--;
c[v]++;
}
sort(c.begin(), c.end());
vector<int> ans = {1, 1, 2, 2};
cout << (c == ans ? "YES" : "NO") << '\n';
return 0;
}
| 0 | 67,972,090 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,z,w;
ll a[2001];
ll memo[2001][2001][2];
ll hoge(ll i,ll j,ll k){
if(memo[i][j][k]!=-1){
return memo[i][j][k];
}
if(i==n || j==n){
return memo[i][j][k]=abs(a[i]-a[j]);
}
if(k==0){
return memo[i][j][k]=max(hoge(max(i,j)+1,j,0),hoge(max(i,j)+1,j,1));
}else{
return memo[i][j][k]=min(hoge(i,max(i,j)+1,0),hoge(i,max(i,j)+1,1));
}
}
int main(){fastio
cin>>n>>z>>w;
rep(i,1,n)cin>>a[i];
a[0]=w;
rep(i,0,n){
rep(j,0,n){
rep(k,0,1){
memo[i][j][k]=-1;
}
}
}
cout<<hoge(0,0,0)<<endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
int a,b;
string str,ope,p,s1,s2;
cin >> str;
cin >> n;
for (int i = 0; i < n ; ++i) {
cin >> ope;
cin >> a >> b;
if(ope == "print") {
cout << str.substr(a,b-a+1) << endl;
} else if(ope == "reverse"){
s1 = str.substr(a, b-a+1);
for(int j=0;j<s1.length();j++){
str[a+j]=s1[s1.length()-1-j];
}
} else if(ope == "replace"){
cin >> p;
str = str.replace(a,b-a+1,p);
}
}
return 0;
}
| 0 | 53,317,995 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<set>
#include<vector>
#include<map>
#include<unordered_map>
#define ll long long
#define pll pair<int,int>
using namespace std;
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a%b);
}
ll qpow(ll a, ll b, ll modd) {
ll ans = 1, base = a;
while (b) {
if (b & 1) {
ans = (ans*base) % modd;
}
base = (base*base) % modd;
b >>= 1;
}
return ans;
}
vector<pll> v ;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
for (int i = 1; i <= n; ++i) {
int tmp;
cin >> tmp;
v.push_back(make_pair(tmp, i));
}
sort(v.begin(), v.end());
for (int i = 0; i < n; ++i) {
cout << v[i].second << ' ';
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
long long gcd(ll a, ll b)
{
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(ll a, ll b)
{
return a / gcd(a, b) * b ;
}
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
vector<vector<int>> d(10, vector<int>(10, 1000000));
void warshall_floyd(int n) {
rep(k,n) rep(i,n) {
rep(j,n) {
d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
}
}
}
ll g1(ll n, int p) {
if (n == 0) return 0;
return n/p + g1(n/p, p);
}
ll g2(ll n, int p) {
ll res = g1(n/2, p);
if (p == 2) res += n/2;
return res;
}
int main()
{
ll n; cin >> n;
if (n % 2 == 1) {
cout << 0 << endl;
} else {
cout << min(g2(n,2), g2(n,5)) << endl;
}
return 0;
}
| 0 | 12,630,745 |
#include<iostream>
using namespace std;
int main()
{
long long n,i;
cin>>n;
long long m[n];
for(i=0;i<n;i++)
{
cin>>m[i];
}
long long dp[n];
dp[0]=0;
dp[1]=abs(m[1]-m[0]);
for(i=2;i<n;i++)
{
dp[i]=min(dp[i-1]+abs(m[i]-m[i-1]),dp[i-2]+abs(m[i]-m[i-2]));
}
cout<<dp[n-1]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll a,b,k;
cin>>a>>b>>k;
for(int i=0;i<k;i++){
if(i%2){
if(b%2)b--;
a+=b/2;
b/=2;
}
else{
if(a%2)a--;
b+=a/2;
a/=2;
}
}
cout<<a<<' '<<b<<endl;
}
| 0 | 914,163 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> a(N), b(N);
ll sum_a = 0, sum_b = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll cnt_b = 0, cnt_a = 0;
for (int i = 0; i < N; i++) {
if (a[i] > b[i]) {
cnt_b += a[i] - b[i];
} else if (a[i] < b[i]) {
cnt_a += (b[i] - a[i]) / 2;
}
}
if (cnt_a < cnt_b) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
for(ll i=0;i<v.size();i++) n+=v[i];
return n;
}
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 Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
for(ll i=0;i<s.size()-1;i++){
if(s[i]==s[i+1]){
x++;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
ll n,m,v,p;
vector<ll> vec;
bool solve(ll mid){
if(mid<p) return true;
if(vec[p-1]>vec[mid]+m) return false;
ll score=0;
score+=(p-1)*m;
score+=(n-mid)*m;
for(ll i=p-1;i<mid;i++) score+=min(m,max((ll)0,vec[mid]+m-vec[i]));
return score>=m*v;
}
int main() {
IOS;
cin>>n>>m>>v>>p;
vec.assign(n,0);
rep(i,n) cin>>vec[i];
sort(ALL(vec),greater<ll>());
ll ok=0;
ll ng=n;
while(abs(ok-ng)>1){
ll mid=(ok+ng)/2;
if(solve(mid)) ok=mid;
else ng=mid;
}
cout<<ok+1<<endl;
}
| 0 | 50,369,085 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n,k;cin>>n>>k;
string s;cin>>s;
ll prv=-1,cnt=0;
vector< pair<ll,ll> > vec;
for(ll i=0;i<n;i++){
ll val = s[i]-'0';
if(val==prv)cnt++;
else{
if(prv!=-1)vec.push_back({prv,cnt});
cnt=1;
prv=val;
}
}
vec.push_back({prv,cnt});
vector<ll> prfx(vec.size()+1);
for(ll i=0;i<(ll)vec.size();i++)prfx[i+1]=prfx[i] + vec[i].second;
ll ans = 0;
for(ll i=0;i<(ll)vec.size();i++){
ll r = i + (vec[i].first==0?2*k:2*k+1);
ll cnt = prfx[min(r,(ll)vec.size())]-prfx[i];
ans=max(ans,cnt);
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,h;cin>>n>>h;
vector<int> a(n),b(n);
for(int i=0;i<n;i++)cin>>a[i]>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
int l=-1,r=n;
for(int m=l+(r-l)/2;m!=l;m=l+(r-l)/2)
{
if(a[n-1]<b[m])r=m;
else l=m;
}
int ans=0;
for(int i=n-1;i>l&&h>0;i--,ans++)h-=b[i];
if(h>0)ans+=(h-1)/a[n-1]+1;
cout<<ans<<"\n";
return 0;
}
| 0 | 10,680,174 |
#include <bits/stdc++.h>
using namespace std;
int fib(int n)
{
int num[10000] = {1, 1};
for (int i = 2; i <= n; i++){
num[i] = num[i - 1] + num[i - 2];
}
return (num[n]);
}
int main()
{
int n;
cin >> n;
cout << fib(n) << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int K, N;
long long a[15];
int main() {
cin >> N >> K;
rep(i, N) {
cin >> a[i];
}
long long b[15];
long long cost;
long long ans = 100000000000;
for(int bit = 0; bit < (1<<N); bit++) {
int count = 1;
cost = 0;
for(int i = 0; i < N; i++) {
b[i] = a[i];
}
long long compare = a[0];
for(int i = 1; i < N; i++) {
if(bit & (1<<i)) {
count++;
if(a[i] <= compare) {
b[i] = compare + 1;
cost += compare + 1 - a[i];
}
compare = b[i];
} else {
if(a[i] > compare) {
count++;
compare = a[i];
}
}
}
if(count >= K) ans = min(cost, ans);
}
cout << ans << endl;
return 0;
}
| 0 | 79,720,283 |
#include<iostream>
#include<list>
#include<utility>
#include<algorithm>
using namespace std;
int main() {
list<int> L;
int n;
cin >> n;
pair<string,int> u;
for(int i=0;i<n;i++) {
cin >> u.first;
if (u.first[0] == 'i')
{
cin >> u.second;
L.push_front(u.second);
}
else if (u.first[6] == 'F')
{L.pop_front();
}
else if (u.first[6] == 'L')
{L.pop_back();
}
else if (u.first[0] == 'd')
{
cin >> u.second;
for (list<int>::iterator it = L.begin(); it != L.end(); it++){
if (*it==u.second) {L.erase(it); break;}
}
}
}
int i=0;
for (list<int>::iterator it = L.begin(); it != L.end(); it++){
if (i++) cout << " ";
cout << *it;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
vector<bool> can(n, false);
rep(i, n - 1) {
if (h.at(i + 1) - h.at(i) <= 0) {
can.at(i) = true;
}
}
int res = 0;
int cnt = 0;
rep(i, n) {
if (can.at(i)) {
cnt++;
} else {
res = max(res, cnt);
cnt = 0;
}
}
cout << res << endl;
return 0;
}
| 0 | 100,693,074 |
#include<iostream>
using namespace std;
int main()
{
double x1, y1, x2, y2, x3, y3, xp, yp;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp)
{
double s = ((y3-y1)*(xp-x1)+(x1-x3)*(yp-y1))/((x2-x1)*(y3-y1)-(x3-x1)*(y2-y1));
double t = ((y1-y2)*(xp-x1)+(x2-x1)*(yp-y1))/((x2-x1)*(y3-y1)-(x3-x1)*(y2-y1));
if( s>=0 && t>=0 && s+t<=1 ){cout << "YES\n";}
else{cout << "NO\n"; }
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <ctime>
#include <map>
#include <queue>
#include <cstdlib>
#include <string>
#include <climits>
#include <set>
#include <vector>
#include <complex>
#define int long long
using namespace std;
inline int read(){
int k=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){k=k*10+ch-'0';ch=getchar();}
return k*f;
}
inline void write(int x){
if(x<0)putchar('-'),x=-x;
if(x>9)write(x/10);putchar(x%10+'0');
}
inline void writeln(int x){
write(x);puts("");
}
const int N=1e5+10;
struct ppap{int x,v;}a[N];
int n,ans[N];
inline bool cmp(ppap a,ppap b){return a.v>b.v;}
signed main()
{
n=read();
for(int i=1;i<=n;i++){
a[i].v=read();a[i].x=i;
}
sort(a+1,a+n+1,cmp);
int minn=a[1].x;
for(int i=2;i<=n;i++){
int rp=a[i-1].v-a[i].v;
ans[minn]+=(i-1)*rp;
minn=min(minn,a[i].x);
}
ans[minn]+=n*a[n].v;
for(int i=1;i<=n;i++)writeln(ans[i]);
return 0;
}
| 0 | 44,213,718 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
typedef long long ll;
using gra = vector<vector<ll>>;
using gram = vector<unordered_map<ll,ll>>;
typedef unsigned long long ull;
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 <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> T dup(T a, T b) { return (a + b - 1) / b; }
template <class T> T modpow(T x, T p, T m) { T a=1; while(p){ if(p%2)a =a*x%m; x = x+x%m; p/=2; } return a; }
#define mod 1000000007LL
#define INF 10000000000000000LL
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define rrep1(i, n) for (int i = n; i > 0; --i)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define m0(h) memset(h, 0, sizeof(h))
#define m1(h) memset(h, 1, sizeof(h))
#define m(h, n) memset(h, (n), sizeof(h))
#define all(n) (n).begin(),(n).end()
#define bit(n) (1LL << (n))
#define pb push_back
#define mp make_pair
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, i, sum[50];
cin >> n;
ll kou[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
pri(kou[n-1]);
return 0;
}
|
#include<iostream>
#define MAX 100
using namespace std;
int G[MAX][MAX];
void arrayInit(int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
G[i][j] = 0;
}
}
}
void input(int n) {
int m, g, k;
for (int i = 0; i < n; i++) {
cin >> m >> k;
--m;
for (int j = 0; j < k; j++) {
cin >> g;
--g;
G[m][g] = 1;
}
}
}
void output(int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (j)cout << " ";
cout << G[i][j];
}
cout << endl;
}
}
int main() {
int size;
cin >> size;
arrayInit(size);
input(size);
output(size);
return 0;
}
| 0 | 35,329,718 |
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std;
vector<int> v;
int main()
{
int n;
string a,b;
cin>>n;
cin>>a>>b;
for(int i = 0; i<n; i++)
{
cout<<a[i]<<b[i];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
int main(){
int a, b;
string s;
cin >> a >> b >> s;
bool ans = true;
rep(i,a){
if(s.at(i) == '-'){
ans = false;
break;
}
}
if(s.at(a) != '-'){
ans = false;
}
for(int i=a+1; i<a+b; i++){
if(s.at(i) == '-'){
ans = false;
break;
}
}
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0 | 25,698,625 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main() {
int n, r;
cin >> n >> r;
if (n < 10) {
cout << r + 100 * (10 - n) << endl;
} else {
cout << r << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using ll=long long;
typedef pair<int,int> P;
const int MOD=1e9+7;
int main(){
ll n;
cin>>n;
vector<ll> sum(64);
vector<ll> dat(n);
rep(i,n){
cin>>dat[i];
rep(j,60){
if((dat[i]>>j)&1) sum[j]++;
}
}
ll now=n,num=1;
ll ans=0;
rep(i,60){
n=now;
if(i!=0) num*=2;
num%=MOD;
rep(j,now-1){
if((dat[j]>>i)&1){
sum[i]--;
n--;
ans+=num*(n-sum[i])%MOD;
}
else{
n--;
ans+=num*(sum[i])%MOD;
}
ans%=MOD;
}
}
cout<<ans<<endl;
}
| 0 | 5,205,258 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S, T;
cin >> S >> T;
bool ans = true;
map<char, char> ma, ima;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (ma.count(s)) if (ma[s] != t) ans = false;
if (ima.count(t)) if (ima[t] != s) ans = false;
ma[s] = t;
ima[t] = s;
}
cout << (ans ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
vector <vector <string>>vec(2);
int n,m,counter,ans=0;
string strin;
cin>>n;
for(int i=0;i<n;i++){
cin>>strin;
vec.at(0).push_back(strin);
}
cin>>m;
for (int k=0;k<m;k++){
cin>>strin;
vec.at(1).push_back(strin);
}
string st;
for(int l=0;l<2;l++){
for(string str:vec.at(l)){
st=str;
counter=0;
for(int o=0;o<2;o++){
for(string tr:vec.at(o)){
if(tr==st){
if(o==0)
counter++;
else if (o==1)
counter--;
}
else
continue;
}
}
if(ans<counter)
ans=counter;
else
continue;
}
}
cout<<ans<<endl;
}
| 0 | 93,944,455 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
int main()
{
int n,x,t;
cin >> n >> x >> t;
int ans = 0;
ans += n/x * t;
if(n%x >0) ans += t;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
int main(){
int k;
cin >> k;
vector<int> pos, neg;
rep(i,k) {
int a;
cin >> a;
if (a < 0) neg.emplace_back(a);
else pos.emplace_back(a);
}
sort(neg.begin(), neg.end());
sort(pos.begin(), pos.end(), greater<int>());
int n = neg.size(), m = pos.size();
if (m == 0) {
int res = neg[n-1];
for (int i = 0; i < n-1; i++) {
res -= neg[i];
}
cout << res << endl;
for (int i = 0; i < n-1; i++) {
cout << neg[n-1] << " " << neg[i] << endl;
neg[n-1] -= neg[i];
}
return 0;
}
if (n == 0) {
int res = pos[m-1];
for (int i = m-2; i > 0; i--) {
res -= pos[i];
}
res = pos[0] - res;
cout << res << endl;
for (int i = m-2; i > 0; i--) {
cout << pos[m-1] << " " << pos[i] << endl;
pos[m-1] -= pos[i];
}
cout << pos[0] << " " << pos[m-1] << endl;
return 0;
}
int mx = pos[0], mi = neg[0];
for (int i = 1; i < n; i++) {
mx -= neg[i];
}
for (int i = 1; i < m; i++) {
mi -= pos[i];
}
int res = mx - mi;
cout << res << endl;
for (int i = 1; i < n; i++) {
cout << pos[0] << " " << neg[i] << endl;
pos[0] -= neg[i];
}
for (int i = 1; i < m; i++) {
cout << neg[0] << " " << pos[i] << endl;
neg[0] -= pos[i];
}
cout << pos[0] << " " << neg[0] << endl;
return 0;
}
| 0 | 94,865,448 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1LL << 60;
signed main(void){
int n,k; cin >> n >> k;
vector<int>a(n);
for(int i = 0; i < n; i++){ cin >> a[i];}
int ans = inf;
for(int bit = 0; bit < (1<<n); bit++){
vector<bool> vec(n,false); int cnt = 0;
for(int i = 0; i < n; i++){
if( bit >> i & 1 ){ vec[i] = true; cnt++;}
}
if( cnt < k ){ continue;}
int M = 0; int sum = 0;
for(int i = 0; i < n; i++){
if( vec[i] ){
if( M >= a[i] ){ sum += M-a[i]+1;}
}
if( vec[i] ){ M = max(M+1,a[i]);}
else{ M = max(M,a[i]);}
}
ans = min(ans,sum);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define INFTY 10000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using P = pair<int,int>;
typedef long long int ll;
const int MOD=1000000007;
const int di[4] = {-1,0,1,0};
const int dj[4] = {0,-1,0,1};
int main(){
int h,w,m;cin>>h>>w>>m;
vector<int> hs(h,0),ws(w,0);
set<P> s;
rep(i,m){
int c,r;cin>>c>>r;
--c;--r;
hs[c]++;ws[r]++;
s.emplace(c,r);
}
vector<int>is,js;
int mi=0,mj=0;
rep(i,h)mi = max(mi,hs[i]);
rep(j,w)mj = max(mj,ws[j]);
rep(i,h)if(mi == hs[i])is.emplace_back(i);
rep(j,w)if(mj == ws[j])js.emplace_back(j);
int ans = mi + mj;
for(int i : is)for(int j : js){
if(s.count(P(i,j)))continue;
cout<<ans<<endl;
return 0;
}
ans--;
cout<<ans<<endl;
return 0;
}
| 0 | 60,056,453 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
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; }
const int MOD = 1000000007;
const int INF = 1e9;
const int mod = 1000000007;
const int inf = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
int n;
cin >> n;
vector<int> t(n),v(n);
int sumT = 0;
for(int i = 0; i < n; i++) cin >> t[i], sumT += t[i];
for(int i = 0; i < n; i++) cin >> v[i];
vector<ld> a(sumT*2+1, 1e9);
int nowt = 0;
for(int i = 0; i < n; i++) {
for(int j = 0; j < sumT*2+1; j++) {
if(nowt*2 <= j && j <= (nowt+t[i])*2) {
chmin(a[j], (ld)v[i]);
} else if (j < nowt*2) {
ld tt = (nowt*2-j)*0.5+v[i];
chmin(a[j], tt);
} else {
ld tt = (j-(nowt+t[i])*2)*0.5+v[i];
chmin(a[j], tt);
}
}
nowt += t[i];
}
for(int i = 0; i < sumT*2+1; i++) {
if(i <= sumT) {
chmin(a[i], (ld)i*0.5);
}else {
chmin(a[i], sumT-(ld)i*0.5);
}
}
ld ans = 0;
for(int i = 0; i < sumT*2; i++) {
ans += (a[i]+a[i+1])*0.25;
}
cout << fixed << setprecision(20) << ans << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int A[3], B[3], C[4] = { 1, 2, 3, 4 };
bool used[5][5];
int main() {
for (int i = 0; i < 3; i++) {
cin >> A[i] >> B[i];
used[A[i]][B[i]] = true;
used[B[i]][A[i]] = true;
}
do {
bool flag = true;
for (int i = 0; i < 3; i++) {
if (used[C[i]][C[i + 1]] == false) flag = false;
}
if (flag == true) {
cout << "YES" << endl;
return 0;
}
} while (next_permutation(C, C + 4));
cout << "NO" << endl;
return 0;
}
| 0 | 27,585,281 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; 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))
typedef long long ll;
typedef long double ld;
int main(){
ll n,k;cin>>n>>k;
vector<ll> v(n);
REP(i,n){
cin>>v[i];
}
vector<ll> list;
map<ll,ll> w;
REP(i,n){
ll cnt=w.count(v[i]);
if(cnt){
w.at(v[i])++;
}else{
w.insert(make_pair(v[i],1));
list.push_back(v[i]);
}
}
ll s=SIZE(list);
vector<ll> x(s);
REP(i,s){
x[i]=w.at(list[i]);
}
sort(ALL(x));
ll sum=0;
REP(i,s-k){
sum+=x[i];
}
cout<<sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int m;
vector<int> v;
int num[10] = {0,2,5,5,4,5,6,3,7,6};
int dp[10010][10];
int pre[10010][10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
v.push_back(a);
}
for (int i = 0; i < 10010; i++) {
for (int j = 0; j < 10; j++) {
dp[i][j] = -1;
pre[i][j] = -1;
}
}
sort(v.begin(), v.end());
for (int i = 0; i < m; i++) {
dp[0][i] = 0;
}
int mx = -1;
int pos = -1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
for (int k = j; k < m; k++) {
int use = num[v[j]];
if (dp[i+use][k] < dp[i][j]+1) {
dp[i+use][k] = dp[i][j]+1;
pre[i+use][k] = j;
}
else if (dp[i+use][k] == dp[i][j]+1) {
pre[i+use][k] = max(pre[i+use][k],j);
}
if (dp[i+use][k] > mx && i+use == n) {
mx = dp[i+use][k];
pos = k;
}
else if (i+use == n && dp[i+use][k] == mx) {
pos = max(pos,k);
}
}
}
}
int y = n;
int x = pos;
while (1) {
cout << v[pre[y][x]];
int kk = v[pre[y][x]];
x = pre[y][x];
y -= num[kk];
if (y == 0) break;
}
cout << endl;
}
| 0 | 19,781,537 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int GetDigitsCount(int targetNumber, int baseNumber=10) {
int digitsCount = 0;
while (targetNumber != 0) {
digitsCount++;
targetNumber /= baseNumber;
}
return digitsCount;
}
int main() {
int n, c; cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (GetDigitsCount(i) % 2 == 1) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int a,b,c,n;
void solve(){
cin >> a >> b >> c >> n;
int cnt = 0;
for(int i = 0; i <= n; i++){
for(int j = 0; j+i <= n; j++){
int ab = a*i+b*j;
if(n < ab) break;
if((n-ab)%c == 0) cnt++;
}
}
cout << cnt << endl;
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
while(t--){
solve();
}
return 0;
}
| 0 | 76,766,102 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << n / 3 << endl;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
set<int> p, q;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (a == 1)p.insert(b);
if (b == n)q.insert(a);
}
bool ret = false;
for (auto x:p) {
if (q.find(x) != q.end())ret = true;
}
cout << (ret ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return 0;
}
| 0 | 81,200,851 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());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; }
int ctoi(char c) {return c-'0';}
ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
ll lcm(ll a,ll b){ll g = gcd(a,b);return a/g*b;}
bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
ll modpow(ll a,ll n, ll mod){ll res = 1;while(n>0){if (n%2==1){res = res * a % mod;}a = a * a % mod;n/=2;}return res;}
int main() {
int n,d;
cin >> n >> d;
ll x[n][d];
for(int i=0;i<n;i++){
for(int j=0;j<d;j++){
cin >> x[i][j];
}
}
ll ans =0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
ll che = 0;
for(int k=0;k<d;k++){
che +=pow(abs(x[i][k]-x[j][k]),2);
}
ll check = pow(che,0.5);
double now = pow(che,0.5);
if(check==now)ans++;
}
}
cout << ans <<endl;
}
|
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define putr(a) rep(testIncrement,0,a.size()) {puts(a[testIncrement]);} cout << endl
#define putrr(a) rep(Incr1,0,a.size()) {rep(Incr2,0,a[Incr1].size()) {puts(a[Incr1][Incr2]);} cout<<endl;} cout<<endl;
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define PI (acos(-1))
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
string t; cin >> t;
string s; cin >> s;
SINT64 ans = 0;
rep(i,0,3) {
if (s[i] == t[i]) ans++;
}
put(ans);
return 0;
}
| 0 | 21,196,239 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mx *max_element
#define mn *min_element
#define fo(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,b) for(ll i=a;i<=b;i++)
#define rfo(i,n) for(ll i=n-1;i>=0;i--)
#define rloop(i,a,b) for(ll i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define sortall(x) sort(all(x))
#define precision cout<<fixed<<setprecision(10)
#define mem(x,p) memset(x,p,sizeof(x))
#define w(t) ll t;cin>>t;while(t--)
#define kk "\n"
#define setbits(x) __builtin_popcountll(x)
const double pi=3.1415926535897932384626;
const ll mod=1e9+7;
int main()
{
IOS
ll n;
cin>>n;
ll a[n];
fo(i,n)
cin>>a[i];
ll ans[n]={0};
for(ll i=n-2;i>=0;i--)
{
if(a[i]>=a[i+1])
ans[i]=ans[i+1]+1;
else
ans[i]=0;
}
ll p=mx(ans,ans+n);
cout<<p;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int n, q, a, b;
int cnt[N];
vector<int> e[N];
ll res;
void dfs(int x, int par) {
for (int i : e[x]) {
if (i == par) continue;
cnt[i] += cnt[x];
dfs(i, x);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> q;
for (int i = 0; i < n - 1; ++i) {
cin >> a >> b;
e[a].push_back(b);
e[b].push_back(a);
}
for (int i = 0; i < q; ++i) {
cin >> a >> b;
cnt[a] += b;
}
dfs(1, 0);
for (int i = 1; i <= n; ++i) {
cout << cnt[i] << ' ';
}
cout << endl;
return 0;
}
| 0 | 95,181,472 |
#include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t){int b=0;while(((b+=*s=='(')-=*s==')')!=0||*s!=',')cerr<<*s++;cerr<<" = "<<h<<",";_(s+1,t...);}
#define int ll
#define pii pll
#define f first
#define s second
#define pb emplace_back
#define forn(i,n) for(int i=0;i<(n);++i)
#define sz(a)((int)(a).size())
#define sqr(x) ((x)*(x))
struct init{init(){cin.tie(0);iostream::sync_with_stdio(0);cout<<fixed<<setprecision(10);cerr<<fixed<<setprecision(5);}~init(){
#ifdef LOCAL
#define dbg(...) _(#__VA_ARGS__,__VA_ARGS__)
cerr<<"Time elapsed: "<<(double)clock()/CLOCKS_PER_SEC<<"s.\n";
#else
#define dbg(...)
#endif
}}init;template<typename T,typename U>void upx(T&x,U y){if(x<y)x=y;}template<typename T,typename U>void upn(T&x,U y){if(x>y)x=y;}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());const int D=4,dx[]={+1,0,-1,0},dy[]={0,+1,0,-1};
const int N=1e5+5,L=17;
int x[N];
int go[N][L];
int og[N][L];
int32_t main(){
int n;cin>>n;
for(int i=1;i<=n;++i)cin>>x[i];
int pos=n,l,q;
cin>>l>>q;
for(int i=n;i>=1;--i){
while(x[i]+l<x[pos])pos--;
go[i][0]=pos;
for(int j=1;j<L;++j)go[i][j]=go[go[i][j-1]][j-1];
}
pos=1;
for(int i=1;i<=n;++i){
while(x[i]-l>x[pos])pos++;
og[i][0]=pos;
for(int j=1;j<L;++j)og[i][j]=og[og[i][j-1]][j-1];
}
while(q--){
int a,b;
cin>>a>>b;
int ans=1;
if(a<b){
for(int i=L-1;i>=0;--i){
if(go[a][i]<b){
a=go[a][i];
ans+=1<<i;
}
}
}else{
for(int i=L-1;i>=0;--i){
if(og[a][i]>b){
a=og[a][i];
ans+=1<<i;
}
}
}
cout<<ans<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int nHr(int a,int b){return nCr(a+b-1,b);}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}
int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}
int sankaku(int x){return ((1+x)*x)/2;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llnHr(long long a,long long b){return llnCr(a+b-1,b);}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}
long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}
long long llsankaku(long long x){return ((1+x)*x)/2;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) ; for(int i=(a); i<(b); i++)
#define clean(arr,val) memset(arr,val,sizeof(arr))
#define forn(i,n) forr(i,0,n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
bool is_prime (int x){
if (x<=1) return false ;
for (int i=2 ; i*i<=x ; i++){
if (x%i==0) return false ;
}
return true;
}
string alpha = "abcdefghijklmnopqrstuvwxyz" ;
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ;
bool chmin (int a,int b){
if ( a > b ){
a = b;
return true ;
}
return false ;
}
bool chmax (int a,int b){
if ( a < b ){
a = b;
return true ;
}
return false ;
}
#define SORT(c) sort((c).begin(),(c).end());
#define ANS(ans) cout<<(ans)<<endl;
string split (string s , ll n , char x){
string a ,b,c,d;
a = s;
b = s;
if ( x == 'f'){
return c = a.erase(n) ;
}else if ( x == 'l'){
return d = b.substr(n) ;
}
}
int main() {
int h, w;
cin >> h >> w;
bool ans = true ;
string board[50];
for (int i = 0; i < h; ++i) cin >> board[i];
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (board[i][j] == '.') continue;
int num = 0;
for (int d = 0; d < 4; ++d) {
const int ni = i + dy[d];
const int nj = j + dx[d];
if(ni<0 || h<=ni)continue;
if(nj<0 || w<=nj)continue;
if (board[ni][nj] == '#') num++;
}
if ( num == 0){
ANS("No");
return 0 ;
}
}
}
ANS("Yes") ;
}
| 0 | 90,578,814 |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#define REP(i,x) for(int i=0 ; i<(int)(x) ; i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long
using namespace std;
struct Node{
int v, c;
Node(int v, int c){
this->v = v;
this->c = c;
}
Node(){
this->v = 0;
this->c = 0;
}
};
int main(){
LL N, M;
cin >> N >> M;
vector<vector<int> > G(N, vector<int>());
REP(i, M){
int u, v;
cin >> u >> v;
u--,v--;
G[u].push_back(v);
G[v].push_back(u);
}
LL ind = 0;
LL bipartite = 0;
LL not_bipartite = 0;
vector<int> color(N, -1);
REP(i, N){
if(G[i].size()==0){
ind++;
continue;
}
if(color[i]!=-1)continue;
stack<Node> st;
st.push(Node(i, 0));
bool is_bipertite = true;
while(!st.empty()){
Node n = st.top();st.pop();
if(color[n.v]!=-1){
if(color[n.v]!=n.c)is_bipertite = false;
continue;
}
color[n.v] = n.c;
REP(j, G[n.v].size()){
st.push(Node(G[n.v][j], 1-n.c));
}
}
if(is_bipertite)bipartite++;
else not_bipartite++;
}
LL res = ind*(2LL*N-ind);
res += 2LL * bipartite * bipartite;
res += 1LL * (not_bipartite * not_bipartite + 2LL * not_bipartite * bipartite);
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
ll N, M;
ll dp1[2001][2001];
ll acc[2001][2001];
const ll MOD = 1000000007;
int main(){
cin >> N >> M;
vector<ll> S(N);
vector<ll> T(M);
for ( int i = 0; i < N; i++ )
cin >> S[i];
for ( int i = 0; i < M; i++ )
cin >> T[i];
for ( int i = 0; i < N; i++ ){
for ( int j = 0; j < M; j++ ){
dp1[i][j] = 0;
acc[i][j] = 0;
}
}
for ( int i = 0; i < N; i++ ){
ll asum = 0;
for ( int j = 0; j < M; j++ ){
if ( S[i] == T[j] ){
dp1[i][j] = (i-1<0||j-1<0) ? 1 : acc[i-1][j-1];
}
asum = (asum + dp1[i][j])%MOD;
acc[i][j] = (((i-1<0)?1:acc[i-1][j]) + asum)%MOD;
}
}
cout << acc[N-1][M-1] << endl;
return 0;
}
| 0 | 63,972,315 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <fstream>
#include <bitset>
#include <time.h>
#include <assert.h>
#define LL long long
#define VI vector<int>
#define VL vector<long long>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EPS 1e-14
#define INF 1e7
using namespace std;
int longest_increasing_subsequence(const vector<int> &a) {
vector<int> dp(a.size() + 1, INT_MAX);
for (int i = 0; i < a.size(); ++i) {
*lower_bound(ALL(dp), a[i]) = a[i];
}
return lower_bound(ALL(dp), INT_MAX) - dp.begin();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N, 0);
FOR(i, 0, N) {
cin >> a[i];
}
cout << longest_increasing_subsequence(a) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
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(){
ll n,m;
cin>>n>>m;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
a[i]/=2;
}
ll lc=1;
rep(i,n) lc=lcm(lc,a[i]);
rep(i,n){
if((lc/a[i])%2==0){
cout<<0<<endl;
return 0;
}
}
ll ans=m/lc;
ans=(ans+1)/2;
cout<<ans<<endl;
}
| 0 | 50,987,370 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int cnt = 0, a_cnt = 0, b_cnt = 0, double_cnt = 0;
string s;
for (int i = 0;i < N;i++) {
cin >> s;
for (int j = 0;j < s.length()-1;j++) {
if (s[j] == 'A') {
if (s[j+1] == 'B') cnt++;
}
}
if (s[0] == 'B') b_cnt++;
if (s[s.length() - 1] == 'A') a_cnt++;
if (s[0] == 'B' && s[s.length() - 1] == 'A') double_cnt++;
}
if (double_cnt == a_cnt && a_cnt == b_cnt) {
a_cnt = max(0, a_cnt-1);
b_cnt = max(0, b_cnt-1);
}
cout << cnt + min(a_cnt, b_cnt) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
int main() {
int n,k;
cin>>n>>k;
int arr[n+1];
for(int i=1;i<=n;i++)
cin>>arr[i];
int dp[n+1][k+1];
dp[0][0]=1;
for(int i=1;i<=k;i++)
dp[0][i] = 0;
for(int i=1;i<=n;i++){
vector<int> pref(k+1);
pref[0] = dp[i-1][0];
for(int j=1;j<=k;j++)
pref[j] = (pref[j-1]+dp[i-1][j])%MOD;
for(int j=0;j<=k;j++){
if(arr[i]>=j)
dp[i][j] = pref[j];
else
dp[i][j] = (pref[j] - pref[j-arr[i]-1]+MOD)%MOD;
}
pref.clear();
}
cout<<dp[n][k]<<"\n";
}
| 0 | 22,703,985 |
#include<iostream>
using namespace std;
int selectionSort(int (&A)[100],int N){
int i, j, minj, tmp, cnt=0;
for(i=0;i<N;i++){
minj = i;
for(j=i;j<N;j++){
if(A[j] < A[minj])
minj = j;
}
if(A[i] != A[minj])
cnt++;
tmp = A[i];
A[i] = A[minj];
A[minj] = tmp;
}
return cnt;
}
int main(){
int n, cnt, a[100], i;
cin >> n;
for(i=0;i<n;i++){
cin >> a[i];
}
cnt = selectionSort(a, n);
cout << a[0];
for(i=1;i<n;i++){
cout << " " << a[i];
}
cout << endl << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) {
long long d = gcd(a, b);
return a / d * b;
}
int main() {
ll a, b, c, d, ans;
cin >> a >> b >> c >> d;
ans = b - a + 1;
if (c <= b && b - b%c >= a) ans -= (b - b%c - a)/c + 1;
if (d <= b && b - b%d >= a) ans -= (b - b%d - a)/d + 1;
if (lcm(c,d) <= b && b - b%(lcm(c,d)) >= a) ans += (b - b%(lcm(c,d)) - a )/(lcm(c,d)) + 1;
cout << ans << endl;
return 0;
}
| 0 | 15,521,475 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int n, k;
cin >> n >> k;
vector<double> pos(20);
pos[0] = 1.0;
for (int i = 1; i < 20; ++i)
pos[i] = pos[i - 1] / 2;
const double p = 1.0 / n;
double ans = 0;
for (int i = 1; i <= n; ++i)
{
int t = 0;
while (i * (1 << t) < k)
++t;
ans += p * pos[t];
}
printf("%.12lf\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<pair<string,P> >vec;
void solve(long long N, long long Z, long long W, vector<long long> a){
if (N == 1) cout << abs(a[N-1]-W) << endl; else cout << max(abs(a[N-2]-a[N-1]), abs(a[N-1]-W)) << endl;
}
int main(){
long long N;
long long Z;
long long W;
scanf("%lld",&N);
vector<long long> a(N-1+1);
scanf("%lld",&Z);
scanf("%lld",&W);
for(int i = 0 ; i <= N-1 ; i++){
scanf("%lld",&a[i]);
}
solve(N, Z, W, a);
return 0;
}
| 0 | 16,124,630 |
#include <bits/stdc++.h>
#define rep(i,b) for(int i=0;i<b;i++)
using namespace std;
string s[50];
int n,m;
signed main() {
cin>>n;
rep(i,n)cin>>s[i];
rep(j,26) {
m = 100;
rep(i, n)m = min(m, (int) count(begin(s[i]), end(s[i]),(char)j+97));
rep(i, m) cout <<(char)(j+97);
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, a, b) for (int i = a;i<=b;i++)
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define mem(x) memset(x, 0, sizeof(x))
#define ritr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define pai pair < int, int>
#define pal pair < ll, ll>
#define vi vector <int>
#define vl vector < ll >
#define vpai vector < pii >
const int mod = 1e9+7;
const int INF = INT_MAX;
const int sze = 1000005;
int prime[sze];
vi fact[sze];
map<int,int> mp;
void seive(){
for(int i=0;i<sze;i++) prime[i]=i;
for(int i=2;i*i<sze;i++){
if(prime[i]==i){
for(int j=i*i;j<sze;j+=i){
if(prime[j]==j) prime[j]=i;
}
}
}
}
void factor(){
for(int i=2;i<=1000000;i++){
int temp=i;
while(temp!=1){
fact[i].pb(prime[temp]);
int x=prime[temp];
temp=temp/x;
while(temp%x==0) temp=temp/x;
}
}
}
void solve() {
int n;
cin>>n;
int arr[n];
int flag=1;
int gcd=0;
rep(i,n){
cin>>arr[i];
gcd=__gcd(gcd,arr[i]);
if(arr[i]==1) continue;
for(auto x:fact[arr[i]]) {
if(x==1) continue;
if(mp[x]==0) mp[x]=1;
else flag=0;
}
}
if(flag==1){
cout<<"pairwise coprime\n";
}else if(gcd==1){
cout<<"setwise coprime\n";
}else
{
cout<<"not coprime\n";
}
}
int main() {
IOS;
seive();
factor();
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 0 | 75,949,270 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S, T;
int a, b;
cin >> S >> T;
scanf("%d %d", &a, &b);
string U;
cin >> U;
if (U == S) a--;
if (U == T) b--;
printf("%d %d\n", a, b);
}
|
#include <iostream>
#include <vector>
using namespace std;
class DisjointSet
{
public:
vector<int> rank, p;
DisjointSet() {}
DisjointSet(int size)
{
rank.resize(size, 0);
p.resize(size, 0);
for (int i = 0; i < size; ++i)
makeSet(i);
}
void makeSet(int x)
{
p[x] = x;
rank[x] = 0;
}
bool same(int x, int y)
{
return findSet(x) == findSet(y);
}
void unite(int x, int y)
{
link(findSet(x), findSet(y));
}
void link(int x, int y)
{
if(rank[x] > rank[y])
p[y] = x;
else
{
p[x] = y;
if(rank[x] == rank[y])
rank[y]++;
}
}
int findSet(int x)
{
if(x != p[x])
p[x] = findSet(p[x]);
return p[x];
}
};
int main(int argc, char const *argv[])
{
int n, a, b, q;
int t;
cin >> n >> q;
DisjointSet ds = DisjointSet(n);
for (int i = 0; i < q; ++i)
{
cin >> t >> a >> b;
if(t == 0)
ds.unite(a, b);
else if(t == 1)
{
if(ds.same(a, b))
cout << 1 << endl;
else
cout << 0 << endl;
}
}
return 0;
}
| 0 | 79,186,984 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
int nax = 0;
rep(i,N){
cin >> A[i];
nax = max(nax, A[i]);
}
int g = A[0];
for(int i = 1; i < N; ++i)g = gcd(g, A[i]);
cout << ((nax >= K && K % g == 0) ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
c[a-1]++;
}
sort(c.rbegin(), c.rend());
vector<int> d(n + 1);
int j = n - 1;
int tot = 0;
for (int i = 1; i <= n; i++) {
while(j >= 0 && c[j] <= i) {
tot += c[j];
j--;
}
d[i] = ((j + 1) * i + tot) / i;
}
for (int i = 1; i <= n; i++) {
int ok = 0, ng = n + 1;
while(ng - ok > 1) {
int m = (ok + ng) / 2;
if (d[m] >= i) {
ok = m;
} else {
ng = m;
}
}
cout << ok << endl;
}
}
| 0 | 99,732,764 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int num[4];
for(int i = 0; i < 4; i++){
num[i] = n % 10;
n /= 10;
}
if((num[0] == num[1] && num[1] == num[2]) || (num[1] == num[2] && num[2] == num[3])){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int N, M;
cin >> N >> M;
if(N%2){
REP(i, M){
cout << i+1 << " " << N-i << "\n";
}
}else{
REP(i, M){
if(i < M/2){
cout << i+1 << " " << N/2-i-1 << "\n";
}else{
cout << N/2+i-M/2 << " " << N-(i-M/2)-1 << "\n";
}
}
}
return 0;
}
| 0 | 3,218,760 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
int ans;
for (int i = 1; i <= 9; i++) {
ans = 111 * i;
if (N <= ans) break;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll H, W;
cin >> H >> W;
vector<string> A(H+2);
A[0] = string(W+2, '#');
A[H+1] = string(W+2, '$');
REP(i,1,H+1) {
string s;
cin >> s;
A[i] = "#" + s + "#";
}
queue<pll> Q;
mat D(H+2, vec(W+2, -1));
REP(i,1,H+1) {
REP(j,1,W+1) {
if(A[i][j] == '#') {
Q.push({i, j});
D[i][j] = 0;
}
}
}
vector<pll> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
while(!Q.empty()) {
pll p = Q.front(); Q.pop();
ll i = p.first, j = p.second;
FORR(d,dir) {
ll k = i + d.first, l = j + d.second;
if(A[k][l] == '.' && D[k][l] == -1) {
D[k][l] = D[i][j] + 1;
Q.push({k, l});
}
}
}
ll m = 0;
REP(i,1,H+1) {
REP(j,1,W+1) {
m = MAX(m,D[i][j]);
}
}
PR(m);
return 0;
}
| 0 | 36,449,614 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
template<typename T>
vector<T> make_vec_nd(T init, size_t size) {
return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, size_t size, Args... rest) {
auto inner = make_vec_nd(init, rest...);
return vector<decltype(inner)>(size, inner);
}
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
int main() {
vector<ll> cnt_matches_vec = {2, 5, 5, 4, 5, 6, 3, 7, 6};
unordered_map<ll, ll> cnt_matches;
rep(i, 0, 9) {
cnt_matches[i+1] = cnt_matches_vec[i];
}
ll N, M;
cin >> N >> M;
vector<ll> Ais(M);
rep(i, 0, M) {
cin >> Ais[i];
}
{
unordered_map<ll, ll> map;
rep(i, 0, Ais.size()) {
if (map.find(cnt_matches[Ais[i]]) == map.end()) {
map[cnt_matches[Ais[i]]] = Ais[i];
} else {
map[cnt_matches[Ais[i]]] = max(map[cnt_matches[Ais[i]]], Ais[i]);
}
}
Ais.clear();
for (const auto& kv : map) {
Ais.push_back(kv.second);
}
}
sort(Ais.begin(), Ais.end());
auto dp = make_vec_nd(numeric_limits<ll>::min(), Ais.size()+1, N+1);
dp[0][0] = 0;
rep(number_cnt, 1, Ais.size()+1) {
ll cost = cnt_matches[Ais[number_cnt-1]];
rep(n, 0, N+1) {
dp[number_cnt][n] = dp[number_cnt-1][n];
if (n >= cost) {
dp[number_cnt][n] = max(dp[number_cnt][n],
dp[number_cnt][n-cost] + 1);
}
}
}
vector<ll> digits;
ll N_loc = N;
rrep(number_cnt,Ais.size()+1,1) {
ll cost = cnt_matches[Ais[number_cnt-1]];;
while(N_loc-cost >= 0 &&
dp[number_cnt][N_loc] == dp[number_cnt][N_loc-cost]+1) {
digits.push_back(Ais[number_cnt-1]);
N_loc -= cost;
}
}
sort(digits.rbegin(), digits.rend());
rep(i,0,digits.size()) {
cout << digits[i];
}
cout << endl;
}
|
#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) {
string s;
cin >> s;
ll count = 0;
ll l = 0, r = s.size() - 1;
while(r - l > 0) {
if(s[l] != s[r]) {
count++;
if(s[l] == 'x') {
l++;
} else if(s[r] == 'x') {
r--;
} else {
cout << -1 << endl;
return 0;
}
} else {
l++; r--;
}
}
cout << count << endl;
return 0;
}
| 0 | 50,480,300 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
using ll = long long;
const ll inf = 1e9+7;
const double PI = 3.141592653589793;
int main(){
IO;
ll n,p,ans=0,mini=inf;
cin>>n;
forn(i,n){
cin>>p;
if(p<mini)ans++;
mini = min(p,mini);
}
cout<<ans<<'\n';
return 0;
}
|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#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 ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
int main() {
int N, M;
cin >> N >> M;
vector< vector<ll> > dist(N, vector<ll>(N, INF));
REP(i, N) dist[i][i] = 0;
REP(i, M) {
int s, t;
ll d;
cin >> s >> t >> d;
dist[s][t] = d;
}
REP(k, N)
REP(i, N)
REP(j, N)
if(dist[i][j] > dist[i][k] + dist[k][j] && dist[i][k] < INF && dist[k][j] < INF)
dist[i][j] = dist[i][k] + dist[k][j];
REP(i, N)
if(dist[i][i] < 0) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
REP(i, N) {
REP(j, N) {
if(j != 0) cout << " ";
if(dist[i][j] == INF)
cout << "INF";
else
cout << dist[i][j];
}
cout << endl;
}
return 0;
}
| 0 | 98,261,829 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <functional>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
struct point
{
double x;
double y;
};
void koch(int d, point p1, point p2)
{
if (d == 0)
{
return;
}
double th = M_PI * 60.0 / 180.0;
point s, t, u;
s.x = (2.0 * p1.x + p2.x) / 3.0;
s.y = (2.0 * p1.y + p2.y) / 3.0;
t.x = (p1.x + 2.0 * p2.x) / 3.0;
t.y = (p1.y + 2.0 * p2.y) / 3.0;
u.x = s.x + (t.x - s.x) * cos(th) - (t.y - s.y) * sin(th);
u.y = s.y + (t.x - s.x) * sin(th) + (t.y - s.y) * cos(th);
koch(d - 1, p1, s);
printf("%.8f %.8f\n", s.x, s.y);
koch(d - 1, s, u);
printf("%.8f %.8f\n", u.x, u.y);
koch(d - 1, u, t);
printf("%.8f %.8f\n", t.x, t.y);
koch(d - 1, t, p2);
}
void solve()
{
int n;
cin >> n;
point p1, p2;
p1.x = 0.0;
p1.y = 0.0;
p2.x = 100.0;
p2.y = 0.0;
printf("%.8f %.8f\n", p1.x, p1.y);
koch(n, p1, p2);
printf("%.8f %.8f\n", p2.x, p2.y);
}
int main()
{
solve();
return(0);
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#define invrep(i,n) for(int64_t i=n-1;i >= 0;i--)
using namespace std;
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
}else{
rep(i,number){
fspattern_draft.at(floor) = i;
setfspattern_core(floor+1,number,degree);
}
}
}
void setfspattern(int number,int degree){
fspcnt = 0;
int64_t array_num = 1;
rep(i,degree){
array_num *= number;
}
fspattern = vector<vector<int>>(array_num,vector<int>(degree));
fspattern_draft = vector<int>(degree);
setfspattern_core(0,number,degree);
}
int main(){
int64_t n,a,b;
cin >> n >> a >> b;
if((b-a)%2 == 0){
cout << "Alice" <<endl;
}else{
cout << "Borys" << endl;
}
}
| 0 | 85,502,763 |
#include<iostream>
using namespace std;
int main(void){
long n,i,j,cnt=0,tmp;
int a[10000];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
cnt+=a[i];
}
for(i=0;i<n-1;i++){
for(j=n-1;j>i;j--){
if(a[j]>a[j-1]){
tmp=a[j];
a[j]=a[j-1];
a[j-1]=tmp;
}
}
}
cout<<a[n-1]<<" "<<a[0]<<" "<<cnt<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
map<int,int> path;
for(int i=0;i<4;i++){
path[i]=0;
}
for(int i=0;i<3;i++){
int a,b;cin>>a>>b;a--;b--;
path[a]++;
path[b]++;
}
for(int i=0;i<4;i++){
if(path[i]==3){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
return 0;
}
| 0 | 36,629,548 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main()
{
int a, d;
cin >> a >> d;
cout << a / d << " ";
cout << a%d<<" ";
printf("%lf\n", (double)a / d);
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T 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 vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
int main() {
string S; cin >> S;
string T; cin >> T;
vector<pair<char, char>> sp(S.size());
vector<pair<char, char>> tp(S.size());
REP(i, S.size()) {
sp[i] = make_pair(S[i], T[i]);
tp[i] = make_pair(T[i], S[i]);
}
sort(all(sp));
sort(all(tp));
string ans = "Yes";
for(int i = 0; i < S.size() - 1; ++i) {
if(sp[i].first == sp[i + 1].first) {
if(sp[i].second != sp[i + 1].second) {
ans = "No";
}
}
if(tp[i].first == tp[i + 1].first) {
if(tp[i].second != tp[i + 1].second) {
ans = "No";
}
}
}
cout << ans << endl;
}
| 0 | 39,691,790 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define LOL cout<<'\n';
#define MOD 1000000007
#define sz(x) ((int)x.size())
#define INF LONG_LONG_MAX
#define NINF LONG_LONG_MIN
#define deb(x) cout << "[" << (#x) << "=" << x << "]" << '\n';
#define deb2(x,y) cout << "[" << (#x) << "=" << x << "] [" << (#y) << "=" << y << "]" << '\n';
#define deb3(x,y,z) cout << "[" << (#x) << "=" << x << "] [" << (#y) << "=" << y << "] [" << (#z) << "=" << z << "]" << '\n';
const int N=1e5+7;
int n,m,k,q,l,r,x,y,z;
int a[N],b[N],c[N];
string s,t;
int ans=0,cnt=0,f=0;
void solve(){
cin>>n;
ld bb;
cin>>bb;
m=(bb*100+.5);
m=n*m;
m/=100;
cout<<m;LOL
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cout<<setprecision(2);
int _=1;
for(int i=1 ; i<=_ ; i++) solve();
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
using namespace std;
#define REP(i,a,n) for(int i = a ; i < n ; i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
int t[5002];
int main(){
int n;
while(cin>>n,n){
rep(i,n){
cin>>t[i];
}
int ans = INT_MIN;
rep(i,n){
int sum = 0;
REP(j,i,n){
sum += t[j];
if(ans < sum){
ans = sum;
}
}
}
cout<<ans<<endl;
}
}
| 0 | 5,171,276 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string a, b;
cin >> a >> b;
if (a.size() > b.size()) goto lasta;
else if (a.size() < b.size()) goto lastb;
else {
rep(i, a.size()) {
if (a.at(i) < b.at(i)) goto lastb;
else if (a.at(i) > b.at(i)) goto lasta;
}
cout << "EQUAL" << endl;
return 0;
}
lasta:
cout << "GREATER" << endl;
return 0;
lastb:
cout << "LESS" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = LLONG_MAX/4;
const ll MOD = 1e9+7;
const int n_max = 1e5+10;
int main(){
ll n,m; cin >> n >> m;
vector<ll> s(n);
rep(i,n) cin >> s[i];
vector<ll> t(m);
rep(i,m) cin >> t[i];
vector<vector<ll>> dp(n,vector<ll>(m,0)), sum(n+1, vector<ll>(m+1,0));
rep(i,n){
rep(j,m){
if(s[i] != t[j])dp[i][j] = 0;
else dp[i][j] = (sum[i][j] + 1) % MOD;
sum[i+1][j+1] = (sum[i][j+1] + sum[i+1][j] - sum[i][j] + dp[i][j]) % MOD;
if(sum[i+1][j+1] < 0)sum[i+1][j+1] += MOD;
}
}
cout << (sum[n][m] + 1) % MOD << endl;
}
| 0 | 57,200,328 |
#include<bits/stdc++.h>
#define fi first
#define se second
typedef long long ll;
using namespace std;
class shortest_path{
public:
explicit shortest_path(int n):vertex(n),INF(0){}
shortest_path(int n,ll inf):vertex(n),INF(inf){
v2.resize(static_cast<unsigned long>(vertex));
for(int i=0;i<vertex;i++)v2[i].resize(static_cast<unsigned long>(vertex));
for(int i=0;i<vertex;i++){
for(int j=0;j<vertex;j++){
v2[i][j]=INF;
}
}
for(int i=0;i<vertex;i++)v2[i][i]=0;
}
void add_edge(int from,int to,ll cost){
v1[from].emplace_back(to,cost);
}
void add_edge_(int from,int to,ll cost){
v2[from][to]=cost;
}
vector<ll> dijkstra(unsigned int start){
vector<ll> d(static_cast<unsigned long>(vertex),INF);
priority_queue<pair<ll,int> > q;
q.push({start,0});
while(!q.empty()){
int now=q.top().se;
ll now_cost=q.top().fi;
q.pop();
if(d[now]<now_cost)continue;
for (auto &i : v1[now]) {
if(d[i.fi]>now_cost+ i.se){
d[i.fi]=now_cost+ i.se;
q.push({d[i.fi], i.fi});
}
}
}
return d;
}
tuple<vector<vector<ll> >,bool> warshall_floyd(){
for(int k=0;k<vertex;k++){
for(int i=0;i<vertex;i++){
if(v2[i][k]==INF)continue;
for(int j=0;j<vertex;j++){
if(v2[k][j]==INF)continue;
v2[i][j]=min(v2[i][j],v2[i][k]+v2[k][j]);
}
}
}
bool is_negative_cycle=false;
for(int i=0;i<vertex;i++){
if(v2[i][i]<0)is_negative_cycle=true;
}
return make_tuple(v2,is_negative_cycle);
}
tuple<vector<ll>,bool> bellman_ford(int start){
vector<ll> d(static_cast<unsigned long>(vertex),INF);
d[start]=0;
bool is_negative_cycle=false;
for(int i=0;i<vertex;i++){
bool update= false;
for(int j=0;j<vertex;j++){
for(int k=0;k<(int)v1[j].size();k++){
if(d[v1[j][k].fi]>d[j]+v1[j][k].se){
d[v1[j][k].fi]=d[j]+v1[j][k].se;
update= true;
}
}
}
if(i==0 && update)is_negative_cycle=true;
else if(!update)break;
}
return make_tuple(d,is_negative_cycle);
}
private:
ll INF;
int vertex;
vector<vector<pair<int,ll> > > v1;
vector<vector<ll> > v2;
};
int main(){
int v,e;
cin>>v>>e;
shortest_path sp(v,(ll)1e14);
for(int i=0;i<e;i++){
int from,to;
ll cost;
cin>>from>>to>>cost;
sp.add_edge_(from,to,cost);
}
tuple<vector<vector<ll> >,bool> tp=sp.warshall_floyd();
if(get<1>(tp)==1){
cout<<"NEGATIVE CYCLE"<<endl;
}else{
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
if(j==v-1){
if(get<0>(tp)[i][j]==(ll)1e14){
cout<<"INF"<<endl;
}else{
cout<<get<0>(tp)[i][j]<<endl;
}
}else{
if(get<0>(tp)[i][j]==(ll)1e14){
cout<<"INF ";
}else{
cout<<get<0>(tp)[i][j]<<" ";
}
}
}
}
}
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define N 500050
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,ans[N];
char s[N];
ll tot;
int main(){
scanf("%s",s+1);
n=strlen(s+1)+1;
s[0]='>',s[n]='<';
for(int i=1;i<=n;++i){
if(s[i-1]=='>'&&s[i]=='<'){
ans[i]=0;
for(int j=i-1;j>=1;--j){
if(s[j]^'>')break;
ans[j]=max(ans[j],ans[j+1]+1);
}
for(int j=i+1;j<=n;++j){
if(s[j-1]^'<')break;
ans[j]=max(ans[j],ans[j-1]+1);
}
}
}
for(int i=1;i<=n;++i){
tot+=ans[i];
}
printf("%lld\n",tot);
return 0;
}
| 0 | 78,876,647 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll n,m;
cin>>n>>m;
vector<vector<int> > g(n+1);
for(ll i=0;i<m;i++){
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
vector<ll> d(n+1,LONG_MAX);
d[1]=0;
vector<ll> p(n+1,0);
queue<ll> q;
q.push(1);
while(!q.empty()){
ll tp=q.front();
q.pop();
for(ll i=0;i<g[tp].size();i++){
if(d[g[tp][i]]==LONG_MAX){
d[g[tp][i]]=d[tp]+1;
p[g[tp][i]]=tp;
q.push(g[tp][i]);
}
}
}
bool flag=false;
for(int i=2;i<(n+1);i++){
if(p[i]==0){
flag=true;
break;
}
}
if(flag){
cout<<"No"<<endl;
}
else{
cout<<"Yes"<<endl;
for(int i=2;i<(n+1);i++){
cout<<p[i]<<endl;
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <cstring>
#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 <cmath>
#include <numeric>
#include <float.h>
#include <math.h>
#include <sstream>
#include <iterator>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define vi vector<int>
#define vl vector<ll>
const long long INF = 1LL << 60;
typedef long long ll;
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 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;
}
}
bool is_prime(const unsigned n){
switch(n){
case 0:
case 1: return false;
case 2:
case 3: return true;
}
if(n % 2 == 0 || n % 3 == 0) return false;
for(unsigned i = 5; i * i <= n; i += 6) {
if(n % i == 0) return false;
if(n % (i+2) == 0) return false;
}
return true;
}
map<int,int> mp;
int primeFactorization(int a){
int i,sq;
if(a%2==0){
if(!mp.count(2)){
mp[2] = 1;
}
else{
mp[2] +=1;
}
return primeFactorization(a/2);
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
if(!mp.count(i)){
mp[i] = 1;
}
else{
mp[i] += 1;
}
return primeFactorization(a/i);
}
}
if(a!=1){
if(!mp.count(a))
mp[a] = 1;
else{
mp[a] += 1;
}
}
return 0;
}
ll kaizyou(ll n){
if(n == 1){
return 1;
}
else{
return (n * kaizyou(n-1)) % 1000000007;
}
}
int main(){
ll N,A,B; cin >> N >> A >> B;
if(A > B) cout << 0 << endl;
else{
if(A != B && N == 1) cout << 0 << endl;
else{
cout << (B * (N - 1) + A) - (A * (N-1) + B) + 1<< endl;
}
}
}
| 0 | 807,087 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int main() {
int n;
cin >> n;
string s;
cin >> s;
char color = s[0];
int ans = 1;
for (int i = 1; i < n; i++) {
if (color != s[i]) {
ans++;
color = s[i];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < min(k, 50); i++){
vector<int> imos(n);
for(int j = 0; j < n; j++){
int l = max(0, j-a[j]);
int r = min(n-1, j+a[j]);
imos[l]++;
if(r+1 <= n-1){
imos[r+1]--;
}
}
for(int k = 0; k < n; k++){
if(k > 0){
imos[k] += imos[k-1];
}
}
for(int l = 0; l < n; l++){
a[l] = imos[l];
}
}
for(int i = 0; i < n; i++){
cout << a[i] << " ";
}
}
| 0 | 82,107,337 |
#include "bits/stdc++.h"
using namespace std;
struct Node{
int parent,left,right;
};
Node T[100005];
int n,D[1000005];
void setDepth(int u, int p){
D[u]=p;
if(T[u].right!=-1){
setDepth(T[u].right,p);
}
if(T[u].left!=-1){
setDepth(T[u].left,p+1);
}
}
int main(){
int i=0,j=0,k=0,c=0,l=0,r=0,Tc=0;
int id=0;
cin>>n;
for(i=0;i<n;i++){
T[i].parent=T[i].left=T[i].right=-1;
}
for(i=0;i<n;i++){
cin>>id>>k;
for(j=0;j<k;j++){
cin>>c;
if(j==0)T[id].left=c;
else T[l].right=c;
l=c;
T[c].parent=id;
}
}
for(i=0;i<n;i++){
if(T[i].parent==-1){
r=i;
}
}
setDepth(r,0);
for(i=0;i<n;i++){
printf("node %d: parent = %d, depth = %d, ",i,T[i].parent,D[i]);
if(T[i].parent==-1)cout<<"root, ";
else if(T[i].left==-1)cout<<"leaf, ";
else cout<<"internal node, ";
cout<<"[";
for(j=0,Tc=T[i].left;Tc!=-1;j++,Tc=T[Tc].right){
if(j)cout<<", ";
cout<<Tc;
}
cout<<"]"<<endl;
}
return 0;
}
|
#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;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
int W, H;
cin >> W >> H;
ll P[W], Q[H];
for (int i = 0; i < W; i++) {
cin >> P[i];
}
for (int i = 0; i < H; i++) {
cin >> Q[i];
}
sort(P, P+W);
sort(Q, Q+H);
int p = 0, q = 0;
ll ans = 0LL;
for (int i = 0; i < W + H; i++) {
if (q == H || (p < W && P[p] < Q[q])) {
ans += P[p] * (H + 1 - q);
p++;
} else {
ans += Q[q] * (W + 1 - p);
q++;
}
}
cout << ans << "\n";
return 0;
}
| 0 | 40,695,595 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define double long double
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x, c) for (auto&& x : (c))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
#define endl _endl
const char _endl = (cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout.precision(16), '\n');
int main() {
ll a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
const int maxn = int(1e5) + 7;
using namespace std;
ll inf=1e9+7;
ll a[900009];
ll sum[20];
int main()
{
ll h,w,n;
scanf("%lld%lld%lld",&h,&w,&n);
ll x,y;
int k=0;
ll zo=(h-2)*(w-2);
for(ll i=1;i<=n;i++)
{
scanf("%lld%lld",&x,&y);
for(ll i=0;i<=2;i++)
for(ll j=0;j<=2;j++)
{
if(x-i>=1&&x-i<=h-2&&y-j>=1&&y-j<=w-2)
{
a[k++]=inf*(x-i)+(y-j);
}
}
}
sort(a,a+k);
ll t=1;
for(int i=0;i<k;i++)
{
if(a[i]==a[i+1])t++;
else
{
sum[t]++;t=1;zo--;
}
}
cout<<zo<<endl;
for(int i=1;i<=9;i++)
{
cout<<sum[i]<<endl;
}
}
| 0 | 26,516,790 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
const long long INF=1LL<<60;
long long dp[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)dp[i]=INF;
dp[0]=0;
for(int i=1;i<n;i++){
dp[i]=min(dp[i],dp[i-1]+abs(a[i]-a[i-1]));
if(i>1)dp[i]=min(dp[i],dp[i-2]+abs(a[i]-a[i-2]));
}
cout<<dp[n-1]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((int)(x).size())
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<typename T> void view(T e){std::cout << e << std::endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
const int inf = 1 << 30;
const ll INF = 1LL << 60;
int main(){
int x;
cin >> x;
int mx = 0;
rep(i,21) rep(j,21) rep(k,21) rep(l, 21) rep(m, 21) rep(n,21){
int mon = 100 * i + 101 * j + 102 * k + 103 * l + 104 * m + 105 * n;
if (mon == x){
cout << 1 << endl;
return 0;
}
chmax(mx, mon);
}
if (x < mx){
cout << 0 << endl;
}else{
cout << 1 << endl;
}
return 0;
}
| 0 | 57,846,956 |
#include"bits/stdc++.h"
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N), B(N);
for (int64_t i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
int64_t ans = 0;
for (int64_t i = 0; i < N; i++) {
if ((A[i] | K) == K) {
ans += B[i];
}
}
for (int64_t i = 0; i < 30; i++) {
if ((K & (1LL << i)) == 0) {
continue;
}
int64_t Ki = K;
Ki ^= (1LL << i);
for (int64_t j = 0; j < i; j++) {
Ki |= (1LL << j);
}
int64_t curr = 0;
for (int64_t j = 0; j < N; j++) {
if ((A[j] | Ki) == Ki) {
curr += B[j];
}
}
ans = max(ans, curr);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isSubstring(s1,s2) s1.find(s2) != std::string::npos
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define vpi <vector<pair<int,int>>
#define vi vector<int>
#define sz(a) (int)a.size()
#define endl "\n"
#define nl cout<<"\n";
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MN INT_MIN
#define MX INT_MAX
bool isPrime(ll n){if(n<2)return false;for(ll x = 2;x*x <=n;x++){if(n%x == 0)return false;}return true;}
bool isPerfectSquare(long double x){long double sr=sqrt(x);return((sr-floor(sr))==0);}
int gcd(int a, int b){if(a==0)return b;if(b==0) return a;if(a==b)return a;if(a>b)return gcd(a-b,b);return gcd(a,b-a);}
int32_t main()
{
int a,b;
cin >> a >> b;
if(a < b)
swap(a,b);
for(int i = 0;i<a;i++)
cout << b;
}
| 0 | 32,460,187 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
const ll INF=LLONG_MAX;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int x,y; cin >> x >> y;
x--; y--;
cout << x*y;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for(int i = 0; i < N; i++){
cin >> A[i];
}
A[N] = 0;
long long kane = 1000;
long long kabu = 0;
for(int i = 0; i < N; i++){
if(A[i] < A[i + 1]){
if(kabu == 0){
kabu = kane / A[i];
kane = kane % A[i];
}
}else if(A[i] > A[i + 1]){
kane += kabu * A[i];
kabu = 0;
}
}
cout << kane << endl;
}
| 0 | 6,156,794 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k;
cin >> n >> k;
int v[n];
rep(i, n) cin >> v[i];
int ans = 0;
for (int a = 0; a <= min(n, k); ++a) {
vector<int> g;
rep(i, a) g.push_back(v[i]);
for (int b = 0; b <= min(n, k) - a; ++b) {
vector<int> h;
copy(g.begin(), g.end(), back_inserter(h));
rep(i, b) h.push_back(v[n - i - 1]);
sort(h.begin(), h.end());
int res = k - (a + b);
int cur = 0;
int m = h.size();
rep(i, min(res, m)) if (h[i] < 0)++ cur;
int sum = 0;
while (cur < m) sum += h[cur++];
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define MN 200000
int n,cnt=0;
bool e[MN+5];
int d[MN+5],hd[MN+5],to[MN+5],nxt[MN+5],rn=0;
struct STACK{
int tp,m[MN+5];
STACK(){tp=0;}
bool empty(){return tp==0;}
int top(){return m[tp];}
void push(int x){m[++tp]=x;}
void pop(){--tp;}
}s;
inline void add(int u,int v){
++rn; d[u]++;
nxt[rn]=hd[u],hd[u]=rn;
to[rn]=v;
}
int main(){
memset(hd,0xff,sizeof(hd));
memset(d,0,sizeof(d));
memset(e,true,sizeof(e));
scanf("%d",&n);
for(int i=1;i<n;i++){
int u,v;
scanf("%d%d",&u,&v);
add(u,v),add(v,u);
}
for(int i=1;i<=n;i++){
if(d[i]==1)s.push(i);
}
while(!s.empty()){
int u=s.top(); s.pop();
if((!e[u])||(d[u]<=0))continue;
e[u]=false; cnt++;
for(int i=hd[u];i!=-1;i=nxt[i]){
if((!e[to[i]])||(d[to[i]]<=0))continue;
e[to[i]]=false; cnt++;
for(int j=hd[to[i]];j!=-1;j=nxt[j]){
d[to[j]]--;
if(d[to[j]]==1)s.push(to[j]);
}
}
}
puts(cnt==n?"Second":"First");
}
| 0 | 7,478,985 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
enum Color : int64_t { kRed = 0, kGreen, kTrans };
vector<pair<int64_t, Color>> apples;
for (int64_t i = 0; i < A; ++i) {
int64_t z;
cin >> z;
apples.emplace_back(z, kRed);
}
for (int64_t i = 0; i < B; ++i) {
int64_t z;
cin >> z;
apples.emplace_back(z, kGreen);
}
for (int64_t i = 0; i < C; ++i) {
int64_t z;
cin >> z;
apples.emplace_back(z, kTrans);
}
sort(apples.begin(), apples.end());
reverse(apples.begin(), apples.end());
int64_t result = 0;
int64_t count_red = 0;
int64_t count_green = 0;
int64_t count_trans = 0;
for (const auto &apple : apples) {
const int64_t value = apple.first;
const Color color = apple.second;
if (color == kRed) {
if (count_red < X) {
result += value;
++count_red;
}
} else if (color == kGreen) {
if (count_green < Y) {
result += value;
++count_green;
}
} else {
result += value;
++count_trans;
}
if (count_red + count_green + count_trans == X + Y) {
break;
}
}
cout << result << endl;
return 0;
}
|
#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main(){
string bottun[10] = { "0", ".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
queue<char> str;
int n, i;
cin >> n;
while( n-- > 0 ){
char s[1025];
cin >> s;
for( i = 0; s[i] != '\0'; i++ ){
str.push(s[i]);
}
int t = 0, num = 0;
while( !str.empty() ){
if( str.front() == '0' && num != 0 ){
cout << bottun[num][(t-1)%bottun[num].length()];
t = 0;
}
num = (int)(str.front() - '0');
str.pop();
if( num != 0 ) t++;
}
cout << endl;
}
}
| 0 | 13,265,498 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.