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... | 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... | #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++... | 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; ... | #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 = vecto... | 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+... | #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 ... | 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
#de... | #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 namespac... | 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 ... | #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 ... | 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;
f... | #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 ... | 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}... | #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];
}
... | 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... | #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;
usi... | #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) ? "Y... | 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];
... | #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... | 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;
... | # 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{
c... | 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++;... | #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;
... | 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 IN... | #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;
}
i... | 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;
... | #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 ... | 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);
freop... | 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... | #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,... | 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;
... | 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 ... | #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;
... | 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... | 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(a... | #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" << ... | 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... | #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 {... | 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 ... | #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]);... | 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... | #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(i... | 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) { \
... | #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... | 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... | #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;
... | 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... | #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 | 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... | #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[... | 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... | #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)
... | 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;
els... | #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--){
... | 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 - ... | #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 << ... | 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 po... | #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... | 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... | #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];... | 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(a... | #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... | 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;
... | #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;
... | 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>
#in... | #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>
#... | 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(short... | 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;
... | #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){
... | 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(... | 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++) {
... | #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++) {
... | 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() +... | #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... | 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 {
... | #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;
templat... | 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... | 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){
... | #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 ... | 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));
... | #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... | 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 = ... | 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()... | #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... | 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>
#i... | 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... | #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("l... | 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... | #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++) {
in... | 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, ... | #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(i... | 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;
t... | 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... | #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;
} e... | 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);
}
... | #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;... | 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]));
}
... | #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);
... | #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.... | 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... | #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!=... | 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 ... | 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(... | #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.... | 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-y... | #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 | 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>
#incl... | #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;
... | 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;
... | 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 do... | #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)... | 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 ... | #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;
... | 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_ba... | 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 =... | #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),w... | 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:... | #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[... | 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))
#defin... | #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++) {
... | 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 <= ... | #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; }
templa... | 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)... | #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 = ... | 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 ... | #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;
t... | 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 ... | #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_s... | 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... | #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){i... | 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<(i... | #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 >>... | 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 ... | #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... | 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... | #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);
... | 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, c... | #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 ... | 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 ... | #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... | 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);
}
cou... | #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... | 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)
{... | 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... | #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 ... | 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 <... | #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... | 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... | 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>
#includ... | #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);... | 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.... | #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,... | 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;... | #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.a... | 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... | #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;
... | 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... | 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_... | #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];
i... | 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()) g... | #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";
#def... | 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;... | #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];
... | 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.... | #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>
#incl... | 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 ... | #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]);
... | 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;
... | #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.t... | 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) ((... | #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);
... | 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+... | #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) ((in... | 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];
... | #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 isS... | 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;
typede... | #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];
... | 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... | #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... | 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... | #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... | 0 | 13,265,498 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.