code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
long A,B;
string... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 75,160,951 |
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int sum = 0;
for (int i = 0; i < (int)s.length() && s[i] != '\0'; i++) {
sum += s[i] - '0';
}
if (sum % 9 == 0) {
cout << "Yes\n";
} else {
cout ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int dp[101];
vo... | 0 | 82,220,634 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, P;
string S;
cin >>N >> P >> S;
vector<int>NUM(S.size()+1);
NUM[0] = 0;
int num = 0;
int ten = 1;
for (int n = 0;n<S.size();++n) {
int m = S[S.size()-1-n] - '0';
ten *= 10;
ten %= P;
num = (ten * m + num)%P;
NUM[n+1] = num;
}
long lo... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | 0 | 93,176,053 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int n, M;
ll ans = 0, num = 0;
int main()
{
cin >> n >> M;
vector<pair<long long, long long>> a(n);
rep(i, 0, n)
{
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.en... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 15,687,647 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <sstream>
#include <unord... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INFLL (1ll<<60)
static const int MAX=200000;
int N;
ll a[MAX],sum;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cin>>N;
cin>>a[0];
for(int i=1;i<N;i++){
cin>>a[i];
a[i]+=a[i-1];
}
ll min_d=INFLL;... | 0 | 25,975,561 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
string S;
int ans = 10000;
cin >> S;
rep(i,S.size()-2){
string A = S.substr(i,3);
int n = stoi(A);
int a = abs(753-n);
ans = min(ans,a);
}
cout << ans;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
int H, W, M;
int numH[300010], numW[300010];
vector<int> vW[300010];
vector<int> vH[300010];
signed main()
{
cin >> H >> W >> M;
rep(i, M)
{
int h, w;
cin >> h >... | 0 | 20,691,334 |
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
void go(){
int n,k;cin>>n>>k;
int x=1;... | #include <iostream>
using namespace std;
int main()
{
string s;
int n, h;
while (1) {
cin >> s >> n;
if (s == "-") break;
while (n--) {
cin >> h;
string t;
t += s.substr(h, s.length() - h);
t += s.substr(0, h);
s = t;
... | 0 | 93,477,795 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
int r_max = (N+R-1)/R;
int g_max = (N+G-1)/G;
rep(i,r_max+1)rep(j,g_max+1){
int k = (N - i*R - j*G)/B;
if (k < 0 ) break;
if (i*R... | #include <iostream>
using namespace std;
int fx(int x)
{
return x * x;
}
int main()
{
int i, d, s;
while(cin >> d)
{
s = 0;
for(i = 1; d * i <= (600 - d); i++)
{
s = s + fx(d * i) * d;
}
cout << s << endl;
}
return 0;
} | 0 | 18,723,608 |
#include<bits/stdc++.h>
using namespace std;
int x,y,a,b,c;
int main(){
cin>>x>>y>>a>>b>>c;
priority_queue<int,vector<int>,greater<int> >pq_a;
priority_queue<int,vector<int>,greater<int> >pq_b;
priority_queue<int,vector<int>,less<int> >pq_c;
while(a--){
int a;
cin>>a;
pq_a.push(a);
}
while(b--){
int a;
... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 0 | 15,755,746 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if(N%2 == 1){
cout << "No" << endl;
return 0;
}
int n = N/2;
if(S.substr(n) == S.substr(0,n)){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int maxn=112345;
int h,w,n,a[maxn],b[maxn];
long long num[10];
set<pii> st,vis;
inline void add(int x,int y) {
int cnt=0;
for (int i=x-1;i<=x+1;++i)
for (int j=y-1;j<=y+1;++j)
if (st.find(pii(i,j))!=st.end())
... | 0 | 33,878,409 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> X, Y;
for (ll i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
X.push_back(x);
Y.push_back(y);
}
bool even = (X[0] + Y[0]) % 2 == 0 ? true : false;
for (ll i = 0; i < N; i++) {
bool e = (X[i] + Y[i]... | 0 | 66,585,627 |
#include <bits/stdc++.h>
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++)
typedef long long ll;
bool comp(const pair<ll, ll> v1, pair<ll, ll> v2) {
return v1.first - v1.second > v2.first - v2.second;
}
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> vp(n);
rep(i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
int main() {
int H, W;
cin>... | 0 | 68,088,292 |
#include<iostream>
#include<algorithm>
#include<stack>
#include<string>
using namespace std;
#define REP(i, b, e) for ( int i = b; i < (int)e; i++ )
#define rep(i, n) REP(i, 0, n)
bool check(string line){
stack<char> S;
char ch;
for ( int i = 0; i < line.size()-1; i++ ){
if ( line[i] == '(' ){
S.push('(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 0 | 46,017,454 |
#include <iostream>
int main() {
std::string s, t;
std::cin >> s >> t;
int m = 0;
for (int i = 0; i < 3; i++) {
if (s[i] == t[i]) {
m++;
}
}
std::cout << m << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 11,398,035 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(void) {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 1; i <= N; i++) {
int a;
std::cin >> a;
A[a-1]++;
}
std::sort(A.begin(), A.end());
std::vector<int> Sum(N+1);
for (int i = 0; i < N; i++) {
Sum[i+1] = Sum[i]+A[i];
}
fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 | 96,706,891 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
ll const mod = 1e9+7;
int main() {
... | 0 | 10,101,140 |
#include<bits/stdc++.h>
#define ntest 0
using namespace std;
int n;
long long res;
void solve() {
cin >> n;
for (int i = 1; i < n; ++i) res += (n-1)/i;
cout << res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
if(ntest){
int t;
cin >> t;
while(t--) solve();
} e... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
int vs[200000+10];
ll hs[200000+10];
int main(void) {
int n;
scanf("%d", &n);
REP(i, n) {
scanf("%d", &vs[i]);
hs[vs[i]]++;
}
ll total = 0;
REP(i, n... | 0 | 82,713,770 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
int main() {
int h, w, k;
int h1, w1;
int h2, w2;
int i, j;
int q1, q2;
int buf;
int cc;
int kc = 0;
int count = 0;
cin >> h >> w >> k;
char c;
vector<vector<int>> s(h);
vector<int> h_num(h);
vector<int> h_buf;
vector<int> w_num(w);
vect... | #include<iostream>
#include<string>
using namespace std;
int main(){
string command,q,str,str1,p;
int n,a,b,c,d;
cin>>str>>n;
for(int i=0;i<n;i++){
cin>>command>>a>>b;
if(command=="print"){
q=str.substr(a,b-a+1);
cout<<q<<endl;
}
if(command=="rever... | 0 | 40,405,803 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b.at(i);
vector<int> a(n);
a.at(0) = b.at(0);
rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
char A[n][n];
char B[m][m];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) cin >> A[i][j];
}
for (int i = 0; i < m; ++i) {
for (int j = 0;... | 0 | 71,737,580 |
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A, typename B>
string to_s... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
double pi = acos(-1.0);
const double EPS=1e-9;
#define MOD ll(1e9L+7)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define t() ll tt;cin>>tt;while(tt--)
#define t2() ll tt2; cin>>tt2; for(ll tti=1;tti<=tt2;tti+... | 0 | 70,205,268 |
#include <stdio.h>
int main(){
int i,x;
for(i=1;i<=1000000;i++){
scanf("%d",&x);
if(x==0){
break;
}
printf("Case %d: %d\n",i,x);
}
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); i++)
#define REP(i,n) for (int i=0; i<(n); i++)
#define RREP(i,n) for (int i=(n-1); i>=0; i--)
#defin... | 0 | 47,579,562 |
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
const int MOD = 1000000007;
using namespace std;
int main(){
int N,A;
cin >> N >> A;
if((N % 500) >A){
cout << "No" << endl;
}else{
cout << "Yes" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
const int N = 1e3 + 5;
int n, x[N], y[N], cnt[2];
vector<int> d;
string ans[N];
bool in (int lim, int x, int y) { return x + y <= lim && x + y >= -lim && x - y >= -lim && x - y <= lim; }
signed main () {
ios_base::sync_with_stdi... | 0 | 24,042,184 |
#include<stdio.h>
void proc(int n,int x){
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
for(int k=j+1;k<=n;k++){
if(i+j+k==x)++cnt;
else if(i+j+k>x)break;
}
}
}
printf("%d\n",cnt);
}
int main(){
while(true){
int a,b;
scanf("%d%d",&a,&b);
if(!a&&!b)break;
proc(a,b);
}
... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<string> sv;
rep(i, n) cin >> a.at(i);
sort(a.begin(), a.end());
vector<int> p, m;
p.push_back(a.at(n-1));
m.push_back(a.at(0));
for(int i... | 0 | 25,442,148 |
#include <stdio.h>
#include <string.h>
char s[100001];
int words[30]={};
int main(){
scanf("%s",s);
int len=strlen(s);
if (s[0]==s[1]) {
printf("1 2");
return 0;
}
words[s[0]-'a']++,words[s[1]-'a']++;
for (int i=2; i<len; i++) {
if ((++words[s[i]-'a'])>1) {
pr... | #include <bits/stdc++.h>
using namespace std;
int last(int &a, int &b, int &c, int &d, int &e){
for (int i=1; i<=9; i++){
if (a%10==i){
return a%10;
}
if (b%10==i){
return b%10;
}
if (c%10==i){
return c%10;
}
if (d%10==i){
return d%10;
}
if (e%10==i){
... | 0 | 71,814,933 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | 0 | 91,977,626 |
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; ++i)
#de... | #include<bits/stdc++.h>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class... | 0 | 7,315,283 |
#include<iostream>
#include<cstdio>
using namespace std;
int n,s,count;
int solve(int i,int sum,int used){
if(i==10){
if(s==sum&&used==n){
count++;
}
return count;
}
solve(i+1,sum+i,used+1);
solve(i+1,sum,used);
return count;
}
int main(){
while(cin>>n>>s,n||s){
count=0;
cout<<solve(0,0,0)<<endl;
}
ret... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 0 | 38,799,361 |
#include <iostream>
#include <vector>
#include <queue>
using std::vector;
using std::queue;
void minimum_paths(int n_v, vector<int> graph[], int paths[]) {
queue<int> visits;
int found[n_v];
std::fill_n(found, n_v, 0);
found[0] = 1;
visits.push(0);
while(! visits.empty()) {
int id = visi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 79,453,685 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
cin... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 0 | 21,550,057 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
int main(){
ll n;... | 0 | 49,914,455 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long h, w;
cin >> h >> w;
long long result;
if (h == 1 || w == 1) {
result = 1;
} else if (h % 2 == 1 && w % 2 == 1) {
result = h * w / 2 + 1;
} else {
result = h * w / 2;
}
cout << result << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
#include <cstdio>
using namespace std;
int main(void)
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = (x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);
double y = sqrt(x);
printf("%.4f\n", y);
return 0;
} | 0 | 94,478,662 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, ... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector a(n,0LL);
for (int i=0; i<n; i++) cin >> a[i];
vector bits(2, vector(60,0LL));
for (int i=0; i<n; i++) {
for (int j=0; j<60; j++) {
bits[(a[i]>>j)&1][j]++;
bits[(a[i]>>... | 0 | 18,913,147 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s;
cin >> s;
string t0, t1;
for(long long i = 0; i < s.size(); i++){
if(i % 2 == 0){
t0.push_back('0');
t1.push_back('1');
}
else{
t0.push_back('1');
t1.p... | 0 | 15,753,688 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for(int i=0; i<5; i++) cin >> a[i];
sort(a, a+5, greater<int>() );
for(int i=0; i<4; i++) printf("%d ",a[i]);
printf("%d\n",a[4]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | 0 | 64,783,730 |
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,Q;
cin >> n >> Q;
atcoder::dsu d(n);
while(... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(... | 0 | 1,179,623 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, A = 1;
cin >> N >> K;
for (int i = 0; i < N; i++) {
if (A * 2 < A + K) A *= 2;
else {
for (; i < N; i++) A += K;
break;
}
}
cout << A << endl;
} | #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 | 43,059,055 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize ("-ffloat-store")
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<(n);++i)
#define repA(i,j,n) for(i=(j);i<=(n);++i)
#define repD(i,j,n) for(i=(j);i>=(n)... | #include<stdio.h>
#include<stdlib.h>
int main()
{
int a,b,c,d,m,n,x=0,y;
scanf("%d%d%d%d",&a,&b,&c,&d);
m=abs(a-b);
n=abs(b-c);
y=abs(a-c);
if((m<=d && n<=d == 1)||y <= d)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | 0 | 2,634,916 |
#include<bits/stdc++.h>
using namespace std;
long long int a[200005],sum[200005];
int main()
{
map<long long int ,long long int >mp;
int n,k;
long long int ans=0;
cin>>n>>k;
sum[0]=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
for(int i=0;i<=n;i++)
{
if(i>=k) {
mp[(sum[i-k]-(i-k))%k]-... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
char tbl[100][100];
int main(){
long a,b;
cin >> a >> b;
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
tbl[i][j] = '.';
tbl[50+i][j] = '#';
}
}
int count=1;
for(int i=0; i<50... | 0 | 25,309,765 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define POF pop_front
#define POB pop_back
#define MA make_pair
#define ll long lon... | #include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 0 | 53,735,724 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll LCD(ll a,ll b){
if(a<b) swap(a,b);
while(b){
ll t = a%b;
a = b;
b = t;
}
return a;
}
int main(){
int n;
cin>>n;
vector<ll>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
ll lcm = 1;
for(int i=0; i<n; i++){
ll lcd = LCD(arr[i],lcm);
lc... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<vector<pair<int, int>>> edge(N + 1,
vector<pair<int, int>>());
int a, b, c;
for (int i = 0; i < N - 1; i++) {
scanf("%d %d %d", &a, &b, &c);
edge[a].insert(edge[a].end(), make_pair(b... | 0 | 52,828,347 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define int long long
signed main(){
int a,b,c,d,e;
while( scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e) != EOF ){
vector<int> data{a,b,c,d,e};
sort(data.begin(), data.en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const string YES = "Yes";
const string NO = "No";
void solve(long long H, long long W, std::vector<std::string> s) {
vector<pair<ll, ll>> dir{pair<ll, ll>(-1, 0), pair<ll, ll>(1, 0), pair<ll, ll>(... | 0 | 34,165,757 |
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
ll n;
scanf("%lld",&n);
ll mini=1000000000000000000;
for (ll i=1;i*i<=n;i++)
{
if (n%i==0)
{
ll val1=i;
ll val2=(n/i);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ... | 0 | 34,283,359 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,h,g,br=0;
cin >> h >> n;
for (int i=0;i<n;i++)
{
cin >> g;
br+=g;
}
if(br>=h)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll N;
cin >> N;
vector<string> S(N," ");
ll S_alpha[N][26];
memset(S_alpha,0,sizeof(S_alpha));
for(int i = 0; i < N; i++){
cin >> S[i];
for(int j = 0; j < 26; j++){
for(int k = 0; k < ... | 0 | 44,684,271 |
#include<stdio.h>
int main(){
char S1;
char S2;
char S3;
scanf("%c %c %c",&S1,&S2,&S3);
if(S1==S2,S1!=S3,S2!=S3){
puts("Yes");
}
else if(S1==S3,S1!=S2,S3!=S2){
puts("Yes");
}
else if(S2==S3,S1!=S2,S1!=S3){
puts("Yes");
}
else {
puts("No");
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 56,481,796 |
#include <bits/stdc++.h>
#ifdef atclib
#include <atcoder/all>
#endif
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define vi std::vector<int>
#defi... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<int>V(n);
for(int i=0;i<n;i++)cin>>V[i];
sort(V.begin(),V.end());
int sum=0;
for(int i=1;i<n-1;i++)sum+=V[i];
sum/=(n-2);
cout<<sum<<end... | 0 | 84,635,541 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 84,925,001 |
#include <bits/stdc++.h>
using namespace std;
void swap(string& card1, string& card2) {
string tmp = card1;
card1 = card2;
card2 = tmp;
}
int peek_number(string card) {
return atoi(&card[1]);
}
vector<string> bubble_sort(vector<string> cards) {
for (int i = 0; i < cards.size(); i++) {
for (int j = cards.size() -... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int maxn=112345;
int h,w,n,a[maxn],b[maxn];
long long num[10];
map<pii,int> mp;
int main()
{
scanf("%d%d%d",&h,&w,&n);
for (int i=1;i<=n;++i)
scanf("%d%d",&a[i],&b[i]);
for (int i=1;i<=n;++i) {
int x=a[i],y=b[i];
... | 0 | 82,018,777 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
if(s[0]=='R')
{
if(s[1]=='R')
... | #include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main()
{
unordered_map<char, bool> m;
string l = "qwertasdfgzxcvb";
string r = "yuiophjklnm";
for (auto&& i : l) {
m[i] = false;
}
for (auto&& i : r) {
m[i] = true;
}
while (true) {
... | 0 | 67,977,255 |
#include <bits/stdc++.h>
#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 rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using namespa... | #include <cstdio>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
using namespace std;
const int max_n = 10, INF = 100000000;
struct edge{ int to, cost; };
typedef pair<int, int> P;
int n;
vector<edge> g[max_n];
int d[max_n];
bool exi[max_n];
void dijkstra(int s){
priority_queue<P, vector<P>,... | 0 | 94,744,552 |
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
void chmax(Int& a, Int b) { if (a < b) { a = b; } }
int main() {
int N;
cin >> N;
vector<Int> a(N + 1);
for (int i = 1; i <= N; ++i) { cin >> a[i]; }
vector<Int> dp(N + 1, 0);
dp[0] = 1000;
for (int i = 1; i <= N; ++i) {
chmax(dp[i], dp[i - 1]);... | #include<iostream>
using namespace std;
int main()
{
int top;
int a, b, c;
int N;
cin >> N;
for (int i = 0; i < N; i++){
cin >> a >> b >> c;
if (a > b)
top = a;
else top = b;
if (c > top)
top = c;
if (top == a){
if ((a * a) == ((b * b) + (c * c)))
cout << "YES" << endl;
else cout << "NO" ... | 0 | 96,330,985 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n-1); i >= (int)(s); i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll LINF = LLONG_MAX;
const ... | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | 0 | 47,152,936 |
#include <bits/stdc++.h>
using namespace std;
#ifdef zxc
#include <sys/resource.h>
#include "debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using ll = int64_t;
using ld = long double;
const ld EPS = 1e-9;
const ld PI = 3.141592653589793;
const ... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
struct pnt{
int cost, y, x;
};
vector<vector<in... | 0 | 64,248,504 |
#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 = (int)(n)-1; i>=0; --i)
#define For(i,a,b) for(auto i=(a);i<=(b);++i)
#define rFor(i,a,b) for(auto i=(b);i>=(a);--i)
#define call(var) cerr<<#var<<"="<<var<<"\n";
#define dup(x,y) (((x)+(y)-1... | #include<iostream>
#include<cstdio>
#include<map>
using namespace std;
char str[1000000];
typedef pair<char,char>P;
int main(){
int n,k;
P sezi[100];
while(1){
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin>>sezi[i].first>>sezi[i].second;
}
cin>>k;
for(int i=0;i<k;i++){
... | 0 | 20,600,904 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m, ans;
ans = 0;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; i++){
cin >> h[i];
}
int a, b;
vector<int>g(n,1);
for (int i = 0; i < m; i++){
cin >> a >> b;
if (h[a - 1] <= h[b - 1]) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod ll(1e9+7)
#define inf ll(1e9)
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n,m;
cin>>n>>m;
map<int,int>rel;
for(int i=0; i<m; i++){
int num;
cin>... | 0 | 20,994,936 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 30,493,839 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #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> a(n);
rep(i,n) {
int x;
cin >> x;
a[x-1]++;
}
sort(a.begin(), a.end());
vector<int> s(n+1);
rep(i,n) s[i+1] = ... | 0 | 84,461,474 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
... | 0 | 54,240,348 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<vector<char> >ar(n,vector<char>(m));
vector<vector<long long int> >dp(n,vector<long long int>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>ar[i][j];
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const ... | 0 | 45,422,340 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n, h, w;
cin >> n >> h >> w;
int ans = 0;
rep(i, n) {
int a, b;
cin >> a >> b;
if (a >= h && b >= w) ans++;
}
cout ... | #include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include... | 0 | 10,861,032 |
#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, k;
cin >> k >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int dis = 0;
rep(i, n)
{
if (i < ... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 34,817,878 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | #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 | 12,369,358 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
const int mod = 1e9 + 7;
typedef long long ll;
int n;
ll gt[maxN], igt[maxN];
int a[maxN], vis[maxN];
ll Pow(ll a, ll b) {
if (b == 0) return 1;
ll t = Pow(a, b / 2);
t = (t * t) % mod;
if (b % 2) return (t * a) % mod;
return t;
}
void i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int H, W;
cin >> H >> W;
int left[H][W], right[H][W], up[H][W], down[H][W];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
left[i][j] = 0;
right[i][j] = 0;
up[i][j] = 0;
down[i][j] = 0;
}
}
vector... | 0 | 17,212,983 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
int N = 0;
cin >> N;
string in[N];
string out[N];
for(int i = 0; i < N; ++i){
cin >> in[i];
out[i] = in[i];
}
for(int i = 0; i < N; ++i){
for(int j = N - 1; j > i; --j){
if(out[j].at(1) < out[j - 1].at(1)){
str... | 0 | 79,695,800 |
#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=1LL<<61;
int main() {
ll a,p;
cin >> a >> p;
p+=a*3;
cout << p/2 << endl;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 2,327,433 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N, C, K;
cin >> N >> C >> K;
vector<int> T(N);
for (int i = 0; i < N; i++)
{
cin >> T[i];
}
int busCnt = 0;
int passnger = 0;
sort(T.begin(), T.end(), less<int>());
int tbegin = T[0];... | 0 | 42,886,405 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a, b;
cin >> a >> b;
if(a.size() < b.size()){
cout << "LESS" << endl;
} else if(a.size() > b.size()){
cout << "GREATER" << endl;
} else {
int i;
for(i = 0; i < a.size(); i++){
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include<limits.h>
#include<iomanip>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
#define ALL(v) v.begin(),v.end()
#define RALL(v) ... | 0 | 7,190,738 |
#include<iostream>
#include<algorithm>
using namespace std;
long a,b;main(){cin>>a>>b;cout<<(abs(a-b)<2?"Brown":"Alice")<<endl;} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define em emplace_back
#define mp make_pair
#define sp " "
#define cs "Case "
#define fi first
#define sn second
#define mem(a,n) memset(a, n, sizeof(a));
#define all(x) x.begin(),x.end()
#define alr(x) x.rbegin(),x.rend()
#define ... | 0 | 18,806,263 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
string s; cin >> s;
for(int i=0; i<s.size(); i++){
if(i==s.size()-2){
if(s.at(i)==s.at(i+1)){
... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main()
{
string s; cin>>s; ll f1=0,f2=0;
for(ll i=0;i<s.size();i++)
{
if(s[i]=='<') f1=1;
if(s[i]=='>') f2=1;
}
if(f1==0 || f2==0)
{
ll n=s.size();
cout<<(n*(n+1))/2;
... | 0 | 56,610,411 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
template <uns... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 8,167,387 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | #include <bits/stdc++.h>
using namespace std;
bool find(int i, int j, int k, string s) {
int now = 0;
for (int idx = 0; idx < s.size(); idx++) {
if (now == 0 && s[idx] == '0' + i) {
now++;
continue;
}
if (now == 1 && s[idx] == '0' + j) {
now++;
continue;
}
if (now == 2 &&... | 0 | 16,021,231 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t; cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
cout << ( (s < t) ? "Yes" : "No") << "\n";
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 20,032,862 |
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>
#include <climits>
#define ll long long int
#define pb push_back
#define mk make_... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 0 | 14,394,255 |
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string n;
cin >> n;
if (n[0] == n[1] && n[1] == n[2]) cout << n << '\n';
else {
string tmp;
REP(i, 3)
tmp.push_back(n[0]);
... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
using namespace std;
using pii = pair<int,int>;
using ll=long lon... | 0 | 38,028,903 |
#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;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
... | 0 | 46,521,164 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
cin >> s;
long long x, y, ma = pow(10, 9);
y = (s + ma - 1) / ma, x = y * ma - s;
cout << 0 << " " << 0 << " " << ma << " " << 1 << " " << x << " " << y << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
using P = pair<int,int>;
int main()
{
int n;
cin >> n;
vector<P> a(n);
vector<P> b(n);
vector<bool> used(n);
rep(i,n)
{
int x, y;
cin >> x >> y;
... | 0 | 97,347,160 |
#include<bits/stdc++.h>
using namespace std;
const int N = 123456;
int n, m, color[N];
vector<int> adj[N];
bool visit[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1, x, y; i <= m; ++i) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespac... | 0 | 22,352,947 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin() , v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
int main(){
int h,w; cin >> h >> w;
string s;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | 0 | 11,368,420 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int N,Z,W;
vector<vector<int>> dp(2010, vector<int>(... | 0 | 59,519,413 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans=max(a*c,max(a*d,max(b*c... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--... | 0 | 29,766,908 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <complex>
#include <iomanip>
using namespace std;
#define rep(i,n) for (int i=0; i < int(n); i++)
typedef vector<int> VI;
typedef double D;
typedef complex<D> P;
#define X real()
#define Y imag()
void print(P p) {
cout << se... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
vector<int> A;
A.push_back(0);
rep(i,n){
... | 0 | 49,917,551 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
int ls[N + 1];
ls[0] = 0;
rep(i, N) cin >> ls[i+1];
int ans = 0;
for (int i = 1; i <= N; ++i)
{
for (int j =... | #include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
int main()
{
int i,j,n,k,e[101][101],v[101],a,b,d[101],s;
queue<int> Q;
for(i=0;i<=100;i++)
{
for(j=0;j<=100;j++)
{
e[i][j]=0;
}
v[i]=0;
d[i]=-1;
}
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d%d",&a,&k);
for(j=0;j<=k-1;... | 0 | 80,207,759 |
#define _GLIBCXX_DEBUG
#define MIN_MAX 1200001
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(void){
int n, m, x;
cin >> n >> m >> x;
vi C(n);
vvi A(n, vi(m));
for(int i=0; i<n; i++){
cin >> C[i];
for(int &a : A[i])... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
using ll = long long;
using ld = lon... | 0 | 46,478,974 |
#include<stdio.h>
int main()
{
int n, k;
scanf("%d %d", &n, &k);
int i, res = 1;
for (i = 1; i <= n; i++)
{
if (res + k <= res * 2)
{
res += k;
}
else
{
res *= 2;
}
}
printf("%d\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#def... | 0 | 36,835,573 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n -1;
for(long long i = 2; i <= sqrt(n); i++) {
if(n % i == 0) {
ans = i + n / i - 2;
}
}
cout << ans;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 0 | 15,041,098 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
ll S[100005];
ll T[100005];
int m... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 94,281,389 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | 0 | 60,848,498 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | #include <iostream>
#include <string>
using namespace std;
void solve(){
int n, m; cin >> n >> m;
string sn[n], sm[m];
for(int i = 0; i < n; ++i) cin >> sn[i];
for(int i = 0; i < m; ++i) cin >> sm[i];
for(int i = 0; i < n-m+1; i++){
for(int j = 0; j < n-m+1; j++){
int flag = 1;
int cnt = 0;
... | 0 | 55,303,664 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
const double PI = 3.1415926535897932;
ll cnt[1010];... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
string s;
cin>>s;
int n=s.size();
int res=0;
for(int i=0,j=s.size()-1;i<j;){
if(s[i]==... | 0 | 17,741,861 |
#include<iostream>
using namespace std;
int main(){
int n,m,p,x[100],total;
while(1){
cin>>n>>m>>p;
if(!(n||m||p))break;
total=0;
for(int i=0; i<n; i++) cin>>x[i],total+=x[i];
if(x[m-1]!=0) total = total*(100-p)/x[m-1] ;
else total = 0;
cout<< total <<endl;
}
} | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 15,891,756 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long h,w;
cin >> h >> w;
long long s = h*w;
if(h==1||w==1){
cout << 1 << endl;
return 0;
}else if(s%2!=0){
cout << (s+1)/2 << endl;
}else{
cout << s/2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | 0 | 65,469,288 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a=111;
for(int i=0;i<9;i++){
if(n<=a){cout << a << endl;break;}
a+=111;
}
} | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ld long double
#define f first
#define mt make_tuple
#define s second
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define time_bata cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
#... | 0 | 31,883,325 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char C;
cin>>C;
cout<<(char)(((int)C)+1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define NIL -1
#define MAX 250
int heap[MAX+1];
int parent(int i) { return i/2;}
int left(int i) {return 2*i;}
int right(int i){return 2*i + 1;}
int main(){
int H;
scanf("%d", &H);
for(int i=1; i<=H; i++){
scanf("%d", &heap[i]);
}
for(int i=1; i<=H; i++){
... | 0 | 77,046,461 |
#include<bits/stdc++.h>
using namespace std;
int boo(int x, int y){
if(x%y) return x%y -1;
else return y - 1;
}
char foo(string str,int mk, int i){
char ch, mozi[16] = "00adgjmptw", mozi1[8] = " .,!?";
if(str[mk] - '0' == 1) ch = mozi1[(i - mk)%5];
else if(((str[mk] - '0') == 7) || ((str[mk] - '0') == 9)) ch = moz... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
string s;
cin >> s;
int left = 0, right;
int count = 0;
for(right = 1; right < n; right++){
if(s[right-1] == '0' && s[right] == '1')count++;
if(count == k) break;... | 0 | 77,695,116 |
#include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
int t_before =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
int K;
int num = 1;
cin >> N;
cin >> K;
rep(i, N){
if (num * 2 >= num + K){
num += K;
}
else
{
num *= 2;
}
... | 0 | 14,043,393 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
typedef complex<double> P;
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
int main() {
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... | 0 | 2,580,598 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... | #include<bits/stdc++.h>
using namespace std;
int main () {
string S[2];
cin >> S[0] >> S[1];
int S_[2][200001];
int N = (int)S[1].size();
for (int i = 0; i < 2; i ++) {
string a = "";
for (int j = 0; j < N; j ++) {
int n = a.size();
int p = 0;
while (p < n && a[p] != S[i][j]) p ++;
... | 0 | 41,718,157 |
#pragma optimize("unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(ll i=a;i>=b;i--)
#define Max(a,b,c) max(a,max(b,c))
#define Min(a,b,c) min(a,min(b,c))
#define pb push_back
#define mp make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main()
{
int n, m;
cin >> n >> m;
vector<string> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
for (int i = 0; i <= n; i++)
... | 0 | 59,516,073 |
#include <stdio.h>
int main()
{
int W,H,ans;
char map[100][100];
scanf("%d %d",&W,&H);
while(W != 0 && H != 0){
for(int i = 0; i < H; i++){
scanf("%s",map[i]);
}
for(int i = 0; i < 1000; i++){
for(int j = 0; j < H - 1; j++){
for(int k = 0; k < W; k++){
if((map[j][k] == '.' && map[j + 1][k] == '... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 93,431,699 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char b;
cin >> b;
if(b=='A') cout << "T" << endl;
else if(b=='T') cout << "A" << endl;
else if(b=='C') cout << "G" << endl;
else if(b=='G') cout << "C" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 101234567;
int main() {
ll N;
ll ans = 0;
vector<ll>v;
cin >> N;
for (int k = 1; k < (double)sqrt(N); k++) {
if (N % k == 0) {
ll m = N/k - 1;
if (m > k) {
ans += m;
... | 0 | 53,462,030 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define UB upper_bound
#define LB lower_bound
#define PB push_back
#define mp make_pair
#define F first
#define S second
#define be(a) (a).begin(),(a).end()
#define deb(x) cout<< #x <<" "<<endl;
#define deb2(x, y)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int i = 0;i < n;i++)
#define all(x) x.begin(),x.end()
#define dup(x,y) (x + y - 1)/y
#define sz(v) (int)v.size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template<class T> ... | 0 | 64,735,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.