code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#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;
string s;
cin >> s;
int counts = 0;
rep(i,n){
if(s[i] == s[i+1]) continue;
counts++;
}
cout << counts << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
string s ;
cin>>s ;
stack<char> st ;
for(int i=0;i<n;i++){
if(st.empty())
st.push(s[i]) ;
else{
char temp=st.top() ;
if(s[i]==... | 1 | 26,412,352 |
#include<iostream>
#include<vector>
#include<string>
#include<bitset>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
#include<set>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
int h, w,m;
cin >> h >> w >> m;
vector<int> H(h),W(w);
set<pair<int, int>> data;
int temp0, t... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w, m;
cin>>h>>w>>m;
vector<int> col(w + 1, 0);
vector<int> row(h + 1, 0);
int A[m];
int B[m];
map<pair<int,int>, int> store_AB;
for (int i=0; i<m; i++){
cin>>A[i]>>B[i];
store_AB[ pair<int,int>(A[i], B[i])] ++;
row[A[i]]++;
col[B[i]]++;
}... | 1 | 80,843,989 |
#include<iostream>
using namespace std;
int main(){
char a[1001],b[1001];
long least,var,lena=0,lenb=0,l=1;
cin>>a>>b;
for(;b[lenb];lenb++);
for(;a[lena];lena++);
for(int i=0;i<=lena-lenb;i++){
var=0;
for(int j=0;j<lenb;j++){
if(a[i+... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(long long i = a; i < b; i++)
#define dump(a) for(auto x : a) cout << x << " "; cout << "\n"
#define print(a) cout << a << "\n"
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr << #x << ": " << x << ", " << #y << ": " << y <<... | 1 | 31,532,094 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin>>s;
int n = (int)s.size();
int a[26]={0};
for(int i =0;i<n;i++)
{
a[s[i]-'a']++;
}
if(a[0] && a[1] && a[2]) cout<<"Yes\n";
else cout<<"No\n";
return 0;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <utility>
#include <vector>
#include <cstdio>
#include <iomanip>
#include <cmath>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i <= n; i++)
int main() {
string str;
cin ... | 1 | 32,218,927 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dbl;
#define sqr(int) (int * int)
#define sqr3(int) (int * int * int)
#define pi M_PI
#define nl "\n"
int main(){
ios::sync_with_stdio(true);
cin.tie(0);
int a;
cin >> a;
if(a >= 1200){
cout << "ARC";
}
else{
cout << "ABC";
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 72,734,667 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<int,... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first... | 1 | 2,926,494 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int n;
setprecision(5);
long double x[4], y[4],d1,d2,d3,d4;
int ans[100];
cin >> n;
for (int a = 0; a < n; a++) {
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
if (x[0] > x[1]) {
d1 = x[0] - x[1];
d3 = y[0] -... | #include<bits/stdc++.h>
using namespace std;
const double EPS=1e-10;
double x[4],y[4];
int main(){
int n;
cin>>n;
while(n--){
for(int i=0;i<4;i++)cin>>x[i]>>y[i];
for(int i=0;i<4;i+=2){
x[i]-=x[i+1];y[i]-=y[i+1];
}
if(fabs(x[0]*y[2]-x[2]*y[0])<EPS)cout<<"YES"<<end... | 1 | 76,518,755 |
#include <bits/stdc++.h>
using namespace std;
#define max(a,b) (((a) < (b)) ? (b) : (a))
int main(void) {
int64_t A,B,C;
cin >> A >> B >>C;
cout << max(0,C-(A-B)) << endl;
return 0;
} | #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++)
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<clas... | 1 | 100,482,446 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a <... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin>>k>>s;
if(s.length()<=k) cout<<s<<endl;
else{
for(int i=0;i<k;i++) cout<<s[i];
cout<<"."<<"."<<"."<<endl;
}
} | 1 | 10,454,499 |
#include <iostream>
#include<vector>
#include <cstdlib>
#include<cmath>
#include<string>
#include <iomanip>
#include <sstream>
using namespace std;
int main (){
int n,i,j=0;
string a[2];
for(i=0;i<2;i++){
cin>>a[i];
}
n=a[0].size();
for(i=0;i<n;i++){
if(a[0][i] != a[1][i]){
j++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define sz(x) (int)x.size()
const int MOD = 1e9+7;
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int xd[4] = {0,1,0,-1}, yd[4]... | 1 | 26,150,185 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+1];
for(int i=0;i<=n;i++)cin>>a[i];
long long b[n+1],wa[n+1];
b[0]=1-a[0];
if(b[0]<0){
cout<<"-1"<<endl;
return 0;
}
wa[0]=a[0];
for(int i=1;i<=n;i++)wa[i]=wa[i-1]+a[i];
for(int i=... | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c);... | 1 | 83,058,019 |
#include <iostream>
using namespace std;
int main(){
int c,n,m,p,s,sum;
while(true){
cin >> n >> m >> p;
if (n==0)
break;
sum = 0;
for (int i=0;i<n;i++){
cin >>s;
sum += s;
if (i == m-1)
c = s;
}
if (c)
cout << sum*(100-p)/c << endl;
else
cout << 0 <<... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(true){
int n,m,p;
scanf("%d%d%d",&n,&m,&p);
if(n+m+p==0)return 0;
int sum = 0;
int win = 0;
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
sum += x;
if(i==m-1)win = x;
}
sum *= 100;
p = 100 - p;
... | 1 | 54,502,993 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int h, w; cin >> h >> w;
V<string> s(h);
for(int i = 0; i < h; i++) cin >... | #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 | 22,774,573 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
cin >> N >> A;
if ( N%500 == 0 || N%500 < A ){
cout << "Yes" << endl;
}
if ( N%500 != 0 && N%500 > A ){
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> B >> A;
if (B%500 <= A)
{
cout << "Yes" << endl;
}else
{
cout << "No" << endl;
}
} | 1 | 38,423,730 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rep... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (int 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... | 1 | 16,495,662 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int i, Size, cnt = 0;
string S, T;
cin >> S;
cin >> T;
Size = T.size();
for (i = 0; i < Size; i++){
if (S.at(i) == T.at(i)) cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t INF=9999999999999999;
int main() {
string S,T;
cin>>S>>T;
int count=0;
for(int i=0;i<3;i++){
if(S[i]==T[i]){count++;}
}
cout<<count<<endl;
return 0;} | 1 | 25,708,619 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include <bits/stdc++.h>
using namespace std;
int main()
{char a, b; cin >> a >> b;
cout << min(string(b - '0', a), string(a - '0', b)) << endl;} | 1 | 77,010,026 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
ll s;
cin >> s;
ll x1, y1, x2, y2;
x1 =... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 1 | 36,988,154 |
#include <string>
#include <iostream>
int main(){
std::string s;
std::cin >> s;
int n = s.size();
for(int i = 0; i < n; ++i){
if(i == 5 || i == 13) std::cout << ' ';
else std::cout << s[i];
}
std::cout << std::endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | 1 | 66,609,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> ;
const int INF = 1e9;
const int MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i,n) cin >> s[i];
int A = 0,B = 0;
int AB = 0;
bool ok ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,c = 0,a = 0,b = 0,ba = 0,i;string s;cin >> n;
while(cin >> s){
for(i=0;i<s.size()-1;i++){
if(s.substr(i,2) == "AB") c++;
}
if(s[0]=='B' && s[s.size()-1]=='A') ba++;
else if(s[s.size()-1]=='A') a++;
else if(s[0]=='B') b++;
}
... | 1 | 65,742,285 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | 1 | 46,984,143 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
lint n;
cin >> ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
vector<long long> divisors(long long a){
vector<long long> res;
for(long long i=1;i*i<=a;i++) if(a%i==0) {
res.emplace_back(i);
if(i*i<a) res.emplace_back(a/i);
}
sort(res.begin(),res.end());
return res;... | 1 | 21,256,497 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int i,j,n;
long long int sum;
scanf("%d",&n);
sum=1;
for(i=2;i<=n;i++) sum=sum*i;
printf("%lld\n",sum);
return 0;
} | #include <iostream>
using namespace std;
long long fact(int n)
{
if(n == 1) return 1;
else return (n * fact(n - 1));
}
int main(void)
{
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
} | 1 | 86,411,558 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >>A>>B>>K;
int c=min(A,B);
int cnt =0;
for (int i = c; i >=1 ; i--)
{
if(A%i==0 && B%i==0) cnt++;
if(cnt==K)
{
cout << i <<endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_boun... | 1 | 41,533,633 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef ve... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N, A, B;
bool flag;
cin >> N >> A >> B;
if(B-A == 1){
cout << "Borys" << endl;
return 0;
}else{
while(1){
A++;
if(B-A == 1){
flag = true;
... | 1 | 95,286,668 |
#include<bits/stdc++.h>
#define ll long long
const int N=100005;
using namespace std;
string s,t;
int main(){
cin>>s>>t;
if(s[0]<t[0]) cout<<"<";
else if(s[0]==t[0]) cout<<"=";
else cout<<">";
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_b... | 1 | 60,516,939 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | #include <stdio.h>
#include <string.h>
int main (){
char str1[100], str2[100], str3[100];
scanf("%s %s %s", str1,str2, str3);
int length1 = strlen (str1);
int length2 = strlen (str2);
for(int i = 0; i < 10; i++){
if(str1[length1 - 1] == str2[0] && str2[length2 - 1]== str3[0]){
pr... | 1 | 32,009,728 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int i;
for(i=0; i<h; i++){
string s;
cin >> s;
cout << s << endl;
cout << s << endl;
}
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define Fast_D cout<<fixed<<setprecision(13);
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define nl "\n"
#define int long long
#define double long... | 1 | 33,369,035 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
vector<int> d(5),r(5);
rep(i,5){
cin>>d[i];
r[i]=d[i]%10;
}
int ld=0,r_min=10;
rep(i,5){
if(r[i]==0){
continue;
}
if(r[i]<r_min){
ld=i;
r_... | #include <iostream>
#include <vector>
int main()
{
constexpr int N = 5;
std::vector<int> times(N);
int to_be_last = -1;
int rest = 10;
for(int i=0; i<N; i++) {
int t;
std::cin >> t;
if(t%10 != 0 && t%10 < rest) {
to_be_last = i;
rest = t % 10;
}
times[i] = t;
}
int m = 0;
... | 1 | 18,707,686 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
string s;
lli a,b,c,t,temp1,temp2,x,y,temp,q,d,k,mod=1e9+7;
bool is(int i,int j)
{
string one="",two="";
for(int a=i;a<=j;a++)
{
one+=s[a];
two+=s[a];
}
reverse(two.begin(),two.end());
if(one==two)return true;
return false;
}
int main()... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
vector<char>a(n);
vector<char>b(n);
for(int i=0; i<n; i++){
if(s[i] != s[n-1-i]){
cout << "No" << endl;
return 0;
}
}
... | 1 | 13,848,264 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin>>S;
int w;
cin>>w;
string ans="";
for(int i=0;i<S.size();i+=w){
ans+=S[i];
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
string s;
int n;
cin>>s>>n;
for(int i=0;i<s.size();i+=n)cout<<s[i];
} | 1 | 73,694,269 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
Int n,m;
cin>>n>>m;
vector<vector<Int> > G(n);
for(Int i=0;i<m;i++){
Int u,v;
cin>>u>>v;
u--;v--;
G[u].emplace_back(v);
G[v].emplace_back(u);
}
vector<Int> used(n,-1);
Int cnt=0,flg=0;
function<void(In... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 1 | 79,980,639 |
#include<bits/stdc++.h>
using namespace std;
#define N 100010
#define ll long long
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans = max(max(max(a*c,a*d),b*c),b*d);
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
#include<vector>
#include<cmath>
using namespace std;
#include<set>
int main()
{
long long int arr[4];
for(int i=0;i<4;i++)
{
cin>>arr[i];
}
long long int a=arr[0]*arr[2];
long long int b=arr[0]*arr[3];
long long int c=arr[1]*a... | 1 | 59,799,002 |
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
ll dig(ll N) {
ll dig = 0;
while (N) {
dig++;
N /= 10;
}
return dig;
}
ll gcd(ll x, ll y) {
ll r;
while (x%y) {
r = x % y;
x = y;
y = r;
}
return y;
}
... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 1 | 13,747,576 |
#include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) for(int i=a;i>=(n);--i)
#define pb(a) push_back(a)
#define eb... | #include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int... | 1 | 5,340,050 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
ll cnt = 0;
rep(i,n) cin >> a[i] >> b[i];
for(int i = n-1; i >= 0; --i){
... | 1 | 20,002,589 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n+1;i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
typedef long long ll;
typedef pair<int,int> P;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a+b >= c) ... | #include<bits/stdc++.h>
using namespace std;
int a,b,c;
int main()
{
scanf("%d%d%d",&a,&b,&c);
if(a+b>=c)
{
printf("Yes\n");
return 0;
}
printf("No\n");
return 0;
} | 1 | 33,926,005 |
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<functional>
#include<string.h>
#include<set>
const int MAXN = 1e4;
int degree[MAXN];
int V, E;
std::vector<int> digrath[MAXN];
void init() {
memset(degree, 0, sizeof(int) * V);
}
void input... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
#include <tuple>
constexpr long long... | 1 | 10,948,873 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W; cin >> H >> W;
string S;
for (int i = 1; i <= H; i++) for (int j = 0; j < W; j++) {
cin >> S;
if (S == "snuke") {
cout << (char)('A' + j) << i << endl;
}
}
} | 1 | 24,699,816 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define all(x) (x).begin(),(x).end()
const int mod = 1e9 + 7;
#define pow abcdef... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using vc=vector<char>;
using vvc=vector<vc>;
using pii = pair<int,int>;
using pil = pair<int,ll>;
using pli = pair<ll,in... | 1 | 60,458,407 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N, P;
cin >> N >> P;
int64_t odd=0;
int64_t A;
for(int64_t i=0LL; i<N; i++){
cin >> A;
odd+=A%2;
}
if(odd==0 && P==1){
cout << 0 << endl;
}
else if(odd==0 && P==0){
cout << (int64_t)pow(2, N) << endl;
}
else{
cout... | #include<bits/stdc++.h>
#include<cmath>
using namespace std;
int main(){
int N,P;
cin >> N >> P;
vector<int> a(N);
for(int i = 0; i< N; i++){
cin >> a.at(i);
}
bool b = true;
for(int i = 0; i<N; i++){
if(a.at(i) %2 != 0){
b = false;
}
}
long long ans;
if(b){
if(P == 0){
a... | 1 | 29,568,330 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool query(ll x){cout<<"? "<<x<<endl;string s;cin>>s;return s[0]=='Y';}
void output(int x){cout<<"! "<<x<<endl;exit(0);}
int f[100];
int main(){
f[0]=1;
for(int i=1,j=10;i<=9;++i,j*=10)f[i]=query(j);
if(!f[9]){
for(int i=1,j=10;i<=9;++i,j*=10)
i... | 1 | 65,348,385 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= m; ++j) {
int t = j * (n - i) + i * (m - j);
if (t == k) {
puts("Yes");
return 0;
}
}
}
puts("No");
return 0;
} | #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... | 1 | 94,115,199 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
int n; cin>>n;
vector<vector<int>> info(n-1,vector<int>(3,0));
rep(... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 1 | 229,449 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+10;
const double PI=acos(-1);
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
... | #include<iostream>
#include<cstdio>
using namespace std;
const int N=2002020;
int read(){
int x=0,f=1; char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int main()
{
int n=read(),L=read();
int ps=-1,lst=0;
for(int i=1;i<... | 1 | 1,784,684 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
int min = *min_element(arr,arr+n);
int max = *max_element(arr,arr+n);
int min_cost= INT_MAX;
int temp = 0;
for(int i=min;i<=max;i++){
temp =0;
for(int j=0;j<n;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
int n;
int ave1,ave2;
int sum = 0;
int a[105];
int i;
scanf("%d", &n);
for(i = 0;i < n;i++){
scanf("%d", &a[i]);
sum += a[i];
}
ave1 = sum/n;
... | 1 | 19,903,869 |
#include <stdio.h>
#include <string.h>
int main(){
char words[105];
int k;
int word;
scanf("%d" ,&k);
scanf("%s" ,words);
word = strlen(words);
if (word <= k){
printf("%s" ,words);
}
else if(word > k){
words[k] = '\0';
printf("%s..." ,words);
}
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
int n;
char str[255];
scanf("%d", &n); getchar();
scanf("%s", str);
int len = strlen(str);
if(len > n) {
for(int i = 0; i < n; i++) {
printf("%c", str[i]);
}
puts("...");
} else {
printf("%s\n", str);
}
} | 1 | 78,725,844 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
string s;
cin >> s;
string ans = "Yes";
for(int i = 0; i < a; i++){
if(!(s[i] >= '0' && s[i] <= '9')) ans = "No";
}
if(s[a] != '-') ans = "No";
for(int i = a+1; i < a+b+1; i++){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 29;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
bool ok = true;
if (s[a] != '-') ok = false;
rep(i, a+b+1) {
if (i == a) continue;
if (!is... | 1 | 75,588,150 |
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef pair<int,int> P;
const int INF=1000000;
int H,W,N,d[1000][1000],ans=0;
int dx[]={-1,0,0,1};
int dy[]={0,-1,1,0};
char m[1000][1000];
pair<int,int> f[11];
int bfs(int sx,int sy,int gx,int gy){
for(int i=0;i<H;i++)
for(int j=0;j<W;j++)d[j... | #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int,int> P;
int main(){
int w,h,n,solve=0;
P cheese[9];
int dx[] = {0,1,-1,0},dy[]={1,0,0,-1};
queue<P> que;
cin >> h>> w>> n;
char d[1005][1005];
int dis[1005][1005];
for(int i=0;... | 1 | 77,300,430 |
#include<iostream>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
for(int i=1;i<10;i++)
for(int j=1;j<10;j++)
cout << i << "x" << j << "=" << i*j << "\n";
} | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,1,a)
using namespace std;
int main(){
rep(i,10)
rep(j,10)
cout<<i<<"x"<<j<<"="<<i*j<<endl;
} | 1 | 24,205,011 |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | #include <iostream>
#include <vector>
using namespace std;
long long mod = 1e9+7;
long long f(int n, vector<int> x){
long long res = 0;
for(int i=0;i<n;i++){
res += (mod + i*2-n+1) % mod * (mod + x[i]) % mod;
res %= mod;
}
return res;
}
int main(void){
int n, m;
cin >> n >> m;
... | 1 | 72,052,499 |
#include <iostream>
#include <cstring>
using namespace std;
int adja[101][101], dist[101];
void bfs() {
int que[100], l = 0, d = 1;
que[0] = 1;l++;
while (l > 0) {
int temp[100], m = 0;
for (int i = 0; i < l; ++i) {
int u = que[i];
if (0 < dist[u] && dist[u] <= d)
... | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
using ll = long long int;
#define rep(i,n) for(i... | 1 | 72,451,083 |
#include<cstdio>
#define ri register int
#define rc register char
#define ll long long int
#define rl register long long int
#define in inline
#define gc getchar
in int read()
{
ri x=0,p=1;
rc ch=gc();
while(ch<'0' || ch>'9')
{
if(ch=='-')
{
p=-1;
}
ch=gc();
}
while(ch>='0' && ch<='9')
{
x=x*10+ch-'... | #include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
int inputs[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k... | 1 | 49,643,786 |
#include <bits/stdc++.h>
using namespace std;
vector<int> edges[100000];
int dfs(int i, int par){
int num = 0;
for(int j : edges[i]){
if(j != par) num += dfs(j, i);
}
if(num >= 2){
cout << "First" << endl;
exit(0);
}else{
return 1-num;
}
}
int main(){
int N;
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll maxn=1e5+10, ma... | 1 | 100,422,504 |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
char b;
cin>>b;
switch (b)
{
case 'A':
cout<<'T'<<endl;
break;
case 'T':
cout<<'A'<<endl;
break;
case 'G':
cout<<'C'<<endl;
break;
case 'C':
cout<<'G'<<endl;
break;
default:
break;
}
} | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | 1 | 90,388,448 |
#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vect... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 1 | 50,867,630 |
#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;
if(n%2){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
main() {
int n;
cin >> n;
if(n%2==0){
cout << n/2-1<<endl;
}
else{
cout << n/2<<endl;
}
} | 1 | 48,690,232 |
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define N 1000005
using namespace std;
typedef long long ll;
ll a, b;
int main() {
scanf("%lld %lld",&a ,&b);
if(abs(a - b) <= 1)
printf("Brown\n");
else
printf("Alice\n");
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | 1 | 12,388,024 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
bool is_valid(vector<pair<long long, int>> &D, vector<pair<int, int>> &edges){
int N = D.size();
vector<vector<int>> G(N);
for(auto x : edges){
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair < int , int > pp;
const int N = 1e5 + 5;
map < int , int > H;
vector < int > V[N];
pp A[N];
int sz[N];
int f(int x, int d){
int t = d;
for(int i=0; i<V[x].... | 1 | 38,229,517 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include<bits/stdc++.h>
#define rep(i,n) for(i=0; i<n; ++i)
#define lim 100000
typedef long long ll;
using namespace std;
int main(void){
int i,x,y,a,b,c; cin>>x>>y>>a>>b>>c;
vector<ll> p(lim,0),q(lim,0),r(lim,0);
rep(i,a) cin>>p[i]; sort(p.rbegin(),p.rend()); p[x]=0;
rep(i,b) cin>>q[i]; sort(q.rbegin(),q.rend(... | 1 | 54,271,667 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
vector<int> c(n - 1), s(n - 1), f(n - 1);
rep(i, n - 1)
{
cin >> c[i] >> s[i] >> f[i];
}
rep(i, n - 1)
{
int t = 0;
... | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
vector<int> c;
vector<int> s;
vector<int> f;
long long int n;
void saiki(int now,int t){
if(now==... | 1 | 56,588,518 |
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (A == 0) {
cout << 0 << endl;
return 0;
}
long long last = N % (A + B);
long long ans = (N / (A + B)) * ... | 1 | 49,034,466 |
#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define NUM 100
int main()
{
static long i,j,k,l;
int mid;
int end;
int re;
char grade[NUM];
for(i=0;;i++) {
cin >> mid >> end >> re;
if(mid == -1 && end == -1 && re == -1)... | #include<iostream>
using namespace std;
int main() {
int m[1000], f[1000], r[1000], s[1000], i, j;
for(i = 0; i < 1000; i++) {
cin >> m[i] >> f[i] >> r[i];
if (m[i] == -1 && f[i] == -1 && r[i] == -1) break;
}
for(j = 0; j < i; j++) {
s[j] =... | 1 | 16,641,610 |
#include <bits/stdc++.h>
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++)
const ll MOD = 1000000007;
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;... | #include <iostream>
#include <iomanip>
#include <string>
using namespace std;
void Main() {
int N;
string S;
cin >> N;
cin >> S;
u_int64_t r = 0;
u_int64_t g = 0;
u_int64_t b = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
r++;
} else if (S[i] == 'G') {
... | 1 | 3,751,091 |
#include<iostream>
#include<math.h>
using namespace std;
#define ll long long
int main(){
string s;
cin>>s;
int start=-1, end=-1;
bool flag=false;
for(int i=1;i<s.length();i++){
if(flag)
break;
if(s[i-1]==s[i]){
start=i-1+1;
end=i+1;
flag=true;
}
if(i-2 >=0 && s[i-2]==s[i]){
... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
string ss; cin>>ss; int len = ss.size();
int s[len]; for(int i = 0; i < len; i++) s[i] = (int)ss[i];
if(s[0] == s[1]){
cout<<"1 2"<<endl;
return 0;
}
for(int i = 0; i < len-2; i++){
if(s[i] == s[i+1]){
cout<<i+1<<" "<<i+2<<endl;
return 0;
... | 1 | 51,744,640 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<deque>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... | 1 | 71,427,164 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
const int INF = 1LL<<30;
char fi[1010][1010];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int dist[1010][1010];
int main() {
int h,w;
cin>>h>>w;
rep(i,h) rep(j,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; ++i) {
cin >> a[i... | 1 | 75,693,763 |
#include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> et[100000];
int grundy(int v, int p) {
int g = 0;
for (int i = 0; i < et[v].size(); i++) {
if (et[v][i] == p) continue;
g ^= grundy(et[v][i], v) + 1;
}
return g;
}
int main() {
int i;
cin >> n;
for (i = 0; i < n - 1; i++) {
int x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll I... | 1 | 67,267,037 |
#include <iostream>
using namespace std;
int gcd (int p, int q) {
if (q == 0) return p;
return gcd(q, p % q);
}
const int MAX_N = 1e5 + 5;
int arr [MAX_N];
int main () {
int n, k;
cin >> n >> k;
int gc = 0, mx = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
gc = gcd(gc, arr[i]);
mx = max(mx, a... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 1 | 17,952,603 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define bg begin()
#define ed end()
#define pii p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 1 | 30,799,163 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
map<int, int> m;
for (int i = 0; i < 4; ++i) {
int n;
cin >> n;
m[n]++;
}
if (m[1] == 1 && m[7] == 1 && m[9] == 1 && m[4] == 1) {
puts("YES");
} else {
puts("NO");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(4), a = {1, 4, 7, 9};
for(int i = 0; i < 4; i++)
cin >> v.at(i);
sort(v.begin(), v.end());
if(v == a)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | 1 | 18,402,632 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int main(){
int N;
cin >> N;
string s[N];
for(int i = 0; i < N; i... | 1 | 87,266,179 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
usin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
... | 1 | 90,522,130 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional>
using namespace std;
#define int lo... | #include <bits/stdc++.h>
using namespace std;
int main(){
int R,G,B,N;
cin >> R >> G >> B >> N;
int r=0,g=0;
long long int ans=0;
while(1){
while(1){
if(N-r*R-g*G<0) break;
if((N-r*R-g*G)%B==0) ans++;
g++;
}
if(g==0) break;
g=0;
... | 1 | 24,997,956 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
for (int j = 4; j > -1; j--) {
cout << a[j];
if (j != 0) {
cout << " ";
}
else {
cout << endl;
}
}
getchar();
getchar();
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5];
int b;
b=0;
while(b<5){
cin >>a[b];
b=b+1;}
sort(a,a+5);
b=0;
while(b<5){
cout <<a[4-b];
if(b==4){cout <<endl;}
else{cout <<" ";}
b=b+1;}} | 1 | 17,006,516 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return ... | #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... | 1 | 5,231,506 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = (ll)1e9 + 7;
#define rep(i, n) for(ll i=0, i##_length=(n); i< i##_length; ++i)
signed main() {
ll N;
string S;
cin>>N>>S;
if(S[0]=='W'||S[S.size()-1]=='W'){
cout<<0<<endl;
return 0;
}
vector<ll> left(2*N,0),right(2*N,0);
... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 100005
const int mod=1e9+7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
int n,m;
char s[ma... | 1 | 47,592,515 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define ldou lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,m,i,j,ans,cur;
cin >> n;
vector<long> a(n);
for(i=0; i<n; i++){
cin >> a[i];
}
vector<long> s(0);
s.push_back(0);
cur=0;
for(i=0; i<n; i++){
cur+=a[i];
s.push_back(cur);
}
sort(s.begin(), s.end());
j=0; ans=0;
for(i=1; i<=n; i++){
if... | 1 | 88,676,828 |
#include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long int;
const ll mod = 1e9 + 7;
#define r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main(){
int n;
cin >> n;
ve<int> a(n+1);
rep(i,n+1) cin >> a[i];
sort(a.begin(), a.end());
ve<int> sa(n);
rep(i,n) sa[i] = a[i+... | 1 | 14,575,668 |
#include<iostream>
#include<vector>
#include<map>
#include<cmath>
using namespace std;
int main() {
int H, W, D;
cin>>H>>W>>D;
map<int, pair<int, int> > A;
int tmp;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin>>tmp;
tmp--;
A[tmp] = make_pair(i, j);
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
#include <memory>
#include <map>
using namespace std;
#define DEB(variable) cout << #variable << '=' << variable << endl
#define FOR(LoopVariable,numberOFbegin,numberOFend... | 1 | 78,454,021 |
#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
vector<int> t(N);
for (int i = 0; i < N; i++) {
cin >> s[i] >> t[i];
}
string X;
cin >> X;
int ans = 0;
bool sleep = false;
f... | 1 | 55,267,095 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define float double
#define pb push_back
#define FF first
#define SS second
#define N 100005
#define MOD 1000000007
#define fn(i,n) for(int i=0;i<n;i++)
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define pii pair<int,int>
#define mp make_pair
#defi... | #include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#include<queue>
#define ii pair<int,int>
#include <sstream>
#def... | 1 | 53,690,557 |
#include<iostream>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout<<(int)(((a + b) / 2)+0.5)<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if((a%2==0 && b%2==0 ) ||(a%2==1 && b%2==1))cout << (a+b)/2 << endl;
else cout << 1+(a+b)/2 << endl;
} | 1 | 84,664,308 |
# include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define f first
# define s second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define rep(i,n) for(int i=0;i<n;++i)
# define forn(i,n) for(int i=1;i<=n;++i)
# define pqueue priority_queue
using nam... | #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.... | 1 | 10,480,984 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
int main(){
int n, m;
string a, b, c;
while(true){
cin>>a;
if(a=="-"){
break;
}
cin>>n;
for(int i=0; i<n; ++i){
cin>>m;
b = a.substr(0, m);
c = a.substr(m... | #include <bits/stdc++.h>
using namespace std;
void solve(string &str, int m, vector<int> h);
int main()
{
while (1)
{
string str;
cin >> str;
if (str == "-") break;
int m = 0;
cin >> m;
vector<int> h(m, 0);
for (int i = 0; i < m; i++)
{
... | 1 | 4,466,401 |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int s,w;
cin>>s>>w;
if(w>=s)
cout<<"unsafe";
else
cout<<"safe";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a<=b) printf("unsafe\n");
else printf("safe\n");
return 0;
} | 1 | 72,462,682 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <utility>
#include <algorithm>
#include <functional>
#include <deque>
#define INF 1e9
using namespace std;
typedef long long ll;
typedef pai... | #include <bits/stdc++.h>
#define fi first
#define se second
#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 each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#de... | 1 | 60,429 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
int N; cin >> N;
ll sumA = 0, sumB = 0;
ll behB = 0;
ll A[N],B[N];
ll num_op = 0;
rep(i, N) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N)... | 1 | 20,916,417 |
#include <bits/stdc++.h>
#include<vector>
#include<set>
#define ll long long
using namespace std;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll t,a,b,c,d,n,m,k,sum,i,j;
str... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int64_t gcd(int64_t a, int64_t b) {
if (!b) return a;
else return gcd(b, a % b);
}
int64_t lcm(int64_t a, int64_t b) {
int64_t g = gcd(a, b);
return a / g * b;
}
int main() {
int N;
cin >> N;
int64_... | 1 | 13,395,406 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define fore(i, a) for (auto &i:a)
#define ll long long
#define pll vector<pair<ll, ll>>
#define mod 1000000007
#define... | #include <bits/stdc++.h>
#include <set>
#include <numeric>
#define rep(i,n) for (int i=0; i < (n); ++i)
#define all(a) a.begin(), a.end()
using ll = long long;
using namespace std;
int minimam(int a,int b,int c, int d);
int main() {
int a,b,c,d; cin >> a >> b >> c >> d;
int num;
num = minimam(a,b,c,d);
cout << ... | 1 | 61,132,530 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int min(int a,int b,int c) {
int t=a<b?a:b;
return t<c?t:c;
}
int main() {
string s1,s2;
int d[1010][1010];
cin>>s1>>s2;
int n=s1.length();
int m=s2.length();
if(n==0){return n;}
if(m==0){return m;}
for(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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 (b<a) {a=b; return 1;} return 0;}
int... | 1 | 88,335,716 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll s;
cin >> s;
ll x[3];
ll y[3];
for(int i = 0; i < 3; i++){
x[i] = 0;
y[i] = 0;
}
if(s <= 1000000000){
x[1] = s;
y[1] = 0;
x[2] = 0;
y[2] = 1;
}else{
x[1] = 1000000000;
y[1] = 1;
x[2] = (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
int s; cin >> s;
int v = 1e9;
in... | 1 | 3,164,168 |
#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; }
vector<pair<int64_t,int64_t>>prime_factorize(int64_... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;... | 1 | 52,668,421 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
ll ch[100010];
for(ll i=0;i<n;i++){
cin>>ch[i];
}
ll ans=0;ll cnt=0;
ll now=ch[0];
for(ll i=1;i<n;i++){
if(ch[i]<=now){
cnt++;
now=ch[i];
}
else{
now=ch[i];
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll , null_type, less< ll >, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pob p... | 1 | 43,294,614 |
#include<bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
int main(){
ll n; cin >> n;
map<ll,ll> mp; rep(i,n){
ll tmp;
cin >> tmp;
mp[tmp]++;
}
ll m1 = 0, m2 = 0;
for(auto ... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 1 | 69,035,873 |
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
int main()
{
std::vector<int>a(3), b(3);
rep(i, 3) in >> a[i] >> b[i];
std::vector<int>cnt(5);
rep(i, 3)
{
++cnt[a[i]];
++cnt[b[i]];
}
out << ((cnt[1] > 2 || cnt[2] > 2 || cnt[3] ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 1; i <= (n); i++)
signed main(void)
{
int v[5];
rep(i, 4) v[i] = 0;
rep(i, 3)
{
int a, b;
cin >> a >> b;
v[a]++;
v[b]++;
}
if (v[1] <= 2 && v[2] <= 2 && v[3] <= 2 && v[4] <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl... | 1 | 91,786,075 |
#include<iostream>
using namespace std;
bool alice[105],bob[105];
int main() {
int a, b, c, d; cin >> a >> b >> c >> d;
for (int i = a; i <= b; i++) {
alice[i] = true;
}
for (int i = c; i <= d; i++) {
bob[i] = true;
}
int ans = 0;
for (int i = 0; i <= 100; i++) {
if (alice[i] && bob[i])ans++;
}
cout <<... | #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 | 58,960,929 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #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() {
ll n;
cin >> n;
vector<ll> a(n), b(n), ab;
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0, s = 0;
rep(i, n) {
if (a[i] < b[i]) {
ans+... | 1 | 16,901,519 |
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 1 | 75,812,339 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<ll> a(n);
for(int i=0;i<n;i++) cin >> a[i];
ll money=1000;
ll kabu=0;
ll ans=0;
for(int i=0;i<n;i++){
money=money+kabu*a[i];
kabu=0;
if(a[i]<a[i+1] && i!=n-1){
kabu=money/a[i];
money=money-kabu*a[i... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 1 | 1,124,688 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.