code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i <... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long... | 0 | 6,139,236 |
#include <iostream>
using namespace std;
int main() {
int a,b , c;
cin >>a>>b>>c ;
if(a+b>=c)
{
cout<< "Yes " ;
}
else {cout<<"No " ;}
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp ... | 0 | 65,025,722 |
#include <bits/stdc++.h>
using namespace std;
const char same = 'o';
const char diff = 'x';
int main() {
int n;
cin >> n;
string s;
cin >> s;
auto judge = [&](int a, int b, int c)->bool {
vector<int> v(n, 0);
v[0] = a; v[1] = b; v[2] = c;
for (int i = 2; i < n-1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
vector<int> count(101,0);
int n,k,d,t;
cin>>n>>k;
while(k... | 0 | 79,127,941 |
#include<iostream>
using namespace std;
int main()
{
int X, A;
cin>>X>>A;
if(X < A)
{
cout<<"0";
}
else
{
cout<<"10";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int gcd(int a,int b){
return (b==0)?a:gcd(b,a%b);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t;
cin>>t;
u... | 0 | 13,818,195 |
#include <complex>
#include <cmath>
#include <iostream>
using namespace std;
typedef complex<double> xy_t;
double dot_product(xy_t a,xy_t b) {
return (conj(a)*b).real();
}
double cross_product(xy_t a, xy_t b) {
return (conj(a)*b).imag();
}
xy_t projection(xy_t p,xy_t b) {
return b * dot_product(p,b)/norm(b);
}
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | 0 | 30,264,745 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(26,1e9);
for (int i = 0; i < N; ++i) {
vector<int>Asub(26);
string S;
cin >> S;
for (int j = 0;j<S.size();++j) {
Asub[S[j]-'a']++;
}
for (int j = 0;j<26;++j) {
A[j] = min(A[j],Asub[j]);
}
}
string ans;
fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_YESN... | 0 | 90,045,915 |
#include <iostream>
using namespace std;
string s;
void solve() {
int cnt = 0;
int l = 0, r = s.size() - 1;
while (l < r) {
if (s[l] == s[r]) {
l++;
r--;
} else if (s[l] == 'x') {
cnt++;
l++;
} else if (s[r] == 'x') {
cnt++;
r--;
} else {
cout << -1 << end... | #include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,i... | 0 | 20,460,571 |
#include <iostream>
using namespace std;
int main()
{
int price, change, coin_num, cnt;
int coin_kind[] = {500, 100, 50, 10, 5, 1};
while(cin >> price, price > 0) {
coin_num = 0;
cnt = 0;
change = 1000 - price;
while(change > 0) {
if(change - coin_kind[cnt] >= 0) {
coin_num++;
change -= coin_kind[... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define int long long
#defi... | 0 | 34,824,216 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main() {
string A, B;
cin >> A;
cin >> B;
if(A.size() > B.size()) { cout << "GREATER"; return 0; }
else if(A.size() < B.size()) { cout << "LESS"; return 0; }
else {
for(int i = 0; i < A.size(); i++) {
if(A[i] > ... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 98,167,968 |
#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;
if(N%2==0){
cout<<(N/2)-1<<endl;
}else{
cout<<N/2<<endl;
}
return 0;} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 87,565,795 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | #include <iostream>
#include <string>
#include <cstring>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
void bubble(int si[],char sc[],int N)
{
for(int i=0;i<N;i++)
{
for(int j=N-1;j>i;j--)
{
if(si[j]<si[j-1])
{
swap(si[j],si[j-1]);
swap(sc[j],sc[j-1]);
... | 0 | 59,480,447 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
#include<deque>
#include<functional>
#include<utility>
using na... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define PI acos(-1)
using namespace std;
struct Point
{
double x;
double y;
};
void koch(int n,Point a,Point b)
{
if(n==0)
return ;
Point s,u,t;
double theta=PI*60.0/180.0;
s.x=(2.0*a.x+1.0*b.x)/3.0;
s.y=(2.0*... | 0 | 86,225,828 |
#include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
using namespace std;
int n;
int A[N];
int B[N];
int main()
{
ios_base::sync_with_stdio(false);
cin >> n;
for(int i = 1; i <= n; i++){
int x;
cin >> x;
A[x] += i;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 0 | 14,194,085 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int A, B, C, D;
map<int, char> m;
void input() {
string s;
cin >> s;
A = s[0] - '0';
B = s[1] - '0';
C = s[2] - '0';
D = s[3] - '0';
}
int solve(int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll ans = 1e18;
for (int i = 0; i < 1 << n; ++i) {
vector<ll> aa = a;
ll ma = aa[0];
int cnt = 0;
ll sum = 0;
for (... | 0 | 501,138 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long doubl... | 0 | 58,644,899 |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define MAXN 200007
int a[MAXN];
bool cnt[1000007];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n; cin >> n;
for(int i=0; i<n; i++) {
cin >> a[i];
}
sort(a,a+n);
memset(cnt,0,sizeof cnt);
long long ans=0;
for(... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 4,892,830 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | 0 | 47,332,466 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S,T,U;
cin >> S >> T;
int A,B;
cin >> A >> B;
cin >> U;
int countS=A, countT=B;
if (S==U) {
countS--;
}
else if (T==U) {
countT--;
}
cout << countS << " " << countT << e... | 0 | 93,084,482 |
#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 <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <stdio.h>
#include <math.h>
double eps = 1e-10 ;
int main()
{
double x1, x2, x3, y1, y2, y3, xp, yp;
double s, s1, s2, s3;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) != EOF){
s = ((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2;
s1 = ((xp - x1) * (y2 - y1)... | 0 | 95,984,008 |
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T &a, T b)
{
if(a < b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int H, W;
cin >> H >> W;
vector<string> mp(H);
... | 0 | 14,215,758 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> ball(n);
map<int,int> maps;
for(int i=0;i<n;i++){
cin>>ball.at(i);
if(maps.count(ball.at(i))) maps.at(ball.at(i))++;
else maps[ball.at(i)]=1;
}
vector<int> num;
for(auto a:ball){
if(maps.at(a)!=0)... | 0 | 18,107,467 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int sum, n;
string num;
while(true){
sum = 0;
getline(cin, num);
for(int i = 0; i <= 1000; i++){
if(num[i] == '\0') break;
n = num[i] - '0';
sum += n;
}
if(sum == 0) break;
cout << sum << endl;
}
} | #include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
string s; cin >> s;
string t = "";
for (int i = 0; i < s.size(); i++) {
if (s[i] != '/') {
t += s[i];
}
}
int n = stoi(t);
if (n > 20190430) {
cout << "TBD" <... | 0 | 17,719,137 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)==2)
{
if(a<b)
{
cout<<"a < b"<<endl;
}
else if(a>b)
{
cout<<"a > b"<<endl;
}
else
{
cout<<"a == b"<<endl;
}... | 0 | 63,093,832 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#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 a,b;
cin >> a >> b;
int ans = 0;
REP(i,3) ans += a[i]==b[i];
co... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e5+10;
int a[maxn];
int cmp(const int a,const int b){
return a>b;
}
int n,m,v,p;
int b[maxn];
bool judge(int mid){
if(mid<=p)return true;
if(a[mid]+m<a[p])return false;
if(v<=p-1&&a[mid]+m>=a[p])return true;
int temp... | 0 | 18,952,046 |
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> a[1010];
int main(){
scanf("%d",&n);
int t = sqrt(2*n);
if(t*(t+1)==2*n){
printf("Yes\n%d\n",t+1);
int cnt = 1;
for(int i=1;i<=t;i++){
for(int j=1;j<=i;j++){
a[i].push_back(cnt);
... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
vector<int> a(5);
rep(i, 0, 5) cin >> a[i];
int mn = 10;
rep(i, 0, 5){
if(a[i]%10 == 0) continue;
mn = min(mn, a[i]%10);
}
in... | 0 | 55,561,187 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pv(val) cerr << #val << '=' << (val) << endl
const int INF = 1e9;
int main(void){
int N, M, K; cin >> N >> M >> K;
bool ok = ... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define ALL(a) a.begin(), a.end()
#define ALLN(a, n) (a, a+n)
#define MAX 10000007
#define MIN -10000007
int main()
{
ios::sync_with_stdio(0);
ci... | 0 | 83,879,166 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define debug(...) 42
#endif
#define sf scanf
#define pf printf
#define nl printf("... | 0 | 33,170,351 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,vl>;
using Tu = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
const ll INF=1LL<<60;
const ll MOD=1000000007;
int main(){
ll X;
cin >> X;
ll Y;
cin >> Y;
ll Z;
ci... | 0 | 46,860,649 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
string s;
cin >> s;
string y = s.substr(0, 4);
string... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000... | 0 | 2,747,191 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<bool> ok(n, false);
vector<int> penas(n, 0);
rep(i, m) {
int p;
string s;
cin >> p >> s;
p--;
if (s == "WA") {
if (!ok... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i ++){
int _a;
cin >> _a;
a[i] = _a;
}
sort(a.begin(), a.end());
int now_num = 0;
int now_cnt = 0;
int ans = 0;
for (auto num : a){
... | 0 | 68,364,840 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i++)
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
using namespace std;
using P = pair<int,int>;
ll gcd(ll a, ll b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 0;
ans += abs(a[0]);
ans += abs(a[n-1]);
for(int i = 0; i < n-1; i++)
... | 0 | 41,385,144 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
char c='2';
string s;
cin>>s;
int ans=0;
rep(i,s.length()){
if(i==0)continue;
if(s... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | 0 | 23,675,733 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include<bits/stdc++.h>
#define ll long long
#define db double
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define A first
#define B second
#define lowbit(p) (p&(-p))
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=g... | 0 | 89,555,406 |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
using namespace std;
int parent(int i){
return i/2;
}
int left(int i){
return 2*i;
}
int right(int i){
return 2*i +1;
}
int maxheapify(vector <int> &X, int i){
int l, r;
l = left(i);
r = right(i);
if (r <=X[0] && X[l]... | #include <iostream>
#include <cstdio>
#include <map>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll h, w, n;
ll a[15];
map<pair<ll, ll>, ll> ma;
int main()
{
scanf("%lld%lld%lld", &h, &w, &n);
a[0] = (h - 2) * (w - 2);
for(ll i = 0; i < n; i++)
{
ll x, y;
... | 0 | 67,890,196 |
#include<stdio.h>
int main(){
int input;
scanf("%d", &input);
char kata[input+1];
scanf("%s", &kata);
if(input%2==1){
puts("No");
}
else {
int flag = 1;
for (int i=0;i<input/2;i++){
if (kata[i] != kata[i+input/2]){
flag=0;
}
}
if (flag){
puts("Yes");
}
else {
puts("No");
}
}
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int ans = 0;
int x = S[0];
for(int i = 1; i < S.length(); i++) {
if(S[i] != x) {
ans... | 0 | 10,590,331 |
#include <bits/stdc++.h>
using namespace std;
void display(vector<long> B){
for(int i=0;i<B.size();i++){
cout<<B.at(i)<<endl;
}
cout<<endl;
}
int main() {
long N;
cin>>N;
vector<long> A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
}
long sum=0,times=0;
for(int i=0;i<N;... | #include <iostream>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<vector>
#include<iomanip>
#include<map>
#include<set>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n;i++)
ll d[300][300],v, n, c, e, u, k, sum = 0,ans;
const long long int INF = (1LL << ... | 0 | 67,777,300 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
double find_angle(int x, int y, int z)
{
int volume = x * x * y;
double ans = 0;
if (z < volume / 2) {
double d = (x * y * y) / (2.0 * z);
ans = atan(d);
}
else {
z = volume - z;
double d = (2 * z) ... | 0 | 66,805,075 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | 0 | 71,853,070 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <iomanip>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define F first
#define S second
#define lb lower_bound ... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll N, X, M;
scanf("%lld %lld %lld... | 0 | 14,558,528 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | 0 | 50,012,047 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
vector<long long> b;
vector<int> idx;
int cnt = 0;
for (int i=0; i<n; i++) {
long long tmp = 0;
for (int j=i; j<n; j++) {
tmp += a[j];
b.push_back(tmp);
... | #include <iostream>
#include <vector>
#include <tuple>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <queue>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sy... | 0 | 29,202,987 |
#include <stdio.h>
int main (){
int h1, m1, h2, m2, k;
scanf ("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
int n = ((h2-h1)*60)+(m2-m1)-k;
printf ("%d\n", n);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T>
bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#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, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for... | 0 | 11,977,036 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e11;
using Graph = vector<vector<int>>;
signed main(){
vector<int> prime;
for( int i = 2; i <= 100; i++ ){
bool fg = 1;
for( int j = 2; j < i; j++ ){
if( i%j == ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define ... | 0 | 60,324,871 |
#include<stdio.h>
#include<string.h>
main(){
int N;
char S[1025];
scanf("%d",&N);
char str[][6] = {".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
for(int i = 0;i < N;i++){
scanf("%s",S);
int num = 0;
int count = 0;
for(int j = 0;j < strlen(S);j++){
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define endl '\n'
using namespace std;
const int N = 2e4 + 5;
int n, p[N];
int a[N], b[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++)
{
... | 0 | 28,664,214 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[15][15];
int c[15];
int main(){
int n, m, x;
cin >> n >> m >> x;
for(int i = 0; i < n; i++){
cin >> c[i];
for(int j = 0; j < m; j++) cin >> a[i][j];
}
int ans = 1001001001;
for (int bit=0; bit<(1<<n); bit++){
int cos... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+7;
int n, m;
int x, y;
int p[maxn];
vector<int> e[maxn];
bool vis[maxn];
int ans;
set<int> pos;
void dfs(int u)
{
vis[u] = true;
pos.insert(u);
for(int &x : e[u]) if(!vis[x]) dfs(x);
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = ... | 0 | 66,615,646 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | #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;
int N;
typedef pair<int, int> point;
typedef t... | 0 | 66,985,343 |
#define _CRT_SECURE_NO_WARNINGS
#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
int main(int argc, char **argv){
int w, h, x, y, r;
cin >> w >> h >> x >> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
char c;
cin>>c;
if(c=='A')
{
cout<<'T'<<endl;
}
else if(c=='C')
{
cout<<'G'<<endl;
}
else if(c=='T')
{
cout<<'A'<<endl;
}
else if(c=='G')
{
cout<<... | 0 | 99,480,195 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<string> S(N);
string X;
for(int i=0; i<N; i++) {
cin >> S[i];
}
for(char c = 'a'; c <= 'z'; c++) {
int n = count(S[0].begin(),S[0].end(), ... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 42,039,023 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin>>s>>t;
if(s[0]==t[2]){
if(s[1]==t[1]){
if(s[2]==t[0]){
cout<<"YES"<<endl;
return 0;
}
}
}
cout<<"NO"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int_Max 2147483647
#define ll_Max 9223372036854775807
#define REP(i,f,n) for(int i=f; i<(n); i++)
ll sigu(ll a){
ll ans = 0;
REP(i,1,a + 1){
ans += i;
}
return ans;
}
int main()
{
ll ans = 0, cnt = 0, muki ... | 0 | 19,804,854 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
ll k;
cin>>s>>k;
ll cnt=0;
ll t;
rep(i,s.size()){
if(s[i]=='1') cnt++;
else{
t=s[i]-'0';
break;
}
}
if(... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 28,075,775 |
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define mod 1000000007
#define pi 3.1415926535
typedef long long ll;
int main(){
int N,K;
cin>>N>>K;
if(K==1){
cout<<0<<endl;
}el... | #include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a >= -1000 && a <= 1000 && b >= -1000 && b <= 1000){
if (a > b) {
cout << "a > b" << endl;
}
else if (a < b) {
cout << "a < b" << endl;
}
else {
cout << "a == b" << endl;
}
}
else {
cout << "error" << endl;
}
} | 0 | 17,166,873 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int n=(int)s.length();
if(n<26)
{
for(char c='a';c<='z';c++)
{
if(s.find(... | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | 0 | 99,038,293 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | #include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
vector<ll> a(n + 1), b(n);
for(int i = 0; i <= n; +... | 0 | 62,101,374 |
#include <iostream>
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b; cin >> a >> b;
ll ans = -1;
if(a%b != 0) ans = a;
cout << ans << '\n';
return 0;
} | #include<stdio.h>
int main(){
int a,b,c;
while(scanf("%d%d%d",&a,&b,&c),a+b+c){
c=100-c;
int win=0;
int mon=0;
for(int i=0;i<a;i++){
int d;
scanf("%d",&d);
if(b==i+1)win=d;
mon+=c*d;
}
printf("%d\n",win?mon/win:0);
... | 0 | 95,305,816 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | 0 | 58,391,730 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i = 0;i<((ll)(n));i++)
#define reg(i,a,b) for(ll i = ((ll)(a));i<=((ll)(b));i++)
#define irep(i,n) for(ll i = ((ll)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(ll i = ((ll)(b));i>=((ll)(a));i--)
template<class T = int> using V = vect... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
int d[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
signed main(){
i... | 0 | 53,001,999 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi... | 0 | 70,836,262 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main() {
int N;
cin >> N;
vector<long long> cnt(100001);
int maxD = 0;
for (int i = 0; i < N; i++) {
int d;
cin >> d;
if (i == 0 && d != 0) {
cout << 0 << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int k;
ll ans;
ll solve() {
deque<pair<int, ll>> deq;
set<int> visited;
deq.push_front(make_pair(1, 0LL));
ll ret = 0;
while (!deq.empty()) {
auto cur = deq.front();
d... | 0 | 41,282,550 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
map<int, map<int, int> > dp1;
map<int, map<int, int> > dp2;
int mo=1000000007;
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin>>n>>m;
int x[n+5];
int y[m+5];
int dpx[n+5];
int dpy[m+5];
for(... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <stack>
#include <queue>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace st... | 0 | 49,299,008 |
#include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | #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;
string S;
cin >> N >> S;
int ans = 0;
rep(i,10) rep(j,10) rep(k,10) {
for (int l = 0; l < N; ++l) {
if (S.at(l) == '0' +... | 0 | 71,955,109 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, d, a;
cin >> n >> k;
vector<bool> A(n, false);
for(int i = 0; i < k; i++){
cin >> d;
for(int j = 0; j < d; j++){
cin >> a;
A.at(a - 1) = true;
}
}
int count = 0;
for(int i = 0; i < n; i++){
if(!A.at(i)) count++... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 3,063,238 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int A = 0;
rep(i,N){
int buf;
cin >> buf;
A += buf;
}
if(H <= A){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(... | 0 | 81,332,622 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,j,k,l,c=0;
string s;
vector<char > v;
cin>>n;
cin>>s;
s.push_back('A');
for(i=0;i<n;i++)
{
if(s[i]!=s[i+1])
{
v.push_back(s[i]);
}
}
cout<<v.size()<<endl;
} | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.e... | 0 | 21,817,866 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string S, T;
int first;
bool judge = false;
bool a = true;
cin >> S >> T;
for (int i = 0; i <= (int)S.size() - (int)T.size(); i++)
{
if (S[i] == T[0] || S[i] == '?')
{
for (int j = 0; j < (int)T.size(); j++)
... | #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);
int N;
cin >> N;
cout << (N*800)-(N/15*200) << endl;
return 0;
} | 0 | 97,440,911 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod=1000000007;
const double PI = 3.14159265359;
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define INF 1000000000000
#define pb push_back
#define pf push_front
#define... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
#include <stack>
#include <ioman... | 0 | 49,421,636 |
#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N, D, ans, tmp;
cin >> N >> D >> ans;
for (int i = 0; i < N; i++)
{
cin >> tmp;
ans += (D - 1) / tmp + 1;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)... | 0 | 75,172,723 |
#include<iostream>
int main(){
int N, K;
std::cin >> N >> K;
if(N % K == 0) std::cout << 0 << std::endl;
else std::cout << 1 << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
ll n,sum = 0,ans = 0;
cin >> n;
vector<int>a(n);
vector<int>b(n);
rep(i,0,n) cin >> a[i];
rep(i,0,n) cin >> b[i];
rep(i,0,n){
a[i] -= b[i];
sum += a[i];
}
if(su... | 0 | 44,870,066 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | 0 | 11,796,234 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_binaric_easy(void) {
string s;
cin >> s;
char ans[20]={' '};
int ptr = 0;
for (int i = 0; i < s.size(); i++) {
if ((s[i] == '0') || (s[i] == '1')) {
ans[ptr++]=s[i];
}
else {
if ... | #include <iostream>
using namespace std;
int main()
{
int n, x;
while (cin >> n >> x, n != 0 || x != 0) {
int c = 0;
for (int i = 1; i <= n - 2; i++)
for (int j = i + 1; j <= n - 1; j++) {
int k = x - i - j;
if (j < k)
k <= n ? c++ : 0;
else
break;
}
cout << c << endl;
}
} | 0 | 34,284,350 |
#include <iostream>
using namespace std;
int fibonacci(int);
int dp[45];
int main(){
int n,result,i;
for(i=0;i<45;i++) dp[i]=0;
cin >> n;
result=fibonacci(n);
cout << result << endl;
return 0;
}
int fibonacci(int n){
if(n==0||n==1) return dp[n]=1;
if(dp[n]!=0) return dp[n];
return dp[n]=fibonacci(n-1)... | #include <iostream>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
while(h!=0&&w!=0){
for(int g=1;g<=h;g++){
for(int i=1;i<=w;i++){
cout<<"#";
}
cout<<"\n";
}
cout<<"\n";
cin>>h>>w;
}
} | 0 | 26,273,196 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long) 1e9 + 7;
long factorials[500001];
int pre_factorials(int n){
factorials[0] = 1;
for (int i = 0; i... | #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 <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 43,217,892 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
int ans = a * b;
if (ans % 2 == 0) {
cout << "Even" << "\n";
} else {
cout << "Odd" << "\n";
}
} | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a... | 0 | 19,432,927 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <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... | 0 | 86,885,969 |
#include <bits/stdc++.h>
#include <map>
#include <cmath>
typedef long long int ll;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;cin>>n;
vector<pair<string,int> > vect;
for(int i=0;i<n;i++){
string s; int t;
cin>>s>>t;
vect.push_back(make_pair(s,t));
}
string x;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dp[2005][2005];
signed main() {
int N,M;
cin >> N >> M;
vector<int>S(N+1),T(M+1);
for(int i = 1; i <= N; i++) {
... | 0 | 20,892,270 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<tuple>
#include<vector>
#include<cstdlib>
#include<cstdint>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<ctime>
#include<climits>
#include<random>
#include<queue>
#include<map>
using namespace std;
templa... | #include <bits/stdc++.h>
using namespace std;
long f(long x,long y){
long a = x,b = y;
while(y != 0){
long c = y;
y = x%y;
x = c;
}
return a*b/x;
}
int main(){
long a,b,x,y;
cin>>a>>b>>x>>y;
long X = b/x - a/x;
if(a%x == 0)X++;
long Y = b/y - a/y;
if(a%y =... | 0 | 55,935,149 |
#include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? ... | #include <bits/stdc++.h>
using namespace std;
#define N 1050
typedef long long ll;
int ir,ic,grid[N][N];
ll memo[N][N];
const ll m = (ll)1e9 + 7;
bool inside(int r , int c) {
return r >= 1 && r <= ir && c >= 1 && c <= ic;
}
ll add(ll a , ll b) {
return ((a % m) + (b % m)) % m;
}
ll dp(int r , int c) {
if (r... | 0 | 19,359,711 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 0 | 32,520,419 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#defin... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 0 | 97,853,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
int N,M;
cin >> N >> M;
int G[N][N] = {};
vector<vector<int>> E;
rep(i,N){
rep(j,N){
if(i==j) G[i][j] = 0;
else G[i][j] = 10000000;
}
}
rep(i,M){
... | 0 | 11,466,316 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
char a = 'a', e = 'e', i = 'i', o = 'o', u = 'u';
if (c == a || c == e || c == i || c == o || c == u) {
cout << "vowel" << endl;
}
else { cout << "consonant" << endl;}
} | #include <bits/stdc++.h>
using namespace std;
#define ll int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define mp make_pair
#define bp __builtin_popcountll
#define MOD 998244353
const int N = 200005;
#define FAST ios_base::sy... | 0 | 3,191,640 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int m;
cin >> m;
vector<ll> d(m);
vector<ll> c(m);
ll ans = 0;
ll sum = 0;
for(int i = 0; i < m; i++)
{
cin >> d[i] >> c[i];
ans += c[i];
sum += d[i] * c[i];
}
cout << ans - 1... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,add=1,ans=0,now=0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if(S[0]=='0'){
zero = true;
}else{
zero = false;
}
for(int i=1;i<N;i++){
if(zero){
if(S[i]=='0')... | 0 | 99,133,385 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <queue>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#inc... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <utility>
#include <stack>
#include <queue>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
int main(){
ll i,j,k,n,m;
cin >> n >> m;
ll s[n+1];
ll t[m+1];
for(i=1;i<=n;i++)cin >> s[i];
for(i=1;i<=... | 0 | 65,381,717 |
#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... | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
template<typename T> inline void read(T &x) {
register char c = getchar();
register bool flag = 0;
while (!isdigit(c)) {
flag |= c == '-';
c = getchar();
}
x = c - '0';
c = getchar();
while (isdigit(c)) {
x = x * 10 + c - '0';
c... | 0 | 132,224 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,cnt;
int main()
{
scanf("%d",&n);long long ans=0;
for(int i=1,w;i<=n;i++)
{
scanf("%d",&w),ans+=w>>1;
if(!w)ans+=cnt>>1,cnt=0;
else cnt+=w&1;
}
ans+=cnt>>1;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 44,676,091 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 998244353
const ll INF=1... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ull = unsigned long long;
ull C(int size, int count) {
ull x = 1;
ull y = 1;
for(int i = 0; i < count; ++i) {
x *= (size - i);
y *= (i + 1);
if(x % y == 0) {
x /= y;
y = 1;
... | 0 | 55,498,269 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include<iostream>
using namespace std;
int main() {
int n, Y, x = 0, y, z;
cin >> n >> Y;
bool can = false;
int t = Y / 1000 - n;
while (t >= 0) {
y = t / 4;
z = n - x - y;
if (t % 4 == 0 && z >= 0) {
can = true;
break;
}
t -= 9;
... | 0 | 69,615,448 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main() {
string o, e;
cin >> o >> e;
int os = o.size();
int es = e.size();
if(os == es){
for(int i = 0; i < es; i++){
cout << o[i] << e[i];
}
cout << endl;
return 0;
}
else if(os = es + 1... | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
int n, t[100], s = 0;
double v[100], w[50000], ans = 0;
cin >> n;
for(int i=0;i<n;i++){
cin >> t[i];
}
for(int i=0;i<n;i++){
cin >> v[i];
}
w[0] = 0;
for(int i=0;i<n;i++){
w[s] = min(w[s]... | 0 | 37,034,100 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#define INF 10**9+7
using namespace std;
using Graph = vector<vector<int> >;
bool check(long long a,long long b,long long c){
return true;
}
int main(){
string S;
cin >> S;
if(S.at(0)=='a' || ... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m,a[200005],b[200005],c[200005]={};
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a[i]>>b[i];
if(b[i]==n){
c[a[i]]=1;
}
}
for(int i=0;i<m;i++){
if(a[i]==1){
if(c[b[i]]==1){
cout<<"P... | 0 | 94,849,941 |
#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 <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 8;
const ll MOD = 1e9 + 7;
const ll LLINF = 1e... | 0 | 40,908,021 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
void b_k_th_common_divisor(void) {
int a, b, k;
cin >> a >> b >> k;
int ptr = 0;
int* div;
div = (int*)calloc(100, sizeof(int));
for (int i = 1; i <= 100; i++) {
if (i > a && i > b)break;
if ((a % i == 0) && (b %... | #include<iostream>
#include<cctype>
using namespace std;
int main() {
char c;
while (true) {
scanf("%c", &c);
if (c == '\n') {
cout << endl;
break;
}
if (!isalpha(c)) {
cout << c;
} else if (islower(c)) {
cout << (char) toup... | 0 | 495,631 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(x-a<0)
cout<<"NO"<<endl;
else if(a+b<x)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long pow_kai(long long a, long long n){
long long x = 1;
while(n > 0){
if(n&1){
x = x*a;
x %= mod;
}
a = a*a;
a %= mod;
n >>= 1;
}
return x;
}
int main() {
long long N,K;
cin >> N >> K;
long long... | 0 | 100,547,834 |
#include<bits/stdc++.h>
using namespace std;
string s;
int main()
{
getline(cin,s);
int len=s.size();
for(int i=0;i<len;i++)
{
cout<<s[i];
if(i==3) cout<<" ";
}
cout<<"\n";
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<int, int, int>> point(2 * N);
rep(i, N) {
... | 0 | 73,586,636 |
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
typedef long long ll ;
typedef unsigned long long ... | #include <iostream>
#include <cstdio>
constexpr int MAXN = 2000000;
int Heap[MAXN + 1];
int parent(int i) {return i / 2;}
int left(int i) {return i * 2;}
int right(int i) {return i * 2 + 1;}
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
int n;
int heapsize;
void ShowHeap(int* Heap) {
FOR(i, 1, heapsize + 1) {
... | 0 | 50,623,345 |
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9+7;
int main(){
long double ans=0;
long double n,k;
cin>>n>>k;
if(n>k){
ans = (n-k+1)/n;
for(int i=1;i<k;i++){
int p2 = ceil(log2(k/i));
ans += (1.0/n)*(long double)pow(0.5,p2);
... | #include <iostream>
using namespace std;
int main(){
int n;
float x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
for(int i = 0; i < n; i++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
float s1 = (y2 - y1) / (x2 - x1);
float s2 = (y4 - y3) / (x4 - x3);
if(s1 == s2){
cout << "YES" << endl;
}
else{... | 0 | 49,977,797 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,n,s) for(int i = s; i < (n); ++i)
#define rsrep(i,n,s) for(int i = (n)... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 0 | 76,097,504 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int UB = (N-1)*(N-2)/2;
if (K > UB){
cout << -1 << endl;
return 0;
}
int M = N - 1;
vector<vector<int>> graph(N, vector <int> ());
for (int ii = 0; ii < N - 1; ++ii){
gra... | #include<bits/stdc++.h>
using namespace std;
int main() {
string S;
int cnt=0;
bool sum=true;
cin >> S;
string pre[4]={"dream", "dreamer", "erase", "eraser" };
int num=S.size();
reverse( S.begin(), S.end() );
for(int i=0;i<4;i++){
reverse( pre[i].begin(), pre[i].end() );
}
fo... | 0 | 73,608,752 |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#pragma warning(disable:4996)
int main()
{
int u, k, n, v;
int i, j;
int matrix[102][102] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &u);
scanf("%d", &k);
for (j = 0; j < k; j++)
{
scanf("%d", &v);
matrix[u][... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int DP[1010][1010];
int main() {
string A, B;
cin >> A >> B;
int LA = (int) A.size();
int LB = (int) B.size();
fill(&DP[0][0], &DP[0][0]+1010*1010, 0);
for (auto i=-1; i<LA; i++) {
for (auto j=-1; j<LB; j++) {
if (i ==... | 0 | 71,451,568 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
using LL = long long;
const LL INF = 1e18;
class SegmentTree {
private:
int st_siz;
vector<LL> ST_min, ST_max;
public:
SegmentTree(int siz) {
st_siz = 1;
while(st_siz < siz) st_siz *= 2;
ST_m... | #include <iostream>
#include <vector>
using namespace std;
static const int N = 100;
static const int no = -1;
int graph[N][N] = {{}};
int d[N] = {};
int n;
void bfs(int v){
vector<int> V;
V.push_back(v);
int u;
for(int i = 1;i <= n; i++){
d[i] = no;
}
d[v] = 0;
while(!V.empty()){
u = V.fron... | 0 | 100,249,850 |
#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... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 79,046,641 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string N,m;
cin >> N;
int x,y = 0;
for(int i = 0; i < int(N.size()); i++){
istringstream n;
m = N[i];
n = istringstream(m);
n >> x;
y += x;
}
if (stoi(N) % y == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
char s[h+5][w+5];
for(int i=1;i<=h;i++){
s[i][0]='.';
s[i][w+1]='.';
}
for(int j=1;j<=w;j++){
s[0][j]='.';
s[h+1][j]='.';
}
for(int i=1;i<=h;i++)for(int j=1;j<=w;j++)cin >>... | 0 | 22,378,086 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.