code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int nums[n];
for(auto i = 0; i < n; ++i){
cin >> nums[i];
}
int safe = 0;
int find = 1;
for(auto &x: nums) {
if(x == find){
safe++;
find++;
}
}
if(safe){
cout << n-safe << endl;
}else{
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef multiset<ll> S;
typedef priority_queue<ll> PQ;
typedef priority_queue<P,vector<P>,greater<P>> SPQ;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())outp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size()){rep(j,v[i].size()){if(j)cout<<' ';cout<<v[i][j];}cout<<'\n';}}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
int main() {
ll n;cin>>n;
ll a=0,b=0;
rep(i,n){
ll d,c;cin>>d>>c;
a+=c;
b+=d*c;
}
out(a-1+(b-1)/9);
}
| 0
| 99,022,127
|
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
int main(){
int N, K; cin >> N >> K;
vi H(N);
for(auto &x : H) cin >> x;
sort(all(H));
ll res=0;
for(int i=0; i<N-K; i++){
res+=H[i];
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int changeDoubleToInt(string decimal){
decimal.erase(1, 1);
int n_decimal = atoi(decimal.c_str());
return n_decimal;
}
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a%b);
}
int main(){
int n;
cin >> n;
vector<int> a(n);
int finaldown=-1, finalup=-1;
rep(i,n) cin >> a[i];
ll x=1000;
rep(i,n-1){
int s = a[i];
int t = a[i+1];
if(s<t){
ll k = x/s;
x %= s;
x += k*t;
}
}
cout << x << endl;
return 0;
}
| 0
| 28,150,270
|
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
cin>>S;
int check=0;
for(int i=0;i<(S.size()-1)/2+1;i++){
if(S[i]==S[(S.size()-1)/2+1+i]){
check++;
}
}
if(check==(S.size()-1)/2){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n, l, t, a[100001], cnt;
int main(int argc, char const *argv[])
{
scanf("%d%d%d", &n, &l, &t);
for (int i = 1; i <= n; i++)
{
int op;
scanf("%d%d", &a[i], &op);
a[i] += op == 1 ? t : -t;
cnt += a[i] / l;
if (a[i] % l < 0)
{
cnt--;
}
a[i] = (a[i] % l + l) % l;
}
sort(a + 1, a + n + 1);
cnt = (cnt % n + n) % n;
for (int i = cnt + 1; i <= n; i++)
{
printf("%d\n", a[i]);
}
for (int i = 1; i <= cnt; i++)
{
printf("%d\n", a[i]);
}
return 0;
}
| 0
| 77,541,967
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int main() {
int a, b;
cin >> a >> b;
char ans = 'x';
if (a + b == 15) ans = '+';
if (a * b == 15) ans = '*';
cout << ans << endl;
}
|
#include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<vector>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=4e18;
const ll MOD=1e9+7;
const double EPS=1e-7;
ll N,K;
P xy[100];
int main(){
cin>>N>>K;
for(ll i=0;i<N;i++){
ll x,y;
cin>>x>>y;
xy[i]=P(x,y);
}
sort(xy,xy+N);
ll ans=INF;
for(ll i=0;i<N;i++){
for(ll j=N-1;j>=i+K-1;j--){
vector<P> v;
for(ll k=i;k<=j;k++){
v.push_back(P(xy[k].second,xy[k].first));
}
ll w=xy[j].first-xy[i].first;
sort(v.begin(),v.end());
for(ll k=0;k<=v.size()-K;k++){
ll h=v[k+K-1].first-v[k].first;
ans=min(ans,h*w);
}
}
}
cout<<ans<<endl;
}
| 0
| 98,477,023
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__);
void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
cin >> t;
in(u...);
}
void out() {
cout << endl;
}
template <typename T, class... U>
void out(const T& t, const U&... u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
#define rep(i, n) for (long long i = 0; i < n; i++)
void solve();
#ifndef ONLINE_JUDGE
#include "./lib.hpp"
#endif
void solve() {
ins(s1, s2, s3);
cout << (char)toupper(s1.front());
cout << (char)toupper(s2.front());
cout << (char)toupper(s3.front());
out();
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main()
{
string s,t;
cin>>s>>t;
map<char,char> mp,gorl;
for(unsigned int i=0;i<s.size();i++)
{
if(mp[s[i]]>='a'&&mp[s[i]]<='z')
{
if(mp[s[i]]!=t[i])
{
cout<<"No";
return 0;
}
}
if(gorl[t[i]]>='a'&&gorl[t[i]]<='z')
{
if(gorl[t[i]]!=s[i])
{
cout<<"No";
return 0;
}
}
mp[s[i]]=t[i];
gorl[t[i]]=s[i];
}
cout<<"Yes";
}
| 0
| 37,442,906
|
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main(void) {
int a;
int b;
cin >> a >> b;
if (a < b) {
cout << "a < b" << endl;
} else if (a > b) {
cout << "a > b" << endl;
} else if (a == b) {
cout << "a == b" << endl;
}
return 0;
}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include<queue>
using namespace std;
inline long long toint(string s) {long long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long ll;
typedef long long LL;
typedef vector<int > vi;
typedef vector<long long > VLL;
typedef vector<long long > vll;
typedef vector<string > ves;
typedef vector<char > vech;
typedef pair<long long , long long> pll;
typedef pair<long long , long long> PLL;
typedef map<ll , ll >mll;
typedef map<int , int >mii;
typedef map<char , int >mci;
typedef map<char , ll >mcl;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define VECMAX(x) *max_element(ALL(x))
#define VECMIN(x) *min_element(ALL(x))
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define SIZEOF(x) sizeof(x)/sizeof(x[0])
const long long INF = 100000000000000;
const long long NINF = -100000000000000;
#define CIN(a) REP(i,a.size())cin >> a[i];
int main(){
string s;
cin >> s;
string t = "";
map <string , bool> p;
p["esare"] = true;
p["resare"] = true;
p["maerd"] = true;
p["remaerd"] = true;
ll v = s.size();
REP(i,v){
int ind = v- i - 1;
t+= s[ind];
if(p[t]){
t = "";
}
if(t.size()>10){
break;
}
}
if(!t.size())cout << "YES" << endl;
else cout << "NO" <<endl;
return 0;
}
| 0
| 46,568,741
|
#include <iostream>
#include <cstdlib>
using namespace std;
const int MAX = 1010;
const long long INF = 1LL << 60;
long long dp[MAX][MAX] = {INF};
string s1, s2;
int main() {
cin >> s1 >> s2;
int s1_len = (int)s1.length();
int s2_len = (int)s2.length();
for (int i = 0; i <= s1_len; ++i) dp[i][0] = i;
for (int j = 0; j <= s2_len; ++j) dp[0][j] = j;
for (int i = 0; i < s1_len; ++i) {
for (int j = 0; j < s2_len; ++j) {
long long ins_del = min((dp[i + 1][j] + 1), (dp[i][j + 1] + 1));
long long rep = 0;
if (s1[i] == s2[j]) {
rep = dp[i][j];
} else {
rep = dp[i][j] + 1;
}
dp[i + 1][j + 1] = min(ins_del, rep);
}
}
cout << dp[s1_len][s2_len] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll df(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b - (a % b < 0);
}
ll dc(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b + (a % b > 0);
}
template <class T>
class FT
{
vector<T> ft;
public:
FT(int n) : ft(n + 1)
{
}
T rsq(int b)
{
T sum = 0;
for (; b; b -= (b & (-b)))
sum += ft[b];
return sum;
}
void adjust(int k, T v)
{
for (; k < ft.size(); k += (k & (-k)))
ft[k] += v;
}
void adjust(int l, int r, T v)
{
adjust(l, v);
adjust(r + 1, -v);
}
};
int x[200000];
ll h[200000];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
ll d, a;
cin >> n >> d >> a;
vector<ll> vp, wp;
vector<pair<ll, ll>> ev;
FT<ll> ft(n);
for (int i = 0; i < n; ++i)
{
cin >> x[i] >> h[i];
vp.push_back(x[i]);
ev.emplace_back(x[i], h[i]);
}
sort(all(ev));
for (int i = 0; i < n; ++i)
{
int xp, hp;
tie(xp, hp) = ev[i];
ft.adjust(i + 1, i + 1, hp);
}
sort(all(vp));
wp = vp;
reverse(all(wp));
ll sol = 0;
for (int i = 0; i < n; ++i)
{
int hp = ft.rsq(i + 1);
if (hp <= 0) continue;
int j = n - (lower_bound(all(wp), vp[i] + 2 * d, greater<ll>()) - wp.begin()) - 1;
sol += dc(hp, a);
ft.adjust(i + 1, j + 1, -dc(hp, a) * a);
}
cout << sol;
}
| 0
| 64,099,216
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main() {
int n;
cin >> n;
vector<int> dp(n + 1, 100010);
dp.at(0) = 0;
for (int i = 1; i <= n; i++) {
dp.at(i) = dp.at(i - 1) + 1;
for (int j = 6; j <= i; j *= 6) {
chmin(dp.at(i), dp.at(i - j) + 1);
}
for (int j = 9; j <= i; j *= 9) {
chmin(dp.at(i), dp.at(i - j) + 1);
}
}
cout << dp.at(n) << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
int a[30][30];
int w, h, cnt;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
void search(int x, int y);
bool issearched[30][30];
int main()
{
while(1){
cin >> w >> h;
if(w == 0 && h == 0) break;
char c;
int is, js;
cnt = 1;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> c;
if(c == '.') a[i][j] = 1;
else if(c == '#') a[i][j] = -1;
else if(c == '@'){
is = i;
js = j;
}
}
}
search(is, js);
cout << cnt << endl;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
a[i][j] = 0;
issearched[i][j] = false;
}
}
}
return 0;
}
void search(int x, int y)
{
int nx, ny;
for(int i = 0; i < 4; i++){
nx = x + dx[i];
ny = y + dy[i];
issearched[x][y] = true;
if(nx >= h || ny >=w || nx < 0 || ny < 0) continue;
if(a[nx][ny] == 1 && !issearched[nx][ny]){
cnt++;
search(nx, ny);
}
}
}
| 0
| 65,909,129
|
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N , M ; cin >> N >> M ;
vector<int> A(N) , B(N) ;
for(int i = 0 ; i< N ; i++){
cin >> A.at(i) >> B.at(i) ;
}
vector<pair<int , int >> AB(N) ;
for(int i = 0 ; i < N ; i++){
AB.at(i) = make_pair(A.at(i) , B.at(i)) ;
}
sort(AB.begin() , AB.end()) ;
long long ans = 0 ;
for(int i = 0 ; i < N ; i++){
long long num_buy = min(M , AB.at(i).second) ;
ans += num_buy * AB.at(i).first ;
M -= num_buy ;
}
cout << ans << endl ;
}
|
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
char num[1000] = "1";
while(1){
int S = 0;
scanf("%s", num);
if(num[0] == '0')break;
for(int i = 0; i < 1001; i++){
if(num[i] == '\0')break;
S += (num[i] - '0');
}
cout << S << endl;
}
}
| 0
| 76,037,490
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s, t, u;
int a, b;
cin >> s >> t >> a >> b >> u;
if (u == s) cout << a-1 << " " << b << '\n';
else cout << a << " " << b-1 << '\n';
return (0);
}
|
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> cnt(n, 0);
int AC = 0, WA = 0;
rep(i, m)
{
int p;
string s;
cin >> p >> s;
p--;
if (cnt[p] == -1)
continue;
if (s == "AC")
{
AC++;
WA += cnt[p];
cnt[p] = -1;
}
else
cnt[p]++;
}
cout << AC << " " << WA << endl;
}
| 0
| 6,208,472
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
ll power(ll x, ll n)
{
ll result = 1;
while (n)
{
if (n % 2 == 1)
result = result * x;
n = n / 2;
x = x * x;
}
return result;
}
ll gcd(ll a, ll b)
{
if (!b)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a, b);
}
inline ll mul(ll x, ll y, ll m)
{
ll z = 1LL * x * y;
if (z >= m)
{
z %= m;
}
return z;
}
ll powmod(ll x, ll y, ll m)
{
ll r = 1;
while (y)
{
if (y & 1)
{
r = mul(r, x, m);
}
y >>= 1;
x = mul(x, x, m);
}
return r;
}
void start()
{
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
start();
int n;
cin>>n;
ll a=2, b=1;
if (n==0)
{
cout<<a;
return 0;
}
if (n==1)
{
cout<<b;
return 0;
}
ll c;
for (int i=2;i<=n;i++)
{
c=a+b;
a=b;
b=c;
}
cout<<c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge{ll to,cost;};
int main() {
ll n,p;
cin >> n >> p;
string s;
cin >> s;
ll ans=0;
if(10%p==0){
rep(i,n){
if((s[i]-'0')%p==0){
ans +=i+1;
}
}
}
else{
ll x=1;
vl a(n);
vl k(n+1,0);
rep(i,n){
a[i]=((s[n-i-1]-'0')*x)%p;
x *=10;
x %=p;
}
k[0]=a[0]%p;
FOR(i,1,n){
k[i]=(k[i-1]+a[i])%p;
}
sort(k.begin(),k.end());
ll cnt=0;
rep(i,n){
if(k[i]==k[i+1]){
cnt++;
}
else{
ans +=cnt*(cnt+1)/2;
cnt=0;
}
}
ans +=cnt*(cnt+1)/2;
}
cout << ans << endl;
}
| 0
| 63,400,628
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int n, m, d;
cin >> n >> m >> d;
if (d == 0)
{
cout << setprecision(12) << static_cast<double>(m - 1) / static_cast<double>(n) << endl;
}
else
{
cout << setprecision(12) << static_cast<double>(m - 1) * 2.0 * static_cast<double>(n - d)
/ static_cast<double>(n) / static_cast<double>(n) << endl;
}
}
|
#include <iostream>
#include <complex>
using namespace std;
double area(complex<double> a, complex<double> b, complex<double> c){
return (conj(b-a)*(c-a)).imag()/2.0;
}
int main(){
double x1,y1,x2,y2,x3,y3,xp,yp;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
complex<double> v[3];
complex<double> vp;
v[0]=complex<double>(x1,y1);
v[1]=complex<double>(x2,y2);
v[2]=complex<double>(x3,y3);
vp =complex<double>(xp,yp);
double s[3];
for(int j=0;j<3;j++)
s[j]=area(vp,v[j],v[(j+1)%3]);
if(s[0]*s[1]>0 && s[1]*s[2]>0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
| 0
| 32,942,831
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
int main(){
ll N,A,B;
cin>>N>>A>>B;
ll ans=0;
rep(i,1,N+1){
ll sum=0;
string s=to_string(i);
rep(j,0,s.size()){
sum+=s[j]-'0';
}
if(A<=sum&&sum<=B)ans+=i;
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
long long int dp[2][100001];
long long int mod=1e9+7;
long long int dfs(int node,int parent,int color,vector<int > Tree[])
{
if(Tree[node].size()==1&&node!=1)
{
return 1;
}
if(dp[color-1][node]!=-1)
return dp[color-1][node];
int i;
long long int ans=1;
for(i=0;i<Tree[node].size();i++)
{
if(Tree[node][i]!=parent)
{
if(color==1)
ans*=dfs(Tree[node][i],node,2,Tree);
else
ans*=dfs(Tree[node][i],node,2,Tree)+dfs(Tree[node][i],node,1,Tree);
}
ans%=mod;
}
return dp[color-1][node]=ans%mod;
}
int main()
{
int n;
cin>>n;
vector<int > Tree[n+1];
int i,x,y;
memset(dp,-1,sizeof(dp));
for(i=0;i<n-1;i++)
{
cin>>x>>y;
Tree[x].push_back(y);
Tree[y].push_back(x);
}
long long int ans=dfs(1,1,2,Tree)+dfs(1,1,1,Tree);
cout<<ans%mod<<endl;
return 0;
}
| 0
| 12,140,685
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n, taro, hanako;
string a, b;
cin >> n;
taro = 0;
hanako = 0;
for(int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b) {
taro += 3;
}
else if (a < b) {
hanako += 3;
}
else {
taro += 1;
hanako += 1;
}
}
cout << taro << " " << hanako << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n];
rep(i,n) cin >> a[i];
sort(a,a+n);
if(n==2){
cout << a[1]-a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
ll m=0;
ll t=0;
if(a[0]>0){
t=a[0]-a[1];
}
else if (a[n-1]<0){
t=a[n-1]-a[n-2];
}
if(a[0]>0){
rep1(i,n-1) m+=a[i];
m-=a[0];
cout << m << endl;
cout << a[0] << " " << a[1] << endl;
t=a[0]-a[1];
rep1(i,n-3){
cout << t << " " << a[i+1] << endl;
t=t-a[i+1];
}
cout << a[n-1] <<" " << t << endl;
}
else if (a[n-1]<0){
rep(i,n) m+=abs(a[i]);
m-=abs(a[n-1])*2;
cout << m << endl;
cout << a[n-1] << " " << a[n-2] << endl;
t=a[n-1]-a[n-2];
rep(i,n-2){
cout << t << " " << a[i] << endl;
t=t-a[i];
}
}
else{
rep(i,n) m+=abs(a[i]);
cout << m << endl;
t=a[0];
for(int i=n-2; i>=0; i--){
if(a[i]>0){
cout << t << " " << a[i] << endl;
t= t-a[i];
}
else if(t<=0){
cout << a[n-1] << " " << t << endl;
t = a[n-1] -t;
if(i==0) break;
}
if(a[i]<=0){
if(i==0)break;
cout << t << " " << a[i] << endl;
t= t-a[i];
}
}
}
return 0;
}
| 0
| 78,878,745
|
#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() {
string s;
cin >> s;
sort(ALL(s));
if(s == "abc") cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, k;
cin >> n >> k;
if(k > (n - 1) * (n - 2) / 2){
cout << -1 << endl;
}
else{
int m = (n * (n - 1) / 2) - k;
cout << m << endl;
for(int i = 1; i <= n-1; i++){
cout << i << " " << n << endl;
}
queue<P> ab;
for(int i = 1; i <= n-1; i++){
for(int j = i + 1; j <= n-1; j++){
ab.push(P(i, j));
}
}
for(int i = 0; i < ((n - 1) * (n - 2) / 2) - k; i++){
cout << ab.front().first << " " << ab.front().second << endl;
ab.pop();
}
}
return 0;
}
| 0
| 28,588,679
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T>
inline T sqr(T x) {
return x * x;
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF_INT = 2147483647;
const LL INF_LL = 9223372036854775807;
#define CLR(a) memset((a), 0, sizeof(a))
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const list<T> &lst) {
os << "{";
REPI(itr, lst) {
os << *itr;
itr++;
if (itr != lst.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
REPI(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
static const int MAX = 100;
static const LL INFTY = (1LL << 32);
int n;
LL d[MAX][MAX];
void floyd() {
REP(k, n) REP(i, n) {
if (d[i][k] == INFTY) continue;
REP(j, n) {
if (d[k][j] == INFTY) continue;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
int main(void) {
int e;
cin >> n >> e;
REP(i, n) REP(j, n) d[i][j] = ((i == j) ? 0 : INFTY);
REP(i, e) {
int u, v, c;
cin >> u >> v >> c;
d[u][v] = c;
}
floyd();
bool negative = false;
REP(i, n) if (d[i][i] < 0) negative = true;
if (negative) {
cout << "NEGATIVE CYCLE" << endl;
} else {
REP(i, n) {
REP(j, n) {
if (j) cout << " ";
if (d[i][j] == INFTY)
cout << "INF";
else
cout << d[i][j];
}
cout << endl;
}
}
return 0;
}
|
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;
int IT_MAX = 1 << 17;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x1f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;
vector <int> conn[100050];
vector <int> son[100050];
int tus;
bool dchk[100050];
int lr[100050][2];
void DFS(int n) {
dchk[n] = true;
lr[n][0] = ++tus;
for (auto it : conn[n]) {
if (dchk[it]) continue;
son[n].push_back(it);
DFS(it);
}
lr[n][1] = tus;
}
int main() {
int N, i;
scanf("%d", &N);
for (i = 1; i < N; i++) {
int t1, t2;
scanf("%d %d", &t1, &t2);
conn[t1].push_back(t2);
conn[t2].push_back(t1);
}
if (N % 2 == 1) return !printf("First\n");
DFS(1);
for (i = 1; i <= N; i++) {
int c = 0;
for (auto it : son[i]) if (lr[it][1] % 2 == lr[it][0] % 2) c++;
if (c >= 2) return !printf("First\n");
}
return !printf("Second\n");
}
| 0
| 22,300,904
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
int main() {
int n;
cin >> n;
ll ans = 0;
ll a[n];
rep(i,n){
cin >> a[i];
}
sort(a,a+n);
srep(i,1,n){
ll times = (a[i]-a[0])/(n+1);
a[i] -= n*times;
ans += times;
rep(j,n){
if(j!=i){
a[j] += times;
}
}
}
sort(a,a+n);
ll times = max((ll)0,a[0]-(ll)n);
rep(i,n){
a[i] -= times;
ans += times;
}
int flag = 0;
while(true){
rep(i,n){
if(a[i]>=n){
flag = 1;
rep(j,n){
a[j]++;
}
a[i] -= n+1;
ans++;
}
}
if(flag==0)break;
flag = 0;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int>a(n);
ll allsum=0;
int tmp=0;
for(int i=0;i<n;i++){
cin>>a[i];
allsum+=abs(a[i]-tmp);
tmp=a[i];
}
allsum+=abs(a[n-1]);
tmp=0;
for(int i=0;i<n;i++){
ll ans=allsum;
if(i==n-1) ans=ans-abs(a[i]-tmp)-abs(a[i])+abs(a[i-1]);
else ans=ans-abs(a[i]-tmp)-abs(a[i+1]-a[i])+abs(a[i+1]-tmp);
tmp=a[i];
cout<<ans<<endl;
}
return 0;
}
| 0
| 4,020,467
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb emplace_back
#define ll long long
const int INF = 2e9 + 1;
const ll INFLL = 1e18 + 1;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector<vector<int>> a(3, vector<int>(3));
vector<vector<int>> usd(3, vector<int>(3));
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
int n;
cin >> n;
while (n--) {
int x;
cin >> x;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (a[i][j] == x) usd[i][j] = 1;
}
}
}
bool f = false;
for (int i = 0; i < 3; i++) {
if (usd[i][0] && usd[i][1] && usd[i][2]) f = true;
if (usd[0][i] && usd[1][i] && usd[2][i]) f = true;
}
if (usd[0][0] && usd[1][1] && usd[2][2]) f = true;
if (usd[0][2] && usd[1][1] && usd[2][0]) f = true;
cout << (f ? "Yes" : "No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 50000;
const int INF = 1e8;
const int M = 20;
int main(){
int n,m;
cin >> n >> m;
vector<int> v(m);
int dp[M+1][N+1];
for(auto &t: v){
cin >> t;
}
for(int i=0;i<=M;i++){
for(int j=0;j<=N;j++){
dp[i][j]=(j==0?0:INF);
}
}
for(int i=0; i<m; i++){
for(int j=0; j<=n; j++){
if(j < v[i]){
dp[i+1][j] = dp[i][j];
}else{
dp[i+1][j] = min(dp[i][j],dp[i+1][j-v[i]]+1);
}
}
}
cout << dp[m][n] << endl;
}
| 0
| 5,064,247
|
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <climits>
#include <tuple>
#include <queue>
#include <cassert>
#include <set>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define el '\n'
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n,m,k;
cin >>n>>m>>k;
vector<vector<char> > gr(n, vector<char>(m));
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
cin >> gr[i][j];
}
}
ll sol = 0;
for (int i = 0; i < (1 << (n )); i++){
for (int j = 0; j < (1 << (m )); j++){
int l = 0;
for (int x = 0; x < n; x++){
for (int y = 0 ; y < m; y++){
int X = 1 << x, Y = 1 << y;
if (X & i || Y & j) continue;
if (gr[x][y] == '#'){
l++;
}
}
}
if (l == k){
sol ++;
}
}
}
cout << sol<<el;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for(;exp > 0;exp >>= 1) {
if((exp & 1) == 1) tot = tot * base % mod;
base = base * base % mod;
}
return tot;
}
char grid[301][301];
int main(){
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
cin >> grid[i][j];
long long tot = 0;
for(int i = 0; i < n; ++i){
bool f = true;
char cop[301][301];
for(int x = 0; x < n; ++x)
for(int y = 0; y < n; ++y)
cop[x][y] = grid[x][(y + i) % n];
for(int x = 0; x < n && f; ++x)
for(int y = 0; y < n && f; ++y)
if(cop[x][y] != cop[y][x])
f = false;
if(f)
tot += n;
}
cout << tot << "\n";
return 0;
}
| 0
| 49,377,947
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i >= 0; i--)
#define be(v) (v).begin(), (v).end()
#define dcout cout << fixed << setprecision(20)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
int main(){
int a,b; cin >> a >> b;
if(a%2==0||b%2==0) cout << "Even" << endl;
else cout << "Odd" << endl;
}
|
#include <bits/stdc++.h>
#define int long long int
#define ll long long
#define quickie ios_base::sync_with_stdio(false); cin.tie(NULL);
#define rep(i, a, b) for(int i=a; i<b; i++)
#define rep1(i, a, b) for(int i=a; i<=b; i++)
#define repp(i, a, b) for(int i=b-1; i>=a; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bn begin()
#define en end()
#define SZ(x) ((int)(x).size())
#define db double
#define mi map<int, int>
#define vi vector<int>
#define qi queue<int>
#define MI(x) power(x, mod-2)
#define test int t; cin >> t;
#define mod 1000000007
#define pi 3.141592653589
using namespace std;
int power(int x, int y) ;
int gcd(int a, int b) ;
signed main() {
quickie
int a, b, c, k, cnt1 = 0, cnt2 = 0 ;
cin >> a >> b >> c >> k ;
while(b <= a) {
cnt1++ ;
b *= 2 ;
}
while(c <= b) {
cnt2++ ;
c *= 2 ;
}
if(cnt1+cnt2 <= k) cout << "Yes\n" ;
else cout << "No\n" ;
}
int power(int x, int y) {
int res = 1; x %= mod;
while (y > 0) {
if (y & 1)
res = (res*x) % mod;
y = y>>1;
x = (x*x) % mod;
}
return res%mod;
}
int gcd(int a,int b){
if(a==0) return b;
return gcd(b%a,a);
}
| 0
| 5,458,124
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a,b;
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) cout << "Alice";
else if(a<b) cout << "Bob";
else cout << "Draw";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
int r=w, l=0, u=h, d=0;
int x[n], y[n], a[n];
for(int i=0; i<n; i++){
cin >> x[i] >> y[i] >> a[i];
if(a[i]==1 && x[i]>l)
l=x[i];
else if(a[i]==2 && x[i]<r)
r=x[i];
else if(a[i]==3 && y[i]>d)
d=y[i];
else if(a[i]==4 && y[i]<u)
u=y[i];
}
if(u-d>0&&r-l>0)
cout << (u-d)*(r-l);
else
cout << 0;
return 0;
}
| 0
| 76,625,812
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
string s;
cin >> n >> s;
int pre = 0;
int now_pre = 0;
REP(i, n) {
if (s[i] == ')') {
if (now_pre > 0) {
now_pre--;
} else {
pre++;
}
} else {
now_pre++;
}
}
string pre_str(pre, '(');
string suf_str(now_pre, ')');
s.insert(0, pre_str);
s.insert(s.length(), suf_str);
cout << s << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1 };
namespace {
template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void Write(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Write(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T, typename U> void Write(const T& x, const U& y, const char* end = "\n") { std::cout << x << " " << y << end; }
template <typename T, typename U, typename V> void Write(const T& x, const U& y, const V& z, const char* end = "\n") { std::cout << x << " " << y << " " << z << end; }
template <typename T> void Write(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
template <typename T> void Write(const std::vector<std::vector<T>>& x, const char* sep = " ", const char* end = "\n") { for (auto v : x) Write(v, sep, end); }
struct Read {
std::size_t szi, szj;
Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
template <typename T> operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
}
template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
std::vector<std::pair<T, U>> a(szi);
for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
}
};
struct Reads {
template <typename T> Reads(T& a) { std::cin >> a; }
template <typename T, typename U> Reads(T& a, U& b) { std::cin >> a >> b; }
template <typename T, typename U, typename V> Reads(T& a, U& b, V& c) { std::cin >> a >> b >> c; }
template <typename T, typename U, typename V, typename W> Reads(T& a, U& b, V& c, W& d) { std::cin >> a >> b >> c >> d; }
};
Read read;
}
int main() {
int n, k; Reads(n, k);
vector<int> a = Read(n);
rep(i, k) {
bool finish = true;
rep(j, n) if (a[j] != n) {
finish = false;
break;
}
if (finish) break;
vector<int> sum(n + 1, 0);
rep(j, n) {
int left = max(0, (int)j - a[j]);
int right = min(n, (int)j + a[j] + 1);
++sum[left];
--sum[right];
}
rep(j, n) sum[j + 1] += sum[j];
rep(j, n) {
a[j] = sum[j];
}
}
Write(a);
return 0;
}
| 0
| 45,669,545
|
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
# define P pair<int, int>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll lmax(ll a, ll b){if(a>= b) return a;return b;}
ll lmin(ll a, ll b){if(a>= b) return b;return a;}
int main() {
int n; cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(ALL(a));
bool flag = true;
rep(i, n-1){
if(a[i] == a[i+1]) flag = false;
}
if(flag) cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a/gcd(a,b)*b; }
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD = 1e9+7;
const int MAXN = 100005;
int n, v, p;
ll m;
vector<ll> a(MAXN);
bool ok(int t) {
if(t<=p) return true;
if(a[p-1]>a[t-1]+m) return false;
if(n-t+p >= v) return true;
ll add = (v-(n-t+p)) * m;
ll mxt = a[t-1] + m;
ll tmp = 0;
for (int i = p-1; i < t-1; i++) {
tmp += mxt - a[i];
if (tmp >= add) return true;
}
return false;
}
int main() {
cin >> n >> m >> v >> p;
rep(i,n) cin >> a[i];
sort(a.begin(), a.end(), greater<ll>());
ll ans;
ll start = 1, end = n+1;
while (start + 1 < end) {
ans = (start + end) / 2;
if (ok(ans)) start = ans;
else end = ans;
}
ans = (start + end) / 2;
cout << ans << endl;
return 0;
}
| 0
| 54,313,171
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main(void){
ll n, ans = 0;
scanf("%lld", &n);
map<ll, vector<int>> vs;
vector<ll> ns;
rep(i, n){
int a, b;
scanf("%d %d", &a, &b);
if (!vs.count(a + b)) ns.push_back(a + b);
vs[a + b].push_back(a);
}
sort(ns.rbegin(), ns.rend());
int cur = 0, id = 0;
rep(i, n){
if (i % 2 == 0)
ans += vs[ns[cur]][id++];
else
ans -= ns[cur] - vs[ns[cur]][id++];
if (id == vs[ns[cur]].size()) ++cur, id = 0;
}
std::printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
ll a[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n, x;
cin >> n >> x;
for(int i = 0; i < n; i++) cin >> a[i];
x *= 2;
ll lcm = a[0];
for(int i = 1; i < n; i++){
lcm = lcm / __gcd(lcm, a[i]) * a[i];
if(lcm > x) return cout << 0, 0;
}
if(lcm > x) return cout << 0, 0;
for(int i = 0; i < n; i++){
if((lcm / a[i]) % 2 == 0) return cout << 0, 0;
}
cout << x / lcm - x / (2 * lcm);
return 0;
}
| 0
| 9,842,667
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main()
{
ll n,d,arr[20][20];
cin>>n>>d;
for(int i=0;i<n;i++)
{
for(int j=0;j<d;j++)
{
cin>>arr[i][j];
}
}
ll cnt=0,sum=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
for(int k=0;k<d;k++)
{
ll nk=arr[i][k]-arr[j][k];
sum+=(pow(nk,2));
}
ll kk=sqrt(sum);
if(kk*kk==sum)
cnt++;
sum=0;
}
}
cout<<cnt<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> parent;
vector<int> size;
UnionFind(int n) : parent(n, -1), size(n, 1) {}
int find(int i) {
if (parent[i] == -1) {
return i;
}
return parent[i] = find(parent[i]);
}
void unite(int i, int j) {
i = find(i);
j = find(j);
if (i == j) {
return;
}
if (size[i] < size[j]) {
parent[i] = j;
size[j] += size[i];
} else {
parent[j] = i;
size[i] += size[j];
}
}
};
int main() {
int n, m;
cin>>n>>m;
int p[n+1];
for (int i=0; i<n; i++) cin>>p[i+1];
UnionFind uf(n+1);
for (int i=0; i<m; i++) {
int x, y;
cin>>x>>y;
uf.unite(x, y);
}
int cnt = 0;
for (int i=1; i<=n; i++) {
if (uf.find(i) == uf.find(p[i])) {
++cnt;
}
}
cout<<cnt<<endl;
}
| 0
| 74,669,865
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int data,m[10];
for (int j=0;j<=9;j++){
while(cin >> data){
if (data<=10000 && data >= 0 ) {
m[j]=data;
break;
}
}
}
for (int i=0;i<=8;i++){
if (m[i] < m[i+1]){
swap(m[i],m[i+1]);
for (int j=i;j>0;j--){
if (m[j] > m[j-1])
swap(m[j],m[j-1]);
}
}
}
for (int i=0;i<=2;i++){
cout << m[i] <<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n, m;
ll ans = 0;
cin >> n >> m;
ll minR, maxL;
minR = 1e7;
maxL = -1;
ll r, l;
rep(i, m){
cin >> l >> r;
minR = min(minR, r);
maxL = max(maxL, l);
}
ans = minR - maxL + 1;
if (ans < 0) {
ans = 0;
}
cout << ans << endl;
return 0;
}
| 0
| 88,819,362
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<vector<int>> Graph;
int main() {
int n,k,h,ans=0;
cin >> n >> k;
rep(i,n){
cin >> h;
if (h>=k) ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
int a[500010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin>>s;
int n=s.size()+1;
int nn=0;
int sn=0;
int mn=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='<')nn++;
else nn--;
sn=min(sn,nn);
mn=min(mn,nn);
a[i+1]=nn;
}
vector<pair<int,int>> p;
bool down=true;
sn=0;
for(int i=1;i<n;i++)
{
if(i==n-1)
{
sn=min(sn,a[i]);
p.push_back(make_pair(n-1,sn));
}
else
{
if(down&&a[i-1]<a[i])
{
down=false;
}
else if(!down&&a[i-1]>a[i])
{
p.push_back(make_pair(i-1,sn));
sn=a[i];
down=true;
}
else
{
sn=min(sn,a[i]);
}
}
}
int cur=0;
for(int i=0;i<n-1;i++)
{
if(p[cur].first<i)cur++;
if(p[cur].first==i)
{
a[i]-=min(p[cur].second,p[cur+1].second);
}
else a[i]-=p[cur].second;
}
a[n-1]-=p[cur].second;
ll ans=0;
for(int i=0;i<n;i++)ans+=a[i];
cout<<ans<<"\n";
return 0;
}
| 0
| 100,387,955
|
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int N; cin >> N;
ll A[N];
rep(i, N){
ll Ai; cin >> Ai;
A[i] = Ai;
}
rep(i, N){
printf("node %d: key = %ld, ", i+1, A[i]);
if(i != 0) printf("parent key = %ld, ", A[(i-1)/2]);
int l_ind, r_ind;
l_ind = 2*i+1; r_ind = 2*(i+1);
if(l_ind < N) printf("left key = %ld, ", A[l_ind]);
if(r_ind < N) printf("right key = %ld, ", A[r_ind]);
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const long long INF = numeric_limits<long long>::max();
class UnionFind {
public:
vector<ll> datas;
UnionFind(ll N) : datas(N, -1) {
}
bool isRoot(ll x) const {
return datas[x] < 0;
}
ll root(ll x) {
if (isRoot(x)) return x;
datas[x] = root(datas[x]);
return datas[x];
}
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (datas[x] > datas[y]) swap(x, y);
datas[x] += datas[y];
datas[y] = x;
return true;
}
ll size(ll x) {
return -datas[root(x)];
}
void Dump() {
#ifdef SOURCE_TEST
REP(i, datas.size()) {
if (isRoot(i)) {
PS("Root:");
PS(size(i));
} else {
cout << datas[i] << ":";
}
PR(i);
}
#endif
}
};
int main() {
ll N, M;
cin >> N >> M;
UnionFind unionFriends(N);
REP(i, M) {
ll a, b;
cin >> a >> b;
unionFriends.unite(a - 1, b - 1);
}
ll m = 0;
unionFriends.Dump();
REP(i, N) {
m = max(m, unionFriends.size(i));
}
PR(m);
return 0;
}
| 0
| 49,026,636
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
signed main()
{
string s;
cin >> s;
SORT(s);
YesNo(s == "abc");
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<ll,P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
#define INF (ll)1000000000000
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll N,K;
cin>>N>>K;
ll g=(N-2ll)*(N-1ll)/2ll;
queue<P>qu;
if(g<K){cout<<-1;return 0;}
else{
ll memo=g-K;
rep(i,N-1){
qu.push(P(N,i+1));
}
int flag=0;
for(int i=1;i<=N-1;i++){
for(int j=i+1;j<=N-1;j++){
if(memo==0){flag=1;}
if(flag==1){continue;}
qu.push(P(i,j));
memo--;
}
if(flag==1){continue;}
}
}
cout<<qu.size()<<endl;
while(!qu.empty()){
auto t=qu.front();
qu.pop();
cout<<t.first<<' '<<t.second<<endl;
}
}
| 0
| 16,369,091
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int now = 0;
ll ans = 0;
rep(i, s.size()) {
if (s[i] == 'W') {
if (now != i) ans += i - now;
now++;
}
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int h,w;
cin >> h >> w;
vector <vector <int>> tate(h,vector <int> (w));
vector <vector <int>> yoko(h,vector <int> (w));
vector <string> s(h);
rep(i,h){
cin >> s[i];
}
int k=0,st=0;
rep(i,h){
k=0;
st=0;
rep(j,w){
if(s[i][j]=='.'){
k+=1;
if(j==w-1){
rep(l,k){
yoko[i][st+l]=k;
}
}
}
else{
rep(l,k+1){
yoko[i][st+l]=k;
}
k=0;
st=j+1;
}
}
}
k=0;
st=0;
rep(i,w){
k=0;
st=0;
rep(j,h){
if(s[j][i]=='.'){
k+=1;
if(j==h-1){
rep(l,k){
tate[st+l][i]=k;
}
}
}
else{
rep(l,k+1){
tate[st+l][i]=k;
}
k=0;
st=j+1;
}
}
}
int ans=-1;
rep(i,w){
rep(j,h){
ans=max(ans,tate[j][i]+yoko[j][i]);
}
}
cout << ans-1 << endl;
return 0;
}
| 0
| 47,283,591
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<string>s(n);
vector<ll>t(n);
for(ll i=0;i<n;i++){
cin >> s[i] >> t[i];
}
ll ans=0;
string x;
cin >> x;
ll ti;
for(ll i=0;i<n;i++){
if(s[i]==x){
ti=i;
break;
}
}
for(ll i=ti+1;i<n;i++){
ans+=t[i];
}
cout << ans << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
using namespace std;
int hiniti(int y,int m,int d){
int result=0;
for(int s=1;s<=y;s++){
for(int j=1;j<=10;j++){
if(y==s&&m==j){
return result+=d;
}
if(s%3==0){
result+=20;
}else{
if(j%2==0){
result+=19;
}else{
result+=20;
}
}
}
}
}
int main(void){
int n;
cin>>n;
int y,m,d;
for(int s=0;s<n;s++){
cin>>y>>m>>d;
int t=hiniti(y, m, d);
cout<<196471-t<<endl;
}
return 0;
}
| 0
| 84,434,357
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <limits>
#include <sstream>
#include <fstream>
#include <climits>
#include <map>
#include <numeric>
#include <functional>
#include <utility>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int cnt = 1;
int ans = 0;
int sm = a <= b ? a : b;
for (int i = sm; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
if (k == cnt++) {
ans = i;
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
dice() {
id[TOP] = 1; id[FRONT] = 2; id[LEFT] = 3;
id[RIGHT] = 4; id[BACK] = 5; id[BOTTOM] = 6;
}
dice(int top,int front,int right,int left,int back,int bottom) {
id[TOP] = top; id[FRONT] = front; id[LEFT] = right;
id[RIGHT] = left; id[BACK] = back; id[BOTTOM] = bottom;
}
int& operator[] (FACE f) { return id[f]; }
const int& operator[] (FACE f) const { return id[f]; }
bool operator==(const dice &b) const {
const dice &a = *this;
return a[TOP] == b[TOP] && a[BOTTOM] == b[BOTTOM] &&
a[FRONT] == b[FRONT] && a[BACK] == b[BACK] &&
a[LEFT] == b[LEFT] && a[RIGHT] == b[RIGHT];
}
void roll_x() { roll(TOP, BACK, BOTTOM, FRONT); }
void roll_x2() { roll(TOP, FRONT, BOTTOM, BACK); }
void roll_y() { roll(TOP, LEFT, BOTTOM, RIGHT); }
void roll_y2() { roll(TOP, RIGHT, BOTTOM, LEFT); }
void roll_z() { roll(FRONT, RIGHT, BACK, LEFT); }
void roll_z2() { roll(FRONT, LEFT, BACK, RIGHT); }
vector<dice> all_rolls() {
vector<dice> ret;
for (int k = 0; k < 6; (k&1?roll_y():roll_x()),++k)
for (int i = 0; i < 4; roll_z(), ++i)
ret.push_back(*this);
return ret;
}
private:
void roll(FACE a, FACE b, FACE c, FACE d) {
int tmp = id[a];
id[a] = id[b]; id[b] = id[c];
id[c] = id[d]; id[d] = tmp;
}
int id[6];
};
int main(){
int d[6];
for(int i=0;i<6;i++)cin>>d[i];
dice di(d[0],d[1],d[2],d[3],d[4],d[5]);
vector<dice> v=di.all_rolls();
int n,x,y;
for(cin>>n;n--;){
cin>>x>>y;
for(int i=0;i<v.size();i++){
if(v[i][TOP]==x&&v[i][FRONT]==y){
cout<<v[i][LEFT]<<endl;
}
}
}
}
| 0
| 91,713,511
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define PI 3.14159265
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define pw(b,p) pow(b,p) + 0.1
#define __ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define endl "\n"
#define m(a) memset(a,0,sizeof(a))
#define all(x) begin(x), end(x)
void file(){
#ifndef ONLINE_JUDGE
freopen("in.txt" , "r" , stdin);
freopen("out.txt" , "w" , stdout);
#endif
}
int bs(int a[] , int s , int e, int x){
if(s<=e){
int m = (s+e)/2;
if(a[m]==x)
return m;
else if(a[m] > x)
return bs(a,s,m-1,x);
else return bs(a,m+1,e,x);
}
return -1;
}
#define tr(x) cout<<x<<endl;
#define tr2(x,y) cout<<x<<" "<<y<<endl;
#define tr3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl;
#define tr4(w,x,y,z) cout<<w<<" "<<x<<" "<<y<<" "<<z<<endl;
#define tr5(v,w,x,y,z) cout<<v<<" "<<w<<" "<<x<<" "<<y<<" "<<z<<endl;
#define tr6(u,v,w,x,y,z) cout<<u<<" "<<v<<" "<<w<<" "<<x<<" "<<y<<" "<<z<<endl;
#define deb(x) cout<<#x<<"="<<x<<endl
#define deb2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define deb3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl
#define deba(a) for(auto &x:a) cout<<x<<" ";
#define sd(x) cin >> x;
#define sd2(x,y) cin >> x >> y;
#define sd3(x,y,z) cin >> x >> y >> z;
#define sd4(w,x,y,z) cin >> w >> x >> y >> z;
bool is_pal(string s) {return equal(all(s), s.rbegin());}
int fxp(int a, int b ,int p){
int res = 1;
while (b > 0) {
if (b & 1)
res = (res * a)%p;
a = (a * a)%p;
b >>= 1;
}
return (res%p);
}
void solveFrogOne(){
int n; cin >> n;
int a[n]; for(int i=0 ; i<n ; ++i) cin >> a[i];
int dp[n];
dp[0]=0;
dp[1] = abs(a[1]-a[0]) + dp[0];
for(int i=2 ; i<n ; ++i){
dp[i] = min(dp[i-1] + abs(a[i]-a[i-1]) , dp[i-2] + abs(a[i]-a[i-2]));
}
cout << dp[n-1] << endl;
}
void solveFrogTwo(){
int n,k; cin >> n >> k;
int a[n]; for(int i=0 ; i<n ; ++i) cin >> a[i];
int dp[n];
fill(dp , dp+n , inf);
dp[0]=0;
dp[1] = abs(a[1]-a[0]);
for(int i=2 ; i<n ; ++i){
for(int j=1 ; j<min(k,i)+1 ; ++j){
dp[i] = min(dp[i-j]+abs(a[i]-a[i-j]) , dp[i]);
}
}
cout << dp[n-1] << endl;
}
int32_t main(){
__;
file();
solveFrogTwo();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<long> a(n);
for(auto &e: a) cin >> e;
sort(a.begin(), a.end());
long m = a[n-1];
if(m == 1) {
cout << (n==2 ? "Possible" : "Impossible") << endl;
return 0;
}
if(m%2 == 0) {
bool ok = true;
for(long i=m/2 + 1; i<=m; i++)
ok &= (upper_bound(a.begin(), a.end(), i) - lower_bound(a.begin(), a.end(), i)) >= 2;
ok &= a[0] == m/2;
ok &= a[1] > m/2;
cout << (ok ? "Possible" : "Impossible") << endl;
} else {
bool ok = true;
for(long i=(m+1)/2; i<=m; i++)
ok &= (upper_bound(a.begin(), a.end(), i) - lower_bound(a.begin(), a.end(), i)) >= 2;
ok &= a[0] == (m+1)/2;
ok &= a[1] == (m+1)/2;
ok &= a[2] > (m+1)/2;
cout << (ok ? "Possible" : "Impossible") << endl;
}
}
| 0
| 12,904,386
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
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;
}
vector<int> ts;
vector<int> xs;
vector<int> ys;
bool solve(const int N) {
for (int i = 1; i <= N; i++) {
int diff_t = ts[i] - ts[i - 1];
int diff_x = abs(xs[i] - xs[i - 1]);
int diff_y = abs(ys[i] - ys[i - 1]);
if (diff_t < diff_x + diff_y) {
return false;
}
if (abs(diff_x + diff_y - diff_t) % 2 != 0) {
return false;
}
}
return true;
}
int main(void) {
int N;
cin >> N;
ts.resize(N + 1);
xs.resize(N + 1);
ys.resize(N + 1);
ts[0] = 0;
xs[0] = 0;
ys[0] = 0;
for (int i = 1; i <= N; i++) {
int t, x, y;
cin >> t >> x >> y;
ts[i] = t;
xs[i] = x;
ys[i] = y;
}
if (solve(N)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int c1, c2, c3, c4;
cin >> N;
c1 = N / 1000;
c2 = N / 100 % 10;
c3 = N / 10 % 10;
c4 = N % 10;
if (c1 == c2 && c1 == c3)
{
cout << "Yes" << endl;
}
else if (c2 == c3 && c2 == c4)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
| 0
| 47,022,895
|
#include<stdio.h>
int selectionSort(int A[], int N) {
int sw = 0;
for(int i = 0; i < N; i++) {
int minj = i;
for(int j = i; j < N; j++) {
if(A[minj] > A[j]) minj = j;
}
int tmp;
if(minj != i) {
tmp = A[minj]; A[minj] = A[i]; A[i] = tmp;
sw++;
}
}
return sw;
}
int main() {
int N;
int A[100];
scanf("%d", &N);
for(int i = 0; i < N; i++) scanf("%d", &A[i]);
int sw = selectionSort(A, N);
for(int i = 0; i < N; i++) {
if(i != 0) printf(" ");
printf("%d", A[i]);
}
printf("\n");
printf("%d\n", sw);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> h(n);
rep(i, n) scanf("%d", &h[i]);
vector<vector<int>> g(n);
rep(i, m) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
int ans = 0;
rep(i, n) {
bool ok = true;
for (auto j: g[i]) if (h[i] <= h[j]) ok = false;
if (ok) ans++;
}
printf("%d\n", ans);
return 0;
}
| 0
| 66,268,569
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s; cin>>s;
int l = s.length(); set<char> st;
for(auto ch:s)st.insert(ch);
if(st.size()==l)cout<<"yes";
else cout<<"no";
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
reverse(s.begin(),s.end());
string t="";
std::deque<string> words{"maerd","remaerd","esare","resare"};
std::deque<string> deq{t};
while (deq.size()!=0) {
string tmp=deq.front();
deq.pop_front();
if (tmp.size()<100000) {
for (int i=0;i<4;i++) {
if (tmp+words[i]==s) {
cout<<"YES"<<endl;
return 0;
} else if (tmp+words[i]==s.substr(0,(tmp+words[i]).size())) {
deq.emplace_back(tmp+words[i]);
}
}
}
}
cout<<"NO"<<endl;
return 0;
}
| 0
| 10,777,430
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
unsigned long long n,m;
cin >> n >> m;
if(m <= n*2){
cout << m/2 << endl;
}else{
cout << n + (m-n*2)/4 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> snuke(n, 0);
for (int i = 0; i < k; i++) {
int d;
cin >> d;
for (int j = 0; j < d; j++) {
int a;
cin >> a;
snuke[a - 1]++;
}
}
int count = 0;
for (int i = 0; i < n; i++) {
if (snuke[i] == 0) count++;
}
cout << count << endl;
return 0;
}
| 0
| 60,180,365
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>h(n);
int ans=0,active=0;
for(int i=0;i<n;i++){
cin>>h[i];
}
for(int i=0;i<n;i++){
if(active>=h[i]){
active=h[i];
}
else{
ans+=h[i]-active;
active=h[i];
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long double
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
int n, ans = 0;
int get(int x) {
return (x * (x + 1)) / 2;
}
void analyze(int a, int b) {
if (b > a) {
ans += get(n - a);
} else {
ans += b * a - get(b);
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
analyze(a, b);
analyze(b, a);
}
for (int i = n; i >= 1; i--) {
ans += (i * (2 - i));
}
cout << ans << '\n';
fflush(stdout);
return 0;
}
| 0
| 59,278,535
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int INF = 1e9;
vecveci dist(210,veci(210,INF));
int main() {
int N,M,R; cin >> N >> M >> R;
vector<int> ri(R);
REP(i,R) {
cin >> ri[i];
ri[i]--;
}
REP(i,M) {
int a,b,c; cin >> a >> b >> c;
a--; b--;
dist[a][b] = min(dist[a][b],c);
dist[b][a] = min(dist[b][a],c);
}
REP(k,N) REP(i,N) REP(j,N) dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]);
int ans = INF;
sort(ri.begin(),ri.end());
do{
int total = 0;
REP(i,R-1) {
total += dist[ri[i]][ri[i+1]];
}
chmin(ans,total);
}while(next_permutation(ri.begin(),ri.end()));
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <class T> bool chmin(T& x, T y) {
return x > y ? (x = y, true) : false;
}
int main() {
string S; cin >> S;
const int INF = 1e9;
vector<int> A(1 << 26, INF);
A[0] = 0;
int hash = 0;
for (int i = 0; i < S.size(); i++) {
hash ^= 1 << (S[i] - 'a');
int val = INF;
chmin(val, A[hash] + 1);
for (int j = 0; j < 26; j++) {
chmin(val, A[hash ^ (1 << j)] + 1);
}
chmin(A[hash], val);
}
cout << max(1, A[hash]) << '\n';
return 0;
}
| 0
| 16,666,742
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair <int, int>
#define all(vv) (vv).begin(), (vv).end()
#define rep(ii, jj, ll, ss) for(int ii = jj; ii < ll; ii += ss)
#define time cerr << '\n' << (double)clock()/CLOCKS_PER_SEC << '\n'; return 0;
#define get(vv, times) for(int ii = 0; ii < times; ++ii) {int jj; cin >> jj; (vv).pb(jj);}
int n, m, ans;
priority_queue <int> pq;
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0);
ans = 0;
cin >> n >> m;
rep(i, 0, n, 1) {
int x; cin >> x;
pq.push(x);
}
rep(i, 0, m, 1) {
int mx = pq.top();
pq.pop();
pq.push(mx/2);
}
rep(i, 0, n, 1) {
ans += pq.top();
pq.pop();
}
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define input freopen("input.txt","r",stdin)
#define output freopen("output.txt","w",stdout)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d%d",&a,&b)
#define siii(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define pi(a) printf("%d",a)
#define spc printf(" ")
#define bl printf("\n")
#define here(a) printf("#### %d ####",a)
#define pii pair<int,int>
#define fr(i,n) for(int i=0;i<n;i++)
#define case(num) printf("Case %d:",num)
#define inf 1000000050
#define MAX 100010*3
int row[MAX+10],column[MAX+10];
vector<pii>v;
vector<int>pr,pc;
int main(){
int h,w,m,x,y;
cin>>h>>w>>m;
int mr,mc;
mr = -1; mc = -1;
for(int i=0;i<m;i++){
cin>>x>>y;
row[x]++;
column[y]++;
mr = max(mr,row[x]);
mc = max(mc,column[y]);
v.push_back(pii(x,y));
}
int l = max(h,w);
for(int i=0;i<=l;i++){
if(row[i]==mr) pr.push_back(i);
if(column[i]==mc) pc.push_back(i);
}
int ans = mr+mc;
int flag = 1;
sort(v.begin(),v.end());
for(int i=0;i<pr.size();i++){
for(int j=0;j<pc.size();j++){
int pos = lower_bound(v.begin(),v.end(),pii(pr[i],pc[j]))- v.begin();
if(pos>=v.size()){
flag = 0;
break;
}
if(v[pos].first!=pr[i] || v[pos].second!=pc[j]){
flag = 0;
break;
}
}
}
cout<<ans-flag<<endl;
return 0;
}
| 0
| 54,896,157
|
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#define autoit(x,it) for(auto it = x.begin(); it != x.end(); it++)
#define rep(n) for(ll i = 0; i < n; i++)
#define repi(i,n) for(ll i = 0; i < n; i++)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
FAST
ll d,t,s;
cin>>d>>t>>s;
if(d<=s*t)
cout<<"Yes\n";
else cout<<"No\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i,n) for (ll i=(ll)n-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
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; }
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX6 1001001
#define MAX7 10010010
#define SENTINEL 2000000000
#define INF 1<<30
#define INFTY 1LL<<61
#define MAX_INT INT_MAX
#define Endl '\n'
#define CLR(mat) memset(mat, 0, sizeof(mat))
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
template<class T> bool contain(const std::string& s, const T& v) {
return s.find(v) != std::string::npos;
}
using Edge=pair<int,ll>;
using Graph=vector<vector<ll> >;
const int MOD = 1000000007;
int main(){
ll n,k;cin>>n>>k;
VI a(n);rep(i,n)cin>>a[i];
ll G=a[0];
ll a_max=0;
rep(i,n){
G=GCD(G,a[i]);
chmax(a_max,a[i]);
if(k==a[i]){
cout<<"POSSIBLE"<<endl;
return 0;
}
}
if(k%G==0 && k<=a_max){
cout<<"POSSIBLE"<<endl;
}
else cout<<"IMPOSSIBLE"<<endl;
}
| 0
| 100,102,692
|
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main(){
string s;ll k,i,ans = 0;cin >> s >> k;
ll n = s.size();bool streak = false;
if(count(s.begin(),s.end(),s[0]) == n){
cout << n*k/2 << "\n";
return 0;
}
for(i=1;i<n;i++){
if(s[i] == s[i-1]) streak ^= true;
else streak = false;
ans += streak;
}
ans *= k;
if(s[0] != s[n-1]){
cout << ans << "\n";
return 0;
}
bool lodd = true,rodd = true;
for(i=1;i<n;i++){
if(s[i] == s[i-1]) lodd ^= true;
else break;
}
for(i=n-2;i>=0;i--){
if(s[i] == s[i+1]) rodd ^= true;
else break;
}
if(lodd && rodd) ans += k-1;
cout << ans << "\n";
}
|
#include<bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9+7;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}
void debug(vector<vector<ll>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
void debug(vector<ll>v,ll n){cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
vector<vector<ll>>vec(ll x, ll y, ll w){
vector<vector<ll>>v(x,vector<ll>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while((r=x%y)!=0){x=y;y=r;}return y;}
struct UnionFind {
vector<ll> data;
vector<ll> difweight;
UnionFind(ll size){
data.assign(size,-1);
difweight.assign(size,0);
}
bool unite(ll x, ll y, ll w) {
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y), w = -w;
data[x] += data[y];
data[y] = x;
difweight[y] = w;
}
return x != y;
}
bool find(ll x, ll y) {
return root(x) == root(y);
}
ll diff(ll x,ll y){
return weight(y)-weight(x);
}
ll weight(ll x){
root(x);
return difweight[x];
}
ll root(ll x) {
if(data[x] < 0){
return x;
}
else{
ll tmp = root(data[x]);
difweight[x] += difweight[data[x]];
return data[x] = tmp;
}
}
ll size(ll x) {
return -data[root(x)];
}
ll debug(){
rep(i,0,data.size()){
root(i);
cout<<i spa data[i] spa difweight[i] spa weight(i)<<endl;
}
cout<<endl;
}
};
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio(false);
ll res=0,res1=INF,res2=-INF,buf=0;
bool judge = true;
ll n,m;cin>>n>>m;
vector<ll>l(m),r(m),d(m);
UnionFind uf(n);
rep(i,0,m)cin>>l[i]>>r[i]>>d[i];
rep(i,0,m){
l[i]--,r[i]--;
if(uf.find(l[i],r[i])){
if(uf.diff(l[i],r[i])!=d[i]){
judge=false;
break;
}
}
else{
uf.unite(l[i],r[i],d[i]);
}
}
ans1(judge);
return 0;
}
| 0
| 15,476,659
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int i;
string S, T;
cin >> S >> T;
int x = S.length();
int y = T.length();
int a = 0;
if (y == x + 1) {
for (i = 0; i < x; i++) {
if (S[i] != T[i]) {
a += 1;
}
}
if (a == 0) {
cout << "Yes" << "\n";
}
else {
cout << "No" << "\n";
}
}
else {
cout << "No" << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
int N,P;
cin >> N >> P;
vector<int>A(N);
int count = 0;
long long sum = 1;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum *= 2;
if (A.at(i) % 2 == 1){
count = 1;
}
}
if (count == 1){
cout << sum/2 << endl;
}
else {
if (P == 0){
cout << sum << endl;
}
else {
cout << 0 << endl;
}
}
}
| 0
| 56,612,556
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int num = 2000001, num1 = 10000;
int main() {
int n, a[num], c[num1 + 1], b[num];
cin >> n;
for (int i = 0; i <= num1; i++) c[i] = 0;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) c[a[i]]++;
for (int i = 1; i <= num1; i++) c[i] += c[i - 1];
for (int i = 0; i < n; i++) b[(c[a[i]]--)-1] = a[i];
for (int i = 0; i < n; i++) {
if (i) cout << " ";
cout << b[i];
}
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define li long int
#define pb push_back
#define mkp make_pair
#define nikalL return
#define chalavo continue
#define basHo break
#define umap unordered_map
#define vi vector<int>
#define fr(i,s,n) for(int i=s;i<=n;++i)
#define frr(i,s,n) for(int i=s;i>=n;--i)
#define jaldiKarNe ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mod 1000000007
int n;
vi g[100005];
li dp[100005][2];
int vis[100005][2];
li fn(int node,int par,int last) {
if(vis[node][last]) return dp[node][last];
vis[node][last]=1;
if(par && g[node].size()==1) {
if(last) return dp[node][last]=1;
else return dp[node][last]=2;
}
li b=1,w=1;
for(auto child:g[node]) {
if(child==par) continue;
li black=0,white=0;
white=fn(child,node,0);
if(!last) black=fn(child,node,1);
b=(b*black)%mod;
w=(w*white)%mod;
}
return dp[node][last]=(b+w)%mod;
}
int main() {
jaldiKarNe;
cin>>n;
fr(i,1,n-1) {
int u,v;
cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
int leaf=-1;
fr(i,1,n) {
if(g[i].size()==1) {
leaf=i;
break;
}
}
if(n==1) cout<<"2\n";
else cout<<fn(leaf,0,0);
}
| 0
| 23,117,068
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
string N;
cin >> N;
long sum = 0;
for (int i = 0; i < N.length(); ++i)
{
sum += N[i] - '0';
}
if(sum%9==0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
int main() {
func();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using i64=int64_t;
#define rep(i,x,y) for(i64 i=i64(x),i##_max_for_repmacro=i64(y); i<i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1.01e9;
const i64 inf64=4.01e18;
const double eps=1e-9;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
void solve(){
i64 X,Y;
cin >> X >> Y;
if(abs(X-Y)<=1) cout << "Brown" << endl;
else cout << "Alice" << endl;
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
return 0;
}
| 0
| 39,004,073
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
deque<int> a;
rep(i,n){
int x;
cin>>x;
if(i%2==0){
a.push_front(x);
}
else{
a.push_back(x);
}
}
if(n%2==0){
reverse(a.begin(),a.end());
}
rep(i,n){
cout<<a[i]<<" ";
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<char> vc;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N;
cin>>N;
vi A={0};
rep(i,N) {
int a;
cin>>a;
A.pb(a);
}
A.pb(0);
int sum=0;
rep(i,N+1) {
sum+=abs(A[i]-A[i+1]);
}
int sum2=sum;
for(int i=1; i<=N; i++) {
sum-=abs(A[i]-A[i-1]);
sum-=abs(A[i+1]-A[i]);
sum+=abs(A[i+1]-A[i-1]);
cout<<sum<<endl;
sum=sum2;
}
}
| 0
| 16,354,205
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
double a, b, x;
cin >> a >> b >> x;
double pi = acos(-1.0);
double ans;
if(2 * x > a * a * b)
ans = atan2(2 * a * a * b - 2 * x, pow(a, 3)) * 180.0 / pi;
else
ans = atan2(a * b * b, 2 * x) * 180.0 / pi;
printf("%.10f\n", ans);
}
|
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
#define fi first
#define se second
#define set20 cout<<fixed<<setprecision(20) ;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
double pi=acos(-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;}
int main(){
ll n,m,v,p ; cin>>n>>m>>v>>p ;
vector<ll> A(n) ;
rep(i,n) cin>>A[i] ;
sort(A.rbegin(),A.rend()) ;
ll ans=0 ;
ll x= 0 ;
ll y= 0 ;
rep(i,n-p){
x+= (A[p+i-1]-A[p+i])*(i+1) ;
y+= (A[p+i-1]-A[p+i]) ;
if(x<=((n-v)*m)&&y<=m) ans++ ;
}
cout<<ans+(p)<<endl ;
return 0 ;
}
| 0
| 54,607,024
|
#include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<P,P> PP;
const ll MOD=10000;
const ll INF=1000000010;
const int MAX=100001;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
int a[5];for(int i=0;i<5;i++){cin>>a[i];}sort(a,a+5,greater<int>());for(int i=0;i<5;i++){cout<<a[i];cout<<(i!=4?" ":"\n");}
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <deque>
#include <assert.h>
#include <stack>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define vii <vector<pair<int,int>>
#define vi vector<int>
#define mp make_pair
#define pf push_front
#define all(v) v.begin(), v.end()
#define endl "\n"
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define PI 3.14159265
#define _Yes printf("YES\n");
#define _No printf("NO\n");
#define print3(x,y,z); cout << x << " " << y << " " << z << endl;
#define ssize (int)s.size()
const ll MOD = 1000000007;
int longestIncreasingSubsequenceLenghtDP(int a[],int n){
int dp[n],ans=0;
for(int k = 0;k<n;k++){
dp[k] = 1;
for(int i = 0;i<k;i++){
if(a[i] <= a[k]){
dp[k] = max(dp[k],dp[i] + 1);
ans = max(dp[k],ans);
}
}
}
return ans;
}
int factDP(int n) {
int result[1000] = {0};
if (n >= 0) {
result[0] = 1;
for (int i = 1; i <= n; ++i) {
result[i] = i * result[i - 1];
}
return result[n];
}
}
bool isPrime(ll n){
if(n<2) return false;
for(ll x = 2;x*x <=n;x++){
if(n%x == 0)return false;
}
return true;
}
vector<int> uniqueSorted(int a[],int n){
set<int> s;
vector<int> v;
for(int i = 0;i<n;i++)
s.insert(a[i]);
for(auto x: s)
v.pb(x);
return v;
}
vector<int> primeFactors(int n){
vector<int> f;
for(int x = 2;x*x<=n;x++){
while(n%x==0){
f.push_back(x);
n/=x;
}
}
if(n>1)f.push_back(n);
return f;
}
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
int isSubstring(string s1, string s2) {
int M = s1.length();
int N = s2.length();
for (int i = 0; i <= N - M; i++) {
int j;
for (j = 0; j < M; j++)
if (s2[i + j] != s1[j])
break;
if (j == M)
return true;
}
return false;
}
vector<int> primes;
void SieveOfEratosthenes(int n) {
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++) {
if (prime[p] == true) {
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
primes.pb(p);
}
bool isSubSequence(string str1,string str2, int m, int n)
{
if (m == 0) return true;
if (n == 0) return false;
if (str1[m-1] == str2[n-1])
return isSubSequence(str1, str2, m-1, n-1);
return isSubSequence(str1, str2, m, n-1);
}
ll fastExpo(ll a,ll n, ll MOD)
{
ll ans = 1;
while(n>=1)
{
if(n%2==0)
{
n/=2LL;
a = (a * a) % MOD;
}else
{
--n;
ans = (ans*a) % MOD;
}
}
return ans;
}
int main()
{
int n,k;
cin >> n >> k;
int h[n];
for(int i= 0 ;i<n;i++)
cin >> h[i];
sort(h,h+n);
ll ans = 0;
for(int i = 0;i<n-k;i++)
ans+= h[i];
cout<<ans<<endl;
}
| 0
| 86,595,841
|
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
const int MAXN = 250005;
const int MAXV = 1000005;
map<lint, int> mp;
int main(){
int n; scanf("%d",&n);
lint sum = 0;
mp[sum]++;
lint ret = 0;
for(int i=1; i<=n; i++){
int x; scanf("%d",&x);
sum += x;
ret += mp[sum];
mp[sum]++;
}
cout << ret << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
fastIO
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;
vec h(200001);
cin>>n>>k;
rep(i,n) cin>>h[i];
if(n==k){
cout<<0;return 0;
}
ll dp[301][301]={0},inf=1e18,ans=inf;
rep(i,n)rep(j,n+1) dp[i][j]=inf;
rep(i,n) dp[i][1]=h[i];
rep(i,n)rep(j,n)rep(k,i) dp[i][j+1]=min(dp[i][j+1],dp[k][j]+max((ll)0,h[i]-h[k]));
rep(i,n) ans=min(ans,dp[i][n-k]);
cout<<ans<<"\n";
}
| 0
| 16,537,755
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, l;
cin >> n >>l;
vector<string>a(n);
for(int i =0 ; i < n; ++i){
cin >> a[i];
}
sort(a.begin(), a.end());
string ans;
for(int i =0 ; i < n; ++i){
ans += a[i];
}
cout << ans;
return 0;
}
|
#include<iostream>
using namespace std;
int main(void)
{
long long int n,m,i,max=0,min=10000000,all=0;
cin>>n;
for(i=1;i<=n;i++){
cin>>m;
all=all+m;
if(max<=m) max=m;
if(min>=m) min=m;
}
if(n==1) cout<<m<<" "<<m<<" "<<m<<endl;
else cout<<min<<" "<<max<<" "<<all<<endl;
return 0;
}
| 0
| 60,870,323
|
#include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for (int i = 0; i <(int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
int main(){
int a,b,c;cin>>a>>b>>c;
int sum=a+b+c;
int count=0;
int tmp=max(a,b);
int Max=max(tmp,c);
while(sum%3!=0||sum/3<Max){
sum+=2;
count++;
}
cout<<count<<endl;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;
int raise(int a,int n,int m = MOD){
if(n == 0)return 1;
if(n == 1)return a;
int x = 1;
x *= raise(a,n/2,m);
x %= m;
x *= x;
x %= m;
if(n%2)x*= a;
x %= m;
return x;
}
int floor1(int n,int k){
if(n%k == 0 || n >= 0)return n/k;
return (n/k)-1;
}
int ceil1(int n,int k){
return floor1(n+k-1,k);
}
void solve(){
int n;
cin >> n;
int ans = 0;
int x = n;
for(int i = 2;i*i <= x;i++){
if(n%i == 0){
int cur = 0;
while(n%i == 0){
cur++;
n/= i;
}
int fir = 1;
int all = 0;
while(all+fir <= cur){
all += fir;
ans++;
fir++;
}
}
}
if(n > 1)ans++;
cout << ans;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
while(t--){
solve();
}
return 0;
}
| 0
| 89,354,683
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string s1,s2;
int dp[1001][1001];
cin >> s1 >> s2;
for(int i=0;i<=s1.size();i++) dp[i][0]=i;
for(int i=0;i<=s2.size();i++) dp[0][i]=i;
for(int i=1;i<=s1.size();i++){
for(int j=1;j<=s2.size();j++){
int key=1;
if(s2[j-1]==s1[i-1]) key=0;
dp[i][j]=min(min(dp[i-1][j-1]+key,dp[i][j-1]+1),dp[i-1][j]+1);
}
}
cout << dp[s1.size()][s2.size()] << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll x, ll y){
if(x < y) return gcd(y, x);
if(x%y == 0) return y;
return gcd(y, x%y);
}
int main(){
ll n,x;
cin >> n >> x;
vector<ll>d(n);
for(int i=0;i<n;i++){
ll a;
cin >> a;
d[i] = abs(a - x);
}
ll ans = d[0];
for(int i=1;i<n;i++) ans = gcd(ans, d[i]);
cout << ans << endl;
}
| 0
| 71,263,746
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define RREP(i,a) for(int i = a;i >= 0;i--)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define rrep(i,n) for(int i = n - 1;i >= 0;i--)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define range(x,min,max) ((min) <= (x) && (x) <= (max))
#define xyrange(x, minX, maxX, y, minY, maxY) (range(x, minX, maxX) && range(y, minY, maxY))
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<vector<int> > VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};
const int INF = 0x3f3f3f3f;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string A, B;
cin >> A >> B;
string ans = "EQUAL";
if (A.size() > B.size()) {
ans = "GREATER";
} else if (A.size() < B.size()) {
ans = "LESS";
} else {
rep (i, A.size()) {
if (A[0] > B[0]) {
ans = "GREATER";
break;
} else if (A[0] < B[0]) {
ans = "LESS";
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n,cnta=0,cntb=0;
cin >> n;
long a[n],b[n];
rep(i,n){
cin >> a[i];
cnta += a[i];
}
rep(i,n){
cin >> b[i];
cntb += b[i];
}
if(cnta<cntb) cout << -1 << endl;
else{
long cur = 0,ans=0;
vector<long> d;
rep(i,n){
if(a[i]<b[i]){
cur += b[i]-a[i];
ans++;
}
else d.push_back(a[i]-b[i]);
}
sort(d.begin(),d.end());
reverse(d.begin(),d.end());
for(auto i:d){
if(cur>0){
cur -= i;
ans++;
}
}
cout << ans << endl;
}
}
| 0
| 1,312,406
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<string>
#include <iomanip>
#include<math.h>
using namespace std;
typedef long long ll;
#define lscan(x) scanf("%I64d",&x);
#define lprint(x) printf("%I64d",x);
ll gcd(ll a, ll b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a%b, y, x);
y -= a / b * x;
return d;
}
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
ll M = 1000000007;
vector<ll> fac(1000001);
vector<ll> ifac(1000001);
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1) ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll mpow2(ll x, ll n, ll mod) {
ll ans = 1;
while (n != 0) {
if (n & 1) ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
void setcomb() {
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 1000000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M;
}
ifac[1000000] = mpow(fac[1000000], M - 2);
for (ll i = 1000000; i > 0; i--) {
ifac[i - 1] = ifac[i] * i%M;
}
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)return 1;
if (a < b || a < 0)return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
ll perm(ll a, ll b) {
if (a == 0 && b == 0)return 1;
if (a < b || a < 0)return 0;
return fac[a] * ifac[a - b] % M;
}
long long modinv(long long a) {
long long b = M, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= M;
if (u < 0) u += M;
return u;
}
vector<vector<ll>> mul(vector<vector<ll>> a, vector<vector<ll>> b, int n) {
int i, j, k, t;
vector<vector<ll>> c(n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
t = 0;
for (k = 0; k < n; k++)
t = (t + a[i][k] * b[k][j] % M) % M;
c[i].push_back(t);
}
}
return c;
}
template< typename Monoid >
struct SegmentTree {
int sz;
vector< Monoid > seg;
const Monoid M1;
SegmentTree(int n, const Monoid &M1) : M1(M1) {
sz = 1;
while (sz < n) sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) {
seg[k + sz] = x;
}
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) L = f(L, seg[a++]);
if (b & 1) R = f(seg[--b], R);
}
return f(L, R);
}
Monoid value(const int &k) const {
return seg[k + sz];
}
Monoid f(Monoid a, Monoid b) {
return a + b;
}
};
int main() {
ll n, m, i, x[111111], y[111111], sumx = 0, sumy = 0, ans;
cin >> n >> m;
for (i = 0; i < n; i++)
cin >> x[i];
for (i = 0; i < m; i++)
cin >> y[i];
sort(x, x + n);
sort(y, y + m);
for (i = 0; i < n; i++) {
ll count, p;
p = M - x[i];
p %= M;
count = n-1-i;
sumx += p * count%M;
sumx %= M;
p = x[i];
count = i;
sumx += p * count%M;
sumx %= M;
}
for (i = 0; i < m; i++) {
ll count, p;
p = M - y[i];
p %= M;
count = m - 1 - i;
sumy += p * count%M;
sumy %= M;
p = y[i];
count = i;
sumy += p * count%M;
sumy %= M;
}
ans = sumx * sumy%M;
cout << ans << endl;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <random>
#include <iomanip>
using namespace std;
using P = pair<long, long>;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define fillInt(xs, x) \
for (int i = 0; i < (x); i++) \
scanf("%d", &xs[i]);
#define fillLong(xs, x) \
for (int i = 0; i < (x); i++) \
scanf("%ld", &xs[i]);
#define fillString(xs, x) \
for (int i = 0; i < (x); i++) \
cin >> xs[i];
#define sortv(xs) sort(xs.begin(), xs.end())
#define sortvinv(xs) sort(xs.begin(), xs.end(), std::greater<long>())
#define lbv(xs, x) lower_bound(xs.begin(), xs.end(), x) - xs.begin()
#define ubv(xs, x) upper_bound(xs.begin(), xs.end(), x) - xs.begin()
#define bs(xs, x) binary_search(xs.begin(), xs.end(), x)
#define index_of(as, x) \
distance(as.begin(), lower_bound(as.begin(), as.end(), x))
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define concat(xs, ys) (xs).insert((xs).end(), (ys).begin(), (ys).end())
const int mod = 1000000007;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long> c(n);
rep(i, n) {
int p;
cin >> p;
c[p-1] = i;
}
vector<long> asum(n+1);
vector<long> bsum(n+1);
asum[0] = 0;
bsum[n] = 0;
rep(i, n) {
asum[i+1] = asum[i] + c[i];
}
rep(i, n) {
bsum[n-i-1] = bsum[n-i] + c[n-i-1];
}
vector<long> a(n);
vector<long> b(n);
rep(i, n) {
a[i] = i+1 + asum[i+1];
b[n-i-1] = i+1 + bsum[n-i-1];
}
rep(i, n) {
cout << a[i] << " ";
}
cout << endl;
rep(i, n) {
cout << b[i] << " ";
}
cout << endl;
}
| 0
| 71,466,828
|
#include<bits/stdc++.h>
using namespace std;
string s,t;
int ms(string a,string b){
int c=0;
for(int i=0;i<a.size();i++){
if(a[i]!=b[i])
c++;
}
return c;
}
void solve(){
int ans=1e9;
cin>>s>>t;
for(int i=0;i+t.size()<=s.size();i++){
ans=min(ans,ms(s.substr(i,t.size()),t));
}
cout<<ans;
}
int main(){
solve();
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int a[n], b[n], c[m], d[m];
for (int i = 0; i < n; i++)
{
cin >> a[i] >> b[i];
}
for (int i = 0; i < m; i++)
{
cin >> c[i] >> d[i];
}
for (int i = 0; i < n; i++)
{
int min_dist = 40000000000000;
int min_indx;
for (int j = 0; j < m; j++)
{
int dist = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (dist < min_dist)
{
min_indx = j;
min_dist = dist;
}
}
cout << min_indx + 1 << endl;
}
return 0;
}
| 0
| 21,693,590
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 1LL<<60;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template<typename T> inline string toString(const T &a){
ostringstream oss;
oss << a;
return oss.str();
};
int main(){
int N;
cin >> N;
vector<ll> A(N);
for(int i=0; i<N; i++){
cin >> A[i];
}
int l = 0;
ll ans = 0;
ll sum = 0;
for(int r=0; r<N; r++){
while(l<r){
bool can = true;
for(ll i=0; i<=20; i++){
if(sum&(1LL<<i) && A[r]&(1LL<<i)){
can = false;
}
}
if(can){
break;
}
sum -= A[l];
l++;
}
sum += A[r];
ans += (r-l+1);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll n,m,k;cin>>n>>m>>k;
for(ll i=0;i<=n;i++){
for(ll j=0;j<=m;j++){
ll cnt = i*(m-j) + j*(n-i);
if(cnt==k)return cout<<"Yes" , 0;
}
}
cout<<"No";
}
| 0
| 59,665,109
|
#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, k;
cin >> n >> k;
vl a(n);
rep(i, n) {
cin >> a[i];
}
vl mae(n);
vl ushiro(n);
rep(i, n) {
exrep(j, 0, i-1) {
if(a[j] < a[i]) {
mae[i]++;
}
}
}
rep(i, n) {
exrep(j, i+1, n-1) {
if(a[j] < a[i]) {
ushiro[i]++;
}
}
}
ll ans = 0;
rep(i, n) {
ll x = (k*(k+1)/2)%mod;
ans += (ushiro[i]*x)%mod;
ans %= mod;
}
rep(i, n) {
ll x = (k*(k-1)/2)%mod;
ans += (mae[i]*x)%mod;
ans %= mod;
}
out(ans);
re0;
}
|
#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 rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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; }
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
struct SegmentTree {
private:
int n;
vector<ll> node;
public:
SegmentTree(vector<ll> v) {
int sz = v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2*n-1, -1);
for(int i=0; i<sz; i++) node[i+n-1] = v[i];
for(int i=n-2; i>=0; i--) node[i] = max(node[2*i+1], node[2*i+2]);
}
void update(int x, ll val) {
x += (n - 1);
node[x] = val;
while(x > 0) {
x = (x - 1) / 2;
node[x] = max(node[2*x+1], node[2*x+2]);
}
}
ll getmax(int a, int b, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
if(r <= a || b <= l) return -1;
if(a <= l && r <= b) return node[k];
ll vl = getmax(a, b, 2*k+1, l, (l+r)/2);
ll vr = getmax(a, b, 2*k+2, (l+r)/2, r);
return max(vl, vr);
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
ll M, V, P;
cin >> N >> M >> V >> P;
vector<ll> a(N);
rep(i, N) cin >> a[i];
sort(a.rbegin(), a.rend());
int ans = 0;
SegmentTree seg(a);
vector<ll> suma(N+1);
suma[0] = 0;
rep(i, N){
suma[i+1] = suma[i] + a[i];
}
rep(i, N){
if(i < P){
ans++;
continue;
}
if(seg.getmax(P-1, i) > a[i] + M) continue;
ll H = max(0LL, V - (P-1 + (N-i)));
if(H*M+suma[i]-suma[P-1] <= (a[i]+M)*(i-P+1)){
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 47,077,738
|
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
int main()
{
optimize();
string st;
cin>>st;
string s=st.substr(5,2);
if(s=="01"||s=="02"||s=="03"||s=="04")
cout<<"Heisei"<<"\n";
else
cout<<"TBD"<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
ll n;
string s;
cin >> n >> s;
ll hiku = 0;
rep(i, n)
{
rep(j, n)
{
if (i + 2 * j >= n)
break;
if (s[i] != s[i + j] && s[i] != s[i + 2 * j] && s[i + j] != s[i + 2 * j])
hiku++;
}
}
ll r = 0, g = 0, b = 0;
rep(i, n)
{
if (s[i] == 'R')
r++;
if (s[i] == 'G')
g++;
if (s[i] == 'B')
b++;
}
cout << r * g * b - hiku << endl;
}
| 0
| 72,206,119
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, f, n) for (int i = (f); i < (int)(n); i++)
#define repe(i, f, n) for (int i = (f); i <= (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
const int INF = 1001001001;
int main() {
string s;
cin >> s;
rep(i, 0, s.size()) {
if ((i + 1) % 2 == 0) continue;
cout << s[i];
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int n, s;
int dfs( int a, int m, int c ){
if(a == s && c == n) return 1;
if(a > s || c > n) return 0;
if(m > 9) return 0;
int t = 0;
for(int i = m; a+i <= s && i < 10; i++){
t += dfs(a+i, i+1, c+1);
}
return t;
}
int main(){
while( true ){
cin >> n >> s;
if( n == 0 && s == 0 ) break;
cout << dfs(0, 0, 0) << endl;
}
return 0;
}
| 0
| 92,473,378
|
#include <bits/stdc++.h>
using namespace std;
int ct[26];
int main(){
string s;
cin >> s;
long long ans = 1;
for (int i = 0; i < s.size(); i++){
ans += i-ct[s[i]-'a'];
ct[s[i]-'a']++;
}
printf("%lld",ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,a[3],i;
for(i=0;i<3;i++)
{
cin >> a[i];
}
sort(a,a+3,greater<int>());
if(a[1]%2!=a[2]%2)
{
cout << ((a[0]-a[1])+(a[0]-a[2]))/2+2 << endl;
}
else
{
cout << ((a[0]-a[1])+(a[0]-a[2]))/2 << endl;
}
return 0;
}
| 0
| 24,922,141
|
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
string s; std::cin >> s;
sort(rng(s));
std::cout << (s == "abc" ? "Yes" : "No") << "\n";
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
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;}
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main() {
ll K,A,B;
cin >> K >> A >> B;
if(B-A<=2 || K < A-1){
fin(1+K);
}else{
ll sum=A;
K-=A-1;
if(K%2 == 1){
sum++;
K--;
}
sum += (B-A)*(K/2);
fin(sum);
}
}
| 0
| 60,241,529
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (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; }
void solve() {
int x; cin >> x;
int sum = 0;
string s = to_string(x); int n = (int)s.size();
rep(i, n) sum += s[i] - '0';
if(x % sum == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
int s;
bool a = x >= r && x <= W -r && y >= r && y <= H - r;
if (a){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 34,397,857
|
#include <string>
#include <iostream>
using namespace std;
int main()
{
int h, w;
while(cin >> h >> w && h && w) {
string top(w, '#');
string middle(w,'.');
middle[0] = '#'; middle.back() = '#';
cout << top << '\n';
while(h-- > 2) cout << middle << '\n';
cout << top << '\n' << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define vi vector <int>
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define piii pair< int,pair<int,int> >
#define tiii tuple <int,int,int>
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(v) v.rbegin(),v.rend()
#define endl '\n'
#define matrix vector <vector <int> >
#define boost ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define NAYAN freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define N 100001
#define mod 1000000007
#define mod2 998244353
#define inf 1e18
vector <int> g[N];
pii dp[N];
void dfs(int u,int p)
{
dp[u]={1,1};
for(int v:g[u])
{
if(v!=p)
{
dfs(v,u);
dp[u].ff=(dp[u].ff*dp[v].ss)%mod;
dp[u].ss=(dp[u].ss*(dp[v].ff+dp[v].ss))%mod;
}
}
}
int32_t main()
{
boost
int n;
cin >> n;
int u,v;
int i;
for(i=0;i<n-1;i++)
{
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
dfs(1,0);
int ans=(dp[1].ff+dp[1].ss)%mod;
cout << ans << endl;
}
| 0
| 70,497,298
|
#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;
using pll = pair<ll,ll>;
#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(){
int A[5];
rep(i,5)cin>>A[i];
int ans=0;
vector<int> B;
rep(i,5){
if(A[i]%10!=0){
ans+=A[i];
ans+=10-A[i]%10;
B.push_back(A[i]%10);
}
else{
ans+=A[i];
}
}
if(B.size()>0){
sort(all(B));
ans-=10-B[0];
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
void swap(int* x, int* y){
int temp;
temp = *x;
*x = *y;
*y = temp;
}
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a > b){
swap(&a, &b);
}
if(a > c){
swap(&a, &c);
}
if(b > c){
swap(&b, &c);
}
cout << a << " " << b << " " << c << endl;
return 0;
}
| 0
| 4,172,215
|
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstring>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define fst first
#define snd second
#define MP make_pair
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF (INT_MAX/3)
#define LIM_INF (INT_MAX)
int main(){
int N;
scanf("%d%*c", &N);
VI seq(N);
REP(i, 0, N){
scanf("%d ", &seq[i]);
}
int s = 0;
REP(i, 0, N){
int mi = INF;
int index;
REP(j, i, N){
if(mi > seq[j]){
mi = seq[j];
index = j;
}
}
if(mi != INF){
if(seq[i] != seq[index]){
int tmp = seq[i];
seq[i] = mi;
seq[index] = tmp;
s++;
}
}
}
REP(i, 0, N){
if(i > 0){
printf(" ");
}
printf("%d", seq[i]);
}
printf("\n");
printf("%d\n", s);
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
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;}
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
vector<ll> a(N), b(N);
ll A = 0, B = 0;
REP(i, N){
cin >> a[i];
A += a[i];
}
REP(i, N){
cin >> b[i];
B += b[i];
}
ll res = B - A;
ll cntA = 0, cntB = 0;
REP(i, N){
if(a[i] > b[i]){
cntB += a[i] - b[i];
}else{
cntA += (b[i]-a[i]+1)/2;
}
}
if(res >= max(cntA, cntB)){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| 0
| 91,957,618
|
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int a[10],u,count=0;
while(cin >> u ){
if(u!=0){
a[count]=u;
count++;
}
else {
cout << a[count-1]<<endl;
count--;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main()
{
ll n,m;
cin>>n>>m;
vector<ll> a(n),memo(n+10);
rep(i,m){
int b;
cin>>b;
a[b]=1;
}
memo[0]=1;
if(a[1]==0){
memo[1]=1;
}
for(ll i=2;i<=n+3;i++){
if(a[i]==1) continue;
memo[i]=memo[i-1]+memo[i-2];
memo[i]%=1000000007;
}
cout<<memo[n];
}
| 0
| 69,535,010
|
#include<iostream>
#include<queue>
#include<cstdio>
using namespace std;
const int INF=1000000;
int d[1005][1005];
int dx[4]= {1,0,-1,0};
int dy[4]= {0,1,0,-1};
char s[1005][1005];
int m,n,k;
typedef pair <int,int >P;
P aim[15];
int isd(char ch)
{
return ch>='0'&&ch<='9'?1:0;
}
int bfs(int sx,int sy,int gx,int gy)
{
queue<P> que;
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
{
d[i][j]=INF;
}
}
que.push(P(sx,sy));
d[sx][sy]=0;
while(que.size())
{
P p=que.front();
que.pop();
if(p.first==gx&&p.second==gy)
{
break;
}
for(int i=0; i<4; i++)
{
int nx=p.first+dx[i];
int ny=p.second+dy[i];
if( nx>=0&&nx<m
&&ny>=0&&ny<n
&&s[nx][ny]!='X'
&&d[nx][ny]==INF)
{
que.push(P(nx,ny));
d[nx][ny]=d[p.first][p.second]+1;
}
}
}
return d[gx][gy];
}
int main()
{
cin >> m >> n >> k;
int sum = 0;
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
{
cin >> s[i][j];
if(s[i][j]=='S')
{
aim[0].first=i;
aim[0].second=j;
}
if(isd(s[i][j]))
{
aim[s[i][j]-'0'].first=i;
aim[s[i][j]-'0'].second=j;
}
}
}
for(int i=0; i<k; i++)
{
int steep=bfs(aim[i].first,aim[i].second,aim[i+1].first,aim[i+1].second);
sum+=steep;
}
cout << sum <<endl ;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int n;
cin >> n;
list<int> l;
bool flgpush = true;
bool flgreverse = true;
int a;
for(int in=0;in<n;in++) {
cin >> a;
if(flgpush) {
l.push_front(a);
}
else {
l.push_back(a);
}
if(flgpush) {
flgpush = false;
}
else {
flgpush = true;
}
if(flgreverse) {
flgreverse = false;
}
else {
flgreverse = true;
}
cout << endl;
}
if(flgreverse) l.reverse();
for(auto itr=l.begin();itr!=l.end();itr++) {
cout << *itr << " ";
}
cout << endl;
return 0;
}
| 0
| 38,999,957
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
ll nextLong() { ll x; scanf("%lld", &x); return x;}
bool possible(const vector<ll>& A, ll s) {
const int N = A.size();
ll size = 0;
REP(i, s+1) size += A[i];
int pos = s + 1;
while (pos < N && A[pos] <= 2 * size) {
size += A[pos];
pos++;
}
return pos == N;
}
int main2() {
int N = nextLong();
vector<ll> A(N);
REP(i, N) A[i] = nextLong();
sort(ALL(A));
ll lo = -1;
ll hi = N;
while (hi - lo > 1) {
ll mid = (hi + lo) / 2;
if (possible(A, mid)) hi = mid; else lo = mid;
}
ll ans = N - hi;
cout << ans << endl;
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> a;
void solve () {
int n;
cin >> n;
string s;
cin >> s;
string ans = s;
stack<char> st;
for (int i = 0; i < (int) s.size(); i++) {
if (s[i] == ')') {
if (st.empty()) {
ans = '(' + ans;
} else {
st.pop();
}
} else {
st.push(')');
}
}
cout << ans;
for (int i = 0; i < (int) st.size(); i++) {
cout << ')';
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 97,650,855
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
long long gcd(ll a, ll b)
{
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(ll a, ll b)
{
return a / gcd(a, b) * b ;
}
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
int main()
{
string s; cin >> s;
rep(i,s.length()) {
if (i % 2 == 0)
cout << s[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define REP(i,n) for(int64 i=0;i<(n);++i)
#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)
#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)
#define ALL(obj) (obj).begin(),(obj).end()
#define pii pair<int32,int32>
#define pll pair<int64,int64>
#define pb(a) push_back(a)
#define mp make_pair
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int32 a,b;
cin >> a >> b;
if(a + b == 15){
cout << "+\n";
}else if(a * b == 15){
cout << "*\n";
}else{
cout << "x\n";
}
return 0;
}
| 0
| 98,219,490
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
string s,t; cin >> s >> t;
ll res = 0;
rep(i,s.size())if(s[i] == t[i])res++;
out(res);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;cin >> a >> b;
vector<int> c(14);
REP(i,12){
c[i+2]=i;
}
c[1]=13;
if(c[a]>c[b]){
cout << "Alice" << endl;
}
else if(c[a]<c[b]){
cout << "Bob" << endl;
}
else{
cout << "Draw" << endl;
}
}
| 0
| 69,920,291
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(a<b){
cout << a*c << endl;
}else{
int n=a-b;
cout << b*c+n*d << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N , M ;
cin >> N >> M ;
vector<int> d1(N+1) , d2(N+1);
for(int i = 0 ; i < M ; i++){
int a , b ;
cin >> a >> b ;
if(a == 1) d1.at(b)++ ;
if(b == N) d2.at(a)++ ;
}
int cnt = 0 ;
for( int i = 0 ; i <= N ; i++){
cnt++ ;
if(d1.at(i) == 0 ) continue ;
if( d2.at(i) == 1 ){
cout << "POSSIBLE" << endl ;
return 0 ;
}
}
cout << "IMPOSSIBLE" << endl ;
}
| 0
| 93,795,230
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
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;
}
template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };
template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };
using namespace std;
template <typename T>
void dump(const T &data, vector<int> &iter)
{
cout << data << " ";
}
template <typename T>
void dump(const vector<T> &data, vector<int> &iter)
{
for (auto elem : data)
dump(elem, iter);
cout << endl;
}
template <typename T>
void dump(const vector<vector<T>> &data, vector<int> &iter)
{
for (auto elem : iter)
{
cout << "[" << elem << "]";
}
cout << endl;
for (int i = 0; i < data.size(); i++)
{
iter.push_back(i);
dump(data[i], iter);
iter.pop_back();
}
cout << endl;
}
template <typename T>
void dump(const vector<T> &data, int dummy)
{
for (int i = 0; i < data.size(); i++)
{
cout << "[" << i << "] " << data[i] << endl;
}
}
template <typename T>
void dump(const T &data)
{
vector<int> iter;
dump(data, iter);
}
void solve(long long A, long long B, long long C, long long K)
{
LL ans = 0;
ans += min(A, K);
K -= A;
if (K >= 0)
{
K -= B;
}
if (K >= 0)
{
ans -= K;
}
cout << ans << endl;
}
int main()
{
cout << setprecision(10);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long K;
scanf("%lld", &K);
solve(A, B, C, K);
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <bitset>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define maxn 5005
#define mod 998244353
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define vv(z,a,b) vector<vector<int>>z(a,vector<int>(b))
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(c) begin(c),end(c)
#define pp pair<int,int>
#define fix(n) fixed << setprecision(n)
using namespace std;
int main(){
int n,m;cin>>n>>m;
vi d(n);
rep(i,n)d.at(i)=i+1;
vv (a,m,2);
rep(i,m)rep(j,2)cin>>a.at(i).at(j);
int ans=0;
do{
if(d.at(0)!=1)break;
int flag=0;
for(int i=1;i<n;i++){
rep(j,m){
if((d.at(i-1)==a.at(j).at(0))||(d.at(i-1)==a.at(j).at(1))){
if((d.at(i)==a.at(j).at(1))||(d.at(i)==a.at(j).at(0))){
flag++;
break;
}
}
}
}
if(flag==(n-1)){
if(flag<=m)ans++;
}
}while(next_permutation(all(d)));
cout<<ans<<endl;
}
| 0
| 5,577,723
|
#include <iostream>
using namespace std;
int c[16], a[16][16], n, m, x;
bool v[16];
int ans = 2e9;
void checkSol() {
for(int j = 1; j <= m; j++) {
int total = 0;
for(int i = 1; i <= n; i++)
if(v[i]) total += a[i][j];
if(total < x) return;
}
int cost = 0;
for(int i = 1; i <= n; i++)
if(v[i])
cost += c[i];
ans = min(ans, cost);
}
void backtracking(int k) {
for(int i = 0; i <= 1; i++) {
v[k] = i;
if(k == n) {
checkSol();
} else {
backtracking(k+1);
}
}
}
int main() {
cin >> n >> m >> x;
for(int i = 1; i <= n; i++) {
cin >> c[i];
for(int j = 1; j <= m; j++)
cin >> a[i][j];
}
for(int j = 1; j <= m; j++) {
int total = 0;
for(int i = 1; i <= n; i++)
total += a[i][j];
if(total < x) {
cout << -1;
return 0;
}
}
backtracking(1);
cout << ans;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; ++i)
{
int num;
cin >> num;
a[i] = num;
b[i] = num;
}
sort(a.begin(), a.end());
int max = a[n-1];
int next;
bool dup = false;
for(int i = n-2; i >=0; --i)
{
if(a[i] == max)
{
dup = true;
}
else
{
next = a[i];
break;
}
}
for(int i = 0; i < n; ++i)
{
if(b[i] != max)
{
cout << max << endl;
}
else
{
if(dup) cout << max << endl;
else cout << next << endl;
}
}
}
| 0
| 72,518,843
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
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; }
signed main(){
ll n,m; cin >> n >> m;
ll cnt = 0, cnt2 = 0;
vector<bool> ok(n,0);
map<ll,ll> mp;
rep(i,0,m){
ll p; string s;
cin >> p >> s;
if(ok[p])continue;
if(s == "AC"){
ok[p] = 1;
cnt++;
}
else mp[p]++;
}
for(auto c:mp){
if(!ok[c.first])continue;
cnt2 += c.second;
}
cout << cnt << " " << cnt2 << endl;
return 0;
}
|
#include <iostream>
#include <map>
#include <vector>
using namespace std;
long long nChoosek( long long n, long long k )
{
if (k > n) return 0;
if (k * 2 > n) k = n-k;
if (k == 0) return 1;
long long result = n;
for( long long i = 2; i <= k; ++i ) {
result *= (n-i+1);
result /= i;
}
return result;
}
int main(){
long long n;cin>>n;
vector<long long> balls(n);for (long long i=0;i<n;i++){cin>>balls[i];};
map<long long, long long> counter;
for (auto b : balls){
if (counter.find(b) == counter.end()){
counter[b] = 1;
} else {
counter[b]++;
}
}
map<long long, long long> memo;
long long base_number = 0;
for (auto freq : counter){
memo[freq.first] = nChoosek(freq.second, 2);
base_number += memo[freq.first];
}
for (auto ball : balls){
if (memo[ball] == 0){
cout << base_number << endl;
} else {
cout << base_number - memo[ball] + nChoosek(counter[ball]-1, 2) << endl;
}
}
}
| 0
| 59,061,223
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll ans = 1e18;
for (int bit = 0; bit < (1 << n); ++bit) {
int bitcnt = 0;
ll cur = 0, cost = 0;
for (int i = 0; i < n; ++i) {
if(bit & (1 << i)) {
bitcnt++;
if(cur >= a[i]) {
cost += cur + 1 - a[i];
cur = max(cur + 1, a[i]);
}
}
cur = max(cur, a[i]);
}
if(bitcnt == k) {
ans = min(ans, cost);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
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 double> vld;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> 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> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion
#pragma region CONST_VAL
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;
#pragma endregion
#define int long long
vector<vector<char> > buttons = {
{'.',',','!','?', ' '},
{'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'}
};
signed main()
{
int n;
cin >> n;
while(n--) {
string s;
cin >> s;
string ans = "";
int bt = 0;
int cnt = 0;
for(int i=0; i<s.size(); ++i) {
int num = s[i] - '0';
if(num==0) {
if(bt==0) continue;
if(bt==1) {
cnt %= 5;
if(cnt==0) cnt = 4;
else cnt--;
}
else if(bt==7||bt==9) {
cnt %= 4;
if(cnt==0) cnt = 3;
else cnt--;
}
else {
cnt %= 3;
if(cnt==0) cnt = 2;
else cnt--;
}
ans += buttons[bt-1][cnt];
bt = 0;
cnt = 0;
continue;
}
if(bt!=num) {
bt = num;
cnt = 1;
}
else cnt++;
}
cout << ans << endl;
}
return 0;
}
| 0
| 46,755,513
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N ; cin >> N ;
int P ;
int a,b,c,d,e,f,g,h ;
a = N % 10 ;
b = (N / 10) % 10 ;
c = (N / 100) % 10 ;
d = (N / 1000) % 10 ;
e = (N / 10000) % 10 ;
f = (N / 100000) % 10 ;
g = (N / 1000000) % 10 ;
h = (N / 10000000) % 10 ;
if ( N % (a+b+c+d+e+f+g+h) == 0 ){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
#define inf 1000000005
#define mod 1000000007
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define each(a,b) for(auto& (a): (b))
#define pct __builtin_popcountll
#define all(a) a.begin(),a.end()
#define sz(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define rev(v) reverse((v).begin(),(v).end());
#define so(v) sort((v).begin(), (v).end());
#define yn {puts("Yes");}else{puts("No");}
#define dame { puts("-1"); return 0;}
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vp = vector<P>;
using vt = vector<T>;
using vs = vector<string>;
int main() {
int a;
cin >> a;
cout << 180 * (a - 2) << endl;
return 0;
}
| 0
| 79,012,248
|
#include <bits/stdc++.h>
using namespace std;
const int dx[]={1,0,0,-1,1,-1,-1,1};
const int dy[]={0,1,-1,0,1,1,-1,-1};
const int INF = 1<<30;
const double EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i,j,k) for(int i = (j); i < (k); ++i)
#define rep(i,j) reps(i,0,j)
#define MOD 1000000007
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> Pii;
typedef pair<int,vi > P;
typedef long long ll;
int coin[25];
int N,M;
int memo[21][50001];
int solve(int idx,int money){
if(memo[idx][money]){
return memo[idx][money];
}
if(money == N){
return 0;
}
if(idx == M){
return INF;
}
int ret = INF;
reps(i,idx,M){
if(money + coin[i] > N)continue;
ret = min(ret,solve(i,money+coin[i]) + 1);
}
return memo[idx][money] = ret;
}
int main(){
scanf("%d%d",&N,&M);
rep(i,M){
scanf("%d",&coin[i]);
}
sort(coin,coin+M);
printf("%d\n",solve(0,0));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename Q_temp>
using smaller_queue = priority_queue <Q_temp, vector<Q_temp>, greater<Q_temp> >;
const int INF = (int) 1e9;
const ll LINF = (ll) 4e18;
const ll MOD = (ll) (1e9 + 7);
const double PI = acos(-1.0);
#define REP(i,m,n) for(ll i = m; i < (ll)(n); ++i)
#define rep(i,n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#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 all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbg2(x_) for(auto a_ : x_) cerr << a_ << " "; cerr << endl;
#define dbg3(x_ , sx_) rep(i, sx_) cerr << x_[i] << " "; cerr << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};
inline ll CEIL(ll a, ll b) {
return (a + b - 1) / b;
}
void finish() {
cout << -1 << endl;
exit(0);
}
class UnionFind {
private:
vector<int> par, sizes;
public:
UnionFind(int n = 100010) : par(n), sizes(n, 1) {
rep(i, n) par[i] = i;
}
int root(int x) {
if (x == par[x]) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return;
if (sizes[x] < sizes[y]) swap(x, y);
par[y] = x;
sizes[x] += sizes[y];
}
bool same(int x, int y) {
return root(x) == root(y);
}
int size(int x) {
return sizes[root(x)];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,b;
cin >> n >> a >> b;
int easy=0, normal=0, hard=0;
rep(i,n){
int p; cin >> p;
if(p <= a) easy++;
else if(p > b) hard++;
else normal++;
}
cout << min({easy, normal, hard}) << endl;
return 0;
}
| 0
| 73,505,837
|
#include <bits/stdc++.h>
#define F first
#define S second
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define p_b push_back
#define all(c) c.begin(), c.end()
using namespace std;
typedef long long ll;
typedef pair <int , int> pii;
typedef pair <ll , ll> pll;
const double eps = 1e-6;
const int MAXN = 1e6 + 5;
const ll MOD = 1e9 + 7;
bool ODD(ll O) {return (O % 2 != 0);}
ll gcd(ll a, ll b) {return __gcd(a , b);}
int dx[] = {1, 0, -1 ,0 , -1 , 0};
int dy[] = {0, 1, 0, -1 , -1 , 0};
ll power (ll x, ll y) {
if(y == 0) return 1;
if(ODD(y)) return x * power(x , y / 2) * power(x , y / 2);
return power(x , y / 2) * power(x , y / 2);
}
int main () {
int t = 1;
while(t--) {
int a, b;
cin >> a >> b;
int ans = 1e9 + 5;
for(int i = a; i <= b; i++) {
for(int j = i + 1; j <= b; j++) {
int x = i % 2019;
int y = j % 2019;
ans = min(ans , (x * y) % 2019);
if(ans == 0) {
cout << ans;
return 0;
}
}
}
cout << ans;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
#include<cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()
const int MAXN = 100 * 1000 + 10;
double s[MAXN];
double t;
int main()
{
int n, k;
while(cin >> n >> k && n)
{
s[0] = 0;
REP(n){cin >> t; s[i+1] = s[i] + t;}
double ans = 0;
for(int i = 0;i + k < n;i++){ ans = max(ans, s[i+k] - s[i]);}
printf("%d\n", (long long)ans);
}
return 0;
}
| 0
| 55,313,621
|
#include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N, K;
cin>>N>>K;
ll ans;
if(K%2LL==1LL){
ll t = N/K;
ans = t*t*t;
}
if(K%2LL==0LL){
ll t = N/K;
ll s = (N+(K/2LL))/K;
ans = t*t*t+s*s*s;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define SZ(a) (int)((a).size())
#define pb push_back
#define mp make_pair
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> PI;
typedef unsigned long long ull;
#define PR(...) do{cerr << "line : " << __LINE__ << endl; pr(#__VA_ARGS__, __VA_ARGS__);}while(0);
template<class T>
void pr(const string& name, T t){
cerr << name << ": " << t << endl;
}
template<typename T, typename ... Types>
void pr(const string& names, T t, Types ... rest) {
auto comma_pos = names.find(',');
cerr << names.substr(0, comma_pos) << ": " << t << ", ";
auto next_name_pos = names.find_first_not_of(" \t\n", comma_pos + 1);
pr(string(names, next_name_pos), rest ...);
}
template<class T,class U> ostream& operator<< (ostream& o, const pair<T,U>& v){return o << "(" << v.F << ", " << v.S << ")";}
template<class T> ostream& operator<< (ostream& o, const vector<T>& v){o << "{";rep(i,SZ(v)) o << (i?", ":"") << v[i];return o << "}";}
template<class T> ostream& operator<< (ostream& o, const set<T> &v){o << "{";for(auto e : v) o << e << ", ";return o << "}";}
template<class T, class U> ostream& operator<< (ostream& o, const map<T,U> &v){o << "{";for(auto e : v) o << e.F << ": " << e.S << ", ";return o << "}";}
const int dx[] = {0,1,0,-1};
const int dy[] = {-1,0,1,0};
#define endl '\n'
int main(int argc, char *argv[])
{
int n;
while(cin >> n && n){
int ans = 0;
int st = 0;
int l = 0, r = 0;
rep(i, n){
string s;
cin >> s;
if(s[0]=='l') l = !l;
else r = !r;
if(l == r && l != st){
st = l;
++ans;
}
}
cout << ans << endl;
}
}
| 0
| 60,593,304
|
#include<iostream>
#include<vector>
#include<algorithm>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
int compute(int y, int m, int d){
int cnt = 0;
int b_years = (y-1)/3;
int s_years = (y-1) - b_years;
cnt += b_years*200 + s_years*195;
if(y%3==0){
cnt += (m-1)*20;
}else{
int s_months = (m-1)/2;
int b_months = (m-1) - s_months;
cnt += s_months*19 + b_months*20;
}
cnt += (d-1);
return cnt;
}
int main(){
int n,y,m,d;
cin >> n;
REP(k,n){
cin >> y >> m >> d;
cout << compute(1000,1,1) - compute(y,m,d) << endl;
}
return 0;
}
|
#include<cmath>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<algorithm>
#include<list>
#include<cstring>
#include <numeric>
#define ll long long
#define int long long
#define ld long double
#define endl "\n"
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(p) cerr<<#p<<'='<<(p.first)<<" "<<p.second<<endl;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define output(x) cout << (x ? "YES" : "NO")<<endl;
const ll MOD = 1e9 + 7;
const int N = 'Z'+5;
const int demo = 10;
using namespace std;
const ll cfmod=998244353;
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int dx[4]={0,0,-1,1};
int dy[4]={-1,1,0,0};
char button[4]={'L','R','U','D'};
signed main() {
FAST
int q = 1;
while (q--) {
int arr[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int n;
cin>>n;
cout<<arr[n-1];
}
}
| 0
| 61,282,351
|
#include<stdio.h>
int main()
{
int x,y;
scanf("%d %d",&x,&y);
while(1){
if(x==0 && y==0) break;
if(x>y){
printf("%d %d\n",y,x);
}
else {
printf("%d %d\n",x,y);
}
scanf("%d %d",&x,&y);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s, t;
cin >> s >> t;
int ls = s.size();
int lt = t.size();
vector<string> ss;
for (int i = 0; i + lt - 1 < ls; ++i) {
bool ok = true;
rep(j, lt) {
if (s[i + j] != '?' && s[i + j] != t[j]) ok = false;
}
string u = "";
rep(j, ls) {
if (j >= i && j < i + lt) u += t[j-i];
else if (s[j] == '?') u += 'a';
else u += s[j];
}
if (ok) ss.push_back(u);
}
sort(ss.begin(), ss.end());
if (ss.size() == 0) ss.push_back("UNRESTORABLE");
cout << ss[0] << endl;
return 0;
}
| 0
| 7,135,082
|
#include <iostream>
int triangle(int x, int y, int z)
{
int a = x * x;
int b = y * y;
int c = z * z;
return (a + b - c) * (b + c - a) * (c + a - b);
}
int main()
{
int N, x, y, z;
std::cin >> N;
for(int i = 0; i < N; i++){
std::cin >> x >> y >> z;
if ( triangle(x, y, z) == 0 ){
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
struct tree{
int p;
int l;
int r;
int d;
};
tree t[100000];
void dfs(int n,int d){
if(n==-1)return;
t[n].d=d;
dfs(t[n].r,d),dfs(t[n].l,d+1);
}
int main(){
int n,a,b,c,tmp;
cin>>n;
for(int i=0;i<n;i++)t[i].l=-1,t[i].p=-1,t[i].r=-1,t[i].d=0;
for(int i=0;i<n;i++){
scanf("%d %d",&a,&b);
for(int j=0;j<b;j++){
scanf("%d",&c);
t[c].p=a;
if(j)t[tmp].r=c;
tmp=c;
if(j==0)t[a].l=c;
}
}
for(int i=0;i<n;i++)if(t[i].p==-1)dfs(i,0);
for(int i=0;i<n;i++){
printf("node %d: parent = %d, depth = %d, ",i,t[i].p,t[i].d);
if(t[i].l==-1){
if(t[i].p==-1)printf("root, []\n");
else printf("leaf, []\n");
}
else{
if(t[i].p==-1)printf("root, [");
else printf("internal node, [");
tmp=t[i].l;
while(1){
if(t[tmp].r==-1){
printf("%d]\n",tmp);
break;
}
printf("%d, ",tmp);
tmp=t[tmp].r;
}
}
}
return 0;
}
| 0
| 87,525,051
|
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int n, k;
std::cin >> n >> k;
int mx = 0, g = 0;
while(n--) {
int x;
std::cin >> x;
g = gcd(g, x);
mx = std::max(mx, x);
}
std::cout << (k % g == 0 && k <= mx ? "POSSIBLE\n" : "IMPOSSIBLE\n");
}
|
#include <bits/stdc++.h>
#define ll uint64_t
#define vi vector <int>
#define vl vector <ll>
#define dl pair <ll, ll>
#define ii pair <ll, ll>
#define vii vector <ii>
#define graph vector <set <int> >
#define REP(a, b, step) for (int a = 0; a < b; a += step)
#define inf 1000000000
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, l;
cin >> n >> l;
string arr[n];
REP(i, n, 1) {
cin >> arr[i];
}
sort(arr, arr + n);
REP(i, n, 1) {
cout << arr[i];
}
cout << "\n";
return 0;
}
| 0
| 31,000,293
|
#include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long A, long long B, long long C, long long K) {
if (K <= A + B) {
cout << min(A, K) << endl;
} else {
cout << A - (K - (A + B)) << endl;
}
}
int main() {
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long K;
scanf("%lld", &K);
solve(A, B, C, K);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a.at(i);
}
ll ans1=0;
ll ans2=1;
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
rep(i,n-3){
if(a.at(i)==a.at(i+3)){
ans1=a.at(i)*a.at(i+3);
break;
}
}
int cnt=0;
set<ll> chk;
rep(i,n-1){
if(a.at(i)==a.at(i+1)){
if(chk.count(a.at(i))){
}
else{
ans2*=a.at(i);
chk.insert(a.at(i));
cnt++;
}
}
if(cnt>=2)break;
if(i==n-2 && cnt<=1)ans2=0;
}
ll ans=max(ans1,ans2);
cout << ans << endl;
}
| 0
| 9,725,348
|
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int s = a;
int m = b;
int l = c;
int tmp;
if (s > m) {
tmp = s;
s = m;
m = tmp;
}
if (m > l) {
tmp = m;
m = l;
l = tmp;
}
if (s > m) {
tmp = s;
s = m;
m = tmp;
}
cout << s << " " << m << " " << l << "\n";
return 0;
}
|
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<sstream>
using namespace std;
#define sf scanf
#define pf printf
#define pfn printf("\n");
#define pfk printf(" ");
#define pf0 printf("0");
#define pf1 printf("1");
#define ll long long
#define sfd(n) scanf("%d",&n);
#define sfdd(n,m) scanf("%d%d",&n,&m);
#define sfld(n) scanf("%lld",&n);
#define sfldd(n,m) scanf("%lld%lld",&n,&m);
#define sflf(n) scanf("%lf",&n);
#define sflff(n,m) scanf("%lf%lf",&n,&m);
#define sfc(n) scanf("%c",n);
#define sfcc(n,m) scanf("%c%c",n,m);
#define sfs(n) scanf("%s",n);
#define sfss(n,m) scanf("%s%s",n,m);
#define pfd(n) printf("%d",n);
#define pfld(n) printf("%lld",n);
#define pflf(n) printf("%lf",n);
#define pfc(n) printf("%c",n);
#define pfs(n) printf("%s",n);
#define csh(a,n) memset(a,n,sizeof(a));
ll arr[51];
int main(){
for(int i=0;i<51;i++){
arr[i]=i;
}
ll n;
cin>>n;
ll c=0;
c=n/50;
cout<<"50"<<endl;
for(int i=0;i<50-n%50;i++){
if(i!=0){
cout<<' ';
}
cout<<arr[i]+c;
}
for(int i=50-n%50;i<50;i++){
if(i!=0){
cout<<' ';
}
cout<<arr[i]+1+c;
}
}
| 0
| 78,931,608
|
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
cout<<111+999-n<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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; }
typedef long long ll;
using namespace std;
int main(void){
int n;cin>>n;
map<int,int> mp1,mp2;
rep(i,n/2){
int x,y;cin>>x>>y;
mp1[x]++;
mp2[y]++;
}
priority_queue<pair<int,int>> que1,que2;
for(auto& p:mp1){
que1.push({p.second,p.first});
}
for(auto& p:mp2){
que2.push({p.second,p.first});
}
int x1=que1.top().first,y1=que1.top().second;que1.pop();
int x2=(que1.size())? que1.top().first:0;que1.pop();
int x3=que2.top().first,y3=que2.top().second;que2.pop();
int x4=(que2.size())? que2.top().first:0;que2.pop();
if(y1!=y3){
ll res=n-(x1+x3);
cout<<res<<endl;
return 0;
}else{
ll buf1=n-(x1+x4),buf2=n-(x2+x3);
ll res=min(buf1,buf2);
cout<<res<<endl;
return 0;
}
}
| 0
| 39,149,227
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
class SegTree {
int n;
vector<T> data;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
T find(int a, int b)
{
ll val_left = def;
ll val_right = def;
for (a += (n - 1), b += (n - 1); a < b; a >>= 1, b >>= 1)
{
if ((a & 1) == 0)
{
val_left = operation(val_left, data[a]);
}
if ((b & 1) == 0)
{
val_right = operation(val_right, data[--b]);
}
}
return operation(val_left, val_right);
}
public:
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void set(int i, T x) { data[i + n - 1] = x; }
void build() {
for (int k = n - 2; k >= 0; k--) data[k] = operation(data[2 * k + 1], data[2 * k + 2]);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) {
return find(a,b);
}
T operator[](int i) {
return data[i + n - 1];
}
};
int main() {
ll X;
ll N;
cin >>X>>N;
vl p(N);
rep(i,N) {
cin >>p.at(i);
}
sort(all(p));
ll c=0;
rep(i,10000){
ll count1=0;
ll count2=0;
rep(i,N) {
if(p.at(i)==X-c) {
count1++;
}
if(p.at(i)==X+c) {
count2++;
}
}
if((count1!=0) &&(count2!=0)) {
c++;
continue;
}
else if(count1==0) {
cout<<X-c<<endl;
break;
}
else if(count2==0) {
cout<<X+c<<endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) {
return modpow(a, mod - 2, mod);
}
ll nCr(ll n, ll r) {
ll ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans * i % mod;
}
for (ll i = 1 ; i < r + 1; ++i) {
ans = ans * modinv(i, mod) % mod;
}
return ans;
}
int main() {
ll X, Y;
cin >> X >> Y;
ll ans;
if((X + Y) % 3 != 0){
ans = 0;
} else {
ll A, B, N;
A = (2 * Y - X) / 3;
B = (2 * X - Y) / 3;
if(A < 0 || B < 0){
ans = 0;
} else {
N = A + B;
ans = nCr(N, min(A, B));
}
}
cout << ans << endl;
return 0;
}
| 0
| 51,380,863
|
using namespace std;
#include <bits/stdc++.h>
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(abs(a-b)<=d){
if(abs(b-c)<=d){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
}
else if(abs(a-c)<=d){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace std;
bool prime(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b){
if(a<b){
swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd(b,a%b);
}
}
long long lcm(long long x, long long y){
return (x/gcd(x,y))*y;
}
class UnionFind {
public:
vector<int> Parent;
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
int root(int A) {
if (Parent[A] < 0) return A;
return Parent[A] = root(Parent[A]);
}
int size(int A) {
return -Parent[root(A)];
}
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B) {
return false;
}
if (size(A) < size(B)) swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
int main(){
int n,a,b;
cin>>n>>a>>b;
if(n<a+b-1 || (long long)n>(long long)a*(long long)b){
cout<<-1<<endl;
return 0;
}
vector<int> ans[b];
REP(i,a){
ans[0].push_back(n-a+1+i);
}
int rest = n-a;
bool flag = false;
bool corner=false;
int current=1;
int now;
for(int i=b-1;i>=1;i--){
if(rest==i){
now = i;
break;
}else{
REP(j,a){
ans[i].push_back(current);
rest--;
current++;
if(rest==i){
flag = true;
break;
}
}
if(flag){
if((int)ans[i].size()==a){
now = i-1;
corner = true;
}else{
now = i;
}
break;
}
}
}
for(int i=now;i>=1;i--){
ans[i].push_back(current);
current++;
if(i==now && corner){
ans[i].push_back(current);
current++;
}
}
int s;
REP(i,b){
s = ans[i].size();
REP(j,s){
cout<<ans[i][j]<<' ';
}
}
cout<<endl;
return 0;
}
| 0
| 37,859,828
|
#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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
ll N;
cin >> N;
ll sumA=0;
ll sumB=0;
vector<ll> A(N);
REP(i, N){
cin >> A[i];
sumA+=A[i];
}
vector<ll> B(N);
REP(i, N){
cin >> B[i];
sumB+=B[i];
}
if(sumB<sumA){
cout << "No" << endl;
}else{
ll xA = sumB-sumA;
ll xB = sumB-sumA;
REP(i,N){
if(A[i]>B[i]){
xB-=A[i]-B[i];
}else if(A[i]<B[i]){
if((B[i]-A[i])%2==0){
xA-=(B[i]-A[i])/2;
}else{
xA-=(B[i]-A[i])/2+1;
}
xB-=(B[i]-A[i])%2;
}
}
if(xA*2==xB&&xA>=0&&xB>=0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
int main(){
int N;
ll K;cin>>N>>K;
vector<ll> A(N),B(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
}
ll ans=0;
int dig=-1;
for(int i=30;i>=0;i--){
ll sum=0;
if(K&(1<<i)){
if(dig==-1){
for(int j=0;j<N;j++){
if(A[j]>=(1<<i)) continue;
if(!(A[j]&(1<<i))) sum+=B[j];
}
ans=max(ans,sum);
dig=i;
}else{
for(int j=0;j<N;j++){
bool flag=true;
if(A[j]>=(1<<(dig+1))) flag=false;
for(int k=dig;k>=i+1;k--){
if(!(K&(1<<k))){
if(A[j]&(1<<k)) flag=false;
}
}
if(A[j]&(1<<i)) flag=false;
if(flag) sum+=B[j];
}
ans=max(ans,sum);
}
}
}
ll sum=0;
for(int j=0;j<N;j++){
bool flag=true;
if(A[j]>K) flag=false;
for(int k=dig;k>=0;k--){
if(!(K&(1<<k))){
if(A[j]&(1<<k)) flag=false;
}
}
if(flag) sum+=B[j];
}
ans=max(ans,sum);
cout<<ans<<endl;
}
| 0
| 14,788,688
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using ll = long long;
const int inf = 1e8;
int dp[105][105];
int main() {
int n;
cin >> n;
vector<int> p(n+1);
cin >> p[0] >> p[1];
rep(i,n-1) {
int a, b;
cin >> a >> b;
p[i+2] = b;
}
rep(i,105)rep(j,105) dp[i][j] = inf;
rep(i,n+1) dp[i][i] = 0;
for (int i = n-1; i >= 1; i--) {
for (int j = i+1; j <= n; j++) {
if (j == i+1) dp[i][j] = p[i-1]*p[i]*p[i+1];
else {
for (int k = i; k <= j-1; k++) {
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]+p[i-1]*p[k]*p[j]);
}
}
}
}
cout << dp[1][n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
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 (b<a) { a=b; return 1; } return 0; }
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 5e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
int main() {
init();
ll N, A, B;
cin >> N >> A >> B;
vl P(N);
rep(i, N) cin >> P[i];
sort(all(P));
ll ac = 0, bc = 0;
rep(i,N){
if(P[i]<=A){
ac++, bc++;
}
else if(P[i]<=B)
bc++;
}
cout << min(min(ac, (bc - ac)), N - bc) << endl;
}
| 0
| 54,451,650
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, x;
cin >> n >> d >> x;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
while (cnt * a.at(i) + 1 <= d) {
cnt++;
}
ans += cnt;
}
cout << ans + x << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,a,b;
cin >> n >> b >> a;
if(a+b<=n+1&&a*b>=n) {
for(ll i=a;i;i--) {
if(i!=a) cout << " ";
cout << i;
}
if(b!=1) {
ll s=(n-a)/(b-1);
ll m=(n-a)%(b-1);
ll pre=a;
while(--b) {
ll cur=pre+s;
if(m-->0) cur++;
for(ll i=cur;i>pre;i--) {
cout << " " << i;
}
pre=cur;
}
}
cout << endl;
}
else cout << -1 << endl;
}
| 0
| 65,747,563
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
vector<long long> dp, paty;
long long dfs(long long N, long long X){
long long ans = 0;
if(X == 1 && N == 0) return 1;
else if(X == 1) return 0;
if(X == dp[N]) return paty[N];
if(X > dp[N] / 2 + 1) ans += dfs(N - 1, X - dp[N] / 2 - 1) + 1 + paty[N] / 2;
else if(X == dp[N] / 2 + 1) ans += paty[N] / 2 + 1;
else ans += dfs(N - 1, X - 1);
return ans;
}
int main(){
long long N;
cin >> N;
long long X;
cin >> X;
dp.resize(N + 1), paty.resize(N + 1);
dp[0] = 1;
paty[0] = 1;
for(int i = 1; i < N + 1; i++){
dp[i] = dp[i - 1] * 2 + 3;
paty[i] = paty[i - 1] * 2 + 1;
}
cout << dfs(N, X) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main(){
int N, K;
cin >> N >> K;
vector<long long> H(N);
long long ans = 0;
for(int i=0; i<N; ++i){
cin >> H[i];
}
sort(H.rbegin(), H.rend());
if( N <= K){
ans = 0;
}else{
for(int i=K; i<N; ++i){
ans += H[i];
}
}
cout << ans << endl;
}
| 0
| 61,546,412
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include <list>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#ifdef DEBUG
#define show(...) cerr << #__VA_ARGS__ << " = ", debug(__VA_ARGS__);
#else
#define show(...) 42
#endif
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T, typename S>
ostream& operator<<(ostream& os, pair<T, S> a) {
os << '(' << a.first << ',' << a.second << ')';
return os;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
for (auto x : v) os << x << ' ';
return os;
}
void debug() {
cerr << '\n';
}
template <typename H, typename... T>
void debug(H a, T... b) {
cerr << a;
if (sizeof...(b)) cerr << ", ";
debug(b...);
}
int main(){
int n;
cin >> n;
vector<int>a(n);
rep(i,n)cin >> a[i];
auto f = [&](ll x){
rep(i,n)x = x / a[i] * a[i];
return x;
};
if(f(1LL<<60)<2){
cout << - 1 << endl;
return 0;
}
ll b,c;
{
ll l = 1, r = 1LL<<60;
while(r - l > 1){
ll mid = (l + r) / 2;
if(f(mid) < 2){
l = mid;
}else{
r = mid;
}
}
b = r;
}
{
ll l = 1, r = 1LL<<60;
while(r - l > 1){
ll mid = (l + r) / 2;
if(f(mid) > 2){
r = mid;
}else{
l = mid;
}
}
c = l;
}
if(b > c){
cout << -1 << endl;
}else{
cout << b << " " << c << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
struct Card{
char suit, value;
};
void BubbleSort(struct Card A[], int N){
int flag =1;
int swap = 0;
while(flag){
flag = 0;
for(int i = N-1; i >= 1; i--){
if(A[i].value < A[i-1].value){
Card tmp = A[i];
A[i] = A[i-1];
A[i-1] = tmp;
flag = 1;
swap++;
}
}
}
}
void SelectionSort(struct Card A[], int N){
int swap = 0;
for(int i = 0; i < N; i++){
int minj = i;
for(int j = i; j < N; j++){
if(A[j].value < A[minj].value){
minj = j;
}
}
if(A[minj].value != A[i].value){
Card tmp = A[minj];
A[minj] = A[i];
A[i] = tmp;
swap++;
}
}
}
void print(struct Card A[], int N){
for(int i = 0; i < N; i++){
cout<<A[i].suit<<A[i].value;
if(i != N-1){
cout<<" ";
}else{
cout<<endl;
}
}
}
bool isStable(struct Card A[], struct Card B[], int N){
for(int i = 0; i < N; i++){
if((A[i].value != B[i].value) || (A[i].suit != B[i].suit)){
return false;
}
}
return true;
}
int main(){
int a;
cin>>a;
Card C1[100], C2[100];
for(int k = 0; k < a; k++){
cin>>C1[k].suit>>C1[k].value;
}
for(int i = 0; i < a; i++){
C2[i] = C1[i];
}
BubbleSort(C1,a);
SelectionSort(C2,a);
print(C1,a);
if(isStable(C1,C1,a)){
cout<<"Stable"<<endl;
}else{
cout<<"Not stable"<<endl;
}
print(C2,a);
if(isStable(C1,C2,a)){
cout<<"Stable"<<endl;
}else{
cout<<"Not stable"<<endl;
}
}
| 0
| 93,047,805
|
#include<iostream>
#include<string>
#include<stack>
using namespace std;
string s;
void solve(){
stack<char> T;
for(int i=0;i<s.size();i++){
if(s[i]=='(' || s[i]=='[')
T.push(s[i]);
if(s[i]==')'){
if(T.empty()){cout<<"no"<<endl;return;}
if(T.top()=='(') T.pop();
else{cout<<"no"<<endl;return;}
}
if(s[i]==']'){
if(T.empty()){cout<<"no"<<endl;return;}
if(T.top()=='[') T.pop();
else{cout<<"no"<<endl;return;}
}
}
if(T.empty())
cout<<"yes\n";
else cout<<"no\n";
}
int main(){
while(getline(cin,s)){
if(s==".") break;
solve();
}
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
ll n,m,a,b,c,dp[100][100];
int main(void){
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i!=j)dp[i][j]=1e18;
}
}
for(int i=0;i<m;i++){
cin>>a>>b>>c;
dp[a][b]=c;
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(dp[i][k]==1e18||dp[k][j]==1e18)continue;
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
for(int i=0;i<n;i++){
if(dp[i][i]!=0){
cout<<"NEGATIVE CYCLE"<<endl;
return 0;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(dp[i][j]==1e18)cout<<"INF";
else cout<<dp[i][j];
if(j!=n-1)cout<<" ";
}
cout<<endl;
}
}
| 0
| 29,773,225
|
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define LL long long
int n;
vector<vector<int>> v;
int main(){
cin>>n;
int k=0;
FOR(i,1,10000){
k+=i;
if(n<k){
cout<<"No"<<endl;
return 0;
}
if(n==k){
k=i;
break;
}
}
if(k==1){
cout<<"Yes"<<endl;
cout<<2<<endl;
cout<<1<<" "<<1<<endl;
cout<<1<<" "<<1<<endl;
return 0;
}
k+=1;
v.resize(k);
int su=0;
FOR(i,1,k){
REP(j,i){
su+=1;
v[j].push_back(su);
v[i].push_back(su);
}
}
cout<<"Yes"<<endl;
cout<<k<<endl;
REP(i,v.size()){
cout<<k-1;
REP(j,v[i].size()){
cout<<" "<<v[i][j];
}
cout<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include <unordered_map>
#define int long long int
#define double long double
#define endl "\n"
#define PI 3.141592653589793238462643383279502884
#define sum_up(x) (x*(x+1))/2
#define sp(x) setprecision(x)
#define ceil(a,b) (a+(b-1))/b
#define mp(a,b) make_pair(a,b)
#define LCM(a,b) (a*b)/__gcd(a,b)
#define all(v) v.begin(),v.end()
#define alls(s,v) s.begin(),s.end(),v
#define gena(arr,n,nxt) generate(arr,arr+n, nxt)
#define genv(v,nxt) generate(v.begin(),v.end(), nxt)
#define BSv(v,a) binary_search(v.begin(),v.end(), a)
#define BSa(v,n,a) binary_search(v,v+n, a)
using namespace std;
void base()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
bool prime[100001];
void sieve(int n)
{
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
}
double float_sq(double n)
{
double x = n;
double y = 1;
double e = 0.000001;
while (x - y > e)
{
x = (x + y) / 2;
y = n / x;
}
return x;
}
int int_sq(int x)
{
if (x == 0 || x == 1)
return x;
int start = 1, end = x, ans;
while (start <= end)
{
int mid = (start + end) / 2;
if (mid*mid == x)
return mid;
if (mid*mid < x)
{
start = mid + 1;
ans = mid;
}
else
end = mid-1;
}
return ans;
}
int nxt()
{
int x;
cin >> x;
return x;
}
bool ispalindrome(string str)
{
vector<char> List;
for (int i = 0; i < str.length(); i++)
{
auto pos = find(List.begin(), List.end(), str[i]);
if (pos != List.end())
{
auto posi = find(List.begin(), List.end(),str[i]);
List.erase(posi);
}
else
List.push_back(str[i]);
}
if (str.length() % 2 == 0 && List.empty()|| (str.length() % 2 == 1 && List.size() == 1))
return true;
else
return false;
}
void printArray(vector<int> arr, int n,vector<string>v)
{
string s;
for(int i=0; i<arr.size(); i++)
s+=v[arr[i]];
}
void printSubsequences(vector<int> arr, int index,
vector<int> subarr,vector<string>v)
{
if (index == arr.size())
{
int l = subarr.size();
if (l != 0)
printArray(subarr, l,v);
}
else
{
printSubsequences(arr, index + 1, subarr,v);
subarr.push_back(arr[index]);
printSubsequences(arr, index + 1, subarr,v);
}
return;
}
bool palindrome(string s)
{
string test=s;
reverse(all(test));
return s== test;
}
int fast_power(int x, int y, int m)
{
if (y == 0)
return 1;
int temp = fast_power(x, y / 2, m);
temp = (temp*temp) % m;
if (y % 2 != 0)
temp = (temp*x) % m;
return temp;
}
int inv(int x, int m)
{
return fast_power(x, m - 2, m);
}
bool comp(const pair<int,int>&a,
const pair<int,int>&b)
{
if(a.first==b.first)
return a.first<b.first;
return a.first>b.first;
}
int32_t main()
{
base();
string s;
cin>>s;
int idx1=-1,idx2=-1;
for(int i=0;i<s.size();i++)if(s[i]==s[i+1]) {idx1=i+1;idx2=i+2;}
for(int i=0;i<s.size();i++)if(s[i]==s[i+2]) {idx1=i+1;idx2=i+3;}
cout<<idx1<<" "<<idx2;
return 0;
}
| 0
| 43,470,654
|
#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; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
map<ll,int> A;
REP(i,N){
int a; cin >> a;
A[a]++;
}
ll max1 = 0;
ll max2 = 0;
for(auto a: A){
if(a.second>=2 && a.second<4){
max2 = max1;
max1 = a.first;
}else if(a.second>=4){
max1 = a.first;
max2 = a.first;
}
}
cout << max1*max2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a,long long int b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{
long long int x,i,y,ans=0;
scanf("%lld%lld",&x,&y);
if(x==y ||((x>y) && (gcd(x,y)==y)))
printf("-1");
else
{
ans=(x*y)/(gcd(x,y));
printf("%lld",ans-x);
}
}
| 0
| 47,511,889
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
ll n;cin>>n;
int ans;
for(int i=1;i<=sqrt(n);i++){
ll x=n%i;
if(x==0)ans=i;
}
cout<<ans-1+n/ans-1<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int main(){
ll n, m;
cin >> n >> m;
vector<vector<ll>> score(8, vector<ll>(n));
rep(i, n){
ll x, y, z;
cin >> x >> y >> z;
rep(j, 8){
ll v = 0;
if(j & 1)v += x;
else v -= x;
if(j & 2)v += y;
else v -= y;
if(j & 4)v += z;
else v -= z;
score[j][i] = v;
}
}
ll ans = 0;
rep(i, 8){
sort(ALL(score[i]), greater<ll>());
ll res = 0;
rep(j, m)res += score[i][j];
ans = max(ans, res);
}
cout << ans << endl;
}
| 0
| 25,150,509
|
#include<bits/stdc++.h>
using namespace std;
int used[300000];
int main(){
int N;
cin >> N;
int A[(1<<N)+1];
for(int i=0; i<(1<<N); i++){
cin >> A[i];
}
A[1<<N] = -1;
long long data[1<<N][2];
data[0][0] = 0; data[0][1] = -1;
for(int i=1; i<(1<<N); i++){
vector<int> arr;
arr.push_back(i);
for(int j=0; j<N; j++){
if(i & (1<<j)){
int bit = i &~(1<<j);
if(used[data[bit][0]] == 0){
used[data[bit][0]] = 1;
arr.push_back(data[bit][0]);
}
if(data[bit][1] != -1){
if(used[data[bit][1]] == 0){
arr.push_back(data[bit][1]);
used[data[bit][1]] = 1;
}
}
}
}
int ma = (1<<N), ma2 = (1<<N);
for(int j=0; j<arr.size(); j++){
if(A[ma] < A[arr[j]]) ma = arr[j];
}
for(int j=0; j<arr.size(); j++){
if(arr[j] != ma){
if(A[ma2] < A[arr[j]]) ma2 = arr[j];
}
}
data[i][0] = ma, data[i][1] = ma2;
for(int j=0; j<arr.size(); j++){
used[arr[j]] = 0;
}
}
int ans[1<<N];
ans[0] = 0;
for(int i=1; i<(1<<N); i++){
ans[i] = max(ans[i-1], A[data[i][0]] + A[data[i][1]]);
cout << ans[i] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int h,w;cin>>h>>w;
vector<string> m(h);
for(int i=0;i<h;++i){
cin>>m[i];
}
vector<bool> hi(h,false);
vector<bool> wi(w,false);
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if(m[i][j]=='#'){
hi[i]=true;
wi[j]=true;
}
}
}
for(int i=0;i<h;++i){
if(hi[i]){
for(int j=0;j<w;++j){
if(wi[j]){
cout<<m[i][j];
}
}
cout<<endl;
}
}
return 0;
}
| 0
| 88,763,332
|
#include <bits/stdc++.h>
using namespace std;
inline void rd(int &x) {
char ch; for(;!isdigit(ch=getchar()););
for(x=ch-'0';isdigit(ch=getchar());)x=x*10+ch-'0';
}
typedef long long LL;
const int MAXN = 300005;
int n, cnt[MAXN];
LL sum[MAXN];
int ans[MAXN];
inline bool chk(int k, int x) { return sum[x] >= 1ll*k*x; }
int main() {
rd(n);
for(int i = 1, x; i <= n; ++i) rd(x), ++cnt[x], ++sum[cnt[x]];
for(int i = 1; i <= n; ++i) sum[i] += sum[i-1];
int now = 0;
for(int k = n; k >= 1; --k) {
while(now < n && chk(k, now+1)) ++now;
ans[k] = now;
}
for(int i = 1; i <= n; ++i) printf("%d\n", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
const ll MOD=1000000007LL;
ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { return MUL(x, POW(y, MOD-2)); }
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == 0) {
v.clear();
return 0;
}
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
return i;
}
void read_cr() {
fgets(_buf, 256, stdin);
}
void solve(int N) {
int d = (int)sqrt(N*2), e = d+1;
if (d * e != N*2) {
printf("No\n");
return;
}
vvi pat(e);
int ix = 0;
repC2(i,j,e){
++ix;
pat[i].pb(ix);
pat[j].pb(ix);
}
printf("Yes\n");
printf("%d\n", e);
rep(i,e){
printf("%d", (int)pat[i].size());
sort(ALL(pat[i]));
for (int si:pat[i]) printf(" %d", si);
printf("\n");
}
}
int main() {
int N; cin >> N;
solve(N);
return 0;
}
| 0
| 80,761,377
|
#include <stdio.h>
int x,y,c,t;
int main(){
scanf("%d%d", &x,&y); for(t=0; t<=x; t++){
c=x-t;
if(4*t+2*c==y){
printf("Yes\n");
return 0;
}
}
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i< (n);i++)
using namespace std;
int main() {
int s;
cin>>s;
int d[1000010];
d[0]=s;
rep(i,1000000){
if(d[i]%2==0)d[i+1]=d[i]/2;
else{ d[i+1]=d[i]*3+1;}
}
bool ok=false;
for(int i=1;i<1000000;i++){
for(int j=i-1;j>=0;j--){
if(d[i]==d[j]){
cout<<i+1<<endl;
ok=true;
break;
}
if(ok)break;
}
}
}
| 0
| 32,805,378
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.