code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) {rep(i,x.size()) cout << x[i] << " "; cout << endl;}
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9+7;
const ll inf_l = 1e18;
const int MAX = 1e7+10;
int main() {
int n; cin >> n;
set<int> od, ev;
vint a(n);
rep(i,n) {
int x; cin >> x;
if (i&1) od.insert(x);
else ev.insert(x);
a[i] = x;
}
sort(all(a));
int ans = 0;
rep(i,n) {
if (i&1 && !od.count(a[i])) ans++;
if (!(i&1) && !ev.count(a[i])) ans++;
}
cout << ans/2 << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end())
#define Reverse(vec) reverse(vec.begin(), vec.end())
#define Next_permutation(vec) next_permutation(vec.begin(), vec.end())
#define PI acos(-1)
int main() {
int N;
cin >> N;
vector<int> A(N);
Rep(i, N) cin >> A[i];
Sort(A);
int index = A.size() - 1;
ll e1 = 0, e2 = 0;
while (index >= 1) {
if (A[index] == A[index - 1]) {
e1 = A[index];
index -= 2;
break;
}
index--;
}
while (index >= 1) {
if (A[index] == A[index - 1]) {
e2 = A[index];
break;
}
index--;
}
cout << e1 * e2 << endl;
return 0;
}
| 0
| 60,110,807
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N;
ll A[200000];
int main(){
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
for(int i=1;i<N;i++) A[i] += A[i-1];
unordered_map<ll,ll> um;
um[0]++;
for(int i=0;i<N;i++) um[A[i]]++;
ll ans = 0;
for(auto &e : um){
ll c = e.second;
ans += c * (c-1) / 2;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(unique(all(v)),v.end())
#define Eback(s) s.erase(s.end()-1,s.end())
#define rev(v) reverse(all(v))
#define minvec(v) *min_element(all(v))
#define maxvec(v) *max_element(all(v))
#define sumvec(v) accumulate(all(v),0LL)
#define mapmin(v) v.rbegin()->first
#define mapmax(v) v.begin()->first
#define pb push_back
#define pf push_front
#define m_p make_pair
#define DOUBLE fixed << setprecision(15)
#define OK cerr<<"OK\n"
#define OK1 cerr<<"OK1\n"
#define OK2 cerr<<"OK2\n"
#define SIZE(s) (int)s.size()
#define INF ((1LL<<62)-(1LL<<31))
#define zero(x,n) setw(x) << setfill('0') << n
#define endl '\n'
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<ll,ll>> vpll;
const double pi = acos(-1.0);
const ll mod=1000000007;
const ll mod2=998244353;
template<class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>&p) {
ost << "{" << p.first << ", " << p.second << "} ";
return ost;
}
template<class T>
ostream& operator<<(ostream& ost, const vector<T>&v) {
ost << "{";
for (int i = 0; i<(int)v.size(); i++) {
if (i)ost << " ";
ost << v[i];
}
ost << "} \n";
return ost;
}
template<class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>&v) {
ost << "{";
for (auto p:v) {
ost << "{" << p.first << ", " << p.second << "} ";
}
ost << "} ";
return ost;
}
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;}
void YES(bool b) {cout << ((b)?"YES\n":"NO\n");}
void Yes(bool b) {cout << ((b)?"Yes\n":"No\n");}
void yes(bool b) {cout << ((b)?"yes\n":"no\n");}
void Yay(bool b) {cout << ((b)?"Yay!\n":":(\n");}
ll powmod(ll a,ll b){ll c=1; while(b>0){ if(b&1){ c=a*c%mod; } a=a*a%mod; b>>=1; } return c;}
ll nCrmod(ll n,ll r){ll x=1,y=1; rep(i,r){x=x*(n-i)%mod; y=y*(i+1)%mod;} return x*powmod(y,mod-2)%mod;}
ll gcd(ll x, ll y) {return __gcd(x,y);}
ll lcm(ll x, ll y) {return x/__gcd(x,y)*y;}
long long LIS(vector<long long> a) {
long long n=(int)a.size();
vector<long long> dp(n,1e18);
for (long long i=0;i<n;i++){
long long tmp =lower_bound(dp.begin(),dp.end(),a[i])-dp.begin();
dp[tmp] =a[i];
}
long long k=0;
while (k<n && dp[k]!= 1e18) k++;
return k;
}
int main()
{
ll n;
cin >> n;
vll a(n);
rep(i,n) cin >> a[i];
cout << LIS(a) << endl;
return 0;
}
| 0
| 31,388,929
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
ll INF = LLONG_MAX;
using vc = vector<char>;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N; cin >> N;
vi arr (N);
F0R(i, N) cin >> arr[i];
ll lo = 2;
ll hi = 2;
R0F(i, N) {
lo = (lo % arr[i] == 0) ? (arr[i] * (lo / arr[i])) : (arr[i] * (1 + lo / arr[i]));
hi = (arr[i] * (hi / arr[i])) + arr[i] - 1;
}
if (lo > hi)
cout << -1 << endl;
else
cout << lo << " " << hi << endl;
}
|
#include <cstdio>
#include <cstring>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define TRACE
#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << endl;
#define trace4(a, b, c, d) cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " << #f << ": " << f << endl;
#else
#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)
#endif
const int INF=1e9;
const ll INFF=1e17;
const double EPS=1e-9;
const ll MOD=1e9+7;
const int MAXN=1e5+10;
int n,gr[MAXN];
bool vis[MAXN];
vector<vector<int> > g(MAXN);
void dfs(int v){
gr[v]=0;
vis[v]=1;
for(auto u:g[v]){if(!vis[u]){dfs(u);gr[v]^=(gr[u]+1);}}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
REP(i,n-1){
int t1,t2;
cin >> t1 >> t2;t1--;t2--;
g[t1].pb(t2);
g[t2].pb(t1);
}
REP(i,n)vis[i]=0;
dfs(0);
cout << (!gr[0]?"Bob":"Alice") << '\n';
return 0;
}
| 0
| 37,099,713
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, k;
cin >> a >> b >> k;
int maxv = min(a, b);
int c = 0;
repr(i, 0, maxv + 1) {
if (a % i == 0 && b % i == 0)
c++;
if (c == k) {
cout << i << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char remain(char x,char y){
if(x!='R'&&y!='R') return 'R';
if(x!='G'&&y!='G') return 'G';
if(x!='B'&&y!='B') return 'B';
}
int main() {
int n;
cin>>n;
string s;
cin>>s;
vector<long long> r(n+1,0),g(n+1,0),b(n+1,0);
r[0]=0,g[0]=0,b[0]=0;
for(int i=0;i<n;i++){
if(s[i]=='R'){
r[i+1]=r[i]+1;
g[i+1]=g[i];
b[i+1]=b[i];
}else if(s[i]=='G'){
g[i+1]=g[i]+1;
r[i+1]=r[i];
b[i+1]=b[i];
}else if(s[i]=='B'){
b[i+1]=b[i]+1;
g[i+1]=g[i];
r[i+1]=r[i];
}
}
long long ans=0;
for(int i=0;i<n-2;i++){
for(int j=i+1;j<n-1;j++){
if(s[i]!=s[j]){
char x=remain(s[i],s[j]);
if(x=='R') ans+=r[n]-r[j+1];
else if(x=='G') ans+=g[n]-g[j+1];
else if(x=='B') ans+=b[n]-b[j+1];
if(2*j-i<n&&s[2*j-i]==x) ans--;
}
}
}
cout<<ans;
}
| 0
| 83,026,410
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) sort(all(v)); reverse(all(v))
using namespace std;
using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template<typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template<typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template<typename T> inline void amax(T &x, T y) { if (x >= y) x = y; }
template<typename T> inline void amin(T &x, T y) { if (x <= y) x = y; }
template<typename T> inline T power(T x, i64 n) { T r = 1; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template<typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve() {
string s;
cin >> s;
rep(i, s.size()) {
cout << s[i];
if (i == 3) cout << " ";
}
cout << '\n';
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define vv vector< vector< int > >
#define ll long long
#define ALL(a) (a).begin(), (a).end()
const long long mod = 1000000000 + 7;
const long long INF = 9e18;
const double PI = 3.14159265358979323846;
ll gcd(ll a, ll b){if (b == 0) return a;return gcd(b, a % b);}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(){
int A, B;
string S;
cin >> A >> B >> S;
for(int i = 0; i < S.length(); ++i){
if(i == A){
if(S[i] != '-'){
cout << "No" << endl;
return 0;
}
}
else{
if(S[i] == '-'){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 40,161,971
|
#include<iostream>
using namespace std;
int main()
{
int n,a,b,c,x,i;
int y[100];
int flame;
for(;;)
{
cin >> n >> a >> b >> c >> x ;
if(n==0 && a==0 && b==0 && c==0 && x==0)
break;
for(i=0;i<n;i++)
{
cin >> y[i] ;
}
flame=0;
int flag=1;
for(i=0;;)
{
if(flame==10001)
{
flag=0;
break;
}
if(y[i]==x)
{
i++;
x=(a*x+b)%c;
if(i==n)
break;
flame++;
}
else
{
flame++;
x=(a*x+b)%c;
}
}
if(flag==1)
cout << flame << endl;
else
cout << "-1" << endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
if ((s[0] - '0') + (s[1] - '0') + (s[2] - '0') + (s[3] - '0') == 7) {
cout << s[0] << '+' << s[1] << '+' << s[2] << '+' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') - (s[1] - '0') - (s[2] - '0') - (s[3] - '0') == 7) {
cout << s[0] << '-' << s[1] << '-' << s[2] << '-' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') + (s[1] - '0') - (s[2] - '0') + (s[3] - '0') == 7) {
cout << s[0] << '+' << s[1] << '-' << s[2] << '+' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') + (s[1] - '0') - (s[2] - '0') - (s[3] - '0') == 7) {
cout << s[0] << '+' << s[1] << '-' << s[2] << '-' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') - (s[1] - '0') + (s[2] - '0') - (s[3] - '0') == 7) {
cout << s[0] << '-' << s[1] << '+' << s[2] << '-' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') - (s[1] - '0') - (s[2] - '0') - (s[3] - '0') == 7) {
cout << s[0] << '-' << s[1] << '-' << s[2] << '-' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') + (s[1] - '0') + (s[2] - '0') - (s[3] - '0') == 7) {
cout << s[0] << '+' << s[1] << '+' << s[2] << '-' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') - (s[1] - '0') - (s[2] - '0') + (s[3] - '0') == 7) {
cout << s[0] << '-' << s[1] << '-' << s[2] << '+' << s[3] << '=' << 7 << endl;
return 0;
}
if ((s[0] - '0') - (s[1] - '0') + (s[2] - '0') + (s[3] - '0') == 7) {
cout << s[0] << '-' << s[1] << '+' << s[2] << '+' << s[3] << '=' << 7 << endl;
return 0;
}
}
| 0
| 71,290,164
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
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; }
const int INF = 1000100100;
int main() {
string S;
cin >> S;
ll ans = INF;
for(ll i = 0; i + 2 < S.length(); ++i) {
ll tmp = stoi(S.substr(i, 3));
if(abs(753 - tmp) < ans) {
ans = abs(753 - tmp);
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
ll ans = 0;
rep(i, n) {
ll l, r;
cin >> l >> r;
r++;
ans += r - l;
}
out(ans);
re0;
}
| 0
| 68,671,222
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(10e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
int main(void)
{
int n, a, b;
cin >> n >> a >> b;
cout << (((b - a)%2==0)?"Alice":"Borys") << endl;
}
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
int n,ans=0;
cin >> n ;
if (n&1^1) {
while (n>9){
ans += n/10;
n /= 5;
}
}
cout << ans << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
| 0
| 43,491,891
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
bool a1[n+1]={};
bool an[n+1]={};
for(int i=0;i<m;i++){
int x,y;
cin>>x>>y;
if(x==1)a1[y]=true;
if(y==n)an[x]=true;
}
bool flag=false;
for(int i=0;i<n;i++){
if(a1[i]&&an[i]){
flag=true;
break;
}
}
if(flag) cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define pll pair<ll,ll>
#define pint pll
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
double v[200020];
int main(){
rep(i,200020)v[i]=longinf;
int n;
cin >> n;
pair<double,pair<double,double>> p[n];
double t=0;
rep(i,n){
double x;
cin >> x;
double s=t;
double e=t+x;
t+=x;
p[i].second.first=s;
p[i].second.second=e;
}
rep(i,n)cin >> p[i].first;
rep(i,n){
rep(j,2*t+1){
if(p[i].second.first<=0.5*j && 0.5*j<=p[i].second.second){
v[j]=min(v[j],p[i].first);
}
}
}
rep(i,n){
rep(j,2*t+1){
v[j]=min(v[j],p[i].first+min(abs(0.5*j-p[i].second.first),abs(0.5*j-p[i].second.second)));
}
}
rep(j,2*t+1)v[j]=min(v[j],-0.5*j+t);
rep(j,2*t+1)v[j]=min(v[j],0.5*(double)j);
double ans=0.0;
rep(i,2*t){
ans+=(v[i]+v[i+1])/2.0;
}
cout << setprecision(12) << ans/2.0 << endl;
return 0;}
| 0
| 84,106,825
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t[5];
for (int i = 0; i < 5; i++)
cin >> t[i];
sort(t, t+5);
int ans = INT_MAX;
do {
int time = 0;
for (int i = 0; i < 5; i++){
if (t[i]%10 == 0 || i == 4)
time += t[i];
else
time += t[i] + 10-t[i]%10;
}
ans = min(ans, time);
}
while (next_permutation(t, t+5));
cout << ans << endl;
}
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion
#pragma region ESTD
template<typename C, typename T>
constexpr int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F>
constexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T>
void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C>
void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U>
constexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U>
constexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C>
constexpr void reverse(C& c) { reverse(ALL(c)); }
template<typename C>
constexpr void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred>
constexpr void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#pragma endregion
int main()
{
map<string, int> d;
string s;
while(cin>>s) d[s]++;
string ans1 = "";
int mx_count1 = 0;
string ans2 = "";
int mx_count2 = 0;
for (auto el : d) {
if(el.second>=mx_count1) {
ans1 = el.first;
mx_count1 = el.second;
}
if(el.first.size()>=mx_count2) {
ans2 = el.first;
mx_count2 = el.first.size();
}
}
cout << ans1 << " " << ans2 << endl;
return 0;
}
| 0
| 97,491,020
|
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<pair<ll,ll>>s(n),p(m);
for(int i=0; i<n; i++){
ll a,b;
cin >> a >> b;
s[i] = make_pair(a,b);
}
for(int i=0; i<m; i++){
ll c, d;
cin >> c >> d;
p[i] = make_pair(c,d);
}
for(int i=0; i<n; i++){
ll d=1e18;
int point=0;
for(int j=0; j<m; j++){
if(d > abs(s[i].first-p[j].first) + abs(s[i].second-p[j].second)){
d = abs(s[i].first-p[j].first) + abs(s[i].second-p[j].second);
point = j+1;
}
}
cout << point << endl;
}
return 0;
}
|
#include <string>
#include <iostream>
using namespace std;
string ring(string s,int no,int l){
string r;
for (int i=0;i<l;i++){
r+=s[(no+i)%s.size()];
}
return r;
}
int main(){
string s,p;
cin>>s>>p;
int i;
for (i=0;i<s.size();i++){
if (p==ring(s,i,p.size())) break;
}
if (i<s.size()){
cout<<"Yes\n";
}
else{
cout<<"No\n";
}
return 0;
}
| 0
| 41,738,642
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int flag = 0;
for(int i = 0; ;i++){
if(4*i > N){
break;
}
for(int j = 0; ; j++){
int sum = 4*i + 7*j;
if( sum == N ){
flag = 1;
break;
}else if(sum > N){
break;
}
}
if(flag == 1){
break;
}
}
if(flag == 1){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
|
#include<iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<queue>
#include<string>
#include<stdlib.h>
using namespace std;
#define PI 3.14159265358979
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#include<set>
int main (void)
{
ll n,c,k;
cin>>n>>c>>k;
vector<ll> t(n);
rep(i,n) cin>>t[i];
sort(t.begin(),t.end());
ll bus =0;
ll firsttime =-1;
ll pop = 0;
for(int i=0;i<n;i++)
{
if(pop==0)
{
firsttime = t[i];
pop =1;
}
else
{
if(t[i]-firsttime<=k&&pop+1<=c)
{
pop++;
}
else
{
bus ++;
pop=1;
firsttime = t[i];
}
}
}
if(pop>0) bus ++;
cout<<bus<<endl;
}
| 0
| 72,401,823
|
#include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define togglebit(n,i) ((n)^(1LL<<(i)))
#define lastone(n) ((n)&(-(n)))
#define read freopen("debug\\in.txt","r",stdin)
#define write freopen("debug\\out.txt","w",stdout)
#define fi first
#define se second
#define getI(a) scanf("%d",&a)
#define getII(a,b) scanf("%d%d",&a,&b)
#define PI (acos(-1))
#define fastread ios_base::sync_with_stdio(false);cin.tie(NULL)
#define mod (1000000007)
#define asz 500005
#define pb push_back
#define ppf pop_front
#define ppb pop_back
#define pf push_front
int main()
{
fastread;
ll i,j,k,n,m,y,t;
string s;
cin>>s;
if(s[2]==s[3] && s[4]==s[5]) cout<<"Yes\n";
else cout<<"No\n";
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int a[10001];
int main()
{
int n,m,i,j,k,p,l=1,s=0;
for(i=0;i<=9;i++)
{
for(k=0;k<=9;k++)
{
for(j=0;j<=9;j++)
{
for(p=0;p<=9;p++)
{
a[l]=i+k+j+p;
l++;
}
}
}
}
while(cin>>n)
{
s=0;
for(i=1;i<=10000;i++)
{
if(a[i]==n)s++;
}
cout<<s<<endl;
}
return 0;
}
| 0
| 66,656,187
|
#include<cstdio>
#include<iostream>
using namespace std;
#define INF 100000
int road, max_t = 0, time_[100][100] = { 0 }, sum, root[100] = { 0 };
void dijkstra(int a) {
int i,j,k=INF,used[100],minroot;
for (i = 0; i <= max_t; i++) {
used[i] = 0;
root[i] = INF;
}
root[a] = 0;
while (1) {
minroot = INF;
for (i = 0; i <= max_t; i++) {
if (used[i] == 0&&root[i]<minroot) {
j = i;
minroot = root[i];
}
}
if (k == j) {
break;
}
else {
k = j;
}
used[j] = 1;
for (i = 0; i <= max_t; i++) {
if (root[i] > root[j] + time_[j][i]) {
root[i] = root[j] + time_[j][i];
}
}
}
sum = 0;
for (i = 0; i <= max_t; i++)sum += root[i];
return ;
}
int main() {
while (1) {
cin >> road;
if (road == 0) return 0;
int i, j, a=0, b=0, c=0, save_a[450] = { 0 }, save_b[450] = { 0 }, save_c[450] = { 0 }, min_sum = INF, ans_town=0;
max_t = 0;
for (i = 1; i <= road; i++) {
cin >> a >> b >> c;
if (max_t < a) max_t = a;
if (max_t < b) max_t = b;
save_a[i] = a;
save_b[i] = b;
save_c[i] = c;
}
for (i = 0; i <= max_t; i++) {
for (j = 0; j <= max_t; j++) {
time_[i][j] = INF;
}
time_[i][i] = 0;
}
for (i = 1; i <= road; i++) {
time_[save_a[i]][save_b[i]] = save_c[i];
time_[save_b[i]][save_a[i]] = save_c[i];
}
for (i = 0; i <= max_t; i++) {
dijkstra(i);
if (sum < min_sum) {
ans_town = i;
min_sum = sum;
}
}
cout << ans_town << " " << min_sum << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define PI 3.1415926535897932385
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
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; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
lol dp[1005][10005], n;
lol a[1005], b[10005];
lol f(lol idx, lol hp)
{
if(hp <= 0) return 0;
if(idx > n) return INF;
lol *sol = &dp[idx][hp];
if(*sol != -1) return *sol;
return *sol = min(f(idx+1, hp), f(idx, hp - a[idx])+b[idx]);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
lol result{0};
lol h; cin >> h >> n;
FOR(i, 1, n)
{
cin >> a[i] >> b[i];
}
memset(dp, -1, sizeof(dp));
result = f(1, h);
cout << result << '\n';
return 0;
}
| 0
| 30,451,673
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <string>
#include <cmath>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for(int i=0;i<n;i++) cin >> v[i];
int b4 = v[0];
int ans = 0;
int t = 0;
for(int i=1;i<n;i++) {
if(b4 >= v[i]) {
t+=1;
ans = max(ans, t);
} else {
t=0;
}
b4 = v[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> a(n);
rep(i, n) {
if(s[i] == 'R')
a[i] = 0;
if(s[i] == 'G')
a[i] = 1;
if(s[i] == 'B')
a[i] = 2;
}
vector<ll> cnt(3);
rep(i, n) cnt[a[i]]++;
ll ans = 1;
rep(i, 3) ans *= cnt[i];
rep(j, n) rep(i, j) {
int k = j + (j - i);
if(k < n) {
if(a[i] == a[j])
continue;
if(a[i] == a[k])
continue;
if(a[k] == a[j])
continue;
ans--;
}
}
cout << ans;
}
| 0
| 40,573,522
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin >> n;
cout << (n<1200?"ABC":((n<2800)?"ARC":"AGC"));
return 0;
}
|
#include<stdio.h>
int main()
{
int x, y;
while (1)
{
scanf("%d %d", &x, &y);
if (x == 0 && y == 0) break;
if (x <= y) printf("%d %d\n", x, y);
else printf("%d %d\n", y, x);
}
return 0;
}
| 0
| 1,304,396
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll pub_count[60];
ll patty_count[60];
void init_count(ll N) {
for (int i = 0; i <= N; ++i) {
pub_count[i] = -3 + 4 * pow(2, i);
patty_count[i + 1] = patty_count[i] * 2 + 1;
}
}
ll solve(ll N, ll X) {
if (N == 0)
return (X <= 0 ? 0 : 1);
else if (X <= 1 + pub_count[N - 1]) return solve(N - 1, X - 1);
else return 1 + patty_count[N - 1] + solve(N - 1, X - 2 - pub_count[N - 1]);
}
int main() {
ll N, X; cin >> N >> X;
patty_count[0] = 1;
init_count(N);
cout << solve(N, X) << endl;
}
|
#include<iostream>
using namespace std;
int main(void){
int N,i,max,count=0;
int mount[21]={0};
cin >> N;
for(i=1;i<=N;i++){
cin >> mount[i];
}
for(i=1;i<=N;i++){
if(i==1){
count++;
max = mount[1];
}else if(mount[i]>=max){
count++;
max = mount[i];
}
}
cout << count;
return 0;
}
| 0
| 19,055,906
|
#include <bits/stdc++.h>
using namespace std;
#define pb(s) push_back(s)
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int h,w;
cin>>h>>w;
char a[105];
for(int i=1;i<=h;++i){
cin>>a;
cout<<a<<endl;
cout<<a<<endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#define ll long long
#define rep(i, a, b) for(int i = a; i <= (int)b; i++)
void read(int &x) {
x = 0; int flag = 1; char ch = ' ';
while(ch < '0' || ch > '9') { if(ch == '-') flag = -1; ch = getchar(); }
while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= flag;
}
void read(ll &x) {
x = 0; int flag = 1; char ch = ' ';
while(ch < '0' || ch > '9') { if(ch == '-') flag = -1; ch = getchar(); }
while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= flag;
}
using namespace std;
const int maxn = 100010;
int n, Size[maxn], weight[maxn];
ll d[maxn], dis[maxn];
vector < pair <int, int > > ans;
vector <int> edge[maxn];
void dfs(int u, int fa) {
Size[u] = 1;
for(int i = 0; i < edge[u].size(); i++) if(edge[u][i] != fa) {
int v = edge[u][i];
dfs(v, u);
dis[u] += dis[v] + Size[v];
Size[u] += Size[v];
}
}
int main()
{
read(n);
map <ll, int> mp;
rep(i, 1, n) read(d[i]), mp[d[i]] = i, weight[i] = 1;
rep(times, 1, n - 1) {
map <ll, int> :: iterator it = --mp.end();
int i = it -> second;
ll want = d[i] + 2 * weight[i] - n;
if(mp.find(want) == mp.end() || mp[want] == i) {
puts("-1");
return 0;
}
int j = mp[want];
weight[j] += weight[i];
ans.push_back(make_pair(i, j));
edge[i].push_back(j), edge[j].push_back(i);
mp.erase(--mp.end());
}
dfs(1, 0);
if(dis[1] != d[1]) {
puts("-1");
return 0;
}
rep(i, 0, n - 2) printf("%d %d\n", ans[i].first, ans[i].second);
return 0;
}
| 0
| 84,904,334
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
while(1){
cin >> n;
vector<int> data;
if(n == 0) break;
for(int i=0; i<n; i++){
int x;
cin >> x;
data.push_back(x);
}
sort(data.begin(), data.end());
long long sum = 0;
for(int i=1; i<n-1; i++){
sum += data[i];
}
sum /= n-2;
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.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 (b < a) { a = b; return 1; } return 0; }
template<class T, class U>T rem(T a, U b) { return a - b*floor(a/b); }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
string s, t;
cin >> s >> t;
sort(all(s));
sort(t.rbegin(), t.rend());
if (s < t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| 0
| 15,239,631
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
using ll = int64_t;
int main(){
ll n, a, b; cin >> n >> a >> b;
if(a > b) {
cout << 0 << endl;
return 0;
} else if(a < b && n == 1) {
cout << 0 << endl;
return 0;
}
ll l = b*(n-1) + a, m = a*(n-1) + b;
if(l < m) swap(l, m);
cout << (l - m + 1) << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T>
using Vvec = vector<vector<T> >;
template <class T>
void debug(T& v)
{
for(auto& x: v) cout << x << " ";
cout << endl;
}
int main()
{
ll N, K;
cin >> N >> K;
vector<ll> A(N), B(N);
for(int i=0; i<N; i++) cin >> A[i] >> B[i];
bitset<30> b(K);
ll ans = 0;
for(int i=0; i<N; i++){
bool ok = true;
for(int j=0; j<30; j++){
if(!b[j] & (A[i]>>j) & 1){
ok = false; break;
}
}
if(ok) ans += B[i];
}
for(int i=0; i<30; i++){
if(!b[i]) continue;
ll sum = 0;
for(int j=0; j<N; j++){
bool ok = !((A[j]>>i) & 1);
for(int k=i+1; k<30; k++){
if(!b[k] & (A[j]>>k) & 1){
ok = false; break;
}
}
if(ok) sum += B[j];
}
ans = max(ans, sum);
}
cout << ans << endl;
}
| 0
| 1,079,176
|
#include "bits/stdc++.h"
using namespace std;
const int INF = 1001001001;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> dist(N, vector<int>(N, INF));
for (int n = 0; n < N; ++n) {
dist[n][n] = 0;
}
vector<int>X(M);
vector<int>Y(M);
vector<int>Z(M);
for (int n = 0; n < M; ++n) {
int a, b, c;
cin >> a >> b >> c;
--a;
--b;
X[n] = a;
Y[n] = b;
Z[n] = c;
dist[b][a] = c;
dist[a][b] = c;
}
for (int k = 0; k < N; ++k) {
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
int ans = 0;
for (int n = 0; n < M; ++n) {
bool b = true;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (dist[i][j] == (dist[i][X[n]] + Z[n]+ dist[Y[n]][j])) {
b = false;
}
}
}
if (b) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
string word[4] = {"dream","dreamer","erase","eraser"};
int pos = s.size();
int size;
bool judge = false;
while(pos > 0){
judge = false;
for(int i=0; i<4; i++){
size = word[i].size();
if(pos - size >= 0){
if(s.compare(pos - size, size, word[i]) == 0){
pos -= size;
s.erase(pos,size);
judge = true;
}
}
}
if(!judge) break;
}
if(judge)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| 0
| 15,687,758
|
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a==b && b==c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n;
cin>>n;
map<ll,ll> m;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
m[a[i]]++;
}
ll sum=0;
for(auto e : m){
sum+=e.second*(e.second-1)/2;
}
rep(i,n){
ll x=m[a[i]];
ll tmp=x*(x-1)/2-(x-1)*(x-2)/2;
cout<<sum-tmp<<endl;
}
}
| 0
| 14,727,033
|
#include <bits/stdc++.h>
#define rep2(i, n, m) for (int i = m; i < (int)(n); i++)
#define rep(i, n) rep2(i, n, 0)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x) {
return x * x;
}
signed main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
set<int> Set;
Set.insert(a);
Set.insert(b);
Set.insert(c);
cout << Set.size() << endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define gcd(a,b) __gcd((a),(b))
#define fill(a,value) memset(a,value,sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout<<(x)<<endl;
#define sum(v)+x accumulate(v.begin(), v.end(),x);
typedef pair<int,int> pii;
typedef vector<int> vi;
signed main()
{
fastio;
cout << fixed << setprecision(12);
int n,k;
cin>>n>>k;
int ans=0;
f(i,n)
{
int x;
cin>>x;
if(x>=k)ans++;
}
print(ans)
return 0;
}
| 0
| 25,573,229
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#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 pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
const int maxn = 200005;
const int mod = 998244353;
vector<int>g[maxn];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<pair<ll,ll>>v;
f(n) {
ll x, y;
cin >> x >> y;
v.pb({x,y});
}
reverse(all(v));
ll ans = 0;
for (auto &i : v) {
ll cur = i.F + ans;
if (cur != 0)
cur = ((cur - 1) / i.S + 1) * i.S;
ans = cur - i.F;
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define freopen \
if (0) freopen
#define cerr \
if (0) cerr
#endif
#define fi first
#define se second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define sqr(a) ((a)*1ll * (a))
#define sz(a) (int)a.size()
#define len(a) (int)a.length()
#define all(a) a.begin(), a.end()
#define nl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<int, int> pi;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
map< pi, int > squares;
void solve() {
int h, w, n;
int x, y;
cin >> h >> w >> n;
rep(l, 1, n) {
cin >> x >> y;
rep(i, x - 1, x + 1) {
rep(j, y - 1, y + 1) {
if (i <= 1 || j <= 1 || i >= h || j >= w) {
continue;
}
squares[mp(i, j)]++;
}
}
}
vector<ll> res(10, 0);
res[0] = (h - 2) * 1ll * (w - 2) - (ll)squares.size();
for (auto it : squares) {
res[it.second]++;
}
rep(i, 0, 9) {
cout << res[i] << nl;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
freopen(".in", "r", stdin);
solve();
return 0;
}
| 0
| 83,158,186
|
#include<bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
int H, W;
vector<string> maze;
bool check () {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (maze[i][j] == '.') return false;
}
}
return true;
}
void solve() {
cin >> H >> W;
maze.resize(H);
for (int i = 0; i < H; i++) cin >> maze[i];
vector<queue<pair<int, int>>> v;
queue<pair<int, int>> q0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (maze[i][j] == '#') q0.push(make_pair(i, j));
}
}
v.push_back(q0);
int count = 0;
while (!check()) {
queue<pair<int, int>> q;
while (!v[count].empty()){
pair<int, int> p = v[count].front();
v[count].pop();
for (int i = 0; i < 4; i++) {
int nx = p.first + dx[i], ny = p.second + dy[i];
if (0 <= nx && nx < H && 0 <= ny && ny < W) {
if (maze[nx][ny] == '.') {
q.push(make_pair(nx, ny));
maze[nx][ny] = '#';
}
}
}
}
v.push_back(q);
count++;
}
cout << count << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int X = A.at(0);
int Y = A.at(1);
int Z = X % Y;
int count;
for (int i = 1; i < N; i++) {
count = 0;
while (count == 0){
if (Z == 0){
if (i != N-1){
X = A.at(i+1);
Z = X % Y;
}
count++;
}
else {
X = Y;
Y = Z;
Z = X % Y;
}
}
}
cout << Y << endl;
}
| 0
| 54,733,422
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define inf 9999999999
#define N 6666
int arr[N];int f[N];
int e[N][N];
int a[N];
struct str{
int x,y,z;
}st[666666];
signed main(){
int n,m,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)
e[i][j]=0;
else
e[i][j]=inf;
}
}
for(int i=1;i<=k;i++)
scanf("%lld",&arr[i]);
for(int i=1;i<=m;i++){
int a,b,c;
scanf("%lld%lld%lld",&a,&b,&c);
e[a][b]=e[b][a]=c;
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
e[i][j]=min(e[i][j],e[i][k]+e[k][j]);
}
}
}
int ans=inf;
for(int i=1;i<=k;i++) a[i]=i;
do{
int sum=0;
for(int i=2;i<=k;i++){
sum+=e[arr[a[i]]][arr[a[i-1]]];
}
ans=min(ans,sum);
}while(next_permutation(a+1,a+1+k));
cout<<ans;
return 0;
}
|
#include<bits/stdc++.h>
#define INFTY 1<<20
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=1000000007;
int main() {
int n;cin>>n;
int a[n];rep(i,n)cin>>a[i];
int r=0,sum=0;
ll ans=0;
for(int l=0;l<n;l++){
while(r<n && (sum^a[r])==(sum+a[r])){
sum+=a[r];
r++;
}
ans += r-l;
if(l==r)r++;
sum -= a[l];
}
cout<<ans<<endl;
return 0;
}
| 0
| 5,735,298
|
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
ll n,k;
cin >> n >> k;
vector<ll> v(n);
rep(i,n) cin >> v[i];
ll right = 0;
ll all = 0;
ll ans = 0;
for(int i = 0; i < n; i++){
right = 0;
all = 0;
for(int j = i+1 ;j < n; j ++){
if(v[i] > v[j]) right++;
}
for(int j = 0; j < n ; j ++){
if(v[i] > v[j]) all++;
}
ans += right * k % MOD;
ans %= MOD;
ans += k*(k-1)/2 %MOD * all % MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int dice[6];
int n;
int x,y;
for(int i=0;i<6;i++){
cin>>dice[i];
}
cin>>n;
for(int i=0;i<n;i++){
cin>>x>>y;
if((x==dice[3] && y==dice[1]) || (x==dice[4] && y==dice[3]) || (x==dice[2] && y==dice[4]) ||(x==dice[1] && y==dice[2])){
cout<<dice[0]<<endl;
}
else if((x==dice[0] && y==dice[3]) || (x==dice[3] && y==dice[5]) || (x==dice[5] && y==dice[2]) || (x==dice[2] && y==dice[0])){
cout<<dice[1]<<endl;
}
else if((x==dice[0] && y==dice[1]) || (x==dice[1] && y==dice[5]) || (x==dice[5] && y==dice[4]) || (x==dice[4] && y==dice[0])){
cout<<dice[2]<<endl;
}
else if((x==dice[0] && y==dice[4]) || (x==dice[4] && y==dice[5]) || (x==dice[5] && y==dice[1]) || (x==dice[1] && y==dice[0])){
cout<<dice[3]<<endl;
}
else if((x==dice[0] && y==dice[2]) || (x==dice[2] && y==dice[5]) || (x==dice[5] && y==dice[3]) || (x==dice[3] && y==dice[0])){
cout<<dice[4]<<endl;
}
else if((x==dice[2] && y==dice[1]) || (x==dice[1] && y==dice[3]) || (x==dice[3] && y==dice[4]) || (x==dice[4] && y==dice[2])){
cout<<dice[5]<<endl;
}
}
return 0;
}
| 0
| 74,623,282
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
using ld = long double;
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 box(double a)
{
ll b = a;
return b;
}
ll fff(double a)
{
ll b = a + 0.5;
return b;
}
ll sum(ll n) {
return (1 + n) * n / 2;
}
ll mch(ll n) {
if (n == 1) return 1;
else return n * mch(n - 1);
}
bool prime(ll a)
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
return true;
}
ll modpow(ll a, ll n, ll mod) {
ll hi = 1;
while (n > 0) {
if (n & 1) hi = hi * a % mod;
a = a * a % mod;
n >>= 1;
}
return hi;
}
ll mg(ll a, ll mod) {
return modpow(a, mod - 2, mod);
}
int main() {
ll n; cin >> n;
vl a(n + 1);
vl b(n);
for (int i = 0; i < n + 1; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
ll cnt = 0;
for (int i = 0; i < n ; i++) {
if (b[i] > a[i]) {
cnt += a[i];
b[i] -= a[i];
cnt += a[i + 1];
a[i + 1] = max(0ll, a[i + 1] - b[i]);
cnt -= a[i + 1];
}
else cnt += b[i];
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int check(vector<string> a, vector<string> b, int x, int y){
int flag = 0, m = b.size(); int cnt = 0;
for (int i=0; i<m; i++){
for (int j=0; j<m; j++){
if (a[x+i][y+j]!=b[i][j]){
flag = 1;
break;
}
}
if (flag == 1)break;
}
if (flag == 1)return 0;
return 1;
}
int main()
{
int n, m;
cin>>n>>m;
vector<string> a(n), b(m);
for (int i=0; i<n; i++)cin>>a[i];
for (int i=0; i<m; i++)cin>>b[i];
int flag = 0;
for (int i=0; i<=n-m; i++){
for (int j=0; j<=n-m; j++){
int x = check(a, b, i, j);
if (x == 1){
flag = 1;
break;
}
}
if (flag == 1)break;
}
if (flag == 0)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
}
| 0
| 35,149,711
|
#include "bits/stdc++.h"
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define len(x) ((int)(x).size())
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
const ll LINF = 1e18;
const int INF = 1e9;
const int MOD = 1e9+7;
int main(){
fastio;
int r;
cin >> r;
cout << r*r << endl;
return 0;
}
|
#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);
}
int main()
{
cout << fixed << setprecision(15);
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if(s<t){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
}
| 0
| 78,403,449
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<bitset<20>> vbi;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
ll modpow(ll x, ll n, ll mod = MAX)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll factorial(ll n)
{
if (n > 0)
return n * factorial(n - 1);
else
return 1;
}
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
void Main()
{
ll n, h; cin >> n >> h;
vll a(n), b(n);
ll A = 0;
rep(i, n)
{
cin >> a[i] >> b[i];
A = max(A, a[i]);
}
sort(all(b));
reverse(all(b));
ll flag = 0;
rep(i, n)
{
if(b[i] > A)
{
flag++;
h -= b[i];
}
else break;
if(h <= 0) fin(flag);
}
fin(flag + (h + A - 1) / A);
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
std::istream &operator>>(std::istream &in, set<int> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
const int mod = 1000000007;
typedef priority_queue<string, vector<string>, greater<string> > PQ_ASK;
bool check(ll n, ll b) {
if (b == 0) return false;
return n / b == n % b;
}
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll x = 1; x * x <= n; x++) {
if (n % x == 0) {
if (check(n, (n / x) - 1)) ans += (n / x) - 1;
}
}
cout << ans << endl;
}
| 0
| 23,349,455
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
bool ans = (s[0] == s[1] && s[1] == s[2]);
if (ans) puts("No");
else puts("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
template<typename T1,typename T2> inline void chmin(T1 &a, T2 b){ if(a > b) a = b; }
template<typename T1,typename T2> inline void chmax(T1 &a, T2 b){ if(a < b) a = b; }
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# define DBG(fmt, ...)
#endif
const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
const int MAX_N = 100010;
signed main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
if(N % 2 != 0 || N == 4) {
int cur1 = N / 2;
int cur2 = cur1 + 1;
REP(i, M) {
printf("%lld %lld\n", cur1, cur2);
cur1--;
cur2++;
}
}
else {
int lb = 1;
int rb = lb + M;
while(lb < rb) {
printf("%lld %lld\n", lb, rb);
lb++;
rb--;
}
lb = M + 2;
rb = lb + M - 1;
while(lb < rb) {
printf("%lld %lld\n", lb, rb);
lb++;
rb--;
}
}
return 0;
}
| 0
| 93,497,518
|
#include <bits/stdc++.h>
using namespace std;
template<typename T> inline T gcd(T a, T b) {
return __gcd(a, b);
}
template<typename T> inline T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template<typename T> inline T floor(T a, T b) {
return a - a % b;
}
template<typename T> inline T ceil(T a, T b) {
return floor(a + b - 1, b);
}
template<typename T> inline T round(T a, T b) {
return floor(a + b / 2);
}
int main() {
int n;
cin >> n;
int k = 100000;
for (int i = 0; i < n; ++i) {
k = ceil(k * 105 / 100, 1000);
}
cout << k << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int ans = 0, i = 0;
string str;
bool bCheck = true;
while (bCheck) {
if (A + i > B)
{
bCheck = false;
}
str = to_string(A + i);
if (str[0] == str[4] && str[1] == str[3])
{
break;
}
i++;
}
while (bCheck) {
if (A + i > B)
{
break;
}
ans++;
str = to_string(A + i);
if (str[0] == str[4] && str[1] == str[3] && str[1] == '9' && str[2] == '9')
{
i += 11;
}
else if (str[0] == str[4] && str[1] == str[3] && str[2] == '9')
{
i += 110;
}
else if (str[0] == str[4] && str[1] == str[3])
{
i += 100;
}
}
cout << ans << endl;
return 0;
}
| 0
| 97,011,657
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
char a,b,c;
char x,y,z;
cin >>a>>b>>c>>x>>y>>z;
cout <<(a==x)+(b==y)+(c==z)<<endl;
}
|
#include<iostream>
using namespace std;
int main(){
double a[2],b[2],c[2],m[2][2],inv[2][2],det,ans[2],s,t;
while(cin >>a[0]>>a[1]>>b[0]>>b[1]>>c[0]>>c[1]>>ans[0]>>ans[1]){
b[0]-=a[0];
b[1]-=a[1];
c[0]-=a[0];
c[1]-=a[1];
ans[0]-=a[0];
ans[1]-=a[1];
m[0][0] = b[0];
m[1][0] = c[0];
m[0][1] = b[1];
m[1][1] = c[1];
det = m[0][0]*m[1][1]-m[1][0]*m[0][1];
inv[0][0] = m[1][1]/det;
inv[1][0] = -m[1][0]/det;
inv[0][1] = -m[0][1]/det;
inv[1][1] = m[0][0]/det;
s = ans[0]*inv[0][0]+ans[1]*inv[1][0];
t = ans[0]*inv[0][1]+ans[1]*inv[1][1];
if(s>0 && t>0 && s+t<1){cout <<"YES\n";}
else{cout <<"NO\n";}
}
return 0;
}
| 0
| 11,083,351
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cmath>
using namespace std;
int main()
{
string A, B;
cin >> A >> B;
int a = A.length(); int b = B.length();
if (a > b) {
cout << "GREATER\n";
return 0;
}
else if (a < b) {
cout << "LESS\n";
return 0;
}
for (int i=0; i<a; i++) {
if (A[i] > B[i]) {
cout << "GREATER\n";
return 0;
}
else if (A[i] < B[i]) {
cout << "LESS\n";
return 0;
}
}
cout << "EQUAL\n";
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define PI 3.141592653589793
double r2d(double radian){
return radian * 180.0 / PI;
}
int main(){
double a, b, x;
cin >> a >> b >> x;
double ans;
if(x <= (a * a * b) / 2.0){
double bottomWidth = (2.0 * x) / (a * b);
ans = r2d(atan(b / bottomWidth));
}else{
double centerHeight = x / (a * a);
ans = r2d(atan(((b - centerHeight) * 2.0) / a));
}
cout << std::fixed << std::setprecision(15) << ans << endl;
return 0;
}
| 0
| 84,626,539
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
int r;
cin >> r;
cout << r*r << endl;
return 0;
}
|
#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 H, N;
cin >> H >> N;
vec A(N+1, 0), B(N+1, 0);
REP(i,1,N+1) cin >> A[i] >> B[i];
mat dp(N+1, vec(H+1, INF));
REP(i,0,N+1) dp[i][0] = 0;
REP(i,1,N+1) {
REP(j,1,H+1) {
dp[i][j] = MIN(dp[i][j],dp[i-1][j]);
if(j >= A[i]) dp[i][j] = MIN(dp[i][j],dp[i][j-A[i]]+B[i]);
else dp[i][j] = MIN(dp[i][j],B[i]);
}
}
PR(dp[N][H]);
return 0;
}
| 0
| 79,915,756
|
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define sl set<ll>
#define vs vector<string>
#define pb push_back
#define vl vector<ll>
#define vi vector<int>
#define PI 3.14159265
#define mod 998244353
int main()
{
int n;
cin>>n;
double a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
double res=(a[0]+a[1])/2.0;
for(int i=2;i<n;i++)
{
res+=a[i];
res/=2.0;
}
cout<<res<<"\n";
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
#include <stack>
#include <random>
typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;
#define rip(i, n, s) for (int i = (s);i < (int)( n ); i++)
#define all(a) a.begin(), a.end()
#define MM << " " <<
template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<typename T>
void vdeb(std::vector<T> &da) {
for (int i = 0;i < da.size();i++) {
if (i == da.size() - 1) std::cout << da[i];
else std::cout << da[i] << ' ';
}
std::cout << std::endl;
}
template<typename T>
void vdeb(std::vector<std::vector<T>> &da) {
for (int i = 0;i < da.size();i++) {
std::cout << i << ' ';
vdeb(da[i]);
}
std::cout << std::endl;
}
using namespace std;
int n;
int check(vector<int> &da, int now) {
deque<Pii> dq;
stack<Pii> st;
dq.push_front({0, 0});
rip(i,n,0) {
if(dq.back().first < da[i]) {
dq.push_back({da[i], 1});
}
else {
while(dq.back().first > da[i]) dq.pop_back();
int look = da[i];
while(dq.back() == make_pair(look, now)) {
dq.pop_back(); --look;
}
if(dq.back().first == look) {
auto tmp = dq.back(); dq.pop_back();
++tmp.second;
dq.push_back(tmp);
}
else {
dq.push_back({look, 2});
}
if(dq.back().first != da[i]) dq.push_back({da[i], 1});
}
if(dq.front().second == 1) return false;
}
return true;
}
int main(){
cin >> n;
vector<int> da(n);
rip(i,n,0) cin >> da[i];
bool ju = true;
rip(i,n,1) if(da[i] <= da[i-1]) ju = false;
if(ju) {
cout << 1 << endl;
return 0;
}
int ng = 1, ok = 300000;
while(ok-ng > 1) {
int now = (ok+ng) >> 1;
if(check(da, now)) ok = now;
else ng = now;
}
cout << ok << endl;
}
| 0
| 66,633,656
|
#include<bits/stdc++.h>
using namespace std;
int main(){
char s[3];
cin >> s;
if(s[0]=='S' && s[1]=='S' && s[2]=='S'){
cout << "0" ;
}
else if(s[0]=='R' && s[1]=='R' && s[2]=='R'){
cout << "3";
}
else if(s[0]=='R' && s[1]=='R' && s[2]=='S' || s[0]=='S' && s[1]=='R' && s[2]=='R'){
cout << "2" ;
}
else cout << "1" ;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int pos = -1;
int input;
int senro[100];
while (cin >> input) {
if (input != 0) {
pos++;
senro[pos] = input;
} else if (input == 0) {
if (pos >= 0) {
cout << senro[pos] << "\n";
pos--;
} else {
cout << "error???" << "\n";
return 1;
}
}
}
return 0;
}
| 0
| 69,736,961
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
char a;
cin >> a;
if(isupper(a)) cout << 'A';
else if(islower(a)) cout << 'a';
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define COUT(x) cout<<(x)<<"\n"
int main(){
cin.tie(0);
int n,m,r;
cin >> n >> m >> r;
vector<ll> list(r);
REP(i,r){
cin >> list[i];
--list[i];
}
sort(list.begin(),list.end());
vector<vector<ll>>adj(n,vector<ll>(n,INF));
REP(i,n){
adj[i][i] = 0;
}
REP(i,m){
ll a,b,c;
cin >> a >> b >> c;
--a;--b;
adj[a][b] = c;
adj[b][a] = c;
}
REP(k,n){
REP(i,n){
REP(j,n){
if(adj[i][k] != INF && adj[k][j] != INF){
adj[i][j] = min(adj[i][j],adj[i][k]+adj[k][j]);
}
}
}
}
ll ans=INF;
do{
ll tes = 0;
FOR(i,1,r){
tes += adj[list[i-1]][list[i]];
}
ans = min(ans,tes);
}while(next_permutation(list.begin(),list.end()));
COUT(ans);
return 0;
}
| 0
| 67,996,831
|
# include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], sum[N];
map < int, int > f;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
long long ans = 0, cur = 0;
cin >> n >> k;
f[0] = 1;
for(int i = 1; i <= n; i++){
cin >> a[i];
sum[i] = (sum[i - 1] + a[i] - 1) % k;
}
for(int i = 1; i <= n; i++){
if(i >= k)f[sum[i - k]]--;
ans += f[sum[i]];
f[sum[i]]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define met(a, x) memset(a,x,sizeof(a))
#define mp make_pair;
using namespace std;
const int mod = 19e+7;
const int N = 1e5 + 10;
const int M = 1e6 + 10;
int x[N],w[N],n,l,t;
ll c;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>l>>t;
for(int i=1;i<=n;i++){
cin>>x[i]>>w[i];
if(w[i]==2)
w[i]=-1;
}
for(int i=1;i<=n;i++){
int ans=x[i]+w[i]*t;
if(ans>0){
c=(c+ans/l)%n;
}
else if(ans<0){
c=(c+(ans+1)/l-1)%n;
}
x[i]=((ans%l)+l)%l;
}
sort(x+1,x+1+n);
c=(c+n)%n;
for(int i=c+1;i<=n;i++)
cout<<x[i]<<endl;
for(int i=1;i<=c;i++)
cout<<x[i]<<endl;
return 0;
}
| 0
| 47,859,687
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << v << s; }
template <typename T> void in(T &v) { cin >> v; }
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
typedef pair<ll, ll> P;
int main() {
int n, m; in(n),in(m);
vector<P> A(n),B(m);
loop(i,0,n) in(A[i].first),in(A[i].second);
loop(i,0,m) in(B[i].first),in(B[i].second);
loop(i,0,n) {
ll x = A[i].first, y = A[i].second;
int k = -1;
ll min_ = 100000000000000000;
loop(j,0,m) {
ll x_ = B[j].first, y_ = B[j].second;
ll d = abs(x-x_) + abs(y-y_);
if (min_ > d) {
min_ = d;
k = j;
}
}
print(k+1);
}
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
_LL* mallocint(int si)
{
return (_LL*) malloc(si * sizeof(_LL));
}
_LL* inputint(int n)
{
_LL *ans = mallocint(n);
for( int i = 0; i < n; i++ ) cin >> ans[i];
return ans;
}
int main()
{
int x, y, a, b, c;
cin >> x >> y >> a >> b >>c;
_LL *p = inputint(a);
_LL *q = inputint(b);
_LL *r = inputint(c);
sort(p, p + a);
sort(q, q + b);
sort(r, r + c);
int xindex = a - x;
int yindex = b - y;
int rindex = c - 1;
while( ((xindex < a && r[rindex] > p[xindex]) || (yindex < b && r[rindex] > q[yindex])) && rindex >= 0 )
{
if( yindex >= b || p[xindex] < q[yindex] )
{
xindex++;
}
else
{
yindex++;
}
rindex--;
}
_LL ans = 0;
for( int i = xindex; i < a; i++ ) ans += p[i];
for( int i = yindex; i < b; i++ ) ans += q[i];
for( int i = rindex + 1; i < c; i++ ) ans += r[i];
cout << ans;
}
| 0
| 91,619,446
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double) w * h / 2;
int num = 0;
if ((w % 2 == 0 && w/2 == x) && (h % 2 == 0 && h / 2 == y)){
num = 1;
}
printf("%.9lf %d\n", ans, num);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >>H>> W;
vector<vector<char>> vec(H,vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>vec.at(i).at(j);
}
}
bool a=false;
int x=0;
int z=0;
vector<vector<char>> ans(H);
vector<vector<char>> lo(H);
for(int i=0; i<H; i++){
int a=0;
for(int j=0; j<W; j++){
if(vec.at(i).at(j)=='.')
a++;
if(a==W)
x++;
if(a!=W&&j==W-1){
for(int k=0; k<W; k++){
ans.at(i-x).push_back(vec.at(i).at(k));
}
}
}
}
for(int i=0; i<W; i++){
int a=0;
for(int j=0; j<H-x; j++){
if(ans.at(j).at(i)=='.')
a++;
if(a==H-x)
z++;
if(a!=H-x&&j==H-x-1){
for(int k=0; k<H-x; k++)
lo.at(k).push_back(ans.at(k).at(i));
}
}
}
for(int i=0; i<H-x; i++){
for(int j=0; j<W-z; j++){
cout<<lo.at(i).at(j);
if(j==W-z-1)
cout<<endl;
}
}
}
| 0
| 125,944
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
typedef pair<ll, ll> p;
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; }
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
int main() {
ll N;
cin >> N;
string S;
cin >> S;
vector<char> p(3);
ll ans = 0 , d, tmp;
rep(i, 1000) {
tmp = i;
rep(j, 3) {
d = pow(10, 2 - j);
p[j] = tmp / d + '0';
tmp %= d;
}
ll x = 0, y = 0;
while(x != N){
if (S[x] == p[y]) y++;
if (y == 3) {
ans++;
break;
}
x++;
}
}
cout << ans;
return 0;
}
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);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((int)(x).size())
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<typename T> void view(T e){std::cout << e << std::endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
const int inf = 1 << 30;
const ll INF = 1LL << 60;
int main(){
int x;
cin >> x;
VI m = {100, 101, 102, 103, 104, 105};
vector<vector<bool>> dp(7, vector<bool>(x+1, false));
dp[0][0] = true;
rep(i, sz(m)){
int mon = m[i];
rep(xi, x+1){
dp[i+1][xi] = dp[i+1][xi] | dp[i][xi];
if (xi - mon >= 0){
dp[i+1][xi] = dp[i+1][xi] | dp[i+1][xi-mon];
}
}
}
if (dp[sz(m)][x]) cout << 1 << endl;
else cout << 0 << endl;
return 0;
}
| 0
| 97,306,514
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
signed main(){
int N,A,B; cin>>N>>A>>B;
string ans="Borys";
if((B-A)%2==0)
ans="Alice";
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
int a[20][20];
int H, W;
void dfs(int x, int y) {
int moveX[4] = { 1, 0, -1, 0 };
int moveY[4] = { 0, 1, 0, -1 };
a[y][x] = 1;
for (int i = 0; i < 4; i++) {
int nx = moveX[i]+x;
int ny = moveY[i]+y;
if (a[ny][nx] == INF && nx >= 0 && nx < W && ny >= 0 && ny < H) {
dfs(nx, ny);
}
}
}
signed main() {
while (cin>>W>>H, W+H!=0) {
int startX, startY;
for (int i = 0LL; i < H; i++) {
for (int j = 0LL; j < W; j++) {
char c; cin >> c;
if (c == '.') {
a[i][j] = INF;
} else if (c == '#') {
a[i][j] = -1;
} else {
a[i][j] = INF;
startX = j;
startY = i;
}
}
}
dfs(startX, startY);
int ans = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (a[i][j] == 1) ans++;
}
}
cout << ans << endl;
}
}
| 0
| 37,616,099
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " "
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(lli i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
cout << std::fixed << std::setprecision(10);
lli ans=INF;
vi a(5);
rep(i,5){
cin>>a[i];
}
vi n={ 0, 1, 2, 3, 4 };
while(true){
lli tmp=0;
rep(i,5){
if(i==4){
tmp+=a[n[i]];
}
else{
(a[n[i]]%10==0?tmp+=a[n[i]]:tmp+=(a[n[i]]/10+1)*10);
}
}
ans=min(tmp, ans);
if(!next_permutation(all(n))){
break;
}
}
out(ans);
}
|
#include<bits/stdc++.h>
#include <deque>
#include<iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<stdlib.h>
#include<stdio.h>
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define mul(x,y) ((ll)(x)*(y))%mod
#define tr(c,i) for(auto i = (c).begin(); i != (c).end(); i++)
#define forn(i, n) for(int i = 0; i < n; i++)
#define FOR(i, x, y) for(size_t i=size_t(x); i<size_t(y); i++)
#define ROF(i, x, y) for(size_t i=size_t(x-1); i>=size_t(y); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
int clz(unsigned long long N) {
return N ? 64 - __builtin_clzll(N) : -INFINITY;
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
unordered_map<long long, int, custom_hash> safe_map;
gp_hash_table<long long, int, custom_hash> safe_hash_table;
template<typename T>
ostream& operator<<(ostream& os, const pair<T,T> &p){
os<<"["<<p.first<<", "<<p.second<<" ]";
return os ;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]\n";
return os;
}
template <typename T>
istream& operator>>(istream& os, vector<T>& v)
{
for (unsigned int i = 0; i < v.size(); ++i) {
os>>v[i];
}
return os;
}
template <typename T>
void o1(vector<T> &v){
for(auto i: v) cout<<i<<" ";
cout<<"\n";
}
void google(int cas){
cout<<"Case #"<<cas<<": ";
}
#define vi vector<int>
#define vvi vector<vi>
#define ii pair<int, int>
#define vii vector<ii>
#define vll vector<ll>
#define vvl vector<vll>
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
void make_set(ll v, vll &parent, vll &size) {
parent[v] = v;
size[v] = 1;
}
ll find_set(ll v, vll &parent) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v],parent);
}
void union_sets(ll a, ll b,vll &parent, vll &size) {
a = find_set(a,parent);
b = find_set(b,parent);
if (a != b) {
if (size[a] < size[b])
swap(a, b);
parent[b] = a;
size[a] += size[b];
}
}
void dfsvisit(vvl &adj,ll v, vll &visited, vll &order){
visited[v]=1;
for(auto i: adj[v]){
if(!visited[i]){
dfsvisit(adj, i, visited, order);
}
}
order.pb(v);
}
ll MPOW( ll a, ll b, ll m) { if(b==0) return 1; ll x=MPOW(a,b/2,m); x=(x*x)%m; if(b%2==1) x=(x*a)%m; return x;}
ll MINV( ll a, ll m) { return MPOW(a,m-2,m);}
template <typename T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
inline T ceil(T a, T b){
return ((a+b-1)/b);
}
ll p = (ll)1e9 + 7;
void dfs(vector<vll> &adj,ll u, ll v, vvl &dp){
for(auto i : adj[u]){
if(i==v) continue;
dfs(adj, i, u, dp);
dp[u][0] *= (dp[i][0] + dp[i][1]);
dp[u][0] %=p;
dp[u][1] *= dp[i][0];
dp[u][1] %=p;
}
}
vector<vector<ll>> primes;
vector<vector<ll>> facts;
void init_prime(ll size=1e6+1)
{
primes.resize(size);
for(ll i=2;i<size;i++)
{
if(primes[i].size()==0)
{
for(ll j=i;j<size;j+=i)
primes[j].push_back(i);
}
}
}
void init_facts(ll size=2e5+1)
{
facts.resize(size);
for(ll i=1;i<size;i++)
{
for(ll j=i;j<size;j+=i)
facts[j].push_back(i);
}
}
bool isprime(ll n){
for(ll i=2;i*i <=n;i++){
if(n%i == 0) return false;
}
return true;
}
const int g = 305;
inline void add_self(ll &a, ll b){
a+=b;
if(a >= p) a-=p;
}
void sub_self(ll &a, ll b){
a= a - b + p;
if(a >= p) a-=p;
}
int main()
{
ios_base::sync_with_stdio(0);
cout.tie(NULL);
cin.tie(NULL);
int q=1;
while(q--){
ll n; cin>>n; vvl adj(n, vll()); ll u,v;
forn(i, n-1){
cin>>u>>v; u--;v--;
adj[u].pb(v);
adj[v].pb(u);
}
vvl dp(n, vll(2,1));
dfs(adj, 0, -1, dp);
cout<<(dp[0][0] + dp[0][1])%p<<"\n";
}
return 0;
}
| 0
| 54,454,044
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fasino ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define input(A) for(auto &i:A) cin>>i;
signed main()
{
fasino
double n;
cin>>n;
long double k = n/3;
cout<<fixed<<setprecision(7)<<k*k*k;
return 0;
}
|
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
string s;
cin >> s;
string t;
vector<int64_t> nx;
int64_t m = 0;
for (auto c : s) {
if (c == 'x') {
++m;
} else {
t.push_back(c);
nx.push_back(m);
m = 0;
}
}
nx.push_back(m);
auto tr = t;
reverse(tr.begin(), tr.end());
if (t != tr) {
cout << -1 << endl;
return 0;
}
int64_t ans = 0;
for (auto i : irange(0uL, nx.size() / 2)) {
ans += abs(nx[i] - nx[nx.size() - 1 - i]);
}
cout << ans << endl;
}
| 0
| 2,488,563
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n, k;
cin >> n >> k;
vector<int> l(n);
REP(i,n) cin >> l[i];
sort(RALL(l));
int sum = 0;
REP(i,k){
sum += l[i];
}
cout << sum << endl;
return 0;
}
|
#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 = 1LL<<60;
const int inf = 1e5;
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; }
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
ll mo = 998244353;
map<ll,ll> ma;
ll gcd(ll a, ll b) { return a ? gcd(b%a, a) : b; }
int A,B,C,n;
int l[8];
int m=inf;
int rec(int i,int a, int b, int c){
if(i==n){
if(a==0 || b==0 || c==0) return inf;
else return abs(A-a)+abs(B-b)+abs(C-c);
}
int res = rec(i+1, a,b,c);
chmin(res, rec(i+1, a+l[i], b, c)+(a ? 10 : 0));
chmin(res, rec(i+1, a, b+l[i], c)+(b ? 10 : 0));
chmin(res, rec(i+1, a, b, c+l[i])+(c ? 10 : 0));
return res;
}
int main(){
cin >> n >> A >> B >> C;
rep(i,0,n){
cin >> l[i];
}
cout << rec(0,0,0,0) << endl;
return 0;
}
| 0
| 96,581,682
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; ++i)
{
cin >> a[i];
}
ll ans = 0;
for(int i = 0; i < 60; ++i)
{
ll d0 = 0, d1 = 0;
for(int j = 0; j < n; ++j)
{
if((a[j] >> i) & 1) ++d1;
else ++d0;
}
ll n = d0 * d1 % MOD;
ll tmp = ((1LL << i) % MOD) * n % MOD;
ans = (ans + tmp) % MOD;
}
cout << ans << endl;
}
int main()
{
fastio;
solve();
return 0;
}
|
#include<iostream>
#include<cctype>
#include<string>
using namespace std;
int main(int argc, char const *argv[])
{
string astr,bstr;
int n,a=0,b=0;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> astr >> bstr;
if(astr<bstr) b += 3;
else if(astr==bstr) {
a += 1; b += 1;
}
else a += 3;
}
cout << a << " " << b << endl;
return 0;
}
| 0
| 37,027,494
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main () {
int a, b, m;
cin >> a >> b >> m;
vector<int> va(a), vb(b), x(m), y(m), c(m);
rep(i, a) cin >> va[i];
rep(i, b) cin >> vb[i];
rep(i, m) cin >> x[i] >> y[i] >> c[i];
int minPrice = va[x[0] - 1] + vb[y[0] - 1] - c[0];
rep(i, m) {
int price = va[x[i] - 1] + vb[y[i] - 1] - c[i];
minPrice = min(minPrice, price);
}
sort(va.begin(), va.end());
sort(vb.begin(), vb.end());
int minPrice2 = va[0] + vb[0];
cout << min(minPrice, minPrice2) << endl;
}
|
#include <stdio.h>
#include <ctype.h>
#define N (26)
int main(void)
{
int a[N] = { 0 };
int ch, i;
while ((ch = getchar()) != EOF) {
if (islower(ch)) {
a[ch - 'a']++;
}
if (isupper(ch)) {
a[ch - 'A']++;
}
}
for (i = 0; i < N; i++) {
printf("%c : %d\n", i + 'a', a[i]);
}
return 0;
}
| 0
| 85,907,776
|
#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()
char a[105][105];
int r[105][105], c[105][105];
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
for (int i = 1; i <= n; i++) {
r[i][0] = 1;
}
for (int j = 1; j <= m; j++) {
c[0][j] = 1;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (a[i][j] == '#') continue;
r[i][j] = r[i][j - 1];
c[i][j] = c[i - 1][j];
}
for (int i = 1; i <= n; i++) {
if (r[i][m]) continue;
for (int j = 1; j <= m; j++) {
if (c[n][j]) continue;
cout << a[i][j];
}
cout << '\n';
}
}
signed main() {
#ifdef _DEBUG
freopen("in" , "r", stdin );
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b) {if (a < b){a = b;return true;}return false;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
vector<int> A(n+1, 0);
ll ans = 0;
for(int i=1;i<=n;i++){
cin>>A[i];
}
for(int i=1; i<=n-1; i++){
if(A[i]%2==1){
if(A[i+1]!=0){
A[i]--;
A[i+1]--;
ans++;
}
}
}
for(int i=1; i<=n; i++){
ans += A[i]/2;
}
cout<<ans<<endl;
}
| 0
| 11,552
|
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 100000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
int lcm(ll a, ll b)
{
return a * b / __gcd(a, b);
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
int N, D, X;
cin >> N >> D >> X;
vector<int> A(N);
ll ans = X;
for (int i = 0; i < N; i++)
{
cin >> A[i];
for (int j = 1; j <= D;j++)
{
j--;
j += A[i];
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
vector<bool> A(101,false),B(101,false);
for(int i=a;i<=b;i++){
A[i]=true;
}
for(int i=c;i<=d;i++){
B[i]=true;
}
int t=0;
rep(i,101){
if(A[i]&&B[i]){
t++;
}
}
if(t>0){
t--;
}
cout<<t<<endl;
}
| 0
| 41,654,042
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, b = 0;
cin >> a >> b;
int iResult1 = a / b;
int iResult2 = a % b;
double dResult3 = (double)a / (double)b;
printf("%d %d %.8lf\n", iResult1, iResult2, dResult3);
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i,n) for(int i=0; i<n; i++)
#define repm(i,s,n) for(int i=s; i<n; i++)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 1e9+7;
int ctoi(char c){
if(isdigit(c)) return c - '0';
else if(islower(c)) return c - 'a';
else if(isupper(c)) return c - 'A';
else return -1;
}
char itocd(int i){char c = i+'0'; if(isdigit(c)) return c; else return 0x00;}
char itocl(int i){char c = i+'a'; if(islower(c)) return c; else return 0x00;}
char itocu(int i){char c = i+'A'; if(isupper(c)) return c; else return 0x00;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void graphDijkstra(){}
void graphBellmanFord(){}
void graphWarshallFloyd(){}
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 divtimes(ll N, ll D) {ll res = 0; while(N%D == 0) {N/=D; res++;} return res;}
ll powMod(ll B, ll P) {
if(P == 0) return 1;
if(P%2 == 0){ll t = powMod(B, P/2); return t*t % MOD;}
return B * powMod(B, P-1) % MOD;
}
const int FAC_INIT_SIZE = 1e6+9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_INIT_SIZE; 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 factMod(ll N){return fac[N] % MOD;}
ll factInvMod(ll N){return finv[N] % MOD;}
ll permMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else return factMod(N) * factInvMod(N-K) % MOD;
}
ll combMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else if (N < FAC_INIT_SIZE){ return factMod(N) * (factInvMod(K) * factInvMod(N-K) % MOD) % MOD;}
else {
ll ans = 1; ll Ks = K < N-K ? K : N-K;
for (ll i = N; i > N-Ks; i--) {ans *= i; ans %= MOD;}
return ans * factInvMod(Ks) % MOD;
}
}
vector<bool> sieve;
void sieveInit(ll size){
sieve.clear();
if(size < 0 || size > INF) return;
int ss = (int)size+9;
int ssq = sqrt(ss+0.1);
sieve.resize(ss);
sieve[2] = sieve[3] = true;
int n = 0;
for (int z = 1; z <= 5; z += 4) {
for (int y = z; y <= ssq; y += 6) {
for (int x = 1; x <= ssq && (n = 4*x*x+y*y) < ss; x++) sieve[n] = !sieve[n];
for (int x = y+1; x <= ssq && (n = 3*x*x-y*y) < ss; x += 2) sieve[n] = !sieve[n];
}
}
for (int z = 2; z <= 4; z += 2) {
for (int y = z; y <= ssq; y += 6) {
for (int x = 1; x <= ssq && (n = 3*x*x+y*y) < ss; x += 2) sieve[n] = !sieve[n];
for (int x = y+1; x <= ssq && (n = 3*x*x-y*y) < ss; x += 2) sieve[n] = !sieve[n];
}
}
for (int z = 1; z <= 2; z++) {
for (int y = 3; y <= ssq; y += 6) {
for (int x = z; x <= ssq && (n = 4*x*x+y*y) < ss; x += 3) sieve[n] = !sieve[n];
}
}
for (int k = 5; k <= ssq; k++)
if (sieve[k])
for (int n = k*k; n < ss; n += k*k) sieve[n] = false;
}
map<ll, map<ll, ll>> primeFactorized;
void primeFactorInit(){primeFactorized.clear();}
void primeFactor(ll number){
if (number < 0 || number > INF_L) return;
ll num = number;
ll numsq = sqrt(number+0.1);
for (int k = 2; k <= numsq ; ++k) {
ll dt = divtimes(num, k);
if(dt){
primeFactorized[number][k] = dt;
num /= (ll)powl(k, dt);
}
if(num == 1) break;
}
if (num != 1) primeFactorized[number][num] = 1;
}
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int N; string S; cin >> N >> S;
vector<int> Sc(3, 0);
rep(i, N){
if(S[i] == 'R') Sc[0]++;
else if(S[i] == 'G') Sc[1]++;
else Sc[2]++;
}
ll res = (ll)Sc[0] * (ll)Sc[1] * (ll)Sc[2];
repm(d, 1, N){
rep(i, N){
if(i+2*d >= N) break;
if(S[i] != S[i+d] && S[i] != S[i+2*d] && S[i+d] != S[i+2*d]) res--;
}
}
cout << res << endl;
}
| 0
| 30,435,899
|
#include <bits/stdc++.h>
using namespace std;
void solve () {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
sort (a.rbegin(), a.rend());
for (int i = 0; i < n; i++) {
int j = 0;
while (a[j].second == i) j++;
cout << a[j].first << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin >> n;
char c[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin >> c[i][j];
}
}
int ans=0;
char d[n][n];
for(int i=0;i<n;i++){
bool f=true;
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
d[j][k]=c[(j+i)%n][k];
}
}
for(int j=0;j<n;j++){
for(int k=j;k<n;k++){
if(d[j][k]!=d[k][j]){
f=false;
}
}
}
if(f){
ans+=(n-i);
}
}
for(int i=1;i<n;i++){
bool f=true;
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
d[j][k]=c[j][(k+i)%n];
}
}
for(int j=0;j<n;j++){
for(int k=j;k<n;k++){
if(d[j][k]!=d[k][j]){
f=false;
}
}
}
if(f){
ans+=(n-i);
}
}
cout << ans << endl;
}
| 0
| 84,013,084
|
#include <numeric>
#include <iostream>
#include <array>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <utility>
#include <deque>
#include <queue>
using namespace std;
#define ll long long int
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repp(i, n) for(ll i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define riverse(v) reverse((v).begin(), (v).end())
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
const ll MOD = 1e9 + 7;
vi alphabet = { 'a','b','c','d','e','f','g','h','i','j','k','l','m',
'n','o','p','q','r','s','t','u','v','w','x','y','z' };
int main() {
int H, W, D;
cin >> H >> W >> D;
vvi A(H + 1, vi(W + 1));
vector<pair<int, int>> B(H * W + 1);
rep(i, H) {
rep(j, W) {
int a;
cin >> a;
B[a] = mp(i + 1, j + 1);
}
}
int Q;
cin >> Q;
vi L(Q);
vi R(Q);
rep(i, Q) {
cin >> L[i];
cin >> R[i];
}
vvi dis(D);
rep(i, D) {
int sum = 0;
int x = i;
if (i == 0)x = 0;
dis[i].push_back(0);
while (x + D <= H * W) {
int x1 = B[x].first;
int y1 = B[x].second;
int x2 = B[x + D].first;
int y2 = B[x + D].second;
sum += abs(x1 - x2) + abs(y1 - y2);
dis[i].push_back(sum);
x += D;
}
}
rep(i, Q) {
int a = L[i] / D;
int b = L[i] % D;
int c = R[i] / D;
int ans;
if (b != 0) {
ans = dis[b][c] - dis[b][a];
}
else {
ans = dis[b][c] - dis[b][a];
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
#define REP( i, n) for( int i = 0; i < (n); ++i)
#define FOR( i, a, b) for( int i = (a); i < (b); ++i)
using namespace std;
int n;
int s;
int ans;
int a[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int dfs( int x, int i, int sum){
if( x == n && sum == s){
++ans;
}else{
if( i < 10){
dfs( x+1, i+1, sum+a[i]);
dfs( x, i+1, sum);
}else{
return ans;
}
}
}
int main(){
while(1){
ans = 0;
cin >> n >> s;
if( n == 0 && s == 0){
break;
}
cout << dfs( 0, 0, 0) << endl;
}
return 0;
}
| 0
| 56,267,389
|
#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 ALL(v) v.begin(), v.end()
#define MOD 1000000007
typedef long long ll;
using namespace std;
const int AMAX = 100000;
ll cnt[AMAX + 1];
int main() {
int n;
ll k;
cin >> n >> k;
REP(i, n) {
int A, B;
cin >> A >> B;
cnt[A] += B;
}
FOR(i, 1, AMAX+1){
if (k <= cnt[i]) {
cout << i << endl;
break;
}
k -= cnt[i];
}
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0; i<(n); i++)
#define REP2(i,x,n) for(ll i=x; i<(n); i++)
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmin(T& a, T b) {
if (a > 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;
}
int main()
{
ll H, W;
cin >> H >> W;
vector<string> maps(H);
for ( ll i = 0; i < H; ++ i ){
cin >> maps[i];
}
while(1){
bool isRemove = false;
for ( ll i = 0; i < maps.size(); ++ i ){
if ( maps[i].find('#') == string::npos ){
maps.erase(maps.begin()+i);
i--;
isRemove = true;
}
}
if ( maps.size() == 0 ) break;
for ( ll i = 0; i < maps[0].size(); ++ i ){
bool findS = false;
for ( ll j = 0; j < maps.size(); ++ j ){
findS |= maps[j][i] == '#';
}
if ( !findS ){
for ( ll j = 0; j < maps.size(); ++ j ){
maps[j].erase(maps[j].begin() + i );
}
isRemove = true;
}
}
if ( !isRemove ) break;
}
for ( const auto& m : maps ){
cout << m << endl;
}
return 0;
}
| 0
| 57,987,113
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;cin>>S;
priority_queue<int> ans;
int l=S.size();
for(int i=2;i<l;i+=2){
int j=i/2;
string T1=S.substr(0,j);
string T2=S.substr(j,j);
if(T1==T2) ans.push(i);
}
cout<<ans.top()<<endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#define INF 1000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<long, long>;
int main() {
int n;
cin >> n;
vector<long long> a(n);
int i;
for(i = 0; i < n; i++){
cin >> a[i];
}
map<long long, long long> m;
long long sum = 0;
m[sum]++;
for(i = 0; i < n; i++){
sum += a[i];
m[sum]++;
}
long long cnt = 0;
for(auto iter: m){
cnt += (iter.second)*(iter.second - 1)/2;
}
cout << cnt << endl;
}
| 0
| 59,897,485
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,f,n) for(int i=f; i<(n); i++)
int main()
{
int ans = 0;
int n, m;
cin >> n >> m;
int k[m];
vector<vector<int>> s(m);
vector<int> p(m);
REP(i,0,m){
cin >> k[i];
s[i].resize(k[i]);
REP(j,0,k[i]){
cin >> s[i][j];
s[i][j]--;
}
}
REP(i,0,m){
cin >> p[i];
}
for (int i = 0; i < (1 << n); ++i) {
bool ok = true;
REP(j,0,m) {
int c = 0;
for (int id : s[j]) {
if ((i >> id) & 1) {
++c;
}
}
c %= 2;
if (c != p[j]) {
ok = false;
}
}
if (ok) {
++ans;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
rep(i, N) cin >> A[i];
set<long long> B;
vector<long long> S;
rep(i, N) {
if (B.count(A[i])) {
S.push_back(A[i]);
B.erase(A[i]);
} else {
B.insert(A[i]);
}
}
if (S.size() < 2) {
cout << 0 << endl;
} else {
sort(S.rbegin(), S.rend());
cout << S[0] * S[1] << endl;
}
return 0;
}
| 0
| 9,068,239
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << ((K == 1) ? 0 : N - K) << "\n";
}
|
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES";} else {return "NO";}}
int main(){
int A, B, C;
cin >> A >> B >> C;
Cout(Yes(A <= C && C <= B));
}
| 0
| 19,836,548
|
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.end()
#define pb(i) push_back(i)
#define PB() pop_back()
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define Fi first
#define Se second
const int maxx=1e6+9;
void solve(){
string odd,even;
cin>>odd>>even;
int i=0;
while(i<odd.l() && i<even.l()){
cout<<odd[i]<<even[i];
++i;
}
while(i<odd.l()){
cout<<odd[i++];
}
while(i<even.l()){
cout<<even[i++];
}
}
int main() {
faster;
int t=1;
while(t-->0){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T>
string to_string(T s);
template <class S, class T>
string to_string(pair<S, T> p);
string to_string(string s);
template <class T>
string to_string(T v) {
if (v.empty()) return "{}";
string ret = "{";
auto itr = v.begin(), next = ++v.begin();
for (; next != v.end(); ++itr, ++next) ret += to_string(*itr) + ",";
ret += to_string(*itr) + "}";
return ret;
}
template <class S, class T>
string to_string(pair<S, T> p) {
return "{" + to_string(p.first) + "," + to_string(p.second) + "}";
}
string to_string(string s) { return s; }
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...);
}
struct IO {
#ifdef _WIN32
inline char getchar_unlocked() { return getchar(); }
inline void putchar_unlocked(char c) { putchar(c); }
#endif
string separator = " ";
template <class T>
inline void read(T &x) {
char c;
do {
c = getchar_unlocked();
} while (c != '-' && (c < '0' || '9' < c));
bool minus = 0;
if (c == '-') {
minus = 1;
c = getchar_unlocked();
}
x = 0;
while ('0' <= c && c <= '9') {
x *= 10;
x += c - '0';
c = getchar_unlocked();
}
if (minus) x = -x;
}
inline void read(string &x) {
char c;
do {
c = getchar_unlocked();
} while (c == ' ' || c == '\n');
x.clear();
do {
x += c;
c = getchar_unlocked();
} while (c != ' ' && c != '\n' && c != EOF);
}
template <class T>
inline void read(vector<T> &v) {
for (auto &x : v) read(x);
}
template <class Head, class... Tail>
inline void read(Head &head, Tail &... tail) {
read(head);
read(tail...);
}
template <class T>
inline void write(T x) {
char buf[32];
int p = 0;
if (x < 0) {
x = -x;
putchar_unlocked('-');
}
if (x == 0) putchar_unlocked('0');
while (x > 0) {
buf[p++] = (x % 10) + '0';
x /= 10;
}
while (p) {
putchar_unlocked(buf[--p]);
}
}
inline void write(string x) {
for (char c : x) putchar_unlocked(c);
}
inline void write(const char s[]) {
for (int i = 0; s[i] != 0; ++i) putchar_unlocked(s[i]);
}
template <class T>
inline void write(vector<T> v) {
for (auto itr = v.begin(); itr + 1 != v.end(); ++itr) {
write(*itr);
write(separator);
}
write(v.back());
}
template <class Head, class... Tail>
inline void write(Head head, Tail... tail) {
write(head);
write(separator);
write(tail...);
}
void set_separator(string s) { separator = s; }
} io;
int main() {
int N;
io.read(N);
vector<int> A(N);
io.read(A);
int ans = 0;
vector<Pii> P(N);
REP(i, N) P[i] = Pii(A[i], i);
sort(ALL(P));
REP(i, N) if (i % 2 != P[i].second % 2) ans++;
io.write(ans / 2);
io.write("\n");
return 0;
}
| 0
| 26,653,319
|
#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main(){
int w,h;
vector<string> f(30);
vector< vector<int> > g(30,vector<int>(30,0));
int count = 0;
int count2 = 0;
while(1){
cin >> w >> h;
if(w == 0 && h == 0){
break;
}
for(int i = 0;i < h; i++){
cin >> f[i];
}
for(int i = 0;i < h; i++){
for(int j = 0;j < w;j++){
g[i][j] = 0;
}
}
count = 0;
count2 = 0;
while(1){
for(int i = 0; i < h; i++){
for(int j = 0; j < w;j++){
if(f[i][j] == '@' && count== 0){
g[i][j] = 1;
count2++;
}else if(g[i][j] == 1){
if(i != 0){
if(f[i-1][j] == '.'){
if(g[i-1][j] == 0){
count2++;
}
g[i-1][j] = 1;
}
}
if(i != h-1){
if(f[i+1][j] == '.'){
if(g[i+1][j] == 0){
count2++;
}
g[i+1][j] = 1;
}
}
if(j != 0){
if(f[i][j-1] == '.'){
if(g[i][j-1] == 0){
count2++;
}
g[i][j-1] = 1;
}
}
if(j != w-1){
if(f[i][j+1] == '.'){
if(g[i][j+1] == 0){
count2++;
}
g[i][j+1] = 1;
}
}
}else{}
}
}
if(count == count2){
cout << count << endl;
break;
}
count = count2;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define li long
#define pb push_back
#define mem(arr,x) memset(arr,x,sizeof(arr))
ll n;
vector<ll>adj[100001];
ll dp[100001][2];
ll totalWays(ll node,ll parent,ll color)
{
if(dp[node][color]!=-1) return dp[node][color];
ll total=1;
for(auto child : adj[node])
{
ll count=0;
if(child!=parent)
{
if(color==0)
count+=totalWays(child,node,1)%MOD;
else
count+=totalWays(child,node,0)+totalWays(child,node,1)%MOD;
total=((total%MOD)*(count%MOD))%MOD;
}
}
dp[node][color]=total%MOD;
return total%MOD;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
ll i,u,v;
for(i=0;i<n-1;i++)
{
cin>>u>>v;
adj[u].pb(v);
adj[v].pb(u);
}
mem(dp,-1);
cout<<(totalWays(1,-1,0)%MOD+totalWays(1,-1,1)%MOD)%MOD;
return 0;
}
| 0
| 46,472,349
|
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) {
return max(max(a, b), c);
}
int Min(int(a), int(b), int(c)) {
return min(min(a, b), c);
}
int main() {
int A, B;
cin >> A >> B;
char S = 'x';
if (A + B == 15) {
S = '+';
}
else if (A * B == 15) {
S = '*';
}
cout << S << endl;
}
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
class Solution {
public:
int solve(vector<int>& A, vector<int>& B) {
const long long MOD = 1e9 + 7;
int n = A.size();
int m = B.size();
vector<vector<long long>> dp(n + 1, vector<long long>(m + 1, 0));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (A[i] == B[j]) {
(dp[i + 1][j + 1] += (dp[i][j] + 1)) %= MOD;
}
(dp[i + 1][j + 1] += dp[i + 1][j] + dp[i][j + 1] + MOD - dp[i][j]) %= MOD;
}
}
long long res = dp[n][m];
res += 1;
res %= MOD;
return res;
}
};
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> A(n);
vector<int> B(m);
for (int i = 0; i < n; ++i) {
cin >> A[i];
}
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
Solution sol;
cout << sol.solve(A, B) << "\n";
return 0;
}
| 0
| 76,303,563
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0)
typedef long double ld;
#define maxn 1001
int N, A[maxn];
int32_t main()
{
cin>>N;
ld sm = 0;
FOR(i,1,N){
cin>>A[i];
sm += (ld)1 / (ld)A[i];
}
cout<<setprecision(8)<<ld(1) / sm;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll nature(ll a){
return max(a,-1*a);
}
int main(){
ll N,sumprice;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++){
cin>>A.at(i);
if(i==0){sumprice=nature(A.at(0));}
if(i>0){sumprice+=nature(A.at(i)-A.at(i-1));}
if(i==N-1){sumprice+=nature(A.at(N-1));}
}
ll memo=sumprice;
for(ll i=0;i<N;i++){
if(i==0){sumprice+=nature(A.at(1))-nature(A.at(0))-nature(A.at(1)-A.at(0));}
else if(i==N-1){sumprice+=nature(A.at(N-2))-nature(A.at(N-1))-nature(A.at(N-2)-A.at(N-1));}
else{sumprice+=nature(A.at(i+1)-A.at(i-1))-nature(A.at(i)-A.at(i-1))-nature(A.at(i)-A.at(i+1));}
cout<<sumprice<<endl;
sumprice=memo;
}
}
| 0
| 52,041,635
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
ll ans = 0, N, M;
vector<vector<ll>> G;
void dfs(ll now, vector<ll> seen){
seen[now] = 1;
for(ll i=1; i<=N; i++){
if (seen[i] == 0)
break;
if (i == N){
ans++;
return;
}
}
for(auto v: G[now]){
if (seen[v])
continue;
dfs(v, seen);
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
cin >>N >>M;
G.assign(N+1, vector<ll>(0,0));
vector<ll> seen(N+1,0);
rep(i,M){
ll a,b; cin>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
dfs(1, seen);
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
typedef unsigned long long int ulli;
#define int ll
#define F first
#define S second
#define endl "\n"
#define MP make_pair
#define PB push_back
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define all(v) v.begin(),v.end()
#define REP(i,n) for (int i = 0; i < n;i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define PRECISION(x) cout << fixed << setprecision(x);
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x) cout << '>' << #x << ':' << x << endl;
const int MAXN = 1000005;
const int MOD = 1000000007;
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
bool isPrime(int n);
void solve()
{
int n,m;
queue<int> q;
cin >> n >> m;
vi visited(n+1,0), path(n+1,0);
vvi neigh(n+1);
REP(i,m){
int a,b;
cin >> a >> b;
neigh[a].PB(b);
neigh[b].PB(a);
}
q.push(1);
visited[1] = 1;
while(!q.empty()){
int cur = q.front();
q.pop();
for(auto i:neigh[cur])
if(!visited[i]){
path[i] = cur;
q.push(i);
visited[i] = 1;
}
}
FOR(i,1,n+1)
if(!visited[i]){
cout << "No";
return;
}
cout << "Yes \n";
FOR(i,2,n+1)
cout << path[i] << endl;
}
signed main()
{
FAST_IO
int t=1;
WL(t){ solve(); cout<<endl; }
return 0;
}
bool isPrime(int n){
if(n<2)
return false;
for(int i=2;i*i<=n;i++)
if(!(n%i))
return false;
return true;
}
| 0
| 62,495,586
|
#include<iostream>
#include<list>
#include<cstring>
#include<algorithm>
#include <utility>
#include<stdio.h>
#include<climits>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int main(){
int n,x,y;
int i,j,k,l;
string str;
cin >> n;
for(i = 0;i < n;i++){
cin >> str;
x = 0;
l = 1;
for(k = 0;k < str.length();k++){
switch(str[k]){
case 'm':
x += l*1000;
l = 1;
break;
case 'c':
x += l*100;
l = 1;
break;
case 'x':
x += l*10;
l = 1;
break;
case 'i':
x += l;
l = 1;
break;
default:
l = str[k]-'0';
break;
}
}
cin >> str;
y = 0;
l = 1;
for(k = 0;k < str.length();k++){
switch(str[k]){
case 'm':
y += l*1000;
l = 1;
break;
case 'c':
y += l*100;
l = 1;
break;
case 'x':
y += l*10;
l = 1;
break;
case 'i':
y += l;
l = 1;
break;
default:
l = str[k]-'0';
break;
}
}
x += y;
if(x/1000){
if(x/1000>1) cout << x/1000;
cout << 'm';
x %= 1000;
}
if(x/100){
if(x/100>1) cout << x/100;
cout << 'c';
x %= 100;
}
if(x/10){
if(x/10>1) cout << x/10;
cout << 'x';
x %= 10;
}
if(x){
if(x>1) cout << x;
cout << 'i';
}
cout << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}
const ll mod=1'000'000'007;
const ll inf=1'000'000'000'000'000'00;
const int INF=1'000'000'000;
const double EPS=1e-10;
const double PI=acos(-1);
int main(){
cin.tie(0);ios::sync_with_stdio(false);
int n;
cin>>n;
string s;
cin>>s;
if(n%2){
cout<<"No"<<endl;
}else{
if(s.substr(0,n/2)==s.substr(n/2,n/2)) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
| 0
| 8,932,799
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define rep(i, n) REP(i, 0, n)
#define REP(i, x, n) for(int i = x; i < n; i++)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define ALL(v) (v).begin() , (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define COUT(x) cout << (x) << endl
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; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s, t; cin >> s >> t;
int ans = 0;
if(s[0] == t[0]) ans++;
if(s[1] == t[1]) ans++;
if(s[2] == t[2]) ans++;
COUT(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
class P
{
public:
int x,y;
P(int X,int Y)
{
x=X;
y=Y;
}
};
int main()
{
stack<P>st;
int n,m;
int numX[4]={0,1,0,-1};
int numY[4]={1,0,-1,0};
while(cin>>n>>m && n)
{
int flag[500][500]={};
int count=0;
string in;
char set[500][500]={};
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin >> set[i][j];
}
}
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(set[i][j]=='@')
{
st.push(P(j,i));
flag[i][j]=1;
}
}
}
int xx,yy;
while(!st.empty())
{
count++;
xx=st.top().x;
yy=st.top().y;
st.pop();
for(int i=0;i<4;i++)
{
if(set[numY[i]+yy][numX[i]+xx]=='.' && flag[numY[i]+yy][numX[i]+xx]==0)
{
st.push(P(numX[i]+xx,numY[i]+yy));
flag[numY[i]+yy][numX[i]+xx]=1;
}
}
}
cout << count << endl;
}
return 0;
}
| 0
| 67,620,884
|
#include <iostream>
using namespace std;
int memo[45] = {0};
int Fibonacci(int n) {
if(n == 0 || n == 1) return memo[n] = 1;
if(memo[n] != 0) {
return memo[n];
}
return memo[n] = Fibonacci(n - 2) + Fibonacci(n - 1);
}
int main() {
int n;
cin >> n;
cout << Fibonacci(n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m;
int nmin;
int nmax;
int ps[1000000];
int main() {
while (1) {
scanf("%d%d%d", &m, &nmin, &nmax);
if ((m|nmin|nmax) == 0) return 0;
for (int i=0; i<m; i++) {
scanf("%d", &ps[i]);
}
int ans;
int md = -1;
for (int i=nmax; i>=nmin; i--) {
int d = -(ps[i] - ps[i-1]);
if (d > md) {
md = d;
ans = i;
}
}
printf("%d\n", ans);
}
}
| 0
| 68,855,451
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int _cnt = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
++cnt;
} else {
++_cnt;
}
}
printf("%d\n", min(cnt, _cnt) * 2);
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
#define coutfix(i) cout << fixed << setprecision(i)
using namespace std;
int main()
{
int64 nn;
cin >> nn;
multiset<int64> aa;
vector<int64> memo(nn);
for(int64 ii = 0;ii < nn;ii++)
{
cin >> memo[ii];
aa.insert(memo[ii]);
}
for(int64 ii = 0;ii < nn;ii++)
{
auto ite = aa.end();
ite--;
if(*ite == memo[ii])
{
ite--;
}
cout << *ite << endl;
}
return 0;
}
| 0
| 97,126,719
|
#include<iostream>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
if((n*500)>=k)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long num, Yen, Bis;
long long cnt = 1;
long long hYen = 0;
cin >> num >> Yen >> Bis;
if(Yen+1 >= Bis){
cnt += num;
}else{
for(int i = 0; i < num; i++){
if(i == 0 && num % 2 == 1){
cnt++;
continue;
}
if(hYen > 0){
cnt += Bis;
hYen--;
continue;
}else if(i == num-1){
cnt++;
continue;
}else if(cnt >= Yen){
cnt -= Yen;
hYen++;
}else{
cnt++;
}
}
}
cout << cnt << endl;
}
| 0
| 82,625,945
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n,m;cin>>n>>m;
map<int,int> mp;
mp[0]=1;
int sm=0;
ll ans=0;
for (int i=0;i<n;i++) {
int a;cin>>a;
sm=(sm+a)%m;
ans+=mp[sm];
mp[sm]++;
}
cout<<ans<<endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iterator>
#include<iomanip>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<complex>
using namespace std;
#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector< vector<int> > mat;
template<class T> bool chmax(T &a, const 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 true; } return false; }
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int N;
int D[100010],OD[100010],OP[100010];
int SSZ[100010];
vector<pii> ANS;
int CD[100010];
vector<int> G[100010];
void dfs(int idx,int par,int cnt)
{
CD[idx]=cnt;
for(auto e:G[idx])
{
if(e==par)continue;
dfs(e,idx,cnt+1);
}
}
bool func()
{
dfs(0,-1,0);
int t=0;
rep(i,0,N)
{
t+=CD[i];
}
return t==D[0];
}
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin>>N;
rep(i,0,N)
{
cin>>OD[i];
D[i]=OD[i];
}
sort(D,D+N);
rep(i,0,N)
{
int op=lower_bound(D,D+N,OD[i])-D;
OP[op]=i;
}
bool ok=true;
rrep(i,1,N)
{
SSZ[i]++;
int sd=D[i]-(N-SSZ[i]*2);
int idx=lower_bound(D,D+N,sd)-D;
if(idx==N||idx==i||D[idx]!=sd)
{
ok=false;
break;
}
SSZ[idx]+=SSZ[i];
ANS.push_back(mp(idx,i));
G[idx].push_back(i);
G[i].push_back(idx);
}
if(!ok||!func())
{
cout<<-1<<endl;
return 0;
}
for(auto p:ANS)
{
cout<<OP[p.first]+1<<" "<<OP[p.second]+1<<endl;
}
return 0;
}
| 0
| 76,291,340
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
ll h, n;
cin >> h >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
{
cin >> a[i] >> b[i];
}
vector<vector<ll>> dp(n + 1, vector<ll>(h + 1, INF));
for (int i = 0; i <= n; i++)
{
dp[i][0] = 0;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j <= h; j++)
{
if (j < a[i])
{
dp[i + 1][j] = min(dp[i][j], ((j + a[i] - 1) / a[i]) * b[i]);
}
else
{
dp[i + 1][j] = min(dp[i + 1][j - a[i]] + b[i], min(dp[i][j], (j + a[i] - 1) / a[i] * b[i]));
}
}
}
cout << dp[n][h] << endl;
return 0;
}
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;}
#define ECHO(x) cout<<x<<endl;
#define MEMSET(a, n, x) REP(i, n) a[i]=x;
#define ARRIN(a, n) REP(i, n) cin>>a[i];
#define LL long long
int INF = 2147483647;
LL LINF = 9223372036854775807;
LL MOD = 1000000007;
typedef pair<int, int>P;
typedef pair<LL, LL>PL;
typedef vector<int> vi;
typedef vector<LL> vl;
int main(){
int n,m;
cin>>n>>m;
LL x[n], y[m];
ARRIN(x, n);
ARRIN(y, m);
LL xsum=0, ysum=0, w;
for(LL i=0; i<n-1; ++i){
w = (x[i+1]-x[i])*(i+1)%MOD;
w = w*(n-i-1)%MOD;
xsum =(xsum+w)%MOD;
}
for(LL i=0; i<m-1; ++i){
w = (y[i+1]-y[i])*(i+1)%MOD;
w = w*(m-i-1)%MOD;
ysum =(ysum+w)%MOD;
}
LL ans = xsum*ysum;
ans%=MOD;
ECHO(ans);
return 0;
}
| 0
| 81,653,107
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long s;
cin >> s;
if(s == 1e18){
long long a = 1e9;
printf("0 0 %lld 1 0 %lld\n", a, a);
return 0;
}
long long x0 = 0, y0 = 0, x1, y1 = 0, x2 = 0, y2;
x1 = 1e9;
y1 = 1;
x2 = 1e9 - (s % (long long)1e9);
y2 = (s+x2) / 1e9;
cout << x0 << " " << y0 << " " << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int main() {
int h;
cin >> h;
vector<int> a(h+1);
for (int i=1; i<=h; i++)
cin >> a[i];
for (int i=1; i<=h; i++) {
cout << "node " << i << ": ";
cout << "key = " << a[i] << ", ";
if (i != 1) {
cout << "parent key = " << a[i/2] << ", ";
}
if (i * 2 <= h) {
cout << "left key = " << a[i*2] << ", ";
}
if (i * 2 + 1 <= h) {
cout << "right key = " << a[i*2+1] << ", ";
}
cout << endl;
}
return 0;
}
| 0
| 65,593,662
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
cout << (expr ? "Yes" : "No") << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, M;
cin >> N >> M;
vector<int> A(M);
REP(i, M) cin >> A[i];
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
vector<string> dp(N+1, "x");
dp[0] = "";
FOR(i, 1, N+1) {
REP(j, M) {
if(i-num[A[j]] >= 0) {
if(dp[i-num[A[j]]] == "x") continue;
if(dp[i] == "x" || dp[i-num[A[j]]].size() >= dp[i].size()) {
dp[i] = dp[i-num[A[j]]] + (char)(A[j] + '0');
} else if(dp[i-num[A[j]]].size() + 1 == dp[i].size()) {
dp[i] = max(dp[i], dp[i-num[A[j]]] + (char)(A[j] + '0'));
}
}
}
}
cout << dp[N] << endl;
}
|
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
a *=b;
if(a&1) cout<<"Odd"<<endl;
else cout<<"Even"<<endl;
return 0;
}
| 0
| 48,987,679
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
#define rep(i, n) for(long long i=0; i<n; i++)
#define reps(i, s, e) for(long long i=s; i<e; i++)
#define repr(i, n) for(long long i=n-1; i>=0; i--)
#define reprs(i, s, e) for(long long i=e-1; i>=s; i--)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll h, w; cin >> h >> w;
if(h == 1 || w == 1){
cout << 1 << endl;
}
else if(h % 2 == 1 && w % 2 == 1){
cout << (h * w + 1) / 2 << endl;
}
else{
cout << (h * w) / 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define debug(x) cerr << (x) << '\n';
#define bits(x,i) ((x >> i) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int N = 600005;
pair<int,int> b[N];
int n, a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for(int i=0;i<(1 << n);++i) {
cin >> a[i];
b[i].first = a[0];
}
for (int m = 1; m < (1 << n); ++m){
for (int s= m; s; s = (s-1) & m){
if (b[m].first < a[s]) {
b[m].second = b[m].first;
b[m].first = a[s];
}
else if (b[m].second < a[s]) b[m].second = a[s];
}
}
int ans = 0;
for(int m=1;m<(1 << n);++m) {
ans = max(ans, b[m].first + b[m].second);
cout << ans << '\n';
}
}
| 0
| 29,656,185
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int q;
cin >> str;
cin >> q;
for (int i = 0; i < q; i++) {
string s;
cin >> s;
if (s == "print") {
int a, b;
cin >> a >> b;
cout << str.substr(a, b - a + 1) << endl;
} else if (s == "reverse") {
int a, b;
cin >> a >> b;
reverse(str.begin() + a, str.begin() + b + 1);
} else if (s == "replace") {
int a, b;
string p;
cin >> a >> b >> p;
str.replace(a, b - a + 1, p);
}
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SORT(list) sort(ALL((list)));
#define MOD 1000000007
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<ll>a(n),b(n);
ll diffa = 0,diffb = 0;
REP(i,n){
cin >> a[i];
}
REP(i,n)cin >> b[i];
REP(i,n){
if(a[i] > b[i])diffb+=a[i]-b[i];
else if(a[i] < b[i])diffa+=(b[i]-a[i])/2;
}
cerr << diffa << " " << diffb << endl;
if(diffa < diffb)cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
}
| 0
| 13,592,851
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
int substract = 2 * a[2] - a[1] - a[0];
if (substract % 2 == 0)
{
cout << substract / 2 << endl;
}
else
{
cout << substract / 2 + 2 << endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<vector<ll> >;
using vvc = vector<vector<char> >;
using vd = vector <double>;
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
#define sortp(d) sort(d.begin(),d.end())
#define sortm(d) sort(d.rbegin(),d.rend())
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
int wa(ll x)
{
ll sum = 0;
while(x!=0){
sum += x% 10;
x /= 10;
}
return sum;
}
ll p=0,q=0,r=0;
int main()
{
string o,e,s;
s=o;
s+=e;
cin>>o>>e;
if (o.size()>e.size())
{
rep(i,o.size())
{
if(i==o.size()-1)
{
cout<<(o[i]);
}else
{
cout<<(o[i]);
cout<<(e[i]);
}
}
}else
{
rep(i,o.size())
{
cout<<(o[i]);
cout<<(e[i]);
}
}
}
| 0
| 3,581,098
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
const double PI = acos(-1);
const int mod = 1e9+7;
const long long INF = (1LL << 60);
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
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 stringcount(string s, char c){return count(s.cbegin(), s.cend(), c);}
bool isInteger(double x){return floor(x) == x;}
ll ceil(ll a, ll b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmax(T &a, const T &b){ if(a < b){ a=b; return 1; } return 0; }
template<class T> inline 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);
ll n, m;
cin >> n >> m;
vector<ll> a(n), b(n), c(m), d(m);
rep(i, 0, n) cin >> a[i] >> b[i];
rep(i, 0, m) cin >> c[i] >> d[i];
vector<ll> ans(n, 0);
rep(i, 0, n){
ll dmin = INF;
ll check = -1;
rep(j, 0, m){
ll sum = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if(dmin > sum){
dmin = sum;
check = j;
}
}
ans[i] = check+1;
}
rep(i, 0, n) cout << ans[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<int, int> pi;
typedef pair<lli, int> pii;
int main()
{
lli n, m, v, p;
cin >> n >> m >> v >> p;
vector<lli> a(n);
for(auto &x: a) cin >> x;
sort(a.begin(), a.end(), greater<lli>());
lli lo = p, hi = n-1, mid, ans = p-1;
while(lo <= hi){
mid = (hi+lo)/2;
lli x = a[mid]+m;
lli ex = (v-1)-(n-mid-1);
lli pp = p;
ex -= (pp-1);
ex *= m;
bool fl = true;
for(lli i=pp-1; i<mid; i++){
if(a[i] > x)fl = false;
else{
ex -= (x-a[i]);
}
}
if(fl) fl = ex <= 0LL;
if(fl){
ans = mid;
lo = mid+1;
}
else{
hi = mid-1;
}
}
cout << ans+1 << "\n";
return 0;
}
| 0
| 52,805,578
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string>A(N);
for(int i=0; i<N; i++)cin >> A.at(i);
string ans="Yes";
for(int i=0; i<N-1; i++){
if(A.at(i).at(A.at(i).size()-1)!=A.at(i+1).at(0))ans="No";
}
sort(A.begin(), A.end());
for(int i=0; i<N-1; i++){
if(A.at(i)==A.at(i+1))ans="No";
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int a = 0;
string S;
cin >> S;
if (S.size() == 2) {
if (S.at(0) == S.at(1))
cout << "1 2" << endl;
else cout << "-1 -1" << endl;
return 0;
}
for (int i = 2; i < S.size(); i++) {
if (S.at(i - 2) == S.at(i - 1)) {
cout << i - 1 << ' ' << i << endl;
return 0;
}
else if (S.at(i - 2) == S.at(i)) {
cout << i - 1 << ' ' << i + 1 << endl;
return 0;
}
}
cout << "-1 -1" << endl;
return 0;
}
| 0
| 27,741,293
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k; cin >> k;
vector<ll> a(k); for (int i = 0; i < k; i++) cin >> a[i];
ll min = 2, max = 2;
for (int i = k-1; i >= 0; i--) {
ll n = (min + a[i] - 1) / a[i] * a[i];
ll nn = max / a[i] * a[i] + a[i] - 1;
if (n > max || nn < min) {
cout << -1 << endl;
return 0;
}
min = n;
max = nn;
}
cout << min << " " << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
string devide[4] = {"dream", "dreamer","erase","eraser"};
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(int i=0;i<4;i++){
reverse(devide[i].begin(),devide[i].end());
}
bool can = true;
for(int i=0;i<s.length();)
{
bool can2 = false;
for(int j =0;j<4;j++)
{
string d = devide[j];
if(s.substr(i,d.size()) == d){
can2 = true;
i +=d.size(); }
}
if(!can2){
can = false;
break; }
}
if(can)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
| 0
| 90,309,733
|
#include<map>
#include<set>
#include<list>
#include<ctime>
#include<cmath>
#include<deque>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<iostream>
#include<algorithm>
#define rep(i,s,t) for(register int i=s;i<=t;++i)
#define _rep(i,s,t) for(register int i=s;i>=t;--i)
#define Rep(i,s,t) for(register int i=s;i<t;++i)
#define go(x) for(register int e=las[x];e;e=nxt[e])
#define re register
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define pii pair<int,int>
#define ms(f,x) memset(f,x,sizeof f)
#define mc(f,x) memcpy(f,x,sizeof f)
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
#define gi(x) read(x)
#define gii(x,y) read(x),read(y)
#define giii(x,y,z) read(x),read(y),read(z)
namespace IO{
#define gc getchar()
#define pc(x) putchar(x)
template<typename T>inline void read(T &x){
x=0;int f=1;char ch=gc;while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=gc;}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=gc;x*=f;return;
}
template<typename T>inline void write(T x=0){
T wr[51];wr[0]=0;if(x<0)pc('-'),x=-x;if(!x)pc(48);
while(x)wr[++wr[0]]=x%10,x/=10;while(wr[0])pc(48+wr[wr[0]--]);return;
}
}
using IO::read;
using IO::write;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
const int N=2e5+11;
int n,ans;
int sz[N],x[N],y[N];
ll a[N],sum[N];
struct node{
ll d;
int id;
inline void in(){
gi(d);
}
inline bool operator<(node A)const{
return d<A.d;
}
}p[N];
int main(){
gi(n);
rep(i,1,n)
sz[i]=1,sum[i]=0;
rep(i,1,n)
p[i].in(),p[i].id=i;
sort(p+1,p+n+1);
rep(i,1,n)
a[i]=p[i].d;
_rep(i,n,2){
int pos=lower_bound(a+1,a+n+1,p[i].d-n+2*sz[p[i].id])-a;
if(a[pos]!=p[i].d-n+2*sz[p[i].id]||p[i].id==p[pos].id){
puts("-1");
return 0;
}
sz[p[pos].id]+=sz[p[i].id];
sum[p[pos].id]+=sum[p[i].id]+sz[p[i].id];
x[++ans]=p[pos].id,y[ans]=p[i].id;
}
if(sum[p[1].id]!=a[1]){
puts("-1");
return 0;
}
rep(i,1,ans)
printf("%d %d\n",x[i],y[i]);
return 0;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int N,u,k,v;
cin>>N;
int graph[N][N];
for(int i=0;i<N;i++)
for(int j=0;j<N;j++)
graph[i][j]=0;
for(int i=0;i<N;i++){
cin>>u>>k;
for(int j=0;j<k;j++){
cin>>v;
graph[u-1][v-1]=1;
}
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cout<<graph[i][j];
if(j==N-1) cout<<endl;
else cout<<" ";
}
}
return 0;
}
| 0
| 98,576,437
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define ina(x, n) rep(x_i,n) cin>>x[x_i]
#define outa(x, n) rep(x_i,n) cout<<x[x_i]<<" \n"[x_i==n-1]
typedef long long ll;
typedef vector<ll> vl;
int main() {
ll n, k; cin >> n >> k;
vl a(n), sums; ina(a,n);
rep(i,n) {
ll sum = 0;
REP(j,i,n) {
sum += a[j];
sums.pb(sum);
}
}
ll ans = 0, N = sums.size();
for (int i = 40; i >= 0; i--) {
ll t = (1LL<<i), cnt = 0;
rep(j,N) {
cnt += ((ans+t)&sums[j]) == (ans+t);
}
if (cnt >= k) ans += t;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
#include <vector>
#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<string> s(n);
vector<int> cnt(4);
rep(i,n) {
string s;
cin >> s;
rep(j,s.size()-1){
if(s[j]=='A'&&s[j+1]=='B') cnt[0]++;
}
if(s[0]=='B'){
if(s[s.size()-1]=='A') cnt[1]++;
else cnt[3]++;
}else if(s[s.size()-1]=='A') cnt[2]++;
}
if(cnt[1] >= 1){
cnt[0] += cnt[1]-1;
cnt[1] = 1;
}
cnt[0] += min(cnt[1],cnt[3]) + min(max(cnt[1],cnt[3]),cnt[2]);
cout << cnt[0] << endl;
}
| 0
| 45,830,664
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int (i)=0; (i) < (n); (i)++)
int main()
{
string S; cin >> S;
ll a, b, c, d;
a = S[0] - '0';
b = S[1] - '0';
c = S[2] - '0';
d = S[3] - '0';
ll index = 0;
string ans = "";
rep(i, (1<<3)) {
ll tmp = S[0] - '0';
ans = S[0];
index = 1;
rep (j, 3) {
if ((i >> j) & 0x01) {
tmp += S[index] - '0';
ans += '+'; ans += S[index];
}
else {
tmp -= S[index] - '0';
ans += '-'; ans += S[index];
}
index++;
}
if (tmp == 7) {
ans += "=7";
cout << ans << endl;
exit(0);
}
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
string devide[4] = {"dream", "dreamer","erase","eraser"};
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(int i=0;i<4;i++){
reverse(devide[i].begin(),devide[i].end());
}
bool can = true;
for(int i=0;i<s.length();)
{
bool can2 = false;
for(int j =0;j<4;j++)
{
string d = devide[j];
if(s.substr(i,d.size()) == d){
can2 = true;
i +=d.size(); }
}
if(!can2){
can = false;
break; }
}
if(can)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
| 0
| 13,393,758
|
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#include <iomanip>
#include <unordered_map>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++)
{
cin >> a[i];
}
sort(a.begin(), a.end());
ll target = a[0];
ll num = 0;
ll ans = 0;
for (ll i = 0; i < N; i++)
{
if (target == a[i])
num++;
else
{
if (target != num)
{
if (target < num)
ans += num - target;
else
ans += num;
}
target = a[i];
num = 1;
}
}
if (target != num)
{
if (target < num)
ans += num - target;
else
ans += num;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int n;
cin>>n;
int A,B,C,D;
int sum=0;
A=n/1000,n%=1000;
B=n/100,n%=100;
C=n/10,n%=10;
D=n;
string s="=7";
vector<int>num={A,B,C,D};
vector<char>op(3);
for(int bit=0;bit<(1<<3);bit++){
bitset<3>s(bit);
for(int l=0;l<3;l++){
if(s.test(l)){
op[l]='+';
}else{
op[l]='-';
}
}
sum+=A;
rep(l,3){
if(op[l]=='+'){
sum+=num.at(l+1);
}else{
sum-=num.at(l+1);
}
}
if(sum==7){
cout<<A<<op.at(0)<<B<<op.at(1)<<C<<op.at(2)<<D;
cout<<"=7"<<endl;
return 0;
}else{
sum=0;
}
}
}
| 0
| 39,005,405
|
#include<iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <set>
#include <functional>
using namespace std;
int d[102];
int main()
{
int n,a,b,c,x;
while(true){
cin>>n>>a>>b>>c>>x;
int tot=0;
if(n==0){
break;
}
for(int i=0;i<n;i++){
cin>>d[i];
}
for(int i=0;i<n;i++){
if(i>0){
tot++;
x=(a*x+b)%c;
}
while(true){
if(x==d[i]){
break;
}
x=(a*x+b)%c;
tot++;
if(tot>10000){
tot=-1;
goto next;
}
}
}
next:cout<<tot<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<P> r(n), b(n);
rep(i, n)cin >> r[i].first >> r[i].second;
rep(i, n)cin >> b[i].first >> b[i].second;
sort(r.begin(), r.end(), greater<P>());
set<P> ans;
for(P v : r){
int x = v.first;
int y = v.second;
P mn = make_pair(1000, 1000);
for(P t : b){
if(x < t.first && y < t.second){
if(t.second < mn.second && ans.find(t) == ans.end())mn = t;
}
}
if(mn != make_pair(1000, 1000))ans.insert(mn);
}
cout << ans.size() << endl;
}
| 0
| 45,066,995
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n+1); i++)
#define repr(i,n) for (ll i = (n-1); i>=0;i--)
#define repr3(i,n) for(ll i = (n);i>0;i--)
#define repr4(i,s,n) for(ll i = (n);i>=(s);i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll,ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
const int mod = 1000000007;
int main(){
string S;
cin>>S;
string ans="";
rep(i,1<<3){
int sum=S[0]-'0';
rep3(j,3){
if((i>>(j-1))&1){
sum+=S[j]-'0';
}
else{
sum-=S[j]-'0';
}
}
if(sum==7){
ans+=string(1,S[0]);
rep3(j,3){
if((i>>(j-1))&1){
ans+=string(1,'+');
ans+=string(1,S[j]);
}
else{
ans+=string(1,'-');
ans+=string(1,S[j]);
}
}
ans+="=7";
break;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
char table[110][110];
const int inf = 1010;
void chmin(int &a, int b){
if( a > b ){ swap(a,b);}
return ;
}
signed main(void){
int h,w; cin >> h >> w;
vector<vector<int>> dp(h,vector<int>(w,inf));
dp[0][0] = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> table[i][j];
}
}
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if( i < h-1 ){
int c = ( table[i][j] == '.' && table[i+1][j] == '#' );
chmin(dp[i+1][j],dp[i][j]+c);
}
if( j < w-1 ){
int c = ( table[i][j] == '.' && table[i][j+1] == '#' );
chmin(dp[i][j+1],dp[i][j]+c);
}
}
}
int d = (table[0][0] == '#' );
cout << dp[h-1][w-1]+d << endl;
return 0;
}
| 0
| 46,259,344
|
#include <iostream>
using namespace std;
int main()
{
for(int a=1;a<=9;a++)
{
for(int b=1;b<=9;b++)
cout << a << "x" << b << "=" << a*b <<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
namespace output {
void pr(int x) { cout << x; }
void pr(long x) { cout << x; }
void pr(ll x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(ld x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char* x) { cout << x; }
void pr(const string& x) { cout << x; }
void pr(bool x) { pr(x ? "true" : "false"); }
template<class T> void pr(const complex<T>& x) { cout << x; }
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T> void pr(const T& x);
template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
pr(t); pr(ts...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void pr(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
void print() { pr("\n"); }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(" "); print(ts...);
}
}
using namespace output;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string S; cin >> S;
int X, Y; cin >> X >> Y;
bitset<16001> pxs;
bitset<16001> pys;
pxs[0+8000] = true;
pys[0+8000] = true;
bool isX = true;
F0R(k, S.size()) {
if (S[k] == 'T') {isX = !isX; continue;}
int j = k;
while (j < S.size() && S[j] == 'F') ++j;
bitset<16001> newpxs;
bitset<16001> newpys;
int dist = j - k;
F0R(i, 16001) {
if (isX) {
if (pxs[i] && i + dist < 16001) newpxs[i+dist] = true;
if (k > 0 && pxs[i] && i - dist >= 0) newpxs[i-dist] = true;
} else {
if (pys[i] && i + dist < 16001) newpys[i+dist] = true;
if (pys[i] && i - dist >= 0) newpys[i-dist] = true;
}
}
if (isX) pxs = newpxs;
else pys = newpys;
k = j - 1;
}
print((pxs[X + 8000] && pys[Y + 8000]) ? "Yes" : "No");
}
| 0
| 24,415,712
|
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str,tmp,command;
int q,a,b;
cin>>str>>q;
for(int i=1;i<=q;i++){
cin>>command>>a>>b;
if(command=="print"){
cout<<str.substr(a,b-a+1)<<endl;
}else if(command=="reverse"){
tmp=str.substr(a,b-a+1);
for(int i=a;i<=b;i++)str[i]=tmp[b-i];
}else{
cin>>tmp;
for(int i=a;i<=b;i++)str[i]=tmp[i-a];
}
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
int main()
{
int N;
string S;
cin >> N >> S;
string T = S.substr(0, N / 2);
if (T + T == S) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 64,817,100
|
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ull unsigned long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define vt vector
#define vll vt<ll>
#define pll pair<ll,ll>
#define vpll vt<pll>
#define vvll vt<vll>
#define all(v) v.begin(),v.end()
#define FOR(i,n) for(ll i=0;i<n;i++)
#define ffo(i,a,b) for(ll i=a;i<=b;i++)
#define rfo(i,a,b) for(ll i=a;i>=b;i--)
#define space cout<<"\n\n";
#define endl "\n"
#define pqmx priority_queue<ll>
#define pqmn priority_queue<ll,vll,greater<ll>>
#define fps(x,y) fixed<<setprecision(y)<<x
#define merg(a,b,c) set_union(a.begin(),a.end(),b.begin(),b.end(),inserter(c,c.begin()))
#define set_ar(arr,v) memset(arr,v,sizeof(arr))
#define go_t int testcases; cin>>testcases; ffo(caseno,1,testcases)
#define ctime auto start = high_resolution_clock::now()
#define etime auto stop = high_resolution_clock::now()
#define ptime auto z1z = duration_cast<microseconds>(stop-start); cout<<"Time elapsed : "<<z1z.count()<<" microseconds\n"
#define dbg1(x) cout <<#x<<": "<<x<<'\n';
#define dbg2(x, y) cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<'\n';
#define dbg3(x, y, z) cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<'\n';
#define dbg4(a, b, c, d) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<'\n';
#define dbg5(a, b, c, d, e) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<<": "<<e<<'\n';
const ll mod = 1e9 + 7;
const ll N = 1e6 + 6;
const ll maxN = 1e5 + 5;
const ll MAX_SIZE = 2e6 + 6;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const double PI = 3.14159265359;
ll powerM(ll x, ll y, ll M = mod) {
ll v = 1; x = x % M; while (y > 0) {if (y & 1)v = (v * x) % M; y = y >> 1; x = (x * x) % M;} return v;
}
ll power(ll x, ll y) {
ll v = 1; while (y > 0) {if (y & 1)v = v * x; y = y >> 1; x = x * x;} return v;
}
ll n;
ll cache[maxN][2];
vector<ll> g[maxN];
ll dfs(ll k, ll par, ll col)
{
ll &ans = cache[k][col];
if (ans != -1)
return ans;
ans = 1;
for (auto &it : g[k])
{
if (it == par)
continue;
if (!col)
ans *= (dfs(it, k, 0) + dfs(it, k, 1));
else
ans *= dfs(it, k, 0);
ans %= mod;
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in1.txt", "r", stdin);
freopen("out1.txt", "w", stdout);
#endif
FIO
memset(cache, -1, sizeof(cache));
cin >> n;
for (ll i = 1; i <= n - 1; i++)
{
ll u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
ll ans = dfs(1, 1, 0) + dfs(1, 1, 1);
ans %= mod;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#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++)
int INF=1e9+7;
vvi d;
vi r;
int R,ans=INF;
vb used;
void dfs(int sum,int last,int num) {
if(num==R) {
ans=min(ans,sum);
return;
}
rep(i,R) {
if(used[i]) continue;
used[i]=true;
if(last==-1) dfs(0,i,1);
else dfs(sum+d[r[last]][r[i]],i,num+1);
used[i]=false;
}
}
int main() {
int N,M;
cin >> N >> M >> R;
r=vi(R);
rep(i,R) {
cin >> r[i];
r[i]--;
}
vi A(M),B(M),C(M);
d=vvi(N,vi(N,INF));
rep(i,N) d[i][i]=0;
rep(i,M) {
cin >> A[i] >> B[i] >> C[i];
A[i]--;B[i]--;
d[A[i]][B[i]]=C[i];
d[B[i]][A[i]]=C[i];
}
rep(i,N) {
rep(j,N-1) {
rep2(k,j+1,N) {
d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
d[k][j]=min(d[j][k],d[j][i]+d[i][k]);
}
}
}
used=vb(R);
dfs(0,-1,0);
cout << ans << endl;
}
| 0
| 16,064,692
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
double ans = 0;
for(int i = 0; i < n; i++){
double a; string s; cin >> a >> s;
if(s == "BTC") ans += a * 380000.0;
else ans += a;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> PlP;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll N;
cin >> N;
vector<ll> A(N), b(1000000+1,0), cc(1000001);
rep(i,N){
cin >> A[i];
}
bool flag = false;
REP(i,2,1000001){
ll cur = i;
if(b[i] != 0){
continue;
}
while(cur <= 1000000){
b[cur] = i;
cur += i;
}
}
b[0] = 1;
b[1] = 1;
rep(i,N){
if(A[i] == 1)continue;
ll n = A[i];
vector<pair<ll,int>> res;
while(n > 1){
ll p = b[n];
res.emplace_back(p,0);
while(n % p == 0){
n /= p;
res.back().second++;
}
}
for(auto& e:res){
cc[e.fi]++;
}
}
rep(i,1000001){
if(cc[i] > 1){
flag = 1;
break;
}
}
if(!flag){
cout << "pairwise coprime" << endl;
return 0;
}
ll c=A[0];
rep(i,N){
c = __gcd(c,A[i]);
}
if(c==1){
cout << "setwise coprime" << endl;
}else{
cout << "not coprime" << endl;
}
}
| 0
| 88,495,112
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,P;
cin>>N>>P;
cout<<N-P+1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int W, H, N;
cin >> W >> H >> N;
int x[N], y[N], a[N];
for(int i=0; i<N; i++){
cin >> x[i] >> y[i] >> a[i];
}
int xl=0, yd=0;
int xr=W, yu=H;
for(int i=0; i<N; i++){
if(a[i]==1){
xl=max(xl, x[i]);
}
if(a[i]==2){
xr=min(xr, x[i]);
}
if(a[i]==3){
yd=max(yd, y[i]);
}
if(a[i]==4){
yu=min(yu, y[i]);
}
}
int s=max(0, xr-xl)*max(0, yu-yd);
cout << s << endl;
return 0;
}
| 0
| 21,995,668
|
#include "bits/stdc++.h"
using namespace std;
int main() {
string A, B;
cin >> A >> B;
reverse(B.begin(),B.end());
if (A == B) {
cout << "YES"<<endl;
}
else {
cout << "NO"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define pi std::pair<int, int>
#define stdabs std::abs
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
#define vec std::vector
#define oreq |=
#define npm next_permutation
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
ll extgcd(ll a, ll b, ll& x, ll& y);
ll nCr(ll n, ll r);
void stat();
template <typename T> T fact(T num);
constexpr ll mod = 1000000000 + 7;
int main()
{
stat();
int n;
cin >> n;
vec<int> b(n - 1);
rep(i,n-1){
cin>>b[i];
}
ull ans=0;
for(int i=1;i!=n-1;++i){
ans+=min(b[i-1],b[i]);
}
ans+=b[0]+b[b.size()-1];
cout<<ans<<endl;
return 0;
}
ll extgcd(ll a, ll b, ll& x, ll& y)
{
if (b == 0) {
x = 1, y = 0;
return a;
}
ll d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
std::vector<unsigned ll> genprimevec(const unsigned ll N)
{
std::vector<bool> is_prime(N + 1);
for (unsigned ll i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<unsigned ll> P;
for (unsigned ll i = 2; i <= N; i++) {
if (is_prime[i]) {
for (unsigned ll j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
void stat(){
#ifdef local
rep(i, 2){std::cout << "local enable" << std::endl;
}
#endif
#ifdef hacks
rep(i, 2) { std::cout << "boost enable" << std::endl; }
#endif
}
ll nCr(ll n, ll r)
{
ll num = 1;
for (ll i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
template <typename T> T fact(T num)
{
if (num == 1) { return 1; }
return num * fact(num - 1);
}
| 0
| 16,561,832
|
#include <iostream>
using namespace std;
int main() {
long N, M, x[100010], y[100010], mod=1000000007; cin >> N >> M;
for(int i=0; i<N; ++i) cin >> x[i];
for(int i=0; i<M; ++i) cin >> y[i];
long XSUM=0, YSUM=0, mul, Int;
for(int i=1; i<N; ++i){
mul=(i*(N-i))%mod, Int=(x[i]-x[i-1])%mod;
XSUM=(XSUM+Int*mul)%mod;
}
for(int i=1; i<M; ++i){
mul=(i*(M-i))%mod, Int=(y[i]-y[i-1])%mod;
YSUM=(YSUM+Int*mul)%mod;
}
cout << (XSUM*YSUM)%mod << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, long long D, long long X, std::vector<long long> A){
int ans = 0;
REP(i, N) {
int count = 0;
while (true) {
if (A[i] * count + 1 <= D) count++;
else break ;
}
ans += count;
}
cout << ans + X << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
scanf("%lld",&N);
long long D;
scanf("%lld",&D);
long long X;
scanf("%lld",&X);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, D, X, std::move(A));
return 0;
}
| 0
| 93,503,770
|
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int n,k,a,max;
int set[100001];
while(1){
scanf("%d %d",&n,&k);
if(n==0 && k==0)break;
max=0;
for(int i=0;i<n;i++){
scanf("%d",&set[i]);
}
for(int i=0,sum=0;i<n-k+1;i++,sum=0){
if(set[i-1]<set[i+k-1] || i==0){
for(int j=i,l=i+k-1;;j++,l--){
sum += set[j]+set[l];
if(l-j==1){
break;
}else if(l==j){
sum-=set[j];
break;
}
}
}
if(max<sum || i==1){
max=sum;
}
}
printf("%d\n",max);
}
}
|
#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 <math.h>
#include <iomanip>
using namespace std;
#define int long long
signed main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,c,k; cin >> n >> c >> k;
vector<int> t(n);
for(int i = 0;i < n;i ++) cin >> t.at(i);
sort(t.begin(),t.end());
int ans = 0;
int saisyo = t.at(0);
int ninzu = 0;
for(int i = 0;i < n;i ++){
if(ninzu < c && t.at(i) - saisyo <= k){
ninzu ++;
continue;
}
else{
ans ++;
ninzu = 1;
saisyo = t.at(i);
continue;
}
}
cout << ans + 1 << endl;
}
| 0
| 89,546,754
|
#include<iostream>
int main()
{
int appear[100];
for (int i = 0; i < 100; i++)
{
appear[i] = 0;
}
int max = 0;
for (int num; std::cin >> num;)
{
appear[num - 1]++;
if (max < appear[num - 1])
{
max = appear[num - 1];
}
}
for (int i = 0; i < 100; i++)
{
if (appear[i] == max)
{
std::cout << i + 1 << std::endl;
}
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
class Disjoint{
private:
vector<int> S;
vector<int> rank;
int find(int x){
if (x == S[x]) {
return x;
}
return x = find(S[x]);
}
public:
Disjoint(int n) {
for (int i = 0; i < n; i++) {
S.push_back(i);
rank.push_back(0);
}
}
void unite(int x, int y){
int x_p = find(x);
int y_p = find(y);
if (rank[x_p] == rank[y_p]) {
S[x_p] = y_p;
rank[y_p]++;
return;
}
if (rank[x_p] < rank[y_p]) {
S[x_p] = y_p;
} else {
S[y_p] = x_p;
}
}
bool same(int x, int y){
return find(x) == find(y);
}
};
int main(){
int n, q;
cin >> n >> q;
Disjoint D(n);
for (int i = 0; i < q; i++) {
int command, x, y;
cin >> command >> x >> y;
if (command == 0) {
D.unite(x, y);
} else {
cout << D.same(x, y) << endl;
}
}
return 0;
}
| 0
| 14,364,368
|
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
string a, b;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
reverse(b.begin(), b.end());
cout << ((a == b) ? "YES\n" : "NO\n");
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using P = pair<int,int>;
int main(){
int n;
while(cin>>n,n){
vector<P> V;
V.clear();
for(int i=0;i<n;i++){
int hh,mm,ss;
cin>>hh;
cin.ignore();
cin>>mm;
cin.ignore();
cin>>ss;
cin.ignore();
int ts = hh*3600+mm*60+ss;
V.emplace_back(ts,+1);
cin>>hh;
cin.ignore();
cin>>mm;
cin.ignore();
cin>>ss;
cin.ignore();
int te = hh*3600+mm*60+ss;
V.emplace_back(te,-1);
}
sort(V.begin(), V.end());
int ans=0,cnt=0;
for(auto v:V){
cnt+=v.second;
ans=max(ans,cnt);
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 17,982,202
|
#include <iostream>
#include <set>
using namespace std;
int main() {
string S; cin >> S;
set<char> C;
for (int i = 0; i < 4; i++) C.insert(S[i]);
if (C.size() == 2) printf("%s\n", "Yes");
else printf("%s\n", "No");
}
|
#include <bits/stdc++.h>
typedef long long int int64;
struct vertex {
int i;
int64 val;
int size;
int parent;
int next,child;
int depth;
} v[100003];
void dfs(int i)
{
for(int j = v[i].child;j != -1;j = v[j].next) {
v[j].depth = v[i].depth + 1;
dfs(j);
}
}
int n;
bool cmp1(const vertex &a,const vertex &b) {
return a.val < b.val;
}
int main()
{
scanf("%d",&n);
for(int i = 0;i < n;++i) {
scanf("%lld",&v[i].val);
v[i].i = i + 1;
v[i].size = 1;
}
std::sort(v,v+n,cmp1);
std::map<int64,int> m;
for(int i = 0;i < n;++i) {
m[v[i].val] = i;
v[i].next = v[i].child = -1;
}
for(int i = n - 1;i >= 1;--i) {
int64 val2 = v[i].val - n + 2LL * v[i].size;
std::map<int64,int>::iterator it = m.find(val2);
if(it == m.end()) {
printf("-1\n");
return 0;
}
v[i].parent = it->second;
v[v[i].parent].size += v[i].size;
v[i].next = v[v[i].parent].child;
v[v[i].parent].child = i;
}
int64 dsum = 0;
dfs(0);
for(int i = 0;i < n;++i) {
dsum += v[i].depth;
}
if(v[0].size == n && v[0].val == dsum) {
for(int i = 1;i < n;++i) {
printf("%d %d\n", v[i].i, v[v[i].parent].i);
}
} else {
printf("-1\n");
}
}
| 0
| 74,341,529
|
#include <iostream>
using namespace std;
void swap(int &i, int &j) {
if (i == j) {
} else if (i < j) {
} else {
int tmp;
tmp = i;
i = j;
j = tmp;
}
}
int main() {
int i, j, k;
cin >> i >> j >> k;
int a, b, c;
swap(i, j);
swap(i, k);
swap(j, k);
cout << i << " " << j << " " << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b) {if (a < b){a = b;return true;}return false;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
vector<int> a;
a.push_back(0);
rep(i,n){
int t;cin>>t;
a.emplace_back(t);
}
a.push_back(0);
ll sum = 0;
for(int i=0; i<n+1; i++){
sum += abs(a[i+1]-a[i]);
}
for(int i=1; i<=n; i++){
ll ans;
if(a[i-1] < a[i+1]){
if(a[i]<a[i-1]){
ans = sum - abs(a[i-1]-a[i]) * 2;
}else if(a[i-1]<=a[i] && a[i]<=a[i+1]){
ans = sum;
}else{
ans = sum - abs(a[i+1]-a[i])*2;
}
}else if(a[i-1]>a[i+1]){
if(a[i] < a[i+1]){
ans = sum-abs(a[i+1]-a[i])*2;
} else if(a[i+1]<=a[i] && a[i]<a[i-1]){
ans = sum;
} else{
ans = sum-abs(a[i-1]-a[i])*2;
}
} else{
ans = sum - abs(a[i+1]-a[i])*2;
}
cout<<ans<<endl;
}
}
| 0
| 94,082,907
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
#define MOD2 (998244353)
#define MOD3 (1000000009)
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
ifstream cinn("ride.in");ofstream coutt("ride.out");
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
int n;
int Tsum=0;
int v[105];
signed main(){
FASTER;
cin>>n;
for(int i=0;i<n;i++)cin>>v[i],Tsum+=v[i];
int ans=INF;
for(int i=0,sum=0;i<n-1;i++){
sum+=v[i];
ans=min(ans,abs(Tsum-sum-sum));
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000 + 50;
const int mod = 1e9 + 7;
int n,k;
int h[N];
ll dp[N][N];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", h + i);
if (n == k)
{
puts("0");
return 0;
}
memset(dp, 0x3f, sizeof dp);
dp[0][0] = 0;
for (int i = 1; i <= n; ++i)
for (int l = 1; l <= n - k; ++l)
for (int j = 0; j < i; ++j)
dp[i][l] = min(dp[i][l], dp[j][l - 1] + max(0, h[i] - h[j]));
ll ans = 1e18;
for (int i = 1; i <= n; ++i)
ans = min(ans, dp[i][n - k]);
printf("%lld\n", ans);
return 0;
}
| 0
| 57,253,905
|
#include<iostream>
#include<cstdlib>
#include<cstdio>
template<int BUFSIZE>
struct ans_buf {
char buf[BUFSIZE];
int i;
ans_buf(): i(0) {}
void putZ(unsigned int v, char delim='\n') {
unsigned int k = 1;
while(k <= v/10) k*=10;
for(; k>0; v%=k, k/=10) buf[i++] = (v/k)+'0';
buf[i++] = delim;
}
void out() { std::fwrite(buf, 1, i, stdout); }
};
char inbuf[1<<18];
unsigned int getZ() {
unsigned int v = 0; int c;
while((c = getchar_unlocked()) >= '0') v=v*10+c-'0';
return v;
}
int const MAXN = 3e5;
int const MAXA = 6.4e5;
int N, m[MAXN], d[MAXN+1];
int main() {
std::setbuf(stdin, inbuf);
N = getZ();
for(int i = 0; i < N; ++i) ++m[getZ()-1];
for(int i = 0; i < N; ++i) ++d[m[i]];
ans_buf<MAXA> buf;
int sum_D = 0, sum_iD = N, k = 1;
for(int ans = N; ans >= 1; --ans) {
sum_D += d[ans];
sum_iD -= d[ans]*ans;
int next_k = sum_iD/ans + sum_D + 1;
for(int i = k; i < next_k; ++i) buf.putZ(ans);
k = next_k;
}
while(k <= N) { buf.putZ(0); ++k; }
buf.out();
return 0;
}
|
#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(long long L) {
double l = L;
cout << (l/3.0)*(l/3.0)*(l/3.0) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
long long L;
std::cin >> L;
solve(L);
return 0;
}
| 0
| 38,244,447
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) {
cin >> a[i];
}
vi b;
for (int i = n - 1; i >= 0; i -= 2) {
b.push_back(a[i]);
}
for (int i = n % 2; i < n; i += 2) {
b.push_back(a[i]);
}
rep(i, n) {
printf("%d ", b[i]);
}
printf("\n");
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <fstream>
#include <sstream>
#include <unordered_map>
#include <ctime>
using namespace std;
const unsigned long long BASE = (unsigned long long)(1e9 + 7);
#define FROM_0(i, n) for(int i = 0; i < (n); i++)
#define FROM_S(i, s, e) for(int i = (s); i < (e); i++)
#define ITER_BEGIN_END(iter, vec) for(auto iter = vec.begin(); iter != vec.end(); iter++)
int priceA[100001], priceB[100001];
int main()
{
int a, b, m;
cin >> a >> b >> m;
int minA = 200000, minB = 200000;
FROM_0(i, a)
{
cin >> priceA[i];
minA = min(minA, priceA[i]);
}
FROM_0(i, b)
{
cin >> priceB[i];
minB = min(minB, priceB[i]);
}
int minPrice = minA + minB;
FROM_0(i, m)
{
int x, y, c;
cin >> x >> y >> c;
x--;
y--;
int price = priceA[x] + priceB[y] - c;
minPrice = min(price, minPrice);
}
cout << minPrice << endl;
return 0;
}
| 0
| 66,690,809
|
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
ll ans = 0;
bool fl = true;
while (fl) {
fl = false;
ll s = 0;
vector<ll> p(N);
for (int i = 0; i < N; i++) {
p[i] = a[i] / N;
s += p[i];
}
for (int i = 0; i < N; i++) {
a[i] = a[i] - p[i] * N + (s - p[i]);
if (a[i] >= N)fl = true;
}
ans += s;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> PlP;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll X,Y,Z,K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
vector<ll> v;
rep(i,X){
cin >> A[i];
}
sort(A.rbegin(), A.rend());
rep(i,Y){
cin >> B[i];
}
sort(B.rbegin(), B.rend());
rep(i,Z){
cin >> C[i];
}
sort(C.rbegin(), C.rend());
priority_queue<pair<Pll,Pll>> que;
map<PlP,ll> mp;
ll a = 0;
ll b = 0;
ll c = 0;
mp[PlP(a,Pll(b,c))]++;
que.push(make_pair(Pll(A[a]+B[b]+C[c], a), Pll(b,c)));
rep(qqq, K){
a = que.top().first.second;
b = que.top().second.first;
c = que.top().second.second;
v.push_back(que.top().fi.fi);
que.pop();
if(a < X-1 && mp[PlP(a+1,Pll(b,c))] == 0){
mp[PlP(a+1,Pll(b,c))]++;
que.push(make_pair(Pll(A[a+1]+B[b]+C[c], a+1), Pll(b,c)));
}
if(b < Y-1 && mp[PlP(a,Pll(b+1,c))] == 0){
mp[PlP(a,Pll(b+1,c))]++;
que.push(make_pair(Pll(A[a]+B[b+1]+C[c], a), Pll(b+1,c)));
}
if(c < Z-1 && mp[PlP(a,Pll(b,c+1))] == 0){
mp[PlP(a,Pll(b,c+1))]++;
que.push(make_pair(Pll(A[a]+B[b]+C[c+1], a), Pll(b,c+1)));
}
}
rep(i,K){
cout << v[i] << endl;
}
}
| 0
| 88,398,391
|
#include<iostream>
using namespace std;
int main(){
long long int n,m;
cin>>n>>m;
if(n>m)
{
long long int temp=n;
n=m;
m=temp;
}
if(n==1&&m==1){
cout<<"1";
return 0;
}
if(n==1)
{
cout<<(m-2);
}
else
cout<<(n-2)*(m-2);
}
|
#include <iostream>
using namespace std;
int table_r[10]={0,5,3,3,3,3,3,4,3,4};
char t[10][5] = {{0,0,0,0,0},{'.', ',', '!', '?', ' '},};
int main(){
char abc='a';
for(int i=2; i<=9; i++){
for(int j=0; j<table_r[i]; j++){
t[i][j]=abc++;
}
}
int n;
cin >> n;
char buf[1025];
for(int i=0; i<n; i++){
cin >> buf;
for(int j=0; buf[j]!=0; j++){
char tmp = buf[j];
if(tmp=='0') continue;
int ct;
for(ct=0; buf[j+ct]!=0; ct++){
if(buf[j+ct]=='0'){
int k = tmp-'0';
cout << t[k][(ct-1)%table_r[k]];
j+=ct;
break;
}
}
}
cout << endl;
}
return 0;
}
| 0
| 10,229,124
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.