code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#include <stdio.h>
#include <cmath>
#include <tgmath.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
typedef long long ll;
const ll inf = 1e18+7;
const ll mod = 1e9+7;
int main() {
int n,ans=0;
cin>>n;
vector<int>a(n);
rep(i,n)cin>>a[i];
rep(i,n-1){
if(a[i]==a[i+1]){
a[i+1]=200;
ans++;
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
ll mod=1e9+7;
bool dx[2][18000],dy[2][18000];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string ss;cin>>ss;
int a,b;cin>>a>>b;
vector<int> d;
int p=0;
rep(i,ss.size()){
if(ss[i]=='T'){
d.push_back(i-p);
p=i+1;
}
if(i==ss.size()-1&&ss[i]!='T')d.push_back(ss.size()-p);
}
int g=8000;
rep(i,2)rep(j,18000)dx[i][j]=dy[i][j]=0;
dx[0][g]=1;
dy[0][g]=1;
for(int i=0;i<d.size();i+=2)rep(j,18000){
int k=i/2;
if(dx[k&1][j]){
if(j+d[i]<18000)dx[(k+1)&1][j+d[i]]=1;
if(i>0)if(j-d[i]>0)dx[(k+1)&1][j-d[i]]=1;
dx[k&1][j]=0;
}
}
for(int i=1;i<d.size();i+=2)rep(j,18000){
int k=i/2;
if(dy[k&1][j]){
if(j+d[i]<18000)dy[(k+1)&1][j+d[i]]=1;
if(j-d[i]>0)dy[(k+1)&1][j-d[i]]=1;
dy[k&1][j]=0;
}
}
if((dx[0][a+g]||dx[1][a+g])&&(dy[0][b+g]==1||dy[1][b+g]==1))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| 0
| 78,752,649
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
bool ff = true;
string s, p;
cin >> s >> p;
int ls = s.size(), lp = p.size();
for (int i = 0; i < ls; i++) {
bool flag = true;
for (int j = 0; j < lp; j++) {
if (s[(i + j) % ls] != p[j]) {
flag = false;
break;
}
}
if (flag) {
ff = false;
cout << "Yes" << endl;
break;
}
}
if (ff) {
cout << "No" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<cstdio>
using namespace std;
#define MOD 1000000007
#define FormulaToConvertMicrosecondsToSeconds(duration) duration / 1e+6
#define _CRT_SECURE_NO_DEPRECATE
#define ll long long
#define nl '\n'
#define upperString(str) transform(str.begin(), str.end(), str.begin(), ::toupper);
#define lowerString(str) transform(str.begin(), str.end(), str.begin(), ::tolower);
#define ps(x,y) fixed << setprecision(y) << x
#define eb emplace_back
#define sortv(v) sort(v.begin(), v.end());
#define rsortv(v) sort(v.rbegin(), v.rend());
#define rev(v) reverse(v.begin(), v.end())
#define si set<int>
#define mii std::map <int,int>
#define multimii std::multimap <int,int>
#define mss map <string, string>
#define w(t) unsigned t; cin >> t; while(t--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve();
bool isPrime(int num) {
if (num == 1) return false;
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) return false;
}
return true;
}
ll binarySearch(int a[], int l, int r, int x)
{
while (l <= r)
{
int mid_index = l + (r - l) / 2;
if (a[mid_index] == x)
return mid_index;
else if ( x > a[mid_index])
{
l = mid_index + 1;
}
else if ( x < a[mid_index])
{
r = mid_index - 1;
}
}
return -1;
}
ll fast_power(ll base, ll power) {
ll result = 1;
while (power > 0) {
if (power & 1) {
result = (result * base) % MOD;
}
base = (base * base) % MOD;
power >>= 1;
}
return result;
}
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
auto t1 = std::chrono::high_resolution_clock::now();
solve();
auto t2 = std::chrono::high_resolution_clock::now();
auto duration = std::chrono::duration_cast<std::chrono::microseconds>( t2 - t1 ).count();
cerr << "\n\nTime taken : " << FormulaToConvertMicrosecondsToSeconds(duration) << " secs" << nl;
return 0;
}
void solve()
{
unsigned ll n, s; cin >> n >> s;
if (s >= n) {
cout << 0; return;
}
else if (s == 0)
{
unsigned ll ans = 0;
while (n--)
{
unsigned ll e; cin >> e;
ans += e;
}
cout << ans;
}
else
{
vector<unsigned ll>v(n);
unsigned ll ans = 0;
for (ll i = 0; i < n; ++i)
{
cin >> v[i];
}
sortv(v);
unsigned ll sum = 0;
for (int i = 0; i < n - s; ++i)
{
sum += v[i];
}
cout << sum;
}
}
| 0
| 35,901,626
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100000;
int n,m,v,p,a[N+9];
void into(){
scanf("%d%d%d%d",&n,&m,&v,&p);
for (int i=1;i<=n;++i)
scanf("%d",&a[i]);
}
LL sum[N+9];
int ans;
void Get_ans(){
sort(a+1,a+n+1,greater<int>());
for (int i=1;i<=n;++i){
sum[i]=sum[i-1]+a[i];
if (i<=p) {ans=i;continue;}
LL t=max(v-p-n+i,0),now=(LL)(a[i]+m)*(i-p)-sum[i-1]+sum[p-1];
if (a[p]<=a[i]+m&&t*m<=now) ans=i;
else break;
}
}
void work(){
Get_ans();
}
void outo(){
printf("%d\n",ans);
}
int main(){
into();
work();
outo();
return 0;
}
|
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int a,b,c,d;
cin>>a>>b>>c>>d;
long s=(long)b*d,t=(long)a*c;
if(s<t){
s=t;
}
t=(long)a*d;
if(s<t){
s=t;
}
t=(long)b*c;
if(s<t){
s=t;
}
cout<<s<<endl;
return 0;
}
| 0
| 29,829,217
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << "\n";
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n, a;
cin >> n >> a;
print(a >= n % 500 ? "Yes" : "No");
}
|
#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 pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3],n;
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
typedef pair<int,int> P;
int gcd(int a,int b){
if (a%b == 0){
return b;
}
else{
return gcd(b,a%b);
}
}
int lcm(int a,int b){
return a /gcd(a,b) * b;
}
int main() {
long long K, A, B; cin >> K >> A >> B;
if (B-A <= 2 || K < A-1) cout << K+1 << endl;
else {
long long res = A;
K -= A-1;
if (K % 2 == 1) ++res, --K;
res += (B-A) * (K/2);
cout << res << endl;
}
}
| 0
| 8,901,996
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void ans(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
const ll INF=1001001001;
const ll mod=10000000007;
int main(){
ll x,y;cin>>x>>y;
ll z=y/x;
ll ans=0;
while(z>=1){
ans++;
z/=2;
}
cout<<ans<<endl;
}
|
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 1000000007;
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<ll, ll> > res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back(make_pair(a,ex));
}
if (N != 1) res.push_back(make_pair(N,1));
return res;
}
int main(){
ll n;
cin >> n;
const auto &res=prime_factorize(n);
ll ans=0;
for(auto p: res){
ll tmp=1,cnt=1;
while(tmp<=p.second){
cnt++;
tmp+=cnt;
}
cnt--;
ans+=cnt;
}
cout << ans << endl;
}
| 0
| 67,405,792
|
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int leftCount = 0;
int rightCount = 0;
int count = 0;
for(int i = 0; i < n; ++i) {
if(count == 0 && s[i] == ')')
leftCount++;
else if(s[i] == '(') {
count++;
}
else if(s[i] == ')') {
count--;
}
}
rightCount = count;
for(int i = 0; i < leftCount; ++i)
cout << "(";
cout << s;
for(int i = 0; i < rightCount; ++i)
cout << ")";
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n;
ll A[N];
ll minv;
ll ans;
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)
cin>>A[i];
for(int i=1;i<=n;i++)
{
if(i==1)
minv=A[i];
else
{
if(minv>=A[i])
ans+=minv-A[i];
else
minv=A[i];
}
}
cout<<ans<<endl;
}
| 0
| 13,748,946
|
#include<iostream>
int n,a,b;
int main(){
std::cin>>n>>a>>b;
std::cout<<((b-a)%2?"Borys":"Alice");
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= int(a); i--)
#define WRAP(y, x, h, w) (0 <= y && y < h && 0 <= x && x < w)
#define ALL(x) (x).begin(), (x).end()
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
ll powmod(ll n, ll x)
{
vector<ll> vll(32);
vll[0] = n;
FOR(i, 1, 32)
{
vll[i] = (vll[i - 1] * vll[i - 1]) % MOD;
}
ll ret = 1;
int cnt = 0;
while (x > 0) {
if (x & 1) {
ret = (ret * vll[cnt]) % MOD;
}
x >>= 1;
cnt++;
}
return ret;
}
int main()
{
ll n, k;
cin >> n >> k;
ll ans = 0;
vector<ll> numgcd(k + 1);
for (int i = k; i >= 1; i--) {
numgcd[i] = powmod(k / i, n);
for (int j = i * 2; j <= k; j += i) {
numgcd[i] -= numgcd[j];
numgcd[i] = (numgcd[i] + MOD) % MOD;
}
ll add = (numgcd[i] * i) % MOD;
ans = (ans + add) % MOD;
}
cout << ans << endl;
}
| 0
| 57,034,116
|
#include <iostream>
using namespace std;
int main()
{
int X;
cin >> X;
int ans = 0;
int ang = 0;
for (;;) {
ang = (ang + X) % 360;
ans++;
if (ang == 0) break;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat;
typedef vector<vector<bool> > matb;
typedef vector<string> vst;
typedef pair<lli,lli> pll;
typedef pair<double,double> pdd;
lli n;
string x;
string y;
mat dp;
int main(){
cin >> n;
for(lli i = 0;i < n;i++){
cin >> x >> y;
dp = mat(x.size()+2,vll(y.size()+2));
for(lli i = 0;i <= x.size();i++){
for(lli j = 0;j <= y.size();j++){
dp[i+1][j] = max(dp[i+1][j],dp[i][j]);
dp[i][j+1] = max(dp[i][j+1],dp[i][j]);
if(x[i] == y[j]) dp[i+1][j+1] = max(dp[i+1][j+1],dp[i][j]+1);
}
}
cout << dp[x.size()][y.size()] << endl;
}
return 0;
}
| 0
| 31,341,843
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
ll rep_pow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_pow(a, b/2);
return memo*memo%mod;
}else{
return rep_pow(a, b-1)*a%mod;
}
}
ll nCr(ll n, ll r){
ll ret=1;
rep(i,r){
ret *= n-i;
ret %= mod;
ret *=rep_pow(r-i, mod-2);
ret %= mod;
}
return ret;
}
ll gcd(ll a, ll b){ if(b==0) return a; return gcd(b, a%b);}
int counter(int x){
if(x==0) return 0;
return counter(x>>1)+(x&1);
}
int main(){
fast_io
int n,k;
cin>>n>>k;
int ans=n-k+1;
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
string N;
int A, B;
cin >> N >> A >> B;
int rec = 0;
int ans = 0;
for (int i = 1; i <= atoi(N.c_str()); i++) {
for (int j = 0; j < to_string(i).length(); j++) {
rec += to_string(i)[j] - '0';
}
if (rec >= A && rec <= B) {
ans += i;
}
rec = 0;
}
cout << ans << endl;
return 0;
}
| 0
| 10,408,769
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int num;
vector <int> n(4);
vector <char>s(3);
cin >> num;
n[3] = num / 1000; num = num % 1000;
n[2] = num / 100; num = num % 100;
n[1] = num / 10; num = num % 10;
n[0] = num;
int sum = 0;
for(int i = 0; i < 8; ++i){
sum = n[3];
for(int j = 0; j < 3; ++j){
if((i >> j) & 1){
sum += n[2 - j];
s[2-j] = '+';
}else{
sum -= n[2 - j];
s[2-j] = '-';
}
}
if(sum == 7){
cout << n[3] << s[2] << n[2] << s[1] << n[1] << s[0] << n[0] << "=7" <<endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> sa(n);
copy(a.begin(), a.end(), sa.begin());
sort(sa.begin(), sa.end(), greater<int>());
for (int i = 0; i < n; i++) {
if (a.at(i) == sa.at(0)) {
cout << sa.at(1) << endl;
}
else {
cout << sa.at(0) << endl;
}
}
return 0;
}
| 0
| 67,543,312
|
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
ll gcd(ll a, ll b) {
if (b == 0) { return a; }
if (a < b) { return gcd(b, a); }
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) *b;
}
struct edge {
ll ind;
ll fr;
ll to;
ll d;
};
int main() {
ll N, K;
string S;
cin >> N >> S >> K;
char c = S[K - 1];
rep(i, N) {
if (S[i] != c) { S[i] = '*'; }
}
cout << S;
system("PAUSE");
}
|
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n;
scanf("%d",&n);
list<int> lst;
for(int i=0;i<n;i++){
char c[11];
int p;
scanf("%s",&c);
string s=c;
if(s=="deleteFirst"){
lst.pop_front();
}else if(s=="deleteLast"){
lst.pop_back();
}else if(s=="insert"){
scanf("%d",&p);
lst.push_front(p);
}else{
scanf("%d",&p);
for(auto itr=lst.begin(); itr!=lst.end();itr++){
if(*itr==p){
lst.erase(itr);
break;
}
}
}
}
int l=lst.size();
for(int i=0;i<l-1;i++){
printf("%d ",*lst.begin());
lst.pop_front();
}
printf("%d\n",*lst.begin());
return 0;
}
| 0
| 98,725,070
|
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n, ans = 0;
cin >> n;
int l, r;
for(int i = 0; i < n; i++)
{
cin >> l >> r;
ans += r - l + 1;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
sort(S.begin(), S.end());
map<char, int> letters;
for (int i = 0; i < 4; i++) {
letters[S[i]] += 1;
}
for (const auto& letter : letters) {
if (letter.second > 2 || letter.second < 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| 0
| 82,861,991
|
#include<iostream>
using namespace std;
int main(void){
int a,b,c,d = 0;
cin >> a >> b >> c >> d;
bool yn = 0;
if(abs(a-c) <= d){
yn = 1;
}else if(abs(a-b)<= d && abs(b-c) <= d){
yn = 1;
}
if(yn){
cout << "Yes";
}else{
cout << "No";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vpl vector<pair<long long,long long>>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using pll = pair<long long,long long>;
#define cY cout<<"Yes"<<endl
#define cN cout<<"No"<<endl
const long long INF = 1LL << 60;
long long MOD = 1000000007;
const long double pi = 3.1415926535897932;
#define pb push_back
#define mp make_pair
#define mt make_tuple
using Grid = vector<vector<char>>;
#define vc vector<char>
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
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;
}
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
ll nCr(ll n, ll r) {
ll ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans*i;
}
for (ll i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
map< ll, ll > prime_factor(ll n) {
map< ll, ll > ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
int main(){
ll H,W,A,B;
cin>>H>>W>>A>>B;
rep(i,B){
rep(j,A){
cout<<1;
}
rep(j,W-A){
cout<<0;
}
cout<<endl;
}
rep(i,H-B){
rep(j,A){
cout<<0;
}
rep(j,W-A){
cout<<1;
}
cout<<endl;
}
}
| 0
| 24,226,227
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
cout<<360/__gcd(360,n)<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sfl(i,a,n) for (int i=a;i<n;i++)
#define ufl(i,a,n) for (int i=n-1;i>=a;i--)
#define SZ(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
ll power(ll a, ll b){
ll res = 1;
for(int i = 0; i<b; i++)
res *= a;
return res;
}
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
int main()
{
init();
int x,y;
cin >>x>>y;
cout <<(x-1)*(y-1);
}
| 0
| 79,526,120
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
ll n, l, t;
cin >> n >> l >> t;
vector<ll> x(n), y(n), w(n);
ll k = 0;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> w[i];
if (w[0] != w[i]) {
if (w[0] == 1 && 2 * t >= x[i] - x[0]) {
k += (2 * t - x[i] + x[0]) / (l) + 1;
} else if (w[0] == 2 && 2 * t >= x[0] - x[i] + l) {
k -= (2 * t - x[0] + x[i] - l) / (l) + 1;
}
}
if (w[i] == 1)
y[i] = (x[i] + t) % l;
else
y[i] = ((x[i] - t) % l + l) % l;
}
k = ((k % n) + n) % n;
ll y0 = y[0];
sort(y.begin(), y.end());
int m = lower_bound(y.begin(), y.end(), y0) - y.begin();
if (w[0] == 1 && m < n - 1 && y[m + 1] == y0)
++m;
for (int i = 0; i < n; ++i) {
x[(k + i) % n] = y[(m + i) % n];
}
for (int i = 0; i < n; ++i) {
cout << x[i] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define tt int t; cin>>t; while(t--)
#define lo(i,a,b) for(int i=a;i<b;i++)
#define rlo(i,n) for(int i=n-1;i>=0;i--)
#define be(a) (a).begin(),(a).end()
#define rbe(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a,b,sizeof(a))
#define pr(a) {for(auto x:a)cout<<x<<" ";cout<<nl;}
#define su ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define frac cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
void f()
{
ll n,m,x,y;
cin>>n>>m>>x>>y;
ll a[n+2],b[m+2];
a[0]=x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
b[0]=y;
for(int i=1;i<=m;i++)
{
cin>>b[i];
}
sort(a,a+n+1);
sort(b,b+m+1);
if(a[n]<b[0])
cout<<"No War\n";
else
cout<<"War\n";
}
int main()
{
su;
f();
return 0;
}
| 0
| 89,777,053
|
#include <bits/stdc++.h>
#define Rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef int64_t intl;
int main(){
int N,K;
cin >> N>>K;
if ( N%K ==0){cout << 0;}
else {cout <<1;}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
ll ans = 0;
ll mn = min({8*q, 4*h, 2*s, d});
if(mn == 8*q){
cout << n * q * 4 << endl;
}else if(mn == 4 * h){
cout << n * h * 2 << endl;
}else if(mn == 2 * s){
cout << n * s << endl;
}else{
ll ans = n / 2 * d;
if(n % 2 == 1){
ll mn = min({4*q, 2*h, s});
ans += mn;
}
cout << ans << endl;
}
}
| 0
| 19,171,874
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,K;
cin >> A >> B >> C >> K;
if(A>K){
cout << K <<endl;
return 0;
}
else if(K>=A && B>K-A){
cout << A <<endl;
return 0;
}
else if(K>=A+B && C>K-A-B){
cout << A-(K-A-B) << endl;
return 0;
}
else{
cout << A-C << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#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; }
const long long INF = 1LL << 60;
#define PI 3.14159265359
bool dp[100100];
int main () {
int N; string S;
cin >> N >> S;
long long r =0, g =0, b = 0;
for(auto c : S){
if(c == 'R') ++r;
else if(c == 'G') ++g;
else ++b;
}
long long all = r*g*b;
long long sub =0;
for(int i = 0; i<N; ++i){
for(int j =i+1; j<N; ++j){
if(S[i]== S[j])continue;
int k =j*2-i;
if(k>=N || S[k] == S[i]|| S[k]== S[j])continue;
++sub;
}
}
cout << all-sub << endl;
}
| 0
| 32,070,508
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
typedef long long ll;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
bool check(string s, vector<char> &res, char c1, char c2) {
res[0] = c1, res[1] = c2;
int n = s.size();
for(int i = 1; i < s.size() - 1; i++) {
if(s[i] == 'o' && res[i] == 'S')
res[i + 1] = res[i - 1];
else if(s[i] == 'o' && res[i] == 'W')
res[i + 1] = (res[i - 1] == 'W' ? 'S' : 'W');
else if(s[i] == 'x' && res[i] == 'S')
res[i + 1] = (res[i - 1] == 'W' ? 'S' : 'W');
else if(s[i] == 'x' && res[i] == 'W')
res[i + 1] = res[i - 1];
}
bool ret = false;
if((res[0] == 'W' && s[0] == 'o') || (res[0] == 'S' && s[0] == 'x')) {
ret = !(res[1] == res[s.size() - 1]);
if((res[n - 1] == 'W' && s[n - 1] == 'o') ||
(res[n - 1] == 'S' && s[n - 1] == 'x')) {
ret &= !(res[0] == res[n - 2]);
} else {
ret &= (res[0] == res[n - 2]);
}
return ret;
} else {
ret = (res[1] == res[s.size() - 1]);
if((res[n - 1] == 'W' && s[n - 1] == 'o') ||
(res[n - 1] == 'S' && s[n - 1] == 'x')) {
ret &= !(res[0] == res[n - 2]);
} else {
ret &= (res[0] == res[n - 2]);
}
return ret;
}
}
int main() {
int N;
string s;
cin >> N;
cin >> s;
vector<char> res(N);
if(check(s, res, 'S', 'S')) {
rep(i, N) cout << res[i];
cout << endl;
return 0;
}
if(check(s, res, 'S', 'W')) {
rep(i, N) cout << res[i];
cout << endl;
return 0;
}
if(check(s, res, 'W', 'S')) {
rep(i, N) cout << res[i];
cout << endl;
return 0;
}
if(check(s, res, 'W', 'W')) {
rep(i, N) cout << res[i];
cout << endl;
return 0;
}
cout << -1 << endl;
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i < n+1; i++){
char* num = (char*)calloc(10, sizeof(char));
snprintf(num, 10,"%d", i);
int sum = 0;
while(*num != '\0'){
sum += *num - 48;
num++;
}
if(sum >= a && sum <= b) {
ans += i;
}
}
cout << ans << endl;
}
| 0
| 24,966,145
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
sort(a.begin(),a.end());
int sa = a.at(n/2)- a.at(n/2 -1);
cout<< sa <<endl;
}
|
#include <stdio.h>
#include <string.h>
int main(){
int i, len;
char str[2048];
fgets(str, sizeof(str), stdin);
len = strlen(str);
for (i = 0; i < len ; i++) {
if (str[i] >= 'a' && str[i] <= 'z') {
str[i] = str[i] - 0x20;
} else if (str[i] >= 'A' && str[i] <= 'Z') {
str[i] = str[i] + 0x20;
} else {
}
}
printf("%s", str);
return 0;
}
| 0
| 53,836,853
|
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
using namespace std;
const int INF (1 << 30);
const ll LLINF (1LL << 55LL);
const int MOD = 1000000007;
const int MAX = 510000;
const double pi = acos(-1);
const double eps = 1e-9;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n,p[100010],a[100010],b[100010];
ll A,B;
cin>>n;
rep(i,n){
cin>>p[i];
p[i]--;
}
a[p[0]]=1,b[p[0]]=1;
rep2(i,1,n){
a[p[i]]=20000*(p[i]-p[i-1])+a[p[i-1]];
b[p[i]]=i+2-a[p[i]];
}
if(a[0]<=0){
A=1-a[0];
rep(i,n){
a[i]+=A;
}
}
if(b[n-1]<=0){
B=1-b[n-1];
rep(i,n){
b[i]+=B;
}
}
rep(i,n){
cout<<a[i]<<" ";
}
cout<<endl;
rep(i,n){
cout<<b[i]<<" ";
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define all(x) (x).begin(),(x).end()
ll t1,t2,t3;
const ll mod = 1000000007;
const int INF = 1e9;
const ll INFLONG = 1e18;
int main(){
ll n,k;
cin >> n >> k;
vector<ll> vec(k+1,0);
ll ans = 0;
for(ll i = k;i>0;i--){
ll mul = k / i;
ll t1 = n;
ll req = 1;
while(t1 != 0){
if(t1 & 1){
req *= mul;
req %= mod;
}
mul *= mul;
mul %= mod;
t1 = t1 >> 1;
}
t3 = req;
ll ward = i * 2;
while(ward <= k){
t3 -= vec[ward];
if(t3 < 0){
t3 += mod;
}
ward += i;
}
vec[i] = t3;
ans += t3 * i;
ans %= mod;
}
cout << ans << endl;
}
| 0
| 13,813,661
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n; cin >> n;
ll ans = 0;
for(ll i = 2; i * i <= n; ++i){
ll cnt = 0;
ll kanta = 1;
while(n % i == 0){
n = n / i;
cnt++;
if(cnt >= kanta){
cnt = 0;
kanta++;
ans++;
}
}
}
if(n != 1)ans++;
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int a[200005];
char s[200005];
int main()
{
int n;
scanf("%d",&n);
scanf("%s",s+1);
int t=0;
if(s[1]=='W'||s[2*n]=='W')
{
printf("0\n");
return 0;
}
for(int i=1;i<=2*n;i++)
{
if(s[i]=='B')
{
if(t%2==0)
{
a[i]=1;
t++;
}
else
{
a[i]=0;
t--;
}
}
else if(s[i]=='W')
{
if(t%2==0)
{
a[i]=0;
t--;
}
else a[i]=1,t++;
}
}
if(t!=0)
{
printf("0\n");
return 0;
}
t=0;
ll ans=1;
for(int i=1;i<=2*n;i++)
{
if(a[i]==1)
{
t++;
}
else
{
ans=(ans*t)%mod;
t--;
}
}
if(t!=0)
{
printf("0\n");
return 0;
}
for(int i=1;i<=n;i++)
{
ans=ans*i%mod;
}
printf("%lld\n",ans);
}
| 0
| 100,429,108
|
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll=long long;
using ld=long double;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
#include <iostream>
#include <vector>
#include <map>
using namespace std;
namespace dbg {
using ll = long long;
class Debug {
public:
Debug(){}
template<typename T>
void vd(vector<T> vec);
template<typename T>
void vd2(vector<vector<T>> vec);
template<typename T>
void ad(T *arr, ll n);
template<typename T, size_t N>
void ad2(T (&arr)[N], ll n);
template<typename T>
void md(T mp);
};
template<typename T>
void Debug::vd(vector<T> vec) {
for (auto vv : vec) cout << vv << " ";
cout << endl;
}
template<typename T>
void Debug::vd2(vector<vector<T>> vec) {
for (auto vv : vec) for (auto vvv : vv) cout << vvv << " ";
cout << endl;
}
template<typename T>
void Debug::ad(T *arr, ll n) {
for (int i = 0; i <= n; i++) cout << arr[i] << " ";
cout << endl;
}
template<typename T, size_t N>
void Debug::ad2(T (&arr)[N], ll n) {
for (int i = 0; i <= N; i++) for (int j = 0; j <= n; j++) cout << arr[i][j] << " ";
cout << endl;
}
template<typename T>
void Debug::md(T mp) {
cout << "key : value" << endl;
for (auto const &m : mp) cout << m.first << " : " << m.second << endl;
cout << endl;
}
}
#endif
using dbg::Debug;
Debug debug;
class A01Matrix {
public:
void solve(std::istream& in, std::ostream& out) {
ll h, w, a, b;
in >> h >> w >> a >> b;
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
if(j<a && i<b) out << 1;
else if(j>=a && i>=b) out << 1;
else out << 0;
}
out << endl;
}
}
};
int main() {
A01Matrix solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
#include <stack>
#include <random>
typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;
#define rip(i, n, s) for (int i = (s);i < (int)( n ); i++)
#define all(a) a.begin(), a.end()
#define MM << " " <<
template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<typename T>
void vdeb(std::vector<T> &da) {
for (int i = 0;i < da.size();i++) {
if (i == da.size() - 1) std::cout << da[i];
else std::cout << da[i] << ' ';
}
std::cout << std::endl;
}
template<typename T>
void vdeb(std::vector<std::vector<T>> &da) {
for (int i = 0;i < da.size();i++) {
std::cout << i << ' ';
vdeb(da[i]);
}
std::cout << std::endl;
}
using namespace std;
int n;
int check(vector<int> &da, int now) {
deque<Pii> dq;
stack<Pii> st;
dq.push_front({0, 0});
rip(i,n,0) {
if(dq.back().first < da[i]) {
dq.push_back({da[i], 1});
}
else {
while(dq.back().first > da[i]) dq.pop_back();
int look = da[i];
while(dq.back() == make_pair(look, now)) {
dq.pop_back(); --look;
}
if(dq.back().first == look) {
auto tmp = dq.back(); dq.pop_back();
++tmp.second;
dq.push_back(tmp);
}
else {
dq.push_back({look, 2});
}
if(dq.back().first != da[i]) dq.push_back({da[i], 1});
}
if(dq.front().second == 1) return false;
}
return true;
}
int main(){
cin >> n;
vector<int> da(n);
rip(i,n,0) cin >> da[i];
bool ju = true;
rip(i,n,1) if(da[i] <= da[i-1]) ju = false;
if(ju) {
cout << 1 << endl;
return 0;
}
int ng = 1, ok = 300000;
while(ok-ng > 1) {
int now = (ok+ng) >> 1;
if(check(da, now)) ok = now;
else ng = now;
}
cout << ok << endl;
}
| 0
| 35,987,643
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
for (int i = 0; i < s.length(); i++) s[i] = 9 - (s[i] - '1') + '0';
cout << s << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <cstdlib>
#include <math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
#define MOD 1000000007
int N;
long long h[100010];
long long dp[100010];
int main(){
int N; cin >> N;
for(int i = 0; i < 100010; ++i) dp[i] = INF;
dp[0] = 0;
for(int i = 0; i < N; i++){
chmin(dp[i+1], dp[i] + 1);
int n6 = 1;
int n6_num = pow(6, n6);
while((i + n6_num) <= N){
chmin(dp[i+n6_num], dp[i]+1);
n6+=1;
n6_num = pow(6, n6);
}
int n9 = 1;
int n9_num = pow(9, n9);
while((i + n9_num) <= N){
chmin(dp[i+n9_num], dp[i]+1);
n9+=1;
n9_num = pow(9, n9);
}
}
cout << dp[N] << endl;
}
| 0
| 34,051,659
|
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
using namespace std;
int main(){
string s;
cin >> s;
r(i,4)cout << s.at(i);
cout << " ";
for(int i=4;i<s.length();i++)cout << s.at(i);
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
string s;
cin >> s;
int a = s[0] - '0', b = s[1] - '0', c = s[2] - '0', d = s[3] - '0';
bool con = 1;
for (int i = -1; i < 2; i = i + 2)
for (int j = -1; j < 2; j = j + 2)
for (int k = -1; k < 2; k = k + 2) {
if (((a + (b * i) + (c * j) + (d * k)) == 7) && (con)) {
cout << a << ((i == 1) ? '+' : '-') << b << ((j == 1) ? '+' : '-') << c << ((k == 1) ? '+' : '-') << d << "=7" << endl;
con = 0;
}
}
}
| 0
| 37,658,888
|
#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;
ll n,T;cin>>n>>T;
vl t(n);
rep(i,n)cin>>t[i];
ll res = 0;
rep(i,n-1){
res += min(T,t[i+1]-t[i]);
}
out(res + T);
}
|
#include<bits/stdc++.h>
#define BIG 2000000001
using namespace std;
int main(){
long long int a[1000];
for(int i=0;i<1000;i++) a[i]=BIG;
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
cout<<"node "<<i<<": key = "<<a[i]<<", ";
if(i==1){
if(n>1) cout<<"left key = "<<a[i+1]<<", ";
if(n>2) cout<<"right key = "<<a[i+2]<<", ";
}
else{
cout<<"parent key = "<<a[i/2]<<", ";
if(a[2*i]!=BIG) cout<<"left key = "<<a[i*2]<<", ";
if(a[2*i+1]!=BIG) cout<<"right key = "<<a[i*2+1]<<", ";
}
cout<<endl;
}
return 0;
}
| 0
| 77,066,034
|
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define f(i,n) for(ll i=0;i<n;i++)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define nl "\n"
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define cout1(a) cout<<a<<nl
#define cout2(a,b) cout<<a<<" "<<b<<nl
#define cout3(a,b,c) cout<<a<<" "<<b<<" "<<c<<nl
#define cout4(a,b,c,d) cout<<a<<" "<<b<<" "<<c<<" "<<d<<nl
#define vcout(v,i) cout<<v[i].fi<<" "<<v[i].se<<nl
#define x first
#define y second
#define vc vector
#define pb push_back
#define ar array
#define all(a) (a).begin(), (a).end()
#define ms(v,n,x) fill(v,v+n,x);
#define init(c,a) memset(c,a,sizeof(c))
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define sll set<ll>
#define vll vector<ll>
#define vpll vector<pll>
#define maxi(a,b,c) max(a,max(b,c))
#define maxii(a,b,c,d) max(max(a,b),max(c,d))
#define mini(a,b,c) min(a,min(b,c))
#define md(a,b) ((a%mod)*(b%mod)+mod)%mod
#define inf 9e18
#define cases ll T;cin>>T;while(T--)
#define BLOCK 500
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
typedef std::complex<double> Complex;
typedef std::valarray<Complex> CArray;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int32_t main()
{
fast
cout << fixed << setprecision(12);
ll n,k;
cin>>n>>k;
map<ll,ll> m;
ll ans=0;
vll a(n+1),p(n+1);
fore(i,1,n){
cin>>a[i];
p[i]=a[i]+p[i-1];
}
f(i,n+1){
if(i>=k)
m[((p[i-k]-(i-k))%k+k)%k]--;
ans+=m[(p[i]-i+k)%k];
m[(p[i]-i+k)%k]++;
}
cout<<ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, a, b) for(int i = a, i##_len = (b); i < i##_len; ++i)
int graph[4][4];
bool visited[4];
bool all_vis(int cur) {
visited[cur] = true;
for(int i = 0; i < 4; ++i) if(graph[cur][i]) {
if(visited[i]) continue;
if(all_vis(i)) return true;
}
for(int i = 0; i < 4; ++i) if(!visited[i]) {
visited[cur] = false;
return false;
}
visited[cur] = false;
return true;
}
bool tansaku() {
for(int i = 0; i < 4; ++i) {
for(int j = 0; j < 4; ++j) visited[i] = false;
if(all_vis(i)) return true;
}
return false;
}
int main()
{
for(int i = 0; i < 3; ++i) {
int a,b;
scanf("%d %d", &a, &b);
--a, --b;
graph[a][b] = graph[b][a] = 1;
}
if(tansaku()) printf("YES\n");
else printf("NO\n");
return 0;
}
| 0
| 44,210,241
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define paf(L,R) pair<L,R>
#define mod 1000000007
#define MAX 510000
#define ALL(a) a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
int main(){
lli A,B,C,D,E,F,N,M,K,L,X,Y,Z,H,W,sum=0,num=0,flag=0;string S,T;
cin >> N;
Vec(P,string,N,"");
Vec(Q,lli,N,0);
rep(i,0,N){
cin >> P[i] >> Q[i];
}
cin >> S;
rep(i,0,N){
if(flag)sum+=Q[i];
else if(S==P[i])flag=1;
}
Out(sum);
}
|
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<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;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
ll fac[510000], finv[510000], inv[510000];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 510000; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(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;
}
ll modpow(ll n,ll m,ll MOD){
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string S,T;
cin >> S >> T;
ll s = S.size();
ll t = T.size();
if(s < t){
cout << "LESS" << endl;
return 0;
}
else if(t < s){
cout << "GREATER" << endl;
return 0;
}
else{
if(S == T)cout << "EQUAL" << endl;
else if(S < T)cout << "LESS" << endl;
else cout << "GREATER" << endl;
}
}
| 0
| 28,706,003
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
for (ll r = 0; r <= N; r++) {
for (ll g = 0; g <= N; g++) {
if (N - r * R - g * G >= 0 && (N - r * R - g * G) % B == 0) ans++;
}
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
using namespace std;
int main(void)
{
int a,b,c=0;
cin >> a;
while(a!=0){
b=1000-a;
c+=b/500;
b=b%500;
c+=b/100;
b=b%100;
c+=b/50;
b=b%50;
c+=b/10;
b=b%10;
c+=b/5;
c+=b%5;
cout << c << endl;
c=0;
cin >> a;
}
return 0;
}
| 0
| 74,807,415
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;cin >> N;
string S;cin >> S;
int height=0,min_h=0;
for(int i=0;i<N;i++){
if(S[i]=='('){
height ++;
}else{
height --;
}
min_h = min(min_h,height);
}
min_h = -min_h;
for(int i=0;i<min_h;i++){
cout << "(";
}
cout << S;
for(int i=0;i<height+min_h;i++){
cout << ")";
}
cout << endl;
}
|
#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 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
string s;
cin >> s;
string ans = "";
REP(i, s.size()){
if (s[i] == 'B') {
if (ans.size() != 0)ans.pop_back();
}
else ans += s[i];
}
cout << ans << endl;
}
| 0
| 40,261,640
|
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for (int i=0; i < (n); ++i)
using ll = long long ;
using namespace std;
const int INF = 1001001001;
int main() {
ll n,k ;
cin >> n >> k ;
vector<ll> vec(100001) ;
for(int i=0;i<n;++i){
ll a,b ;
cin >> a >> b ;
vec[a]+=b ;
}
ll sum = 0 ;
for(int i=1;i<100001;++i){
sum+=vec[i];
if(sum>=k){
cout << i << endl ;
break ;
}
}
return 0 ;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
int main() {
int w, h;
cin >> w >> h;
int p[w], q[h];
REP(i, w) cin >> p[i];
REP(i, h) cin >> q[i];
vector<P> vc;
REP(i, w) vc.push_back(make_pair(p[i], 1));
REP(i, h) vc.push_back(make_pair(q[i], 0));
sort(ALL(vc));
ll ans = 0;
int a = w + 1, b = h + 1;
REP(i, w + h) {
int cost = vc[i].first;
int type = vc[i].second;
if (type) {
ans += 1ll * cost * b;
a--;
} else {
ans += 1ll * cost * a;
b--;
}
}
cout << ans << endl;
return 0;
}
| 0
| 71,151,072
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main() {
ll s;
cin >> s;
ll x1 = 0;
ll y1 = 0;
ll x2 = 1e9;
ll y2 = 1;
ll y3 = dup(s, 1000000000);
ll x3 = x2 * y3 - s;
cout << x1 << " " << y1 << " " << x2 << " " << y2 << " " << x3 << " " << y3 << 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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const long long mod = 1000000007;
const long long inf = 1e18;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n,k;
cin>>n>>k;
vi x(n),y(n);
vi xarr,yarr;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
xarr.pb(x[i]);
yarr.pb(y[i]);
}
sort(xarr.begin(),xarr.end());
sort(yarr.begin(),yarr.end());
ll ans=1LL*(xarr[n-1]-xarr[0])*(yarr[n-1]-yarr[0]);
for(int xi=0;xi<n;xi++){
for(int xj=xi+1;xj<n;xj++){
for(int yi=0;yi<n;yi++){
for(int yj=yi+1;yj<n;yj++){
int num=0;
ll lx=xarr[xi],rx=xarr[xj];
ll by=yarr[yi],uy=yarr[yj];
for(int i=0;i<n;i++){
if(lx<=x[i] && x[i]<=rx && by<=y[i] && uy>=y[i]){
num+=1;
}
}
if(num>=k){
ans=min(ans,1LL*(rx-lx)*(uy-by));
}
}
}
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 25,750,077
|
#include <bits/stdc++.h>
int main() {
int X, A, B;
std::cin >> X >> A >> B;
if ((B - A) <= 0) {
std::cout << "delicious\n";
} else if ((B - A) > X) {
std::cout << "dangerous\n";
} else {
std::cout << "safe\n";
}
return 0;
}
|
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sqrt(n);i++)
{
if(n%i==0)
ans = i;
}
return ans;
}
ll power(ll a,ll b,ll m)
{
if(b==0)
return 1;
if(b==1)
return a%m;
ll temp=power(a,b/2,m);
if(b%2==0)
return ((temp%m)*(temp%m))%m;
else
return ((((temp%m)*(temp%m))%m)*a%m)%m;
}
ll c(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1]%MOD +
C[i - 1][j])%MOD;
}
}
return C[n][k]%MOD;
}
ll modInverse(ll a, ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll func(ll n)
{
ll ans=0;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
if(i/10==0)
ans+=1+func(i)*func(n/i);
else
ans+=func(i)*func(n/i);
}
}
return ans;
}
ll dp[2001][2001];
ll check(vector<pair<ll,ll> >v,ll l,ll r,ll i)
{
if(l>r)
return 0;
if(dp[l][r]!=-1)
return dp[l][r];
ll ans=0;
ll p1=v[i].first;
ll p2=v[i].second;
ans=max(p1*(p2-l)+check(v,l+1,r,i+1),p1*(r-p2)+check(v,l,r-1,i+1));
return dp[l][r]=ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
t=1;
while(t--)
{
ll x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
ll p[a],q[b],r[c];
for(ll i=0;i<a;i++)
cin>>p[i];
for(ll i=0;i<b;i++)
cin>>q[i];
for(ll i=0;i<c;i++)
cin>>r[i];
sort(p,p+a,greater<ll>());
sort(q,q+b,greater<ll>());
sort(r,r+c,greater<ll>());
vector<ll>v;
for(ll i=0;i<x;i++)
v.pb(p[i]);
for(ll i=0;i<y;i++)
v.pb(q[i]);
for(ll i=0;i<c;i++)
v.pb(r[i]);
sort(v.begin(),v.end(),greater<ll>());
ll sum=0;
for(ll i=0;i<x+y;i++)
sum+=v[i];
cout<<sum;
}
}
| 0
| 20,593,422
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
int N;
cin >> N;
cout << 180 * (N-2) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li n, k;
li a[5050];
inline bool check(li x) {
if (a[x] >= k) {
return true;
}
bitset<5050> bs(1);
rep(i, n) {
if (i == x) {
continue;
}
if (a[i] >= k) {
continue;
}
bitset<5050> next = bs << a[i];
bs |= next;
}
repp(i, max(0ll, k - a[x]), k) {
if (bs[i]) {
return true;
}
}
return false;
}
int main() {
cin >> n >> k;
li sum = 0;
rin{
cin >> a[i];
sum += a[i];
}
if (sum < k) {
cout << n << endl;
return 0;
}
sort(a, a + n);
li left = 0;
li right = n - 1;
if (check(0)) {
cout << 0 << endl;
return 0;
}
while (left + 1 < right) {
li med = (left + right) / 2;
if (check(med)) {
right = med;
} else {
left = med;
}
}
cout << right << endl;
return 0;
}
| 0
| 54,898,454
|
#include<stdio.h>
#define f(i,m) for(int i=1;i<=m;i++)
int main(){
f(i,9)f(j,9)printf("%dx%d=%d\n",i,j,i*j);
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define N 100003
using namespace std;
vector<int> adj[N];
int a[N];
int n;
void dfs(int u,int fa){
a[u] = 0;
int v,l = adj[u].size();
for(int i=0;i<l;++i){
v = adj[u][i];
if(v==fa) continue;
dfs(v,u);
a[u] ^= a[v]+1;
}
}
inline void read(int &x){
x = 0;
char c = getchar();
while(c<'0'||c>'9') c = getchar();
while(c>='0'&&c<='9'){
x = (x<<3)+(x<<1)+(c^48);
c = getchar();
}
}
int main(){
int u,v;
read(n);
for(int i=1;i<n;++i){
read(u),read(v);
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(1,0);
printf(a[1]?"Alice\n":"Bob\n");
return 0;
}
| 0
| 28,535,688
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
const int INF = 8101919;
const int MAX_H = 1000;
const int MAX_W = 1000;
const int MAX_N = 10;
struct pt {
int x;
int y;
};
int h;
int w;
int n;
pt cheese[MAX_N];
queue<pt> nextsearch;
pt st;
int cost[MAX_H][MAX_W];
int dx[4] = { 0,1,0,-1 };
int dy[4] = { -1,0,1,0 };
vector<string> field;
int mousehp = 1;
int bfs() {
for (int i = 0; i < MAX_N; i++) {
cheese[i].x = INF;
cheese[i].y = INF;
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cost[i][j] = INF;
if (field[i][j] == 'S') {
st.x = j;
st.y = i;
cost[i][j] = 0;
}
switch (field[i][j]) {
case '1':
cheese[1].x = j;
cheese[1].y = i;
break;
case '2':
cheese[2].x = j;
cheese[2].y = i;
break;
case '3':
cheese[3].x = j;
cheese[3].y = i;
break;
case '4':
cheese[4].x = j;
cheese[4].y = i;
break;
case '5':
cheese[5].x = j;
cheese[5].y = i;
break;
case '6':
cheese[6].x = j;
cheese[6].y = i;
break;
case '7':
cheese[7].x = j;
cheese[7].y = i;
break;
case '8':
cheese[8].x = j;
cheese[8].y = i;
break;
case '9':
cheese[9].x = j;
cheese[9].y = i;
break;
default:
break;
}
}
}
nextsearch.push(st);
int searchCheese = 1;
int allcost;
while (nextsearch.size()) {
pt queuefirst = nextsearch.front();
nextsearch.pop();
if (queuefirst.x == cheese[searchCheese].x && queuefirst.y == cheese[searchCheese].y && field[queuefirst.y][queuefirst.x] - '0' <= mousehp) {
searchCheese++;
mousehp++;
field[queuefirst.y][queuefirst.x] = '.';
if (searchCheese > n) {
allcost = cost[queuefirst.y][queuefirst.x];
break;
}
queue<pt> empty;
swap(nextsearch,empty);
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (queuefirst.x == j && queuefirst.y == i) {
} else {
cost[i][j] = INF;
}
}
}
}
for (int i = 0; i < 4; i++) {
pt nextp;
nextp.x = queuefirst.x + dx[i];
nextp.y = queuefirst.y + dy[i];
if (0 <= nextp.x && nextp.x < w && 0 <= nextp.y && nextp.y < h && field[nextp.y][nextp.x] != 'X' && cost[nextp.y][nextp.x] == INF) {
nextsearch.push(nextp);
cost[nextp.y][nextp.x] = cost[queuefirst.y][queuefirst.x] + 1;
}
}
}
return allcost;
}
int main() {
cin >> h >> w >> n;
string inputtmp;
for (int i = 0; i < h; i++) {
cin >> inputtmp;
field.push_back(inputtmp);
}
cout << bfs() << endl;
return 0;
}
|
#include <stdio.h>
struct STUDENT {
int mid_res;
int fin_res;
int re_res;
};
int main(void) {
struct STUDENT students[100000];
int m, f, r;
int i, num = 0;
do {
scanf("%d %d %d", &m, &f, &r);
students[num].mid_res = m;
students[num].fin_res = f;
students[num].re_res = r;
num++;
} while (!(m == -1 && f == -1 && r == -1));
for (i = 0; i < num - 1; i++) {
int sum = students[i].mid_res + students[i].fin_res;
if (students[i].mid_res == -1 || students[i].fin_res == -1) {
printf("F\n");
} else if (80 <= sum) {
printf("A\n");
} else if (65 <= sum) {
printf("B\n");
} else if (50 <= sum) {
printf("C\n");
} else if (30 <= sum) {
if (50 <= students[i].re_res) {
printf("C\n");
} else {
printf("D\n");
}
}else {
printf("F\n");
}
}
return 0;
}
| 0
| 85,563,532
|
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
bool f(int x) {
if (x < 100) return false;
if (2000 <= x) return true;
rep(i,1,19) {
int l = 100 * i, r = 105 * i;
if (l <= x && x <= r) return true;
}
return false;
}
int main() {
int X;
cin >> X;
cout << f(X) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
using namespace std;
string chengeWord(int n){
string str;
if(n >= 1000){
if(n / 1000 > 1) str+= ('0' + n / 1000);
str+= 'm';
n%=1000;
}
if(n >= 100){
if(n / 100 > 1) str+= ('0' + n / 100);
str+= 'c';
n%=100;
}
if(n >= 10){
if(n / 10 > 1) str+= ('0' + n / 10);
str+= 'x';
n%=10;
}
if(n >= 1){
if(n > 1) str+= ('0' + n);
str+= 'i';
}
return str;
}
int chengeNum(string a){
int num = 0;
rep(i,a.size()){
if(a[i] >= '1' && a[i] <= '9'){
if(a[i + 1] == 'm') num+= (a[i] - '0') * 1000;
else if(a[i + 1] == 'c') num+= (a[i] - '0') * 100;
else if(a[i + 1] == 'x') num+= (a[i] - '0') * 10;
else num+= (a[i] - '0') * 1;
i++;
}else{
if(a[i] == 'm') num+= 1000;
else if(a[i] == 'c') num+= 100;
else if(a[i] == 'x') num+= 10;
else num+= 1;
}
}
return num;
}
int main(){
int n;
string a, b;
cin >> n;
rep(i,n){
cin >> a >> b;
int sum = chengeNum(a) + chengeNum(b);
cout << chengeWord(sum) << endl;
}
}
| 0
| 25,628,503
|
#include <iostream>
using namespace std;
string ToMCXI(int v) {
char c[5] = "ixcm";
int k[4] = {1, 10, 100, 1000};
string ret = "";
for (int i = 3; i >= 0; --i) {
int d = v / k[i] % 10;
if (d > 1) ret += (char)(d + '0');
if (d > 0) ret += c[i];
}
return ret;
}
int FromMCXI(string mcxi) {
int ret = 0;
for (int i = 0; i < mcxi.size(); ++i) {
if ('0' <= mcxi[i] && mcxi[i] <= '9') {
if (i == mcxi.size()-1) ret += mcxi[i]-'0';
else {
int mul = 1;
switch (mcxi[i+1]) {
case 'm': mul = 1000; break;
case 'c': mul = 100; break;
case 'x': mul = 10; break;
case 'i': mul = 1; break;
}
ret += mul * (mcxi[i]-'0');
}
++i;
}
else {
int mul = 1;
switch (mcxi[i]) {
case 'm': mul = 1000; break;
case 'c': mul = 100; break;
case 'x': mul = 10; break;
case 'i': mul = 1; break;
}
ret += mul;
}
}
return ret;
}
int main() {
int N; cin >> N;
for (int i = 0; i < N; ++i) {
string s1, s2; cin >> s1 >> s2;
int v = FromMCXI(s1) + FromMCXI(s2);
cout << ToMCXI(v) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n+1); i++)
#define repr(i,n) for (ll i = (n-1); i>=0;i--)
#define repr3(i,n) for(ll i = (n);i>0;i--)
#define repr4(i,s,n) for(ll i = (n);i>=(s);i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll,ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
const int mod = 1000000007;
int main(){
int H,W;
cin>>H>>W;
char G[H][W];
rep(i,H)rep(j,W)cin>>G[i][j];
vector<vector<int>> dist(H,vector<int>(W,-1));
queue<int> que_y,que_x;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
rep(i,H)rep(j,W){
if(G[i][j]=='.')continue;
dist[i][j] = 0;
que_y.push(i);
que_x.push(j);
}
while (!que_x.empty()) {
int y = que_y.front();
que_y.pop();
int x = que_x.front();
que_x.pop();
rep(i,4) {
if ((y+dy[i]>=0)&&(y+dy[i]<H)&&(x+dx[i]>=0)&&(x+dx[i]<W)&&(G[y+dy[i]][x+dx[i]]=='.')){
if(dist[y+dy[i]][x+dx[i]] != -1) continue;
dist[y+dy[i]][x+dx[i]] = dist[y][x] + 1;
que_y.push(y+dy[i]);
que_x.push(x+dx[i]);
}
}
}
int ans=0;
rep(i,H)rep(j,W)ans=max(ans,dist[i][j]);
cout<<ans<<endl;
return 0;
}
| 0
| 32,077,443
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s="keyence";
string t;
cin>>t;
int n=t.size();
for(int i=0;i<8;i++){
string a,b;
a=t.substr(0,7-i);
b=t.substr(n-i,i);
if(a==s.substr(0,7-i)&&b==s.substr(7-i,i)){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
return 0;
}
|
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<ll> b;
for (int i = 0; i < n; i++)
{
ll si = 0;
for (int j = i; j < n; j++)
{
si += a[j];
b.push_back(si);
}
}
ll ans = 0;
vector<ll> c(b.size(), 1);
for (ll bi = 45; bi >= 0; bi--)
{
int cnt = 0;
for (int i = 0; i < b.size(); i++)
{
if (c[i] && ((1LL << bi) & b[i])) cnt++;
}
if (cnt >= k)
{
ans += (1ll << bi);
for (int i = 0; i < b.size(); i++)
{
if ((1ll << bi) & b[i]) {;}
else c[i] = 0;
}
}
}
cout << ans;
}
| 0
| 12,172,314
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
ll Xor(ll N){
int m = N % 4;
if(m == 0) return N;
if(m == 1) return 1LL;
if(m == 2) return N ^ (1LL);
if(m == 3) return 0;
}
int main(){
ll A, B;
cin >> A >> B;
if(A == 0) cout << B << endl;
else cout << (Xor(A - 1) ^ Xor(B)) << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#define rev(i,n) for(int i = n-1; i >= 0; --i)
#define rev1(i,n) for(int i = n; i > 0; --i)
#define rev2(i,s,t) for(int i = s; i >= t; --i)
#define F first
#define S second
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(a > b){ a = b; return 1; } return 0; }
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
using vii = vector<vi>;
struct UFT{
vector<int> par;
vector<int> rank;
vector<int> size;
int n;
UFT(int _n)
{
n = _n;
par.resize(n);
rank.assign(n,0);
size.assign(n,0);
rep(i,n){
par[i] = i;
}
}
int find(int x)
{
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(int x,int y)
{
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
size[y] += size[x];
}
else{
par[y] = x;
size[x] += size[y];
if(rank[x] == rank[y]) rank[x]++;
}
}
bool same(int x,int y)
{
return find(x) == find(y);
}
int usize(int x)
{
return size[find(x)];
}
};
int main()
{
int n,q; scanf("%d %d", &n, &q);
UFT uf(n);
while(q-- > 0) {
int t,u,v; scanf("%d %d %d", &t, &u, &v);
if(t == 0) uf.unite(u, v);
else printf("%d\n", (uf.same(u, v) ? 1 : 0));
}
return 0;
}
| 0
| 78,809,515
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pl;
typedef queue<ll> ql;
typedef set<ll> sl;
typedef vector<ll> vl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, n) for(ll i = 1; i <= ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll &a, ll &b) {if(b < a) {a = b; return 1;} return 0;}
bool chmax(ll &a, ll &b) {if(b > a) {a = b; return 1;} return 0;}
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX = 500010;
ll num, M, N, ans=0, count=0;
sl move(sl set, ll m, ll flg) {
sl S;
for(ll i: set) {
S.insert(i+m);
if(flg>=1) S.insert(i-m);
}
return S;
}
int main() {
string s;
cin >> s;
ll x, y, m=1, flg=0;
cin >> x >> y;
sl set_x={0}, set_y={0};
rep(i, s.size()) {
if(s[i] == 'T') flg++;
else if(s[i] == 'F' && s[i+1] == 'F') m++;
else {
if(flg%2==0) set_x = move(set_x, m, flg);
else set_y = move(set_y, m, flg);
m=1;
}
}
for(ll i: set_x) if(x==i) ans++;
for(ll i: set_y) if(y==i) ans++;
if(ans==2) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
set<int> a;
rep(i,k) {
int d;
cin >> d;
rep(i,d) {
int b;
cin >> b;
a.insert(b);
}
}
int sum = 0;
rep(i,n) {
if (find(a.begin(), a.end(), i+1) == a.end())
sum++;
}
cout << sum << endl;
return 0;
}
| 0
| 100,568,904
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define all(s) s.begin(),s.end()
#define pb push_back
#define uno unordered_map
#define pi 3.1415926536
#define dig(a) fixed<<setprecision(a)
#define foreach(var,i) for(auto i = var.begin();i!=var.end();i++)
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL);
ll power(ll a, ll n) {ll res = 1; while (n) {if (n % 2) {res *= a;} n >>= 1; a *= a;} return res;}
ll powerm(ll a, ll n, ll m) {ll res = 1; while (n) {if (n % 2) {res = (res * a) % m;} n >>= 1; a = (a * a) % m;} return res;}
const int M=1e9+7;
ll mod(ll x){
return ((x%M + M)%M);
}
ll add(ll a, ll b){
return mod(mod(a)+mod(b));
}
ll mul(ll a, ll b){
return mod(mod(a)*mod(b));
}
const int maxx = 1e6+5;
int main(){
fast();
int t=1;
while(t--){
int n;
cin>>n;
vector<int> cn(maxx,0);
int x;
for(int i=0;i<n;i++){
cin>>x;
cn[x]++;
}
int c=0;
vector<int> vis(maxx,0);
for(int i=1;i<=1000000;i++){
if(cn[i]==0 || vis[i]){
continue;
}
if(cn[i]==1 && !vis[i]){
c++;
}
for(int j=i;j<=1000000;j+=i){
vis[j] = 1;
}
}
cout<<c<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
string s;
cin >> s;
vector<bool> dp(100005, false);
dp[0] = true;
rep(i,s.size()-4){
if(!dp[i]) continue;
if(s[i] == 'd' && s[i+1] == 'r' && s[i+2] == 'e' && s[i+3] == 'a' && s[i+4] == 'm') dp[i+5] = true;
if(s[i] == 'd' && s[i+1] == 'r' && s[i+2] == 'e' && s[i+3] == 'a' && s[i+4] == 'm' && s[i+5] == 'e' && s[i+6] == 'r') dp[i+7] = true;
if(s[i] == 'e' && s[i+1] == 'r' && s[i+2] == 'a' && s[i+3] == 's' && s[i+4] == 'e') dp[i+5] = true;
if(s[i] == 'e' && s[i+1] == 'r' && s[i+2] == 'a' && s[i+3] == 's' && s[i+4] == 'e' && s[i+5] == 'r') dp[i+6] = true;
}
if(dp[s.size()]) cout << "YES" << endl;
else cout << "NO" << endl;
}
| 0
| 16,295,600
|
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <array>
#include <bitset>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
const LL M=1e9+7;
const int L=1e5+1;
LL v[L];
int main() {
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%lld",v+i);
v[i]+=v[i-1];
v[i]%=M;
}
LL x=0;
for(int i=1;i<=n;i++){
x+=v[n]+M-v[i];
x%=M;
x+=(M-(v[i]+M-v[i-1])%M*(n-i)%M)%M;
x%=M;
}
for(int i=1;i<=m;i++){
scanf("%lld",v+i);
v[i]+=v[i-1];
v[i]%=M;
}
LL y=0;
for(int i=1;i<=m;i++){
y+=v[m]+M-v[i];
y%=M;
y+=(M-(v[i]+M-v[i-1])%M*(m-i)%M)%M;
y%=M;
}
printf("%lld\n",x*y%M);
return 0;
}
|
#include<bits/stdc++.h>
#include<stack>
using namespace std;
int main(void) {
char str[105];
while(1){
cin.getline(str, sizeof(str));
if(str[0] == '.') break;
stack<char> s;
s.push('0');
int flag = 1;
for(int i = 0; str[i] != '\0'; i++){
if(str[i] == '(') s.push(')');
if(str[i] == '[') s.push(']');
if(str[i] == ')'){
if(s.top() == ')'){
s.pop();
}else{
flag = 0;
break;
}
}
if(str[i] == ']'){
if(s.top() == ']'){
s.pop();
}else{
flag = 0;
break;
}
}
}
if(flag == 1 && s.top() == '0') cout << "yes" << endl;
else cout << "no" << endl;
}
return 0;
}
| 0
| 29,750,729
|
#include "bits/stdc++.h"
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef long long ll;
bool isAbove(pair<double, double> p1, pair<double, double> p2, pair<double, double> p3) {
if (p1.first == p2.first) {
return p3.first > p1.first;
} else {
return p3.second > p1.second + (p2.second - p1.second) * (p3.first - p1.first) / (p2.first - p1.first);
}
}
void solve() {
#ifdef _WIN32
istream &cin = ifstream("input.txt");
#endif
vector<pair<double, double>> vertices(4);
while (cin >> vertices[0].first) {
cin >> vertices[0].second;
rep(i, 3) cin >> vertices[i + 1].first >> vertices[i + 1].second;
bool flag = (isAbove(vertices[0], vertices[1], vertices[2]) == isAbove(vertices[0], vertices[1], vertices[3]));
flag &= (isAbove(vertices[0], vertices[2], vertices[1]) == isAbove(vertices[0], vertices[2], vertices[3]));
flag &= (isAbove(vertices[1], vertices[2], vertices[0]) == isAbove(vertices[1], vertices[2], vertices[3]));
cout << (flag ? "YES" : "NO") << endl;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <iostream>
#include <math.h>
#include <cstdio>
using namespace std;
int main(){
double a,b,c,s,l,h;
cin >> a >> b >> c;
s=0.5*a*b*sin((M_PI*c*1.0)/180);
l=a+b+sqrt(pow(a,2.0)+pow(b,2.0)-2*a*b*cos((M_PI*c*1.0)/180));
h=b*sin((M_PI*c*1.0)/180);
printf("%.8f\n%.8f\n%.8f\n",s,l,h);
}
| 0
| 11,360,745
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int time1 = h1 * 60 + m1;
int time2 = h2 * 60 + m2;
int diff = time2 - time1;
cout << max(0, diff - k) << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repm(i, a, n) for (ll i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vs vector<string>
#define vii vector<vector<int>>
#define vll vector<ll>
#define vllll vector<vector<ll>>
#define vd vector<double>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define reverse_v(a) reverse(a.begin(), a.end())
#define fi first
#define se second
void print(bool c)
{
(c) ? (cout << "Yes" << endl) : (cout << "No" << endl);
}
void Print(bool c)
{
(c) ? (cout << "YES" << endl) : (cout << "NO" << endl);
}
template <typename T>
T gcd(T a, T b)
{
while (1)
{
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
template <typename T>
T lcm(T a, T b)
{
return a * b / gcd(a, b);
}
bool cmp(const pii &a, const pii &b)
{
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int eve(int x)
{
if (x % 400 == 0)
return 1;
if (x % 100 == 0)
return 0;
if (x % 4 == 0)
return 1;
return 0;
}
int main(void)
{
int n;
cin >> n;
vll v(n);
rep(i, 0, n) cin >> v[i];
map<ll, ll> m1, m2;
rep(i, 0, n)(i % 2 == 0) ? m1[v[i]]++ : m2[v[i]]++;
pll m11, m12, m21, m22;
for (auto x : m1)
{
if (x.second > m11.second)
m12 = m11, m11 = x;
else if (x.second > m12.second)
m12 = x;
}
for (auto x : m2)
{
if (x.second > m21.second)
m22 = m21, m21 = x;
else if (x.second > m22.second)
m22 = x;
}
ll ans = 0;
if (m11.first != m21.first)
ans = (n + 1) / 2 - m11.second + n / 2 - m21.second;
else
{
if (m11.second + m22.second > m21.second + m12.second)
ans = (n + 1) / 2 - m11.second + n / 2 - m22.second;
else
ans = (n + 1) / 2 - m21.second + n / 2 - m12.second;
}
cout << ans << endl;
}
| 0
| 25,535,588
|
#include <iostream>
using namespace std;
int main()
{
unsigned long n, ans = 1;
cin >> n;
for (unsigned long i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s, t;
cin >> s >> t;
queue<char> sq, tq;
for (int i = 0; i < (int)s.size(); i++) {
sq.push(s.at(i));
tq.push(t.at(i));
}
for (int i = 0; i < (int)s.size(); i++) {
sq.push(sq.front());
sq.pop();
if (sq == tq) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| 0
| 41,045,420
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
int main() {
int n, m, a, b, i, j, cnt = 0;
cin >> n >> m;
vector<int> line(n);
for (i = 0; i < n; ++i) line[i] = i + 1;
vector<vector<int>> table(n, vector<int>(n, 0));
for (i = 0; i < m; ++i) {
cin >> a >> b;
table[a - 1][b - 1] = 1;
table[b - 1][a - 1] = 1;
}
do {
if (line[0] != 1) break;
for (i = 0; i < n - 1; ++i) {
if (table[line[i] - 1][line[i + 1] - 1] == 0) break;
if (table[line[i] - 1][line[i + 1] - 1] == 1) continue;
if (table[line[i + 1] - 1][line[i] - 1] == 1) continue;
}
if (i == n - 1) cnt++;
} while (next_permutation(line.begin(), line.end()));
cout << cnt << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll W, H, N;
cin >> W >> H >> N;
ll min_x = 0, max_x = W;
ll min_y = 0, max_y = H;
for (ll i = 0; i < N; i++)
{
ll x, y, a;
cin >> x >> y >> a;
switch (a)
{
case 1:
min_x = max(min_x, x);
break;
case 2:
max_x = min(max_x, x);
break;
case 3:
min_y = max(min_y, y);
break;
case 4:
max_y = min(max_y, y);
break;
default:
break;
}
}
cout << max(max_x - min_x, 0LL) * max(max_y - min_y, 0LL) << endl;
}
| 0
| 51,913,728
|
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
ll sum;
string s;
cin >> s;
for(char c : s)
{
sum += (int)c-48;
}
if(sum%9==0)cout << "Yes";
else cout << "No";
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> s[M];
for (int i = 0; i < M; i++) {
int k; cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
vector<int> p(M);
for (int i = 0; i < M; i++) cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1<<N); bit++) {
int sum = 0;
for (int i = 0; i < M; i++) {
int cnt = 0;
for (int j = 0; j < s[i].size(); j++) {
if ((bit >> s[i][j]) & 1) cnt++;
}
if (cnt % 2 == p[i]) sum++;
}
if (sum == M) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 65,397,080
|
#include <bits/stdc++.h>
using namespace std;
void grid(int A,vector<vector<char>> &color){
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(i==0 || i==48 || j==0 || j==48) color[i][j]='#';
else color[i][j]='.';
}
}
int count=0;
while(count<24 && count<A){
for(int i=0;i<49;++i) color[i][2*count]='#';
++count;
}
if(A-24>=0){
int p=(A-24)/24;
int r=(A-24)%24;
for(int i=0;i<p;++i){
for(int j=0;j<49;++j){
color[2*i+2][j]='#';
}
}
for(int j=0;j<r;++j){
color[2*p+2][2*j+1]='#';
}
}
}
int main(){
int A,B;
cin>>A>>B;
vector<vector<char>> white(49,vector<char>(49)),black(49,vector<char>(49));
grid(A,white);
grid(B,black);
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(black[i][j]=='#') black[i][j]='.';
else if(black[i][j]=='.') black[i][j]='#';
}
}
if(A==1){
cout<<49<<" "<<49<<endl;
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(j==48) cout<<black[i][j]<<endl;
else cout<<black[i][j];
}
}
}
else if(B==1){
cout<<49<<" "<<49<<endl;
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(j==48) cout<<white[i][j]<<endl;
else cout<<white[i][j];
}
}
}
else{
cout<<98<<" "<<49<<endl;
grid(A-1,white);
grid(B-1,black);
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(black[i][j]=='#') black[i][j]='.';
else if(black[i][j]=='.') black[i][j]='#';
}
}
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(j==48) cout<<white[i][j]<<endl;
else cout<<white[i][j];
}
}
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(j==48) cout<<black[i][j]<<endl;
else cout<<black[i][j];
}
}
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
long long n, ans = (long long)1e18;
cin >> n;
vector<long long> a(n + 1);
for(int i = 1; i <= n; i++){
cin >> a[i];
a[i] += a[i - 1];
}
for(int i = 1; i < n; i++){
long long x, y;
x = a[i];
y = a[n] - a[i];
ans = min(ans, abs(x - y));
}
cout << ans << endl;
return 0;
}
| 0
| 24,800,520
|
#include<stdio.h>
int main(){
int matrix[3][3];
char o;
for(int i = 0; i<3 ; i++){
for(int j = 0; j<3 ; j++){
scanf("%d", &matrix[i][j]);
}
}
int N;
scanf("%d", &N);
int input[N];
for(int x = 0; x < N ; x++){
scanf("%d", &input[x]);
for(int i = 0 ; i<3 ; i++){
for(int j = 0 ; j<3 ; j++){
if(input[x] == matrix[i][j]){
matrix[i][j] = o;
}
}
}
}
int ctr[8] = {0};
int last = 2;
for(int i = 0; i<3; i++){
if(matrix[i][0] == o){
++ctr[0];
}
if(matrix[i][1] == o){
++ctr[1];
}
if(matrix[i][2] == o){
++ctr[2];
}
if(matrix[0][i] == o){
++ctr[3];
}
if(matrix[1][i] == o){
++ctr[4];
}
if(matrix[2][i] == o){
++ctr[5];
}
if(matrix[i][i] == o){
++ctr[6];
}
if(matrix[i][last--] == o){
++ctr[7];
}
}
int flag = 0;
for(int i = 0; i < 8; i++){
if(ctr[i] == 3){
flag = 1;
}
}
if(flag == 1){
printf("Yes\n");
}else{
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> a(N), b(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] < b[i]) {
cnt += (b[i] - a[i]) / 2;
} else {
cnt -= a[i] - b[i];
}
}
if (cnt >= 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| 0
| 97,587,989
|
#include <iostream>
using namespace std;
void solve()
{
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
for (int i = a; i <= b; ++i)
{
if (c % i == 0)
{
++ans;
}
}
cout << ans << endl;
}
int main()
{
solve();
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 51;
int n;
int d[N];
int psum[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> d[i];
sum += d[i];
psum[i] = sum;
}
int res = 0;
for (int i = 0; i < n; ++i) {
res += d[i] * (sum - psum[i]);
}
cout << res << endl;
return 0;
}
| 0
| 43,227,637
|
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll tot = 0, need = 0;
vector<ll> plus;
int cnt = 0;
rep(i, n){
int b; cin >> b;
tot += a[i] - b;
a[i] -= b;
if(a[i] < 0){
need -= a[i];
cnt++;
}else plus.push_back(a[i]);
}
if(tot < 0) cout << -1 << endl;
else{
sort(all(plus));
ll total = 0;
if(need){
for(int i = plus.size() - 1; i >= 0; i--){
total += plus[i];
cnt++;
if(total >= need) break;
}
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int n;
int a[1000001];
int inp[200001];
void solve(){
cin >> n;
for (int i = 0; i < 1000001; i++)
{
a[i] = 0;
}
int tmp;
for (int i = 0; i < n; i++)
{
cin >> inp[i];
}
sort(inp, inp+n);
int max = inp[n-1];
for (int i = 0; i < n; i++)
{
int x = inp[i];
if(a[x] == 1){
a[x] +=1;
continue;
}
for (int j = x; j <= max; j = j+x)
{
a[j] += 1;
}
}
int ans = 0;
for (int i = 0; i < n; i++)
{
if(a[inp[i]] == 1) ans++;
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}
| 0
| 87,949,774
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, M; cin >> A >> B >> M;
vector<int> a(A), b(B), x(M), y(M), c(M);
const int INF = 100005;
int amin = INF, bmin = INF;
rep(i,A) {
cin >> a[i];
amin = min(amin, a[i]);
}
rep(i,B) {
cin >> b[i];
bmin = min(bmin, b[i]);
}
int ans = amin + bmin;
rep(i,M) {
cin >> x[i] >> y[i] >> c[i];
ans = min(ans, a[x[i]-1] + b[y[i]-1] -c[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
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, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
int main() {
int N;
string s;
cin >> N >> s;
rep(p, 2) {
rep(q, 2) {
V<int> state(N);
state[0] = p, state[1] = q;
for (int i = 2; i < N; ++i) {
state[i] = (s[i - 1] == 'x') ^ state[i - 1] ^ state[i - 2];
}
bool ok = 1;
if ((s[0] == 'x') != (state[0] ^ state[1] ^ state[N - 1])) {
ok = 0;
}
if ((s[N - 1] == 'x') != (state[N - 1] ^ state[N - 2] ^ state[0])) {
ok = 0;
}
if (ok) {
rep(i, N) printf("%c", state[i] ? 'W' : 'S');
puts("");
return 0;
}
}
}
puts("-1");
return 0;
}
| 0
| 1,041,389
|
#include <iostream>
using namespace std;
int main(){
long long in;
int count = 0;
cin >> in;
for(int a=1; a <= in; a++){
for(int b = 1;b <= (in/a); b++){
int c = in - a*b;
if(c != 0) count++;
}
}
cout << count << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll calc(ll n){
ll m = n+1;
ll ans = 0;
for(int i=0;i<50;i++){
ll tmp = 0;
ll loop = 1LL<<(i+1);
tmp += m/loop * (loop/2);
tmp += max(0LL,m%loop-loop/2);
if(tmp%2==1) ans += (1LL<<i);
}
return ans;
}
int main(void){
ll a,b;
cin >> a >> b;
ll ans = calc(b)^calc(a-1);
cout << ans << endl;
}
| 0
| 4,892,264
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef long long ll;
typedef long double ld;
int main(){
ll x,y;cin>>x>>y;
ll count=0;
while(x<=y){
x*=2;
count++;
}
cout<<count;
return 0;
}
|
#include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
#include <queue>
#define _USE_MATH_DEFINES
#include <math.h>
#include <sstream>
#include <bitset>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
void factoring(ll n, map<ll, ll>& mp) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1) mp[n]++;
}
template<class T, class U = std::make_unsigned_t<T>>
U SafeAbs( T x ) {
return x < 0 ? -static_cast<uintmax_t>(x) : x;
}
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 mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll mod_inv(ll x, ll mod) {
return mod_pow(x, mod - 2, mod);
}
ll ncr(ll n, ll r, ll mod){
ll res=1;
ll num=1,den=1;
for(ll i=n;i>=n-r+1;i--){
(den*=i)%=mod;
}
for(ll i=1;i<=r;i++){
(num*=i)%=mod;
}
res=den*mod_inv(num,mod);
return res%mod;
}
bool isOk(ll index, ll key,vector<ll> &a){
if(a[index]>key){
return true;
}
return false;
}
ll bin_search(ll key, vector<ll> &a){
ll l=-1;
ll r=a.size();
while(abs(r-l)>1){
ll mid = (l+r)/2;
if(isOk(mid, key, a)){
r=mid;
}
else{
l=mid;
}
}
return r;
}
const ll MOD=1000000007;
ll min(ll a, ll b){
if(a>=b){
return b;
}
else{
return a;
}
}
void solve(){
ll n;
cin >> n;
vector<tuple<ll,ll,ll>> coo(n+1,make_tuple(0,0,0));
coo[0] = make_tuple(0, 0, 0);
for (ll i = 1; i <= n; i++)
{
cin >> get<0>(coo[i]) >> get<1>(coo[i]) >> get<2>(coo[i]);
}
sort(coo.begin(), coo.end());
ll x = 0;
ll y = 0;
ll t = 0;
bool ans = true;
for (ll i = 0; i < n; i++)
{
x = abs(get<1>(coo[i]) - get<1>(coo[i + 1]));
y = abs(get<2>(coo[i]) - get<2>(coo[i + 1]));
t = abs(get<0>(coo[i]) - get<0>(coo[i + 1]));
if (x + y <= t)
{
if ((t - (x + y)) % 2 == 1)
{
ans = false;
break;
}
}
else{
ans = false;
break;
}
}
if(ans){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
int main(){
solve();
return 0;
}
| 0
| 5,374,986
|
#include <iostream>
using namespace std;
int main(void){
int x;
cin >> x;
cout << 10-(x/200) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
void dfs(vector<int>& perm, int state, int pre, ll sum, ll& ans,
vector<vector<ll>>& adj) {
if (state == (1 << perm.size())-1) {
ans = min(ans, sum);
return;
}
for(int i = 0; i < perm.size(); i++) {
if (((state >> i) & 1) == 0) {
state |= (1 << i);
dfs(perm, state, perm[i], sum+adj[pre][perm[i]], ans, adj);
state ^= (1 << i);
}
}
}
int main() {
int n, m, r;
int a, b, c;
cin >> n >> m >> r;
vector<vector<ll>> adj(n+1, vector<ll>(n+1, 1e7));
vector<int> perm(r, 0);
for(int& val: perm)
cin >> val;
for(int i = 0; i < m; i++) {
cin >> a >> b >> c;
adj[a][b] = adj[b][a] = min(adj[a][b], ll(c));
}
for(int i = 1; i <= n; i++)
adj[i][i] = 0;
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if (adj[i][k] + adj[k][j] < adj[i][j])
adj[i][j] = adj[i][k] + adj[k][j];
}
}
}
ll ans = INT_MAX;
int state = 0;
for(int i = 0; i < perm.size(); i++) {
state |= (1 << i);
dfs(perm, state, perm[i], 0LL, ans, adj);
state ^= (1 << i);
}
cout << ans << endl;
return 0;
}
| 0
| 38,972,513
|
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int x, n; cin >> x >> n;
vector<int> cnt(102, 0);
int p;
for (int i = 0; i < n; i++)
{
cin >> p;
cnt[p]++;
}
int ans;
for (int i = 0; i < 51; i++)
{
if (cnt[x - i] == 0)
{
ans = x - i; break;
}
if (cnt[x + i] == 0)
{
ans = x + i; break;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(25);
int n;
cin >> n;
vector<int> a((1 << n));
rep(i, (1 << n)) cin >> a[i];
vector<pair<int, int>> dp((1 << n));
rep(S, (1 << n)) {
dp[S] = {S, -1};
rep(i, n) {
if (S >> i & 1) {
int T = S & ~(1 << i);
if (a[dp[T].first] > a[dp[S].first]) {
dp[S] = {dp[T].first, dp[S].first};
if (a[dp[T].second] > a[dp[S].second] && dp[S].first != dp[T].second) {
dp[S].second = dp[T].second;
}
}
else if (dp[S].second == -1) {
dp[S].second = dp[T].first;
}
else if (a[dp[T].first] > a[dp[S].second] && dp[S].first != dp[T].first) {
dp[S].second = dp[T].first;
}
}
}
}
int ans = 0;
FOR(S, 1, (1 << n)) {
chmax(ans, a[dp[S].first] + a[dp[S].second]);
cout << ans << '\n';
}
return 0;
}
| 0
| 6,903,380
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
int main() {
std::string s;
std::cin >> s;
std::string ans = "None";
for (int i = 'a'; i <= 'z'; i++) {
bool f = false;
for (int j = 0; j < s.size(); j++)
{
if(i == s[j]) {
f = true;
}
}
if(!f) {
ans = i;
break;
}
}
std::cout << ans << "\n";
}
|
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
using namespace std;
int main(int argc, char const *argv[])
{
string S;
cin >> S;
vector<long long> a(S.size() + 1);
vector<long long> b(S.size() + 1);
vector<long long> c(S.size() + 1);
for (int i = 0; i <= S.size() - 1; i++)
{
if (S[i] == '<') a[i + 1] = a[i] + 1;
}
for (int i = S.size() - 1; i >= 0; i--)
{
if (S[i] == '>') b[i] = b[i + 1] + 1;
}
long long ans = 0;
for (int i = 0; i < c.size(); i++)
{
c[i] = max(a[i], b[i]);
ans += c[i];
}
cout << (long long)accumulate(c.begin(), c.end(), 0LL) << endl;
return 0;
}
| 0
| 28,875,709
|
#include <iostream>
#include <cmath>
using namespace std;
#define INITIAL 100000
#define INTEREST 1.05
#define CEILING 1000
int
dow(int a, float r, int w)
{
if (w == 0)
return a;
float c = a / CEILING;
return dow(ceil(c * r) * CEILING, r, --w);
}
int
main()
{
int w;
cin >> w;
cout << dow(INITIAL, INTEREST, w) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
int N;
int A[MAX_N];
vector<int> G[MAX_N];
int loop(int v, int p) {
int cnt = 0, ccnt = 0;
int mv = 0;
rep(i, 0, sz(G[v])) {
int n = G[v][i];
if(n == p) continue;
int tmp = loop(n, v);
if(tmp == inf) return inf;
cnt += tmp;
MAX(mv, tmp);
ccnt++;
}
if(ccnt == 0) return A[v];
else if(ccnt == 1) {
if(A[v] != cnt) return inf;
else {
if(v == 0) return 0;
else return cnt;
}
}
else {
if(cnt - A[v] < 0 || 2 * A[v] - cnt < 0) return inf;
else {
if(cnt - A[v] > cnt - mv) return inf;
return 2 * A[v] - cnt;
}
}
}
void solve() {
cin >> N;
rep(i, 0, N) cin >> A[i];
rep(i, 0, N - 1) {
int a, b; cin >> a >> b; a--; b--;
G[a].pb(b);
G[b].pb(a);
}
if(loop(0, -1) != 0) cout << "NO\n";
else cout << "YES\n";
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
srand((unsigned int)time(NULL));
#ifdef LOCAL
freopen("in.txt", "rt", stdin);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| 0
| 38,945,199
|
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
for (int i=0; i<3; i++){
string str; cin>>str;
printf("%c", toupper(str[0]));
}
}
int main(){
solve();
Bye;
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
typedef pair<int,int> pint;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
string mp[1000];
int visit[1000][1000];
int main(){
int h,w,n,cx,cy,ans=0;
cin>>h>>w>>n;
for(int i=0;i<h;++i){
cin>>mp[i];
if(mp[i].find('S')!=string::npos){
cy=i;cx=mp[i].find('S');
}
}
for(int i=1;i<=n;++i){
memset(visit,0,sizeof(visit));
visit[cy][cx]=1;
queue<pint> q;
q.push(make_pair(cx,cy));
while(!q.empty()){
pint pi=q.front();q.pop();
cx=pi.first;cy=pi.second;
int vc=visit[cy][cx];
if(mp[cy][cx]==i+'0'){
ans+=vc-1;break;
}
for(int j=0;j<4;++j){
int tx=cx+dx[j];int ty=cy+dy[j];
if(tx>=0&&ty>=0&&tx<w&&ty<h&&visit[ty][tx]==0&&mp[ty][tx]!='X'){
q.push(make_pair(tx,ty));
visit[ty][tx]=vc+1;
}
}
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 20,772,021
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N, Y;
cin >> N >> Y;
for (ll i = 0; i <= N; ++i)
{
for (ll j = 0; j <= N - i; ++j)
{
ll k = N - i - j;
if (k < 0)
{
break;
}
ll en = 10000 * i + 5000 * j + 1000 * k;
if (en == Y)
{
cout << i << " " << j << " " << k << endl;
return 0;
}
}
}
cout << -1 << " " << -1 << " " << -1 << endl;
}
|
#include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main(){
int input;
stack<int> cars;
while(cin >> input){
if(input > 0){
cars.push(input);
}else{
cout << cars.top() << endl;
cars.pop();
}
}
}
| 0
| 96,019,860
|
#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
using namespace std;
int main(void){
long long int sum;
int max, min, N;
cin >> N;
int temp;
for(int i = 0; i < N; i++){
cin >> temp;
if(i == 0){
sum = temp;
min = temp;
max = temp;
}
else{
if(temp > max) max = temp;
if(temp < min) min = temp;
sum = sum + temp;
}
}
cout << min << " " << max << " " << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
ll n;
cin >> n;
ll t = sqrt(n);
for (ll i = t; i >= 0; i--) {
if (n % i == 0) {
cout << i-1+(n/i)-1 << endl;
return 0;
}
}
return 0;
}
| 0
| 50,578,077
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, x, y;
int main(){
scanf("%d%d", &n, &m);
if(m >= (1<<n)) printf("-1\n");
else if(m == 0){
for(i=0; i<=(1<<n)-1; i++){
printf("%d %d ", i, i);
}
}
else if(n < 2) printf("-1\n");
else{
for(i=0; i<=(1<<n)-1; i=++x){
if((j=i^m) < i) continue;
for(x=i+1; (y=x^m)<x; x++);
printf("%d %d %d %d %d %d %d %d ", i, j, x, y, j, i, y, x);
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n,m,p;
while(cin >> n >> m >> p && n){
int x[100];
int a=0,d,ans;
for(int i=0;i<n;i++){
cin >> x[i];
a+=x[i];
}
d=a*100*(100-p)/100;
if(x[m-1]==0)
ans = 0;
else
ans=d/x[m-1];
cout << ans << endl;
}
}
| 0
| 22,563,323
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using Matrix = vector<vector<T>>;
const ll inf = 1LL<<60;
int main()
{
string s; cin>>s;
string z = "";
rep(i, 26) z.push_back('z');
string ans = z;
vector<bool> used(26, false);
int n = s.size();
rep(i, n) {
used[s[i]-'a'] = true;
string t = s.substr(0, i);
rep(j, 26) {
if (used[j]) continue;
string u = t + char('a' + j);
if (s < u) ans = min(ans, u);
}
}
rep(i, 26) {
if (used[i]) continue;
ans = min(ans, s + char('a' + i));
}
if (ans == z) cout << -1 << endl;
else cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
int N, C=0;
cin >> N;
vector<int> h(N);
for (int i=0; i<N; i++) {
cin >> h[i];
}
while (true) {
int fin=1, m;
for (int i=0; i<N; i++) {
if (h[i]>0) {
fin=0;
m=i;
break;
}
}
if (fin==1) {break;}
while (m<N && h[m]>0) {
h[m]--;
m++;
}
C++;
}
cout << C << endl;
}
| 0
| 47,522,193
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
int main() {
string s; cin >> s;
int n = s.size();
bool ok = false;
if (n >= 4) {
if (s.substr(0,4) == "YAKI") ok = true;
}
if (ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define vit vector<int>::iterator
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fr first
#define sc second
#define skip continue
#define PI 3.14159265
typedef unsigned long long ull;
typedef long long ll;
typedef unsigned int ui;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<bool> vb;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MAXN = 3e5 + 3;
const int M = 1e9+7;
void faster(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
bool cmp(const string& a, const string& b) {
return (a + b) < (b + a);
}
void solve(){
int a;
cin >> a;
if(a >= 1200) cout << "ARC";
else cout << "ABC";
}
int main(){
int n = 1;
while(n--){
solve();
cout << endl;
}
}
| 0
| 9,352,595
|
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
string s[N];
int cnt [N][28];
int main ()
{
int n;
cin >> n;
for (int i = 0 ;i < n ; i++) {
cin >> s[i];
for (int j = 0; j < (int)s[i].size(); j++)
{
cnt[i][s[i][j]-'a']++;
}
}
for (int j = 'a'-'a'; j <= 'z'-'a'; j++) {
int minn = 1e9;
for (int i = 0; i < n; i++) {
int cntt = cnt[i][j];
minn = min(minn, cntt);
}
for (int i = 0; i < minn; i++) {
cout << char(j+'a');
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define mod2 998244353
#define pii pair<ll,ll>
#define pb push_back
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vector<T> arr) {
for (auto t: arr)
cout << t << " ";
cout << "\n";
}
template<typename T>
void debugarr(T arr, int n) {
for (int i=0;i<n;i++) cout << arr[i] << " ";
cout << "\n";
}
ll __min(ll a, ll b) {
return a < b ? a : b;
}
ll __max(ll a, ll b) {
return a > b ? a : b;
}
const int maxn = 1e5+1;
ll arr[maxn], n, m, t, k, q;
unordered_map<ll,ll> u;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
set<ll> s;
u.clear();
for (int i=0;i<n;i++) {
cin>>m;
u[m]++;
s.insert(m);
}
ll f=-1;
ll se=-1;
for (set<ll>::reverse_iterator itr=s.rbegin();itr!=s.rend();itr++) {
if (u[*itr] >= 4 && f == -1) {
cout << (*itr)*(*itr) << endl;
exit(0);
}
if (u[*itr]>=2) {
if (f == -1) f = *itr;
else if (se == -1) {
se = *itr;
break;
}
}
}
if (se==-1) cout << "0\n";
else cout << f*se << endl;
}
| 0
| 81,718,799
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s,t;cin >>s>>t;
sort(all(s));
sort(all(t));
reverse(all(t));
if(s<t)puts("Yes");
else puts("No");
return 0;
}
|
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define int long long
#define swap(x,y) (x^=y^=x^=y)
#define debug1(a) cerr<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<endl;
#define debug4(a,b,c,d) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<", "<<#d<<" = "<<(d)<<endl;
using namespace std;
struct compare{
bool operator() (const pair<int,int> a, const pair<int,int> b) const{
return a.first < b.first;
}
};
const int nax = 1e5 + 5;
int32_t main(){
IOS
int n;
cin >> n;
int arr[n];
int cnt[nax];
memset(cnt,0,sizeof(cnt));
for(int i = 0; i < n; i++){
cin >> arr[i];
cnt[arr[i]]++;
}
for(int i = nax-2; i >= 0; i--){
cnt[i] += cnt[i+1];
}
int ans = 0;
for(int i = 1; i < nax; i++){
if(n-cnt[i] == cnt[i]){
ans++;
}
}
cout << ans << endl;
}
| 0
| 39,998,974
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n;
cin>>n;
int sum=0;
int c=1;
while(sum<n){
sum+=c;
c++;
}
sum-=n;
vector<int> v;
for(int i=1;i<c;i++){
if(i!=sum)v.pb(i);
}
rep(i,v.size()){
if(i)cout<<" ";
cout<<v[i];
}
cout<<endl;
}
|
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8, pi = acos(-1.0);
bool eq(ld a, ld b){return (abs(b-a)<eps);}
ld dot(Point a, Point b){return real(conj(a)*b);}
ld cross(Point a, Point b){ return imag(conj(a)*b);}
int ccw(Point a, Point b, Point c){
b-=a;c-=a;
if(cross(b,c)>eps) return 1;
if(cross(b,c)<-eps) return -1;
if(dot(b,c)<0) return 2;
if(norm(b)<norm(c)) return -2;
return 0;
}
int main(){
Point p[4];
ld x,y;
while(cin>>x>>y){
p[0]=Point(x,y);
REP(i,3){
cin>>x>>y;
p[i+1]=Point(x,y);
}
int a=ccw(p[0],p[1],p[3]);
int b=ccw(p[1],p[2],p[3]);
int c=ccw(p[2],p[0],p[3]);
if((a==1&&b==1&&c==1)||(a==-1&&b==-1&&c==-1))
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
}
| 0
| 23,268,397
|
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; }
else if(k == 1) { return n; }
else return C(n-1,k-1) + C(n-1,k);
}
lint P(lint n, lint k) {
if(k == 1) { return n; }
return (n*(P(n-1,k-1)%1000000007)%1000000007);
}
int main() {
lint n; cin >> n;
vector<lint> a(n),b(n);
for(lint i=0;i<n;i++) { cin >> a[i]; }
for(lint i=0;i<n;i++) { cin >> b[i]; }
vector<lint> d(n);
for(lint i=0;i<n;i++) { d[i] = a[i]-b[i]; }
sort(d.begin(),d.end());
lint sum=0, cnt=0;
for(lint i=0;i<n;i++) {
if(d[i] < 0) {
cnt++;
sum += d[i];
}
}
for(lint i=n-1;i>=0;i--) {
if(sum < 0 && d[i] > 0) {
sum += d[i];
cnt++;
}
if(sum >= 0) {
cout << cnt << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
#define REP(i,a,b) for(in i=(in)(a);i<(in)(b);i++)
const double PI=3.14159265358979323846;
const in MOD = 998244353;
const in INF=1e18+7;
const in inf=1e9+7;
using P=pair<in,in>;
vector<in> dx={0,1,-1,0};
vector<in> dy={1,0,0,-1};
in modpow(in a, in n, in mod) {
in res = 1ll;
while (n > 0ll) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout << fixed << setprecision(10);
in n;
cin>>n;
vector<in> a(n-1,0);
in a1;
cin>>a1;
if(a1!=0ll){
cout<<0<<endl;
return 0;
}
if(n==1){
cout<<1<<endl;
return 0;
}
rep(i,n-1) cin>>a.at(i);
sort(all(a));
if(a[0]==0){
cout<<0<<endl;
return 0;
}
in cnt=upper_bound(all(a),1)-a.begin();
in now=1ll;
in ans=1ll;
while(now!=a[a.size()-1ll]){
now ++;
in cnt2=upper_bound(all(a),now)-upper_bound(all(a),now-1);
ans *=modpow(cnt,cnt2,MOD);
ans %=MOD;
cnt =cnt2;
}
cout<<ans<<endl;
}
| 0
| 82,942,088
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<int64_t> B(N - 1);
for (int i = 0; i < N - 1; i++) cin >> B.at(i);
int64_t res = B.at(0) + B.back();
for (int i = 0; i + 1 < B.size(); i++) {
res += min(B.at(i), B.at(i + 1));
}
cout << res << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a,long long b) {
if (a < b) swap(a,b);
if (b == 0) return a;
return gcd(b,a%b);
}
bool is_prime(long long N){
if (N == 1) return false;
for (long long i = 2;i * i <= N;i++){
if (N % i == 0) return false;
}
return true;
}
ll lcm(ll a,ll b){
return ((a * b == 0)) ? 0 : (a / gcd(a,b) * b);
}
double DegreeToRadian(double degree){
return degree * M_PI / 180.0;
}
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main(){
int n;
cin >> n;
int64_t ans;
for (int i = 0;i < n;i++){
int64_t t;
cin >> t;
if (i == 0){
ans = t;
continue;
}
ans = lcm(ans, t);
}
cout << ans << endl;
}
| 0
| 92,688,453
|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int N[65535];
int i = 0;
while(1){
scanf("%d", &N[i]);
if(N[i] == 0) break;
i++;
}
for (int j = 0; j < i; j++){
cout << "Case " << j+1 << ": " << N[j] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; 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;
}
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll 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<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N, L; cin >> N >> L;
vector<string> s(N);rep(i, N) cin >> s[i];
sort(s.begin(), s.end());
rep(i, N) {
cout << s[i];
}
cout << endl;
}
int main(void)
{
solve();
}
| 0
| 79,407,400
|
#include<cstdio>
const int max_n = 100;
int main(){
int n;
int u,k,v;
int G[100][100];
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
G[i][j] = 0;
}
}
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d %d",&u,&k);
for(int j=1;j<=k;j++){
scanf("%d",&v);
G[u-1][v-1] = 1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
printf("%d",G[i][j]);
if(j!=n-1) printf(" ");
else if(j == n-1) printf("\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++)
const int MOD = 1000000007;
vector<ll> A;
bool ok(int m)
{
ll tmp = 0;
for (int i = 0; i <= m; i++)
tmp += A[i];
for (int i = m + 1; i < A.size(); i++)
{
if (tmp * 2 < A[i])
return false;
tmp += A[i];
}
return true;
}
int main()
{
ll n;
cin >> n;
A.resize(n);
rep(i, n) cin >> A[i];
sort(A.begin(), A.end());
int l = -1;
int r = n;
while (r - l > 1)
{
int m = l + (r - l) / 2;
if (ok(m))
r = m;
else
l = m;
}
cout << n - r << endl;
}
| 0
| 34,328,397
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve() {
int n; cin >> n;
map<int,set<int>> mp;
for (int i = 0; i < n; i++) {
int x; cin >> x;
mp[x].insert(i);
}
vector<ll> res(n, 0);
int sz = 0;
int i = n;
for (auto rit = mp.rbegin(); rit != mp.rend(); rit++) {
auto &ids = rit->second;
auto j = next(rit);
sz += ids.size();
int pre = j==mp.rend()?0:j->first;
int d = rit->first - pre;
i = min(i, *ids.begin());
res[i] += 1ll*d*sz;
}
for (auto& x: res) {
cout << x << ' ';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a <= b && c <= d) {
cout << a + c << "\n";
} else if (a <= b && c >= d) {
cout << a + d << "\n";
} else if (a >= b && c >= d) {
cout << b + d << "\n";
} else if (a >= b && c <= d) {
cout << b + c << "\n";
}
}
| 0
| 99,296,803
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T>
void print_vec(vector<T> v) {
for (T i : v) cout << i << " ";
cout << endl;
}
int main() {
int n;
cin >> n;
int ans = 0;
int mx = 0;
rep(i, n) {
int h;
cin >> h;
if (h >= mx) ans++;
mx = max(mx, h);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF = -1e18;
const int I=2001;
int input() {int x; cin>>x; return x;}
int main(){
int n,k; cin>>n>>k;
ll a[n]; for(int i=0;i<n;i++) cin>>a[i];
ll an=3.1415926535e14;
for(int i=0;i<(1<<n);i++) {
ll sm=0, hi=0, kk=0; bool p[n];
for(int j=0;j<n;j++) {
if (i & (1<<j)) p[j]=true, kk++;
else p[j]=false;
}
if (kk < k) continue;
for(int j=0;j<n;j++) {
ll sz=a[j];
if (p[j]) {
sm += max(0LL, hi-sz+1);
sz = max(a[j], hi+1);
}
hi=max(hi,sz);
}
an = min(an,sm);
}
cout<<an<<endl;
}
| 0
| 84,149,225
|
#include<iostream>
using namespace std;
int N;
int K;
int A;
int main(){
cin>>N>>K;
A=N%K;
cout<<A<<endl;
}
|
#include <stdio.h>
int main(void){
int x;
int y;
int buf;
while(1){
scanf("%d %d",&x,&y);
if(x == 0 && y == 0) break;
if(x > y){
buf = x;
x = y;
y = buf;
}
printf("%d %d\n",x,y);
}
}
| 0
| 30,926,487
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y,k;
cin>>X>>Y;
if(X%Y==0){
cout<<-1<<endl;
return 0;
}
for(k=1;k<Y;k++){
if((k*X)%Y!=0){
cout<<k*X<<endl;
return 0;
}
}
cout<<-1<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100000
#define maxn 200002
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 1000000000
#define MOD 1000000007
#define vll(a) vector<ll>a
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int main ()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
sll(n);
vll(a);
for (int i=0 ; i<n ; i++)
{
ll x;
sll(x);
a.pb(x);
}
ll res = 0;
ll fact= 1;
for (int d=0 ; d<60 ; d++)
{
ll even=0,odd=0;
for (int i=0 ; i<n ; i++)
{
if (a[i] & (1LL << d))
odd++;
else
even++;
}
ll add = (odd * even) % MOD * fact % MOD;
res = (res + add) % MOD;
fact = (fact * 2) % MOD;
}
cout << res << endl;
return 0;
}
| 0
| 10,097,389
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int r,D,x;
cin >> r>>D>>x;
vector<int>Ans(11);
Ans[0] = x;
for (int n = 0; n < 10; ++n) {
Ans[n + 1] = r * Ans[n] - D;
}
for (int n = 0; n < 10; ++n) {
cout << Ans[n+1] <<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) {
string tmp;
cin >> tmp;
for(int j = 0; j < w; j++) {
int idx=i*w+j;
if(tmp[j]=='#'){
a[idx]=true;
que.push(idx);
}
}
}
int cnt=0;
int ans=0;
while(cnt<h*w) {
int n=que.size();
cnt+=n;
for(int i = 0; i < n; i++) {
int idx=que.front();
int add[4]={1,-1,w,-w};
for(int j = 0; j < 4; j++) {
int t=idx+add[j];
int r=idx/w+add[j]/w;
int c=idx%w+add[j]%w;
if(r<0||r>=h||c<0||c>=w||a[t]==true) continue;
a[t]=true;
que.push(t);
}
que.pop();
}
ans++;
}
cout << ans-1 << "\n";
return 0;
}
| 0
| 60,812,101
|
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 0; ; i++) {
int x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
break;
} else if (x < y) {
cout << x << ' ' << y << endl;
} else {
cout << y << ' ' << x << endl;
}
}
}
|
#include <iostream>
#include <string>
#include <list>
using namespace std;
int
main()
{
ios_base::sync_with_stdio(false);
int n;
cin >> n; cin.ignore();
list<int> lst;
for (int i = 0; i < n; i++) {
string cmd;
getline(cin, cmd);
switch (cmd[6]) {
case 'F':
lst.pop_front();
break;
case 'L':
lst.pop_back();
break;
default:
int k = 0;
int len = cmd.length() - 7;
switch (len) {
case 10: k += (cmd[ len - 3 ] - '0') * 1000000000;
case 9: k += (cmd[ len - 2] - '0') * 100000000;
case 8: k += (cmd[ len - 1] - '0') * 10000000;
case 7: k += (cmd[len] - '0') * 1000000;
case 6: k += (cmd[ len + 1] - '0') * 100000;
case 5: k += (cmd[ len + 2] - '0') * 10000;
case 4: k += (cmd[ len + 3] - '0') * 1000;
case 3: k += (cmd[ len + 4] - '0') * 100;
case 2: k += (cmd[ len + 5] - '0') * 10;
case 1: k += (cmd[ len + 6] - '0');
}
if(cmd[0] == 'i') {
lst.push_front(k);
} else {
for (auto it = lst.cbegin(); it != lst.cend(); it++) {
if (*it == k) {
lst.erase(it);
break;
}
}
}
}
}
for (auto it = lst.begin(); it != lst.end(); it++) {
if (it != lst.begin()) { cout << ' '; }
cout << *it;
}
cout << endl;
return 0;
}
| 0
| 80,854,135
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mincost(ll arr[],ll n,ll k)
{
if(n==2)
return abs(arr[2]-arr[1]);
else
{
ll dp[n+1];
dp[1]=0;
dp[2]=abs(arr[2]-arr[1]);
for(ll i=3;i<=n;i++)
{
ll mn=INT_MAX;
for(ll j=1;j<=k;j++)
{
if((i-j)>=1)
{
dp[i]=min(mn,dp[i-j]+abs(arr[i]-arr[i-j]));
mn=dp[i];
}
}
}
return dp[n];
}
}
int main() {
ll n,k;
cin>>n>>k;
ll arr[n+1];
for(ll i=1;i<=n;i++)
cin>>arr[i];
cout<<mincost(arr,n,k);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r;
bool flag=false;
string str,ptr;
cin>>str>>ptr;
ptr.pop_back();
if(str==ptr)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
| 0
| 13,315,394
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
vector<ll> P(m), Y(m);
vector<set<pair<ll, int>>> C(n);
rep(i, m) {
cin >> P[i] >> Y[i];
P[i]--;
C[P[i]].emplace(Y[i], i);
}
vector<int> ans(m);
rep(i, n) {
int j = 1;
for(auto ele: C[i]) ans[ele.second] = j++;
}
rep(i, m) {
cout << setfill('0') << right << setw(6) << P[i]+1;
cout << setfill('0') << right << setw(6) << ans[i];
cout << "\n";
}
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
#include<string>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
int h[n];
for(int i=0;i<n;i++)
{
cin>>h[i];
}
vector<int> dp(n,INT_MAX);
dp[0]=0;
dp[1]=abs(h[1]-h[0]);
for(int i=2;i<n;i++)
{
int j=1;
while(i-j>=0&&j<=k)
{
dp[i] = min(dp[i-j]+abs(h[i ]-h[i-j]),dp[i]);
j++;
}
}
cout<<dp[n-1];
return 0;
}
| 0
| 92,257,442
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define PI acos(-1.0)
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
const ll INF = 999999;
int W, H, N;
queue<pair<ll, ll> > que;
vector<string> vs;
ll d[1010][1010];
ll st, gl, goal[10];
ll Z(int y, int x){
return 1010 * y + x;
}
int main(){
cin >> H >> W >> N;
vs.resize(H);
FOR(i,0,H) cin >> vs[i];
FOR(y,0,H){
FOR(x,0,W){
if(vs[y][x]=='S') st = Z(y,x);
if(vs[y][x]>='1' && vs[y][x]<='9') goal[vs[y][x]-'0'] = Z(y,x);
}
}
int vx[4] = {0,1,0,-1};
int vy[4] = {-1,0,1,0};
int n = 1;
int ans = 0;
while(n<=N){
st = n==1?st:goal[n-1];
gl = goal[n];
FOR(i,0,H) FOR(j,0,W) d[i][j] = INF;
while(!que.empty()) que.pop();
que.push(make_pair(st, 0));
d[st/1010][st%1010] = 0;
while(!que.empty()){
int nowy = que.front().first / 1010;
int nowx = que.front().first % 1010;
int nowd = que.front().second;
que.pop();
if(d[nowy][nowx] < nowd) continue;
FOR(i,0,4){
int nexty = nowy + vy[i];
int nextx = nowx + vx[i];
if(nexty < 0 || nexty >= H || nextx < 0 || nextx >= W) continue;
if(vs[nexty][nextx]=='X') continue;
int nextd = nowd + 1;
if(d[nexty][nextx] > nextd){
d[nexty][nextx] = nextd;
que.push(make_pair(Z(nexty,nextx), nextd));
}
}
}
ans += d[gl/1010][gl%1010];
n++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
const int MAX = 1000000;
const int MOD = 1000000007;
int main(){
ll n, x, m, ans=0;
cin >> n >> x >> m;
map<ll, int>mp;
vector<ll>bflp,lp;
bool flag = true;
ll loop = 0, sum = 0;
ll p = x;
while(flag){
mp[p]++;
if(mp[p]==3){
mp[p]--;
flag = false;
break;
}
p = p*p;
p%= m;
}
ll cnt1=0;
for(auto i :mp){
if(i.second==1){
cnt1++;
}else{
loop++;
}
}
p = x;
lrep(i, 0, cnt1){
bflp.push_back(p);
p = p*p%m;
}
lrep(i, 0, loop){
lp.push_back(p);
p = p*p%m;
}
ll q1 = lp.size();
ll q2 = bflp.size();
if(q2>n){
lrep(i, 0, n){
ans += bflp[i];
}
cout << ans << endl;
return 0;
}else{
lrep(i, 0, q2){
ans += bflp[i];
}
}
lrep(i, 0, q1){
sum += lp[i];
}
ll r= (n-q2)/loop;
ans += r*sum;
ll r2= (n-q2)%loop;
ll test =0;
lrep(i, 0, r2){
ans += lp[i];
test += lp[i];
}
cout << ans << endl;
}
| 0
| 13,294,266
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
using plli=pair<ll,int>;
using vplli=vector<pair<ll,int>>;
using pllll=pair<ll,ll>;
using vpllll=vector<pair<ll,ll>>;
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> ll llpow(ll x,T n){ll ans=1;if(x==0)ans=0;while(n){if(n&1)ans*=x;x*=x;n>>=1;}return ans;}
long long modpow(long long a, long long n, long long mod) {long long res = 1;while (n > 0) {if (n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}
template<class T> inline T gcd(T x,T y){if(y==0)return x; else {return gcd(y,x%y);}}
template<class T> inline T lcm(T x,T y){return x/gcd(x,y)*y;}
long long modinv(long long a, long long m) {long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
#define rep(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
#define irep(i, end_i, begin_i) for (ll i = (ll)begin_i-1; i >= (ll)end_i; i--)
long long INF = 1LL<<60;
struct UnionFind { vector<int> d; UnionFind(int n=0): d(n,-1) {} int find(int x) { if (d[x] < 0) return x; return d[x] = find(d[x]); } bool unite(int x, int y) { x = find(x); y = find(y); if (x == y) return false; if (d[x] > d[y]) swap(x,y); d[x] += d[y]; d[y] = x; return true; } bool same(int x, int y) { return find(x) == find(y);} int size(int x) { return -d[find(x)];} };
int main( ){
ll N,M;
cin>>N>>M;
vi p;
rep(i,0,N){
int t;
cin>>t;
p.push_back(t);
}
UnionFind uf(N+1);
rep(i,0,M){
int x,y;
cin>>x>>y;
uf.unite(x,y);
}
ll ans=0;
rep(i,0,N){
int pos=i+1,wannago=p[i];
if(uf.same(pos,wannago))ans++;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
const long long INF = LLONG_MAX;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main()
{
string s;
int A, B;
cin >> A >> B;
cin >> s;
if(s.size() != A+B+1)
{
cout << "No" << endl;
return 0;
}
int p = s.find('-');
if(p != A)
{
cout << "No" << endl;
return 0;
}
rep(i, s.size())
{
if(i == A) continue;
if(!(0 <= (s[i] - '0') && (s[i] - '0') <= 9))
{
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 55,504,790
|
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define m_p make_pair
#define re return
#define pb push_back
#define si set<int>
#define ld long double
#define X first
#define Y second
#define st string
#define ull unsigned long long
#define mod 1000000007
#define INF 1000000007
#define x1 XZVJDFADSPFOE
#define y1 GASDIJSLDAEJF
#define x2 DFDAJKVOHKWIW
#define y2 PSFSAODSXVNMQ
#define LLINF 0x3f3f3f3f3f3f3f3fLL
using namespace std;
inline void read(int &x)
{
short negative=1;
x=0;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-')
negative=-1;
c=getchar();
}
while(c>='0' && c<='9')
x=(x<<3)+(x<<1)+(c^48),c=getchar();
x*=negative;
}
ll quickpower(ll n,ll k){
ll ans=1;
while(k){
if(k%2){
ans*=n;
ans%=mod;
}
n*=n;
n%=mod;
k/=2;
}
return ans;
}
string int_to_string(int n)
{
string s="";
while(n)
{
int now=n%10;
s+=now+'0';
n/=10;
}
reverse(s.begin(),s.end());
return s;
}
int string_to_int(string s)
{
int n=0;
rep(i,s.size())
{
n*=10;
n+=s[i]-'0';
}
return n;
}
int main()
{
ios::sync_with_stdio(0);
int n;
ll a[100];
cin>>n;
rep(i,n)cin>>a[i];
ll s=1000/a[0];
ll m=1000%a[0];
rep(i,n-1)
{
if(a[i+1]>a[i])
{
m+=a[i+1]*s;
s=0;
s=m/a[i+1];
m%=a[i+1];
}
else
{
m+=a[i]*s;
s=0;
s=m/a[i+1];
m%=a[i+1];
}
}
cout<<m+s*a[n-1]<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1;
return right;
}
vector<ll> prime;
void Prime(ll n){
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
ll gcd(ll a,ll b){
if(a<b){
swap(a,b);
}
ll r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
int main(){
ll n;
cin>>n;
if(n==1){
cout<<0<<endl;
return 0;
}
vector<ll> cnt;
ll m=n;
for(long long int i=2;i*i<=m && n>1;i++){
if(n%i==0){
ll tmp=0;
while(n%i==0){
tmp++;
n/=i;
}
cnt.push_back(tmp);
}
}
ll ans=0;
if(n!=1) ans++;
n=cnt.size();
rep(i,n){
ll k=0;
while(((k+1)*(k+2))/2 <= cnt[i]){
k++;
}
ans+=k;
}
if(ans==0) ans++;
cout<<ans<<endl;
return 0;
}
| 0
| 55,193,113
|
#include<bits/stdc++.h>
#define ll long long
#define N 100010
using namespace std;
int n,a[N];
ll s[N],ans,no=1;
int main(){
cin>>n;
for (int i=0;i<=n;i++)cin>>a[i];
for (int i=n;i>=0;i--)s[i]=s[i+1]+a[i];
for (int i=0;i<=n;i++){
ans+=no;
no=no-a[i];
if (no<0){
puts("-1");
return 0;
}
no=min(no*2,s[i+1]);
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793
int main(){
int H, W, A, B; cin >> H >> W >> A >> B;
rep(i, B){
rep(j, A){
cout << 0;
}
rep(j, W-A){
cout << 1;
}
cout << endl;
}
rep(i, H-B){
rep(j, A){
cout << 1;
}
rep(j, W-A){
cout << 0;
}
cout << endl;
}
}
| 0
| 95,090,438
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
ll N, M, D;
cin >> N >> M >> D;
cout << setprecision(20) << (double)(N-D)*(D?2:1)*(M-1)/(N*N) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<lli> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<ii> vii;
#define deb(x) cout << #x": " << (x) << endl;
const int N = 1e3;
const lli INF = 1e18;
const lli MOD = 1e9+7;
const ld EPS = 1e-4;
vi primes(1,2);
vector<vector<ld>>nk;
void sieve(){
vi m(N+1,0);
for(int i = 4; i<N; i+=2)m[i]=1;
for(int i = 3; i*i<=N; i+=2)if(!m[i])for(int j = i*i; j<N; j+=i)m[j]=1;
for(int i = 3; i<N; i+=2)if(!m[i])primes.pb(i);
}
void pascal(){
nk =vector<vector<ld>>(N,vector<ld>(N,0.0));
fore(i,0,N)nk[i][0]=nk[i][i]=1.0;
fore(i,1,N)fore(j,1,i)nk[i][j]=nk[i-1][j-1]+nk[i-1][j];
}
lli gcd(lli a, lli b){return (b?gcd(b,a%b):a);}
lli lcm(lli a, lli b){
if(a<b)swap(a,b);
lli c = gcd(a,b);
a/=c;
return a*b;
}
int popcount(lli x) { return __builtin_popcountll(x); }
lli poww(lli a, lli b){
lli res =1;
while(b){
if(b&1) res = res * a;
a = a*a;
b/=2;
}
return res;
}
lli powm(lli a, lli b){
lli res =1;
while(b){
if(b&1) res = (res * a)%MOD;
a = (a*a)%MOD;
b/=2;
}
return res;
}
bool isPrime(lli x){
if(x==1)return 0;
for(auto i:primes){
if(i*i>x)return 1;
if(x%i==0)return 0;
}
return 1;
}
lli SUM(lli a, lli b, lli mod=MOD){
return (a+b+mod)%mod;
}
lli PROD(lli a, lli b, lli mod=MOD){
a%=mod; b%=mod;
return a*b % mod;
}
int dx[4]={1,-1,1,-1}, dy[4]={1,-1,-1,1};
vvi graph(int n, int m){
vv(int,v,n+1,0);
fore(i,0,m){
int a,b; cin>>a>>b;
v[a].pb(b);
v[b].pb(a);
}
return v;
}
void solve(){
int n; cin>>n;
vi v(n-1);fore(i,0,n-1)cin>>v[i];
lli sum = 0;
fore(i,0,n-2)sum+=min(v[i+1],v[i]);
sum+=v[0]+v.back();
cout<<sum<<ENDL;
}
int main(){_
solve();
}
| 0
| 53,583,275
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
#define EPS 0.001
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvc = vector<vc>;
using vvs = vector<vs>;
using vvb = vector<vb>;
int main() {
long double a, b; cin >> a >> b;
cout << (ll)(a * b + EPS) << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll n; cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
a.insert(a.begin(), 0);
a.push_back(0);
vector<ll> ls(n+1);
rep(i, n+1) {
ls[i] = abs(a[i+1] - a[i]);
if (i != 0) ls[i] += ls[i-1];
}
ls.insert(ls.begin(), 0);
rep (i, n) {
ll num = ls[i];
num += abs(a[i+2] - a[i]);
num += ls[ls.size()-1] - ls[i+2];
cout << num << endl;
}
return 0;
}
| 0
| 39,193,782
|
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define INF bit(60)
#define pb push_back
#define mod 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using namespace std;
using uif=uint_fast64_t;
using ll=long long int;
int qp(int a,ll b){int ans=1;do{if(b&1)ans=1ll*ans*a%mod;a=1ll*a*a%mod;}while(b>>=1);return ans;}
int qp(int a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
#define FACSIZE 2002
ll invfac[FACSIZE];
ll fac[FACSIZE];
ll mod_pow(ll ,ll );
ll mod_add(ll ,ll );
ll mod_mul(ll ,ll );
ll mod_div(ll ,ll );
void make_fact(ll );
void make_invfact(ll );
int main(void){
ll ans=0;
using pa=pair<ll,ll>;
ll n,k;
cin>>n>>k;
vector<ll> t(n);
vector<ll> d(n);
priority_queue< pa > pq;
priority_queue< pa,vector<pa>,greater<pa> > pq_remove_cand;
rep(i,n){
cin>>t[i]>>d[i];
pq.push(make_pair(d[i],t[i]));
}
unordered_map<ll,ll> um;
unordered_map<ll,ll> um_kind;
ll score=0;
ll kind=0;
ll score_base=0;
rep(i,k){
auto q=pq.top();
pq.pop();
pq_remove_cand.push(q);
score_base+=q.first;
um[q.second]++;
}
kind=um.size();
score=score_base+kind*kind;
ans=max(ans,score);
while(!pq.empty()){
auto q=pq.top();
pq.pop();
if( um.find(q.second) != end(um) ) continue;
else{
pq_remove_cand.push(q);
um[q.second]++;
while( !pq_remove_cand.empty() ){
auto cq=pq_remove_cand.top();
pq_remove_cand.pop();
if( um[cq.second]>1 ){
um[cq.second]--;
score = score + (kind+1)*(kind+1)-kind*kind + q.first - cq.first ;
ans=max(ans,score);
kind++;
break;
}
}
}
}
cout << ans << endl;
return 0;
}
ll mod_pow(ll x,ll r){
if(r==0) return 1;
else if(r==1) return x%mod;
else if(r%2==0){
ll t=mod_pow(x,r/2)%mod;
return t*t %mod;
}
else{
ll t=mod_pow(x,r/2)%mod;
ll k= t*t %mod;
return k*x%mod;
}
}
ll mod_add(ll a,ll b){
return (a+b)%mod;
}
ll mod_mul(ll a,ll b){
return (a*b)%mod;
}
ll mod_div(ll a,ll b){
return mod_mul(a,mod_pow(b,mod-2));
}
void make_fact(ll n){
fac[0]=1;
rep(i,n){
fac[i+1]=mod_mul(fac[i],i+1);
}
}
void make_invfact(ll n){
invfac[n]= mod_pow( fac[n] ,mod-2);
for(int i=n-1;i>=0;i--){
invfac[i]=mod_mul(invfac[i+1],i+1);
}
}
|
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main() {
int n,m;
cin >> n >> m;
vector<int> c(m);
rep(i,0,m) cin >> c[i];
int dp[21][50001];
rep(i,0,m+1) {
rep(j,0,n+1) {
dp[i][j] = INF;
}
}
rep(i,0,m+1) dp[i][0] = 0;
rep(i,0,m) {
rep(j,0,n+1) {
if(c[i] > j) dp[i+1][j] = dp[i][j];
else dp[i+1][j] = min(dp[i][j], dp[i+1][j - c[i]] + 1);
}
}
cout << dp[m][n] << endl;
return 0;
}
| 0
| 92,466,101
|
#include<iostream>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<cmath>
#include<vector>
#include<map>
#include<random>
#include<sstream>
using namespace std;
int main(){
int n;cin >> n ;
int t,h,o;
t = n/100;
h = n%100/10;
o = n%10;
int m;
if(t == h && t == o){cout << n;}
else{
for(int i = 999;i >= n;i-=111){
m = i;
}
cout << m << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int n;
cin >> n;
int a[300000] {0};
for(int i = 0; i < (1 << n); i++) cin >> a[i];
int fir[300000];
int sec[300000];
bool looked[300000];
for(int i = 0; i < (1 << n); i++) fir[i] = i;
fill(sec, sec + n, (1 << n));
fill(looked, looked + n, false);
queue<int> que;
fir[0] = 0;
looked[0] = true;
que.push(0);
while(que.size()){
int now = que.front();
que.pop();
for(int i = 0; i < n; i++){
int next = (now | (1 << i));
if(next == now) continue;
if(!looked[next]){
looked[next] = true;
que.push(next);
}
if(fir[now] == fir[next]){
if(a[sec[next]] < a[sec[now]]) sec[next] = sec[now];
}
else if(a[fir[next]] < a[fir[now]]){
if(a[fir[next]] < a[sec[now]]) sec[next] = sec[now], fir[next] = fir[now];
else sec[next] = fir[next], fir[next] = fir[now];
}
else{
if(a[sec[next]] < a[fir[now]]) sec[next] = fir[now];
}
}
}
for(int k = 1; k < (1 << n); k++){
int ans = a[fir[k]] + a[sec[k]];
int now = 0;
for(int i = n - 1; i >= 0; i--){
if(k & (1 << i)){
ans = max(ans, a[fir[now + (1 << i) - 1]] + a[sec[now + (1 << i) - 1]]);
now |= (1 << i);
}
}
cout << ans << endl;
}
}
| 0
| 92,238,694
|
#include <stdio.h>
#include<math.h>
int main()
{
double n, x, t, ans, r;
scanf("%lf%lf%lf", &n, &x, &t);
ans = (n*t)/x;
r = ceil(ans/t);
printf("%.0lf\n", r*t);
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void input(string &x,string &y){
cin>>x>>y;
}
int lcs(string x,string y){
vector<vector<int>> tb(vector<vector<int>>((int)x.size()+1,vector<int>(y.size()+1,0)));
for(int i=1;i<(int)x.size()+1;i++){
for(int j=1;j<(int)y.size()+1;j++){
if(x[i-1]==y[j-1]) tb[i][j]=tb[i-1][j-1]+1;
else tb[i][j]=max(tb[i-1][j],tb[i][j-1]);
}
}
return tb[(int)x.size()][(int)y.size()];
}
int main(){
int q;
cin>>q;
string x,y;
for(int i=0;i<q;i++){
input(x,y);
cout<<lcs(x,y)<<endl;
}
return 0;
}
| 0
| 70,679,678
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
#include <cmath>
#include <string>
using namespace std;
long long max(long long a,long long b) {
if(a > b)
return a;
else
return b;
}
long long min(long long a,long long b) {
if(a < b)
return a;
else
return b;
}
long long max_mp(long long x,long long y,long long f) {
long long k = ((-1) * x + y + f + 1) / 2;
k = max(0,min(y-x,k));
return (x + k) * (y + f - k);
}
long long max_k(long long a,long long b) {
if(a == 0)
return 0;
pair<long long,long long> r;
r.first = 0;
r.second = a - 1;
while(r.second - r.first > 1) {
long long mid = (r.first + r.second) / 2;
if(max_mp(1, mid, b) < a * b)
r.first = mid;
else
r.second = mid;
}
if(max_mp(1, r.second, b) < a * b)
r.first = r.second;
else
r.second = r.first;
return r.first;
}
long long solve(long long a,long long b) {
long long ret = 0,x = max_k(a,b),y = max_k(b, a);
ret = x + y + min(a - x - 1,b - y - 1);
return ret;
}
int main(void) {
long long q,a,b;
cin >> q;
for(long long i = 0;i < q;i++) {
cin >> a >> b;
cout << solve(a, b) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_back
#define pf push_front
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define tc int tt; scf(tt); while(tt--)
#define inf INT_MAX
#define ninf INT_MIN
#define gcd __gcd
#define bitcount(n) __builtin_popcount(n)
typedef double dd;
using namespace std;
const ll mod =1e9+7;
const int N = 1e6+7;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
int b[22];
int v,l;
int main()
{
ll ans=0;
int n;
scf(n);
rep(i,1,n+1)
{
scf(v);
rep(k,0,21)
if(1<<k&v)
{
l=max(l,b[k]);
b[k]=i;
}
ans+=(i-l);
}
lprin(ans);
}
| 0
| 54,872,623
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n; cin >> n;
string s; cin >> s;
string t="";
if(n%2!=0){
cout << "No" << endl;
return 0;
}
rep(i,n/2){
t+=s[i];
}
rep(i,t.size()){
if(t[i] != s[i+n/2]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
size_t N;
cin >> N;
vector<long> A(N, 0);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<long> base(N, 0);
for (int i = 0; i < N; ++i)
base[i] = A[i] - (i + 1);
sort(base.begin(), base.end());
long b = base[N / 2];
size_t out(0);
for (auto x : base)
out += static_cast<size_t>(abs(x - b));
cout << out << endl;
}
| 0
| 56,379,848
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int LOGN=20;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<ll> x(n);
for(int i=0;i<n;i++) cin>>x[i];
ll l; int q;
cin>>l>>q;
vector<vector<int>> dp(LOGN,vector<int>(n,0));
for(int i=0;i<n;i++){
auto it=prev(upper_bound(x.begin(),x.end(),x[i]+l));
int j=it-x.begin();
dp[0][i]=j;
}
for(int i=0;i+1<LOGN;i++){
for(int j=0;j<n;j++){
dp[i+1][j]=dp[i][dp[i][j]];
}
}
while(q--){
int a,b;
cin>>a>>b;
a--,b--;
if(a>b) swap(a,b);
int res=0;
for(int i=LOGN-1;i>=0;i--){
if(dp[i][a]<b){
res+=(1<<i);
a=dp[i][a];
}
}
res++;
cout<<res<<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int k,n;
void solve(){
cin>>n>>k;
int st = 1;
for(int i=1;i<=n;i++){
if(st*2<st+k)st*=2;
else st+=k;
}
cout<<st<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--){
solve();
}
return 0;
}
| 0
| 87,621,512
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll MOD = INF + 7;
int main(){
int n;
cin >> n;
VEC(string, s, n);
int head = 0, back = 0, same = 0;
int res = 0;
rep(i, n){
if(s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')same++;
rep(j, s[i].size()){
if(j == 0){
if(s[i][j] == 'B')head++;
}
if(j == s[i].size() - 1){
if(s[i][j] == 'A')back++;
break;
}
if(s[i][j] == 'A' && s[i][j + 1] == 'B')res++;
}
}
res += min(head, back);
if(head == back && back == same && same != 0)res--;
cout << res << endl;
}
|
#include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int N, M;
pair<int,int> PD[10010];
pair<int,int> PD2[10010];
int main() {
while (cin >> N >> M && N) {
int d, p;
for (int i=0; i<N; ++i) {
cin >> d >> p;
PD[i] = make_pair(p, d);
}
sort(PD,PD+N);
for (int i=0;i<N; ++i)
PD2[N-i-1] = PD[i];
int S = 0;
for (int i=0; i<N; ++i)
S += PD2[i].first * PD2[i].second;
for (int i=0; i<N; ++i) {
if (M <= 0) break;
int guarded = min(M,PD2[i].second);
S -= PD2[i].first * guarded;
M -= guarded;
}
cout << S << endl;
}
}
| 0
| 2,150,213
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i = 0;(i) < ((int)(n));++(i))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define test(a) cout<<"line:"<<__LINE__<<"["<<(#a)<<": "<<(a)<<"]"<<endl
const int INF = 1e9+7;
const ll INFL = 9*1e18;
const int dx[8] = {1, 1, 0,-1,-1,-1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0,-1,-1,-1};
ll inline digit(ll num){int tmp = 0;while(num){tmp++;num/=10;}return tmp;}
template<typename T>inline void print(T&& x){cout<<x<<endl;}
template<typename T>inline T SUM(vector<T> vec){return accumulate(all(vec),(T)0);}
template<typename T>inline T digitSum(T num){T sum = 0;while(num){sum+=num%10;num/=10;}return sum;}
template<typename T>inline T gcd(T a,T b){if(b == 0)return a;return gcd(b,a%b);}
template<typename T>inline T lcm(T a, T b){T g = gcd(a,b);return a/g*b;}
template<typename T>inline T power(T a,T b){T tmp=1;rep(i,b){tmp*=a;}return tmp;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int ctoi(char c){return c-'0';}
int main() {
ll a,b;cin>>a>>b;
ll ans = INFL;
if(a <= b){
ans = b-a;
ans = min(ans,1+abs(-a-b));
}else{
if(a >= 0)ans = 1 + abs(-a-b);
ans = min(ans,2+abs(a-b));
}
print(ans);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll t,n,m,i,a,b;
cin>>n;
vector<ll> v(n+1);
for(i=1;i<=n;i++)
{
cin>>v[i];
}
a=1;b=0;
for(i=1;i<=n;i++)
{
if(v[i]==a)
{
b++;
a++;
}
}
if(b==0)
cout<<-1;
else
cout<<n-b;
}
| 0
| 83,422,620
|
#include "iostream"
#include "string"
#include "algorithm"
using namespace std;
int main(int argc, char const *argv[])
{
string str;
int q=0;
string sub1,sub4,rev;
int sub2,sub3;
cin >> str;
cin >> q;
for (int i = 0; i < q; ++i)
{
cin >> sub1;
if (sub1 == "print")
{
cin >> sub2 >> sub3;
cout << str.substr(sub2, sub3-sub2+1) << endl;
}
else if (sub1 == "reverse")
{
cin >> sub2 >> sub3;
rev = str.substr(sub2, sub3-sub2+1);
reverse(rev.begin(), rev.end());
str = str.replace(sub2, rev.size(), rev);
}
else if (sub1 == "replace")
{
cin >> sub2 >> sub3 >> sub4;
str = str.replace(sub2, sub3 - sub2 +1, sub4);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
void chmin(int &a, int b) { if (a > b) a = b; }
int N, A, B, C;
int L[10];
int rec(int i, int a, int b, int c){
if (i==N){
if (a==0 || b==0 || c==0) return 1000000;
else return abs(A-a) + abs(B-b) + abs(C-c);
}
int res = rec(i+1, a, b, c);
chmin(res, rec(i+1, a+L[i], b, c) + (a>0 ? 10:0));
chmin(res, rec(i+1, a, b+L[i], c) + (b>0 ? 10:0));
chmin(res, rec(i+1, a, b, c+L[i]) + (c>0 ? 10:0));
return res;
}
int main(){
cin >> N >> A >> B >> C;
rep(i, N) cin >> L[i];
cout << rec(0,0,0,0) << endl;
}
| 0
| 86,245,124
|
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main() {
string S,S1,S2,ans="Yes";
cin >> S;
bool flag=1;
int N=S.size(),n=(N-1)/2;
rep(i,N/2){
if(S[i]!=S[N-1-i]){
flag=0;
}
}
if(flag){
S1=S.substr(0,n);
S2=S.substr(n+1,n);
rep(i,n/2){
if(S1[i]!=S1[n-1-i]){
flag=0;
}
if(S2[i]!=S2[n-1-i]){
flag=0;
}
}
}
if(!flag) ans="No";
cout << ans << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll n,m; cin >> n >> m;
vector<ll> dp(n+1); vector<bool> isbreak(n+1);
rep(i,m){
ll x; cin >> x;
isbreak[x] = true;
}
if(n == 1){
if(isbreak[1]) cout << 0 << endl;
else cout << 1 << endl;
}
else{
if(isbreak[1] && isbreak[2]){
cout << 0 << endl;
return 0;
}
else if(isbreak[1] && !isbreak[2]){
dp[1] = 0; dp[2] = 1;
}
else if(!isbreak[1] && isbreak[2]){
dp[1] = 1; dp[2] = 0;
}
else{
dp[1] = 1; dp[2] = 2;
}
for(ll i=3; i <= n; i++){
if(isbreak[i]){
continue;
}
else{
dp[i] = dp[i-1] + dp[i-2];
dp[i] = mod(dp[i]);
}
}
cout << dp[n] << endl;
}
}
| 0
| 95,655,426
|
#include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
#include<math.h>
#include <functional>
#include<climits>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<(ll)(n); ++i)
#define mod 1000000007
vector<ll>to[1000005];
int main(){
string a;cin>>a;
for(ll i=0;i<a.size();i+=2)cout<<a[i];
}
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
int m, f, r;
char grade = '\0';
cin >> m >> f >> r;
while( !(m==-1 && f==-1 && r==-1) ) {
if( m==-1 || f==-1 ) grade = 'F';
else if( m+f >= 80 ) grade = 'A';
else if( m+f >= 65 ) grade = 'B';
else if( m+f >= 50 ) grade = 'C';
else if( m+f >= 30 && r >= 50 ) grade = 'C';
else if( m+f >= 30 && r < 50 ) grade = 'D';
else if( m+f < 30) grade = 'F';
cout << grade << endl;
cin >> m >> f >> r;
}
return 0;
}
| 0
| 77,267,504
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
int main() {
int n;
string s, p;
cin >> s;
cin >> p;
s += s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == p[0]) {
for (int j = 0; j < p.size(); j++) {
if (s[i + j] != p[j]) {
break;
}
if (j == p.size() - 1) {
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int p[101010],q[101010];
int main()
{
int h,w,st1=1,st2=1;
long long ans=0;
scanf("%d%d",&h,&w);
for(int i=1;i<=h;i++)
{
scanf("%d",&p[i]);
ans+=p[i];
}
for(int i=1;i<=w;i++)
{
scanf("%d",&q[i]);
ans+=q[i];
}
sort(p+1,p+1+h);
sort(q+1,q+1+w);
while(st1<=h&&st2<=w)
{
if(p[st1]<=q[st2])
{
ans+=(long long)p[st1]*(w-st2+1);
st1++;
}
else
{
ans+=(long long)q[st2]*(h-st1+1);
st2++;
}
}
printf("%lld",ans);
return 0;
}
| 0
| 29,569,806
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
int a;
vector<int> l;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a;
if(l.empty()) l.push_back(a);
else{
if(l.back() < a) l.push_back(a);
else{
l[lower_bound(l.begin(),l.end(),a) - l.begin()] = a;
}
}
}
cout << l.size() << endl;
return 0;
}
|
#include <bits/stdc++.h>
int mod_num = 998244353;
int main(){
int N;
std::cin >> N;
std::vector< int > cnt(N, 0);
int max = 0;
int tmp;
std::cin >> tmp;
if(tmp != 0){
std::cout << 0 << std::endl;
return 0;
}
cnt[0]++;
for(int i=1; i<N; i++){
int tmp;
std::cin >> tmp;
cnt[tmp]++;
if(max < tmp){ max = tmp; }
}
if(cnt[0] != 1){
std::cout << 0 << std::endl;
return 0;
}
long long ans = 1;
for(int i=0; i<max; i++){
for(int j=0; j<cnt[i+1]; j++){
ans = (ans * cnt[i]) % mod_num;
}
}
std::cout << ans << std::endl;
return 0;
}
| 0
| 12,824,342
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int right = 1;
for (int left = 0; left < n; ++left) {
while (right < n && (right <= left || h[right - 1] >= h[right])) {
++right;
}
ans = max(ans, right - left - 1);
if (left == right) ++right;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
string s; cin >> s;
if ((s[0] == s[1] && s[1] == s[2]) ||
(s[1] == s[2] && s[2] == s[3])) {
cout << "Yes" << endl;
}
else cout << "No" << endl;
}
| 0
| 58,709,719
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<ll> mat(n);
ll rsum = 0;
for(int i = 0;i < n; ++i){
cin >> mat[i];
rsum ^= mat[i];
}
for(int i = 0;i < n; ++i){
mat[i] &= (~rsum);
}
ll l = 0;
ll ans = 0;
for(int i = 63;i >= 0; --i){
for(int j = l; j < n; ++j){
if((mat[j] >> i) & 1){
swap(mat[l], mat[j]);
}
}
if(((mat[l] >> i)&1) == 0)continue;
for(int j = 0;j < n; ++j){
if(j == l)continue;
if((mat[j] >> i) & 1){
mat[j] ^= mat[l];
}
}
++l;
if(l >= n)break;
}
for(int i = 0;i < n; ++i){
ans^=mat[i];
}
cout << 2 * ans + rsum << '\n';
}
|
#include <bits/stdc++.h>
using ll = long long;
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__)
#define all(x) (x).begin(), (x).end()
template <typename T> bool chmax(T &a, const T &b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, const T &b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 60;
const long long MOD = 1e9 + 7;
int main() {
ll N, ans = 0;
cin >> N;
if(N % 2 == 1) {
cout << 0 << endl;
} else {
ll den = 10;
while(N >= den) {
ans += N / den;
den *= 5;
}
cout << ans << endl;
}
}
| 0
| 38,938,835
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.