code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<cstdio>
#include<vector>
#include<utility>
#include<algorithm>
#include<fstream>
#include<iostream>
using namespace std;
int main(){
long h,w,num[10]={},a,b;
int n,cnt=0;
vector<pair<long,long>> p;
scanf("%ld %ld %d",&h,&w,&n);
for(int i=0;i<n;i++){
scanf("%ld %ld",&a,&b);
for(long j=max((lon... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | 1 | 570,754 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<string> w(n);
bool ok = true;
for(int i= 0; i< n; i++){
cin >> w.at(i);
}
for(int i = 1; i < n; i++){
if(w.at(i).at(0) != w.at(i-1).at(w.at(i-1).size()-1)) ok = false;
}
sort(w.begin(), w.end());
for(int i = 0; i... | 1 | 54,910,840 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string n;
int i,boi=0;
cin>>n;
for (i=0;i<=n.size()-1;i++){
boi=boi+n[i]-48;
}
if (boi%9==0){cout<<"Yes";
}
else cout<<"No";
return 0;
} | #include <iostream>
using i64 = long long;
int main() {
std::string s;
std::cin >> s;
int ret = 0;
for (const char c : s) ret += c - '0';
std::cout << (ret % 9 ? "No" : "Yes") << std::endl;
return 0;
} | 1 | 45,492,199 |
#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 ALL(x) (x).begin(),(x).end()
using ll = long long;
using ull = unsigned long long;
const ll INF = 1LL<<60;
const int MINF = 1e9;
const int MOD = 1e9+7;
using vi = vector<int>;
u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 1 | 55,062,325 |
#include <stdio.h>
int main() {
int h1, h2, m1, m2, k;
scanf("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
printf("%d\n", 60 * (h2 - h1) + m2 - m1 - k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int ms1 = m1+h1*60,ms2 = m2+h2*60;
int sta = max(0,ms2-k-ms1);
cout << sta << endl;
} | 1 | 59,565,254 |
#include<bits/stdc++.h>
using namespace std;
int MOVE(int *a, int n){
int i,j,k=n,cnt,ans,moves=0,s[10]={};
for(i=1;i<=n;i++){
cnt=0,ans=1;
for(j=1;j<=*a;j++) if(s[j]==0) cnt++;
s[*a]=1;
for(j=1;j<k;j++) ans*=j;
ans*=(cnt-1);
moves+=ans,a++,k--;
}
return m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<Int, Int> P;
int main(){
int N; cin >> N;
vector<int> P(10), Q(10);
rep(i,N) cin >> P[i];
rep(i,N) cin >> Q[i];
... | 1 | 9,996,237 |
#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... | #include<bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T... | 1 | 50,785,352 |
#include <bits/stdc++.h>
int main(){
using namespace std;
int N; cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) cin >> v[i];
int r = 0;
long long cnt = 0, sum = 0;
for (int i = 0; i < N; i++)
{
while (r<N && ( (sum^v[r]) == sum+v[r]))
{
sum += v[r];
... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | 1 | 34,806,168 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swa... | 1 | 52,638,913 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
set<int> st;
int temp;
for(int i=1;i<=n;i++){
cin>>temp;
if(st.find(temp)!=st.end()){
cout<<"NO\n";
return 0;
}
st.insert(temp);
}
cout<<"YES\n";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include... | 1 | 13,628,029 |
#include <stdio.h>
int main(){
int m,now,temp,tot;
char a[1001],b[1001];
for(int i=0;i<1001;i++)b[i]=a[i]='\0';
while(1){
scanf("%s",a);
if(a[0]=='-')return 0;
now=0;
while(a[now]!='\0')now++;
scanf("%d",&m);
tot=0;
for(int i=0;i<m;i++){
... | #include <iostream>
#include <string>
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++)
int main(){
string W, s;
long long int m, h[100], l;
while (1){
cin >> W;
if (W == "-")break;
l = W.length();
cin >> m;
REP(i, m){
cin >> h[i];
s = W.substr(0... | 1 | 77,636,495 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <queue>
#include <stack>
#include <utility>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
stack<int> stk;
int input;
in... | #include <iostream>
#include <vector>
int main(){
std::vector<int> vehicle_order;
int input_data;
while(std::cin >> input_data){
if(input_data == 0){
std::cout << vehicle_order.back() << std::endl;
vehicle_order.pop_back();
}else{
vehicle_order.push_back(input_data);
}
}
return 0;
} | 1 | 69,915,154 |
#include <iostream>
using namespace std;
int main()
{
int n, i = 0;
int car[10] = {};
while(cin >> n){
if(n == 0){
cout << car[i - 1] << endl;
car[i - 1] = 0;
i--;
}else{
car[i] = n;
i++;
}
}
} | #include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
stack<int> s;
int n;
while(1) {
if(scanf("%d", &n) == EOF) break;
if(n > 0) {
s.push(n);
} else if(n == 0) {
if(!s.empty()) {
... | 1 | 56,046,492 |
#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++)
#define INF 100000000
int main(){
ll X,A;
cin>>X>>A;
if(X<A) cout<<0;
else cout<<10;
} | #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
#define LINF 1e18
typedef long long ll;
int main() {
int X,A; cin >> X... | 1 | 24,500,766 |
#include <iostream>
using namespace std;
int main(void){
int N,A,B;
cin >> N >> A >> B;
int count = 0;
int memA0, memB0;
int memA1, memB1;
memA0 = A-1; memA1 = A-1;
memB0 = B+1; memB1 = B+1;
while(1){
if(!count%2) {
if(A==memA0 && B==memA0) { cout << "Draw"; return 0; }
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B ;
if((B-A) & 1){
cout << "Borys" ;
}else{
cout << "Alice";
}
cout << endl;
return 0;
} | 1 | 8,945,873 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int min1 = min(a, b);
int min2 = min(c, d);... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 96,120,003 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a+c, min({a+d, b+c, b+d}));
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void)
{
int a,b,c,... | 1 | 91,842,105 |
#define _USE_MATH_DEFINES
#include<iomanip>
#include<cmath>
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<queue>
#include<deque>
#include<stack>
using namespace std;
ty... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ARC072D()
{
ull X, Y;
c... | 1 | 20,574,215 |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, ... | 1 | 62,362,661 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
ll l, r;
cin >> l >> r;
if (r -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 1 | 52,685,270 |
#include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> cumsum(n + 1);
cumsum[0] = 0;
rep(i, 0, n)
{
int a;
cin >> a;
cumsum[i + 1] = a + cumsum[i];
}
ll ans = 100... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
long size,s,i;
s=i=0;
cin>>size;
long* a=new long[size];
long* b=new long[size];
for(i=0;i<size;i++)
{
cin>>a[i];
s+=a[i];
b[i]=s;
}
long k=abs(s-b[0]*2);
for(i=0;i<size-1;i++)
{
if(abs(s-b[i]*2)<k)
{
k=abs(s-b[i]*2);
}
}... | 1 | 65,470,474 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,X;
cin>>N>>X;
cout<<3*(N-__gcd(N,X))<<endl;
} | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define rep_down(i,n) for (int i=n-1; i>=0;--i)
... | 1 | 38,355,464 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MIN = -1e16;
int plm[] = {1, -1};
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> xyz(N, vector<ll>(3));
for(int i=0;i<N;i++) {
cin >> xyz[i][0] >> xyz[i][1] >> xyz[i][2];
}
vector<vector<vector<ll> > > dp(N+1, vector<vector<l... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> PPP(N), PPM(N), PMP(N), PMM(N);
for (int i = 0; i < N; i++) {
long long x, y, z;
cin >> x >> y >> z;
PPP[i] = x + y + z;
PPM[i] = x + y - z;
PMP[i] = x - y + z;
PMM[i] ... | 1 | 55,477,255 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A,B,C;
cin >> A >> B >> C;
if((A+B) >= C) cout << "Yes\n";
else cout << "No\n";
return 0;
} | 1 | 41,381,200 |
#include <iostream>
using namespace std;
int main(){
int a;
int b;
int c;
int n;
cin >> n;
for(int i=1; i<=n; i++){
cin >> a >> b >> c;
if(a*a+b*b==c*c || a*a+c*c==b*b || b*b+c*c==a*a){
cout << "YES\n";
}
else {
cout << "NO" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x<<e... | 1 | 30,403,577 |
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
int main(){
string str;
string max_len_str;
string most_many_str;
int most=-1;
int i;
vector<pair<string, int> > v;
string::iterator vi;
cin>>str;
v.push_back(pair<string, int>(str, 0));
max_len_str == v[0].first;
whi... | #include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <climits>
#include <cfloat>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = INT_MAX;
typedef long long LL;
typedef pair<int,int> P;
int main(){
vector<... | 1 | 99,699,005 |
#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
const int mx=200010;
const ll mod... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i... | 1 | 98,381,059 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1<<29;
int main(){
int H; int N;
cin >> H >> N;
int A[N]; int B[N];
for(int i=0;i<N;i++) cin >> A[i] >> B[i];
int DP[H+1];
DP[0]=0;
for(int i=1;i<=H;i++){
int minA=INF;
for(int j=0;j<N;j++){
if(i>A[j]){
minA=min(minA,DP[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int h, n;
cin >> h >> n;
int a[n], b[n];
rep(i, n) cin >> a[i] >> b[i];
vector<int> dp(h + 5, INF);
for (int i = 1; i <= h; i++) {
rep(j, n)... | 1 | 92,504,054 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <ios>
#include <iomanip>
#define ll long long
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int> P(m),Y(m);
for(int i=0;i<m;i++){
cin>>P[i]>>Y[i];
P[i]--;
... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct City {
City(int64_t i, int64_t p, int64_t y, int64_t n)
: id(i), p(p), year(y), no(n) {}
int64_t id;
int64_t p;
int64_t year;
int64_t no;
};
string Output(int64_t n) {
string str =... | 1 | 96,127,126 |
#include<stdio.h>
int main(){
int n;
int P[102]={};
while(1){
scanf("%d",&n);if(n==0)break;
for(int i=0;i<n;i++)
scanf("%d",&P[i]);
int s=0;
for(int i=0;i<n;i++)
for(int j=n-1;j>i;j--)
if(P[j]>P[j-1]){int t=P[j];P[j]=P[j-1];P[j-1]=t;}
for(int i=0;i<n;i++)
if(i!=0&&i!=n-1)s+=P[i];
s=s/(n-2);
printf("%d\n",s);
}
return 0... | #include "bits/stdc++.h"
using namespace std;
int main() {
int i, j;
int n;
while (cin >> n) {
if (n == 0) break;
int sum = 0;
vector<int> a(n);
for (i = 0; i < n; i ++) {
cin >> a[i];
... | 1 | 16,267,996 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
set<int> st;
rep(i, K) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, k;
cin >> n >> k;
vector<bool> sunuke(n, false);
for (int i = 0; i < k; i++)
{
int d;
cin >> d;
int candy;
for (int j = 0; j < d; j++)
{
cin >> candy; candy--;
sunuke[candy] = true;
}
}
int ans = 0;
for (int i = 0; i < n; i+... | 1 | 87,437,988 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
templa... | 1 | 14,027,174 |
#include<iostream>
using namespace std;
int main() {
int a[100] = { 0 };
for (int i = 0; i < 10; i++) {
cin >> a[i];
}
int big1, big2, big3;
big1 = a[0];
big2 = big3 = 0;
for (int k = 1; k < 10; k++) {
if (a[k] > big1) {
big3 = big2;
big2 = big1;
big1 = a[k];
}
else if (a[k] > big2) {
big3 = ... | #include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
string::size_type size=x.size();
return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,... | 1 | 7,883,120 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | 1 | 13,984,870 |
#include <stdio.h>
#include <string.h>
int main(){
int k;
char str[105];
scanf("%d", &k);
getchar();
scanf("%s", str);
int len = strlen(str);
if(len <= k) {
printf("%s\n", str);
} else {
for(int i = 0; i < k; i++) {
printf("%c", str[i]);
}
printf("...\n");
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int k;
cin >> k;
string s;
cin >> s;
if (k < s.size()) {
for (int i = 0; i < k; i++) {
cout << s.at(i);
}
cout << "..." << endl;
}
else {
for (int i = 0; i... | 1 | 29,731,003 |
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
const int inf = 1e18 + 9;
int a[N], pre[N], suf[N], sum[N];
signed main()
{
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
if(a[i] > 0)
pre[i] = pre[i - 1] + a[i];
e... | 1 | 2,449,133 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<string> VS;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define REP(i, init, N) for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define loop(n) for(int lp=0; lp<(n); lp++)
#define ascent(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define descent(i, a, b) for(int (i)=(a); (i)<(b); (i)--)
int main() {
int n;
cin >> n;
loop(n) {
int y, m, d;
cin >> y >> m >> d;
int ans = 196471;
i... | 1 | 1,335,739 |
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main()
{
int n;
while(cin>>n) a[n]++;
int ma = 0;
for (int i = 1; i <= 100; ++i) ma = max(ma, a[i]);
for (int i = 1; i <= 100; ++i) if (a[i]==ma) cout<<i<<endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
int main(){
int max=0,count=0;
std::vector<int> vec(100);
std::vector<int> vec2(100);
std::vector<int> vec3;
while(1){
for(int i=0;i<100;i++){
std::cin>>vec[i];
vec2[vec[i]]++;
if(vec2[vec[i]]>max)max=vec2[vec[i]];
count++;
}
if(std::cin.eof... | 1 | 49,508,790 |
#include <bits/stdc++.h>
using namespace std;
void input(vector<string>& rvsColor, int& rnRemain)
{
int nySiz, nxSiz;
cin >> nySiz >> nxSiz >> rnRemain;
rvsColor.resize(nySiz);
for (string& rsColor : rvsColor)
cin >> rsColor;
}
int calcNumOfCase(const vector<string>& cnrvsColor, int nRemain)
{
int nNumOfC... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int h, w, k;
cin >> h >> w >> k;
string s[h];
rep(i, h) cin >> s[i];
int ans = 0;
for(int i=0; i < (1<<h+w); i++)
{
int cnt = 0;
bitset<12> b(i);
for(int j=... | 1 | 81,943,008 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1<<30;
const int mod = 1e9+7;
int main() {
int N; cin >> N;
vector<int>... | #include<iostream>
using namespace std;
const int NMAX=(int) 1e5+1;
int main(){
int N;
cin >> N;
int A;
int AN[NMAX]={};
int even, odd, ans;
for(int i=0; i<N; i++){
cin >> A;
AN[A]++;
}
even=0;
odd=0;
for(int i=0; i<NMAX; i++){
if( AN[i]>0 && AN[i]%2==0 )... | 1 | 25,577,690 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
int a[100];
cin>>n;
while(n!=0){
for(int i=0;i<100;i++)
a[i]=1001;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int sum=0;
for(int i=1;i<n-1;i++)
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n==0) break;
vector<int> v;
for(int i=0;i<n;++i){
int tmp;
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(),v.end());
int ans=0;
for(int i=1;i<n-1... | 1 | 50,958,346 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
int main()
{
map<int,int> m;
long long int n;
cin>>n;
for(int i=2;i<=sqrt(n);i++)
{
while(n%i==0)
{
m[i]++;
n=n/i;
}
}
if(n>1)
m[n]++;
int ans=0;
for(auto it:m)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tii;
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
int main(){
ll N; cin >> N;
if(N==1){
cout << 0 << endl;
return 0;
}
ll n = N;
ll ans = 0;
for(ll i=2;i*i<=N;i++){
... | 1 | 48,386,186 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string s1 = s.substr(0, 4);
string s2 = s.substr(4, 8);
cout << s1 << " " << s2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1<<30;
int main(){
string s;cin>>s;
cout<<s.substr(0, 4)<<" "<<s.substr(4, 8)<<endl;
} | 1 | 46,891,613 |
#include <iostream>
using namespace std;
int main() {
int H, W; cin >> H >> W;
string S[H];
for (int i = 0; i < H; i++) cin >> S[i];
int dp[H][W];
for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) dp[i][j] = 1000000;
if (S[0][0] == '#') dp[0][0] = 1;
else dp[0][0] = 0;
for (int i = 0; i < H; i++){... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 1 | 35,246,949 |
#include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int state=0,cnt=0;
for(string step;n>0;--n){
cin>>step;
if(step=="lu"||step=="ru"){
if(state==1) cnt++;
state=1;
}else{
if(state==0) cnt++;
stat... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 1 | 36,494,577 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d[N];
int p[N];
for(int i=0;i<N;i++)cin >> d[i];
int sum = 0;
for(int i=0;i<N-1;i++){
for(int j=i+1;j<N;j++){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int n; cin >> n;
vector <int> d(n);
rep(i, n) cin >> d[i];
int ans = ... | 1 | 94,762,036 |
#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 PI 3.14... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 | 45,314,887 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
auto Ask = [&](long long x) {
cout << "? " << x << endl;
string u;
cin >> u;
return (u == "Y");
};
int n = (int) 1e9;
if (Ask(n)) {
long long m = 10;
while (!Ask(m - 1)) {
m *= 1... | #include <iostream>
using namespace std;
long cur=1e9;
inline bool check(long x){
cout<<"? "<<x<<endl;
char res;
cin>>res;
return res=='Y';
}
int main(){
if(check(cur))while(cur>1 && check(cur-1))cur/=10;
else{
while(!check(cur/=10));
long lb=cur,ub=cur*10;
while(ub-lb>1)... | 1 | 43,103,094 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin >> n >> k;
ll a[n],b[n];
rep(i,n) cin >> a[i] >... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 1 | 76,858,678 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll h, w;
cin >> h >> w;
if (h == 1 || w == 1){
cout << 1 << endl;
} else{
cout << (h * w + 1) / 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll h, w;
cin >> h >> w;
ll p = h * w;
if (h == 1 || w == 1)
cout << 1;
else if (p % 2 == 0)
cout << p / 2;
else
cout << p / 2 + 1;
return 0;
} | 1 | 12,235,609 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
double mot=0.0;
... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define FSP(n, v) cout << fixed << setprecision(n) << (v) << endl;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define iMAX 2147483647;
#define lMAX 9223372036854775807;
#define llMAX 18446744073709551615;
#define SORT(v) ... | 1 | 90,705,740 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#d... | #define _GLIBCXX_DEBUG
#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<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
vector<ll> a(2);
cin >> a[... | 1 | 53,916,659 |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <set>
#include <cmath>
using namespace std;
int main(){
int W, H;
cin >> W >> H;
vector<pair<int, int>> pq;
for(int i=0; i<W; i++){
int p;
cin >> p;
pq.push_back(... | 1 | 20,837,865 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
int main()
{
string s;
cin >> s;
vector<int> cnt(35);
for(int i = 0; i < s.size(); i++)
cnt[s[i] - 97]++;
if(cnt[0] && cnt[1] && cnt[2])
c... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 1 | 49,989,453 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s, n) for(int i = s; i < (int)(n); i++)
#define co(x) cout<<x<<endl
#define SQvec(i,j) vector<vector<int>> data(i, vector<int>(j))
#define mod 1000000000+7
typedef long long int lint;
int main() {
double n,m,d;
double ans;
cin >> n >> m >> d;
if(d == 0)... | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
double n, m, d;
cin >> n >> m >> d;
double p = (d == 0 ? 1 : 2) * (n - d) / (n * n);
cout << fixed << setprecision(15) << p * (m - 1) << endl;
} | 1 | 27,613,656 |
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int X, N;
cin >> X >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) cin >> p.at(i);
for (int i = 0; i <= 50; i++) {
bool flag1 = true;
bool flag2 = true;
for (int j = 0; j < N; j++) {
if (X - i == p.at(j)) {
flag1 = fa... | 1 | 79,963,792 |
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<array>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cassert>
#include<functional>
#include<random>
#include<complex>
#include<bitset>
#include<chron... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=100005;
const ll INF=0x3f3f3f3f;
const ll MOD=1000000007;
ll n,ans[MAX],pt,pt_idx=MAX;
pll a[MAX];
int main(){
scanf(" %lld",&n);
for(ll i=1;i<=n;... | 1 | 5,552,495 |
#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>
#include<cmath>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
#define PI acos(-1)
int main()
{
int a, b;
cin >> a >> b;
int c = a * b;
if (c % 2) {
cout << "Odd";
}
else {
cout << "Even";
}
} | 1 | 76,098,068 |
#include <bits/stdc++.h>
#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 pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJK... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = (int)s.size();
for (int i = 1; i < n; i++) {
string c = s.substr(n - i);
if ((n - i) & 1) continue;
bool ... | 1 | 55,994,965 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define SQ(a) (a)*(a)
template <class T, class U> ostream& operator<< (ostream &... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(),(v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<pair<int, int>> stu(n);
vector<pair<int, int>> vec(m);
rep(i, n... | 1 | 23,453,840 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
const double PI (acos(-1));
int main()
{
char C;
cin >> C;
C = C + 'b' - 'a';
cout << C;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
char c=getchar();
cout<<(char)(c+1)<<"\n";
return 0;
} | 1 | 24,266,823 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
#define pb(n,m) n.push_back(m)
#define fix(n) cout<<fixed<<setprecision(n);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<... | #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... | 1 | 71,311,665 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long i, x = 0, ans = 0;
string s;
cin >> s;
for(i = 0; i < s.size(); i++)
{
if(s[i] == 'B')
x++;
else
ans += x;
}
cout << ans;
} | 1 | 59,301,979 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #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 mod=1000000007;
const int INF=1001001001;... | 1 | 99,041,138 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int A, B;
cin >> A >> B;
for (int i = 1; i < 2000; i++){
int x = int(i * 0.08);
int y = in... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define vl vector
using namespace std;
int main()
{
ll n,a,b,i,j;
cin>>a>>b;
for(i=1;i<=1000000;i++)
{
long double x,y;
x=i*0.08;
y=i*0.1;
ll c,d;
c=floor(x);
d=floor(y);
if(c==a && ... | 1 | 39,906,332 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
const int N = 1e5 + 7;
int n, ans[N];
pii a[N];
bool cmp(pii x, pii y){
return (x.fi > y.fi || (x.fi == y.fi && x.se < y.se));
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
co... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("sse,sse2,... | 1 | 89,524,263 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
ll dist[int(1e5)+2];
void dfs(vector<ar<ll,2>> *v, int parent,int vertex, ll c)
{
dist[vertex] = c;
for(auto it:v[vertex])
if(it[0]!=parent)
dfs(v,vertex,it[0],dist[vertex]+it[1]);
}... | 1 | 50,873,357 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
int ans;
bool sum = true;
if (s.size() <= t.size()) {
for (int i = 0; i < s.size(); i++) {
string st = s.substr(0, i) + t;
if (st.substr(0, s.size()) == s && st.substr(st.... | #include <bits/stdc++.h>
using namespace std;
#define foru(i, l, r) for (register int i = l; i <= r; i++)
#define ford(i, r, l) for (register int i = r; i >= l; i--)
int N;
char S[100002];
char T[100002];
int main() {
scanf("%d%s%s", &N, S + 1, T + 1);
for (int len = N; len >= 1; len--) {
bool flag = true;
... | 1 | 42,528,648 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,flag=0;
cin >> N;
for(int i=0;i<3;i++){
if(N%10==7) flag++;
N/=10;
}
if(flag){
cout<<"Yes";
}else{
cout<<"No";
}
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>... | 1 | 43,014,984 |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define EPS (1e-7)
#define INF (1e9... | #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)
#define all(a) (a).begin(), (a).end()
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d) << '\n';
ret... | 1 | 29,385,618 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int mxN = 50000000;
vector<int> cnt(mxN + 1);
int main() {
int n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i <= n; i++) {
... | #include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#include<bits/stdc++.h>
#define ll long long
#define dd double
using namespace std;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
... | 1 | 49,417,385 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
if(N <9)
cout << N << endl;
else if(N < 100)
cout << 9 << endl;
else if(N < 999)
cout << 9 + N - 100 + 1 << endl;
else if(N < 10000)
cout << 909 << endl;
else if(N < 99999)
cout << 909 + N - 10000 + 1<< endl;
else... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<(x)<<endl
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll inf=1e18;
const int N=2e5+10;
ll factorial(ll x){
if(x==0||x==1) return 1;
return x*factorial(x-1);
}
ll gcd(ll a ,ll b){return b ? gcd... | 1 | 10,758,179 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#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>
#... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int n , p , a[55];
long long gu=0 , ki=0 , ans=0 , allgu=0 , GN=1 , GR=1 ,KN=1 , KR=1;
cin >> n >> p;
for(int i=0 ;i<n ;i++ ){
cin >> a[i];
if(a[i]%2 == 1){
ki++;
} else {
gu++;
}
}
... | 1 | 6,146,086 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> a(101, 0);
int n, max = 0;
while (cin >> n, n != 4)
{
a[n]++;
if (a[n] > max) max = a[n];
}
for (int i = 1; i < a.size(); ++i)
if (a[i] == max) cout << i << endl;
return 0;
} | #include<iostream>
using namespace std;
int main() {
int datas[100] = { 0 };
int num,biggest_num=0;
while (cin >> num) {
datas[num-1]++;
}
for (int i = 0; i < 100; i++) {
if (biggest_num < datas[i]) {
biggest_num = datas[i];
}
}
for (int i = 0; i < 100; i++) {
if (biggest_num == datas[i]) {
cout <<... | 1 | 86,960,930 |
#include <stdio.h>
int main(){
int h1, m1, h2, m2, k;
scanf("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
if(h1>h2){
h1-=24;
}
if(h2 == 0 && h1 != 0){
h2 = 24;
}
if(m2<m1){
m2 += 60;
h2--;
}
int mins = (h2-h1)*60 + (m2-m1);
mins-=k;
printf("%d\n", mins);
return 0;
} | #include<iostream>
#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define pb(x) push_back(x)
#define gcd(a,b) __gcd(a,b)
#define all(v) v.begin(),v.end()
#define lcm(a,b) (a*b)/gcd(a,b)
#define bits(x) __builtin_popcountll(x)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... | 1 | 77,006,178 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main()
{
ll n... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#inclu... | 1 | 99,939,012 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
int main(){
int N, a;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | 1 | 12,877,055 |
#include <iostream>
using namespace std;
int main() {
int i = 1;
int no;
cin >> no;
while(!(no == 0)) {
cout << "Case " << i << ": " << no << endl;
i++;
cin >> no;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <cmath>
#include <functional>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main(){
int tmp, i = 1;
cin >> tmp;
while (tmp != 0){
cout << "Case " << i << ": " << tmp << endl;
i++;
cin >>... | 1 | 66,727,123 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
int x,y;cin >> x >> y;
ll ans = 0; int a[x];
for(int i = 0;i < x;i++){
cin >> a[i];
}
for(int i = 1;i < x;i++... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
ll mod = 1000000007;
ll ans = 1<<29;
int main() {
int N,T;
cin >> N>>T;
vector<int> t(N);
rep(i,N) cin >> t[i];
... | 1 | 45,961,435 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<int, int>;
using Edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<Edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MO... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0;i < (n);++i)
struct P{
int minest, double_minest;
};
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) a[i]--;
vector<int> idx(n);
rep(i,n) idx[a[i]... | 1 | 18,309,914 |
#include <bits/stdc++.h>
#define ull unsigned long long
#define mem 26
using namespace std;
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string s;
cin>>s;
int n = s.length();
int j = n-1;
ull moves=0;
for(int i=n-1;i>=0;i--) {
if(s[i]=='B') {
moves+=(j-i);
j--;
... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0; i < n; i++)
#define repd(i, n) for (int i = n-1; i > -1; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main()
{
string s; cin >> s;
ll now = 0;
ll ans = 0;
rep(i, ll(s.size())){
if (s[i] == 'W'){
... | 1 | 60,498,110 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to) - 1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typena... | #include <bits/stdc++.h>
using namespace std;
bool rev(int n) {
string S = to_string(n);
string RS;
for (int i = S.length() - 1; i >= 0; i--) {
RS += S[i];
}
return S == RS;
}
int main() {
int A, B;
cin >> A >>B;
int cnt = 0;
for (int i = A; i <= B; i++) {
if (rev(i... | 1 | 8,723,034 |
#include <iostream>
#include <queue>
#define INFTY -1
using namespace std;
int a[124][124] = {{}};
int d[124] = {};
int n;
void bfs(int k){
queue <int> q;
q.push(k);
int u;
while(!q.empty()){
u = q.front(); q.pop();
for(int v = 0;v < n;v++){
if(a[u][v] == 0) continue;
if(d[v] == INFTY) {
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for(long long int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000
#define LLINF 1000000000000000000
#define PI 3.14159265358979
using namespace std;
typedef long long int ll;
typedef pair< long long... | 1 | 24,790,637 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, k;
double calc(int a[], int b[]) {
double x = 0;
for(int i = 0; i < k; i++) {
x += pow(a[i] - b[i] , 2);
}
return sqrt(x);
}
void solve() {
cin >> n >> k;
int mat[n][k];
for(int i = 0; i < n; i++) {
for(int j = 0; j < k; j++) {
cin ... | #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, d;
cin >> n >> d;
vector<vector<double>> x(n, vector<double>(d));
rep(i, n) rep(j, d) cin >> x[i][j];
int ans = 0;
rep(j, n) rep(i, j) ... | 1 | 54,152,934 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
int main(){
std::vector<int> a(5);
for(int i=0;i<5;i++)std::cin>>a[i];
sort(a.begin(),a.end(),std::greater<int>());
for(int i=0;i<4;i++)std::cout<<a[i]<<" ";
std::cout<<a[4]<<std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
int a[5];
int main(){
REP(i,5){
cin>>a[i];
}
sort(a,a+5);
REP(i,5){
if (i) cout<<" ";
cout<<a[4-i];
}
cout<<endl;
return 0;
} | 1 | 72,237,333 |
#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 repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int ex[7]={1,2,4,8,16,32,64};
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | 1 | 95,852,434 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int count = 0;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
count += a[i];
}
int count2 = 0;
int ans = 1e9;
for (int i = 0; i < n; i++) {
count2 += a[i];
count -= a[i];
ans =... | #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> w(n);
rep(i,n) cin >> w[i];
int s1 = 0;
int s2 = 0;
rep(i,n) s2 += w[i];
int mn = 100000000;
rep(i,n){
s1 += w[i];
s2 = s2 - w... | 1 | 16,732,506 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long M=100000007;
ll ans[M],n,k;
int main(){
cin >> n >> k;
if(k >= (1<<n)){cout<<"-1\n";return 0;}
if (n == 1) {
if(k == 1) {
cout << -1 << endl;
return 0;
}
cout << "0 0 1 1" << endl;
return 0;
}
for(ll i=0;i<(1<<n);i++) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
typedef pair<int,int>pii;
const int mxN=2e5,M=1e9+7;
int m,k;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>m>>k;
int tot=1<<m;
if(k>=tot)cout<<-1;
else if(m==1){
... | 1 | 25,149,133 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | 1 | 15,659,210 |
#include<stdio.h>
int main(void)
{
int H,W,x,y,i;
char op;
op='#';
scanf("%d %d",&H,&W);
while(!(H==0 && W==0)){
for(x=0;H>x;x++){
for(y=0;W>y;y++){
printf("%c",op);
}
printf("\n");
}
printf("\n");
scanf("%d %d",&H,&W);
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int H,W;
bool flag= true;
cin>>H>>W;
if(H==0&&W==0){
flag = false;
}
while(flag==true){
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cout<<"#";
}
cout<<endl;
}
cin>>H>>W;
if(H==0&&W==0){
flag = false;
}
cout<<endl;
}
return 0;
} | 1 | 7,047,679 |
#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 <vector>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;
int main()
{
auto& in = cin;
int N, M, X;
in >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N);
for (int i = 0; i < N; ++i) {
in >> C[i];
A[i].resize(M);
for (int j = 0; j < M; ++j)
... | 1 | 17,837,139 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | 1 | 61,894,150 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int res=n%k;
cout<<res;
} | #include<iostream>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
if(k<2 || n<k)
cout<<"0"<<endl;
else{
cout<<n-k<<endl;
}
return 0;
} | 1 | 46,968,003 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
struct UnionFind
{
vector<int> d;
Uni... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i,n) for(i = 0; i < n; i++)
#define f1(i,n) for(i = 1; i <= n; i++)
#define all(a) a.begin(),a.end()
#define upp(v,val) upper_bound(v.begin(), v.end(), val)
#define lower(v,val... | 1 | 49,162,087 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | 1 | 16,374,307 |
#include <iostream>
#include <cstdlib>
using namespace std;
void print(int a, int b, char str[]);
void rev(int a, int b, char str[]);
void rep(int a, int b, char str[], char repstr[]);
int main()
{
char str[1000];
int orderlen;
cin >> str;
cin >> orderlen;
cin.clear();
cin.ignore();
for(int i=0; i<orderlen; i++)... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string S,s;
int n,a,b;
int main(){
cin >> S;
cin >> n;
for(int i=0;i<n;i++){
cin >> s >> a >> b;
if(s == "print"){
string t = S.substr(a,b-a+1);
cout << t << endl;
}else if(s=="reverse"){
reverse(S.begin()+a,S.begin()+b+1)... | 1 | 11,155,425 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0,ans = 0;
cin >> N;
vector<ll>A(N);
rep(i,N){
cin >> A[i];
}
for(ll i = 0;i < N-1;i++){
for(ll j = 1;j + i < N;j++){
ans+=A[i] * A[i+j];
}
}
cout <... | #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> d(N);
rep(i, N) cin >> d[i];
int ans = 0;
rep(i, N) {
for (int j = i + 1; j < N; j++) {
ans += d[i] * d[j];
}
}
cout << ans << endl;
... | 1 | 87,465,570 |
#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;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 100005;
const int inf = 1e8;
int A[N], dp[N][3];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n;
cin>>n;
ll ans = 0;
fo... | 1 | 58,494,812 |
#include <iostream>
#include <queue>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
struct Cell {
int x;
int y;
int cost;
};
bool operator<(const Cell &lhs, const Cell &rhs) { return lhs.cost < rhs.cost; }
bool operator>(const Cell &lhs, const Cell &rhs) { return lhs.cost >... | #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()
#define INF 1000000
int main()
{
int h,w;cin>>h>>w;
vector<vector<char>> s(h,vector<char>(w));
int i,j;
rep(i,h)rep(j,w)cin>>s[i][j];
vector<vector<int>> dp_modoki(h,vector<int... | 1 | 34,866,896 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
template<class T> ll LevenshteinDistance(std::vector<T> v1, std::vector<T> v2){
std::vector<std::vector<ll>> mat(2, std::vector<ll>(v2.size()+1));
REP(i,v2.size()+1) mat[0][i]=i;
REP(i,v1.size()){... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n... | 1 | 50,442,057 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.