code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include<vector>
using namespace std;
const int MAX = 2000001;
const int VMAX = 10001;
int main(){
int N;
cin >> N;
vector <int> A(N + 1), B(N + 1), C(VMAX + 1, 0);
for(int i = 1; i <= N; i++) {
cin >> A[i];
}
for(int j = 1; j <= N ; j++){
C[A[j]] = C[A[j]] + 1;
}
for(int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3][3],n;
for ( int i=0; i<3 ; i++){
for (int j=0 ; j<3 ; j++){
cin >> a[i][j];
}
}
cin >> n;
int b[n] ;
for ( int i= 0 ; i<n ; i++) {
cin >> b[i] ;
}
bool c[3][3];
for ( int i=0; i<3 ; i++){
for (int j=0 ; j<3 ; j+... | 0 | 15,592,844 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
d... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 1,787,688 |
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<ll>
#define vp vector<pii>
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 20,883,626 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int num , k , a[100005];
int dp[100005];
const int oo=1e9+7;
int Min(int a , int b)
{
if(a>b)return b;
else return a;
}
main()
{
cin >> num >> k;
for( int i=1 ; i <= num ; ++i )
{
cin >> a[i];
dp[i]=oo;
}
dp[1]=a[1];
dp[2]=abs(a[1]-a[2]);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll a[n + 1], max[n + 1], min[n + 1];
rep(i, n + 1) cin >> a[i];
max[n] = min[n] = a[n];
for (int i = n - 1; i >= 0; i--) {
max[i] = max[i + 1] +... | 0 | 44,610,875 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
string s;
int n;
int main() {
cin >> n;
cin >> s;
int cnt = 0;
long long ans = 1;
for (int i = 1; i <= n; i++) {
ans = ans * i % mod;
}
for (int i = 0; i < n * 2; i++) {
if (i % 2 == 0) {
if (s[i] == 'W') {
s[i] = 'B';
} else {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<long long,int> P;
int main(){
ll a, b, k;
cin >> a >> b >> k;
rep(i, k){
if (i % 2 == ... | 0 | 11,759,603 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
template<typename T1, typename T2> inline v... | 0 | 24,904,292 |
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | #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 rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 0 | 43,826,757 |
#include<iostream>
using namespace std;
int main(void){
double xa,ya,xb,yb,xc,yc,xd,yd;
int n;
cin >> n;
while( --n >=0){
cin >> xa >> ya >> xb >> yb >> xc >> yc >> xd >> yd;
if( (yb - ya)/(xb - xa) == (yd - yc)/(xd - xc))
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;... | #include<bits/stdc++.h>
using namespace std;
int table[1010][1010];
int table2[1010][1010];
typedef long long LL;
int main() {
int N = 1010;
int H,W,D;
cin >> H >> W >> D;
char c[4] = {'R', 'G', 'B', 'Y'};
if(D%2 == 1) {
for(int i=0 ;i<H; i++, cout << endl)
for(int j=0; j<W; j++)
cout << c[(i+j)%2];
}
... | 0 | 64,806,241 |
#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;... | #ifndef _WIN32
#include<iostream>
#endif
#include<string>
#include<iomanip>
#include<vector>
#include<string>
using namespace std;
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main() {
int n;
while (cin >> n, n) {
int prv = 0;
int l = 0;
i... | 0 | 62,169,760 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include<iostream>
using namespace std;
int main() {
for (int i = 1; i <= 9; i++){
cout << i << "x1=" << i*1 << endl;
cout << i << "x2=" << i*2 << endl;
cout << i << "x3=" << i*3 << endl;
cout << i << "x4=" << i*4 << endl;
cout << i << "x5=" << i*5 << endl;
cout << i ... | 0 | 83,174,797 |
#include<iostream>
using namespace std;
int main(){
int count[100];
int b;
int ans[100];
int ans2[100];
int ans3;
ans3 = 0;
for(int i=0;i<100;i++){
ans[i] = 0;
ans2[i] = 0;
count[i] = 0;
}
while(cin>>b) count[b-1]++;
for(int i=0;i<100;i++){
if(ans[ans3]<count[i]){
ans[i] = cou... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <s... | 0 | 85,232,568 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 8;
ve... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
#if 1... | 0 | 83,093,860 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
typedef long long ll;
ll a,b,c,d;
int main(){
scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
ll x1,x2,x3,x4;
x1=a*c;
x2=a*d;
x3=b*c;
x4=b*d;
ll ans;
ans=max(max(x1,x2),max(x3,x4));
printf("%lld",ans);
return 0;
} | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
bool warshell(int n,... | 0 | 59,164,579 |
#include <bits/stdc++.h>
using namespace std;
using edge = struct {
int next;
long d;
};
vector<edge> tree[100000];
long depth[100000] = {};
void dfs(int n, int p, long d) {
depth[n] = d;
for (auto &e : tree[n]) {
if (e.next == p)
continue;
dfs(e.next, n, d+e.d);
}
}
int main() {
int n;
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 87,234,530 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<pair<int,int>> rp(n);
vector<pair<int,int>> bp(n);
rep(i,n){
int a,b;
cin >> a >> b;
rp[i]=make_pair(b,a);
}
rep... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 0 | 78,961,977 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w,h,x,y,r;
cin >> w >> h >> x >> y >> r;
cout << (x-r<0 || y-r<0 || x+r>w || y+r>h ? "No":"Yes") << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 0 | 82,396,053 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pil = pair<pii,int>;
int main(){
int n;
cin >> n;
cout << n/3 << endl;
} | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | 0 | 58,490,693 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include<iostream>
#include<algorithm>
int main () {
int k, s;
std::cin >> k >> s;
long long ans = 0;
for (int x = 0; x <= k; x++)
{
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if(z >= 0 && z <= k) {
ans++;
}
}
}
std::... | 0 | 41,458,962 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
string S;
cin>>S;
for(ll i=0;i<19;i++) {
if(i==5||i==13) {
cout<<" ";
}
else {
cout<<S[i];
}
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(x) ... | 0 | 42,433,359 |
#include <iostream>
using namespace std;
int main(){
int m;
while(cin >> m,m){
int c=0;
m=1000-m;
while(m-500>=0){
m=m-500;
c++;
}
while(m-100>=0){
m=m-100;
c++;
}
while(m-50>=0){
m=m-50;
c++;
}
while(m-10>=0){
m=m-10;
c++;
}
while(m-5>=0){
m=m-5;
c++;
}
while(m-1>=0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int C[5];
int main(void){
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
C[a]++; C[b]++; C[c]++; C[d]++; C[e]++; C[f]++;
for(int i=1;i<=4;i++){
if(C[i]>=3){
cout<<"NO"<<endl;
return 0;
... | 0 | 91,268,122 |
#include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | #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 | 9,188,464 |
#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() {
ll l, r;
cin >> l >> r;
ll mi = 2000000000;
if (r - l > 2019) cout << 0;
else {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j < r + 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
w... | 0 | 58,002,603 |
#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 ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | #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... | 0 | 74,578,522 |
#include <iostream>
using namespace std;
long long dist(long long a, long long b, long long c, long long d){
return abs(a-c)+abs(b-d);
}
int main() {
int N, M;
cin >> N >> M;
long long s[N][2];
long long p[M][2];
for (int i=0; i<N; i++){
cin >> s[i][0] >> s[i][1];
}
for (int i=0; i<M; i++){
cin >> p[i][0] >... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
struct UnionF {
vector<ll> S;
UnionF(ll a){
S=vector<ll>(a);
for(ll i=0;i<a;i++)S[i]=i;
}
ll FFi(ll i){
if(S[i]==i)return i;
S[i]=FFi(S[i]);
return S[i];
}
void marge(l... | 0 | 46,013,118 |
#include<iostream>
#include<string>
#include<set>
using namespace std;
int main() {
int n;
cin >> n;
set<string> Dic;
string com, word;
while( n-- ) {
cin>>com>>word;
if(com[0] == 'i' ) Dic.insert(word);
else {
if( Dic.find(word) != Dic.end() ) cout << "yes" << endl;
else cout << "no" <<endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vb vector<bool>
#define pii pair<int, int>
#define vpli vector<pair<long long, int>>
#define deb(x) cout << "deb ... | 0 | 8,149,017 |
#include <iostream>
#include <queue>
using namespace std;
int main ()
{
priority_queue <int> gquiz;
string s;
int x;
while (cin>>s,s!="end"){
if (s=="insert"){
cin>>x;
gquiz.push(x);
}
if (s=="extract"){
cout<<gquiz.top()<<'\n';
gqu... | #include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | 0 | 33,760,956 |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[100010];
double Abs(double x) { return (x>0)?x:-x;}
int main()
{
scanf("%d",&n);
int Max=-1<<29,x=-1<<29;
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
Max=max(Max,a[i]);
}
for (int i=1;i<=n;i++)
if (a[i]!=Max&&Abs((double)Max/2-a[i])<=Abs((dou... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main()
{
int n, k;
cin >> n >> k;
set<int> S;
vector<pair<int,int>> V0;
rep(i,n) {
int t, d;
cin >> t >> d;
V0.emplace_back(t,d);
}
sort(V0.rbegin(), V0.... | 0 | 42,241,223 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
map<char, int>mp;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
map<char, int> m;
for (int j = ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
const int mod = 1e9+7;
const int mx = INT_MAX;
const long double pi = 4*atan((long ... | 0 | 35,951,865 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int R;
int G;
cin >> R >> G;
cout<<G-R+G;
} | #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 | 29,909,404 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =100000... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#def... | 0 | 48,887,868 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #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... | 0 | 91,110,138 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define INF INT_MAX;
typedef long long ll;
using namespace std;
int main(){
int x;cin >> x;
(x<1200) ? puts("ABC") : puts("ARC");
} | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(long long i=(l);i<(r);i++)
#define dec(i, l, r) for(long long i=(r)-1;i>=(l)... | 0 | 13,363,091 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string str, cmd;
int a, b, q;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> cmd >> a >> b;
if (cmd == "print") {
for (int j = a; j <= b; j++)
cout << str[j]; cout << endl;
}
else if (cmd == "reverse") {
int fend = (b -... | #include<iostream>
#include<algorithm>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long ll;
ll a,b,c,d;
int main()
{
ios;
cin>>a>>b>>c>>d;
ll m1,m2,m3,m4,maxn;
m1=a*c,m2=a*d;
m3=b*c,m4=b*d;
maxn=max(max(max(m1,m2),m3),m4);
cout<<maxn<<"\n";
return 0;
} | 0 | 13,573,552 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
int m[128], costs[128][128]... | 0 | 31,162,535 |
#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 <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
string s;
cin>>s;
int k;
cin>>k;
char cwk=s.at(k-1);
for(int i=0;i<n;i++){
if(s.at(i)!=cwk)
s.at(i)='*';
}
cout<<s<<endl;
return 0;
} | 0 | 63,149,300 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> a(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a[i];
a[i] -= 1;
}
set<int> lighten;
int ans = -1;
int l = 0;
for (int i = 0; i < N; ++i) {
l = a[l];
if (l == 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,... | 0 | 96,900,556 |
#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,n) for(ll i=0;i<(n);++i)
#define repA(i,a,n) for(ll i=a;i<=(n);++i)
#define repD(i,a,n) for(ll i=a;i>=(n);--i)... | #include<bits/stdc++.h>
using namespace std;
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PB(x, v) x.push_back(v);
#define pll pair<ll, ll>
#define ll long long
#define mll map<ll, ll>
#define vl vector<ll>
#define fa(x, v) for(auto x: v)
#define fr(i, a, b) for(int i= a;i <=b; i++)
#define B_... | 0 | 32,648,986 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll N, M; cin >> N >> M;
vector<ll> a(N, 0);
vector<ll> b(N, 0);
rep(i,M) {
ll A, B; cin >> A >> B;
if (A == 1) {
a[B-1] ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 18,627,009 |
#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() {
string s, t;
cin >> t;
ll k;
cin >> k;
s=t;
if(s==string(s.size(),s[0])) {
cout << s.size()*k/2 << endl;
return 0;
}
ll ans=0;
for(int i=1; s... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0; i < N; i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define cou(x) cout << x << endl
#define y() cout << "Yes" << endl
#define n() cout << "No" << endl
#define Y() cout << "YES" << endl
#define N() cout << "NO" << endl
#... | 0 | 43,420,795 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
int mod = 1000000007;
ll dp[100005];;
ll gcd(long long a,long long b){
if(b == 0)
return a;
else return gcd(b,a%b);
}
bool compare(pair<int,int>p1, pair<int,int>p2){
return p1.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);... | 0 | 93,218,699 |
#include <bits/stdc++.h>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_3(i, initial, n) for (int i = (int)(initial); i < (int)(n); ++i)
#define repeat(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS__)
#define rep_r_n(_1, _2, _3, NAME, ...) NAME
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int N, C, K; cin >> N >> C >> K;
vector<int> T(N);
rep(i,N) cin >> T.at(i);
sort(T.begin(), T.end());
int i = 0, p = 0, ws = 0;
ll res = 0;
while(i < N) ... | 0 | 23,400,262 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se secon... | 0 | 47,583,016 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | 0 | 66,942,802 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x, y;
cin >> x >> y;
if (x % y == 0) {
cout << -1 << endl;
}
else {
cout << x << endl;
}
return 0;
} | #include<iostream>
#include<math.h>
using namespace std;
int main(){
int n;
bool p[1000000];
while(cin>>n){
int n_sq = (int)sqrt(n);
for(int i=0; i<n; i++){
p[i] = true;
}
p[0] = false;
for(int i=1; i<n_sq; i++){
if(p[i]){
for(i... | 0 | 66,500,040 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll x, ll y) {
if(x < y) swap(x, y);
ll r;
while(y > 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
ll lcm(ll x, ll y) {
return ll(x / gcd(x, y)) * y;
}
int main() {
ll A, B;
cin >> A >> B;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,m,v,p;
cin >> n >> m >> v >> p;
vector<ll> a(n);
for(i = 0;i < n;++i){
cin >> a.at(i);
}
sort(all(a), greater<ll>());
... | 0 | 19,487,618 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
map<int, int> mp;
for(int i=0;i<n;i++){
cin >> a[i];
mp[a[i]]++;
}
sort(a,a+n);
int dia=a[n-1]+1,tmp=a[n-1];
while(dia>0){
if(dia>2){
if(mp[tmp]<2){
cout << "Impossible\n";
return 0;
... | 0 | 65,967,287 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
double x1, x2, x3, y1, y2, y3, px, py;
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> px >> py) {
double j1 = (x1 - x2)*(py - y2) - (px - x2)*(y1 - y2),
j2 = (x3 - x1)*(py - y1) - (px - x1)*(y3 - y1),
j3 = (x... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
long long X,y,a,b,c;
cin>>X>>y>>a>>b>>c;
vector<int>R,B,T;
long long x;
for(int i=0;i<a;i++){
cin>>x;
R.push_back(x); }
for(int i=0;i<b;i++){
cin>>x;
B.push_back(... | 0 | 87,972,799 |
#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int main()
{
for(;;){
int n;
cin >> n;
if(n == 0) break;
multiset<int> slist,elist;
for(int i=0; i<n; i++){
int h1,h2,m1,m2,s1,s2;
scanf("%d:%d:%d %d:%d:%d",&h1,&m1,&s1,&h2,&m2,&s2);
int s = h1 * 3600 + m1 ... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(x) ll((x).size())
#define all(v) (v).begin(),(v).end()
#define trace(x) cerr << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define For(i,a,b) for(ll i = ll(a); i < ll(b);... | 0 | 11,113,610 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
u... | #include <iostream>
void show_ret(int home[][10], bool use_partition) {
for(int i= 0; i < 3; i++) {
for(int j = 0; j < 10; j++) {
std::cout << " " << home[i][j];
}
std::cout << std::endl;
}
if(use_partition) std::cout << "####################" << std::endl;
}
int main(int... | 0 | 42,888,753 |
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
struct Point {
double x;
double y;
};
void koch(Point p1, Point p2, int n, int cnt) {
if (cnt >= n) {
std::cout << p1.x << ' ' << p1.y << '\n';
return;
}
cnt++;
Point s{p1.x + (p2.x - p1.x) / 3.0, p1.y + (p2.y ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<int,int> P;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
int main(){
int N, M; vector<int> A(9);
cin >> N >> M;
rep(i,M) cin... | 0 | 15,566,818 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.end(), greater<>());
long long ans = 0;
for (long long i = 0; i < N; i++, K--) {
if (K <= 0) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin>>s>>t;
int m,n,i,j,k;
m=s.length();
n=t.length();
if(m<n){
cout<<"UNRESTORABLE"<<endl;
return 0;
}
for(i=0;i<=m-n;i++){
for(j=0;j<n;j++){
if(s.at(m-n-i+j)!='?'&&s.at(m-n-i+j)!=t.at(j)) break;
}
if(j==n){
... | 0 | 49,618,899 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> b = {0,2,... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,n) for(intl i=0;i<(intl)(n);i++)
#define Rep1(i,n) for(intl i=1;i<(intl)(n)+1;i++)
#define vec vector
#define fi first
#define se second
#define pub push_back
#define pob pop_back
#define SortA(v) sort(v.begin(), v.end())
#define SortD(v... | 0 | 49,418,997 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <sstream>
using namespace std;
struct Node{
int key;
Node *prev, *next;
};
Node *nil;
void init(){
nil = new Node;
nil->next = nil;
nil->prev = nil;
}
void insert(int key){
Node *x = new Node;
x-... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<bool> can(n, true);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k ... | 0 | 50,054,210 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int X, N;
cin >> X >> N;
vector<int> ng(N);
rep (i, N) {
cin >> ng.at(i);
}
vector<int> ok(100 - N + 2);
int tmpIndex = 1;
ok.at(0) = 0;
rep (i, 100) {
bool... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
string s;
int flg,cnt1, cnt2, ans;
cin >> s;
cnt1 = 0;
flg = 0;
rep(i, s.size()) {
if (flg != s[i]-'0')
++cnt1;
if (++flg == 2)
... | 0 | 48,634,181 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t L, R;
cin >> L >> R;
if(L == 0) {
cout << 0 << endl;
return 0;
}
else if(R - L == 1) {
cout << R * L % 2019 << endl;
return 0;
}
else if(R / 673 != L / 673) {
cout << 0 << endl;
return 0;
}
else {
int64_t ... | 0 | 63,686,734 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int main() {
char a[25], i;
scanf("%s", &a);
for(i=strlen(a)-1;i>=0;i--){
printf("%c", a[i]);
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
int main(){
int N;cin>>N;
int a[N+1],b[N];
for(int i=0;i<=N;i++)cin>>a[i];
for(int i=0;i<N;i++)cin>>b[i];
ll monster=0;
for(int i=0;i<N;i++){
int ans1=min(a[i],b[i]);
int ans2=min(a[i+1],b[i]-ans1);
mons... | 0 | 28,643,085 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string ABCD;
cin >> ABCD;
int a, b, c, d;
a = (int)ABCD.at(0) - 48;
b = (int)ABCD.at(1) - 48;
c = (int)ABCD.at(2) - 48;
d = (int)ABCD.at(3) - 48;
int n = 3;
vector<int> answerCal(3);
for (int bit = 0; bit < (1 << n); bit+... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 39,215,858 |
#include <iostream>
using namespace std;
int main(){
int b,f,r,v,i,j,n;
int a[12][10];
for (j=0;j<12;j++){
for (i=0;i<10;i++)a[j][i]=0;
}
cin>>n;
for (i=0;i<n;i++){
cin>>b>>f>>r>>v;
a[b*3+f-4][r-1]+=v;
}
for (j=0;j<12;j++){
if (j&&!(j%3))cout<<"####################"<<endl;
for (i=0;i... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
using P =pair<int,int>;
int main(){
int a,b,k;
int count=0;
cin>>a>>b>>k;
for(int i=min(a,b);i>0;i--){
if(a%i==0&&b%i==0){
count++;
if(count==k){
cout<... | 0 | 85,231,855 |
#include<iostream>
using namespace std;
int main() {
int N, M, A;
cin >> N >> M;
int sum = 0;
for(int i = 0; i < M; i++) {
cin >> A;
sum += A;
}
if (sum > N) cout << -1 << endl;
else cout << N - sum << endl;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int INF = 1e9;
int main(void){
int h, w;
cin>>h>>w;
vector<string> v(h);
rep(i, h) cin>>v[i];
queue<pair<int, int> > que;
queue<pair<int, int> > nextque;
rep(i, h)rep(j, w)if(v[i][j] ... | 0 | 49,160,323 |
#include<iostream>
using namespace std;
int main(){
int x[11];
int r, d;
cin >> r >> d >> x[0];
for (int i = 1; i < 11; i++)
{
x[i] = r * x[i - 1] - d;
}
for (int i = 1; i < 11; i++)
{
cout << x[i] << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
string s,t;
getline(cin,s);
stringstream ss(s);
while(ss>>t)
{
cout<<char(t[0]-32);
}
return 0;
} | 0 | 77,674,672 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#define ll long long int
#define all(x) x.begin(), x.end()
#define MOD 998244353
using namespace std;
void solve... | 0 | 82,381,101 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <iomanip>
#include <functional>
#include <cmath>
#include <cassert>
#include <bitset>
#ifdef DEBUG
#include "debug.hpp"
#... | #include <iostream>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long long;
constexpr ll INF = 1010000000000000017LL;
#define rep(i, n) for(ll i = 0; i ... | 0 | 93,045,559 |
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
int len = (int)(s.size());
long long int ans = 0,x = 0;
rep(i,len){
if(s[i] == 'W'){
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+100;
int n,l,t,ans[N],wa,wb;
struct node
{
int x,w,id;
}a[N];
node b[N],sh[N];
deque <int> s;
signed main()
{
scanf("%lld%lld%lld",&n,&l,&t);
for (int i=1;i<=n;i++)
{
int x,w;
scanf("%lld%lld",&x,&w);
... | 0 | 59,597,894 |
#include<iostream>
#include<queue>
using namespace std;
int G[1005][1005], dist[1005][1005], H, W, K, sx[11], sy[11];
int solve(int ax, int ay, int bx, int by) {
for (int i = 0; i < 1005 * 1005; i++)dist[i / 1005][i % 1005] = 1000000000;
queue<pair<int, int>>Q; Q.push(make_pair(ax, ay)); dist[ax][ay] = 0;
while (!Q.... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n;
cin >> n;
vector<ll> v(n);
for(int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
ll p = 2;
for(int i = 2; i < n; i++){
v[i] *= p;
p *= 2;
}
ll s = 0;
for(int i... | 0 | 52,382,925 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
#define risi (0.05)
using namespace std;
int... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1<<30
#define LINF 1LL<<60
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll N; cin >> N;
vector<ll> a(N);
for(auto& in:a) cin >> in;
ll res = LINF;
ve... | 0 | 25,506,239 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long D = 1, ans = 0;
while (D <= B) {
long long Anum = (A-1) / (D * 2) * D + max(0ll, (A-1) % (D * 2) - (D - 1));
long long Bnum = B / (D * 2) * D + max(0ll, B % (D * 2) - (D - 1));
ans += D * ((Bnum... | #include <iostream>
int main() {
int n, T; std::cin >> n >> T;
unsigned long long X = 0;
int head = 0, tail = 0;
for (int i = 0; i < n; i++) {
int t; std::cin >> t;
if (t <= tail) {
tail = t + T;
} else {
X += tail - head;
head = t;
... | 0 | 85,052,637 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#defi... | 0 | 39,298,161 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int w;
int h;
int x;
int y;
int r;
string answer;
cin >> w >> h >> x >> y >> r;
if ( ( x + r ) > w) {
answer = "No";
} else if ( ( y + r ) > h ) {
answer = "No";
} else if ( x < r ) {
answer = "No";
} else if ( y < r ) {
answ... | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#include<stack>
#include<string>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<cstring>
#include<utility>
#include<math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
t... | 0 | 60,574,608 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i,n) for(ll i=... | #include <bits/stdc++.h>
#define optimize ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
#define ll long long
#define ld long double
#define lint __int128
#define vi vector<int>
#define pb push_back
#define lp(i,a,b) for(int i = a ; i <= b ; i ++)
#define rlp(i,a,b) for(int i = b ; i >= a ; i --)
#define a_s... | 0 | 88,846,887 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
int main() {
int N,K;
cin >> N ... | 0 | 11,454,499 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
vector<int> menu(5);
int main() {
rep(i, 5) cin >> menu.at(i);
int r = 1e9;
int ans = 0;
rep(i, 5) {
if(menu.at(i) % 10 != 0) r = min(r, menu.at(i) % 10);
ans += ((menu.at(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct ki {
ll num, kyori;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<vector<ki>> node(n);
for (ll i = 0; i < n - 1; i++) {
ki temp;
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
te... | 0 | 80,177,325 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int nax = 1e6+1;
int main(){
ll n;
cin>>n;
ll mi = 2*n;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ll k = n/i;
ll sum = i+k;
mi = min(mi,sum);
}
}
cout<<mi-2;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int a,b,m;
cin >>... | 0 | 10,317,543 |
#include <iostream>
#include <complex>
#include <cmath>
using namespace std;
typedef complex<double> P;
#define PI 3.1415926535898
#define EPS (1e-10)
#define X real()
#define Y imag()
bool equal(double a, double b){
return ( abs( a-b ) < EPS )? true : false ;
}
class Triangle{
private:
P a, b, c;
double edgeA,edgeB... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | 0 | 28,130,093 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> a(n);
for(Int i=0;i<n;i++) cin>>a[i];
Int an... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define ll long long
#define read1(x) ... | 0 | 46,881,496 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(N);
for(int i=0; i<N; i++){
cin >> vec.at(i);
}
vector<int> copy(N);
for(int i=0; i<N; i++){
copy.at(i) = vec.at(i);
}
sort(copy.begin(),copy.end());
map<int,int> mp;
for(int i=0; i<N; i++){
mp[co... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using lint = long long;
int main() {
lint N, M; std::cin >> N >> M;
std::vector<std::string> A(N);
std::vector<std::string> B(M);
for (auto& r : A)std::cin >> r;
for (auto& r : B)std::cin >> r;
if (N == M) {
boo... | 0 | 79,706,712 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #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.... | 0 | 94,784,813 |
#include <iostream>
using namespace std;
int main()
{
int x,y,c;
cin >> x >> y >> c;
int i, count = 0;
for(i = x; i <= y && i <= c;i++)
if(c%i == 0) count++;
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2e5 + 5;
const int K = 21;
ll ar[MAX];
int n;
ll dp[MAX];
ll sum[MAX];
int cnt[K];
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> ar[i];
int start = 0;
int end = 0;
bool ok = true;
ll sum = 0;
... | 0 | 72,200,311 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int a[MAXN];
int dp_old[MAXN], dp[MAXN], sums[MAXN];
int n, k;
const int MOD = 1e9 + 7;
inline int get_sum(int start, int end){
if(start == 0)
return sums[end];
int ans = sums[end] - sums[start - 1];
if(ans < 0){
ans +=... | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long double ld;
const int MAXN = 302;
const lli INF = (lli)(1e16);
lli H[MAXN];
lli memo[MAXN][MAXN];
int main() {
int N, K;
cin >> N >> K;
for (int i = 1 ; i <= N ; i++) {
cin >> H[i];
}
for (int i = 1 ; i <= N ; i++) {
m... | 0 | 38,205,078 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
using ll = long long;
using namespace std;
const long long MOD = 1000000007;
const ll LINF = 1LL ... | 0 | 86,164,163 |
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>a>>b;
if(a==1&&b==2)
cout<<3<<endl;
else if(a==3&&b==1)
cout<<2<<endl;
else if(a==1&&b==3)
cout<<2<<endl;
else if(a==2&&b==3)
cout<<1<<endl;
else if(a==3&&b==2)
cout<<1<<endl;
else if(a==2&&b==1)
cout<<3<<endl;
} | #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... | 0 | 79,005,998 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int main() {
int N;
cin >> N;
map<int, int> map;
int a;
rep(i,N) {
cin >>... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
int main(){
ll S;
cin >> S;
if(S == 1000000000000000000) {
cout << 0 << " " << ... | 0 | 40,224,495 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
long long n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
long long ans = 0;
int maxi = 0;
rep(i,n){
maxi = max(maxi,a[i]);
int Bi = maxi;
ans += Bi - a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int a, b, c;
cin >> a >> b... | 0 | 84,076,114 |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll H, W;
vector<vector<ll>> h_sum, w_sum;
void init(vector<vector<char>>& maze)
{
for (ll i = 1; i <= H + 1; ++i) {
ll l = 1, cnt = 0;
for (ll j = 1; j <= W + 1; ++j) {
if (maze.at... | #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... | 0 | 28,095,416 |
#include<iostream>
using namespace std;
int main(){
long long int a,b,c;
long long int k;
cin>>a>>b>>c>>k;
while(k--){
if(a>=b){
b*=2;
}
else if(b>=c){
c*=2;
}
}
if(a<b&&b<c){
cout<<"Yes"<<endl;
return 0;
}
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t powermod(int64_t x, int64_t y, int64_t p){
if(y < 0 || x <= 0)
return 0;
else{
int64_t n = 1;
x %= p;
for(int64_t i = 0; i < y; i++){
n = n*x%p;
}
return n;
}
}
int main() {
... | 0 | 74,603,997 |
#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;
cin >> N;
vector<int> a(N+1,0);
rep(i,N) cin >> a[i];
ll ans = 0;
rep(i,N){
ans += a[i]/2;
a[i] %= 2;
if(a[i] & (a[i + 1]>0)){
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, cnt = 0;
cin >> N;
bool flag = false;
for (int i = 0; i <= N / 4; i++)
{
for (int j = 0; j <= N / 7; j++)
if (4 * i + 7 * j == N)
{
flag = true;
br... | 0 | 10,166,214 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
... | #include <iostream>
using namespace std;
int main() {
while(true) {
int n, x;
cin >> n >> x;
if(n == 0 && x == 0) {
break;
}
int count = 0;
int i, ii, iii = 0;
for(i=1; i <= n; i++) {
for(ii = i + 1; (ii > i && ii <= n); ii++) {
... | 0 | 18,870,945 |
#include <bits/stdc++.h>
const int INF =1e9;
const int MOD =1e9+7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= int(... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 0 | 53,623,321 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n;
cin >> n;
vi a(n);
rep(i,n) cin >> a[i];
sort(a.rbegin(),a.rend());
int len = a[0]+1;
vi cnt(len);
for(int x : a) fo... | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <string>
#include <iostream>
#include <queue>
using namespace std;
int main() {
priority_queue<int> PQ;
string com;
int k;
cin >> com;
while (com != "end") {
if (com == "insert") {
cin >> k;
PQ.push(k);
}
if (com == "extract"... | 0 | 48,011,910 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int Max = 0;
int Min = 110;
int water(vector<int> h) {
rep(i, h.size()) h[i] -= Min;
int count = Min;
for(int i = 0; i <= Max; i++) {
rep(j, h.size()) {
if(h[j] != 0) ... | 0 | 299,120 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef pair<int, int>P;
P h[100000];
int main() {
int n, m;
while (scanf("%d%d", &n, &m), n) {
int ans = 0;
rep(i, n) {
int d, p; scanf("%d%d", &d, &p);
ans += d*p;
h[i] = P(p, d);
}
sort(h, h + n, greater<>());
int ... | #include <stdio.h>
int main()
{
int w,h,n,x,y;
while(1)
{
scanf("%d%d",&w,&h);
if(w == 0&&h == 0)break;
int mem[20][20] = {0};
scanf("%d",&n);
for(int i = 0; i < n; i++)
{
scanf("%d%d",&y,&x);
mem[x - 1][y - 1] = 1;
}
in... | 0 | 14,350,497 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
ll modInverse(ll n, ll p)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i += 2) {
cout << s[i];
}
cout << endl;
return 0;
} | 0 | 93,613,711 |
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int64_t> A(N);
rep(i, N) cin >> A[i];
int maxK = N * (N + 1) / 2;
vector<int64_t> B;
rep(i, N) {
... | #include<bits/stdc++.h>
using namespace std;
#define MAX_N 100000
typedef long long ll;
typedef pair<int,int> P;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
i... | 0 | 25,266,287 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<ll> A(N);
vector< vector<ll> > B(60, vector<ll>(N+1));
ll all_a = 0;
REP(i, N) {
ll ain;
cin >> A[i];
all_a ^= A[i];
}
REP(i,N) A[i] ... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
int main(){
ll n;... | 0 | 36,709,818 |
End of preview. Expand in Data Studio
- Downloads last month
- 13