code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <string>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
using namespace std;
string s, t;
int ans;
int main() {
cin >> s >> t;
int lengh = s.length();
rep(i, 0, lengh) if(s[i] ... | #include <bits/stdc++.h>
#include <bitset>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define ... | 0 | 6,700,414 |
/* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n... | 0 | 22,311,802 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct Graph
{
int n;
vector<vector<int>> g;
Graph(int n) : n(n){
g.resize(n);
}
void init(int n_){
n = n_;
g.resize(n_);
}
void add_edge(int from, int to){
g[from].push_back(to);
... | 0 | 65,203,101 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
string res;
cin>>a>>b>>c;
if(a<b&b<c)res="Yes";else res="No";
cout<<res<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 | 69,454,553 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
vector<string> v;
for(int i=0; i<a; i++) {
string s;
cin >> s;
for(int j=0; j<b; j++) {
if(s[j] == '#') {
v.push_back(s);
break;
}
}
}
... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | 0 | 59,214,321 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 32,211,585 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #include <iostream>
using namespace std;
int main()
{
int x = -1;
int i = 1;
while (true) {
cin >> x;
if (x != 0) {
cout << "Case " << i << ": " << x << endl;
} else {
return 0;
}
i++;
}
} | 0 | 78,355,001 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 0 | 95,292,337 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long N, K;
long long H_tmp;
long long sum = 0;
long long sum_tgt = 0;
std::cin >> N >> K;
vector<long long> mons_list(N);
if(K >= N){
goto finish;
}
for(long long i = 0; i < N; i++){... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
ll k,a,b;cin>>k>>a>>b;
ll ans=1;
if(a>=b-1)ans=k+1;
else for(int i=0;i<k;)
{
if(ans<a||i>=k-1)
{
ans++;
i++;
}
else
... | 0 | 68,639,394 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int k, x;
cin >> k >> x;
string ans = "No";
if(500 * k >= x) ans = "Yes";
cout << ans << endl;
return 0;
} | #include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
using namespace std;
int main(){
string s;
while(getline(cin,s),s!="."){
stack<int> a;
for(int i=0;i<s.size();i++){
if(s[i]=='('||s[i]=='['){
a.push(s[i]);
}
else if(s[i]==')'){
if(a... | 0 | 6,073,174 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin >> N >> M;
int sum=0;
vector<int> A(N);
for(int i=0; i<N; i++){
cin >> A.at(i);
sum=sum+A.at(i);
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
if(A.at(M-1)*4*M<sum) cout << "No" << endl;
e... | #include <iostream>
#include <vector>
#include <cmath>
#include <limits.h>
#include <utility>
#include <map>
#include <algorithm>
using namespace std;
using P=pair<int,int>;
using ll=long long;
int main(){
int m,k;
cin>>m>>k;
if(pow(2,m)<=k){
cout<<-1<<endl;
return 0;
}
if(k==0){
... | 0 | 53,530,821 |
#include <stdio.h>
int main(){
int i;
while(1){
char str[1000];
int s=0;
scanf("%s\n",str);
if(str[0]=='0') break;
for(i=0;str[i]!='\0';i++){
s+=str[i]-'0';
}
printf("%d\n",s);
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
struct Node { int p, l, r; };
int main() {
int n;
cin >> n;
Node *u = new Node[n];
for (int i =... | 0 | 87,760,924 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=100005;
int n,k,s;
int main()
{
scanf("%d%d%d",&n,&k,&s);
for(int i=1;i<=k;i++)
printf("%d ",s);
for(int i=1;i<=n-k;i++)
printf("%d ",s==1000000000?1000000000-1:1000000000);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n, h, w;
cin >> w >> h >> n;
ll ux = w, bx = 0, uy = h, by = 0;
rep(i, 0, n){
ll x, y, a;
cin >> x >> y >> a;
if(a == 1... | 0 | 68,805,262 |
#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;
int n,k,a[10];
string s,t;
int main() {
cin >> s;
cout << (s.substr(0,4)=="YAKI" ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll & a, ll b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll & a, ll b) { if (b > a) { a = b;... | 0 | 82,497,252 |
#include <bits/stdc++.h>
using namespace std;
long long n, x;
bool buf;
int main() {
buf = scanf("%lld %lld", &n, &x);
printf("%lld\n", 3LL*(n-__gcd(n, x)));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m=1,min,k;
cin>>n;
int r[n];
cin>>r[0];
min=r[0];
for(int i=1;i<n;i++){
cin>>r[i];
k=r[i];
if(k<min){
min=k;
m++;
}
}
cout<<m;
} | 0 | 22,517,943 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main(){
int n;
cin >> n;
vi p(n);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 99,594,615 |
using namespace std;
#include<bits/stdc++.h>
#define Ranger159 ios_base::sync_with_stdio(false);
#define PrintLater cin.tie(0);cout.tie(0);
#define ll long long
#define phb push_back
#define break break
#define pob pop_back()
#define continue continue
#define size size
#define insrt insert
#define fir first
#define tru... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>>grid(h,vector<char>(w));
rep(i,h)rep(j,w)cin>>grid[i][j];
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
bool ans=true;
rep(i,h)rep(j,w)... | 0 | 95,857,074 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
vector<int> c(30);
rep(i, s.size()) c[s[i]-'a']++;
char ans = '#';
rep(i, 26) if(c[i] == 0){
ans = 'a'+i;
break;
}
if(ans == '#') cout << "None" << endl;
else cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for(int i=0; i<N; ++i) {
cin >> s.at(i);
}
int M;
cin >> M;
vector<string> t(M);
for(int i=0; i<M; ++i) {
cin >> t.at(i);
}
vector<string> s2;
vector<int> s3;
for(int i=0; i<N; ++i) {
... | 0 | 61,793,042 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 58,958,644 |
#include <iostream>
using namespace std;
template<typename T>
class Dice {
private:
void Init() {
upId = 0;
frontId = 1;
rightId = 2;
}
public:
Dice() :
number{1, 2, 3, 4, 5, 6}
{
Init();
}
Dice(T (&n)[6]) :
number{n[0], n[1], n[2], n[3], n[4], n[5]}
{
Init... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 14,202,696 |
#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;
int main(void){
ll N,M;cin>>N>>M;
ll S_TOTAL = min(M / 2, N);
M = M - 2 * S_TOTAL;
ll M_TOTAL = M / 4;
cout << S_TOTAL + M_TOTAL << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
while(1){
int N,A,B,C,X;
cin>>N>>A>>B>>C>>X;
if(N == 0 && A == 0 && B == 0 && C == 0 && X == 0){
break;
}
vector<int> Y;
for(int i = 0;i < N;++i){
int temp;
cin>>temp;
Y.push_back(temp);
}
int X_d;
in... | 0 | 85,384,721 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <tuple>
#include <cmath>
#include <map>
template<typename T> bool chmax( T &a, const T &b ) { if ( a <= b ) { a = b; return ( true ); } else { return ( false ); } }
template<typename T> bool chmin(... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | 0 | 91,980,539 |
#include<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
long long INF=1e7;
double EPS = 1e-12;
const long long lim = 1e6+100;
typedef long long int lld;
typedef long long ll;
#define rep(i,a,n) for(long long int i = (a); i <= (n); ++i)
#define repD(i,a,n) for(long long int i = (a); i >= (n); i--)
#define mset... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
ll K, A, B; cin >> K >> A >> B;
ll cnt = 1;
if(A+2 >= B){
cout << K+1 << endl;
return 0;
}
else{
for(int i = 0; i < K; i++){
if(... | 0 | 35,181,696 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int w,h,x,y;
cin>>w>>h>>x>>y;
double ans=(double)w*h/2;
int num=0;
if(w==x*2&&h==y*2) num++;
cout<<fixed<<setprecision(15)<<ans<<" "<<num<<endl;
} | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 69,769,300 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MAXN = 1e5 + 5;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll m, k;
cin >> m >> k;
if(k > ((1 << m) - 1)){
cout << -1 << endl;
return 0;
}
if(m == 0){
if(k == 0){
cout << 0 << " " <... | 0 | 5,307,970 |
#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... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <cstdlib>
#include <stack>
#include <queue>
#include <list>
#include <vector>
using namespace std;
class c_counting
{
private:
public:
c_counting();
void f_input();
};
c_counting::c_counting()
{
}
void c_counting::f_input()
{
... | 0 | 35,170,646 |
#include<bits/stdc++.h>
using namespace std;
#define first ff
#define second ss
#define ll long long int
int main()
{
int n;
cin>>n;
ll a[n+5],b[n+5];
for(int i=1; i<n; i++)
cin>>b[i];
ll sum=b[1]+b[n-1];
for(int i=1;i<n-1;i++){
sum+=min(b[i],b[i+1]);
}
cout<<sum<<endl;
} | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | 0 | 84,352,444 |
#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()
{
string s, t;
cin >> s >> t;
cout << t + s << endl;
} | #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 | 68,645,948 |
#include<iostream>
#include<cstdio>
using namespace std;
struct Node
{
int value;
char c;
};
void BubbleSort(Node a[],int n)
{
for(int i=0;i<n-1;i++)
for(int j=n-1;j>=i+1;j--)
if(a[j].value<a[j-1].value)
swap(a[j],a[j-1]);
}
void SelectionSort(Node a[],int n)
{
for(in... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main (){
int n;
vector< pair<int,int> > tm;
while(cin>>n && n){
tm.clear();
char ch1,ch2;
int h,m,s;
for(int i=0;i<n;i++){
cin>>h>>ch1>>m>>ch2>>s;
tm.push_back(make_pair(h*3600+m*60+s,1));
cin>>h>... | 0 | 77,821,984 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
string a[100], b[100];
bool check(int i, int j)
{
if ((n - i) < m || (n - j) < m)
{
return false;
}
for (int ax = i, bx = 0; bx < m; ax++, bx++)
{
for (int ay = j, by = 0; by < m; ay++, by++)
{
if (a[ax][ay] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, a;
cin >> N;
ll ans = 0, h = 0;
for ( int i = 0; i < N; i++ ) {
cin >> a;
if ( a < h+1 ) continue;
if ( a == h+1 ) {
h++;
continue;
}
ans += (a-1) / (h+1... | 0 | 93,597,708 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n),a2(n);
rep(i,n) cin >> a[i],a2[i]=a[i];
::sort(a2.rbegin(),a2.rend());
int first_max = a2[0];
int second_max = a2[1];
rep(i,n){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k, s;
cin >> k >> s;
int ans=0;
for (int i=0; i<=k; i++){
for (int j=0; j<=k; j++){
if (s-i-j<=k && s-i-j>=0) ans++;
}
}
cout << ans << "\n";
} | 0 | 57,477,401 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+1],b[n];
for(int i=0;i<=n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
long long ans=0;
for(int i=0;i<n;i++){
if(a[i]+a[i+1]>=b[i]){
... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;
#define INT_MAX 1 << 30
#define MAX 100
typ... | 0 | 99,241,394 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int H,W;
int dx[2] = {1,0};
int dy[2] = {0,1};
v... | 0 | 72,189,382 |
#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<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 28,553,134 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie();
ll n, a, b;
cin>>n>>a>>b;
ll ans = 0;
ll g = a+b;
ll d = n/g;
ans += a*d;
n -= d*g;
ans += min(n, a);
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
int N,M;
vector<P> graph[200010];
vector<int> dist;
bool dfs(int now, int d){
dist[now] = d;
for(auto p:graph[now]){
i... | 0 | 45,289,061 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
bool b = true;
for(int i = 0; i <= 1000; i++) {
if(i * 0.08 - A >= 0 && i * 0.08 - A < 1 && i * 0.1 - B >= 0 && i * 0.1 - B < 1) {
cout << i << endl;
b = false;
break;
}
}
if(b) {
cout << -1 << ... | #include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
#define ll long long
#define ar array
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
string S,T;
cin >> S >> T;
int ans = 0;
for (int i = 0; i < 3; i++) {
if (S[i]==T[i]) ans++;
}
cout << ans << endl;
return 0;
} | 0 | 35,538,365 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
using namespace std;
int main(){
int n;
cin>>n;
ll ans=1,x;
vector<ll> a(n);
for(int i=0;i<n;++i){
cin>>a[i];
ans*=a[i];
if(a[i]==0){
cout<<0<<endl;
return 0;
}... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 94,022,026 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N);
for(int i=0;i<N;i++){
cin >> a.at(i);
}
int ans=0;
for(int i=1;i<N;){
if(a.at(i)==a.at(i-1)){
ans++;
i+=2;
}else{
i++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void){
string a,b;
cin>>a>>b;
if(a==b){
cout<<"H"<<endl;
}
else if(a=="D"&&b=="H"){
cout<<"D"<<endl;
}
else if(a=="H"&&b=="D"){
cout<<"D"<<endl;
}
} | 0 | 99,757,560 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int N, amin = 0, bmin = 0;
cin >> N;
vector<int> p(N), ad(N + 1, 0), bd(N + 1, 0), a(N, 0), b(N, 0);
rep(i, N) {
cin >> p[i];
bd[p[i]] = -i;
p[i]--;
ad[p... | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
typedef long long int lli;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<lli> vlli;
typedef vector<bool> vb;
long long int max(long long int a,long long int b){
if(a>b)
return a;
else
return b;
}
long long int ... | 0 | 76,040,351 |
#include<stdio.h>
int main()
{
char s[105], t[105];
scanf("%s", &s);
scanf("%s", &t);
printf("%s%s\n", t, s);
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 0 | 43,006,342 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
#include <string>
#include <numeric>
#include <algorithm>
#include <utility>
using std::cout;
using std::cin;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a, ll... | #include <bits/stdc++.h>
using namespace std;
const vector<int> match = {0,2,5,5,4,5,6,3,7,6};
void chmax(string &a, string b){
if(a == "-") a = b;
else if(a.size() < b.size()) a = b;
else if(a.size() == b.size()){
if(a < b) a = b;
}
}
int main(){
int n, m;
cin >> n >> m;
vector<int>... | 0 | 79,563,732 |
#include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
LL a[200005];
LL prefix[200005];
unordered_map<LL, LL> m;
LL n, k;
LL mod(LL x) {
return ((x % k) + k) % k;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N;
string S;
cin >> N >> S;
int ans = 0;
for (char i = '0'... | 0 | 21,057,122 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int a[256];fill(a,a+256,0);
string line;
while(getline(cin,line))
for(int i=0;i<line.length();++i)
a[tolower(line[i])]++;
for(char i='a';i<='z';++i)
cout<<i<<" : "<<a[i]<<endl;
return 0;
} | #include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) sw... | 0 | 54,200,991 |
#include<stdio.h>
#include<string.h>
int main(){
char moji[2][27]={"abcdefghijklmnopqrstuvwxyz","ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
char uketori[1202];
int i,j,mojisuu,count[26]={0};
while(fgets(uketori,sizeof(uketori),stdin)!=NULL){
mojisuu=strlen(uketori);
for(i=0;i<mojisuu;i++){
for(j=0;j<26;j++){
if(uketo... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ... | 0 | 7,463,528 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pa... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 89,400,227 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int inf = 1e5+1;
ll m[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
char S;
char check[100] = {'a', 'i' ,'u', 'e', 'o'};
bool flag = false;
cin >> S;
for (int i = 0; i < 5; i++){
if (S == check[i]) flag = true;
}
if(flag) {
cout << "vowel" << endl;
} else {... | 0 | 50,453,947 |
#include <bits/stdc++.h>
int main(void)
{
std::string s;
std::cin >> s;
bool flag = false;
if (s[2] == s[3]) {
if (s[4] == s[5]) {
flag = true;
}
}
if (flag) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int vis[100005]={0};
vector<int> grph[100005];
int mo=1000000007;
pair<int,int> dfs(int a,int p)
{
if(vis[a]==0)
{
vis[a]=1;
pair<int,int> ans;
ans.first=1;
ans.second=1;
for(auto &k:grph[a])
... | 0 | 60,987,112 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
int n;
cin >> n;
vector<int> p(n);
int i;
rep(i,n) cin >> p[i];
vector<int> ind(n);
rep(i,n)
{
ind[p[i]-1] = i;
}
multiset<in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 0 | 13,654,466 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
int main(){
std::string s;
std::cin >> s;
int n = s.length();
std::vector<char > notx;
for (i... | #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 g[15][15];
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll ans = 0;
rep(i,60) {
ll x = 0;
... | 0 | 5,398,104 |
#include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
ll N, ans;
int main()
{
cin >> N;
for (ll i = 2, M = N; i * i <= M; i++)
{
ll z = i;
while (N % z == 0)
ans++, N /= z, z *= i;
while (N % i == 0)
N /= i;
}
cout << ans + (N != 1) << "\n";
} | #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 - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... | 0 | 98,747,310 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
char s[10];
int main(){
scanf("%s",s);
if(s[2]==s[3]&&s[4]==s[5]) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using v... | 0 | 23,400,893 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
typedef long long int ... | 0 | 85,173,584 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int main()
{
int h,w;cin>>h>>w;... | #include<bits/stdc++.h>
using namespace std;
int x[100010],w[100010];
int ans[100010];
int n,L,r,t;
long long fldl;
int main()
{
scanf("%d%d%d",&n,&L,&t);
for(int i = 1;i <= n;i++)
{
scanf("%d%d",&x[i],&w[i]);
if(w[i] == 2)w[i] = -1;
}
for(int i = 1;i <= n;i++)
{
int len = x[i] + w[... | 0 | 41,196,003 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, t, r;
cin >> x >> t;
r = x - t;
if (r < 0) {
cout << 0 << '\n';
} else {
cout << r << '\n';
}
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 31,054,491 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i,s,e) for(int i=s;i<e;i++)
#define endl '\n'
int main(){
int k,n;cin>>k>>n;
vector<int>A(n),D(n);
rep(i,0,n)cin>>A[i];
rep(i,0,n-1)D[i]=A[i+1]-A[i];
D[n-1]=abs(k+A[0]-A[n-1]);
int diff=0;
for(int d:D){
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 27,595,476 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAX_N 5000
#define MAX_K 5000
int N, K;
ll A[MAX_N];
bool dp[MAX_N][MAX_K];
ll max(ll a, ll b) { return a > b ? a : b; }
bool need(int i) {
for (int n = 0; n < N; n++)
for (int k = 0; k < K; k++)
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, l;
vector<int> x;
vector< vector<int> > dbl;
int f(int a, int b){
if(a > b) return f(b, a);
int res = 0;
while(a < b){
for(int k = 0; k < 20; k++){
if(dbl[a][k] >= b){
if(k == 0){
... | 0 | 75,576,240 |
#include <iostream>
using namespace std;
typedef long long ll;
ll inf = 1e9+7;
ll n,m;
int main(){
cin >> n >> m;
ll X[n+1],Y[m+1];
for(int i=1;i<=n;i++){
cin >> X[i];
}
for(int i=1;i<=m;i++){
cin >> Y[i];
}
ll x = 0, y = 0;
for(ll i=1;i<=n;i++){
x = (x + (i-1)*X[i] - (n-i)*X[i])%inf;
}
for(ll i=1;i<=m;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | 0 | 21,062,256 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 58,167,930 |
#include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
int main() {
ll n;
ll k;
cin >> k >> n;
vector<ll>... | #include <cstdio>
int m,nmin,nmax;
int P[205];
int diff[205];
int main(){
while(scanf("%d%d%d",&m,&nmin,&nmax)&&m&&nmin&&nmax){
for(int i=1;i<=m;i++) scanf("%d",P+i);
for(int i=1;i<=m-1;i++) diff[i]=P[i]-P[i+1];
int ans=nmax,difference=diff[ans];
for(int i=nmax;i>=nmin;i--)
... | 0 | 58,266,463 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | #include<iostream>
#include<queue>
using namespace std;
int main(){
priority_queue<int> pq;
string order;
while(true){
cin >> order;
if(order == "insert"){
int key;
cin >> key;
pq.push(key);
}
else if(order == "extract"){
cout<<... | 0 | 51,656,316 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
while(n>=500){
n -= 500;
}
if(a >= n)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< string > vs;
typedef vector< vi > vvi;
typedef ... | 0 | 20,618,653 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
ll n;
cin >> n;
cout << n * (n-1) /2;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, max = 0, maxNum = 1;
cin >> N;
for (int i = 1; i <= N; i++)
{
int cnt = 0;
int num = i;
while (num % 2 == 0)
{
cnt++;
num /= 2;
}
if (max < cnt... | 0 | 1,541,502 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin >> q[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name... | 0 | 53,739,436 |
#include <string>
#include <utility>
#include <iostream>
#define MAX 100
#define INF 100000000
int left[MAX];
int right[MAX];
int DP[MAX][MAX];
int main(){
int n;
std::cin >> n;
for(int i = 0; i < n; i++){
std::cin >> left[i];
std::cin >> right[i];
}
for(int i = 0; i < MAX; i++){
for(int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | 0 | 87,791,641 |
#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()
const ll INF = 1LL << 60;
int main(){
ll n;
cin >> n;
ll count=0;
vector<ll> divisor;
for(ll i=1; i*i<=n; i++){
if(n%i==0){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
struct SegTree {
ll n;
vector<ll> v;
SegTree(int size) {
n = 1;
while (n < size) n *= 2;
v = vector<ll>(2 * n - 1);
}
void add(int i, ll x) {
i += n ... | 0 | 32,777,114 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
int ans;
cin >> A >> B;
if(A.at(0) == B.at(2)) {
ans++;
}
if(A.at(1) == B.at(1)) {
ans++;
}
if(A.at(2) == B.at(0)) {
ans++;
}
if(ans == 3) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> A(N, 0);
R... | 0 | 3,949,068 |
#include <bits/stdc++.h>
#include <string.h>
#include <stdio.h>
using namespace std;
using std::cout;
#include <algorithm>
#include <map>
int main(){
long long n,m=0;
cin>>n;
map<string,int>freq;
string x[n];
for(int i=0;i<n;i++)
{
cin>>x[i];
sort(x[i].begin(),x[i].end());
}
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <stack>
#include <map>
#include <bitset>
#define ri register
#define inf 0x7fffffff
#define E (1)
#define mk make_pair
#define int long long
using namespace std; cons... | 0 | 67,412,772 |
#include<iostream>
#include<string>
int main(){
int q;
std::cin>>q;
int i,j,k;
std::string x,y;
int a[1001][1001];
int knum[q];
for(i=0; i<1001; i++){
for(j=0; j<1001; j++){
a[i][j]=0;
}
}
for(k=0; k<q; k++){
std::cin>>x;
std::cin>>y;
for(i=1; i<x.size()+1; i++){
for(j=... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 | 36,394,986 |
#include <bits/stdc++.h>
using namespace std;
bool solve(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i == n % i) {
cnt++;
} else {
cnt += 2;
}
}
}
if (cnt == 8) {
return true;
} else {
return false;
}
}
int main() {
int... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
int n, m;
cin >> n >> m;
vector<ll> h(n);
rep(i, n) cin >> h[i];
vector<bool> ok(n, true);
vector<int> cnt(n, 0);
rep(i, m){
... | 0 | 59,199,072 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool A = false, B = false, C = false;
for (char c: S) {
if (c == 'a') A = true;
else if (c == 'b') B = true;
else C = true;
}
if (A && B && C) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e5 + 10;
const ll mod = 1e9 + 7;
int main(){
ll k;cin >> k;
deque<ll>d;
if(k<10){cout << k;return 0;}
for(ll i = 1;i<10;i++) d.push_back(i);
k -= 9;
bool ok = 0;
while(true){
ll temp = d.front();
ll r = temp%10;
d.pop_front();... | 0 | 51,957,505 |
#include<iostream>
using namespace std;
string s;
void read() {
cin >> s;
}
void work() {
for (int i = 3; i >= 0; --i) {
if (s.find(string(i, 'R')) != string::npos) {
cout << i << endl;
return;
}
}
}
int main() {
read();
work();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
int main(){
int N;
cin>>N;
vector<ll> a(N),b(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
cin>>b.at(i);
}
ll a_count=0,b_count=0;
for(int i=0;i<N;i++){
if(a.at(i)>b.at(i)){
b_c... | 0 | 5,690,242 |
#include<iostream>
#include<string>
int main()
{
while (true) {
std::string x;
std::cin >> x;
if (x == "0") break;
int sum = 0;
for (int i = 0; i < x.size()
; i++) {
sum += x[i] - '0';
}
std::cout << sum << std::endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define ok1 cerr<<"ok1\n";
#define ok2 cerr<<"ok2\n";
#define M LLONG_MAX
#define rep(i,n) for(ll i=0;i<n;++i)
#define REP(i,s,n) for(ll i=(s);i<(n);++i)
#define repr(i,n) for(ll i=n-1;i>=0;--i)
#define REPR(i,s,n) for(ll i=(s);i>=(n);--(i))
#define all(a) (a).begin(),(a).e... | 0 | 7,443,181 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(in... | 0 | 19,531,500 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include <iostream>
#include <string>
#include <cmath>
#include <stdio.h>
using namespace std;
class Dice{
public:
int labels[6];
Dice(int *s){
for(int i=0;i<6;i++){
labels[i] = s[i];
}
}
void update_state(char c){
int tmp;
switch(c){
case ... | 0 | 81,664,125 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n, n)
{
int max_s, min_s, sum;
cin >> max_s >> min_s;
sum = max_s + min_s;
if(max_s<min_s) swap(max_s, min_s);
for(int i=2; i<n; i++)
{
int s;
cin >> s;
... | #include <iostream>
#include <algorithm>
#include <queue>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
using let = const int;
int V, E;
bool vis[10005];
vector <int> G[10005];
vector <int> out;
void bfs(let s, int *indeg)
{
queue <int> que; que.emplace(s);
whil... | 0 | 52,983,435 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
ll n, m, d;
cin >> n >> m >> d;
long double... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7,... | 0 | 13,486,643 |
#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()
#define vecin(a) rep(i,a.size())cin >> a[i]
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>; using vpii = vector<pii>;
using vi = vector<int>; using vvi = vector<vi>;
using ll = long long;
using pll = pair<ll, ll>; using vpll = vector<pll>;
using vll = vector<long long>; using vvll = vector<vll>;
template <class T> using min_queue = prio... | 0 | 31,319,483 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
switch (D) {
case 25:
cout << "Christmas" << endl;
break;
case 24:
cout << "Christmas"
<< " "
<< "Eve" << endl;
break;
case 23:
cout << "Christmas"
... | #include<iostream>
#include<vector>
#include<string>
const int INF = 1000000000;
int n;
int target[3];
std::vector<int> l;
int solve(int i = 0, int a = 0, int b = 0, int c = 0){
if(i == n){
if(!a || !b || !c) return INF;
else return std::abs(a - target[0]) + std::abs(b - target[1]) + std::abs(c - ta... | 0 | 68,526,815 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 47,311,563 |
#include<iostream>
using namespace std;
int main(){
int cut=0;
int a;
int b;
while(1){
cin>>a;
cut=0;
if(a==0){
break;
}
b=1000-a;
cut+=b/500;
b=b%500;
cut+=b/100;
b=b%100;
cut+=b/50;
b=b%50;
cut+=b/10;
b=b%10;
cut+=b/5;
b=b%5;
cut+=b;
cout<<cut<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define endl '\n'
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
typedef unsigned long long ull;
typedef long long lld;
typedef long double ld;
typedef pai... | 0 | 21,703,431 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
int main(){
int K;
cin>>K;
queue<long long> q;
for(int i=1;i<10;i++){
q.push(i);
}
int cnt=0;
long long node;
while(!q.empty()){
node=q.front();q.pop();
cnt++;
if... | #include <stdio.h>
#include <string.h>
int main(void) {
char x[1000] = "";
int sum;
do {
sum = 0;
scanf("%s", x);
for (int i = 0; i < strlen(x); i++) {
sum += (x[i] - '0');
}
if (sum < 1) break;
printf("%d\n", sum);
} while (true);
return 0;
} | 0 | 43,356,443 |
#include<stdio.h>
#include <iostream>
#include <math.h>
using namespace std;
int main(){
long double Ax, Ay, Bx, By;
long double a;
cin >> Ax >> Ay >> Bx >> By;
a = (Bx - Ax) * (Bx - Ax) + (By - Ay) * (By - Ay);
printf("%lf\n",sqrt(a)) ;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,k; cin >> n >> k;
vector<pair<int,int>> a(n);
for(int ix=0;ix<n;ix++){
int x,y;
cin >> x >> y;
a.at(ix) = make_pair(x,y);
}
sort(a.begin(),a.end());
ll cnt=0,ans = -1;
int i=0;
wh... | 0 | 34,986,217 |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <iostream>
#define ll long long
using namespace std;
int dp[10000+7];
int t[10]= {0,2,5,5,4,5,6,3,7,6},a[10],b[100];
bool cmp(int a,int b)
{
return a>b;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,i,j,k;
... | #include <bits/stdc++.h>
using namespace std;
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x... | 0 | 5,481,127 |
#include <iostream>
using namespace std;
int main() {
long long a, b, c, k;
cin >> a >> b >> c >> k;
if(k%2 == 1) cout << b-a;
else cout << a-b;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
for(int i = 1; i < n; i++) {
... | 0 | 66,828,699 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "YES" : "NO")
typedef pair <int, int> ii;
typedef pair <ii, int> iii;
const int siz = 2e5 + 10;
const int SIZ = 2e3 + 10;
const ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> P2;
int next_animal(int a,int b,int c){
if(b==1) c=(c+1)%2;
if(c==0) return a;
else return (a+1)%2;
}
int main(){
int n;
cin>>n;
vector<int> vec;
for(int i=0;i<n;i++){... | 0 | 4,010,394 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const double eps = 1e-9;
typedef pair<ll, ll> P;
int main()
{
int N, tmp = 0, ans = 0;
cin >> N;
vector <int> a(N+2, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
ans += ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> B(N-1);
for(int i=0; i<N-1; i++){
cin>>B.at(i);
}
int a=0,sum=B.at(N-2);
if(N==2){
cout<<B.at(0)*2<<endl;
return 0;
}
else{
for(int i=N-3; i>=0; i--){
a=min(B.at(i),B.at(i+1));
sum+=a;
... | 0 | 30,210,284 |
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
using namespace std;
int p[2100000];
int tx[2100000];
int w, h;
long long ans;
int toth, totw;
bool cmp(int x, int y) {
return p[x] < p[y];
}
int main() {
scanf("%d%d", &w, &... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll i=a;(i)>=(b);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,n,0)
#define ALL(v) v.begin(), v.end()
#define UNIQ(v) sort(ALL(v)); v.erase(unique(ALL(v)),... | 0 | 12,719,814 |
#include <bits/stdc++.h>
using namespace std;
vector<int> graph[100005];
int getgrundy(int t, int p)
{
int ret = 0;
for (int nxt : graph[t])
{
if (nxt == p) continue;
ret ^= getgrundy(nxt, t) + 1;
}
return ret;
}
int main()
{
int n;
scanf("%d",&n);
for (int i = 1; i < n; ... | #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int n;
deque<int> qu, ql;
bool a[100005];
int main()
{
scanf("%d", &n);
qu.push_back(1);
ql.push_back(1);
while(!qu.empty())
{
int t1 = qu.front();
int t2 = ql.front();
qu.pop_front();
ql.pop_... | 0 | 68,386,468 |
#include<stdio.h>
#include<math.h>
#define PI 3.141592653589793
int main()
{
double a,b,C,S,H,K,k,J;
a=0;b=0;C=0;S=0;H=0;K=0;k=0;J=0;
scanf("%lf",&a);scanf("%lf",&b);scanf("%lf",&C);
C=C*(PI)/180;
H=b*sin(C);
S=0.5*a*H;
k=a*a+b*b-2*a*b*cos(C);
K=sqrt(k);
J=a+b+K;
printf("%f\n%f\n%f\n",S,J,H);
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | 0 | 38,108,507 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
struct ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstring>
#include<cmath>
#include <numeric>
#include<queue>
#include<climits>
#include<cstdio>
#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)... | 0 | 93,999,940 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int l = S.size();
for (int i = 2 - l % 2; i <= l - 2; i = i + 2) {
int sp = (S.size() - i) / 2;
if (S.substr(0, sp) == S.substr(sp, sp)) {
cout << S.si... | #include <bits/stdc++.h>
#define ln "\n"
#define SORT(X) sort(X.begin(), X.end())
#define SORTi(X) sort(X.begin(), X.end(), greater<ll>())
#define REP(x, a, b) for (auto x = a; x <= b; x++)
#define REPi(x, b, a) for (auto x = b; x >= a; x--)
#define REPit(x, A) for (auto x = A.begin(); x != A.end(); x++)
#define REPr(x... | 0 | 63,101,876 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
using namespace std;
#define pi 3.14159265358... | #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 | 60,332,211 |
#include<bits/stdc++.h>
using namespace std;
int k,s,i,j,l;
int main(){
scanf("%d%d",&k,&s);
for (i=0;i<=k;i++){
for (j=0;j<=k;j++){
if (s-i-j<=k&&s-i-j>=0) l++;
}
}
printf("%d\n",l);
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | 0 | 26,627,303 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<pair<int,int>> students,chk_pts;
for(int i=0;i<n;i++)
{
int x,y;
cin>>x>>y;
students.push_back({x,y});
}
for(int i=0;i<m;i++)
{
int x,y;
cin>>x>>y;
chk_pts.push_back({x,y});
}
for(int i=0;i<n;i++)
{
int dis=1e... | #include <iostream>
using namespace std;
int main() {
string in;
int alp[26]={},i;
while (cin>>in) {
for (i=0;i<in.size();i++) {
if ('a' <= in[i] && in[i] <= 'z') alp[in[i]-'a']++;
if ('A' <= in[i] && in[i] <= 'Z') alp[in[i]-'A']++;
}
}
for (i=0;i<26;i++) {
... | 0 | 39,711,779 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int N = 0 ,A, B, C, K;
string S;
cin >> A >> B >> C >> K;
if (K <= A) cout << K << endl;
else if (K <= A + B) cout << A <<endl;
else cout << 2*A + B -K << endl;
} | #include<bits/stdc++.h>
#define rint register int
#define ll long long
using namespace std;
const ll Max=1e9;
int N,P[1010000];
ll Sum[1010000],A[1010000],B[1000000];
int main(){
cin>>N;
for(rint i=1;i<=N;++i) cin>>P[i];
for(rint i=1;i<=N;++i) {
Sum[P[i]]=Max-N+i;
}
A[1]=Max/2;B[1]=Sum[1]-A[1];
for(rint i=2;i<... | 0 | 30,959,298 |
#include <bits/stdc++.h>
using namespace std;
int INF=1e9+7;
long long DP[1005][1005];
int main(){
int H,W;cin>>H>>W;
DP[1][1]=1;
for(int i=0;i<H;i++){
string S;cin>>S;
for(int j=0;j<W;j++){
DP[i+1][j+1]%=INF;
if(S.at(j)=='.'){DP[i+1][j+2]+=DP[i+1][j+1];DP[i+2][j+1]+=DP[i+1][j+1];}
}
}
... | #include <iostream>
#include <cmath>
using namespace std;
int cnt_digits(long long N) {
int digits = 0;
while(N > 0) {
N /= 10;
digits++;
}
return digits;
}
int main() {
long long N;
cin >> N;
int ans = cnt_digits(N);
for(long long A = 1; A*A <= N; A++) {
if(N%A !... | 0 | 34,819,253 |
#include <iostream>
using namespace std;
int func(int n, int s, int i){
if(!n){
if(!s)return 1;
else return 0;
}
if(i >= 10 || s-i < 0)return 0;
return func(n, s, i+1) + func(n-1, s-i, i+1);
}
int main(){
int n, s;
while(cin >> n >> s && (n || s)){
cout << func(n, s, 0) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
c... | 0 | 55,317,627 |
#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 < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
const ll MOD = 1000000007;
int main(){
int a[3];
rep(i, 3) cin >> a[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
long long ans = LLONG_MAX;
rep(i, pow(2, n)) {
bitset<32> b(i);
int num = 0;
rep(j, 32) {
if(b.test(j)) num++;
}
... | 0 | 15,483,757 |
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 54,273,655 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=105;
char s[N][N];
int dp[N][N];
void init();
void work();
int ca=1;
int main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
work();
return 0;
}
void work(){
int n,m;cin>>n>>m;
for(int ... | 0 | 56,702,945 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.