code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 44
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 30)
using namespace std;
int editdistance(string a, string b)
{
int dp[a.size() + 1][b.size() + 1];
rep(i, a.size() + 1) rep(j, b.size() + 1)
{
dp[i][j] = INF;
}
rep(i, a.size() + 1) dp[i][0] = i;
rep(j, b.size() + 1) dp[0][j] = j;
for (int i = 1; i < a.size() + 1; i++)
for (int j = 1; j < b.size() + 1; j++)
{
if (a[i - 1] == b[j - 1])
{
dp[i][j] = dp[i - 1][j - 1] + 0;
}
else
{
dp[i][j] = dp[i - 1][j - 1] + 1;
}
dp[i][j] = min({dp[i][j], dp[i][j - 1] + 1, dp[i - 1][j] + 1});
}
return dp[a.size()][b.size()];
}
int main()
{
string s1, s2;
cin >> s1 >> s2;
cout << editdistance(s1, s2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N;
string S, tmp;
int t;
cin >> N >> S;
for (int i = 0; i < 4; i++) {
if(i % 2 == 0){
tmp = 'S';
}
else{
tmp = 'W';
}
if((i/2) % 2 == 0){
tmp += 'S';
}
else{
tmp += 'W';
}
for (int j = 2; j < N; j++) {
t = 0;
if(tmp[j-2] == 'W') t++;
if(tmp[j-1] == 'W') t++;
if(S[j-1] == 'x') t++;
if(t % 2 == 1){
tmp += 'W';
}
else{
tmp += 'S';
}
}
t = 0;
if(tmp[N-2] == 'W') t++;
if(tmp[N-1] == 'W') t++;
if(tmp[0] == 'W') t++;
if(S[N-1] == 'x') t++;
if(t % 2 == 0){
t = 0;
if(tmp[N-1] == 'W') t++;
if(tmp[0] == 'W') t++;
if(tmp[1] == 'W') t++;
if(S[0] == 'x') t++;
if(t % 2 == 0){
printf("%s\n", tmp.c_str());
return 0;
}
}
}
printf("-1\n");
} | 0 | 85,260,439 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
rep(i, n) p.at(i)--;
vector<int> a(n), b(n);
rep(i, n){
int no = (i+1) * (n+1);
a.at(i) = b.at(n-i-1) = no;
}
rep(i, n){
a.at(p.at(i)) += i;
}
rep(i, n){
if(i != 0) cout << " ";
cout << a.at(i);
}
cout << endl;
rep(i, n){
if(i != 0) cout << " ";
cout << b.at(i);
}
cout << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int n, j, num = 0;
cin >> n;
vector<int> height(n, 0);
for(int i = 0; i < n; i++)
cin >> height.at(i);
for(int i = 0; i < n;) {
if(height.at(i) == 0) {
i++; continue;
}
for(j = i; j < n; j++) {
if(height.at(j) == 0) {
break;
}
}
for(int k = i; k < j; k++) {
height.at(k)--;
}
num++;
}
cout << num << endl;
} | 0 | 3,965,231 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
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 N;
ll A, B, C;
vector<int> l;
int dfs(ll i, ll a, ll b, ll c){
if(i == N){
if(min(min(a,b),c) == 0){
return INF;
}
else{
return abs(a-A) + abs(b-B) + abs(c-C) - 30;
}
}
vector<ll> ans(4);
ans[0] = dfs(i+1, a, b, c);
ans[1] = dfs(i+1, a+l[i], b, c)+10;
ans[2] = dfs(i+1, a, b+l[i], c)+10;
ans[3] = dfs(i+1, a, b, c+l[i])+10;
int mx = (int)*min_element(ans.begin(), ans.end());
return mx;
}
int main()
{
cout << fixed << setprecision(15);
cin >> N;
cin >> A >> B >> C;
REP(i, N){
ll t;
cin >> t;
l.push_back(t);
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #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 ll MOD = 1e9 + 7;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 1, -1);
vector<ll> a(M);
for (int i = 0; i < M; i++)
{
cin >> a[i];
dp[a[i]] = 0;
}
dp[0] = 1;
for (int i = 1; i <= N; i++)
{
if (dp[i] == 0)
{
continue;
}
if (i == 1)
{
dp[i] = dp[i - 1];
continue;
}
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
cout << dp[N] << endl;
return 0;
} | 0 | 91,907,267 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
struct Info{
Info(int arg_a,int arg_b){
a = arg_a;
b = arg_b;
}
int a,b;
};
int main(){
int N,M;
scanf("%d %d",&N,&M);
vector<Info> info;
ll tmp = (M+1)/2;
for(int i = 0; i < tmp; i++){
info.push_back(Info(tmp-(i+1),tmp+i));
}
int tmp2 = M-tmp;
for(int i = 0; i < tmp2; i++){
info.push_back(Info(2*tmp+tmp2-(i+1),2*tmp+tmp2+(i+1)));
}
for(int i = 0; i < info.size(); i++){
printf("%d %d\n",info[i].a+1,info[i].b+1);
}
return 0;
} | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
void map_p(map<int,int>& d){cout<<"map: ";for(auto a : d){cout<<"{"<<a.first<<":"<<a.second<<"}";}cout<<endl;}
void set_p(set<int>& d){cout<<"set: ";for(int a : d){cout<<a<<" ";}cout<<endl;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
ll n,m;
cin>>n>>m;
int ans=0;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
a[i]/=2;
}
bool flag=true;
while(a[0]%2==0){
rep(i,n){
if(a[i]%2!=0){
flag=false;
break;
}
a[i]/=2;
}
m/=2;
}
rep(i,n) if(a[i]%2==0) flag=false;
if(flag){
ll lcm=a[0];
for(int i=1;i<n;i++){
lcm=lcm*a[i]/__gcd(lcm,a[i]);
if(m<lcm){
flag=false;
break;
}
}
if(flag){
lcm=m/lcm;
if(lcm%2==0) lcm--;
ans=(lcm-1)/2+1;
}
}
cout<<ans<<endl;
return 0;
} | 0 | 91,602,906 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[5]=='0'){
if(s[6]=='1' || s[6]=='2' || s[6]=='3' || s[6]=='4'){
cout << "Heisei" << endl;
}else{
cout << "TBD" << endl;
}
}else{
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int n;
cin >> n;
vector<unsigned long long> a(n);
for(int i = 0;i < n;i++){
cin >> a[i];
}
unsigned long long cnt = 1;
sort(a.begin(), a.end());
if(a[0] <= 0){
cout << 0 << endl;
}else{
for(int i = 0;i < n;i++){
if(a[i] <= 1000000000000000000/cnt){
cnt = cnt * a[i];
}else{
cout << -1 << endl;
goto owari;
}
}
cout << cnt << endl;
}
owari:
return 0;
} | 0 | 33,528,306 |
#include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
double T,X;
cin>>T>>X;
double A=T/X;
cout<<A;
} | #include<bits/stdc++.h>
using namespace std ;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define ar array
#define inf() ifstream cin("d.txt")
#define onf() ofstream cout("test.txt")
#define mod 1000000007
#define pb push_back
#define endl cout<<"\n";
#define prt1(a) cout<<a<<" "
#define prt2(a,b) cout<<a<<" "<<b<<" "
#define prt3(a,b,c) cout<<a<<" "<<b<<" "<<c<<" "
#define in(a) cin>>a
#define inn(a,b) cin>>a>>b
#define innn(a,b,c) cin>>a>>b>>c
#define rep(i,st,end) for(int i=st;i<end;i++)
#define repv(i,st,end) for( i=st;i>=end;i--)
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define TEST ll tc;cin>>tc;while(tc--)
#define EACH(x, a) for (auto& x: a)
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class T> void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d=stod(t);
}
void read(long double& d) {
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
read(h);
read(t...);
}
template<class A> void read(vt<A>& x) {
EACH(a, x)
read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
EACH(a, x)
read(a);
}
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a <<"\n";
err(++it, args...);
}
ll spf[1000005]={0} ;
void sieve()
{
spf[1] = 1;
for(int i = 2 ; i<1000005;i++)
spf[i] = i;
for(int i = 4 ; i<1000005;i+=2)
spf[i] = 2;
for(int i = 3 ;i*i<1000005;i++)
{
if(spf[i] ==i)
{
for(int j=i*i;j<1000005;j+=i)
{
if(spf[j]==j)
spf[j] = i;
}
}
}
}
map<ll,ll>prime ;
void primefactor(ll x)
{
ll cnt= 0;
set<ll>s;
unordered_map<ll,ll>mp;
while(x!=1)
{
s.insert(spf[x]);
x=x/spf[x];
}
for(auto it: s)
prime[it]++;
}
void solve()
{
ll n;
read(n);
vt<ll>v(n) ;
read(v);
ll g= v[0];
rep(i,1,n)
g=__gcd(g,v[i]);
rep(i,0,n)
primefactor(v[i]);
ll f= 0;
for(auto it:prime)
{
if(it.second>1)
{
f= 1;
break ;
}
}
if(f==0)
cout<<"pairwise coprime";
else if(g==1)
cout<<"setwise coprime";
else
cout<<"not coprime";
}
int main()
{
fio;
ll k = 1;
ll tc = 1;
sieve();
while(tc--){
solve();
endl;
}
} | 0 | 13,945,214 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a , b ;
cin>>a>>b;
int t=0 , n;
for (int x=0 ; x<=a ; ++x)
{
for (int y=0 ; y<=a ; ++y)
{
n=b-x-y;
if (n>=0&&n<=a)
{
t+=1;
}
}
}
cout<<t<<endl;
} | #include<bits/stdc++.h>
int main(){
int h,w,a,b;
std::cin>>h>>w>>a>>b;
for(int i=0;i<b;i++){
for(int j=0;j<a;j++){
std::cout<<"1";
}
for(int j=a;j<w;j++){
std::cout<<"0";
}
std::cout<<std::endl;
}
for(int i=b;i<h;i++){
for(int j=0;j<a;j++){
std::cout<<"0";
}
for(int j=a;j<w;j++){
std::cout<<"1";
}
std::cout<<std::endl;
}
} | 0 | 49,066,686 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,a;
cin>>n>>a;
if(n<500)
{
if(a>=n)
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
}
else
{
n=n%500;
if(n<=a)
cout<<"Yes\n";
else
cout<<"No\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < n; i++)
const ll mod = 1000000007;
int main() {
int n,m;
cin >> n >> m;
int s[n];
rep(i,n) cin >> s[i];
int t[m];
rep(i,m) cin >> t[i];
ll dp[n+1][m+1];
rep(i,n+1) rep(j,m+1) dp[i][j] = 0;
rep(i,n) {
rep(j,m) {
dp[i+1][j+1] = (mod+dp[i+1][j]+dp[i][j+1]-dp[i][j])%mod;
if (s[i] == t[j]) {
dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j] + 1)%mod;
}
}
}
cout << (dp[n][m]+1)%mod << endl;
return 0;
} | 0 | 51,888,127 |
#include <bits/stdc++.h>
using namespace std;
int64_t calc_gcd(int64_t a, int64_t b)
{
a = a % b;
if (a == 0)
return b;
return calc_gcd(b, a);
}
int64_t calc_lcm(int64_t a, int64_t b)
{
return a / calc_gcd(a, b) * b;
}
int64_t calc_vec_lcm(const vector<int64_t> &a_vec, int64_t upper)
{
int64_t lcm = 1;
for (auto a : a_vec) {
lcm = calc_lcm(lcm, a);
if (lcm > upper)
return upper;
}
return lcm;
}
int64_t count_factor2(int64_t a)
{
int64_t log2 = 0;
while (a > 0) {
if (a & 1)
break;
++log2;
a >>= 1;
}
return log2;
}
bool is_feasible(const vector<int64_t> &a_vec)
{
int64_t cnt, head_cnt = -1;
int size = a_vec.size();
head_cnt = count_factor2(a_vec.at(0));
for (int i = 1; i < size; ++i) {
cnt = count_factor2(a_vec.at(i));
if (cnt != head_cnt)
return false;
}
return true;
}
int main()
{
int N;
int64_t M;
cin >> N >> M;
vector<int64_t> a_vec(N);
int64_t a;
for (int i = 0; i < N; ++i) {
cin >> a;
a_vec.at(i) = a / 2;
}
if (!is_feasible(a_vec)) {
cout << 0 << endl;
return 0;
}
int64_t lcm = calc_vec_lcm(a_vec, M + 1);
cout << M / lcm - M / (2 * lcm) << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define s second
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define f first
const ll N=1e3+5;
ll bexpo(ll x,ll n){
if(n==0)return 1;
else if(n%2==0)return bexpo(x*x,n/2);
else return x*bexpo(x*x,(n-1)/2);
}
ll gcd(ll a,ll b){if(!b)return a;return gcd(b,a%b);}
int Arr[N];
void initialize()
{
for(int i = 0;i<N;i++)
Arr[ i ] = i ;
}
int root(int i)
{
while(Arr[ i ] != i)
{
i = Arr[ i ];
}
return i;
}
void unio(int A ,int B)
{
int root_A = root(A);
int root_B = root(B);
if(root_A<root_B)
Arr[ root_A ] = root_B ;
else
Arr[root_B]=root_A;
}
bool find(int A,int B)
{
if( root(A)==root(B) )
return true;
else
return false;
}
ll dp[N][N];
vector<ll> adj[N];
string a[N];
ll h,w;
ll dfs(ll i,ll j)
{
if(i>h || j>w)
return 0;
if(dp[i][j]!=-1)
return dp[i][j];
if(i==h && j==w)
return 1;
ll cnt=0;
for(ll x=0;x<=1;x++)
{
for(ll y=0;y<=1;y++)
{
if(x!=y && a[i+x-1][j+y-1]=='.')
cnt=(cnt+dfs(i+x,j+y))%mod;
}
}
return dp[i][j]=cnt;
}
int main() {
FIO;
cin>>h>>w;
ll i,j;
for(i=0;i<h;i++)
{
cin>>a[i];
}
for(i=1;i<=h;i++)
for(j=1;j<=w;j++)
dp[i][j]=-1;
cout<<dfs(1,1);
} | 0 | 24,074,704 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth == 0)
{
ret.push_back(s);
return ret;
}
for (ll i = 0; i < symbol.size(); i++)
{
auto vec = dfs(s + symbol[i], depth - 1, symbol);
for (auto &&e : vec)
{
ret.push_back(e);
}
}
return ret;
}
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
int main()
{
ll R, G;
cin >> R >> G;
cout << (R + (G - R) * 2) << endl;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <set>
#include <bitset>
#include <cmath>
using namespace std;
const int maxv = 10 + 5, INF = 0x3f3f3f3f;
int n, d[maxv][maxv];
int main() {
while (cin >> n && n) {
for (int i = 0; i < maxv; ++i)
for (int j = 0; j < maxv; ++j)
d[i][j] = (i == j ? 0 : INF);
int V = 0;
for (int i = 1; i <= n; ++i) {
int a, b, c; cin >> a >> b >> c;
d[a][b] = d[b][a] = c;
V = max(V, max(a, b));
}
for (int k = 0; k <= V; ++k)
for (int i = 0; i <= V; ++i)
for (int j = 0; j <= V; ++j)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
int ans = INF, loc;
for (int i = 0; i <= V; ++i) {
int sum = 0;
for (int j = 0; j <= V; ++j) {
if (i == j) continue;
else sum += d[i][j];
}
if (sum < ans) { ans = sum; loc = i; }
}
cout << loc << ' ' << ans << endl;
}
return 0;
} | 0 | 52,581,572 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int mx = -1;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
ans += max(mx, x) - x;
mx = max(mx, x);
}
cout << ans << '\n';
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
t = 1;
while(t--){
ll x;
cin >> x;
ll a , b;
cin >> a >> b;
for(int i = a ; i <= b ; i ++)
{
if(i % x == 0)
{cout << "OK" << endl;return 0;}
}
cout << "NG" << endl;
}
} | 0 | 63,585,488 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#include<bitset>
#include<complex>
#include<chrono>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
void solve(){
int n,m;
cin>>n>>m;
vector<int>s(n),t(m);
rep(i,n)cin>>s[i];
rep(i,m)cin>>t[i];
vector<vector<ll>>dp(n+1,vector<ll>(m+1));
vector<vector<ll>>sum(n+1,vector<ll>(m+1));
dp[0][0]=1;
sum[1][1]=1;
rep(i,n){
rep(j,m){
if(s[i]==t[j]){
dp[i+1][j+1]+=sum[i][j]+1;
}
dp[i+1][j+1]%=mod;
sum[i+1][j+1]=(sum[i][j+1]+sum[i+1][j]-sum[i][j]+dp[i+1][j+1]+mod)%mod;
}
}
cout<<(sum[n][m]+1)%mod<<endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(15);
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin>>n;
int T=0,px=0,py=0;
for(int i=0;i<n;i++){
int t,x,y;
cin>>t>>x>>y;
int dt=t-T;
int dxy=abs(x-px)+abs(y-py);
if(dt<dxy || dt%2!=dxy%2){
cout<<"No"<<endl;
return 0;
}
T=t;px=x;py=y;
}
cout<<"Yes"<<endl;
return 0;
} | 0 | 78,669,630 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int n,a;
cin>>n>>a;
n*=n;
n-=a;
cout<<n<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define _GLIBCXX_DEBUG
const lli INF = 2147483647;
const lli MINF = -2147483648;
const lli LINF = 9223372036854775807;
const lli MOD = 1000000007;
const double PI = acos(-1);
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define pb push_back
#define eb emplace_back
#define mp make_pair
#pragma GCC optimize("Ofast")
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vvli = vector<vlli>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
lli a, b, c, h, n, w, l, r, ans = 0, count = 2020;
string s, t;
vector<pair<string, pair<lli, lli>>> pr;
cin >> l >> r;
repe(i, l, r)
{
repe(j, i + 1, r)
{
ans = (i * j) % 2019;
if (ans == 0)
{
cout << 0 << endl;
return 0;
}
count = min(count, ans);
}
}
cout << count << endl;
} | 0 | 17,552,529 |
#include<bits/stdc++.h>
#include<unordered_map>
#include<tr1/unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define lin1(x) ll int x; x = scan();
#define lin2(x,y) ll int x, y; x = scan(), y = scan();
#define lin3(x,y,z) ll int x, y, z; x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x,y) make_pair(x,y)
#define mx(a,b) (a)>(b)?(a):(b)
#define mn(a,b) (a)<(b)?(a):(b)
#define fori(s,e) for(i=s;i<=e;i++)
#define forj(s,e) for(j=s;j<=e;j++)
#define fork(s,e) for(k=s;k<=e;k++)
#define rep(i,s,e) for(int i=s;i<=e;i++)
#define brep(i,s,e) for(int i=s;i>=e;i--)
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define cn cin>>
#define co cout<<
#define fast std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main()
{
long long x;
cin>>x;
long long rohan=0;
while(x!=0){
int count=x%10;
if (count==9)
{
rohan=rohan*10+1;
}
else{
rohan=rohan*10+9;
}
x=x/10;
}
int rahul=0;
while(rohan!=0){
int count=rohan%10;
rahul=rahul*10+count;
rohan/=10;
}
cout<<rahul<<endl;
return 0;
} | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<ld> vld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
class UnionFind
{
public:
explicit UnionFind(int N)
{
m_par.reserve(N);
for (int n = 0; n < N; ++n) {
m_par.push_back(n);
}
m_dist = vll(N);
}
int Root(int n)
{
if (m_par[n] == n) return n;
while (m_par[n] != m_par[m_par[n]]) {
m_dist[n] += m_dist[m_par[n]];
m_par[n] = m_par[m_par[n]];
}
return m_par[n];
}
bool Unite(int n, int m, ll d)
{
if (Root(n) == Root(m)) {
if (m_dist[m] - m_dist[n] == d) return true;
else return false;
}
m_dist[Root(n)] = m_dist[m]-d;
if (n != Root(n)) m_dist[Root(n)] += -m_dist[n];
m_par[Root(n)] = Root(m);
return true;
}
bool Same(int n, int m)
{
return Root(n) == Root(m);
}
vi m_par;
vll m_dist;
};
int main(int argc, const char * argv[]) {
ios_base::sync_with_stdio(false);
int N, M;
cin >> N >> M;
UnionFind UF(N);
for (int m = 0; m < M; ++m) {
int l, r;
ll d;
cin >> l >> r >> d;
--l; --r;
if (!UF.Unite(l, r, d)) {
cout << "No\n";
return 0;
}
}
for (int n = 0; n < N; ++n) {
UF.Root(n);
if (abs(UF.m_dist[n]) > 1e9) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
} | 0 | 6,862,091 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<utility>
#include<cstdio>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include <bitset>
using namespace std;
const int mod=1e9+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define rep2(i,x,n) for (int i= x;i<n;i++)
#define all(v) v.begin(), v.end()
#define nepe(v) next_permutation(all(v))
#define F first
#define S second
#define PB push_back
#define MP make_pair
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl=vector<long long>;
using vvl = vector<vl>;
using vp =vector<pair<int,int>>;
typedef pair<int,int> P;
string s;
int k;
ll INF = 1000000000000;
int main(){
string S;
cin >>S;
ll N =S.size();
ll K;
cin >>K;
int tempc=0,cc=0;
if(S[0]==S[N-1]){
char mark =S[0];
ll lc=0,rc=0;
rep(i,N-1){
if(S[i]==mark) lc++;
else break;
}
rep(i,N-1){
if(S[N-1-i]==mark) rc++;
else break;
}
if(lc+rc==2*(N-1)) cout <<N*K/2<<endl;
else{
rep2(i,lc,N-rc-1){
if(S[i]==S[i+1]) tempc ++;
else{
cc += max(0,(tempc+1)/2);
tempc =0;
}
}
cc += max(0,(tempc+1)/2);
cout <<lc/2+rc/2+cc*K+((lc+rc)/2)*(K-1)<<endl;
}
}
else{
rep(i,N-1){
if(S[i]==S[i+1]) tempc ++;
else{
cc +=max(0,(tempc+1)/2);
tempc =0;
}
}
cc += max(0,(tempc+1)/2);
cout <<cc*K<<endl;
}
} | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
cout << a;
return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back()) {
cout << " ";
}
}
return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
for (auto &v : vv) {
for (auto &a : v) {
cout << a;
if (&a != &v.back()) {
cout << " ";
}
}
if (&v != &vv.back()) {
cout << "\n";
}
}
return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
bool f = print_(head);
if (sizeof...(tail) != 0) {
cout << (f ? " " : "\n");
}
print(forward<Tail>(tail)...);
}
#pragma endregion
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll a(n);
rep(i, n){
cin >> a[i];
}
ll ans = a[0]-1;
ll cur = 1;
repr(i, 1, n){
if(a[i] == cur+1) cur++;
else ans += (a[i]-1)/(cur+1);
dump(i, a[i], cur, (a[i]-1)/(cur+1));
}
print(ans);
} | 0 | 75,753,677 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, int> mp;
rep(i, 0, n){
string s, t;
cin >> s >> t;
if(s == "insert"){
mp[t]++;
}else{
if(mp[t] != 0) cout << "yes" << endl;
else cout << "no" << endl;
}
}
} | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
int main() {
int V, E; cin >> V >> E;
vector<vector<long long int>>edges(V, vector<long long int>(V,1e18));
for (int i = 0; i < V; ++i)edges[i][i] = 0;
for (int i = 0; i < E; ++i) {
long long int a, b, c; cin >> a >> b >> c;
edges[a][b] = min(edges[a][b], c);
}
bool ok = true;
for (int l = 0; l < 2; ++l) {
for (int k = 0; k < V; ++k) {
for (int i = 0; i < V; ++i) {
for (int j = 0; j < V; ++j) {
long long int cost = edges[i][k] + edges[k][j];
if (edges[i][j]>cost) {
if (l == 1)ok = false;
else {
edges[i][j] = cost;
}
}
}
}
}
}
if (ok) {
for (int i = 0; i < V; ++i) {
for (int j = 0; j < V; ++j) {
if (edges[i][j]>1e10)cout << "INF";
else cout << edges[i][j];
if (j == V - 1)cout << endl;
else cout << " ";
}
}
}
else {
cout << "NEGATIVE CYCLE" << endl;
}
return 0;
} | 0 | 32,819,702 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 18) + 10;
int arr[N];
pair<int, pair<int, int>> memo[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", arr + i);
memo[i] = {arr[i], {arr[i], 0}};
}
for (int i = 0; i < n; ++i) {
for (int msk = 0; msk < (1 << n); ++msk) {
if (msk & (1 << i)) {
vector<int> vec;
vec.push_back(memo[msk].second.first);
vec.push_back(memo[msk].second.second);
vec.push_back(memo[msk ^ (1 << i)].second.first);
vec.push_back(memo[msk ^ (1 << i)].second.second);
sort(vec.rbegin(), vec.rend());
pair<int, pair<int, int>> p = {vec[0] + vec[1], {vec[0], vec[1]}};
memo[msk] = max(memo[msk], p);
}
}
}
for (int i = 1; i < (1 << n); ++i) {
if (i > 1) memo[i].first = max(memo[i].first, memo[i - 1].first);
printf("%d\n",memo[i].first);
}
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2,62);
int keta(int x){
for(int j = 0; ; j++){
int a = pow(10, j);int b = pow(10, j+1);
if(a <= x && x < b){
return j + 1;
break;
}else{
continue;
}
}
}
int main(){
ll n;cin >> n;
ll ans = 0;
for(int i = 1;i <= n;i++){
ll oo = keta(i);
if(oo % 2 == 1){
ans++;
}
}
cout << ans << endl;
} | 0 | 94,222,057 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; i--)
#define all(i) (i).begin(),(i).end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef vector<long long> llv;
typedef vector<pint> vpint;
int main(void)
{
map<string, int> m;
string x = "", s, y = "";
while (cin >> s){
m[s] += 1;
if (m[x] < m[s]) x = s;
if (y.size() < s.size()) y = s;
}
cout << x << " " << y << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 100005
#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 F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9+7;
int a[maxn];
ll dp[maxn][2];
ll dfs(int now, int lim) {
if (now == -1) {
return 1;
}
if (~dp[now][lim]) {
return dp[now][lim];
}
int ub = lim ? a[now] : 1;
ll sum = 0;
if (ub == 0) {
sum = dfs(now - 1, 1);
}
else {
if (lim) {
sum = 2 * dfs(now-1,1) + dfs(now-1,0);
}
else {
sum = 3 * dfs(now-1,0);
}
}
sum %= mod;
return dp[now][lim] = sum;
}
ll solve(string s) {
memset(dp, -1, sizeof(dp));
int ptr = 0;
while(s.size()) {
a[ptr++] = s.back() - '0';
s.pop_back();
}
return dfs(ptr-1,1);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
cout << solve(s) << '\n';
} | 0 | 24,470,912 |
#include <bits/stdc++.h>
#define tc(t) int t; cin>>t; while(t--)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a , b, c;
cin >> a >> b >> c;
if (a + b >= c) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int max1,max2;
max1 = max(a[0],a[1]);
max2 = min(a[0],a[1]);
for(int i=2; i<n; i++){
if(max1 < a[i]){
max2 = max1;
max1 = a[i];
}
else if (max1 == a[i]){
max2 = a[i];
}
else if(max1 > a[i] && a[i] > max2){
max2 = a[i];
}
}
int ans;
rep(i,n){
if(a[i] == max1){
ans = max2;
}
else{
ans = max1;
}
cans;
}
return 0;
} | 0 | 63,180,152 |
#include <bits/stdc++.h>
#define N 1000000
using namespace std;
typedef long long int ll;
int main()
{
int t,arr[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};
scanf("%d",&t);
printf("%d\n",arr[t-1]);
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a.size() < b.size()) puts("LESS");
else if(b.size() < a.size()) puts("GREATER");
else {
for(int i = 0; i < a.size(); i++) {
if(a[i] - '0' < b[i] - '0') {
puts("LESS");
return 0;
}
else if (b[i] - '0' < a[i] - '0') {
puts("GREATER");
return 0;
}
}
puts("EQUAL");
}
return 0;
} | 0 | 67,345,596 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
sort(all(a));
rep(i,n-1){
if(a[i]==a[i+1]){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a, b, k, cnt;
int main() {
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
++cnt;
if (cnt == k) {
cout << i << endl;
exit(0);
}
}
}
return 0;
} | 0 | 31,946,991 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
char k = 'x';
if(a + b == 15)
{
k = '+';
}
else if(a * b == 15)
{
k = '*';
}
cout << k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
stack<int> densha;
for(int a; cin >> a; ){
if(a == 0){
cout << densha.top() << endl;
densha.pop();
}else
densha.push(a);
}
return 0;
} | 0 | 19,593,180 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3121000;
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
long long Comb(int a,int b){
if(a<b||b<0)return 0;
return fact[a]*finv[b]%mod*finv[a-b]%mod;
}
void init_C(int n){
fact[0]=finv[0]=inv[1]=1;
for(int i=2;i<n;i++){
inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
}
for(int i=1;i<n;i++){
fact[i]=fact[i-1]*i%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
}
long long pw(long long a,long long b){
long long ret=1;
while(b){
if(b%2)ret=ret*a%mod;
a=a*a%mod;
b/=2;
}
return ret;
}
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
double ABS(double a){return max(a,-a);}
int p[210000];
int now[53];
int main(){
int a;scanf("%d",&a);
for(int i=0;i<a;i++)scanf("%d",p+i);
bool ok=true;
for(int i=1;i<a;i++){
if(p[i-1]>=p[i]){
ok=false;
}
}
if(ok){
printf("1\n");return 0;
}
int left=1;
int right=a+1;
while(left+1<right){
int M=(left+right)/2;
int sz=0;
bool ok=true;
for(int i=0;i<a;i++){
if(p[i]>50)continue;
if(sz<p[i]){
for(int j=sz;j<p[i];j++)now[j]=0;
sz=p[i];
}else{
int at=-1;
for(int j=p[i]-1;j>=0;j--){
if(now[j]!=M-1){
now[j]++;
at=j;break;
}
}
if(at==-1){
ok=false;break;
}
for(int j=at+1;j<p[i];j++){
now[j]=0;
}
sz=p[i];
}
}
if(ok){
right=M;
}else left=M;
}
printf("%d\n",right);
} | #include<iostream>
#include<set>
#include<vector>
using namespace std;
int main(){
int n,m,k;
cin>>n>>m>>k;
set<pair<int,int> >pos;
int xx[n+1];
int yy[m+1];
vector<int>x;
vector<int>y;
int maxx=0;
int maxy=0;
for(int i=1;i<=n;++i)
xx[i]=0;
for(int i=1;i<=m;++i)
yy[i]=0;
for(int i=1;i<=k;++i){
int a,b;
cin>>a>>b;
pos.insert(make_pair(a,b));
++xx[a];
++yy[b];
if(xx[a]>maxx){
maxx=xx[a];
x.clear();
x.push_back(a);
}
else if(xx[a]==maxx)
x.push_back(a);
if(yy[b]>maxy){
maxy=yy[b];
y.clear();
y.push_back(b);
}
else if(yy[b]==maxy)
y.push_back(b);
}
for(int i=0;i<x.size();++i)
for(int j=0;j<y.size();++j)
if(pos.count(make_pair(x[i],y[j]))==0){
cout<<maxx+maxy<<endl;
return 0;
}
cout<<maxx+maxy-1<<endl;
return 0;
} | 0 | 91,524,551 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
using ml = boost::multiprecision::cpp_int;
#define all(c) (c).begin(), (c).end()
#define rep(i, b, e) for (ll i = b; i < e; i++)
#define repr(i, b, e) for (ll i = b; e < i; i--)
#define val(itr) *(itr)
#define llong_max 9223372036854775807
#define ldbl_max 1.79769e+308
#define mod 1000000007
#define pi 3.14159265358979323846
#define fori(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#define each(i, e, c) fori(i, auto e = c.begin(); e != c.end(); ++e)
#define forir(i, v, ...) if(ll i = Size(v)) for(__VA_ARGS__) if(i--, true)
#define eachr(i, e, c) forir(i, auto e = c.rbegin(); e != c.rend(); ++e)
auto Count = []
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoN = []
(auto c) { return (ll)(c - '0'); };
auto DivC = []
(auto a, auto b) { return ceil((ld)a / (ld)b); };
auto Fix = []
(auto b, auto e, auto fix)
{ for (auto it = b; it != e; ++it)*it += fix; };
auto Pow = []
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = []
(auto n) { return (1LL << n); };
auto Pow10 = []
(auto n) { return (ll)pow(10, n); };
auto Size = []
(auto& c) { return (ll)(c).size(); };
auto Sum = []
(auto b, auto e) { return accumulate(b, e, 0LL); };
template <class T> vvt<T> VVT
(ll ys, ll xs, T fill = T())
{
vvt<T> v(ys);
each(i, y, v) { val(y).resize(xs, fill); } return v;
}
template <class T> vvvt<T> VVVT
(ll zs, ll ys, ll xs, T fill = T())
{
vvvt<T> v(zs);
each(i, z, v) { val(z) = VVT(ys, xs, fill); } return v;
}
template <class T> vt<T> InputVT
(ll size, T fix = T())
{
vt<T> v(size);
each(i, e, v) { cin >> val(e); val(e) += fix; } return v;
}
template <class T> vvt<T> InputVVT
(ll ys, ll xs, T fix = T())
{
vvt<T> v(ys); each(i, y, v) val(y).resize(xs);
each(i, y, v) each(j, x, val(y)) { cin >> val(x); val(x) += fix; }
return v;
}
template <class T> vvvt<T> InputVVVT
(ll zs, ll ys, ll xs, T fix = T())
{
vvvt<T> v(zs);
each(i, z, v) { val(z) = InputVVT<T>(ys, xs, fix); }
return v;
}
struct Engine
{
ll x;
ll y;
ld angle;
};
auto NyaSort = [](const Engine& l, const Engine& r)
{
return l.angle < r.angle;
};
int main(void)
{
ll N; cin >> N;
vt<Engine> v(N);
each(i, e, v)
{
cin >> e->x >> e->y;
e->angle = atan2(e->y, e->x);
}
sort(all(v), NyaSort);
ld ans = 0;
rep(i, 0, N)
{
ll xsum = 0;
ll ysum = 0;
rep(j, i, i+N)
{
xsum += v[j % N].x;
ysum += v[j % N].y;
ans = max(ans, (ld)sqrt(xsum * xsum + ysum * ysum));
}
}
cout << std::fixed << std::setprecision(12) << ans;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(cin >> n){
int sum = 0;
int s[100];
if(n == 0) break;
else{
for(int i = 0; i < n; i++){
cin >> s[i];
}
sort(s, s + n);
s[0] = 0;
s[n - 1] = 0;
for(int i = 0; i < n; i++){
sum += s[i];
}
cout << sum / (n - 2) << endl;
}
}
} | 0 | 89,250,071 |
#include <stdio.h>
int main() {
int t;
scanf("%d", &t);
printf("%d\n", t*(t+1)/2);
return 0;
} | #include<bits/stdc++.h>
int main(){
int n;
std::cin>>n;
std::vector<int> v(n);
for(int i=0;i<n;i++){
std::cin>>v[i];
}
long long ans=0;
int cur=0;
for (int i=0;i<n;i++){
ans+=(v[i]+cur)/2;
if (v[i]!=0)
cur=(v[i]+cur)%2;
else
cur=0;
}
std::cout<<ans<<"\n";
return 0;
} | 0 | 36,763,022 |
#include<bits/stdc++.h>
#define IL inline
#define _ 1005
#define ll long long
using namespace std ;
IL ll gi(){
ll data = 0 , m = 1; char ch = 0;
while(ch!='-' && (ch<'0'||ch>'9')) ch = getchar();
if(ch == '-'){m = 0 ; ch = getchar() ; }
while(ch >= '0' && ch <= '9'){data = (data<<1) + (data<<3) + (ch^48) ; ch = getchar(); }
return (m) ? data : -data ;
}
ll X[_],Y[_],dis[_],n,m,mx[_],my[_] ;
vector<ll>Arm ;
vector<char>Ans[_] ;
namespace cpp300{
IL void main() {
if(!(dis[1]&1)) {
m = 40 ;
cout << m << endl ;
for(int i = 1; i <= m; i ++) putchar('1'),putchar(' ') ; puts("") ;
for(int i = 1,stp = 0; i <= n; i ++) {
stp = m ;
if(X[i] < 0) while(X[i] != 0) putchar('L') , X[i] ++ , -- stp ;
if(X[i] > 0) while(X[i] != 0) putchar('R') , X[i] -- , -- stp ;
if(Y[i] < 0) while(Y[i] != 0) putchar('D') , Y[i] ++ , -- stp ;
if(Y[i] > 0) while(Y[i] != 0) putchar('U') , Y[i] -- , -- stp ;
for(int j = 1; j <= stp / 2; j ++) putchar('U') , putchar('D') ;
puts("") ;
}
}
else if(dis[1] & 1) {
m = 39 ;
cout << m << endl ;
for(int i = 1; i <= m; i ++) putchar('1'),putchar(' ') ; puts("") ;
for(int i = 1,stp = 0; i <= n; i ++) {
stp = m ;
if(X[i] < 0) while(X[i] != 0) putchar('L') , X[i] ++ , -- stp ;
if(X[i] > 0) while(X[i] != 0) putchar('R') , X[i] -- , -- stp ;
if(Y[i] < 0) while(Y[i] != 0) putchar('D') , Y[i] ++ , -- stp ;
if(Y[i] > 0) while(Y[i] != 0) putchar('U') , Y[i] -- , -- stp ;
for(int j = 1; j <= stp / 2; j ++) putchar('U') , putchar('D') ;
puts("") ;
}
}
return ;
}
}
namespace cpp600{
IL void main() {
m = 0 ;
if(dis[1] % 2 == 0) {
for(int i = 1; i <= n; i ++) {
Ans[i].push_back('R') ; X[i] -- ;
}
m ++ ; Arm.push_back(1) ;
}
for(int i = 1; i <= n; i ++) X[i] = 2ll * X[i] , Y[i] = 2ll * Y[i] ;
for(int i = 1; i <= n; i ++) {
ll x = X[i] , y = Y[i] ;
X[i] = x + y ; Y[i] = x - y ;
X[i] >>= 1 ; Y[i] >>= 1 ;
}
m += 34 ;
for(int i = 1; i <= 34; i ++) Arm.push_back(1ll << (i - 1)) ;
for(int i = 1; i <= n; i ++) {
for(int e = 0; e <= 33; e ++) mx[e] = my[e] = 0 ;
for(int e = 33; e >= 0 ; e --) {
if(X[i] <= 0) mx[e] = 1 , X[i] += (1ll<<e) ;
else if(X[i] > 0) mx[e] = -1 , X[i] -= (1ll<<e) ;
}
for(int e = 33; e >= 0 ; e --)
if(Y[i] <= 0) my[e] = 1 , Y[i] += (1ll<<e) ;
else if(Y[i] > 0) my[e] = -1 , Y[i] -= (1ll<<e) ;
for(int e = 0; e <= 33; e ++)
if(mx[e] > 0 && my[e] > 0) Ans[i].push_back('L') ;
else if(mx[e] < 0 && my[e] < 0) Ans[i].push_back('R') ;
else if(mx[e] > 0 && my[e] < 0) Ans[i].push_back('D') ;
else if(mx[e] < 0 && my[e] > 0) Ans[i].push_back('U') ;
}
cout << m << endl ;
for(int i = 0; i < m; i ++) cout << Arm[i] << " " ;cout << endl ;
for(int i = 1; i <= n; i ++) {
for(int j = 0; j < m; j ++) cout << Ans[i][j] ;
cout << endl ;
}
return ;
}
}
int main() {
n = gi() ;
bool flag = true ;
for(int i = 1; i <= n; i ++) {
X[i] = gi() , Y[i] = gi() ;
if(!(-10 <= X[i] && X[i] <= 10)) flag = false ;
if(!(-10 <= Y[i] && Y[i] <= 10)) flag = false ;
}
for(int i = 1; i <= n; i ++) dis[i] = abs(X[i]) + abs(Y[i]) ;
for(int i = 2; i <= n; i ++) if((dis[i]&1) != (dis[1]&1)) {puts("-1") ; return 0 ;}
cpp600::main() ;
return 0 ;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
int type_one(int h, int w) {
int a = h / 3;
int mi = a * w;
if (h % 3) a++;
int ma = a * w;
return ma - mi;
}
int type_two(int h, int w) {
int a = w / 3 + (w % 3 == 2);
vector<int> v(3);
v[0] = a * h;
v[1] = (w - a) * (h / 2);
v[2] = (w - a) * (h / 2 + h % 2);
sort(all(v));
return v[2] - v[0];
}
void solve() {
int h, w;
cin >> h >> w;
cout << min(min(type_one(w, h), type_one(h, w)), min(type_two(w, h), type_two(h, w))) << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) solve();
} | 0 | 28,321,591 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int N,A,B; cin>>N;
ll ret=0;
vector<ll> X(N);
for (int i=0; i<N; i++)
cin>>A>>B, ret-=B, X[i]=A+B;
sort(X.rbegin(),X.rend());
for (int i=0; i<N; i+=2)
ret+=X[i];
cout<<ret<<"\n";
return 0;
} | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<queue>
int n;
int a[105][105];
std::queue<int>S;
int dis[105];
int color[105];
void bfs(int k){
int i;
for(i=1;i<=n;i++){
if(i!=k&& a[k][i]==1 &&color[i]==0){
S.push(i);
dis[i]=dis[k]+1;
color[i]=1;
}
}
}
int main(){
scanf("%d",&n);
int i,j;
for(i=1;i<=n;i++)for(j=1;j<=n;j++)a[i][j]=0;
for(i=1;i<=n;i++){
int p,k,q;
scanf("%d %d",&p ,&k);
for(j=1;j<=k;j++){
scanf("%d",&q);
a[p][q]=1;
}
}
for(i=1;i<=n;i++)dis[i]=-1;
dis[1]=0;
for(i=1;i<=n;i++)color[i]=0;
S.push(1);
color[1]=1;
while(!S.empty()){
int front=S.front();
S.pop();
bfs(front);
}
for(i=1;i<=n;i++){
printf("%d %d\n",i,dis[i]);
}
return 0;
} | 0 | 98,446,638 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int n;
string s;
cin >> n >> s;
map<char, int> memo;
rep(i, s.size()) memo[s[i]]++;
ll ans = 1;
for(auto x : memo) {
ans *= (x.second + 1);
ans %= MOD;
}
ans--;
cout << ans << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define uint unsigned long long
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define vpii vector<pii>
#define umpii unordered_map<int,int>
#define ustii unordered_set<int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 10000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define endl "\n"
#define all(x) x.begin(), x.end()
#define all_r(x) x.rbegin(), x.rend()
#define sortall(x) sort(all(x))
#define sortall_r(x) sort(all_r(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI acos(-1)
#define w(t) int t; cin>>t; while(t--)
#define for_f(a,b,c) for(int i=a;i<=b;i=i+c)
#define for_r(a,b,c) for(int i=a;i>=b;i=i-c)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define trace1(x) cout << '>' << #x << ':' << (x) << "\n"
#define trace2(x,y) cout<< '>' << #x << ':' << (x) << " | " << #y << ':' << (y) << "\n"
#define trace3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define trace4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
void ash_god()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("i.txt", "r", stdin);
freopen("o.txt", "w", stdout);
#endif
}
void solve() {
int n; cin>>n; int a[n+1]={0};
int k,d,x; cin>>k;
for_f(1,k,1) {
cin>>d;
for_f(1,d,1) {
cin>>x;
a[x]++;
}
}
int res=0;
for_f(1,n,1) {
if(a[i]==0) res++;
}
cout<<res;
}
int32_t main()
{
ash_god();
bool tc=0;
if(tc) {
w(t) solve();
}
else solve();
return 0;
} | 0 | 63,889,808 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n,u,k;
int ad;
int arr[200][200] = {0};
scanf("%d",&n);
for(int i=0;i<n;i++){
cin >> u >> k;
for(int i=0;i<k;i++){
cin >> ad;
arr[u][ad] = 1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cout << arr[i][j];
if(j != n)cout << " ";
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n; cin >> n;
long long ans = 0;
if(n%2 == 0){
n /= 2;
while(n){
ans += n/5;
n /= 5;
}
}
cout << ans << endl;
} | 0 | 100,494,579 |
#include <bits/stdc++.h>
using namespace std;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; i++)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; i--)
#define vi vector<int>
#define vs vector<string>
#define all(x) (x).begin(),(x).end()
int main() {
int n,m;
cin >> n;
vs s(n);
repp(i,0,n){
cin >> s[i];
}
cin>> m;
vs t(m);
repp(i,0,m){
cin >> t[i];
}
vi cnt(n+1,0);
repp(i,0,n){
repp(j,0,n){
if(s[i]==s[j]){
cnt[i]++;
}
}
repp(j,0,m){
if(s[i]==t[j]){
cnt[i]--;
}
}
}
cout<< *max_element(all(cnt)) <<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a;
rep(i,2*n) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
int ans = 0;
rep(i,n) {
ans += min(a[2*i], a[2*i+1]);
}
cout << ans << endl;
} | 0 | 89,188,623 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
long long ans = N-1;
int i = 1;
while (pow(i,2) <= N){
long long M = N/i;
if (i*M == N){
ans = min(ans, M + i - 2);
}
i += 1;
}
cout << ans << endl;
} | #include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
#include<math.h>
#include <functional>
#include<climits>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<(ll)(n); ++i)
#define mod 1000000007
vector<ll>to[1000005];
ll dp[2000000];
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b,a%b));
}
}
int main(){
ll a,b,c=INT_MAX;cin>>a>>b;
if (b-a>=2019)
{
cout<<0;
return 0;
}
for(ll i=a;i<b+1;i++){
for(ll o=i+1;o<b+1;o++){
c=min(c,i%2019*o%2019);
}
}
cout<<c;
} | 0 | 60,571,935 |
#define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1<<n); ++bit)
#define isOne(bit, i) bit & (1<<i)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define add push_back
template<typename T>
std::vector<T> slice(std::vector<T> const &v, int m, int n)
{
auto first = v.cbegin() + m;
auto last = v.cbegin() + n + 1;
std::vector<T> vec(first, last);
return vec;
}
#define remove_unique(v) v.erase(unique(ALL(v)), v.end())
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; }
#define fir first
#define sec second
#define mp make_pair
#define ll long long
#define vec vector
#define cord2d pair<int,int>
#define intP pair<int, int>
template <class T> T get(){ T s; cin >> s; return(s);}
#define gi get<int>()
#define gs get<string>()
#define gll get<ll>()
template <class T> vector<T> getv(int n) { vec<T> v(n); REP(i, n) cin >> v[i]; return v; }
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)
#define gllm(n) getv<ll>(n)
void print(int a){ cout << a << endl; }
void print(long long a){ cout << a << endl; }
void print(string a){ cout << a << endl; }
void print(char a){ cout << a << endl; }
void print(double a){ cout << a << endl; }
void print(double a, int dig){ cout << std::setprecision(dig) << a << endl; }
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
template <class T = int>
void print(vec<T> v){ cout << v << endl; }
template <class T = int>
void print2dVec(vec<vec<T>> v2d){for(vec<T> v: v2d) {print(v);}}
void YesNo1(bool i = true){ return print(i?"Yes":"No"); }
void YESNO2(bool i = true){ return print(i?"YES":"NO"); }
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") { cout << string(" ", nest) << before; print(var); }
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__
#define lamb(exp) [](auto i){return exp;}
#define isEven [](int i){return i % 2 == 0;}
#define isOdd [](int i){return i % 2 != 0;}
const ll INF = 1e18;
const int MOD = 1000000007;
int factorial(int k){ int sum = 1; for (int i = 1; i <= k; ++i) { sum *= i; } return sum; }
ll gcd(ll a, ll b) { if (b == 0) { return a; } return gcd(b, a % b); }
ll lcm(ll a, ll b) { ll temp = gcd(a, b); return temp ? (a / temp * b) : 0; }
int dx[2] = {1, 0};
int dy[2] = {0, 1};
vec<vec<int>> counter;
int h,w;
void doDP(vector<vector<char>> &G, int x, int y) {
REP(i,2) {
int newX = x + dx[i];
int newY = y + dy[i];
if (!(0 <= newX && newX < w && 0 <= newY && newY < h)) continue;
if (G[y][x] == '.' && G[newY][newX] == '#') {
chmin(counter[newY][newX], counter[y][x] + 1);
} else {
chmin(counter[newY][newX], counter[y][x]);
}
}
}
void Main() {
h = gi;
w = gi;
vec<vec<char>> grid(h);
bool kuronuri = true;
REP(i,h) {
string line = gs;
counter.add({});
REP(j, w) {
grid[i].add(line[j]);
counter[i].add(INT_MAX/2);
if (line[j] == '.') kuronuri = false;
}
}
if (kuronuri) {
print(1);
return;
}
int res = 0;
if (grid[0][0] == '#') {
res++;
}
if (grid[h-1][w-1] == '#') {
res++;
grid[h-1][w-1] = '.';
}
counter[0][0] = 0;
REP(y,h) {
REP(x, w) {
doDP(grid, x, y);
}
}
res += counter[h-1][w-1];
print(res);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
struct UnionFind {
vector<int> par;
vector <ll> siz;
UnionFind(int N) : par(N),siz(N) {
for(int i = 0; i < N; i++){
par[i] = i;
siz[i] = 1;
}
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
if (siz[rx] < siz[ry]) swap(rx, ry);
siz[rx] += siz[ry];
par[ry] = rx;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
ll size(ll x){
return siz[root(x)];
}
};
signed main()
{
gearup;
ll k; cin >> k;
ll mod_50 = k % 50;
int n = 50;
vl a;
rep(i,50-mod_50)a.push_back(49-mod_50);
rep(i,mod_50)a.push_back(50);
rep(i,50)a[i] += k / 50;
out(n);
rep(i,n)out(a[i]);
} | 0 | 84,328,586 |
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+5,mod=1e9+7;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
ll INF=1e18;
ll mn=INF;
ll sum=0;
for(int i=0;i<n;i++)
{
ll x,y;
cin>>x>>y;
sum+=x;
if(x>y) mn=min(mn,y);
}
if(mn==INF) mn=sum;
cout<<sum-mn<<endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
string S[H];
REP(i, H){
cin >> S[i];
}
vector<vector<int>> field(H+2, vector<int>(W+2));
FOR(i, 1, H){
FOR(j, 1, W){
if (S[i-1][j-1] == '#'){
field[i][j] = 1;
}
}
}
int res;
bool flag = true;
FOR(i, 1, H){
FOR(j, 1, W){
res = 0;
if (S[i-1][j-1] == '#'){
res += (field[i][j-1] + field[i][j+1] + field[i-1][j] + field[i+1][j]);
if (res == 0){
flag = false;
}
}
}
}
if (flag == true){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 | 67,113,157 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const int INF = 1e9;
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
int main()
{
long long H;
scanf("%lld", &H);
long long W;
scanf("%lld", &W);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
int x = 0, y = 1;
for (int i = 0; i < H; ++i)
{
if (i >= B)
x = 1, y = 0;
for (int j = 0; j < W; ++j)
{
int n;
if (j < A)
n = x;
else
n = y;
cout << n;
}
cout << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n,m,p;
cin>>n>>m>>p;
if(n==0){
break;
}
m--;
vector<int> x(n);
int sum=0;
for(int i=0;i<n;i++){
cin>>x[i];
sum+=x[i];
}
sum*=100;
double temp=(double)sum;
temp-=temp*((double)p/100.0);
if(x[m]==0){
cout<<0<<endl;
continue;
}
cout<<(int)temp/x[m]<<endl;
}
return 0;
} | 0 | 93,362,572 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
int main(){
LL L, R;
cin >> L >> R;
if(R >= L+2019){
cout << 0 << endl;
return 0;
}
priority_queue<LL, vector<LL>, greater<LL>> que;
for(LL i=L; i<=R; i++){
for(LL j=i+1; j<=R; j++){
LL r1 = i%2019;
LL r2 = j%2019;
que.push((r1*r2)%2019);
}
}
LL ans = que.top();
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
void dout() { cerr << '\n'; }
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
cerr << " " << H;
dout(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << #__VA_ARGS__, dout(__VA_ARGS__)
#else
#define dbg(...) ;
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;
const int N = 305;
const ll inf = 1e18;
int n, k, h[N], m;
ll dp[N][N][N], p[N][N][N], s[N][N][N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
cin >> n >> k;
vector <int> vec;
vec.pb(0);
for (int i = 1; i <= n; i++) {
cin >> h[i];
vec.pb(h[i]);
}
sort(all(vec));
vec.erase(unique(all(vec)), vec.end());
m = vec.size();
memset(& dp, 0x3f, sizeof(dp));
memset(& p, 0x3f, sizeof(p));
memset(& s, 0x3f, sizeof(s));
dp[0][0][1] = 0;
for (int i = 1; i <= m; i++) {
p[0][0][i] = 0;
}
s[0][0][1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
for (int l = 1; l <= m; l++) {
int cost = (vec[l - 1] != h[i]);
if (cost <= j) {
dp[i][j][l] = vec[l - 1] + p[i - 1][j - cost][l - 1];
dp[i][j][l] = min(dp[i][j][l], s[i - 1][j - cost][l]);
}
p[i][j][l] = min(p[i][j][l - 1], dp[i][j][l] - vec[l - 1]);
}
for (int l = m; l >= 1; l--) {
s[i][j][l] = min(s[i][j][l + 1], dp[i][j][l]);
}
}
}
ll res = inf;
for (int i = 0; i <= k; i++) {
for (int j = 1; j <= m; j++) {
res = min(res, dp[n][i][j]);
}
}
cout << res;
} | 0 | 100,752,782 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define ceiv(a, b) ((int)((a) + (b) - 1)/(int)(b))
signed main(){
int n, m;
cin >> n >> m;
vector<intpair> a(n);
rep(i,n) cin >> a[i].first >> a[i].second;
sort(ALL(a));
auto it = a.begin();
priority_queue<int> q;
ll ans = 0;
reps(i,1,m){
while(it != a.end()){
if(it->first != i) break;
q.push(it->second);
it++;
}
if(!q.empty()){
ans += q.top();
q.pop();
}
}
cout << ans << endl;
} | #include <queue>
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MP make_pair
#define ll long long
#define fi first
#define se second
using namespace std;
template <typename T>
void read(T &x) {
x = 0; bool f = 0;
char c = getchar();
for (;!isdigit(c);c=getchar()) if (c=='-') f=1;
for (;isdigit(c);c=getchar()) x=x*10+(c^48);
if (f) x=-x;
}
template<typename F>
inline void write(F x, char ed = '\n') {
static short st[30];short tp=0;
if(x<0) putchar('-'),x=-x;
do st[++tp]=x%10,x/=10; while(x);
while(tp) putchar('0'|st[tp--]);
putchar(ed);
}
template <typename T>
inline void Mx(T &x, T y) { x < y && (x = y); }
template <typename T>
inline void Mn(T &x, T y) { x > y && (x = y); }
const int N = 2005;
ll len[N], x[N], y[N], cnt, n;
inline ll jue(ll x) { return x > 0 ? x : -x; }
int main() {
read(n);
for (int i = 1;i <= n; i++) {
read(x[i]), read(y[i]);
int t = (x[i] + y[i]) & 1;
t ^= (x[1] + y[1]) & 1;
if (t) { puts("-1"); return 0; }
}
if (!((x[1] + y[1]) & 1)) len[++cnt] = 1;
write(cnt + 33);
for (int i = 0;i <= 32; i++) len[++cnt] = 1ll << i;
for (int i = cnt;i ; i--) write(len[i], ' ');
puts("");
for (int i = 1;i <= n; i++) {
ll dx = 0, dy = 0;
for (int j = cnt;j >= 1; j--) {
ll tx = jue(x[i] - dx), ty = jue(y[i] - dy);
if (tx >= ty) {
if (x[i] > dx) { putchar('R'); dx += len[j]; }
else { putchar('L'); dx -= len[j]; }
}
else {
if (y[i] > dy) { putchar('U'); dy += len[j]; }
else { putchar('D'); dy -= len[j]; }
}
}
puts("");
}
return 0;
} | 0 | 68,161,165 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int a,b;
cin >> a >> b;
if (a * b == 15) {
cout << "*" << endl;
} else if (a + b == 15) {
cout << "+" << endl;
} else {
cout << "x" << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
const int MAX = 100000;
const int INF = 1<<29;
vector<int> G[MAX];
list<int> out;
int n;
bool V[MAX];
int indeg[MAX];
void bfs(int s){
queue<int>q;
q.push(s);
V[s]=true;
while(!q.empty()){
int u=q.front();q.pop();
out.push_back(u);
r(i,G[u].size()){
int v=G[u][i];
indeg[v]--;
if(!indeg[v]&&!V[v]){
V[v]=true;
q.push(v);
}
}
}
}
void Tsort(){
r(u,n)r(i,G[u].size())indeg[G[u][i]]++;
r(u,n)if(!indeg[u]&&!V[u])bfs(u);
for(list<int>::iterator it=out.begin();it!=out.end();it++)
cout<<*it<<endl;
}
int main(){
int s,t,m;
cin>>n>>m;
r(i,m){
cin>>s>>t;
G[s].push_back(t);
}
Tsort();
} | 0 | 83,015,786 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include <iomanip>
#include<utility>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
#define S 21
llfor;ll mod=1000000007;
double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll ans=1;rep(i,0,n){ans*=x;ans%=mod;}return ans;}
ll fact(ll x){ll ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){ll ans=1,l=2;rep(i,0,min(n-r,r)){ans*=(n-i);while(ans%l==0&&l<=min(r,n-r)){ans/=l;l++;}}return ans;}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=1,tmp=n;while(tmp/10>0){tmp/=10;d++;}return d;}
void matcpy(ll a[S][S],ll b[S][S]){ll t=i;rep(i,0,S)rep(j,0,S)b[i][j]=a[i][j];i=t;}
void matrst(ll a[S][S]){ll t=i;rep(i,0,S)rep(j,0,S)a[i][j]=0;i=t;}
void matpow(ll a[S][S]){ll ans[S][S];matrst(ans);ll t=i,k;rep(i,0,S)rep(j,0,S)rep(k,0,S)ans[i][j]+=a[i][k]*a[k][j];matcpy(ans,a);i=t;}
void matmul(ll a[S][S],ll b[S][S], ll as[S][S]){ll t=i,k;matrst(as);rep(i,0,S)rep(j,0,S)rep(k,0,S)as[i][j]+=a[i][k]*b[k][j];i=t;}
int main(){
ll n;
cin>>n;
ll ans=0;
for(i=1;i*i<n;i++){
if(!(n%i)&&n/i!=i+1)ans+=(n/i-1);
}
pr(ans);
return 0;} | #include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <cstdlib>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
unordered_map<ll, vector<ll>> x;
for (ll i = 1; i <= n; i++) {
x[i] = vector<ll>();
}
ll a, b;
for (ll i = 0; i < m; i++) {
cin >> a >> b;
x[a].push_back(b);
x[b].push_back(a);
}
bool reached = false;
for (ll i = 0; i < x[1].size(); i++) {
if (find(x[x[1][i]].begin(), x[x[1][i]].end(), n) == x[x[1][i]].end()) {
continue;
}
else {
reached = true;
break;
}
}
if (reached) {
cout << "POSSIBLE" << endl;
}
else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
} | 0 | 29,478,528 |
#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 endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int cnt[4] = {0};
rep(i, 3){
int a, b;
cin >> a >> b;
cnt[a-1]++;
cnt[b-1]++;
}
if(cnt[0] == 1 && cnt[1] == 2 && cnt[2] == 2 && cnt[3] == 1){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
return 0;
} | #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++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main() {
string s; cin >> s;
reverse(s.begin(),s.end());
vector<string> d = {"maerd", "remaerd", "esare", "resare"};
ll p = 0; bool match;
rep(i, s.size()){
rep(j, 4){
match = false;
if(s.substr(p, d[j].size()) == d[j]){
p += d[j].size();
match = true;
break;
}
}
if(!match){
cout << "NO" << endl;
return 0;
}
if(p == s.size())
break;
}
cout << "YES" << endl;
} | 0 | 94,234,062 |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main(){
ll x,y,z;
cin>>x>>y;
z=y;
for(int w=1;w<x;w++) z*=y-1;
cout<<z<<endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<50;
#define Pint pair<int, int>
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rnr(i,a,b) for(int i=int(a);i>=int(b);i--)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
int main() {
int N, M, R; cin >> N >> M >> R;
int r[R];
rep(i, R) cin >> r[i], --r[i];
int A[M], B[M], C[M];
vector<vector<ll>>G(N, vector<ll>(N, LLINF));
rep(i, M) {
cin >> A[i] >> B[i] >> C[i];
G[--A[i]][--B[i]] = C[i];
G[B[i]][A[i]] = C[i];
}
rep(i, N)
G[i][i] = 0;
for(int k = 0; k < N; ++k) {
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N; ++j) {
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
}
}
}
ll ans = LLINF;
sort(r, r + R);
do{
ll sum = 0;
int prev = r[0];
for(int v : r) {
sum += G[v][prev];
prev = v;
}
ans = min(ans, sum);
}while(next_permutation(r, r + R));
cout << ans << endl;
} | 0 | 49,867,901 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
int n, a;
cin >> n >> a;
cout << n*n - a << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(xi, x) for (auto &&xi : x)
template <class T> using vec = vector<T>;
using ll = long long;
using vi = vec<ll>;
using vvi = vec<vi>;
using vvvi = vec<vvi>;
using pii = pair<ll, ll>;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))
template <class T> pair<T, size_t> max(vector<T> &x) {
auto it = max_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> pair<T, size_t> min(vector<T> &x) {
auto it = min_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> inline bool chmax(T &maxval, const T &newval) {
if (maxval < newval) {
maxval = newval;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &minval, const T &newval) {
if (minval > newval) {
minval = newval;
return 1;
}
return 0;
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define inside(H, W, y, x) 0 <= (x) && (x) < (W) && 0 <= (y) && (y) < (H)
#ifdef LOCAL
#include "dump.hpp"
#define debug(x) cerr << #x << ": " << x << '\n'
#else
#define dump(...)
#define debug(x)
#endif
void solve(std::string S, std::string T, long long A, long long B,
std::string U) {
if(S==U) cout << A-1 << " " << B << endl;
else cout << A << " " << B-1 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::string S;
std::cin >> S;
std::string T;
std::cin >> T;
long long A;
std::cin >> A;
long long B;
std::cin >> B;
std::string U;
std::cin >> U;
solve(S, T, A, B, U);
return 0;
} | 0 | 59,071,828 |
#include"bits/stdc++.h"
#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 all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, cnt = 0;
cin >> n;
REP(i, n)cnt+=i;
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932
#define rep(i, n) for (int i = 0; i < n; i++)
#define repe(i, j, n) for (int i = j; i < n; i++)
#define repi(i, n) for (int i = 0; i <= n; i++)
#define repie(i, j, n) for (int i = j; i <= n; i++)
#define all(x) x.begin(), x.end()
#define println() cout << endl
#define P pair<int, int>
#define fi first
#define se second
typedef long long ll;
long long modinv(long long a, long long m)
{
long long b = m, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
void solve1()
{
ll n; cin >> n;
ll ans = 0;
ll div = 2;
if(n%2 == 0) {
while(1) {
div *= 5;
if (n / div <= 0)
{
break;
} else {
ans += n/div;
}
}
}
cout << ans << endl;
}
int main()
{
solve1();
} | 0 | 82,404,200 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265358979;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,m,k;
cin >> n >> m >> k;
bool ans = false;
for (ll i = 0; i <= n; i++){
for (ll j = 0; j <= m; j++){
ll b = m*i + n*j - 2*i*j;
if (k == b){
ans = true;
goto out;
}
}
}
out:
YesNo(ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
vector<pair<int, int>> ans;
for (int i = 1; i < n - 1; i++){
if(a[i] > 0){
ans.emplace_back(a[0], a[i]);
a[0] -= a[i];
} else {
ans.emplace_back(a[n - 1], a[i]);
a[n - 1] -= a[i];
}
}
ans.emplace_back(a[n - 1], a[0]);
cout << a[n - 1] - a[0] << endl;
for(auto p : ans){
cout << p.first << " " << p.second << endl;
}
} | 0 | 15,803,764 |
#include"bits/stdc++.h"
#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 all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
double sum = 0.0;
cin >> n;
vector<double>v(n);
rep(i, n)cin >> v[i];
sort(all(v));
sum =( v[0] + v[1] ) / 2;
for (int i = 2; i < n;i++) {
sum = (sum + v[i]) / 2;
}
cout << fixed << setprecision(8) << sum << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> P;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
const int MAXN = 100000;
const int MAXE = 100000;
const int MAXV = 10000;
const int inf = 1e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
struct UnionFind{
vector<int> par,rank;
UnionFind(int n):par(n),rank(n){
for(int i=0;i<n;++i) par[i]=i;
}
int root(int x){
if(par[x]==x) return x;
return par[x]=root(par[x]);
}
void unite(int x,int y){
int rx=root(x),ry=root(y);
if(rx==ry) return ;
if(rank[ry]>rank[rx]) par[rx]=ry;
else par[ry]=rx;
if(rank[rx]==rank[ry]) rank[rx]++;
}
bool same(int x,int y){
return root(x)==root(y);
}
};
vector<ll> fac,inv,finv;
void initcom(){
fac=inv=finv=vector<ll>(1e6);
fac[0]=fac[1]=1;
inv[1]=1;
finv[0]=finv[1]=1;
for(ll i=2;i<1e6;++i){
fac[i]=fac[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
finv[i]=finv[i-1]*inv[i]%MOD;
}
}
ll com(int n,int k){
if(n<0||k<0) return 0;
if(n<k) return 0;
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
ll mopow(ll a,ll x,ll mod){
ll res=1;
while(x>0){
if(x&1) res=res*a%mod;
a=a*a%mod;
x>>=1;
}
return res;
}
int main(){
ll s;cin>>s;
ll x1=s/(ll)1e9+(s%(ll)1e9==0?0:1);
ll x2=x1*(ll)1e9-s;
cout<<0<<' '<<0<<' '<<x1<<' '<<1<<' '<<x2<<' '<<1000000000<<endl;
return 0;
} | 0 | 75,180,569 |
#include<iostream>
#include<queue>
#include<bitset>
#include<algorithm>
#include<climits>
#include<vector>
#include<deque>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define fill(x,y) memset(x,y,sizeof(x))
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define dump(a) rep(i,a.size()){ cout<<a[i]<<" "; } cout<<endl;
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define INF INT_MAX/3
#define EPS 1e-7
int main(){
ll n,m;
ll x[100001];
ll y[100001];
cin>>n>>m;
const ll B = 1e9+7;
ll s=0,t=0;
rep(i,n){
cin>>x[i];
s = (s + x[i]*(2*i-n+1))%B;
}
rep(i,m){
cin>>y[i];
t = (t + y[i]*(2*i-m+1))%B;
}
cout<<(s*t)%B<<endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323;
long long int N,X,M,K,res=0,A[200200];
long long int H,W,PB[55]={1},P[55]={1};
bool usedH[102]={},usedW[102]={};
string str[102];
int main()
{
cout << fixed << setprecision(18);
cin>>N>>X;
for(long long int i = 1; i <= 50; i++){
P[i]=2*+P[i-1]+1;
PB[i]=2*PB[i-1]+3;
}
long long int now=N-1;
while(1){
X--;
if(X<=0){break;}
if(PB[now]<=X){res+=P[now];X-=PB[now];}
else{now--;continue;}
if(X<=0){break;}
X--;
res++;
if(X<=0){break;}
if(PB[now]<=X){res+=P[now];X-=PB[now];break;}
else{now--;continue;}
}
cout<<res<<endl;
} | 0 | 27,769,276 |
#include <iostream>
using namespace std;
int main() {
int R, G, T;
cin >> R;
cin >> G;
T = (2 * G) - R;
cout << T << endl;
} | #include <atcoder/all>
using namespace std;
using namespace atcoder;
int main()
{
int n, q;
cin >> n >> q;
dsu uf(n);
for(int i = 0; i < q; i++)
{
int t, u, v;
cin >> t >> u >> v;
if(t == 0)
{
uf.merge(u, v);
}
else
{
if(uf.same(u, v)) cout << 1 << endl;
else cout << 0 << endl;
}
}
} | 0 | 81,075,783 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <regex>
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,j,n) for(int i = j; i < n; i++)
#define rrep(i,j,n) for(int i = j-1; i >= n; i--)
#define prec(n) fixed << setprecision(n)
#define print_array(v) rep(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
#define YesorNo(a) printf(a?"Yes\n":"No\n")
#define fi first
#define se second
#define endl "\n"
using namespace std;
constexpr int inf = 2147483647;
constexpr int64_t inf64 = 9223372036854775807;
constexpr int mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
map<int, int> nums;
rep(i,n) {
int a;
cin >> a;
nums[a]++;
}
int res = -1;
rep(i,100001) {
res = max(res, nums[i-1]+nums[i]+nums[i+1]);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef long int li;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, ll>P;
typedef tuple<double,ll,ll>T;
#define PI 3.14159265358979
#define MOD 1000000007
int main(){
ll X,Y,Z,K;
cin>>X>>Y>>Z>>K;
vector<ll>A(X);
vector<ll>B(Y);
vector<ll>C(Z);
rep(i,X){cin>>A[i];}
rep(i,Y){cin>>B[i];}
rep(i,Z){cin>>C[i];}
priority_queue<ll>dai;
rep(i,X){
rep(j,Y){
ll p=A[i]+B[j];
dai.push(p);
}
}
vector<ll>F;
int g=0;
while(!dai.empty()){
ll q=dai.top();dai.pop();
F.push_back(q);
g++;
if(g==K){break;}
}
priority_queue<ll>sum;
rep(i,F.size()){
rep(j,Z){
ll r=F[i]+C[j];
sum.push(r);
}
}
ll ans=0;
rep(i,K){
ll s=sum.top();sum.pop();
cout<<s<<endl;
}
} | 0 | 97,547,760 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N=2e5+10;
const int mod=1e9+7;
int a[505];
int b[505];
int main()
{
int n,k;
cin>>n>>k;
int ans=-inf;
for(int i=1; i<=n; i++)
{
cin>>a[i];
}
for(int l=0; l<=n; l++)
{
for(int r=n+1; r>l; r--)
{
int cnt=0,sum=0;
for(int i=1; i<=l; i++)
{
b[++cnt]=a[i];
}
for(int i=n; i>=r; i--)
{
b[++cnt]=a[i];
}
if(k<cnt)
continue;
sort(b+1,b+1+cnt);
for(int i=cnt; i>=0; i--)
{
if(i<=k-cnt)
sum+=max(b[i],0);
else
sum+=b[i];
}
ans=max(ans,sum);
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
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; }
ll n;
vector<ll> a;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll ans=0;
for (int i = 0; i < n; i++)
{
ll temp;
cin >> temp;
a.push_back(temp);
}
ans=a[0]-1;
ll maxs=2;
for(int i=1;i<n;i++){
ans+=(a[i]-1)/maxs;
if((a[i]-1)/maxs==0){
chmax(maxs,a[i]+1);
}
}
cout << ans << "\n";
} | 0 | 35,665,214 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using ve = vector<T>;
template<typename T> using pq2 = priority_queue<T>;
template<typename T> using pq1 = priority_queue<T,vector<T>,greater<T>>;
int main()
{
int N,A,B;
cin >> N >> A >> B;
vi P(N);
in(N,P);
vi a(3,0);
rep(i,N){
if(P[i] <= A) a[0]++;
else if(P[i] <= B) a[1]++;
else a[2]++;
}
sort(all(a));
cout << a[0] << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, n) for (int i = a; i <= (n); ++i)
int main() {
int H, W; cin >> H >> W;
vector<string> S(H); rep(i, H) cin >> S[i];
const int di[4] = {-1, 0, 0, 1};
const int dj[4] = {0, -1, 1, 0};
int all_ok = true;
rep(i, H) {
rep(j, W) {
if (S[i][j] == '#') {
int ok = false;
rep(k, 4) {
int ni = i + di[k];
int nj = j + dj[k];
if (ni < 0 || ni >= H) continue;
if (nj < 0 || nj >= W) continue;
if (S[ni][nj] == '#') ok = true;
}
if (!ok) all_ok = false;
}
}
}
if (all_ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 0 | 19,528,872 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
ll a,b;
cin >> a >> b;
ll ans = 0;
while(a <= b){
a *= 2;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0;
std::cin >> n;
std::string r = "No";
int cakes = 0;
while (1) {
const int cakes_cost = cakes * 4;
const int donuts_cost = n - (cakes_cost);
if (donuts_cost < 0)
break;
if (donuts_cost % 7 == 0) {
r = "Yes";
break;
}
++cakes;
}
std::cout << r << std::endl;
return 0;
} | 0 | 24,950,753 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 100010
const int mod=998244353;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,d[N],cnt[N],ans;
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=1LL*ans*a%mod;
a=1LL*a*a%mod;
b>>=1;
}
return ans;
}
int main(){
n=read();
for(int i=1;i<=n;++i){
d[i]=read();
++cnt[d[i]];
}
if(d[1]||cnt[0]^1)return !printf("0\n");
ans=1;
for(int i=1;i<n;++i){
ans=1LL*ans*qpow(cnt[i-1],cnt[i])%mod;
}
printf("%d\n",ans);
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[])
{
int n, a, b;
string str, command, buff;
cin >> str >> n;
while (n--)
{
cin >> command >> a >> b;
if (command == "print")
{
cout << str.substr(a, b - a + 1) << endl;
}
else if (command == "reverse")
{
string sub = str.substr(a, b - a + 1);
reverse(sub.begin(), sub.end());
str = str.substr(0, a) + sub + str.substr(b + 1);
}
else if (command == "replace")
{
cin >> buff;
str.replace(a, b - a + 1, buff);
}
}
return 0;
} | 0 | 95,502,228 |
#include<bits/stdc++.h>
typedef long long int lli;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,i;
cin>>n;
lli a[n],l;
cin>>l;
for(i=0;i<n;i++){
cin>>a[i];
}
int val=0;
int nonbreak=0;
for(i=0;i<n-1;i++){
if((a[i]+a[i+1])>=l){
val=1;
nonbreak=i+1;
break;
}
}
if(val==0) {cout<<"Impossible\n";}
else{
cout<<"Possible\n";
for(i=1;i<nonbreak;i++){
cout<<i<<"\n";
}
for(i=n-1;i>=nonbreak;i--){cout<<i<<"\n";}
}
return 0;
} | #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() {
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) {
if(s[i] == 'x') {
cnt++;
}
}
if(cnt < 8) {
cout << "YES";
}
else {
cout << "NO";
}
cout << endl;
return 0;
} | 0 | 2,445,096 |
#include <iostream>
using namespace std;
int main () {
int n,max,min,i;
long long sum;
int date[10001] ={0};
cin >> n;
for( i=0 ; i<n ; i++){
cin >> date[i];
}
max=date[0];
min=date[0];
sum=date[0];
for( i=1 ; i<n ; i++ ){
if( max<date[i] )
max=date[i];
if( min>date[i] )
min=date[i];
sum+=date[i];
}cout << min <<" "<< max <<" "<< sum << endl;
return 0;
} | #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; return 1; } return 0; }
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main(){
int x,n,m=101,ans=0;
cin >> x >> n;
int p[n];
rep(i,n)cin >> p[i];
int num[100];
rep(i,102)num[i] = i;
for(int i=0;i<n;i++){
num[p[i]]=-1;
}
for(int i=0;i<102;i++){
if(num[i]!=-1){
int tem = abs(num[i]-x);
if(tem<m){
m=tem;
ans = i;
}
}
}
cout << ans << endl;
return 0;
} | 0 | 38,481,192 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define MOD 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 200009
#define M 1e6+9
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define endl "\n"
#define int long long
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
ll lcm(ll a, ll b) { return (a*b)/ gcd(a,b);}
int sum[N];
void test_case() {
int n, d, a;
cin>>n>>d>>a;
vector<pii> arr(n);
rep(i,n) {
cin>>arr[i].first >> arr[i].second;
}
sort(all(arr));
int dp[N];
for(int i=0; i<n; i++) {
int re = 2*d + arr[i].first;
pii temp = mpr(re, LONG_MAX);
auto it = upper_bound(all(arr),temp);
dp[i] = it - arr.begin();
}
int ans =0;
int num =0;
for(int i=0; i<n; i++) {
num+= sum[i];
if(arr[i].second - num >= 0) {
int co = ((arr[i].second - num) + a - 1)/a;
ans+= co;
num+= co*a;
sum[dp[i]] -= co*a;
}
}
cout<<ans<<endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while(t--)
{
test_case();
}
} | #include<iostream>
#include<math.h>
#include<stdlib.h>
using namespace std;
int used[27],number[27];
int cnt=1;
int ln;
int n,aa=-1,bb=-1,a[10],b[10];
bool compare(int c[],int d[]){
for(int i=1;i<=n;i++) {
if(c[i]!=d[i]) return false;
}
return true;
}
void permutation(int at,int n){
if(at==n+1){
string s="";
if(compare(number,a)) aa=cnt;
if(compare(number,b)) bb=cnt;
cnt++;
return;
}
for(int i=1;i<=n;i++){
if(!used[i]){
used[i]=1;
number[at]=i;
permutation(at+1,n);
used[i]=0;
}
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>b[i];
permutation(1,n);
cout<<abs(aa-bb);
} | 0 | 3,137,389 |
#include <iostream>
using namespace std;
int main()
{
int count;
int num;
while(cin >> num)
{
count = 0;
for(int a = 0; a < 10 && a <= num; ++a)
for(int b = 0; b < 10 && a + b <= num; ++b)
for(int c = 0; c < 10 && a + b + c <= num; ++c)
for(int d = 0; d < 10 && a + b + c + d <= num; ++d)
if(a + b + c + d == num) count++;
cout << count << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
const int MX_N = 1e5+5;
int N, M;
vector<int> al[MX_N];
int col[MX_N];
bool rip;
void dfs(int u, bool c=0) {
col[u] = c;
for (int v : al[u]) {
if (col[v] == -1) dfs(v,!c);
else if (col[v] == col[u]) rip = 1;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
FOR(i,1,M){
int U, V; cin >> U >> V;
al[U].push_back(V);
al[V].push_back(U);
}
long long ans = 0;
int p = 0, q =0, r=0;
memset(col,-1,sizeof col);
FOR(i,1,N) if (col[i] == -1){
if (SZ(al[i]) == 0) ans += 2*(N-r)-1, ++r;
else {
rip = 0; dfs(i);
if (rip) ++p;
else ++q;
}
}
ans += 1LL*p*p + 1LL*p*q + 1LL*q*p + 2LL*q*q;
cout << ans;
} | 0 | 90,407,563 |
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second
#define INF 2147483600
class UnionFind {
public:
vector<int> par, rank, sizes;
UnionFind(int sz) : par(sz), rank(sz, 0), sizes(sz, 1){
rep(i,sz) par[i]=i;
}
int find(int x){
if(par[x]==x) return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y){
x=find(x);
y=find(y);
if(x==y) return;
if(rank[x] < rank[y]){
par[x] = y;
sizes[y] += sizes[x];
} else {
par[y]=x;
if(rank[x]==rank[y]) rank[x]++;
sizes[x] += sizes[y];
}
}
bool same(int x, int y){
return find(x) == find(y);
}
int size(int x){
return sizes[find(x)];
}
};
int main(){
int n,q;
cin>>n>>q;
UnionFind uf(n);
rep(i,q){
int c,x,y;
scanf("%d %d %d", &c, &x, &y);
if(c==0) uf.unite(x,y);
else {
if(uf.same(x,y)) printf("1\n");
else printf("0\n");
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
#include <functional>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T>
void quit(T a)
{
cout << a << endl;
exit(0);
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>;
const ll LINF = 10010020030040056ll;
const int INF = 1001001001;
const double pi = acos(-1);
void MergeSort(vector<int> &a, int left, int right)
{
if (right - left == 1)
return;
int mid = (right + left) / 2;
MergeSort(a, left, mid);
MergeSort(a, mid, right);
int i = left;
int j = mid;
vector<int> tmp;
while (true)
{
if (i == mid && j == right)
{
break;
}
else if (i == mid)
{
tmp.push_back(a.at(j));
j++;
continue;
}
else if (j == right)
{
tmp.push_back(a.at(i));
i++;
continue;
}
if (a[i] <= a[j])
{
tmp.push_back(a.at(i));
i++;
}
else
{
tmp.push_back(a.at(j));
j++;
}
}
for (int i1 = left; i1 < right; i1++)
{
a.at(i1) = tmp.at(i1 - left);
}
}
int main()
{
int n, m;
cin >> n >> m;
vector<pair<int, int>> vec(n);
for (int i = 0; i < n; i++)
{
vec[i] = {0, 0};
}
for (int i = 0; i < m; i++)
{
int a;
string s;
cin >> a >> s;
a--;
if (s == "WA" && vec[a].fi == 0)
{
vec[a].se++;
}
else if (s == "WA")
{
continue;
}
else
{
vec[a].fi++;
}
}
int ac = 0;
int wa = 0;
for (int i = 0; i < n; i++)
{
if (vec[i].fi != 0)
{
ac++;
wa += vec[i].se;
}
}
cout << ac << " " << wa << endl;
return 0;
} | 0 | 38,750,469 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, d, x;
cin >> n >> d >> x;
vector<ll> A(n);
for (auto & a : A) cin >> a;
ll res = x;
for (auto a : A) {
res += 1 + ((d-1)/a);
}
cout << res << endl;
} | #include <bits/stdc++.h>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
int main(){
int N, M;
cin >> N >> M;
char A[N][N];
char B[M][M];
rep(i, N)rep(j, N)cin >> A[i][j];
rep(i, M)rep(j, M)cin >> B[i][j];
bool ans = false;
rep(i, max(N-M, 1)){
rep(j, max(N-M, 1)){
bool temp_flag = true;
rep(k, M){
rep(l, M){
if (A[i+k][j+l] != B[k][l]){
temp_flag = false;
}
}
}
if (temp_flag)ans = true;
}
}
if (ans)cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 | 91,608,678 |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int n,b,i,j;
scanf("%d%d",&n,&b);
char s[n+1][b+1];
for(i=0; i<n; i++)
{
scanf("%s",s[i]);
}
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
if(strcmp(s[i],s[j])>0)
{
char tem[b+1];
strcpy(tem,s[i]);
strcpy(s[i],s[j]);
strcpy(s[j],tem);
}
}
}
for(i=0; i<n; i++)
{
printf("%s",s[i]);
}
printf( "\n" ) ;
} | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
char s[101], p[101], loop[201];
scanf("%s", s);
scanf("%s", p);
scanf("%s", loop);
strcpy(loop, s);
strcat(loop, s);
if( strstr(loop, p) == NULL ) printf("No\n");
else printf("Yes\n");
return 0;
} | 0 | 85,488,431 |
#include <iostream>
#include <cmath>
#include <algorithm>
#define rep(i,n) for(int i=0;i< (n);++i)
typedef long long ll;
using namespace std;
const int mod=1000000000+7;
int main() {
int N,M;
cin>>N>>M;
int A[N+1];
for(int i=0;i<=N;++i){
A[i]=1;
}
int a;
int p=-1;
for(int i=1;i<=M;++i){
cin>>a;
if(p==a){cout<<0<<endl;return 0;}
A[a]=0;
p=a;
}
ll d[N+1];
for(int i=0;i<=N;++i){
d[i]=0;
}
d[0]=1;
for(int i=1;i<=N;++i){
if(A[i]==0)continue;
if(i==1){
d[i]=d[i-1];
}else{
d[i]=(d[i-1]+d[i-2])%mod;
}
}
cout<<d[N]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
int64_t ans = 0;
int64_t b_cnt = 0;
rep(i, s.size())
{
if (s[i] == 'W')
{
ans += b_cnt;
}
else
{
b_cnt++;
}
}
cout << ans << endl;
} | 0 | 33,966,910 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define mem(a,val) memset(a,val,sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
using namespace std;
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int s,d,t;
cin>>d>>t>>s;
double x = (double)d / s;
if(x<=t)
cout<<"Yes"<<endl;
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template <class T> void swap(T& a, T& b) { T t = std::move(a); a = std::move(b); b = std::move(t); }
int main(void)
{
ll N, K, i, j, A[2000], in=0, ex=0, ans;
cin >> N >> K;
for(i=0; i<=N-1; i++){
cin >> A[i];
}
for(i=0; i<=N-2; i++){
for(j=i+1; j<=N-1; j++){
if(A[i] > A[j]){
in++;
}
}
}
for(i=0; i<=N-1; i++){
for(j=0; j<=N-1; j++){
if(A[i] > A[j]){
ex++;
}
}
}
ans = (in * K) % div1;
ans += (K*(K-1)/2)%div1 * ex % div1;
ans = ans % div1;
cout << ans << endl;
return 0;
} | 0 | 91,504,344 |
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
#define MAX_V 100010
struct edge {
int to;
long long cost;
};
typedef pair<long long, int> P;
vector<edge> tree[MAX_V];
long long d[MAX_V];
int n;
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + n, INF);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (int i = 0; i < tree[v].size(); i++) {
edge e = tree[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
tree[a].push_back(edge{b, c});
tree[b].push_back(edge{a, c});
}
int q, k;
cin >> q >> k;
dijkstra(k - 1);
for (int i = 0; i < q; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
cout << d[x] + d[y] << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
using Pi = pair<int, int>;
using ll = long long;
const int INF = 1 << 28;
string to_string(string s) {
return s;
}
template <class T>
string to_string(vector<T> v) {
string ret = "{";
for (int i = 0; i < v.size() - 1; ++i) {
ret += to_string(v[i]) + ",";
}
if (v.size() > 0) {
ret += to_string(v.back());
}
ret += "}";
return ret;
}
void debug() {
cerr << endl;
}
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
void get() {}
template <class Head, class... Tail>
void get(Head& head, Tail&... tail) {
cin >> head;
get(tail...);
}
template <class T>
void getv(vector<T>& vec) {
for (int i = 0; i < vec.size(); ++i)
cin >> vec[i];
}
int main() {
int N;
get(N);
vector<int> p(N);
getv(p);
vector<int> a(N), b(N);
FOR(i, N) {
a[i] = (i + 1) * 30000;
b[i] = (N - i) * 30000;
}
FOR(i, N) { a[p[i] - 1] += i; }
FOR(i, N) cout << a[i] << " ";
cout << endl;
FOR(i, N) cout << b[i] << " ";
cout << endl;
return 0;
} | 0 | 45,948,562 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template<typename T> inline string toString(const T &a){
ostringstream oss;
oss << a;
return oss.str();
};
int main(){
int N;
cin >> N;
vector<double> l(N+2),r(N+2),v(N+2);
l[0] = 0.0;
r[0] = 0.0;
v[0] = 0.0;
double T_sum = 0;
for(int i=1; i<=N; i++){
int T;
cin >> T;
l[i] = T_sum;
T_sum += T;
r[i] = T_sum;
}
for(int i=1; i<=N; i++){
cin >> v[i];
}
cerr << T_sum << endl;
l[N+1] = T_sum;
r[N+1] = T_sum;
v[N+1] = 0.0;
double ans = 0.0;
double v_pre = 0.0;
for(double a=0.50; a<=T_sum; a+=0.50){
double v_now = INF;
for(int i=0; i<=N+1; i++){
if(a < l[i]){
chmin(v_now, v[i]+(l[i]-a));
}else if(r[i] < a){
chmin(v_now, v[i]+(a-r[i]));
}else{
chmin(v_now, v[i]);
}
}
ans += 0.2500*(v_pre + v_now);
v_pre = v_now;
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N{};
cin >> N;
vector<int> num(N);
for (size_t i = 0;i < N;++i) {
cin >> num.at(i);
}
size_t i = 0,j=N-1;
int left = num.at(i), right = num.at(j);
while (i!=j) {
if (left >= right) {
j--;
if (i == j) {
break;
}
else {
right += num.at(j);
}
}
else if(left < right){
i++;
if (i == j) {
break;
}
else {
left += num.at(i);
}
}
if (i == j) {
break;
}
}
cout << abs(right - left);
} | 0 | 98,886,390 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
cout << (s == "abc" ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
#define mod 1000000007
int main() {
int n;cin>>n;
int ans=0;
vector<int>a(n);
rep(i,n){
cin>>a[i];
}
for (int i=n-1;i>0;i--) {
if(a[i]==a[i-1]){
a[i-1]=0;
ans++;
}
}
cout<<ans<<endl;
} | 0 | 94,841,337 |
#include <bits/stdc++.h>
typedef long long int ll;
#define pll pair <ll, ll>
#define pii pair <int, int>
#define f first
#define s second
#define pb push_back
#define vll vector <ll>
#define mll map <ll ,ll>
#define prtq priority_queue <long long>
#define rep(a,b) for(i=a;i<b;i++)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define inf 1e18
using namespace std;
#define Mod 1000000007
void fio()
{
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#else
#endif
}
void tim()
{
#ifndef ONLINE_JUDGE
cerr << "Time elapsed: " << clock() / 1000 << " ms" << endl;
#endif
}
int sumofdigit(ll n){
ll temp=n; int sum=0;
while(temp){
sum+=temp%10;
temp/=10;
}
return sum;
}
int main()
{
fio();
IOS;
int t=1;
while(t--){
ll n,s;
cin>>n;
vll h(n+1);
int i;
rep(1,n+1)cin>>h[i];
vll dp(n+1,0);
dp[1]=0; dp[0]=0;
for(i=2;i<=n;i++){
if(i==2)dp[i]=dp[i-1]+abs(h[i]-h[i-1]);
else dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i-2]-h[i]));
}
cout<<dp[n];
}
tim();
return 0;
} | #include <iostream>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long n, m, result = 0;
cin >> n >> m;
long long x[n], y[m];
for (long long i = 0; i < n; i++) {
cin >> x[i];
}
for (long long i = 0; i < m; i++) {
cin >> y[i];
}
long long left = 0, right = 0;
for (long long i = 1, prefix = y[0]; i < m; i++) {
left = (left + MOD - prefix + i * y[i]) % MOD;
prefix = (prefix + y[i]) % MOD;
}
for (long long i = 1, prefix = x[0]; i < n; i++) {
right = (right + MOD - prefix + i * x[i]) % MOD;
prefix = (prefix + x[i]) % MOD;
}
cout << (left * right) % MOD;
return 0;
} | 0 | 72,983,443 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
int main()
{
optimize();
int n,i;
double p,t=0.0;
string st;
cin>>n;
for(i=1;i<=n;i++){
cin>>p>>st;
if(st=="BTC")
p=380000.0*p;
t+=p;
}
cout<<t<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int ans = 0;
void an(){
ans++;
}
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
int main() {
ll N;
cin >> N;
ll M;
vector<ll>pfs(N+1);
for (ll i=1; i<=N; i++){
vector<pair<ll, ll>>curr_pf;
curr_pf = prime_factorize(i);
for (ll j=0; j<curr_pf.size(); j++){
pair<ll, ll>pr;
pr = curr_pf[j];
pfs[pr.first] += pr.second;
}
}
int c2, c4, c14, c24, c74;
c2 = c4 = c14 = c24 = c74 = 0;
for (int i=0; i<N+1; i++){
if (pfs[i] >= 2)c2++;
if (pfs[i] >= 4)c4++;
if (pfs[i] >= 14)c14++;
if (pfs[i] >= 24)c24++;
if (pfs[i] >= 74)c74++;
}
ans += (c4 * (c4-1) * (c2-2)) /2;
ans += c14 * (c4-1);
ans += c24 * (c2 - 1);
ans += c74;
cout << ans << endl;
} | 0 | 86,348,461 |
#include<iostream>
#include<string>
#include<map>
using namespace std;
int main()
{
long long n,m,p,i,r=0,t=0;
map<long long,long long>ac,wa;
string s;
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>p>>s;
if(s=="AC")
{
ac[p]++;
if(ac[p]==1)
{
r++;
t+=wa[p];
}
}
else
{
wa[p]++;
}
}
cout<<r<<" "<<t<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(...) overload_rep(__VA_ARGS__, rep_1, rep_0)(__VA_ARGS__)
#define rep_0(i, end) for(int i = 0; i < (end); ++i)
#define rep_1(i, fr, ba) for(int i = (fr); i <= (ba); ++i)
#define overload_rep(arg0, arg1, arg2, name, ...) name
#define all(box) box.begin(), box.end()
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
using lint = long long;
int main() {
int N;
std::cin >> N;
std::vector<lint> A(N);
std::vector<std::vector<int>> graph(N);
rep (i, N) std::cin >> A[i];
rep (i, N - 1) {
int a, b;
std::cin >> a >> b;
--a; --b;
graph[a].push_back(b);
graph[b].push_back(a);
}
if (N == 2) {
std::cout << (A[0] == A[1] ? "YES" : "NO") << '\n';
return 0;
}
bool answer = true;
std::function<lint(int, int)> dfs = [&] (const int& v, const int& prev) {
if (graph[v].size() == 1) return A[v];
lint max = 0, sum = 0;
for (const int& u : graph[v]) {
if (u == prev) continue;
lint tmp = dfs(u, v);
chmax(max, tmp);
sum += tmp;
}
chmax(max, (sum + 1) / 2);
if (A[v] < max || A[v] > sum) {
answer = false;
}
return sum - (sum - A[v]) * 2;
};
rep (i, N) {
if (graph[i].size() > 1) {
if (dfs(i, -1) != 0) answer = false;
break;
}
}
std::cout << (answer ? "YES" : "NO") << '\n';
return 0;
} | 0 | 39,522,142 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int s,k;cin>>k>>s;
int cnt=0;
for(int i=0;i<=k;i++){
for(int j=0;j<=k;j++){
if(s-i-j<=k&&s-i-j>=0){
cnt++;
}
}
}
cout<<cnt;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
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;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
string S;
cin >>S;
string T = S;
ll N= S.size();
reverse(all(T));
if(S==T ){
string U=S.substr(0,(N-1)/2) ;
T = U;
reverse(all(T));
if(U==T){
U=S.substr((N+1)/2) ;
T = U;
reverse(all(T));
if(U==T){
cout <<"Yes"<<endl;
return 0;
}
}
}
cout << "No"<< endl;
return 0;
} | 0 | 10,460,445 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
for (;;) {
int n; cin >> n;
if (n == 0) break;
vector<string> f(n);
for (int i = 0; i < n; i++) cin >> f[i];
int cnt = 0;
for (int i = 0; i + 1 < n; i++)
if (f[i][1] == f[i + 1][1]) cnt++;
cout << cnt << endl;
}
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> istream& operator>>(istream &is, pair<S, T> &p){ return is >> p.first >> p.second; }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ return os << "[" << p.first << ", " << p.second << "]"; }
#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define For1(i, n) for(int i = 1; i <= (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
#define Return(x) { Cout(x); return 0; }
constexpr int MOD = 1e9+7;
using Pii = pair<int, int>;
int main(void){
Cin(int, n);
Cins(int, n, a);
Cins(int, n, b);
vc<int> u(n);
For(i, n) u[i] = min(a[i], b[i]);
ll ans = 1;
For(i, n){
int ub = -1;
if(i == 0 || a[i] != a[i-1]) ub = a[i];
if(i == n-1 || b[i] != b[i+1]){
if(ub != -1 && ub != b[i]) Return(0);
ub = b[i];
}
if(ub > u[i]) Return(0);
if(ub == -1) ans = (ans * u[i]) % MOD;
}
Cout(ans);
} | 0 | 17,558,434 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int main() {
cout << fixed << setprecision(10);
string a,b,c;
cin >> a >> b >> c;
if(a.at(a.size()-1)==b.at(0)&&b.at(b.size()-1)==c.at(0)){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int solve(string S){
int max_global = 0;
int max_current = 0;
for (int i = 0; i < S.size(); ++i) {
if(S[i] == 'R'){
max_current++;
max_global = max(max_global,max_current);
}else{
max_global = max(max_global,max_current);
max_current = 0;
}
}
return max_global;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string S;
cin >> S;
cout << solve(S);
} | 0 | 20,837,627 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -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; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int n, m;
cin >> n >> m;
map<int, int> c;
rep(i, m) {
int a, b;
cin >> a >> b;
c[a]++, c[b]++;
}
rep(i, n + 1) {
if (c[i] & 1) {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
string s1,s2;
vector<vector<ll>> table;
ll dp(ll n1,ll n2){
if(n1<0) return n2+1;
if(n2<0) return n1+1;
if(table.at(n1).at(n2)<INF) return table.at(n1).at(n2);
table.at(n1).at(n2)--;
if(s1.at(n1)==s2.at(n2)){
chmin(table.at(n1).at(n2),dp(n1-1,n2-1));
return table.at(n1).at(n2);
}
chmin(table.at(n1).at(n2),dp(n1-1,n2)+1);
chmin(table.at(n1).at(n2),dp(n1,n2-1)+1);
chmin(table.at(n1).at(n2),dp(n1-1,n2-1)+1);
return table.at(n1).at(n2);
}
int main()
{
cin>>s1>>s2;
ll N1=s1.size(),N2=s2.size();
table=vector<vector<ll>>(N1,vector<ll>(N2,INF));
cout<<dp(N1-1,N2-1)<<endl;
return 0;
} | 0 | 60,089,762 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
long long mod=1e9+7;
long n,m;
cin>>n>>m;
vector<long long> x;
vector<long long> y;
for(long i=0;i<n;i++){
long long k;
cin>>k;
x.push_back(k);
}
for(long i=0;i<m;i++){
long long k;
cin>>k;
y.push_back(k);
}
vector<long long> v1;
vector<long long> v2;
for(long i=1;i<n;i++){
v1.push_back(x[i]-x[i-1]);
}
for(long i=1;i<m;i++){
v2.push_back(y[i]-y[i-1]);
}
long long ansx=0;
for(long i=0;i<n-1;i++){
long long k=v1[i]*(i+1)*(n-i-1);
ansx+=k;
ansx=ansx%mod;
}
long long ansy=0;
for(long i=0;i<m-1;i++){
long long k=v2[i]*(i+1)*(m-i-1);
ansy+=k;
ansy=ansy%mod;
}
long long k=ansx*ansy;
k=k%mod;
cout<<k;
return 0;
} | #include<iostream>
#include <stdio.h>
using namespace std;
int main(){
int n;
int b,f,r,v;
string m="####################";
int num[4][3][10];
int i,j,k;
for (i = 0; i < 4; i++){
for (j = 0; j < 3; j++){
for (k = 0; k < 10; k++){
num[i][j][k]=0;
}
}
}
cin >> n;
for (i = 0; i < n;i++){
cin >> b >> f >> r >> v;
num[b-1][f-1][r-1]=num[b-1][f-1][r-1] + v;
}
for (i = 0; i < 4; i++){
for (j = 0; j < 3; j++){
for (k = 0; k < 10; k++){
if (k==9){
cout << " " << num[i][j][k] << endl;
}else{
cout << " " << num[i][j][k];
}
}
}
if(i!=3)cout << m << endl;
}
return 0;
} | 0 | 23,729,923 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef vector< pii > vpii;
#define X first
#define Y second
#define pb push_back
#define sz(a) (ll)(a).size()
#define all(a) (a).begin(),(a).end()
#define F(i,a,b) for(ll i=a;i<=b;i++)
#define RF(i,a,b) for(ll i=a;i>=b;i--)
#define Fo(i,a,b,j) for(ll i=a;i<=b;i+=j)
#define RFo(i,a,b,j) for(ll i=a;i>=b;i-=j)
#define in(a,n) F(i,0,n-1)cin>>a[i]
#define in1(a,n) F(i,1,n)cin>>a[i]
#define out(a,n) F(i,0,n-1)cout<<a[i]<<" "
#define out1(a,n) F(i,1,n)cout<<a[i]<<" "
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define popcount __builtin_popcountll
#define pfy cout<<"YES"
#define pfn cout<<"NO"
#define pfn1 cout<<"-1"
#define pf1 cout<<"1"
#define nl cout<<"\n"
#define watch(x) cout<<#x<<" is "<<x<<"\n"
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>void __f(const char* name,Arg1&& arg1);
template <typename Arg1,typename... Args>void __f(const char* names,Arg1&& arg1,Args&&... args);
ll binpow(ll x,ll y,ll p);
signed main()
{
#ifndef ONLINE_JUDGE
#endif
fast;
int L;
cin>>L;
long double xx=(1.0)*L;
xx/=3.0;
cout<<fixed<<setprecision(10)<<(xx)*(xx)*(xx);
return 0;
}
ll binpow(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;
}
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1)
{
std::cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args)
{
const char *comma = strchr(names + 1, ',');
std::cout.write(names, comma - names) << " : " << arg1 << "\n";
__f(comma + 1, args...);
} | #include <bits/stdc++.h>
#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main()
{
int m, min, max;
while (cin >> m >> min >> max && m) {
vector<int> v;
loop(m, i) {
int j; cin >> j;
v.push_back(j);
}
int gap = 0;
int ans = 0;
for (int i = min; i <= max; i++) {
if (gap <= v[i-1] - v[i]) {
gap = v[i-1] - v[i];
ans = i;
}
}
cout << ans << endl;
}
} | 0 | 27,246,353 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 100005
int n, p, a[N];
ll m, v;
bool cmp(int x, int y)
{
return x > y;
}
bool check(int x)
{
if(x <= p) return 1;
if(a[x] + m < a[p]) return 0;
int rv = v - (p - 1) - (n - x + 1);
if(rv < 0) return 1;
ll rs = 1ll * rv * m;
for(int i = p; i <= x - 1; i++)
rs -= a[x] + m - a[i];
return (rs <= 0);
}
int main()
{
scanf("%d%lld%lld%d", &n, &m, &v, &p);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1, cmp);
int l = 1, r = n, ans = 0;
while(l <= r)
{
int mid = l + r >> 1;
if(check(mid)) l = mid + 1, ans = mid;
else r = mid - 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vc = vector<char>;
using vvll = vector<vll>;
using vvi = vector<vi>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int,int>;
using vpii = vector<pii>;
int main() {
int N, M; cin >> N >> M;
int tmp_min=1, tmp_max=N;
vector<pii> ID;
for (int i = 0; i < M; i++) {
int tmpL, tmpR; cin >> tmpL >> tmpR;
ID.push_back(make_pair(tmpL, tmpR));
}
sort(ID.begin(), ID.end());
for (auto x : ID) {
int tmpL, tmpR;
tie(tmpL, tmpR) = x;
if (tmp_min < tmpL) tmp_min = tmpL;
if (tmpR < tmp_max) tmp_max = tmpR;
}
if (tmp_max < tmp_min) cout << 0 << endl;
else cout << tmp_max - tmp_min +1 << endl;
} | 0 | 37,853,258 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define print0(a) cout << (a) << ' '
#define print1(a) cout << (a) << '\n'
#define print2(a,b) cout << (a) << ' ',print1(b)
#define print3(a,b,c) cout << (a) << ' ',print2(b,c)
#define print4(a,b,c,d) cout << (a) << ' ',print3(b,c,d)
#ifdef i_am_noob
#define debug(a) print2(#a,a)
#else
#define debug(a)
#endif
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
const int Mod=1000000007,Mod2=998244353;
const int MOD=Mod2;
inline int add(int a, int b){return (a+b>=MOD?a+b-MOD:a+b);}
inline int sub(int a, int b){return (a+MOD-b>=MOD?a-b:a+MOD-b);}
int Pow(int a, int b){
if(!b) return 1;
int tmp=Pow(a*a%MOD,b>>1);
return (b&1?tmp*a%MOD:tmp);
}
inline int inverse(int n){return Pow(n,MOD-2);}
const int maxn=105;
int a,b;
signed main(){
ios_base::sync_with_stdio(0),cin.tie(0);
cin >> a >> b;
print1((a-1)*(b-1));
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<math.h>
#include<string>
#include <cctype>
#include <cstdlib>
#include<bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main(){
int n, d; cin >> n >> d;
int x[n][d];
rep(i, n){
rep(j, d){
cin >> x[i][j];
}
}
int ans=0;
rep(i, n){
reps(j, i+1, n){
int dist = 0;
rep(k, d){
int diff = abs(x[i][k]-x[j][k]);
dist += diff*diff;
}
int q,k = 1;
while(dist>=k){
if(dist==k*k){
ans++;
}
k++;
}
}
}
out(ans);
} | 0 | 91,371,167 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int max_H = 0, ans = 0;
for(int i = 0;i < N;i++){
int H;
cin >> H;
if(max_H <= H){
max_H = H;
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 10000;
int main() {
int N; cin >> N;
vector<P> R(N);
vector<P> B(N);
bool use[N];
rep(i, N){
use[i] = false;
}
rep(i, N){
int a, b; cin >> a >> b;
R[i] = make_pair(a, b);
}
rep(i, N){
int c, d; cin >> c >> d;
B[i] = make_pair(c, d);
}
sort(R.begin(), R.end());
sort(B.begin(), B.end());
rep(i, N){
int c = B[i].first;
int x = INF;
int b = -1;
int n = 0;
while(1){
if(n == N)break;
if(use[n]){
n++;
continue;
}
int a = R[n].first;
if(a > c)break;
if(R[n].second < B[i].second){
if(R[n].second > b){
b = R[n].second;
x = n;
}
}
n++;
}
if(x == INF)continue;
use[x] = true;
}
int ans = 0;
rep(i, N){
if(use[i])ans++;
}
cout << ans << endl;
return 0;
} | 0 | 53,282,349 |
#include <bits/stdc++.h>
#define pvar(x) clog << "[" << #x << ":" << x << "]\n"
using namespace std;
using ll = long long int;
void solve() {
int h, w, m, h1, w1;
cin >> h >> w >> m;
int mr = 0, mc = 0;
map<int, int> r, c;
set<pair<int, int>> s;
for (int i = 0; i < m; i++) {
cin >> h1 >> w1;
r[h1]++, c[w1]++;
mr = max(mr,r[h1]);
mc = max(mc,c[w1]);
s.insert({h1, w1});
}
set<int> row,col;
for (auto i : r) {
if (mr == i.second) {
row.insert(i.first);
}
}
for (auto i : c) {
if (mc == i.second) {
col.insert(i.first);
}
}
for(auto i : row){
for(auto j : col){
if(s.find({i,j}) == s.end()){
cout<<mr+mc<<endl;
return;
}
}
}
cout<<mr+mc-1<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
while (t--) {
solve();
}
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str, func;
int n;
cin >> str >> n;
for(int i=0;i<n;i++)
{
cin >> func;
if(func=="print")
{
int a, b;
cin >> a >> b;
cout << str.substr(a, b-a+1) << endl;
}
if(func=="replace")
{
int a, b;
string p;
cin >> a >> b >> p;
str = str.replace(a, b-a+1, p);
}
if(func=="reverse")
{
int a, b;
string p, q;
cin >> a >> b;
p = str.substr(a, b-a+1);
q = p.at(p.size()-1);
for(int i=1;i <= p.size()-1;i++)
q += p.at(p.size()-1-i);
str = str.replace(a, b-a+1, q);
}
}
} | 0 | 12,646,038 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n,k;
cin >> n >> k;
long long sum =0;
long long flag = 0;
vector<int> h(n);
rep(i,n){
cin >> h.at(i);
}
sort(h.begin(),h.end(),greater());\
if(k >= h.size()){
cout << 0;
return 0;
}
rep(i,k){
h.erase(h.begin());
}
rep(i,h.size()){
sum+=h.at(i);
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int N;
cin >> N;
map<int,int> kani;
for(int i=0;i<N;i++){
int a;
cin >> a;
kani[a]++;
}
int ans=0;
for(auto x : kani){
if(x.first>x.second) ans+=x.second;
if(x.first<x.second) ans+=x.second-x.first;
}
cout << ans << endl;
} | 0 | 81,196,292 |
#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)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N;
cin >> N;
vec h(N+1,0);
REP(i,0,N) cin >> h[i];
ll cnt = 0;
REP(i,1,101) {
ll c = 0;
bool f = false;
REP(j,0,N+1) {
if(f) {
if(i > h[j]) {
f = false;
++c;
}
}
else {
if(i <= h[j]) f = true;
}
}
cnt += c;
}
PR(cnt);
return 0;
} | #include <iostream>
#include <list>
#include <string>
using namespace std;
void display(list<int> & lst){
if (!lst.empty()){
cout << lst.front();
lst.pop_front();
}
for (auto element : lst){
cout << ' ' << element;
}
cout << endl;
}
int main()
{
ios::sync_with_stdio(false);
list<int> lst;
int n = 0;
cin >> n;
for (int i = 0; i != n; ++i){
string command;
cin >> command;
if (command == "insert"){
int x = 0;
cin >> x;
lst.push_front(x);
}else if (command == "delete"){
int x = 0;
cin >> x;
for (auto it = lst.begin(); it != lst.end(); ++it){
if (*it == x){
lst.erase(it);
break;
}
}
}else if (command == "deleteFirst"){
lst.pop_front();
}else if (command == "deleteLast"){
lst.pop_back();
}
}
display(lst);
return 0;
} | 0 | 96,256,037 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int R, G;
cin >> R >> G;
cout << 2 * G - R << endl;
return 0;
} | #include <stdio.h>
int main(){
char cards[200];
char newCards[200];
int m, cardsLen;
int h;
while(true) {
scanf("%s",cards);
if(cards[0] == '-') break;
cardsLen = 0;
while(cards[cardsLen] != '\0') cardsLen++;
scanf("%d",&m);
for(int i=0;i<m;i++){
scanf("%d",&h);
for(int j=0;j<cardsLen;j++){
newCards[j] = cards[(j+h) % cardsLen];
}
for(int j=0;j<cardsLen;j++){
cards[j] = newCards[j];
}
}
printf("%s\n", cards);
}
length:
return 0;
} | 0 | 43,009,339 |
#include<bits/stdc++.h>
#define ll long long
#define for(in1,in2,in3) for (int in1 = in2; in1 < in3; in1++)
#define inf 1e9
#define mp make_pair
#define pb push_back
#define f first
#define s second
using namespace std;
int mx,x,y,z,t,u,v,ans,n,m,o;
string s1,s2,ans1;
int main() {
cin >> x >> y;
ans = (y-x)*2+x;
cout << ans << "\n";
} | #include "bits/stdc++.h"
using namespace std;
int COUNT=0;
void dfs(vector<string> map,int state[20][20],int x,int y,int W,int H){
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
if(x<0 || x>H-1 || y<0 || y>W-1)return;
if(state[x][y]!=0 || map[x][y]=='#')return;
++COUNT;
state[x][y]=1;
for(int i=0;i<4;++i)dfs(map,state,x+dx[i],y+dy[i],W,H);
}
int main(){
int W,H,x,y;
vector<string> map;
string a;
while(true){
COUNT=0;
cin >> W >>H;
if(!W && !H)break;
int state[20][20]={0};
for(int i=0;i<H;++i){
cin >> a;
map.push_back(a);
}
for(int i=0;i<H;++i){
if(0<=map[i].find('@') && map[i].find('@')<W){
y=map[i].find('@');
x=i;
break;
}
}
dfs(map,state,x,y,W,H);
cout << COUNT << endl;
map.clear();
}
} | 0 | 60,731,934 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
using P =pair<int,int>;
int main(){
ll n;
cin>>n;
vector<ll>v(n+1);
rep(i,n+1){
cin>>v[i];
}
vector<ll>y(n);
rep(i,n){
cin>>y[i];
}
ll tmp;
ll sum=0;
rep(i,n){
if(v[i]<=y[i]){
tmp=v[i] ;
v[i]=0;
y[i]-=tmp;
sum+=tmp;
}else{
tmp=y[i] ;
v[i]-=tmp;
y[i]=0;
sum+=tmp;
}
if(y[i]==0)continue;
tmp=min(y[i],v[i+1]);
y[i]-=tmp;
v[i+1]-=tmp;
sum+=tmp;
}
cout<<sum<<endl;
} | #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) for(auto ite=begin(que) ; ite!=end(que) ; ite++)
const int max_n = 1e5;
const ll mod = 1e9+7;
const ll INF = 1e17;
const int inf = 1e5;
typedef long double ld;
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; }
ll gcd(ll a, ll b) { return a ? gcd(b%a, a) : b; }
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
struct SegmentTree{
int N;
vector<int> node;
public :
void intit(vector<int>v){
int sz = v.size();
N=1;
while(N<sz) N*=2;
node.resize(N);
for(int i=0 ; i<sz ; i++) node[i+N-1] = v[i];
for(int i=N-2 ; i>=0 ; i--) node[i] = min(node[i*2+1], node[i*2+2]);
}
void update(int x, int val){
x += N-1;
node[x+N-1] = val;
while(x>0){
x = (x-1)/2;
node[x] = min(node[x*2+1], node[x*2+2]);
}
}
int getmin(int a, int b, int k, int l, int r){
if(b<=l || r<=a) return inf;
else if(a<=l && r<=b) return node[k];
else{
int vl = getmin(a, b, 2*k+1, l, (l+r)/2);
int vr = getmin(a, b, 2*k+2, (l+r)/2, r);
return min(vl, vr);
}
}
};const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
string s,t; cin>>s>>t;
int ok = 1;
map<char, int> ma;
int N = s.size();
for(char c='a' ; c<='z' ; c++) ma[c] = c - 'a';
vector<set<int>> set1(26), set2(26);
int cnt = 0;
rep(i,0,N){
int now = ma[s[i]];
set1[now].insert(i);
now = ma[t[i]];
set2[now].insert(i);
}
rep(i,0,26){
char c = ' '; cnt = 0;
for(auto j : set1[i]){
if(cnt==0){
cnt++; c = t[j];
continue;
}
if(c != t[j]) ok = 0;
}
cnt = 0;
for(auto j : set2[i]){
if(cnt==0){
cnt++; c = s[j];
continue;
}
if(c != s[j]) ok = 0;
}
}
string ans = "No";
if(ok){
ans = "Yes";
}
cout<<ans<<endl;
return 0;
} | 0 | 13,754,666 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
int main(){
ll k,n;
cin>>k>>n;
vector<ll> a(n);
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll dis=k-a[n-1]+a[0];
for(ll i=1;i<n;i++){
dis=max(dis,a[i]-a[i-1]);
}
cout<<k-dis<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> num(1e6+5,0);
vector<int> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
for(int i=0;i<N;i++){
int a=A[i];
if(num[a]>=2){
continue;;
}
while(a<=1e6+3){
num[a]++;
a+=A[i];
}
}
int ans=0;
for(int i=0;i<N;i++){
if(num[A[i]]==1){
ans++;
}
}
cout << ans << endl;
} | 0 | 20,279,642 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
vector<int> v;
for(unsigned int i = 0;i < 5;i++){
cin >> n;
v.push_back(n);
}
sort(v.begin(), v.end(), greater<int>());
for(int i = 0;i < v.size()-1;i++){
cout << v.at(i) << " ";
}cout << v.at(v.size()-1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#ifdef DEBUG
#define cek(x) cout<<x
#else
#define cek(x) if(false){}
#endif
#define fi first
#define se second
#define INF 1000000000
#define INFLL 1000000000000000000LL
#define EPS 1e-9
#define PI acos(-1.0)
#define pb push_back
#define TC() while(tc--)
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORN(i,n) for(int i=0;i<=n;i++)
#define REP(i,a,b,c) for(int i=a;i<b;i+=c)
#define REPN(i,a,b,c) for(int i=a;i<=b;i+=c)
#define reset(a,b) memset(a,b,sizeof(a))
#define sc(x) scanf("%d",&x)
vi adjList[100010];
int col[100010];
int main(void){
int n,m;
sc(n);sc(m);
FOR(i,m){
int fr, to;
sc(fr);sc(to);
adjList[fr].pb(to);
adjList[to].pb(fr);
}
int solo = 0;
int bip, nobip;
bip = nobip = 0;
reset(col, -1);
for(int i = 1;i<=n;i++){
if(col[i] != -1)continue;
if(adjList[i].empty()){
solo++;
continue;
}
queue<int> q;
q.push(i);
col[i] = 0;
bool valid = true;
while(!q.empty()){
int node = q.front();
q.pop();
for(int nxt : adjList[node]){
if(col[nxt] == -1){
q.push(nxt);
col[nxt] = 1 ^ col[node];
}else{
if(col[nxt] == col[node])valid = false;
}
}
}
if(valid)bip++;
else nobip++;
}
ll tot = 0;
tot += 2LL * n * solo - (1LL * solo * solo);
tot += 2LL * bip * bip;
tot += 2LL * bip * nobip;
tot += 1LL * nobip * nobip;
cout << tot << "\n";
return 0;
} | 0 | 80,170,012 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
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; }
int main(){
int q;
cin>>q;
V<string> d(10);
d[1]=".,!? ";
d[2]="abc";
d[3]="def";
d[4]="ghi";
d[5]="jkl";
d[6]="mno";
d[7]="pqrs";
d[8]="tuv";
d[9]="wxyz";
while(q--){
string s={};
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]!='0'){
int now=s[i]-'0';
int cnt=0;
while(s[i+cnt]!='0')cnt++;
cnt--;
cout<<d[now][cnt%d[now].size()];
i+=cnt;
}
}
cout<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
#define F first
#define S second
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define For(i, a, b) for(__typeof (a) i=a; i<=b; i++)
#define inp_arr(a,n) for(__typeof (n) i=0; i<n; ++i) {cin>>a[i];}
#define debug_arr(a,n) {{for(__typeof (n) i=0; i<n; ++i) {cout<<a[i]<<" ";}cout<<"\n";}}
#define INF 1e9
ll power(ll x, ll y)
{
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res*x)%mod;
y = y>>1;
x = (x*x)%mod;
}
return res%mod;
}
ll power_without_mod(ll x, ll y)
{
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res*x);
y = y>>1;
x = (x*x);
}
return res;
}
bool comparep(pair<ll, ll> i1, pair<ll, ll> i2){
return (i1.S < i2.S);
}
ll modInverse(ll a)
{
return power(a , mod - 2);
}
vector<ll> spf;
void seive(int n){
for(int i = 1;i<=n;i++)
spf[i] = i;
for(int i = 2;i <= n ;i++){
for(int j = i*i;j<=n;j+=i){
if(spf[j] == j){
spf[j] = i;
}
}
}
}
ll primesum(ll a){
int curr = spf[a];
int count = 0;
ll prod = 1;
while(a != 1){
count ++;
a /= spf[a];
if(spf[a] != curr){
prod *= (count + 1);
count = 0;
curr = spf[a];
}
}
return prod;
}
void djikstra(vector<vector<ar<ll,2>>> &graph, vector<ll> &dist, ll s){
dist[s] = 0;
priority_queue<ar<ll,2>, vector<ar<ll,2>>, greater<ar<ll,2>>> pq;
for(ll i=0;i<dist.size();i++){
pq.push({dist[i],i});
}
while(!pq.empty()){
ar<ll,2> now = pq.top();
pq.pop();
if(dist[now[1]] != now[0])
continue;
for(ar<ll,2> edge: graph[now[1]]){
if(dist[edge[0]] > (dist[now[1]] + edge[1])){
dist[edge[0]] = (dist[now[1]] + edge[1]);
pq.push({dist[edge[0]],edge[0]});
}
}
}
}
ll nck(ll n, ll k){
ll ans = 1;
for(ll i = max(k,n-k)+1;i <=n; i++){
ans *= i;
ans %= mod;
}
ll div = 1;
for(ll j = min(k,n-k);j>=1;j--){
div *= j;
div %= mod;
}
return ans * modInverse(div);
}
bool checkminibox(int i, int j, vector<vector<char>>& board){
map<char, int> mymap;
for(int i1 = i; i1 < (i+3); i1++){
for(int j1 = j; j1 < (j+3); j1++){
if(board[i1][j1] != '.'){
mymap[board[i1][j1]] += 1;
if(mymap[board[i1][j1]] >= 2)
return 0;
}
}
}
return 1;
}
bool checkboard(vector<vector<char>>& board){
for(int i=0;i<9;i++){
map<char, int> mymap;
for(int j=0; j<9; j++){
if(board[i][j]!='.'){
mymap[board[i][j]] += 1;
if(mymap[board[i][j]] >= 2)
return 0;
}
}
}
for(int i=0;i<9;i++){
map<char, int> mymap;
for(int j=0; j<9; j++){
if(board[j][i]!='.'){
mymap[board[j][i]] += 1;
if(mymap[board[j][i]] >= 2)
return 0;
}
}
}
for(int i=0;i<9;i+=3){
for(int j=0;j<9;j+=3){
if(!checkminibox(i,j,board))
return 0;
}
}
return 1;
}
bool solveSudokurec(vector<vector<char>>& board, int count){
if(count == 0)
return true;
bool solved = 0;
cout<<count<<"\n";
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
if(board[i][j] == '.'){
for(int num=0;num<9;num++){
board[i][j] = '1' + num;
if(checkboard(board))
solved = solveSudokurec(board, count - 1);
if(solved)
break;
}
if(solved)
break;
else{
board[i][j] = '.';
return 0;
}
}
}
if(solved)
break;
}
return solved;
}
void solveSudoku(vector<vector<char>>& board) {
int count = 0;
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
count += (board[i][j] == '.');
}
}
solveSudokurec(board, count);
}
ll solve(ll arr[], int M, int K){
set<ll> now;
now.insert(M);
while(K > 0){
set<ll> next;
for(ll ele : now){
auto i = next.find(ele);
if(i != next.end() ) {
next.erase(ele);
}
else{
next.insert(ele);
}
auto i1 = next.find(ele+1);
if(i1 != next.end() ) {
next.erase(ele+1);
}
else{
next.insert(ele+1);
}
}
now = next;
K--;
}
ll ans = 0;
for(ll idx : now){
ans ^= arr[idx];
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t;
t = 1;
for(ll z1=0;z1<t;z1++){
ll x, y;
cin>>x>>y;
ll sum = x + y;
ll m1 = 0, m2 = 0;
if(sum%3 == 0 && (x - sum/3) >= 0 && (y - sum/3)>=0){
m1 = (x - sum/3);
m2 = (y - sum/3);
}
ll prod1 = 0;
ll prod2 = 1;
ll prod3 = 1;
for(ll i=1;i<=(m1+m2);i++){
if(i == 1)
prod1 = 1;
prod1 *= i;
prod1 %= mod;
if(i <= m1)
prod2 *= i;
if(i <= m2)
prod3 *= i;
prod2 %= mod;
prod3 %= mod;
}
cout<<((prod1 * modInverse(prod2))%mod * modInverse(prod3))%mod<<"\n";
}
} | 0 | 77,629,829 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main() {
int n, m;
int l[100001], r[100001];
int mem[100001];
int ans = 0;
int count = 0;
memset(mem,0,sizeof(mem));
cin >> n >> m;
for(int i = 0; i < m; i ++){
cin >> l[i] >> r[i];
}
for(int i = 0; i < m; i ++){
count ++;
for(int j = l[i]; j <= r[i]; j ++){
mem[j] ++;
}
}
for(int i = 1; i <= n; i ++){
if(mem[i] == m) ans ++;
}
cout << ans;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
int n = 0;
for (auto e : vec) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& st) {
int n = 0;
for (auto e : st) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) {
int n = 0;
for (auto e : mp) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& e : vec) is >> e;
return is;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out() { std::cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
std::cerr << head;
if (sizeof...(Tail) != 0) std::cerr << ", ";
debug_out(std::forward<Tail>(tail)...);
}
using namespace std;
using int64 = long long;
int main() {
int64 N, X;
cin >> N >> X;
vector<int64> x(N);
cin >> x;
int64 tmp;
int64 current_gcd = 0;
for (int64 i = 0; i < N; i++) {
tmp = abs(x[i] - X);
if (tmp == 0)
continue;
else if (current_gcd == 0) {
current_gcd = tmp;
continue;
}
current_gcd = __gcd(current_gcd, tmp);
}
cout << current_gcd << endl;
return 0;
} | 0 | 26,211,368 |
#include <iostream>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
ll H,W;
cin >> H >> W;
ll ans = INF*INF;
ll a=0,b=0,c=0;
for(int h = 0; h <= H; h++){
if(W%2==0) a = h*W/2,b = h*W/2;
else a = h*(W-1)/2,b = h*(W+1)/2;
c = W*(H-h);
ll s_max = max(max(a,b),c);
ll s_min = min(min(a,b),c);
if(s_max - s_min < ans) ans = s_max - s_min;
a = h*W;
if((H-h)%2==0) b = (H-h)/2 * W,c = b;
else b = (H-h-1)/2 * W,c = (H-h+1)/2 * W;
s_max = max(max(a,b),c);
s_min = min(min(a,b),c);
if(s_max - s_min < ans) ans = s_max - s_min;
}
for(int w = 0; w <= W; w++){
if(H%2==0) a = H/2*w, b = a;
else a = (H-1)/2*w, b = (H+1)/2*w;
c = H*(W-w);
ll s_max = max(max(a,b),c);
ll s_min = min(min(a,b),c);
if(s_max - s_min < ans) ans = s_max - s_min;
a = w*H;
if((W-w)%2==0) b = H*(W-w)/2 , c = b;
else b = H*(W-w-1)/2, c = H*(W-w+1)/2;
s_max = max(max(a,b),c);
s_min = min(min(a,b),c);
if(s_max - s_min < ans) ans = s_max - s_min;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define f(i,n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define pi 3.14159265
#define umii unordered_map<int,int>
#define umci unordered_map<char,int>
#define umsi unordered_map<string,int>
void k_007()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("ip1.txt", "r", stdin);
freopen("op1.txt", "w", stdout);
#endif
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b)
{
return (a.second < b.second);
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int prime(int n) {
int flag = 1;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {flag = 0; break;}
}
return flag;
}
int power(int x, int y)
{
if (y == 0)
return 1;
else if (y % 2 == 0)
return ((power(x, y / 2) % MOD) * ( power(x, y / 2) % MOD)) % MOD;
else
return ((x % MOD) * (power(x, y / 2) % MOD) * (power(x, y / 2) % MOD)) % MOD;
}
int lcm(int a, int b)
{
return (a * b) / gcd(a, b);
}
int32_t main()
{
k_007();
string s, t;
int n;
cin >> n;
cin >> s >> t;
for (int i = 0; i < n; i++)
{
cout << s[i] << t[i];
}
} | 0 | 54,314,290 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair < ll, ll > PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
ll k, a, b;
cin >> k >> a >> b;
if ( b - a <= 2 ) {
cout << 1 + k << endl;
}
else if ( ( k - ( a - 1 ) ) % 2 == 0 ) {
cout << a + ( k - ( a - 1 ) ) / 2 * ( b - a ) << endl;
}
else {
cout << a + ( k - ( a - 1 ) ) / 2 * ( b - a ) + 1 << endl;
}
return 0;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
string s, t;
cin >> n >> s >> t;
ll tot = s.size() + t.size();
if (n >= tot) {
cout << n << endl;
return 0;
}
ll m = min(s.size(), t.size());
ll cnt = 0;
repLRE(i, 1, m) {
bool ok = true;
rep(j, i) {
if (s[n - i + j] != t[j]) {
ok = false;
break;
}
}
if (ok) cnt = i;
}
ll ans = max(tot - cnt, n);
cout << ans << endl;
return 0;
} | 0 | 29,615,356 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
while (cin >> n)
{
vector<bool> a(n + 1, true);
int cnt = n == 0 ? 0 : n - 1;
for (int i = 2; i*i <= n; ++i)
if (a[i])
for (int j = 0; i * (j + 2) <= n; ++j)
if (a[i * (j + 2)]) a[i * (j + 2)] = false, cnt--;
cout << cnt << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long dp[310][610];
int main() {
int n, k; cin >> n >> k;
vector<long long> h(n+1, 0);
for (int i = 0; i <= n+1; i++) {
for (int j = 0; j <= 2*n; j++) dp[i][j] = 1e16;
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) cin >> h[i+1];
for (int i = 0; i <= n; i++) {
for (int z = 0; z <= n; z++) {
for (int j = i+1; j <= n; j++) {
dp[j][z+1] = min(dp[j][z+1], dp[i][z] + max(0LL, h[j]-h[i]));
}
dp[n+1][z] = min(dp[n+1][z], dp[i][z]);
}
}
long long ans = 1e18;
for (int i = 0; i <= k; i++) ans = min(ans, dp[n+1][n-i]);
cout << ans << endl;
return 0;
} | 0 | 33,447,830 |
#include<cstdio>
#include<iostream>
using namespace std;
bool judge(string s1, string s2) {
for (int i = 0; i < s1.size(); i++) {
if (s1[i] < s2[i]) {
return true;
} else if (s1[i] > s2[i]) {
return false;
}
}
return false;
}
int main(void) {
int N, L;
scanf("%d %d", &N, &L);
string S[100];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < N - i - 1; j++) {
if (!judge(S[j], S[j + 1])) swap(S[j], S[j + 1]);
}
}
for (int i = 0; i < N; i++) {
cout << S[i];
}
cout << "\n";
return 0;
} | #include<cstdio>
int main() {
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
if(n + 1 >= a + b && (long long)a * (long long)b >= n) {
int m = n;
for(int i=b;i>0;i--) {
printf("%d\n", i);
int from = b+1 > m-a+2 ? b+1 : m-a+2;
for(int j=from;j<=m;j++) {
printf("%d\n", j);
}
if(m >= from) m = from-1;
}
} else {
printf("-1\n");
}
return 0;
} | 0 | 63,099,596 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m; cin >> n >> m;
ll ansAC = 0;
ll ansWA = 0;
vector<bool> usedAC(n, false);
vector<int> cntWA(n, 0);
for (int i = 0; i < m; i++) {
int p; string s; cin >> p >> s;
--p;
if (s == "AC") {
if (usedAC[p]) {}
else {
usedAC[p] = true;
ansAC++;
}
}
else {
if (usedAC[p]) {}
else {
cntWA[p]++;
}
}
}
for (int i = 0; i < n; i++) {
if (usedAC[i]) ansWA += cntWA[i];
}
cout << ansAC << " " << ansWA << endl;
return 0;
} | #include <iostream>
#include <cstdio>
const int MAX_KEY_LENGTH = 12;
const int N_KEY_CHARS = 4;
class Dict {
int *KEYS;
int char_to_id(char);
int to_hash(char*);
public:
Dict();
void insert(char*);
bool has(char*);
};
Dict::Dict() {
int max_hash = 0, w = 1;
for (int i = 0; i < MAX_KEY_LENGTH; i++, w *= N_KEY_CHARS) {
max_hash += N_KEY_CHARS * w;
}
KEYS = new int[max_hash + 1];
std::fill_n(KEYS, max_hash, 0);
}
void Dict::insert(char *key) {
KEYS[ to_hash(key) ] = true;
}
bool Dict::has(char *key) {
return KEYS[ to_hash(key) ];
}
int Dict::char_to_id(char c) {
switch (c) {
case 'A': return 1;
case 'C': return 2;
case 'G': return 3;
case 'T': return 4;
}
return 0;
}
int Dict::to_hash(char *key) {
int hash = 0;
int w = 1;
for (int i = 0; key[i]; i++, w *= N_KEY_CHARS) {
hash += w * char_to_id(key[i]);
}
return hash;
}
int main() {
int n_ops;
scanf("%d", &n_ops);
Dict dict;
char op[10], key[MAX_KEY_LENGTH + 1];
for (int i = 0; i < n_ops; i++) {
scanf("%s %s", op, key);
switch (op[0]) {
case 'i':
dict.insert(key);
break;
case 'f':
puts( dict.has(key) ? "yes" : "no" );
break;
}
}
return 0;
} | 0 | 68,829,494 |
#include <iostream>
using namespace std;
using ll = long long;
#define ALL(x) begin(x), end(x)
int main() {
int N,D,X;
cin >> N >> D >> X;
int ans{X};
int a;
for (int i = 0; i != N; ++i) {
cin >> a;
ans += (D-1)/a+1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main()
{
vector<int> dp(10030,-1);
int n, m;
cin >> n >> m;
vector<int> a(m),use={0,2,5,5,4,5,6,3,7,6};
rep(i,m){
cin >> a[i];
}
sort(a.rbegin(), a.rend());
for(auto e:a){
dp[use[e]]=1;
}
dp[0] = 0;
rep(i,n+1){
if(dp[i]==-1)
continue;
for(auto e:a){
dp[i + use[e]] = max(dp[i] + 1, dp[i + use[e]]);
}
}
string ans;
int remain = dp[n];
int match = n;
while(match > 0){
for(auto e: a){
if(match<use[e])
continue;
if(dp[match-use[e]]==remain-1){
match -= use[e];
remain--;
ans += char('0'+e);
break;
}
}
}
cout << ans << endl;
} | 0 | 26,445,345 |
#define REP(i,n) for (int i=0;i<(n);i++)
#include <iostream>
using namespace std;
int main(){
int N;
while(cin >> N && N > 0){
int a[N];
REP(i,N){
cin >> a[i];
}
int maximum = a[0];
REP(i,N){
int sum = 0;
for(int j = i; j < N; j++){
sum += a[j];
maximum = max(sum,maximum);
}
}
cout << maximum << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
int a;
vector<int> p(n + 1);
rep(i, n)
{
cin >> p[i] >> a;
}
p[n] = a;
vector <vector <int> > m(n, vector<int>(n));
for (int l = 0; l < n; l++)
{
for (int i = 0; i < n; i++)
{
int j = i + l;
if(j>=n)break;
if (i == j) m[i][j] = 0;
else
{
m[i][j]=m[i][i]+m[i+1][j]+p[i]*p[i+1]*p[j+1];
for (int k = i;k < j;k++){
m[i][j]=min(m[i][k] + m[k+1][j] + p[i] * p[k + 1] * p[j + 1],m[i][j]);
}
}
}
}
cout<<m[0][n-1]<<endl;
} | 0 | 18,250,021 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
ll t[100005];
ll a[100005];
ll ans;
int main()
{
int n;
cin >> n;
for (int i = 0; i <= n; i++)
{
cin >> a[i];
}
t[0] = 1;
if (n == 0 && a[0] == 1)
{
cout << 1 << endl;
return 0;
}
if (a[0] != 0)
{
cout << -1 << endl;
return 0;
}
for (int i = 1; i <= n; i++)
{
t[i] = t[i - 1] * 2;
if (t[i] >= INF)
t[i] = INF;
t[i] -= a[i];
if (t[i] < 0)
{
cout << -1 << endl;
return 0;
}
}
ll m = a[n];
ans = m;
for (int i = n; i > 0; i--)
{
m = min(m, t[i - 1]);
m += a[i - 1];
ans += m;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pai acos(-1)
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define sz(a) (ll)a.size()
#define endl "\n"
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (((a)*(b))/gcd(a,b))
#define all(vec) vec.begin(),vec.end()
#define ms(a, b) memset(a,b,sizeof(a))
#define TEST_CASE(t) for(ll www=1;www<=t;www++)
#define PRINT_CASE printf("Case %lld: ",www)
#define fii freopen("input.txt","r",stdin);
#define foo freopen("output.txt","w",stdout);
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
inline bool checkBit(ll n, int i) { return n&(1ll<<i); }
inline ll setBit(ll n, int i) { return n|(1ll<<i);; }
inline ll resetBit(ll n, int i) { return n&(~(1ll<<i)); }
const ll mod = 1e9 +07;
const ll mxn = 1e6 +10;
int main(int argc, char const *argv[])
{
ll i,j,k,a,b,c,d,n,m,t,h,u,v,x,y,z;
string s;
cin>>s;
if(s[0]=='R'&&(s[0]==s[1]&&s[1]==s[2]))
{
cout<<3<<endl;
}
else if(s[1]=='R'&&(s[0]==s[1]||s[1]==s[2]))
{
cout<<2<<endl;
}
else if(count(all(s),'R')>0)
{
cout<<1<<endl;
}
else
{
cout<<0<<endl;
}
return 0;
} | 0 | 44,642,408 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define Y first
#define X second
#define INF 1 << 30
#define EPS 1e-10
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef pair<pi, pi> pipi;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
int H, W, N;
char field[1024][1024];
int dy[] = {0,1,0,-1}, dx[] = {1,0,-1,0};
int main(){
scanf("%d%d%d", &H, &W, &N);
rep(i, H) scanf("%s", field[i]);
int x, y;
rep(i, H) rep(j, W) if(field[i][j] == 'S'){ y = i; x = j; break;}
map<pi, int>m;
m[MP(y, x)] = 1;
queue<pipi>q;
q.push(MP(MP(1, 0), MP(y, x)));
while(!q.empty()){
pipi p = q.front(); q.pop();
if(field[p.S.Y][p.S.X] == p.F.F + '0'){
if(p.F.F == N){
printf("%d\n", p.F.S);
break;
}
m.clear();
while(!q.empty()) q.pop();
m[MP(p.S.Y, p.S.X)] = 1;
p.F.F++;
}
rep(d, 4){
int ny = p.S.Y + dy[d], nx = p.S.X + dx[d];
int hp = p.F.F, c = p.F.S;
if(ny < 0 || ny >= H || nx < 0 || nx >= W || field[ny][nx] == 'X' || m.count(MP(ny, nx))) continue;
m[MP(ny, nx)] = 1;
q.push(MP(MP(hp, c+1), MP(ny, nx)));
}
}
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<set>
int main(){
std::string S, T;
std::cin >> S >> T;
std::vector<int> possible;
std::set<std::string> st;
for(int i = 0; i < S.size() - T.size() + 1; i++){
int j;
for(j = 0; j < T.size(); j++){
if(S[i + j] != '?' && S[i + j] != T[j]) break;
}
if(j == T.size()) possible.push_back(i);
}
if(possible.empty()){
std::cout << "UNRESTORABLE" << std::endl;
return 0;
}
for(int i = 0; i < possible.size(); i++){
std::string out = S;
for(int j = 0; j < T.size(); j++){
out[j + possible[i]] = T[j];
}
for(int i = 0; i < out.size(); i++){
if(out[i] == '?') out[i] = 'a';
}
st.insert(out);
}
for(auto s : st){
std::cout << s << std::endl;
return 0;
}
return 0;
} | 0 | 71,331,254 |
#include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define MOD 1000000007
#define pi acos(-1.0)
#define MAX 1000010
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
string s;
cin >> s;
int cnt = 0;
for(int i = 0; i < 3; i++){
if(s[i] == 'R'){
while(s[i] == 'R'){
cnt++;
i++;
}
break;
}
}
cout << cnt << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long A,B,K;
cin>>A>>B>>K;
if(K<=A)
{
cout<<A-K<<" "<<B<<endl;
}
else if(K<=A+B)
{
cout<<0<<" "<<A+B-K<<endl;
}
else
{
cout<<0<<" "<<0<<endl;
}
return 0;
} | 0 | 43,365,952 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv)
{
int A, B, X, flag = 0;
cin >> A >> B >> X;
for (int i = 0; i <= B; i++)
{
if (A + i == X)
{
flag = 1;
break;
}
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<unordered_map>
#include<utility>
#include<vector>
constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
template<typename T>
bool chmax(T& a, T b){
if(a < b){
a = b;
return true;
}
return false;
}
template<typename T>
bool chmin(T& a, T b){
if(b < a){
a = b;
return true;
}
return false;
}
int main(){
int h, w;
std::cin >> h >> w;
for(int i = 0 ; i < h ; ++i){
std::string c;
std::cin >> c;
for(int k = 0 ; k < 2 ; ++k){
std::cout << c << std::endl;
}
}
} | 0 | 52,970,224 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <numeric>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define EPS (1e-7)
#define INF 1e18
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define PI (acos(-1))
#define REP(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, init, n) for(ll i = init; i <(ll)(n); i++)
int main() {
int N;
cin >> N;
cout << (N / 3) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
int ans = 0,light = 1;
for (int i = 0; i < N; ++i)
{
++ans;
light = a[light - 1];
if (light == 2)
{
cout << ans << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | 0 | 56,292,746 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
#define PB push_back
void Input(int*,vector<string>&);
void Bubblesort(int*,vector<string>);
void Selectionsort(int*,vector<string>);
void Output(int*,vector<string>);
int main(int argc,char* argv[]){
int n;
vector<string> vstr;
Input(&n,vstr);
Bubblesort(&n,vstr);
Selectionsort(&n,vstr);
return 0;
}
void Input(int* pn,vector<string>& vstr){
string str;
cin>>*pn;
for(int i=0;i<*pn;i++){
cin>>str;
vstr.PB(str);
}
}
void Bubblesort(int *pn,vector<string> vstr){
for(int i=0;i<*pn;i++){
for(int j=*pn-1;j>i;j--){
if(vstr[j-1][1]>vstr[j][1]){
swap(vstr[j-1],vstr[j]);
}
}
}
Output(pn,vstr);
puts("Stable");
}
void Selectionsort(int*pn,vector<string> vstr){
bool bflag=false;
int iflag;
for(int i=0;i<*pn;i++){
int key=i;
iflag=0;
for(int j=i+1;j<*pn;j++){
if(vstr[key][1]>=vstr[j][1]){
if(vstr[key][1]==vstr[j][1]){
iflag=j;
}
else
key=j;
}
}
if(i!=key){
swap(vstr[i],vstr[key]);
if(iflag!=0 && key!=iflag)
bflag=true;
}
}
Output(pn,vstr);
if(bflag) puts("Not stable");
else puts("Stable");
}
void Output(int *pn,vector<string> vstr){
cout<<vstr[0];
for(int i=1;i<*pn;i++)
cout<<" "<<vstr[i];
puts("");
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,m,n,c=0,mn=0x7fffffff;;
cin>>n;
long long int v[n+10];
m=0;
for(long long int i=1; i<=n; i++)
{
cin>>v[i];
c+=v[i];
}
for(long long int i=1; i<n; i++)
{
m=m+v[i];
long long int x=abs(2*m-c);
mn=min(mn,x);
}
cout<<mn<<endl;
return 0;
} | 0 | 49,146,417 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int d=0,s=0,t=0;
cin>>d>>s>>t;
if(s*t<d) cout<<"No";
else cout<<"Yes";
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <iomanip>
#include <algorithm>
#include <string>
#include <queue>
#include <numeric>
using namespace std;
#define nptr nullptr
#define all(x) (x).begin(), (x).end()
#define drobucs ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define ff first
#define ss second
#define pb push_back
#define sz(x) (int)(x).size()
typedef long long ll;
const int maxn = (int)1e6 + 13;
const ll INFL = 9223372036854775807;
const ll INF = 2147483647;
const ll MOD = (int)1e9 + 7, MOD2 = 998244353;
const ll base = 101, base2 = 37;
bool vis[maxn];
int ans[maxn];
vector<int> gr[maxn];
void dfs(int v) {
vis[v] = 1;
for (auto t : gr[v])
if (!vis[t])dfs(t);
}
int main() {
drobucs;
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int u, v;
cin >> u >> v;
gr[u].push_back(v);
gr[v].push_back(u);
}
int cnt = 0;
for (int i = 1; i <= n; ++i)
if (!vis[i])dfs(i), cnt++;
if (cnt > 1) {
cout << "No\n";
return 0;
}
fill(vis, vis + n + 100, 0);
queue<int> q;
q.push(1);
while (!q.empty()) {
int v = q.front();
q.pop();
vis[v] = 1;
for (auto t : gr[v]) {
if (!vis[t]) {
q.push(t);
vis[t] = 1;
ans[t] = v;
}
}
}
cout << "Yes\n";
for (int i = 2; i <= n; ++i)
cout << ans[i] << "\n";
return 0;
} | 0 | 95,867,415 |
#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
int main(){
int cnt[4] = {};
rep(i, 3){
int a, b;
cin >> a >> b;
cnt[a-1]++, cnt[b-1]++;
}
rep(i, 4)if(cnt[i]>=3){
cout << "NO\n";
return 0;
}
cout << "YES\n";
} | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a;
vector<int> b(100003, 0);
for(int i=0;i<n;i++){
cin >> a;
b[a]++;
if(a) b[a-1]++;
b[a+1]++;
}
int ans = 0;
for(int i: b){
ans = max(ans, i);
}
cout << ans << endl;
return 0;
} | 0 | 25,967,071 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.