code1
stringlengths 54
12k
| code2
stringlengths 71
12k
| similar
int64 0
1
| __index_level_0__
int64 0
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
vector<int> to[200005];
int ans = 0;
class UnionFind
{
public:
vector<int> Parent;
UnionFind(int N)
{
Parent = vector<int>(N, -1);
}
int root(int A)
{
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
int size(int A)
{
return -Parent[root(A)];
}
bool connect(int A, int B)
{
A = root(A);
B = root(B);
if (A == B)
{
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
int main()
{
int n,m;
cin >> n >> m;
vector<int> p(n);
rep(i,n){
cin >> p[i];
p[i]--;
}
vector<int> x(m), y(m);
UnionFind uf(n);
rep(i,m){
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
uf.connect(p[x[i]], p[y[i]]);
}
rep(i,n){
if(uf.root(i) == uf.root(p[i])){
ans++;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> v1, v2, v3;
for(int i=0; i<N; i++) {
int a, b, c;
cin >> a >> b >> c;
v1.push_back(a);
v2.push_back(b);
v3.push_back(c);
}
for(int i=0; i<N; i++) {
vector<int> triangle;
triangle.push_back(v1[i]);
triangle.push_back(v2[i]);
triangle.push_back(v3[i]);
sort(triangle.begin(), triangle.end());
int r = triangle[0], s = triangle[1], t = triangle[2];
if(t*t == (r*r + s*s)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| 0
| 17,699,879
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
ll modpow(ll x, ll n, ll mod = MAX)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll factorial(ll n)
{
if (n > 0)
return n * factorial(n - 1);
else
return 1;
}
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void Main()
{
ll n, c, k; cin >> n >> c >> k;
vll t(n); rep(i, n) cin >> t[i];
sort(all(t));
ll ans = 0;
ll flag;
for(ll i = 0;i < n;i++)
{
flag = t[i];
ll human = 1;
for(i++;i < n&&human < c&&t[i] <= flag + k;i++)
{
human++;
}
i--;
ans++;
}
fin(ans);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
Main();
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
using namespace std;
const long long int INF = 1000000007;
int main(void)
{
string s, t;
cin >> s >> t;
int N = s.size();
int M = t.size();
int start = -1;
bool include = false;
for (int i = 0; i <= N - M; i++)
{
include = true;
for (int j = 0; j < M; j++)
{
if (s[i + j] == t[j] || s[i + j] == '?')
{
continue;
}
else
{
include = false;
break;
}
}
if (include)
{
start = i;
}
}
if (start == -1)
{
cout << "UNRESTORABLE" << endl;
return 0;
}
for (int i = 0; i < M; i++)
{
s[start + i] = t[i];
}
for (int i = 0; i < N; i++)
{
if (s[i] == '?')
{
s[i] = 'a';
}
}
cout << s << endl;
}
| 0
| 88,422,960
|
#include<stdio.h>
main(){long long n,i;scanf("%lld",&n);for(i=n;--n;)i*=n;printf("%lld\n",i);}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod=1000000007;
const double PI = 3.14159265359;
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define INF 1000000000000
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FOR(i,n) for(int i=0;i<(n);i++)
#define FORA(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);
#define count_1(n) __builtin_popcountll(n)
#define parity(n) __builtin_parityll(n)
void show (int a[], int arraysize) { for (int i = 0; i < arraysize; ++i) {cout << a[i] << " ";} cout<<endl;}
int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b);}
void sieve(int n)
{
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
cout << p << " ";
}
int main()
{FAST
int n,p;
cin>>n>>p;
cout<<(n*3+p)/2<<endl;
return 0;
}
| 0
| 16,690,566
|
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<iostream>
#include<numeric>
#include<cctype>
using namespace std;
void sout(string* a, string* b) {
if (*a > * b) {
string c = *a;
*a = *b;
*b = c;
}
}
int combination(int n, int k) {
if (n > k && k > 0) {
return (combination(n - 1, k) + combination(n - 1, k - 1));
}
else
return 1;
}
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
cout << N / 3 << endl;
return 0;
}
| 0
| 34,413,465
|
#include <cstdio>
int main(){
int i, j, n, u, k, v;
scanf("%d",&n);
int A[n][n];
for(i=0;i<n;i++){
for(j=0;j<n;j++){
A[i][j]=0;
}
}
for(i=0;i<n;i++){
scanf("%d %d",&u,&k);
for(j=0;j<k;j++){
scanf("%d",&v);
A[u-1][v-1] = 1;
}
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("%d",A[i][j]);
if(j<n-1)printf(" ");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
int size = a.length();
int i;
int cnt = 0;
for (i = 0; i < size; i++){
if (a[i] == b[i]) {
cnt++;
}
}
if(cnt == size){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
| 0
| 39,290,787
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
#define all(v) v.begin(),v.end()
int p;
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g=gcd(a,b);
return a/g*b;
}
ll rep_jijo(ll n,ll x){
if(x==0) return 1;
if(x%2==0){
ll t=rep_jijo(n,x/2);
return t*t%p;
}
return n*rep_jijo(n,x-1)%p;
}
ll com(ll n,ll r){
ll x=1,y=1;
ll tmp=n;
while(tmp>=n-r+1){
x=x*tmp%mod;
tmp--;
}
while(r>0){
y=y*r%mod;
r--;
}
return x*rep_jijo(y,mod-2)%mod;
}
int main(){
int n;
ll ans=0;
string s;
cin >> n >> p >> s;
if(p==2){
rep(i,n){
int x=s[i]-'0';
if(x%2==0) ans+=i+1;
}
cout << ans << endl;
}
else if(p==5){
rep(i,n){
int x=s[i]-'0';
if(x%5==0) ans+=i+1;
}
cout << ans << endl;
}
else{
reverse(all(s));
vector<ll>a(n);
rep(i,n) a[i]=(s[i]-'0')*rep_jijo(10,i)%p;
vector<ll>rui(n+1);
rep(i,n+1){
if(i==0) rui[i]=0;
else rui[i]=(rui[i-1]+a[i-1])%p;
}
map<ll,ll>mp;
rep(i,n+1) mp[rui[i]]++;
for(auto p:mp){
ans+=p.second*(p.second-1)/2;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<long long, long long> divide(long long n){
map<long long, long long> res;
for(long long i = 2; i * i <= n; i++){
while(n % i == 0){
res[i]++;
n /= i;
}
}
if(n != 1) res[n] = 1;
return res;
}
int n;
void dfs(vector<int> &ve, int &ans, int ind, int now){
if(ind >= n) return;
if(now == 1){
ans++;
return;
}
if(ve[ind] >= 74 && now % 75 == 0) dfs(ve, ans, ind + 1, now / 75);
if(ve[ind] >= 24 && now % 25 == 0) dfs(ve, ans, ind + 1, now / 25);
if(ve[ind] >= 14 && now % 15 == 0) dfs(ve, ans, ind + 1, now / 15);
if(ve[ind] >= 4 && now % 5 == 0) dfs(ve, ans, ind + 1, now / 5);
if(ve[ind] >= 2 && now % 3 == 0) dfs(ve, ans, ind + 1, now / 3);
dfs(ve, ans, ind + 1, now);
}
int main(){
int N;
cin >> N;
map<long long, long long> m;
for(int i = 2; i <= N; i++){
map<long long, long long> t = divide(i);
for(auto v: t){
m[v.first] += v.second;
}
}
n = (int)m.size();
vector<int> vec(n);
int ind = 0;
for(auto v: m){
vec[ind] = v.second;
ind++;
}
int ans = 0;
dfs(vec, ans, 0, 75);
cout << ans << endl;
}
| 0
| 48,402,067
|
#include <iostream>
using namespace std;
int main() {
int n, mil = 196470;
cin >> n;
for(int i = 0; i < n; i++) {
int y, m, d, ans = mil;
cin >> y >> m >> d;
ans -= (y-1)*39*5 + (y-1)/3*5;
ans -= (m-1)*20;
if(y%3 != 0) ans += (m-1)/2;
ans -= d-1;
cout << ans << endl;
}
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int w, h;
cin >> w >> h;
vector<P> a(w+h);
ll ans = 0;
rep(i,w){
ll p;
cin >> p;
a[i] = P(p, 0);
ans += p * (h + 1);
}
for(int i = w; i < w + h; ++i){
ll q;
cin >> q;
a[i] = P(q, 1);
ans += q * (w + 1);
}
sort(a.begin(), a.end());
int cnt[2] = {};
rep(i,w+h){
P x = a[i];
if(x.second == 0){
++cnt[0];
ans -= x.first * cnt[1];
}
else{
++cnt[1];
ans -= x.first * cnt[0];
}
}
cout << ans << endl;
return 0;
}
| 0
| 47,789,475
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int,int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
const int MOD = 1e9+7;
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0};
void IO(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int MX=1e5+10;
int N,K;
int dp[101][MX];
int32_t main(){
boost;
IO();
cin>>N>>K;
int t[N];
for(int i=0; i<N; i++) cin>>t[i];
for(int i=0; i<=K; i++) dp[0][i]=0;
for(int i=K; i>=K-t[0]; i--) dp[0][i]=1;
for(int i=1; i<=K; i++) dp[0][i]+=dp[0][i-1],dp[0][i]%=MOD;
for(int i=1; i<N; i++) for(int j=0; j<=K; j++){
dp[i][j]+=dp[i-1][min(K,j+t[i])];
if(j) dp[i][j]-=dp[i-1][j-1];
dp[i][j]=(dp[i][j]+MOD)%MOD;
if(j<K) dp[i][j+1]+=dp[i][j]; dp[i][j+1]%=MOD;
}
cout << dp[N-1][0] << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include<set>
using namespace std;
int main()
{
const int M = 1000005;
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<int> cnt(M);
for (int i = 0; i < N; ++i)
{
if (cnt[a[i]] != 0)
{
cnt[a[i]] = 2;
continue;
}
for (int j = a[i]; j < M; j += a[i]) cnt[j]++;
}
int ans = 0;
for (int i = 0; i < N; ++i)
{
if (cnt[a[i]] == 1) ans++;
}
cout << ans << endl;
}
| 0
| 79,384,945
|
#include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
int A, B;
scanf("%d %d", &A, &B);
printf("%d", 6 - A - B);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using garph = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
signed main (){
string s,t;cin>>s>>t;
int c = -1;
if(s.size()<t.size()){
cout<<"UNRESTORABLE"<<nnn;
return 0;
}
rep(i,0,s.size()-t.size()+1){
bool flag = true;
rep(j,i,t.size()+i){
if(s[j]=='?')continue;
if(s[j]!=t[j-i]){
flag=false;
}
}
if(flag)c=i;
}
rep(i,0,s.size()){
if(s[i]!='?')break;
if(i==s.size()-1){
rep(i,0,s.size()-t.size()){
cout<<"a";
}
cout<<t<<nnn;
return 0;
}
}
if(c==-1){
cout<<"UNRESTORABLE"<<nnn;
}else{
rep(i,c,t.size()+c){
s[i]=t[i-c];
}
rep(i,0,s.size()){
if(s[i]=='?'){
s[i]='a';
}
}
cout<<s<<nnn;
}
return 0;
}
| 0
| 27,347,545
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair< int, int > pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
struct aabb {
int x1, y1, x2, y2;
aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
int pow2(int n) { return 1 << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() {
cout << fixed << setprecision(11);
}
};
initializer _____;
int N, M, K, T, Q;
bool check(vector< int > &A, int m) {
vector< int > dp(K, 0);
dp[0] = 1;
rep(i, N) {
if (i == m)
continue;
int a = A[i];
for (int i = K - 1; i >= 0; i--) {
if (i - a >= 0 && dp[i - a] == 1)
dp[i] = 1;
}
}
for (int i = 0; i < A[m]; i++) {
if (dp[K - 1 - i] == 1)
return false;
}
return true;
}
signed main() {
cin >> N >> K;
vector< int > A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
int l = -1, r = N;
while (r - l > 1) {
int m = (l + r) / 2;
if (check(A, m)) {
l = m;
} else {
r = m;
}
}
cout << l + 1 << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
const int INF = 1e9+100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(), (a).end()
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main(){
FIN;
string s,t;
cin >> s >> t;
bool ok = true;
bool flag = false;
for(ll i=s.size()-t.size();i>=0;i--){
ok = true;
for(ll j=0;j<t.size();j++){
if(s[i+j] == '?') continue;
if(s[i+j] == t[j]) continue;
ok = false;
}
if(ok){
for(ll j=0;j<t.size();j++) s[i+j] = t[j];
flag = true;
break;
}
}
if(!flag){
cout << "UNRESTORABLE" << endl;
return 0;
}
for(ll i=0;i<s.size();i++){
if(s[i] == '?') s[i] = 'a';
}
cout << s << endl;
return 0;
}
| 0
| 52,751,473
|
#include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll res = 0, mx = 0;
for (int i = 0; i < N; i++) {
ll A;
cin >> A;
if (i == 0) {
res += A - 1;
mx = 1;
continue;
}
if (A <= mx + 1) {
mx = max(mx, A);
} else {
res += (A - 1) / (mx + 1);
}
}
cout << res << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int H,W;
scanf("%d %d",&H,&W);
for (int k=0;k<10000;k++){
if (H==0 && W==0){
break;
}
else{
for (int i=0;i<=H-1;i++){
for (int j=0;j<=W-1;j++){
printf("#");
}
printf("\n");
}
printf("\n");
scanf("%d %d",&H,&W);
}
}
return 0;
}
| 0
| 68,577,078
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(x) sort(all(x), greater<int>())
#define REV(x) reverse(all(x))
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define LOWitr(x, n) lower_bound(all(x), n)
#define UPRitr(x, n) upper_bound(all(x), n)
#define cii(x) int x;cin >> x
#define cill(x) LL x;cin >> x
#define cis(x) string x;cin >> x
#define co(x) cout << x << endl
#define dump(x) cout << #x << " = " << (x) << endl
#define truecheck assert
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef long long int64;
template<class T,class U>bool chmax(T &a, const U &b) { if (a<b) { a=b; return true; } return false; }
template<class T,class U>bool chmin(T &a, const U &b) { if (b<a) { a=b; return true; } return false; }
const int INF = 1e9, MOD = 1e9 + 7;
const LL LLINF = 1e16;
int main() {
fastcin();
cout << fixed << setprecision(10);
cii(n);
cii(k);
auto ans = (n % k == 0)
?0
:1;
co(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define piii pair<int, pair<int, int>>
#define pll pair<ll, ll>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
string to_string(string s) {
return '"' + s + '"';
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename T>
string to_string(A v) {
bool first = true;
string res = "{";
for (const T &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string((T)x);
}
res += "}";
return res;
}
template<class T>
void println(const vector<T> &data) {
cout << to_string<vector<T>, T>(data) <<endl;
}
template<class T>
void println(const T &data) {
cout << to_string((T)data) << endl;
}
const int MOD = int(1e9+7);
const int oo = int(1e9 + 20);
const ll lloo = (ll)(1e18 + 10);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> values(n);
for(int i = 0; i < n; ++i) {
cin >> values[i];
}
sort(all(values));
int mid, ans = 0;
if(n & 1 ^ 1) {
mid = n / 2;
ans = abs(values[mid] - values[mid-1]);
}
cout << ans << endl;
return 0;
}
| 0
| 71,611,376
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int main(){
ll N, M; cin >> N >> M;
if(N == 1 && M == 1) {
cout << 1 << endl;
} else if(N == 1 || M == 1) {
if(N == 1) cout << M - 2 << endl;
if(M == 1) cout << N - 2 << endl;
} else {
ll res = (N - 2) * (M - 2);
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
ll cnt = 0;
rep(i,N-1){
ll n = (A[i]+A[i+1]) / 2;
cnt += n;
if(A[i+1] == 0){
continue;
}else{
A[i+1] = (A[i]+A[i+1])%2;
A[i] = 0;
}
}
if(N==1){
cnt = A[0]/2;
}
cout << cnt << endl;
}
| 0
| 68,494,189
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
double T, X;
cin>>T>>X;
cout<<setprecision(20)<<T/X<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ar array
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define f(i,n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define pi 3.14159265
#define umii unordered_map<int,int>
#define umci unordered_map<char,int>
#define umsi unordered_map<string,int>
void k_007()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("ip1.txt", "r", stdin);
freopen("op1.txt", "w", stdout);
#endif
}
bool sortbysec(const pair<int, int> &a,
const pair<int, int> &b);
int gcd(int a, int b) ;
int prime(int n);
int power(int x, int y);
int lcm(int a, int b);
int32_t main()
{
k_007();
int n, m;
cin >> n >> m;
int p[m];
string s[m];
f(i, m)
{
cin >> p[i] >> s[i];
}
int corr = 0;
int pen = 0;
map<int, int> wa, ac;
for (int i = 0; i < m; i++)
{
if (ac[p[i]]) continue;
if (s[i] == "AC")
{
corr++;
ac[p[i]] = 1;
pen += wa[p[i]];
}
else
{
wa[p[i]]++;
}
}
cout << corr << " " << pen << endl;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b)
{
return (a.second < b.second);
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int prime(int n) {
int flag = 1;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {flag = 0; break;}
}
return flag;
}
int power(int x, int y)
{
if (y == 0)
return 1;
else if (y % 2 == 0)
return ((power(x, y / 2) % MOD) * ( power(x, y / 2) % MOD)) % MOD;
else
return ((x % MOD) * (power(x, y / 2) % MOD) * (power(x, y / 2) % MOD)) % MOD;
}
int lcm(int a, int b)
{
return (a * b) / gcd(a, b);
}
| 0
| 5,916,569
|
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
using namespace std;
const int N = 1 << 18;
int a[N];
int f[N];
int g[N][2];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", a + i);
}
g[0][0] = 0;
g[0][1] = 0;
f[0] = 0;
for (int i = 1; i < (1 << n); ++i) {
set<int> s;
s.insert(i);
for (int j = 0; j < n; ++j) {
if (i >> j & 1) {
s.insert(g[i ^ 1 << j][0]);
s.insert(g[i ^ 1 << j][1]);
}
}
vector<pair<int, int>> w;
for (int e : s) {
w.emplace_back(a[e], e);
}
sort(w.begin(), w.end());
reverse(w.begin(), w.end());
g[i][0] = w[0].second;
g[i][1] = w[1].second;
f[i] = max(f[i - 1], w[0].first + w[1].first);
printf("%d\n", f[i]);
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
vector<ll> a(1, 1), p(1, 1);
ll f(ll n, ll x)
{
if (n == 0)
{
if (x <= 0)
{
return 0;
}
else
{
return 1;
}
}
else if (x <= 1 + a[n - 1])
{
return f(n - 1, x - 1);
}
else
{
return p[n - 1] + 1 + f(n - 1, x - 2 - a[n - 1]);
}
}
int main()
{
ll n, x;
cin >> n >> x;
for (int i = 0; i < n; i++)
{
a.push_back(a[i] * 2 + 3);
p.push_back(p[i] * 2 + 1);
}
cout << f(n, x) << endl;
return 0;
}
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
}
| 0
| 49,290,510
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,coun=0;
cin>>n;
ll sum=n+100;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
coun++;
ll x= n/i;
if(i+x<sum)sum=(i+x);
}
}
if(coun==0)
cout<<n-1<<endl;
else{
cout<<sum-2<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
int w1, w2, h1, h2;
w1=0; w2=w; h1=0; h2=h;
for (int i=0; i<n; i++){
int x, y, a;
cin >> x >> y >> a;
if (a==1)
w1 = max(x,w1);
if (a==2)
w2 = min(x,w2);
if (a==3)
h1 = max(y,h1);
if (a==4)
h2 = min(y,h2);
}
int width = max(w2-w1,0);
int height = max(h2-h1,0);
cout << width * height << endl;
}
| 0
| 64,882,385
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
string s;
cin >> s;
string a = "";
int n = 0;
rep(i,s.size()){
if(s[i] == '1')a += '1';
else if(s[i] == '0')a += '0';
else if(a.empty())continue;
else a.erase(a.begin()+a.size()-1);
}
cout << a << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<deque>
#define INF 1e8
using namespace std;
long long int K;
int main(void) {
cin>>K;
vector<int> d(K,INF);
vector<bool> used(K,0);
d[1] = 1;
deque<int> q;
q.push_front(1);
while(!q.empty()) {
int current = q.front();
q.pop_front();
if(used[current]) continue;
used[current] = 1;
int next = (current+1) % K;
if(d[next] > d[current] + 1) {
d[next] = d[current] + 1;
q.push_back(next);
}
next = (current*10) % K;
if(d[next] > d[current]) {
d[next] = d[current];
q.push_front(next);
}
}
cout<<d[0]<<endl;
return 0;
}
| 0
| 82,611,475
|
#include <iostream>
#include <string>
#include <algorithm>
#include <ctime>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cassert>
#include <bitset>
#include <list>
#include <cstdio>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <cmath>
#include <tuple>
#include <cassert>
#include <array>
#include <iomanip>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ti = tuple<int, int, int>;
const double eps=1e-14;
const int mod = 1e9 + 7;
const int inf = ((1<<28));
const ll linf = (1LL<<58);
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
for(int i=0; i<s.size(); i++)
{
if(i%2==0) cout << s[i];
}
return 0;
}
|
#include <iostream>
#include<vector>
using namespace std;
int main() {
int a, b, c, index = 1;
cin >> a >> b >> c;
vector<bool> df(b-1);
while (true) {
int amari = a * index % b;
if (amari == c) {
cout << "YES" << endl;
return 0;
} else if (df[amari]) {
cout << "NO" << endl;
return 0;
} else {
df[amari] = true;
index++;
}
}
}
| 0
| 7,135,001
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,k,m,ans=0;
cin>>n>>m;
vector<string> a(n);
for(i=0;i<n;i++)
{
cin>>a[i];
}
vector<vector<ll> > dp(n,vector<ll>(m,0));
if(a[0][0]=='#')
dp[0][0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(i==0&&j==0)
continue;
if(j==0)
{
if(a[i][j]=='.')
dp[i][j]=dp[i-1][j];
else {
if(a[i-1][j]=='#')
dp[i][j]=dp[i-1][j];
else dp[i][j]=dp[i-1][j]+1;
}
}
else if(i==0)
{
if(a[i][j]=='.')
dp[i][j]=dp[i][j-1];
else {
if(a[i][j-1]=='#')
dp[i][j]=dp[i][j-1];
else dp[i][j]=dp[i][j-1]+1;
}
}
else
{
if(a[i][j]=='.')
{
dp[i][j]=min(dp[i-1][j],dp[i][j-1]);
}
else
{
int tmp1=1,tmp2=1;
if(a[i-1][j]=='#')
tmp1=0;
if(a[i][j-1]=='#')
tmp2=0;
dp[i][j]=min(dp[i-1][j]+tmp1,dp[i][j-1]+tmp2);
}
}
}
}
cout<<dp[n-1][m-1]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll n;cin>>n;
string s;cin>>s;
ll ans=0;
rep(i,1000){
ll a=i/100,b=(i-a*100)/10,c=i%10;
bool flag1=false,flag2=false,flag3=false;
rep(j,n){
if(flag2 && c==s[j]-'0') flag3=true;
if(flag1 && b==s[j]-'0') flag2=true;
if(a==s[j]-'0') flag1=true;
}
if(flag3) ans++;
}
cout<<ans<<endl;
}
| 0
| 50,982,801
|
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
ll ss[MAXX];
int main()
{
FAST;
ll n;
cin >> n;
ll ans = 0;
for(ll i = 105; i <= n; i+= 2){
ll x = 0;
for(ll j = 1; j * j < i; j++){
if(i % j == 0){
x += 2;
}
}
if(floor(sqrt(i)) == ceil(sqrt(i))){
x ++;
}
if(x == 8 && i % 2){
ans ++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
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;
}
long long modinv(long long a, long long mod){
return modpow(a, mod-2, mod);
}
const int max_fac = 2 * 1e6;
long long fac[max_fac], finv[max_fac], inv[max_fac];
void ComInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < max_fac; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long Comb(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
ComInit();
int x,y;
cin >> x >> y;
int cnt_1 = 0;
long long ans = 0;
bool flag = 0;
while(!flag){
long long cur_x = cnt_1;
long long cur_y = 2 * cnt_1;
if(cur_x > x || cur_y > y) break;
long long res_x = x - cur_x;
long long res_y = y - cur_y;
if(res_y * 2 == res_x){
int cnt_2 = res_y;
ans += Comb(cnt_1+cnt_2, cnt_1);
ans %= MOD;
}
cnt_1 ++;
}
cout << ans << endl;
return 0;
}
| 0
| 40,055,060
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<int> s;
s.insert(n);
int x = 0;
for(int i=2; ; i++) {
if(n%2 == 0) n /= 2;
else n = 3*n + 1;
x = s.size();
s.insert(n);
if(x == s.size()) {
cout << i << endl;
break;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORD(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define INF 1e18
#define MOD 1e9+7
template<class T> bool chmax(T &a, const T & b) {
if (a<b) {
a = b;
return true;
}
return false;
}
template<class T> bool chmin(T &a, const T & b) {
if (a>b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 110;
ll dp[MAX_N][MAX_N];
int p[MAX_N];
ll rec(int i, int j) {
if (dp[i][j] >= 0) return dp[i][j];
if (i == j) return dp[i][j] = 0;
ll res = INF;
FOR(k, i, j) {
chmin(res, rec(i, k)+rec(k+1, j)+p[i-1]*p[k]*p[j]);
}
return dp[i][j] = res;
}
int main() {
int n;
cin >> n;
int r, c;
REP(i, n) {
cin >> r >> c;
p[i] = r;
}
p[n] = c;
REP(i, n+1) {
REP(j, n+1) {
dp[i][j] = -1;
}
}
cout << rec(1, n) << endl;
return 0;
}
| 0
| 3,506,149
|
#include <bits/stdc++.h>
using namespace std;
using ll= long long;
using vi = vector<int>;
using vl= vector<ll>;
using vs=vector<string>;
ll gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a);}
ll max(ll a, ll b) {if (a > b) return a; else return b;}
ll min(ll a, ll b) {if (a < b) return a; else return b;}
ll power(ll a,ll b) {ll i,p=1; for(i=0;i<b;i++){p*=a;} return p;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase=1;
for(int p=0;p<testcase;p++){
ll n=0,a=0,b=0;
cin>>n>>a>>b;
ll y=0;
y=n%(a+b);
ll e=n/(a+b);
ll bb=e*a;
bb+=min(y,a);
cout<<bb;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void main_sub(void);
int main(int argc, char *argv[]) {
cout << std::fixed << std::setprecision(12);
main_sub();
return 0;
}
using i64 = int64_t;
#ifndef USE_STRICT_INT
#define int i64
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = (1 << 30);
constexpr i64 INFL = (1LL << 62);
constexpr i64 MOD = 1000000007;
struct V {
double x, y;
V(double x = 0, double y = 0) : x(x), y(y) {}
V &operator+=(const V &v) {
x += v.x;
y += v.y;
return *this;
}
V operator+(const V &v) const { return V(*this) += v; }
double dot(const V &v) const { return v.x * x + v.y * y; }
double cross(const V &v) const { return x * v.y - v.x * y; }
int ort() const {
if (y > 0) {
return x > 0 ? 1 : 2;
} else {
return x > 0 ? 4 : 3;
}
}
double norm2() const { return x * x + y * y; }
double norm() const { return sqrt(norm2()); }
bool operator<(const V &v) const {
int o = ort(), vo = v.ort();
if (o != vo) return o < vo;
return cross(v) > 0;
}
friend ostream &operator<<(ostream &os, const V &v) {
os << "(" << v.x << ", " << v.y << ")";
return os;
}
friend istream &operator>>(istream &is, V &v) {
is >> v.x >> v.y;
return is;
}
};
void main_sub(void) {
int n;
cin >> n;
vector<V> v(n);
rep(i, n) cin >> v[i];
sort(all(v));
double ans = 0;
rep(l, n) {
int r = l;
V now;
rep(i, n) {
now += v[r];
ans = max(ans, now.norm());
r = (r + 1) % n;
}
}
cout << ans << endl;
return;
}
| 0
| 78,877,203
|
#include<iostream>
#include<stdio.h>
#include<string>
#include<stdlib.h>
using namespace std;
long long n;
long long *T;
void insert(long long a){
for(long long i = 0; i < n; i++){
long long j = (((a % n) + i * (1 + a % (n - 1))) % n);
if(T[j] == '\0'){
T[j] = a;
break;
}
}
}
string findx(long long a){
for(long long i = 0; i < n; i++){
long long j = (((a % n) + i * (1 + a % (n - 1))) % n);
if(T[j] == a){
return "yes";
}
else if(T[j] == '\0'){
return "no";
}
}
}
int main(){
cin >> n;
string s, x;
long long cnt = 0;
string *yn = new string[n];
T = new long long[n];
for(long long i = 0; i < n; i++){
cin >> s >> x;
long long a = 0, b = 1;
for(long long i = 0; i < (long long)x.size(); i++){
if(x[i] == 'A'){
a = a + 1 * b;
}
else if(x[i] == 'C'){
a = a + 2 * b;
}
else if(x[i] == 'G'){
a = a + 3 * b;
}
else if(x[i] == 'T'){
a = a + 4 * b;
}
b = b * 10;
}
if(s == "insert"){
insert(a);
}
else if(s == "find"){
yn[cnt] = findx(a);
cnt++;
}
}
for(long long i = 0; i < cnt; i++){
cout << yn[i] << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X) {
if (N == 0) return 0;
vector<int> Y(N);
for (int i = 0; i < N; i++) cin >> Y[i];
int ANS = -1, NOW = 0;
for (int i = 0; i <= 10000; i++) {
if (X == Y[NOW]) NOW++;
if (NOW == N) {
ANS = i;
break;
}
X = (X * A + B) % C;
}
cout << ANS << endl;
}
}
| 0
| 60,421,611
|
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>
#include <omp.h>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
typedef pair<long long int, pll> lpll;
const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323;
long long int H,W,N,C,K,B[200020],res[200][200]={},mymin[200],mymax[200],now=INF,t=0,bus=0;
string S[102];
deque<pll>deq;
int main(){
cout << fixed << setprecision(18);
cin>>H>>W;
for(long long int i = 0; i < H; i++){
cin>>S[i];
for(long long int j = 0; j < W; j++){
res[i][j]=INF;
}
}
if(S[0][0]=='#'){res[0][0]=1;}
else{res[0][0]=0;}
deq.push_front({0,0});
while(!deq.empty()){
pll tmp=deq.front();
deq.pop_front();
if(tmp.first==H-1&&tmp.second==W-1){cout<<res[H-1][W-1]<<endl;return 0;}
if(tmp.first<H-1){
if(S[tmp.first+1][tmp.second]=='.'){
if(res[tmp.first+1][tmp.second]>res[tmp.first][tmp.second]){deq.push_front({tmp.first+1,tmp.second});
res[tmp.first+1][tmp.second]=res[tmp.first][tmp.second];}
}else if(S[tmp.first][tmp.second]=='.'&&S[tmp.first+1][tmp.second]=='#'){
if(res[tmp.first+1][tmp.second]>res[tmp.first][tmp.second]+1){deq.push_back({tmp.first+1,tmp.second});
res[tmp.first+1][tmp.second]=res[tmp.first][tmp.second]+1;}
}else{
if(res[tmp.first+1][tmp.second]>res[tmp.first][tmp.second]){deq.push_front({tmp.first+1,tmp.second});
res[tmp.first+1][tmp.second]=res[tmp.first][tmp.second];}
}
}
if(tmp.second<W-1){
if(S[tmp.first][tmp.second+1]=='.'){
if(res[tmp.first][tmp.second+1]>res[tmp.first][tmp.second]){deq.push_front({tmp.first,tmp.second+1});
res[tmp.first][tmp.second+1]=res[tmp.first][tmp.second];}
}else if(S[tmp.first][tmp.second]=='.'&&S[tmp.first][tmp.second+1]=='#'){
if(res[tmp.first][tmp.second+1]>res[tmp.first][tmp.second]+1){deq.push_back({tmp.first,tmp.second+1});
res[tmp.first][tmp.second+1]=res[tmp.first][tmp.second]+1;}
}else{
if(res[tmp.first][tmp.second+1]>res[tmp.first][tmp.second]){deq.push_front({tmp.first,tmp.second+1});
res[tmp.first][tmp.second+1]=res[tmp.first][tmp.second];}
}
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max((x),(y))
#define mins(x,y) x=min((x),(y))
#define show(x) cout<<#x<<" = "<<(x)<<endl;
#define all(a) ((a).begin()),((a).end())
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define bit(n) (1LL<<(n))
typedef long long ll;
typedef __int128_t lll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>using P=pair<T,Y>;
template<class T,class Y>ostream& operator<<(ostream&o,P<T,Y>&p){return o<<"("<<p.fi<<","<<p.se<<")";}
template<class T>ostream& operator<<(ostream&o,V<T>&v){for(T&t:v)o<<t<<",";return o;}
template<class T>void uniq(V<T>&v){sort(all(v));v.erase(unique(all(v)), v.end());}
lll gcd(lll a,lll b,lll&x,lll&y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return(x%m+m)%m;}
ll modPow(lll a,lll n,ll m){lll p=1;for(;n;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return p;}
V<ll>Fac,Rac;void setF(int n,int mod){Fac=Rac=V<ll>(++n);Fac[0]=1;FOR(i,1,n)Fac[i]=Fac[i-1]*i%mod;Rac[n-1]=modInv(Fac[n-1],mod);FORR(i,n-1,1)Rac[i-1]=Rac[i]*i%mod;}
ll comb(int a,int b,int m){return a<b||b<0?0:Fac[a]*Rac[b]%m*Rac[a-b]%m;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
bool ask(ll a){
cout << "? " << a << endl << flush;
string s;
cin >> s;
return s[0]=='Y';
}
void ans(ll a){
cout << "! " << a << endl << flush;
exit(0);
}
main(){
cin.tie(0);
ios::sync_with_stdio(false);
if(ask(1e10)){
ll a = 1e9;
FOR(_, 0, 9){
if(!ask(a-1)) ans(a);
a /= 10;
}
ans(1);
}
ll l, r, m;
l=0;
r=9;
while(r-l>1){
m = (l+r)/2;
if(ask(modPow(10, m, LINF))){
l = m;
}else{
r = m;
}
}
l = modPow(10, l, LINF);
r = l*10;
while(r-l>1){
m = (l+r)/2;
if(!ask(m*10)){
l = m;
}else{
r = m;
}
}
ans(r);
}
| 0
| 51,125,680
|
typedef long long ll;
typedef long double ld;
#define mod 1000000007
#define INF 1000000000
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<ll> leaf(n + 1);
for (int i = 0; i <= n; ++i) {
cin >> leaf[i];
}
if (leaf[0] >= 2) {
cout << -1 << '\n';
return 0;
}
vector<ll> sum(n + 2);
for (int i = 1; i <= n + 1; ++i) {
sum[i] = sum[i - 1] + leaf[i - 1];
}
vector<ll> n_leaf(n + 1);
n_leaf[0] = 1 - leaf[0];
for (int i = 1; i <= n; ++i) {
n_leaf[i] = (2LL * n_leaf[i - 1]) - leaf[i];
n_leaf[i] = min(n_leaf[i], sum[n + 1] - sum[i + 1]);
if (n_leaf[i] < 0) {
cout << -1 << '\n';
return 0;
}
}
ll ans = 0;
for (int i = 0; i <= n; ++i) {
ans += leaf[i] + n_leaf[i];
}
cout << ans << '\n';
return 0;
}
|
#include <iostream>
int main()
{
int H,W,x,y,r;
bool in;
std::cin >> W;
std::cin >> H;
std::cin >> x;
std::cin >> y;
std::cin >> r;
if (x < 0 || x > W || y < 0 || y > H) {
in = false;
} else if ((y - r) < 0 || (y + r) > H) {
in = false;
} else if ((x - r) < 0 || (x + r) > W) {
in = false;
} else {
in = true;
}
if (in) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
}
| 0
| 29,422,436
|
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int h,w;
char arr[105][105];
int memo[105][105];
int f(int x,int y){
if(x==h && y==w){
return arr[h][w]=='#';
}
if(memo[x][y]!=-1) return memo[x][y];
int res=100000000;
if(arr[x][y]=='.'){
if(x<h){
res=min(res,f(x+1,y));
}
if(y<w){
res=min(res,f(x,y+1));
}
}
else{
if(x<h){
res=min(res,f(x+1,y)+ ((arr[x+1][y]=='.') ? 1:0));
}
if(y<w){
res=min(res,f(x,y+1)+ ((arr[x][y+1]=='.') ? 1:0));
}
}
return memo[x][y]=res;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>h>>w;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin>>arr[i][j];
}
}
memset(memo,-1,sizeof(memo));
cout<<f(1,1)<<endl;
}
|
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const ll MOD = 1000000007;
const ll INF = 10e12;
using namespace std;
ll f1(ll tate, ll yoko)
{
if (tate < 3 || yoko < 3)
return INF;
else
{
ll l1 = tate / 3, l2 = tate / 3, l3 = tate / 3;
if (tate % 3 == 1)
l1++;
else if (tate % 3 == 2)
l1++, l2++;
return yoko * abs(l1 - l3);
}
}
ll f2(ll tate, ll yoko)
{
ll res = INF;
if (tate % 2 == 1)
swap(tate, yoko);
for (ll i = 1; i < yoko - 1; ++i)
{
ll s1, s2;
s1 = tate * i;
s2 = (tate / 2) * (yoko - i);
res = min(res, abs(s1 - s2));
}
return res;
}
ll f3(ll tate, ll yoko)
{
ll res = INF;
for (ll i = 1; i < min(yoko, tate); ++i)
{
ll s1, s2, s3;
s1 = i * i;
s2 = i * (yoko - i);
s3 = yoko * (tate - i);
ll mx = max(s1, max(s2, s3));
ll mn = min(s1, min(s2, s3));
res = min(res, mx - mn);
}
return res;
}
int main(void)
{
ll h, w;
cin >> h >> w;
ll ans = INF;
ans = min(ans, min(f1(h, w), f1(w, h)));
if (h % 2 == 0 || w % 2 == 0)
ans = min(ans, min(f2(h, w), f2(w, h)));
ans = min(ans, f3(h, w));
cout << ans << endl;
}
| 0
| 86,824,213
|
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int ctoi(char c) {
switch (c)
{
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default:
cout << "ERR_ctoi" << endl;
return -1;
}
}
int main() {
int n;
cin >> n;
if (n < 1200) {
PRI("ABC");
}
else if (n < 2800) {
PRI("ARC");
}
else PRI("AGC");
return 0;
}
|
#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 = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
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;
}
}
int main(){
double pi = 3.14159265358979;
double A,B,X;
cin >> A >> B >>X;
dou H = X / A / A;
if(H * 2 >= B){
dou N = 2 * B - 2 * H;
dou res = atan(N / A);
printf("%.10f\n",res / pi * 180);
}
else{
dou N = A * B / X * B / 2;
dou res = atan(N);
printf("%.10f\n",res / pi * 180);
}
}
| 0
| 24,727,118
|
#include<stdio.h>
int main(){
int n,i=0,j,a;
while(0==0){
scanf("%d",&n);
if(n==0){
break;
}
printf("Case %d: %d\n",i+1,n);
i++;
}
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
struct edge{ ll to,cost,flag; };
bool used[500010];
ll V;
vector<edge> G[500010];
ll d[500010];
void dijkstra(ll s){
fill(d,d+V+1,inf);
d[s]=0;
priority_queue<pair<ll,l_l>,vector<pair<ll,l_l>>,greater<pair<ll,l_l>>> que;
que.push(make_pair(0,l_l(0,s)));
while(!que.empty()){
pair<ll,l_l> p=que.top();que.pop();
ll v=p.second.second;
if(d[v]<p.first)continue;
used[p.second.first]=true;
rep(i,0,G[v].size()-1){
edge e=G[v][i];
if(d[e.to]>d[v]+e.cost){
d[e.to]=d[v]+e.cost;
que.push(make_pair(d[e.to],l_l(e.flag,e.to)));
}
}
}
}
int main(){
ll n;cin>>n;
ll m;cin>>m;
ll a[m],b[m],c[m];
V=m;
rep(i,1,m){
cin>>a[i]>>b[i]>>c[i];
edge e;
e.to=b[i];e.cost=c[i];e.flag=i;
G[a[i]].pb(e);
e.to=a[i];e.cost=c[i];e.flag=i;
G[b[i]].pb(e);
}
rep(i,1,n){
dijkstra(i);
}
ll ans=0;
rep(i,1,m){
if(!used[i])ans++;
}
cout<<ans<<endl;
return 0;
}
| 0
| 33,644,537
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
set<string> se;
signed main()
{
bool valid = true;
int N;
cin >> N;
string prev;
cin >> prev;
se.insert(prev);
REP(i, N - 1)
{
string s;
cin >> s;
if (CONTAINS_SET(se, s)) valid = false;
se.insert(s);
if (prev.back() != s.front()) valid = false;
prev = s;
}
YesNo(valid);
}
|
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <climits>
#include <cmath>
#include <algorithm>
#include <cassert>
#define TEST_ASSERT(msg, cond) do { if (cond) { cout << msg << " => pass" << endl;} else { cout << msg << " => failed" << endl;} } while(0)
using namespace std;
int convertSec(const string& str) {
int h = 10 * (str[0] - '0') + (str[1] - '0');
int m = 10 * (str[3] - '0') + (str[4] - '0');
int s = 10 * (str[6] - '0') + (str[7] - '0');
return 3600 * h + 60 * m + s;
}
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) break;
vector<int> table(23 * 3600 + 59 * 60 + 59, 0);
for (int i = 0; i < n; i++) {
string s, e;
cin >> s >> e;
table[convertSec(s)]++;
table[convertSec(e)]--;
}
for (int i = 0; i < table.size(); i++) {
if (i != 0) table[i] += table[i - 1];
}
int maxValue = 0;
for (int i = 0; i < table.size(); i++) {
if (table[i] > maxValue) maxValue = table[i];
}
cout << maxValue << endl;
}
return 0;
}
| 0
| 79,478,737
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);++i)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;--i)
#define FOR(i,s,n) for(int i = s;i < (int)n;++i)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;--i)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
template<class T>inline void out(T t){cout<<t<<"\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout<<t<<" ";out(ts...);}
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;}
constexpr int INF = 1e18;
signed main(){
int N,K;
cin >> N >> K;
vector<int>a(N);
REP(i,N){
cin >> a[i];
}
int ans = INF;
REP(i,1ll << N){
if(__builtin_popcountll(i) != K)continue;
int now = 0;
int cost = 0;
REP(j,N){
if(i & (1ll << j)){
cost += max(0ll,now - a[j] + 1);
now = max(a[j],now + 1);
}else{
if(now >= a[j])continue;
cost += a[j] - now;
now = max(now,a[j]);
}
}
CHMIN(ans,cost);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, m; cin >> n >> m;
int q; cin >> q;
vector<vector<int>> l(n), r(m);
for (; q; q--) {
int x, y; cin >> x >> y; x--; y--;
l[x].push_back(y); r[y].push_back(x);
}
int mxl = l[0].size();
for (int i = 1; i < n; i++) mxl = max(mxl, (int)l[i].size());
int mxr = r[0].size();
for (int i = 0; i < m; i++) mxr = max(mxr, (int)r[i].size());
vector<int> lft, rght;
for (int i = 0; i < n; i++) {
sort(l[i].begin(), l[i].end());
if (l[i].size() == mxl) lft.push_back(i);
}
for (int i = 0; i < m; i++) {
sort(r[i].begin(), r[i].end());
if (r[i].size() == mxr) rght.push_back(i);
}
bool fl = false;
for (auto i : lft) {
int x = 0, y = 0;
while (x < l[i].size() && y < rght.size()) {
if (l[i][x] < rght[y]) x++;
else {
if (l[i][x] != rght[y]) {
fl = true; break;
}
y++;
}
}
if (y != rght.size()) fl = true;
if (fl) break;
}
if (fl) cout << mxl + mxr << endl;
else cout << mxl + mxr - 1 << endl;
return 0;
}
| 0
| 14,788,444
|
#include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
int main(){
LL K, A, B;
cin >> K >> A >> B;
if(A + 2 >= B){
cout << 1 + K << endl;
return 0;
}
if((K+1)/(A+2) == 0){
cout << 1 + K << endl;
return 0;
}
LL ans = B;
LL count = A + 1;
ans += (K - count) / 2 * (B - A);
ans += (K - count) % 2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL<<60;
ll gcd(ll a,ll b){
if(b == 0) return a;
else return gcd(b,a%b);
}
bool is_prime[1000010];
int main() {
int n;
cin >> n;
vector<int> p(n),q(n),tmp(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 0; i < n; ++i) {
cin >> q[i];
}
for (int i = 1; i <= n; ++i) {
tmp[i-1] = i;
}
int cnt = 0,ansp,ansq;
do{
if(p == tmp){
ansp = cnt;
}
cnt++;
}while(next_permutation(tmp.begin(),tmp.end()));
sort(tmp.begin(),tmp.end());
cnt = 0;
do{
if(q == tmp){
ansq = cnt;
}
cnt++;
}while(next_permutation(tmp.begin(),tmp.end()));
cout << abs(ansp-ansq) << endl;
return 0;
}
| 0
| 21,583,009
|
#include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#include <stdio.h>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int long long
#ifdef int
const long long INF = LLONG_MAX / 10;
#else
const int INF = 1010101010;
#endif
using namespace std;
typedef long long ll;
typedef vector<vector<ll> > mat;
typedef pair<int, int> P;
const int dx[9] = {-1, 0, 0, 1, -1, -1, 1, 1, 0};
const int dy[9] = {0, -1, 1, 0, -1, 1, -1, 1, 0};
int x, y;
const int Z = 8003;
const int N = 2 * Z + 1;
bool dp[2][2][N];
char s[N];
signed main() {
scanf("%s", s);
scanf("%lld%lld", &x, &y);
int n = strlen(s);
dp[0][0][Z] = dp[1][0][Z] = 1;
int pos = 0;
while (pos < n && s[pos] == 'F') {
pos++;
x--;
}
int t = 0;
while (pos < n) {
pos++;
t ^= 1;
int L = 0;
while (pos < n && s[pos] == 'F') {
pos++;
L++;
}
REP(i,N) dp[t][1][i] = 0;
REP(i,N) {
if (!dp[t][0][i]) continue;
dp[t][1][i-L] = dp[t][1][i+L] = 1;
}
REP(i,N) dp[t][0][i] = dp[t][1][i];
}
if (dp[0][0][Z+x] && dp[1][0][Z+y]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int pop[24*3600+5];
inline int ss(char c) { return c-'0'; }
int stoi(string s) {
return (ss(s[0])*10+ss(s[1]))*3600 + (ss(s[3])*10 + ss(s[4]))*60
+ ss(s[6])*10 + ss(s[7]);
}
int main() {
int n;
string s,t;
while(cin>>n, n) {
memset(pop, 0, sizeof(pop));
for(int i=0; i<n; ++i) {
cin>>s>>t;
int ts = stoi(s), tt = stoi(t);
for(int i=ts; i<tt; ++i) pop[i]++;
}
int ans = 0;
for(int i=0; i<=24*3600; ++i) ans = max(ans, pop[i]);
cout<<ans<<endl;
}
}
| 0
| 15,859,001
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << (a+b-1)/b*c << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long x[3];
for(int i=0;i<3;i++)
cin>>x[i];
for(int i=0;i<2;i++){
if(x[i]-x[2]>0){
x[i]-=x[2];x[2]=0;}
else
{x[2]=x[2]-x[i];x[i]=0;}
}
cout<<x[0]<<" "<<x[1]<<endl;
return 0;}
| 0
| 89,362,281
|
#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
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
int gcd(int a, int b){
if(b == 0) return a;
else return gcd(b, a%b);
}
long long lcm (int a, int b){
return (long long) a*b /gcd(a,b);
}
int main(){
int N;
string S;
cin >> N >> S;
int ans = 0;
for(int i = 0; i< N ;){
while(S[i] == S[i+1] && i+1 < N){
i++;
}
ans +=1;
i++ ;
}
cout << ans << endl;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const int mod = 1000000007;
int main() {
int N; cin >> N;
vector< pair<string, int> > v(N);
string s; int t;
for (int i = 0; i < N; i++) {
cin >> s >> t;
v[i] = make_pair(s, t);
}
cin >> s;
int ans = 0;
int isfind = false;
for (int i = 0; i < N; i++) {
if (isfind)
ans += v[i].second;
else
if (v[i].first == s)
isfind = true;
}
cout << ans << '\n';
}
| 0
| 90,968,469
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int h, w;
int main() {
cin>>h>>w;
ll ans = (ll)h*(ll)w;
if (h >= 3) {
if (h%3 == 0) ans = min(ans, 0LL);
else {
ans = min(ans, (ll)w);
}
}
if (w >= 3) {
if (w%3 == 0) ans = min(ans, 0LL);
else {
ans = min(ans, (ll)h);
}
}
for (int j = 1; j < w; ++j) {
vector<ll> xs;
xs.clear();
xs.push_back((ll)j * (ll)h);
if (h % 2 == 0) {
xs.push_back((ll)(w-j) * (ll)h / 2);
} else {
xs.push_back((ll)(w-j) * (ll)(h / 2));
xs.push_back((ll)(w-j) * (ll)((h+1)/2));
}
sort(xs.begin(), xs.end());
ans =min(ans, (ll)(xs.back()-xs[0]));
}
for (int i = 1; i < h; ++i) {
vector<ll> xs;
xs.clear();
xs.push_back((ll)i * (ll)w);
if (w % 2 == 0) {
xs.push_back((ll)(h-i) * (ll)w / 2);
} else {
xs.push_back((ll)(h-i) * (ll)(w / 2));
xs.push_back((ll)(h-i) * (ll)((w+1)/2));
}
sort(xs.begin(), xs.end());
ans = min(ans, (ll)(xs.back()-xs[0]));
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
long long n,i,array[10000],max,min,total=0;
cin >> n;
for(i = 0; i < n; i++){
cin >> array[i];
}
max = array[0];
min = array[0];
for(i = 0; i < n; i++){
if(max < array[i]) max = array[i];
if(min > array[i]) min = array[i];
total += array[i];
}
cout << min << " " << max << " " << total << endl;
return 0;
}
| 0
| 65,303,892
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N - 1);
vector<int> C(N - 2);
cin >> A.at(0);
int ans = abs(A.at(0));
for (int i = 1; i < N; i++) {
cin >> A.at(i);
B.at(i - 1) = abs(A.at(i) - A.at(i - 1));
ans += B.at(i - 1);
}
ans += abs(A.at(N -1));
for (int i = 0; i < N - 2; i++) {
C.at(i) = abs(A.at(i + 2) - A.at(i));
}
cout << ans - B.at(0) - abs(A.at(0)) + abs(A.at(1)) << endl;
for (int i = 1; i < N - 1; i++) {
int memo = ans;
memo -= (B.at(i - 1) + B.at(i));
memo += C.at(i - 1);
cout << memo << endl;
}
cout << ans - B.at(N - 2) - abs(A.at(N - 1)) + abs(A.at(N - 2)) << endl;
}
|
#pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#define NPN(V) next_permutation(ALL(V))
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define yes(n) cout << ((n) ? "yes" : "no" ) << endl
#define Yay(n) cout << ((n) ? "Yay!": ":(") << endl
#define RAPID cin.tie(0);ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a,b,c) (a) < (b) && (b) < (c)
#define MIDe(a,b,c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a,b) cin >> a >> b
#define IN3(a,b,c) cin >> a >> b >> c
#define IN4(a,b,c,d) cin >> a >> b >> c >> d
#define VIN(V) for(int i = 0; i < (V).size(); i++) {cin >> (V).at(i);}
#define OUT(n) cout << n << endl
#define VOUT(V) REP(i, (V).size()) {cout << (V)[i] << endl;}
#define VOUT2(V) REP(i, (V).size()) {cout << (V)[i] << " ";} cout<<endl;
#define FIX cout << fixed << setprecision(15)
#define int long long
#define P pair<ll,ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll,ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue<ll,V,greater<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;}
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a,int b){return b != 0 ? gcd(b, a % b) : a;}
int lcm(int a, int b){return a * b / gcd(a, b);}
string toStrUp(string str){char diff = 'A'-'a';REP(i,str.size()) str[i] += diff;return str;}
string gCh(string str, int key){return str.substr(key,1);}
signed main() {
RAPID;
int n=0,m=0,a=0,b=0,c=0,d=0,x=0,y=0,z=0;
string s="",t="";
Vi N(4);
VIN(N)
SORT(N);
YES(N[0]==1 && N[1]==4 && N[2]==7 && N[3]==9);
}
| 0
| 30,601,964
|
#include <stdio.h>
#include <string>
#include <stdlib.h>
#include<vector>
#include<iostream>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
long long int divide(long long int h,long long w){
if(h %2 == 0){
return (h/2)*w;
}
if(w %2 == 0){
return (w/2)*h;
}
long long int mi = min(h,w);
long long int ma = max(h,w);
return (ma/2)*mi;
}
long long int calcRes(long long int rect1,long long int rect2,long long int rect3){
long long int ma = max(rect1,max(rect2,rect3));
long long int mi = min(rect1,min(rect2,rect3));
return ma - mi;
}
int main() {
int h,w;
cin >> h >> w;
cout << (h-1)*(w-1) <<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,j;
cin>>n>>j;
unordered_map<int,vector<int>> m;
for(int i=0;i<j;i++)
{
int a,b;
cin>>a>>b;
m[a].push_back(b);
m[b].push_back(a);
}
vector<int> ans(n+1,0);
int count=0;
queue<int> q;
q.push(1);
while(!q.empty())
{
int s=q.size();
for(int k=0;k<s;k++)
{
int front=q.front();
q.pop();
int a=m[front].size();
for(int i=0;i<a;i++)
{
if(ans[m[front][i]]!=0||m[front][i]==1)
continue;
ans[m[front][i]]=front;
count++;
q.push(m[front][i]);
}
}
}
if(count!=n-1)
{
cout<<"No"<<endl;
}else
{
cout<<"Yes"<<endl;
for(int i=2;i<=n;i++)
{
cout<<ans[i]<<endl;
}
}
}
| 0
| 48,648,359
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc064_d.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N;
string S;
cin >> N >> S;
int tr = 0, tl = 0;
int d = 0, x = 0;
rep(i, N) {
if (S[i] == '(') d++;
else
d--;
x = min(d, x);
}
tr = -x;
tl = d - x;
rep(i, tr) { cout << '('; }
cout << S;
rep(i, tl) { cout << ')'; }
}
|
#include <iostream>
using namespace std;
int main(){
int n,s,j,k;
int a[11][46];
for(int s=0;s<46;s++)
for(int n=0;n<11;n++)
a[n][s]=0;
n=s=0;
for(int i=0;i<1024;i++){
for(j=i,n=0;j>0;j/=2)
n += j%2;
for(j=i,s=0,k=0;j>0;j/=2,k++)
s += j%2*k;
a[n][s]++;
}
while(true){
cin>>n>>s;
if(!n&&!s)
break;
if(s<46)
cout<<a[n][s]<<endl;
else
cout<<0<<endl;
}
return 0;
}
| 0
| 47,783,873
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b?gcd(b, a%b):a;}
ll lcm(ll a, ll b) { return a*b/gcd(a,b);}
ll MOD=1000000007;
int main(){
int n;cin>>n;
vector<string> s(n);
vi t(n);
rep(i,n){
cin>>s.at(i)>>t.at(i);
}
string x;cin>>x;
bool fl=false;
int ans=0;
rep(i,n){
if(fl){
ans+=t.at(i);
}
if(s.at(i)==x) fl=true;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x).end()
#define sq(x) ((x)*(x))
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define EQ(a,b) (abs((a)-(b))<eps)
template<class T> void chmin(T& a,const T& b){if(a>b)a=b;}
template<class T> void chmax(T& a,const T& b){if(a<b)a=b;}
#define MOD 1000000007ll
struct ModInt{
ll val;
ModInt():val(0ll){}
ModInt(ll v):val(((v%MOD)+MOD)%MOD){}
ModInt exp(ll y)const{
if(!y)return ModInt(1ll);
ModInt a = exp(y/2ll);
a *= a;
if(y&1)a*=(*this);
return a;
}
bool operator==(const ModInt& x)const{return val==x.val;}
inline bool operator!=(const ModInt& x)const{return !(*this==x);}
bool operator<(const ModInt& x)const{return val<x.val;}
bool operator>(const ModInt& x)const{return val>x.val;}
inline bool operator>=(const ModInt& x)const{return !(*this<x);}
inline bool operator<=(const ModInt& x)const{return !(*this>x);}
ModInt& operator+=(const ModInt& x){if((val+=x.val)>=MOD)val-=MOD;return *this;}
ModInt& operator-=(const ModInt& x){if((val+=MOD-x.val)>=MOD)val-=MOD;return *this;}
ModInt& operator*=(const ModInt& x){(val*=x.val)%=MOD;return *this;}
ModInt operator+(const ModInt& x)const{return ModInt(*this)+=x;}
ModInt operator-(const ModInt& x)const{return ModInt(*this)-=x;}
ModInt operator*(const ModInt& x)const{return ModInt(*this)*=x;}
};
istream& operator>>(istream&i,ModInt&x){i>>x.val;return i;}
ostream& operator<<(ostream&o,const ModInt&x){o<<x.val;return o;}
ModInt pow(ModInt a,ll x){
ModInt res = ModInt(1ll);
while(x){
if(x&1)res *= a;
x >>= 1;
a = a*a;
}
return res;
}
const int SIZE = 100100;
ModInt inv[SIZE+10],fac[SIZE+10],facinv[SIZE+10];
ModInt nCr(int n,int r){
if(n<r)return ModInt(0ll);
if(n<0||r<0)return ModInt(0ll);
return fac[n]*facinv[r]*facinv[n-r];
}
void init(){
fac[0]=ModInt(1ll);
for(int i=1;i<=SIZE;i++)fac[i]=fac[i-1]*ModInt(i);
inv[1]=ModInt(1ll);
for(int i=2;i<=SIZE;i++)inv[i]=ModInt(0ll)-ModInt(MOD/i)*inv[MOD%i];
facinv[0]=ModInt(1ll);
for(int i=1;i<=SIZE;i++)facinv[i]=facinv[i-1]*inv[i];
return;
}
int n;
int a[100100];
int b[100100];
int main(){
init();
cin >> n;
for(int i=0;i<n+1;i++)cin >> a[i];
memset(b,-1,sizeof(b));
int A,B,C;
for(int i=0;i<n+1;i++){
if(b[a[i]]!=-1){
A = b[a[i]];
B = i-b[a[i]]-1;
C = n-i;
break;
}
b[a[i]]=i;
}
for(int i=1;i<=n;i++){
ModInt ans;
ans += nCr(n-1,i);
ans += nCr(n-1,i-1)*ModInt(2ll);
ans += nCr(n-1,i-2);
ans -= nCr(A+C,i-1);
cout << ans << endl;
}
cout << 1 << endl;
return 0;
}
| 0
| 67,962,274
|
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<functional>
#include<stack>
using namespace std;
int main() {
int m, f, r;
while (cin >> m >> f >> r) {
if (m < 0 && f < 0 && r < 0)break;
if (m < 0 || f < 0)cout << "F" << endl;
else {
if (m + f >= 80)cout << "A" << endl;
else if (m + f >= 65)cout << "B" << endl;
else if (m + f >= 50 || r >= 50)cout << "C" << endl;
else if (m + f >= 30)cout << "D" << endl;
else cout << "F" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for (int x = 1; x <= n; x++)
{
int s = 0;
int y = x;
while (y > 0)
{
s += y % 10;
y /= 10;
}
if (a <= s & s <= b)
{
ans += x;
}
}
cout << ans << endl;
return 0;
}
| 0
| 88,384,821
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
template<typename T>
long long modpow(const T n,const T p,const T mod);
template<typename T>
long long modinv(const T n,const T mod);
template<typename T>
bool chmax(T &a,const T &b);
template<typename T>
bool chmin(T &a,const T &b);
long long inf=1000000007;
int main(){
long long n;
cin>>n;
vector<long long> zero(62,0),one=zero;
for(long long i=0;i<n;i++){
long long hoge;
cin>>hoge;
bitset<62> bit=hoge;
for(long long i=0;i<62;i++){
if(bit.test(i)) one.at(i)++;
else zero.at(i)++;
}
}
long long ans=0;
long long two=1;
for(long long i=0;i<62;i++){
ans+=(two*zero.at(i))%inf*one.at(i);
ans%=inf;
two*=2;
two%=inf;
}
cout<<ans<<endl;
return 0;
}
template<typename T>
long long modpow(const T n,const T p,const T mod){
if(p==0) return 1;
if(p%2==0){
long long a=modpow(n,p/2,mod);
return a*a%mod;
}
if(p%2==1) return (modpow(n,p-1,mod)*n)%mod;
cerr<<"ERROR"<<endl;
return 1;
}
template<typename T>
long long modinv(const T n,const T mod){
return modpow(n,mod-2,mod);
}
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;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 100000000;
int main() {
string S;
ll K;
cin >> S >> K;
int cnt = 0;
char word = ' ';
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1') {
cnt++;
} else {
word = S[i];
break;
}
}
if (word == ' ') {
cout << 1 << endl;
} else {
if (K <= cnt) {
cout << 1 << endl;
} else {
cout << word << endl;
}
}
return 0;
}
| 0
| 26,248
|
#include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
int main(){
int count[26] = {};
char ch;
while( cin >> ch){
if( isalpha(ch)){
ch = tolower(ch);
count[ch - 'a'] += 1;
}
}
for(int i=0; i<26; i++){
printf("%c : %d\n", i+'a', count[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
int __stoi(string s){ return atoi(s.c_str()); }
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
template<class T> void chmax(T& a, T b){ if(a<b){a=b;} }
template<class T> void chmin(T& a, T b){ if(a>b){a=b;} }
const ll MOD = 1e9+7;
#define pii pair<int,int>
#define pll pair<ll,ll>
bool func(pii a,pii b){
return a.first>b.first;
}
int main(){
int N; cin>>N;
int l = 0;
int r = N-1;
string s,t,u;
cout << l << endl;
cin >> s;
if(s=="Vacant"){ return 0;}
cout << r << endl;
cin >> t;
if(t=="Vacant"){ return 0;}
REP(i,30){
int m = (l+r)/2;
cout << m << endl;
cin >> u;
if(u=="Vacant"){break;}
if( u==s && (m-l)%2==1){
t = u;
r = m;
}else if( u!=s && (m-l)%2==0){
t = u;
r = m;
}else{
s = u;
l = m;
}
}
}
| 0
| 23,121,658
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c,d;
cin>>a>>b>>c>>d;
std::deque<int> deq(10,0);
deq[a]=1;
deq[b]=1;
deq[c]=1;
deq[d]=1;
if (deq[1]==1&&deq[9]==1&&deq[7]==1&&deq[4]==1) {
cout<<"YES"<<endl;
} else {
cout<<"NO"<<endl;
}
}
|
#include <iostream>
int main() {
for( int i = 1 ; i <= 10000 ; i++ ) {
int x ;
std::cin >> x ;
if( x != 0 ) {
std::cout << "Case " << i << ": " << x << std::endl ;
} else {
break ;
}
}
}
| 0
| 98,924,455
|
#include <bits/stdc++.h>
using namespace std;
int A[128];
char B[1001];
int conv(const string &a) {
int res = 0;
for(int i = 0; i < a.size(); ++i) {
int d = 1;
if(isdigit(a[i])) {
d = a[i++] - '0';
}
res += d * A[a[i]];
}
return res;
}
string conv(const int x) {
string res;
for(int i = 1000; i >= 1; i /= 10) {
int d = x / i % 10;
if(!d) continue;
if(d > 1) res += (char)(d + '0');
res += B[i];
}
return res;
}
int main() {
A['m'] = 1000;
A['c'] = 100;
A['x'] = 10;
A['i'] = 1;
B[1000] = 'm';
B[100] = 'c';
B[10] = 'x';
B[1] = 'i';
int n; cin >> n;
while(n--) {
string a, b;
cin >> a >> b;
cout << conv(conv(a) + conv(b)) << endl;
}
return 0;
}
|
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
double N; cin >> N;
double M; cin >> M;
double d; cin >> d;
double D;
if (d == 0) {
D = N;
} else {
D = (N-d)*2;
}
double ans = ((M-1)*D)/(N*N);
cout << setprecision(15) << ans << endl;
return 0;
}
| 0
| 57,731,257
|
#include <bits/stdc++.h>
using namespace std;
int main(){long n,m=1e9+7,i=26;vector<int>a(26,0);cin>>n;string s;cin>>s;while(n--)a[s[n]-'a']++;n=1;while(i--)n=n*(a[i]+1)%m;cout<<n-1;}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
int H,W,D;
cin >> H >> W >> D;
int A[H][W];
int X[H * W],Y[H * W];
rep(i,H){
rep(j,W){
cin >> A[i][j];
Y[A[i][j] - 1] = i;
X[A[i][j] - 1] = j;
}
}
int Z[H * W];
for(int i=0;i<D;i++){
Z[i] = 0;
for(int j=i+D;j<W*H;j+=D){
Z[j] = Z[j-D] + abs(X[j] - X[j-D]) + abs(Y[j] - Y[j-D]);
}
}
int Q;
cin >> Q;
rep(i,Q){
int L,R;
cin >> L >> R;
cout << Z[R-1] - Z[L-1] << endl;
}
return 0;
}
| 0
| 26,455,338
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll>
#define m_p make_pair
#define V vector<ll>
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
ll n,cnt,ans,a,b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
int main(void){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin>>a>>b;
if(a+b==15)Cout("+");
else if(a*b==15)Cout("*");
else Cout("x");
return 0;
}
|
#include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
string x;
cin >> x;
for (int j = 97; j <= 122; j++) {
bool a = 0;
for (int i = 0; i < x.size(); i++) {
if (char(j) == x[i]) {
a = 1;
continue;
}
}
if (a == 0) {
cout << char(j);
return 0;
}
}
cout << "None";
return 0;
}
| 0
| 37,348,118
|
#include<iostream>
#include<string>
using namespace std;
int main()
{
string a,b;
cin >> a >> b;
if(a<b)
cout << "<" << endl;
else if(a>b)
cout << ">" << endl;
else
cout << "=" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define MAX 1000000000
#define INF 1000000
#define M 1000000007
#define PI 2 * acos(0.0)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
bool is_palindrome(string s){
ll j = s.length()-1;
ll i = 0;
while(i < j){
if(s[i] != s[j]){
return false;
}
i++;
j--;
}
ll n = s.length();
ll o = ((n-1)/2) - 1;
i = 0;
while(i < o){
if(s[i] != s[o]) return false;
i++;
o--;
}
ll r = (n+3)/2 - 1;
j = n-1;
while(r < j){
if(s[r] != s[j]) return false;
r++;
j--;
}
return true;
}
int main(){
fast_io
string s;
cin>>s;
if(is_palindrome(s) == true){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
}
| 0
| 25,497,746
|
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, n) for (int i = a; i <= (n); ++i)
int main() {
int X, t; cin >> X >> t;
cout << max(X - t, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
using namespace __gnu_pbds;
using ordered_set =
tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;typedef pair<int, int> pii;
typedef vector<int> vi;typedef long double ld;
template<class T>
using min_heap = priority_queue<T,vector<T>,greater<T>>;
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
template<typename T>
void remdup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)), v.end());
}
template<typename T> void re(vector<T> &v) {trav(i,v) cin >> i;}
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
#ifdef np
#include "C:\Users\navodit\Desktop\mycodes\pr.h"
#else
#define trace(...)
#endif
#define MOD 1000000007
void solve(){
int k , n ;
cin >> k >> n ;
vi v(n) ; re(v);
vi dif ;
rep(i,1,n){
dif.pb(v[i] - v[i-1]);
}
dif.pb(v[0]-v[n-1]+k);
int tot = accumulate(all(dif),0);
int ans = MOD ;
trav(i,dif){
ans = min(ans,tot-i);
}
cout << ans << endl;
}
signed main() {
unsyncIO();
int tt =1 ;
rep(i,0,tt) solve();
#ifdef np
cout <<endl<<endl<< "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| 0
| 77,934,922
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
string s;
set<char>S;
cin>>s;
for(int i=0;i<3;i++)
{
S.insert(s[i]);
}
if(S.size()==3)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main()
{
ll N;
cin >> N;
REP(i, N)
{
cin >> A[i];
}
ll x = 2;
ll sum = A[0] - 1;
FOR(i, N, 1)
{
ll s = (A[i] - 1) / x;
sum += s;
if (A[i] == x)
x++;
}
cout << sum << endl;
return 0;
}
| 0
| 50,949,375
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pw(x) (1LL << (x))
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"
#define db3(x, y, z) cerr << "(" << #x << ", " << #y << ", " << #z << ") = (" << x << ", " << y << ", " << z << ")\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x;
cin >> x;
cout << (x < 1200 ? "ABC" : "ARC") << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll gcd(int x, int y){ return y?gcd(y, x%y):x;}
ll lcm(ll x, ll y){ return (x*y)/gcd(x,y);}
int main()
{
int n, m;
cin >> n >> m;
vector<int> p(n);
rep(i, m){
int a, b; cin >> a >> b;
a--; b--;
p[a]++; p[b]++;
}
bool even = true;
rep(i, n){
if (p[i]%2!=0) even=false;
}
if(even) cout << "YES" << endl;
else cout << "NO" << endl;
}
| 0
| 29,651,480
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<string> &o) {
string a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
vector<int> abc(3);
rep(i, 3) cin >> abc[i];
sort(abc.begin(), abc.end());
bool b = abc[0] == abc[2];
cout << (b ? "Yes" : "No") << endl;
}
|
#include<iostream>
#include<string>
#define rep(i,start,n) for(int i=0 ; i < n ; i++)
using namespace std;
int main(){
int count[26]={0};
int x=0;
string sentence;
while(getline(cin,sentence)){
x = sentence.length();
rep(i , 0 , sentence.size()){
char c = tolower(sentence[i]);
count[c-'a']++;
}
}
rep( i , 0 , 26 ){
cout << char(i+'a') << " : " << count[i] << endl;
}
return 0;
}
| 0
| 20,753,548
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
signed main() {
int N;
cin >> N;
int ans = N * (N + 1) * (N + 2) / 6;
rep(i, N - 1) {
int l, r;
cin >> l >> r;
if (l > r)swap(l, r);
ans -= l * (N + 1 - r);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define gcd(a,b) __gcd((a),(b))
typedef pair<int,int> pii;
typedef vector<int> vi;
signed main()
{
fastio;
int a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int n;
cin>>n;
cout<<a[n-1]<<endl;
}
| 0
| 19,637,785
|
#include<bits/stdc++.h>
using namespace std;
int main(){
char c;
map<char, int> S;
for(int i = 0; i < 4; i++){
cin >> c;
S[c]++;
}
if(S.size() == 2 && S[c] == 2){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 100000000000000000
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define _it iterator
#define all(_x) _x.begin(),_x.end()
#define f first
#define s second
#define pb push_back
void mahakal(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
freopen("error.txt","w",stderr);
#endif
}
void solve(){
ll h1 , m1 , h2 , m2 , k;
cin>> h1 >> m1 >> h2 >> m2 >> k ;
ll time ;
if(m1>m2){
h2--;m2+=60;
time=(h2-h1)*60 + (m2 -m1);
}
else{
time=(h2-h1)*60+(m2-m1);
}
cout<<max(time-k,0LL)<<endl;
}
int main(){
ll t=1 ;
while(t--)solve();
return 0;
}
| 0
| 9,084,982
|
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,area ;scanf("%d %d",&a,&b);area=(a-1)*(b-1);printf("%d",area);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main() {
int n, m;
cin >> n;
vector<string> vec_n(n);
rep(i, n) cin >> vec_n[i];
cin >> m;
vector<string> vec_m(100);
rep(i, m) cin >> vec_m[i];
int max = -100;
rep(i, n){
int cnt = 0;
rep(j, n){
if(vec_n[i] == vec_n[j]) cnt++;
}
rep(j, m){
if(vec_n[i] == vec_m[j]) cnt--;
}
if(cnt > max) max = cnt;
}
if(max < 0){
cout << 0 << endl;
}else cout << max << endl;
}
| 0
| 17,735,846
|
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 1000000007;
ll power(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x *= x; p /= 2; } else { a *= x; p--; } }return a; }
ll mpower(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x = x * x % mod; p /= 2; } else { a = a * x % mod; p--; } }return a; }
ll c(ll n, ll k) { ll a = 1; rep(i, 1, k) { a *= n - i + 1; a /= i; }return a; }
ll mc(ll n, ll m) { ll k = 1, l = 1; rep(i, n - m + 1, n + 1) k = k * i % mod; rep(i, 1, m + 1) l = l * i % mod; l = mpower(l, mod - 2); return k * l % mod; }
int main(void) {
int n, k, c = 1;
string s;
cin >> n >> k >> s;
s.push_back('2');
deque<int> l;
if (s[0] == '1')l.push_back(0);
rep(i, 0, s.size() - 1) {
if (s[i] == s[i + 1]) {
c++;
}
else {
l.push_back(c);
c = 1;
}
}
int sum = 0, ans = 0;
l.push_front(0);
l.push_back(0);
l.push_back(0);
rep(i, 0, min(2 * k + 1, (int)l.size())) {
sum += l[i];
}
ans = sum;
for (int i = 2; i + 2 * k < (int)l.size() - 1; i += 2) {
sum += l[i + 2 * k] + l[i + 2 * k - 1] - l[i - 1] - l[i - 2];
ans = max(ans, sum);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
const int N = 1005;
const int inf = 1e9;
#define singleCase
int h,n,a[N],b[N],dp[N][10005];
int f(int cur , int health) {
if (health <= 0) return 0;
if (cur > n) return inf;
int &sol = dp[cur][health];
if (sol != -1) return sol;
return sol = min(f(cur + 1 , health) , f(cur , health - a[cur]) + b[cur]);
}
void work() {
in(h); in(n);
for (int i = 1 ; i <= n ; i++) {
in(a[i]); in(b[i]);
}
memset (dp , -1 , sizeof dp);
printf("%d\n" , f(1 , h));
return;
}
int main() {
#ifdef multipleCase
int nQ; in(nQ);
while (nQ--)
work();
#endif
#ifdef singleCase
work();
#endif
return 0;
}
void in(int &x) {
bool neg = false;
register int c;
x = 0;
c = getchar();
if(c == '-') {
neg = true;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar())
x = (x << 1) + (x << 3) + c - 48;
if (neg) x *= -1;
}
| 0
| 48,546,487
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int cnt[210000];
for(int i = 0; i < N; i++) {
int a;
cin >> a;
cnt[a-1]++;
}
sort(cnt, cnt+N);
int ans = 0;
for(int i = 0; i < N - K; i++) {
ans += cnt[i];
}
cout << ans << endl;
}
|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
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;
}
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
long long g = GCD(a, b);
return a / g * b;
}
int main() {
int N, M;
cin >> N >> M;
set<ll> A, evens;
REP(i, N) {
ll a;
cin >> a;
a /= 2;
A.insert(a);
int p = 1;
while(a % 2 == 0) {
a /= 2;
p++;
}
evens.insert(p);
}
if(evens.size() > 1) {
cout << 0 << endl;
return 0;
}
ll lcm = *A.begin();
for(ll a: A) {
lcm = LCM(a, lcm);
if(lcm > M) {
cout << 0 << endl;
return 0;
}
}
if(lcm > M) {
cout << 0 << endl;
} else {
cout << (M/lcm - 1) / 2 + 1 << endl;
}
return 0;
}
| 0
| 93,704,059
|
#include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
typedef long long ll;
int main() {
int w, h;
cin >> w >> h;
vector<pair<ll, char>> vp;
rep(i, w) {
int p;
cin >> p;
vp.eb(mp(p, 'p'));
}
rep(i, h) {
int q;
cin >> q;
vp.eb(mp(q, 'q'));
}
sort(all(vp));
int pcnt = h + 1;
int qcnt = w + 1;
ll ans = 0;
rep(i, vp.size()) {
if (vp[i].S == 'p') {
ans += vp[i].F * pcnt;
qcnt--;
} else {
ans += vp[i].F * qcnt;
pcnt--;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N;
cin >> N;
vector<pll> P(N);
REP(i,0,N) {
ll a;
cin >> a;
P[i] = {a, i+1};
}
ASC(P);
FORR(p,P) PS(p.second);
PR("");
return 0;
}
| 0
| 28,862,300
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string s1, s2;
s1 = s.replace(5, 1, " ");
s2 = s1.replace(13, 1, " ");
cout << s2 << endl;
}
|
#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
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() {
string s, t;
cin >> s >> t;
int ans = INF;
rep(i, s.size() - t.size() + 1) {
int cnt = 0;
rep(j, t.size()) {
if (s[i + j] != t[j]) {
cnt++;
}
}
ans = min(ans, cnt);
}
if (ans == INF) cout << 0 << endl;
else cout << ans << endl;
}
| 0
| 37,869,098
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, p;
cin >> a >> p;
p += a*3;
cout << p/2 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int* A = new int[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
int mini = i;
for (int j = i+1; j < N; j++) {
if (A[j] < A[mini]) {
mini = j;
}
}
if (i != mini) {
int tmp = A[i];
A[i] = A[mini];
A[mini] = tmp;
cnt++;
}
}
cout << A[0];
for (int i = 1; i < N; i++) {
cout << " " << A[i];
}
cout << endl;
cout << cnt << endl;
return 0;
}
| 0
| 84,429,174
|
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
string card, card_next;
int m;
int h;
while(1) {
getline(cin, card);
if(card == "-") break;
scanf("%d", &m);
int i = 0;
char nl;
for(i = 0; i < m; i++) {
scanf("%d%c", &h, &nl);
card_next = card.substr(h, card.size()) + card.substr(0, h);
card = card_next;
}
cout << card << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vvi g;
ll ans=0;
void dfs(int i,ll dep){
for(ll x:g[i]){
ans+=dep;
dfs(x,dep+1);
}
}
int main(){
ll n;cin>>n;
vp v(n);
rep(i,n)cin>>v[i].fi;
rep(i,n)v[i].se=i;
sort(all(v));
vi par(n),sz(n,1);
g=vvi(n);
for(int i=n-1;i>0;i--){
ll nx=v[i].fi-n+2*sz[i];
ll k=lb(v,P(nx,-1));
if(v[k].fi!=nx)dame(-1);
sz[k]+=sz[i];
par[i]=k;
g[k].pb(i);
}
dfs(0,1);
if(ans!=v[0].fi)dame(-1);
REP(i,1,n)cout<<v[i].se+1<<' '<<v[par[i]].se+1<<endl;
}
| 0
| 31,461,171
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n, m;
cin >> n >> m;
vector<pair<int, int>> s(n);
rep (i, n)
cin >> s[i].first >> s[i].second;
ll ans = 0;
int index = 0, cnt = 0;
sort(s.begin(), s.end());
rep (i, m)
{
++cnt;
if (cnt > s[index].second)
{
index++;
cnt = 1;
}
ans += s[index].first;
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end())
#define Reverse(vec) reverse(vec.begin(), vec.end())
#define Next_permutation(vec) next_permutation(vec.begin(), vec.end())
#define PI acos(-1)
typedef long long ll;
int gcd(int x, int y) {
int r = y % x;
if (r == 0) return x;
else return gcd(r, x);
}
int main() {
int N, X;
cin >> N >> X;
vector<int> ans(N);
Rep(i, N) {
int x;
cin >> x;
ans[i] = abs(X - x);
if (i) ans[i] = gcd(ans[i - 1], ans[i]);
}
cout << ans[N - 1] << endl;
return 0;
}
| 0
| 11,626,810
|
#include <iostream>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;
const int kNil = -1;
const int kMaxV = 110;
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_type w;
bool operator<(const Edge<T> & rhs) const {
if (w != rhs.w) { return w < rhs.w; }
if (u != rhs.u) { return u < rhs.u; }
return v < rhs.v;
}
};
template <class Edge>
decltype(auto) BellmanFord(vector<Edge> & edges,
typename vector<Edge>::size_type node_num,
typename vector<Edge>::size_type source) {
using size_type = typename vector<Edge>::size_type;
using w_type = typename Edge::w_type;
const w_type kInf = numeric_limits<w_type>::max();
w_type weight_sum{};
vector<w_type> dist(node_num, kInf);
vector<int> parent(node_num, kNil);
dist[source] = 0;
for (unsigned i = 0; i < node_num - 1; ++i) {
for (const auto & e: edges) {
if (dist[e.v] > dist[e.u] + e.w && dist[e.u] != kInf) {
dist[e.v] = dist[e.u] + e.w;
parent[e.v] = e.u;
}
}
}
for (const auto & e: edges) {
if (dist[e.v] > dist[e.u] + e.w && dist[e.u] != kInf) {
return make_pair(false, dist);
}
}
return make_pair(true, dist);
}
template <class Edge>
decltype(auto) Dijkstra(const vector<Edge> & edges,
typename vector<Edge>::size_type node_num,
typename vector<Edge>::size_type source) {
using size_type = typename vector<Edge>::size_type;
using w_type = typename Edge::w_type;
const w_type kInf = numeric_limits<w_type>::max();
bitset<kMaxV> bs;
vector<vector<Edge>> adjacency_list(node_num, vector<Edge>());
for (const auto & e: edges) {
adjacency_list[e.u].push_back(e);
}
vector<w_type> dist(node_num, kInf);
vector<int> parent(node_num, kNil);
dist[source] = 0;
using Pair = pair<size_type, w_type>;
auto compare = [](const Pair & x, const Pair & y) {
return y.second < x.second || (!(x.second < y.second) && y.first < x.first);
};
priority_queue<Pair, vector<Pair>, decltype(compare)> que(compare);
que.emplace(source, 0);
while (!que.empty()) {
auto top_no = que.top().first;
auto top_dist = que.top().second;
que.pop();
bs.set(top_no);
for (const auto & e: adjacency_list[top_no]) {
const auto cost = dist[e.u] + e.w;
if (dist[e.v] > cost && !bs.test(e.v)) {
dist[e.v] = cost;
parent[e.v] = e.u;
que.emplace(e.v, cost);
}
}
}
return dist;
}
template <class Edge>
decltype(auto) Johnson(const vector<Edge> & edges,
typename vector<Edge>::size_type node_num) {
using size_type = typename vector<Edge>::size_type;
using w_type = typename Edge::w_type;
const w_type kInf = numeric_limits<int>::max();
bool has_cycle = false;
++node_num;
auto new_edges(edges);
for (unsigned i = 0; i < node_num - 1; i++) {
new_edges.emplace_back(node_num - 1, i, 0);
}
auto bellman_ford_result = BellmanFord(new_edges, node_num, node_num - 1);
has_cycle = !bellman_ford_result.first;
auto h = bellman_ford_result.second;
vector<vector<w_type>> adjacency_matrix(node_num, vector<w_type>(node_num, kInf));
for (auto & e: new_edges) {
e.w += h[e.u] - h[e.v];
}
vector<vector<w_type>> dist(node_num - 1, vector<w_type>(node_num - 1, kInf));
for (unsigned i = 0; i < node_num - 1; ++i) {
auto dist_single = Dijkstra(new_edges, node_num, i);
for (unsigned j = 0; j < node_num - 1; ++j) {
if (dist_single[j] == kInf) { continue; }
dist[i][j] = dist_single[j] + h[j] - h[i];
}
}
return make_pair(!has_cycle, dist);
}
int main(int argc, char const *argv[]) {
using w_type = int;
const w_type kInf = numeric_limits<w_type>::max();
vector<Edge<w_type>> edges;
unsigned V, E;
cin >> V >> E;
for (unsigned i = 0; i < E; ++i) {
unsigned u, v;
w_type w;
cin >> u >> v >> w;
edges.emplace_back(u, v, w);
}
auto ans = Johnson(edges, V);
auto have_neg_cycle = !ans.first;
auto dist = ans.second;
if (have_neg_cycle) {
cout << "NEGATIVE CYCLE\n";
} else {
for (unsigned i = 0; i < V; ++i) {
for (unsigned j = 0; j < V; ++j) {
if (dist[i][j] == kInf) {
cout << "INF";
} else {
cout << dist[i][j];
}
if (j == V - 1) {
cout << "\n";
} else {
cout << " ";
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
const ll INF = 1e9+5;
int a[200005];
int s[200005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i=0 ; i<n ; i++) {
scanf("%d", a+i);
}
if (k > 100) {
for (int i=0 ; i<n ; i++) {
printf("%d ", n);
}
printf("\n");
return 0;
}
while (k--) {
memset(s, 0, sizeof s);
for (int i=0 ; i<n ; i++) {
s[max(0, i-a[i])]++;
s[min(200004, i+a[i]+1)]--;
}
int pos = 0;
for (int i=0 ; i<n ; i++) {
pos += s[i];
a[i] = pos;
}
}
for (int i=0 ; i<n ; i++) {
printf("%d ", a[i]);
}
printf("\n");
return 0;
}
| 0
| 60,302,374
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x, y;
cin >> x >> y;
if(y == 1) puts("-1");
else if(x%2 == 0 && y == 2) puts("-1");
else if(x % y == 0) puts("-1");
else cout << x * (y - 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = 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;
const long long MOD = 1000000007;
const long double pi = (acos(-1));
#define pb push_back
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;
}
int main(){
ll n;
cin>>n;
map<ll,ll> e;
map<ll,ll> o;
rep(i,n){
ll a;
cin>>a;
if(i%2==0){
e[a]++;
}else{
o[a]++;
}
}
ll keye,keyo;
ll emax=0;
ll e2m=0;
ll omax=0;
ll o2m=0;
for(auto p:e){
ll value=p.second;
if(value>emax){
e2m=emax;
emax=value;
keye=p.first;
}else if(value>e2m){
e2m=value;
}
}
for(auto p:o){
ll value=p.second;
if(value>omax){
o2m=omax;
omax=value;
keyo=p.first;
}else if(value>o2m){
o2m=value;
}
}
if(keye!=keyo){
cout<<n-emax-omax<<endl;
}else{
if(omax+e2m>emax+o2m){
cout<<n-omax-e2m<<endl;
}else{
cout<<n-emax-o2m<<endl;
}
}
}
| 0
| 21,862,184
|
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#define doubled( x ) (x * x)
int digit_count(int num);
using namespace std;
int main()
{
int N; cin >> N;
vector<int> data(3);
for(int i = 0; i < N; i++)
{
for(int j = 0; j < 3; j++)
{
cin >> data[j];
}
sort(data.begin(), data.end());
if( ( doubled(data[0]) + doubled(data[1]) ) == doubled(data[2]) )cout << "YES";
else cout << "NO";
cout << endl;
}
return 0;
}
int digit_count(int num)
{
if( num < 0 )num *= (-1);
int count = 0;
for(int i = 10; num != 0; i *= 10)
{
int diff = num % i;
num -= diff;
count++;
}
return count;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int N;
string c1[36], c2[36];
cin >> N;
for(int i=0;i<N;i++) cin >> c1[i];
for(int i=0;i<N;i++) c2[i]=c1[i];
for(int i=0;i<N;i++){
for(int j=N-1;j>i;j--){
if(c1[j][1]<c1[j-1][1]){
string tmp=c1[j];
c1[j]=c1[j-1];
c1[j-1]=tmp;
}
}
}
for(int i=0;i<N;i++){
int minj = i;
for(int j=i;j<N;j++){
if(c2[j][1]<c2[minj][1]) minj=j;
}
string tmp=c2[i];
c2[i]=c2[minj];
c2[minj]=tmp;
}
cout << c1[0];
for(int i=1;i<N;i++) cout << ' ' << c1[i];
cout << endl << "Stable" << endl;
cout << c2[0];
for(int i=1;i<N;i++) cout << ' ' << c2[i];
cout << endl;
bool isStable=true;
for(int i=0;i<N;i++){
if(c1[i]!=c2[i]) isStable=false;
}
cout << (isStable?"Stable":"Not stable") << endl;
return 0;
}
| 0
| 60,377,792
|
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
int main()
{
int a,b,c,d,e,k=0,s,a1,b1,c1,d1,e1,z[5];
cin>>a>>b>>c>>d>>e;
if (a%10==0)
k=k+a;
else
{
a1=a%10;
a=a/10;
a=(a+1)*10;
k=k+a;
}
if (b%10==0)
k=k+b;
else
{
b1=b%10;
b=b/10;
b=(b+1)*10;
k=k+b;
}
if (c%10==0)
k=k+c;
else
{
c1=c%10;
c=c/10;
c=(c+1)*10;
k=k+c;
}
if (d%10==0)
k=k+d;
else
{
d1=d%10;
d=d/10;
d=(d+1)*10;
k=k+d;
}
if (e%10==0)
k=k+e;
else
{
e1=e%10;
e=e/10;
e=(e+1)*10;
k=k+e;
}
if (a1!=0)
z[0]=a1;
else
z[0]=10;
if (b1!=0)
z[1]=b1;
else
z[1]=10;
if (c1!=0)
z[2]=c1;
else
z[2]=10;
if (d1!=0)
z[3]=d1;
else
z[3]=10;
if (e1!=0)
z[4]=e1;
else
z[4]=10;
sort(z,z+5);
s=z[0];
cout<<k-10+s;
}
|
#include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[])
{
string input_line;
int *heights;
heights = new int[0];
int lineNum = 0;
while(cin)
{
getline(cin, input_line);
lineNum++;
int line = atoi(input_line.c_str());
int* temp = new int[lineNum];
copy(heights, heights + lineNum-1, temp);
delete [] heights;
temp[lineNum-1] = line;
heights = temp;
}
sort(heights, heights + lineNum);
for(int i = lineNum-1; i >= lineNum-3; i--)
{
cout << heights[i] << endl;
}
}
| 0
| 65,313,813
|
#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#define FOR(i,j,n) for (int i=(j);i<(n);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define REPN(i,n) for (int i=(n);i>=0;i--)
#define I(n) scanf("%d", &(n))
#define pb(n) push_back((n))
#define mp(i,j) make_pair((i),(j))
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
typedef vector<vpi> vvpi;
typedef vector<vvi> vvvi;
typedef long long ll;
int n,k,a[100010],b[100010];
ll ret,tmp;
vi tgt;
int main(){
I(n); I(k);
tgt.pb(k);
REP(i,30){
int kouho = (k >> i) << i;
kouho += ((1 >> i) - 1);
if (kouho > 0 && kouho <= k) tgt.pb(kouho);
}
REP(i,n) { I(a[i]); I(b[i]); }
for (auto mask : tgt){
tmp = 0;
REP(i,n) if ((mask | a[i]) == mask) tmp += b[i];
ret = max(ret,tmp);
}
cout << ret << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = 0;
for(int in=0;in<=100;in++) {
if(a<=in&&in<=b&&c<=in&&in<=d) {
ans++;
}
}
if(ans > 0) ans--;
cout << ans << endl;
return 0;
}
| 0
| 78,914,750
|
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
#define all(x) x.begin(),x.end()
#define fi first
#define se second
using pint = pair<int,int>;
using vec = vector<int>;
using ll=long long;
using vll = vector<ll>;
using vvll = vector<vector<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; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
cout<<s.substr(0,4)<<' '<<s.substr(4,8)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
for(int b=0;b<(1<<3);++b){
int ans = S[0] - '0';
for(int i=1;i<4;++i){
if(b & (1<<(i-1))){
ans += S[i] - '0';
}else{
ans -= S[i] - '0';
}
}
if (ans == 7){
for(int i=0;i<3;++i){
cout << S[i];
if(b & (1<<i)){
cout << '+';
}else{
cout << '-';
}
}
cout << S[3] << "=7" << endl;
return 0;
}
}
}
| 0
| 26,163,867
|
#include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int64_t k, a, b;
std::cin >> k >> a >> b;
if (b - a <= 2) {
std::cout << k + 1 << std::endl;
} else {
k -= a - 1;
std::cout << (b - a) * (k / 2) + (k % 2) + a << std::endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);--i)
#define SIZE(a) int((a).size())
#define out(a) cout<<(a)<<endl;
const int INF=INT_MAX;
const int MAX = 510000;
const ll MOD = 1L<<32;
ll fac[MAX], finv[MAX], inv[MAX];
int main(){
ll v,e;cin>>v>>e;
vvll g(v,vll(v,MOD));
rep(i,0,e){
ll s,t,d;cin>>s>>t>>d;
g[s][t]=d;
}
rep(i,0,v){g[i][i]=0;}
bool ok=true;
rep(k,0,v){
rep(i,0,v){
if(g[i][k]==MOD)continue;
rep(j,0,v){
if(g[k][j]==MOD)continue;
g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
}
if(g[i][i]<0)ok=false;
}
}
if(!ok){
out("NEGATIVE CYCLE");
}
else{
rep(i,0,v){
rep(j,0,v){
if(g[i][j]!=MOD){cout<<g[i][j];}
else{cout<<"INF";}
if(j!=v-1){cout<<" ";}
}
cout<<endl;
}
}
}
| 0
| 55,158,193
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> k(N+1);
k.at(0) = 2;
k.at(1) = 1;
for(int i = 2; i <= N; i++) {
k.at(i) = k.at(i-1) + k.at(i-2);
}
cout << k.at(N) << endl;
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define pb(x) push_back(x)
#define MP(x,y) make_pair(x,y)
using namespace std;
ll gcd(ll a,ll b)
{
if(a%b==0)
return b;
else
return gcd(b,a%b);
}
int hashe[5];
void solve()
{
int a,b;
cin>>a>>b;
hashe[a]++,hashe[b]++;
cin>>a>>b;
hashe[a]++,hashe[b]++;
cin>>a>>b;
hashe[a]++,hashe[b]++;
sort(hashe,hashe+5);
if(hashe[4]==2&&hashe[3]==2&&hashe[2]==1&&hashe[1]==1)
{
cout<<"YES";
}
else{
cout<<"NO";
}
}
int main()
{
int t=1;
while(t--)
solve();
return(0);
}
| 0
| 4,170,932
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <ctime>
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
const int INF = (int)1e9 + 10;
const LL MOD = (LL)1e9 + 7;
const LL LINF = (LL)4e18 + 20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
using namespace::std;
template<typename T>
void chmax(T& a, T b) {
a = max(a, b);
}
template<typename T>
void chmin(T& a, T b) {
a = min(a, b);
}
template<typename T>
void IN(vector<T> &A,int N=-1) {
if (N == -1) {
N = A.size();
}
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
}
template<typename T>
void SO(vector<T> &A,bool F=false) {
sort(A.begin(), A.end());
if (F) {
reverse(A.begin(), A.end());
}
}
void solve() {
LD T, X;
cin >> T >> X;
cout << T / X << endl;
}
signed main(void) {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;
cout << setprecision(16);
solve();
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main(){
int N;
cin >> N;
vector<tuple<int, int, int>> A(N);
for( int i = 0; i < N; i++ ){
int a, b;
cin >> a >> b;
A.at(i) = make_tuple(a+b, a, b);
}
sort(A.rbegin(), A.rend());
int taka = 0;
int aoki = 0;
for( int i = 0; i < N; i++ ){
if( i%2 == 0 ){
taka += get<1>(A.at(i));
}else{
aoki += get<2>(A.at(i));
}
}
cout << taka-aoki << endl;
}
| 0
| 61,593,439
|
#include <bits/stdc++.h>
using namespace std;
long long x[10000010], y[10000010];
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lep(j, n) for (int j = 0; j < (n); j++)
#define reps(i, n) for (int i = 1; i < (n); i++)
#define leps(i, n) for (int j = 1; j < (n); j++)
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define int long long
#define gsort(x, n) sort((x), (x) + (n), greater<int>());
#define setout(n, x) setw(n) << setfill(x)
#define Fixed fixed << setprecision(10);
const long long mod = 1e9 + 7;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
if(a%b==0) cout<<-1<<'\n';
else cout<<a<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#pragma GCC optimize("O2")
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define leastsigbit(x) __builtin_ffs(x)
const int mod = 1e9 + 7;
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define pii pair<ll,ll>
#define vpii vector<pii>
#define tt ll tt;cin >> tt;while(tt--)
#define fio ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define D1(x) { cerr << " [" << #x << ": " << x << "]\n"; }
#define D2(x) { cerr << " [" << #x << ": "; for(auto it:x) cerr << it << " "; cerr << "]\n";}
const double PI = acos(-1);
ll power(ll a,ll b,ll m=mod){ ll ans=1; a=a%m; while(b>0) { if(b&1) ans=(1ll*a*ans)%m; b>>=1;a=(1ll*a*a)%m;}return ans;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
ll lcm( ll x, ll y) { return (x*y)/gcd(x,y);}
bool isprime(ll n){if(n < 2) return 0; ll i = 2; while(i*i <= n){if(n%i == 0) return 0; i++;} return 1;}
bool isPowerOfTwo(int x)
{
return x && (!(x&(x-1)));
}
double distform(int x, int y, int z, int w) {
return sqrt(1. * pow(x-z,2) + 1. * pow(y-w,2));
}
const int MAXN = 2e5+ 10;
const ll inf = 1e18;
int intlog(double base, double x) {
return (int)(log(x) / log(base));
}
void read(vi & a) {
for (int i = 0; i < sz(a); ++i) {
cin >> a[i];
}
}
int32_t main() {
fio
int n,m;
cin >> n >> m;
vi p(m);
vector<vector<string>> subs(n,vector<string>(0));
vector<string> s(m);
for (int i = 0; i < m; ++i) {
cin >> p[i] >> s[i];
subs[p[i] - 1].pb(s[i]);
}
int cnt = 0;
int ans = 0;
for (int j = 0; j < n; ++j) {
bool k = 0;int tmp = 0;
for (int i = 0; i < sz(subs[j]); ++i) {
if(subs[j][i] == "WA") {
tmp++;
}
else if(subs[j][i] == "AC") {
ans++;
k = 1;
break;
}
}
if(k) {
cnt+=tmp;
}
}
cout << ans << " " << cnt << endl;
}
| 0
| 93,810,119
|
#include <iostream>
#include <string>
#include <utility>
#include <map>
using namespace std;
typedef pair<int, char> P;
P bCards[36];
P sCards[36];
P iCards[36];
void bubbleSort(int n){
for(int i=0; i<n; ++i){
int x = bCards[i].first;
for(int j=n-1; j>i; --j){
if(bCards[j].first < bCards[j-1].first){
swap(bCards[j], bCards[j-1]);
}
}
}
}
void selectionSort(int n){
for(int i=0; i<n; ++i){
int idx = i;
for(int j=i+1; j<n; ++j){
if(sCards[idx].first > sCards[j].first){
idx = j;
}
}
swap(sCards[i], sCards[idx]);
}
}
bool isStable(int N){
for(int i=0; i<N; ++i){
if(sCards[i] != bCards[i]) return false;
}
return true;
}
int main(){
int N; cin >> N;
for(int i=0; i<N; ++i){
string card; cin >> card;
char suit = card[0];
int num = stoi(card.substr(1));
iCards[i].second = bCards[i].second = sCards[i].second = suit;
iCards[i].first = bCards[i].first = sCards[i].first = num;
}
bubbleSort(N);
selectionSort(N);
for(int i=0; i<N; ++i){
if(i) cout << " ";
cout << bCards[i].second << bCards[i].first;
}
cout << endl;
cout << "Stable" << endl;
for(int i=0; i<N; ++i){
if(i) cout << " ";
cout << sCards[i].second << sCards[i].first;
}
cout << endl;
if(isStable(N)) cout << "Stable" << endl;
else cout << "Not stable" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ino freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout);
#define fr(i,n) for(i=0;i<n;i++)
#define frs(i,a,n) for(i=a;i<n;i++)
#define frv(i,n) for(i=n-1;i>=0;i--)
#define ne cout<<"\n";
#define cas(i) cout<<"Case #"<<i<<": "
#define vi vector <int>
#define vpi vector <pair <int,int> >
#define vpin(v,a,b) v.push_back(make_pair(a,b))
#define vsort(v) sort(v.begin(),v.end());
#define all(v) ((v).begin()),((v).end())
#define sz(v) ((int)((v).size()))
#define todegree(rad) rad*(180.0/pi)
#define isnttriangle(a,b,c) (a+b<c||a+c<b||b+c<a)
#define pi acos(-1)
#define siz 1000
int main()
{
ll H,W,ans,r,c;
cin>>H>>W;
if(H==1||W==1) ans=1;
else if(H%2==0)
{
ans=(H/2)*W;
}
else if(W%2==0)
ans=(W/2)*H;
else
{
ans=(H/2)*W;
ans+=(W/2)+1;
}
cout<<ans<<'\n';
return 0;
}
| 0
| 34,401,680
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, btot = 0;
cin >> n;
vector<ll> t(n),a(n),b(n);
rep(i, n) {
cin >> a[i] >> b[i];
t[i] = a[i] + b[i];
btot += b[i];
}
sort(t.rbegin(), t.rend());
ll ans = -btot;
for (int i = 0; i < n; i += 2) ans += t[i];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
template <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;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n;
ll ans=0LL;
cin >>n;
VPi a(n);
rep(i, n) { cin >> a[i].F;
a[i].S = i;
}
sort(all(a));
int ns = 0;
rep(i,n){
if((i%2)!= (a[i].S%2)){
ns++;
}
}
cout<<ns/2<<endl;
}
| 0
| 43,405,902
|
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
using namespace std;
int n,cnt=1;
long long ans;
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f;}
template<typename I, typename... U> inline void read(I &x,U&... y){read(x); read(y...);}
int main()
{
read(n);
for(RG int i=1,a;i<=n;i++)
{
read(a);
if(a<cnt) continue;
if(a==cnt) cnt++;
else
{
if(a%cnt==0) ans+=a/cnt-1;
else ans+=a/cnt;
}
if(cnt==1) cnt++;
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define REV(v) reverse(v.begin(), v.end())
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#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 SZ(v) (int)v.size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
class Graph {
int N;
vector<vector<int>> edge;
vector<vector<int>> dp;
public:
Graph(int N) : N(N), edge(N) {}
void add(int a, int b) {
edge[a].emplace_back(b);
edge[b].emplace_back(a);
}
int dfs(int i, int state) {
if (dp[i][state]) return dp[i][state];
if (state == (1 << N) - 1) {
return dp[i][state] = 1;
}
for (auto &j : edge[i]) {
if (!(state >> j & 1)) {
dp[i][state] += dfs(j, state | (1 << j));
}
}
return dp[i][state];
}
int ans() {
dp = vector<vector<int>>(N, vector<int>(1 << N));
return dfs(0, 1);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
Graph graph(N);
REP(i, M) {
int a, b;
cin >> a >> b;
--a;
--b;
graph.add(a, b);
}
cout << graph.ans() << endl;
return 0;
}
| 0
| 40,977,294
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
inline int inputi(){ int x; scanf("%d", &x); return x; }
inline double inputd(){ double x; scanf("%lf", &x); return x; }
inline string inputs(){ string x; cin >> x; return x; }
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define REPit(type, i, obj) for (type::iterator i = (obj).begin(); i != (obj).end(); i++)
#define RREPit(type, i, obj) for (type::iterator i = (obj).rbegin(); i != (obj).rend(); i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define sz(obj) ((int)(obj).size())
#define sort(obj) sort(all(obj))
#define exist(obj, key) ((obj).find(key) != (obj).end())
#define clear(array) memset((array), 0, sizeof(array))
#define print(x) cout << (x) << endl
template <class T> inline void printall(vector<T> v){ REP(i, sz(v)) cout << v[i] << "\n "[i < sz(v) - 1]; }
#define dump(x) cerr << #x << ": " << (x) << endl
#define debug(x) cerr << #x << ": " << (x) << " (" << __LINE__ << ")" << endl
int main()
{
ll n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x, n){
int y[n];
REP(i, n) cin >> y[i];
int cnt = 0;
REP(i, 10001){
if (x == y[cnt]){
cnt++;
}
if (cnt == n){
print(i);
break;
}
x = (a * x + b) % c;
}
if (cnt < n) puts("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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; }
const int MOD=1e9+7;
const ll INF=1e18;
const ll inf=1e9;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};
const int MAX=510000;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,h;
cin >> n >> h;
vector<ll> a(n),b(n);
rep(i,n) cin >> a[i] >> b[i];
sort(a.begin(),a.end(),greater<ll>());
sort(b.begin(),b.end(),greater<ll>());
vector<ll>s(n+1);
ll num = 0;
rep(i,n){
if(b[i]>a[0]){
s[i+1] = s[i] + b[i];
num++;
}
else break;
}
ll ok = inf, ng = 0;
while(abs(ok-ng)>1){
ll mid = (ok+ng)/2;
if(mid*a[0]>=h) ok=mid;
else{
if(mid<=num){
if(s[mid]<h)ng=mid;
else ok = mid;
}
else{
if(s[num]+(mid-num)*a[0]<h)ng=mid;
else ok = mid;
}
}
}
cout << ok << endl;
return 0;
}
| 0
| 46,392,784
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 112345;
const long long MOD = 1e9 + 7;
long long n, m;
vector <long long> x;
vector <long long> y;
long long solve () {
long long ans = 0;
for (long long i = 1; i < n; ++i) {
long long temp = i * (n - i);
temp %= MOD;
ans += temp * (x[i] - x[i - 1]);
ans %= MOD;
}
return ans;
}
int main () {
cin >> n >> m;
x.resize (n);
y.resize (m);
for (int i = 0; i < n; ++i)
scanf ("%lld", &x[i]);
for (int i = 0; i < m; ++i)
scanf ("%lld", &y[i]);
long long ans = solve ();
swap (n, m);
swap (x, y);
ans *= solve ();
ans %= MOD;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll H, W, M;
scanf("%lld %lld %lld", &H, &W, &M);
vll h_list = vll(300005);
vll w_list = vll(300005);
mll points;
ll h_max = -1;
ll w_max = -1;
for (ll i = 0; i < M; i++) {
ll h, w;
scanf("%lld %lld", &h, &w);
h_list[h]++;
w_list[w]++;
h_max = max(h_max, h_list[h]);
w_max = max(w_max, w_list[w]);
points[h + w * 1000000LL] = 1;
}
vll y_list;
vll x_list;
for (ll i = 0; i < 300005; i++) {
if (h_list[i] == h_max) {
y_list.emplace_back(i);
}
}
for (ll i = 0; i < 300005; i++) {
if (w_list[i] == w_max) {
x_list.emplace_back(i);
}
}
ll ans = h_max + w_max - 1;
for (auto y : y_list) {
for (auto x : x_list) {
if (!points[y + x * 1000000LL]) {
cout << ans + 1 << endl;
return 0;
}
}
}
cout << ans << endl;
}
| 0
| 42,255,626
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define vcout(v) rep(i,v.size()) cout << v[i] << " "; cout << endl
#define mcout(m) rep(j,m.size()){vcout(m[j]);}
const ll MOD = 1e9 + 7;
int mainsolve(){
ll k;
cin >> k;
vector<ll> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a[k-1] << endl;
return 0;
}
int main(){
return mainsolve();
}
|
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
bool cmp_f(const pair<LL, LL> &x, const pair<LL, LL> &y)
{
return x.first < y.first;
}
bool cmp_s(const pair<LL, LL> &x, const pair<LL, LL> &y)
{
return x.second > y.second;
}
int main() {
LL n;
LL a;
LL b;
LL c;
LL d;
LL ans=0;
cin >> n;
vector<pair<LL, LL>> ab(n);
vector<pair<LL, LL>> cd(n);
vector<bool> ab_end(n, false);
for(LL i=0; i<n; i++){
cin >> a >> b;
ab[i]=make_pair(a, b);
}
sort(ab.begin(), ab.end(), cmp_s);
for(LL i=0; i<n; i++){
cin >> c >> d;
cd[i]=make_pair(c, d);
}
sort(cd.begin(), cd.end(), cmp_f);
for(LL i=0; i<n; i++){
for(LL j=0; j<n; j++){
if(ab_end[j]==false){
if(ab[j].first<cd[i].first && ab[j].second < cd[i].second){
ans++;
ab_end[j]=true;
break;
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 49,217,314
|
#include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define INF 1000000000000000000
#define rnd mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define uid uniform_int_distribution <int>
using namespace std;
#define int ll
int dist(int x1, int y1, int x2, int y2) {
return abs(x1 - x2) + abs(y1 - y2);
}
signed main() {
int n;
cin >> n;
vector <int> x(n), y(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
if(abs(x[i] + y[i]) % 2 != abs(x[0] + y[0]) % 2) {
cout << -1;
return 0;
}
}
vector <int> v;
for (int i = 30; i >= 0; i--) {
v.push_back(1 << i);
}
if((x[0] + y[0]) % 2 == 0) {
v.push_back(1);
}
cout << (int) v.size() << "\n";
for (auto g: v)
cout << g << " ";
cout << "\n";
string moves = "LRUD";
vector <int> l({-1, 1, 0, 0});
vector <int> r({0, 0, 1, -1});
for (int i = 0; i < n; i++) {
int cx = 0, cy = 0;
string ans;
for (auto g : v) {
int mn = INF, p = -1;
for (int j = 0; j < 4; j++) {
int tx = cx + g * l[j];
int ty = cy + g * r[j];
int d = dist(tx, ty, x[i], y[i]);
if(d < mn) mn = d, p = j;
}
cx += g * l[p];
cy += g * r[p];
ans += moves[p];
}
cout << ans << "\n";
}
}
|
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
item += ch;
}
}
if (!item.empty()) {
elems.push_back(item);
}
return elems;
}
string to_str_with_zero(int i, int w) {
ostringstream sout;
sout << std::setfill('0') << std::setw(w) << i;
string s = sout.str();
return s;
}
int letter_to_int(char c) {
return tolower(c) - 'a';
}
int compare_array(vector<int> a1, vector<int>a2) {
if (a1.size() != a2.size()) {
return a1.size() - a2.size();
}
for (int i=0; i<a1.size(); i++) {
if (a1.at(i) != a2.at(i)) {
return a1.at(i) - a2.at(i);
}
}
return 0;
}
int gcd(int a, int b) {
if (a == b) {
return a;
}
else if (a > b) {
return gcd(a - b, b);
}
else {
return gcd(a, b - a);
}
}
char int_to_char(int a) {
if (a == -1) {
return 'z';
}
else {
return 'a' + a;
}
}
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans*i;
}
for (int i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
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;
}
int divide_count(int a, int divider) {
int r = 0;
while(a % divider == 0) {
a /= divider;
r++;
}
return r;
}
bool is_prime(int a) {
int i = 2;
while(i * i <= a) {
if(a % i == 0) {
return false;
}
i++;
}
return true;
}
int main() {
std::cout << std::setprecision(9);
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
string ans = "YES";
for(int i=1; i<n; i++) {
if(a[i] == a[i - 1]) {
ans = "NO";
break;
}
}
cout << ans << endl;
}
| 0
| 70,329,302
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
string S;cin >> S;
if (S == "AAA" || S == "BBB") cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll a, b;
cin >> a >> b;
ll ans = 0;
ll n = b - a + 1;
if (a % 2)
{
ans = a;
n--;
}
if (n % 2 == 0)
{
if ((n / 2) % 2 == 0)
{
ans = ans ^ 0;
}
else
{
ans = ans ^ 1;
}
}
else
{
n--;
if ((n / 2) % 2 == 0)
{
ans = ans ^ 0;
ans = ans ^ b;
}
else
{
ans = ans ^ 1;
ans = ans ^ b;
}
}
cout << ans << endl;
}
| 0
| 37,052,967
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<numeric>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main()
{
int N; cin >> N;
vector<int> c(N), s(N), f(N);
for(int i=0; i<N-1; i++) cin >> c[i] >> s[i] >> f[i];
for(int i=0; i<N; i++){
int t = 0;
for(int j=i; j<N-1; j++){
if(j == i) t += c[j] + s[j];
else{
if(t <= s[j]) t = c[j] + s[j];
else if(t%f[j] == 0) t += c[j];
else t += c[j] + f[j] - t%f[j];
}
}
cout << t << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M=1000000007;
const ll MM=998244353;
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
if(a<=0)return 0;
a%=m;
if(!b)return 1;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
template<typename T,typename F>
void chmax( T &a,F b){
if(b>a)a=b;
}
template<typename T,typename F>
void chmin( T &a,F b){
if(b<a)a=b;
}
const ll N=1e5+5;
int main()
{
IOS;
ll n;cin>>n;
string s;cin>>s;
vvl vf(n,vl(10));
vvl vb(n,vl(10));
vf[0][s[0]-'0']++;
for(int i=1;i<n;i++){
for(int j=0;j<10;j++){
vf[i][j]=vf[i-1][j];
}
ll dig=s[i]-'0';
vf[i][dig]++;
}
vb[n-1][s[n-1]-'0']++;
for(int i=n-2;i>=0;i--){
for(int j=0;j<10;j++){
vb[i][j]=vb[i+1][j];
}
vb[i][s[i]-'0']++;
}
set<pair<ll,pll>>se;
FOR(i,10)
FOR(k,10){
for(int p=1;p<n-1;p++){
ll dig=s[p]-'0';
if(vf[p-1][i]&&vb[p+1][k]){
se.insert({i,{dig,k}});
}
}
}
cout<<se.size();
return 0;
}
| 0
| 11,582,136
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
string rotate = s;
for(long long i = 0; i < s.size(); i++){
rotate = rotate[rotate.size()-1] + rotate.substr(0, rotate.size()-1);
if(rotate == t){
printf("Yes\n");
return 0;
}
}
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
ll power(ll x, ll n)
{
ll result = 1;
while (n)
{
if (n % 2 == 1)
result = result * x;
n = n / 2;
x = x * x;
}
return result;
}
ll gcd(ll a, ll b)
{
if (!b)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a, b);
}
inline ll mul(ll x, ll y, ll m)
{
ll z = 1LL * x * y;
if (z >= m)
{
z %= m;
}
return z;
}
ll powmod(ll x, ll y, ll m)
{
ll r = 1;
while (y)
{
if (y & 1)
{
r = mul(r, x, m);
}
y >>= 1;
x = mul(x, x, m);
}
return r;
}
void start()
{
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
start();
int n;
cin>>n;
int a[n+1];
for (int i=1;i<=n;i++)
{
cin>>a[i];
}
int j=1;
int c=0;
for (int i=1;i<=n;i++)
{
if (a[i]!=j)
{
c++;
}
else
{
j++;
}
}
if(c>=n)
{
cout<<-1;
}
else
{
cout<<c;
}
return 0;
}
| 0
| 3,106,946
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
constexpr ll INF = ll(1e+18) + 1;
int main() {
int A, B, C;
string ans = "NO";
cin >> A >> B >> C;
rep(b, B) {
if ((A*b)%B == C) {
ans = "YES";
break;
}
}
cout << ans << endl;
}
|
#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 ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS = 1e-9;
const bool debug = 0;
ll N;
string to_str(ll n) {
stringstream ss;
ss << n;
return ss.str();
}
bool queryAuto(ll n) {
bool res = false;
if (n <= N && to_str(n) <= to_str(N)) res = true;
if (n > N && to_str(n) > to_str(N)) res = true;
puts(res ? "Y" : "N");
return res;
}
bool query(ll n) {
printf("? %lld\n", n);
fflush(stdout);
if (debug) return queryAuto(n);
string ans; cin >> ans;
return ans == "Y";
}
int askfl() {
bool bef;
int one = -1;
for (ll i = 1, cnt = 0; i <= 100000000000ll; i *= 10, cnt++) {
bool now = query(i);
if (i != 1 && bef != now) one = cnt;
bef = now;
}
int nine = -1;
for (ll i = 9, cnt = 0; i <= 100000000000ll; i *= 10, cnt++) {
bool now = query(i);
if (i != 9 && bef != now) nine = cnt + 1;
bef = now;
}
int res;
if (one != -1) res = one;
else res = nine;
if (res == -1) res = 1;
return res;
}
int main() {
if (debug) cin >> N;
int keta = askfl();
ll l = 1, r;
REP(i, keta - 1) l *= 10;
r = l * 10;
while (r - l > 1) {
ll m = (r + l) / 2;
if (query(m * 10)) r = m;
else l = m;
}
ll ans = r;
if (query(l * 10)) ans = l;
printf("! %lld\n", ans);
return 0;
}
| 0
| 1,263,117
|
#include <iostream>
#include <string>
using namespace std;
int main () {
string str;
cin >> str;
str.insert(4, " ");
cout << str << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#include <math.h>
#include <cstdio>
int main()
{
double dis = 0.0 , x1 , x2 , y1 , y2 , f = 0.0;
cin >> x1 >> y1 >> x2 >> y2;
if( x1 >= x2 && y1 >= y2 ) f = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 );
else if( x1 <= x2 && y1 <= y2 ) f = ( x2 - x1 ) * ( x2 - x1 ) + ( y2 - y1 ) * ( y2 - y1 );
else if( x1 >= x2 && y1 <= y2 ) f = ( x1 - x2 ) * ( x1 - x2 ) + ( y2 - y1 ) * ( y2 - y1 );
else if( x1 <= x2 && y1 >= y2 ) f = ( x2 - x1 ) * ( x2 - x1 ) + ( y1 - y2 ) * ( y1 - y2 );
dis = sqrt(f);
printf("%.8f\n",dis);
return 0;
}
| 0
| 71,565,561
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace tools {
template <typename T>
void read(::std::istream& is, ::std::vector<T>& vector, const typename ::std::vector<T>::size_type size) {
vector.reserve(size);
::std::copy_n(::std::istream_iterator<T>(is), size, ::std::back_inserter(vector));
}
template <typename T>
void read(::std::vector<T>& vector, const typename ::std::vector<T>::size_type size) {
::tools::read(::std::cin, vector, size);
}
template <typename T, ::std::size_t N>
void read(::std::istream& is, ::std::array<T, N>& array) {
::std::copy_n(std::istream_iterator<T>(is), N, array.begin());
}
template <typename T, ::std::size_t N>
void read(::std::array<T, N>& array) {
::tools::read(::std::cin, array);
}
}
#endif
int main() {
i64 H, W;
std::cin >> H >> W;
std::vector<std::string> s;
tools::read(s, H);
std::vector<std::vector<i64>> dp(H, std::vector<i64>(W, std::numeric_limits<i64>::max()));
dp[0][0] = s[0][0] == '#' ? 1 : 0;
for (i64 i = 0; i < H; ++i) {
for (i64 j = 0; j < W; ++j) {
if (i + 1 < H) {
dp[i + 1][j] = std::min(dp[i + 1][j], dp[i][j] + (s[i][j] == '.' && s[i + 1][j] == '#' ? 1 : 0));
}
if (j + 1 < W) {
dp[i][j + 1] = std::min(dp[i][j + 1], dp[i][j] + (s[i][j] == '.' && s[i][j + 1] == '#' ? 1 : 0));
}
}
}
std::cout << dp[H - 1][W - 1] << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int INF = 100000000;
ll i,j,k;
ll mod=1000000007;
int main(){
ll n,answer=0,answer2=0;cin>>n;
vector<ll> a(n+1),key(n+1);
for(i=1;i<=n;i++){cin>>a[i];}
for(i=1;i<=n;i++){key[i]=a[i]-i;}
sort(key.begin()+1,key.end());
double center;
if(n%2==0){center=(key[n/2]+key[n/2+1])/2;}
else{center=key[(n+1)/2];}
ll llcenter=(ll)(center);
if(center>=0 && abs(double(llcenter)-center)-abs(double(llcenter+1)-center)>=0){
llcenter=llcenter+1;
}
if(center<0 && abs(double(llcenter)-center)-abs(double(llcenter-1)-center)>=0){
llcenter=llcenter-1;
}
for(i=1;i<=n;i++){
answer+=abs(key[i]-llcenter);
}
cout<<answer<<endl;
return 0;
}
| 0
| 57,364,415
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> P(N), Q(N);
for (int i = 0; i < N; i++) cin >> P[i];
for (int i = 0; i < N; i++) cin >> Q[i];
vector<int> perm(N);
for (int i = 0; i < N; i++) perm[i] = i + 1;
int n = 0;
int a, b;
do {
if (perm == P) a = n;
if (perm == Q) b = n;
n++;
} while (next_permutation(perm.begin(), perm.end()));
cout << abs(a - b) << endl;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<cstring>
#include<queue>
#include<cmath>
#include<functional>
#include<numeric>
#include<map>
using namespace std;
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define REPS(i, n) for(int i=1;i<=(int)(n);i++)
#define RREP(i, n) for(int i=(int)n-1;i>=0;i--)
#define RREPS(i, n) for(int i=(int)n;i>0;i--)
#define FOR(it, a) for(auto it = a.begin();it!=a.end();++it)
#define RFOR(it, a) for(auto it = a.rbegin();it!=a.rend();++it)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n, m;
int main(){
ios::sync_with_stdio(false);
while(cin >> n >> m, n){
map<int, int> p;
ll sum = 0;
REP(i, n){
int x, y;
cin >> x >> y;
p[y] += x;
sum += (ll)x*y;
}
RFOR(it, p){
ll t = min(it->second, m);
sum -= t*(it->first);
m -= t;
}
cout << sum << endl;
}
return 0;
}
| 0
| 84,170,271
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,j,k,flag;
string s;
while(~scanf("%d",&n))
{
flag = 1;
cin >> s;
if(n%2)cout<<"No"<<endl;
else
{
for(i=0,j=n/2;i<n/2;i++,j++)
{
if(s[i]!=s[j]) flag = 0;
}
if(flag)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
long long x;
cin>>n>>x;
vector<long long>lyr(n+1);
vector<long long>p(n+1);
p[0]=1;
lyr[0]=1;
for(int i=1;i<=n;i++)
{
p[i]=(2*p[i-1])+1;
lyr[i]=(2*lyr[i-1])+3;
}
long long ans=0;
long long l=1;
long long r=lyr[n];
long long mid=(l+r)/2;
int level=n;
while(l<r)
{
--level;
if(x==mid)
{
ans+=p[level]+1;
break;
}
else if(x==l)break;
else if(x==r)
{
ans+=p[level+1];
break;
}
else if(x>mid)
{
l=mid+1;
r--;
ans+=p[level]+1;
}
else if(x<mid)
{
r=mid-1;
l++;
}
mid=(l+r)/2;
}
if(l==r)ans++;
cout<<ans<<endl;
return 0;
}
| 0
| 42,962,548
|
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
int main() {
int N;
while(cin >>N && N){
string s;
REP(i, N){
string _s; cin >>_s;
s += _s;
}
int ans = 0, r = 0, l = 0;
for(int i = 0; i <= (int)s.length() - 4; i += 2){
string s4 = s.substr(i, 4), s2 = s.substr(i, 2);
if(l == 0 && r == 0 && (s4 == "luru" || s4 == "rulu")) ++ans;
if(l == 1 && r == 1 && (s4 == "ldrd" || s4 == "rdld")) ++ans;
if(s2 == "lu") l = 1; if(s2 == "ru") r = 1; if(s2 == "ld") l = 0; if(s2 == "rd") r = 0;
}
cout <<ans <<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool f = false;
for (int j = a.size(); j >=0; j-=2) {
if (j%2 == 1 && f == false) {
f = true;
a.pop_back();
}
string b = a.substr(0, a.size()/2);
string c = a.substr(a.size()/2, a.size()-1);
if (b == c && f) {
cout << j << endl;
break;
}
a.pop_back();
a.pop_back();
f = true;
}
}
| 0
| 91,822,369
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
string a = "qwertasdfgzxcvb";
string b = "yuiophjklnm";
string s;
while (getline(cin, s)) {
if (s == "#") {
break;
}
if (s.size() == 1) {
cout << 0 << endl;
continue;
}
vector<int> c;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < a.size(); j++) {
if (s[i] == a[j]) {
c.push_back(0);
}
}
for (int j = 0; j < b.size(); j++) {
if (s[i] == b[j]) {
c.push_back(1);
}
}
}
int ans = 0, x = c[0];
for (int i = 1; i < c.size(); i++) {
if (x != c[i]) {
ans++;
x = c[i];
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_r(v) (v).rbegin(), (v).rend()
const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(vector<T> v)
{
if (v.size() == 0)
return;
int n = v.size() - 1;
rep(i, n) cout << v[i] << wsp;
cout << v[n] << rt;
return;
}
template <typename T>
void show2dvec(vector<vector<T>> v)
{
int n = v.size();
rep(i, n) show1dvec(v[i]);
}
bool in_field(int h, int w, int y, int x)
{
return 0 <= y && y < h && 0 <= x && x < w;
}
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
double n, m, d, ans;
cin >> n >> m >> d;
if (d == 0) ans = 1 / n * (m - 1);
else
{
ans = 2 * (n - d) / (n * n) * (m - 1);
}
printf("%.10f\n" , ans);
return 0;
}
| 0
| 84,659,096
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
ll t, x; cin >> t >> x;
cout << 1.0*t/x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
if((N-1)*(N-2)/2<K){
cout << -1 << endl;
}else{
cout << N-1 + (N-1)*(N-2)/2 - K << endl;
int count = (N-1)*(N-2)/2 - K;
for(int i=2;i<=N;i++){
cout << 1 << " " << i << endl;
}
for(int i=2;i<N;i++){
for(int j=i+1;j<=N;j++){
if(count==0){
return 0;
}
cout << i << " " << j << endl;
count--;
}
}
}
}
| 0
| 29,093,470
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> adj[N];
int n, sz[N];
void dfs(int u, int par) {
sz[u] = 1;
int cnt = 0;
for (auto v: adj[u])
if (v ^ par) {
dfs(v, u);
sz[u] += sz[v];
cnt += sz[v] & 1;
}
if (cnt > 1) {
cout << "First\n";
exit(0);
}
}
inline void readInput() {
cin >> n;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
}
inline void solve() {
dfs(0, 0);
cout << (n & 1? "First\n": "Second\n");
}
int main() {
ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
readInput(), solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,ans,ml=1,mr=100000;
cin >> n >> m;
for(int i=0;i<m;i++)
{
int l,r;
cin >> l >> r;
ml=max(ml,l);
mr=min(mr,r);
}
ans = max(0,mr - ml + 1);
cout << ans << endl;
return 0;
}
| 0
| 16,233,086
|
#include <bits/stdc++.h>
#define FOR(i, n) for(ll i = 0; i < n; i++)
#define FORR(i, n) for(ll i = n; i >= 0; i--)
#define FORS(i, m, n) for(int i = m;i < n;i++)
#define ALL(v) accumulate(v.begin(),v.end(),0)
#define SORT(v) sort(v.begin(),v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#define IN2(a,b) (cin >> a >> b)
#define IN3(a,b,c) (cin >> a >> b >> c)
#define IN4(a,b,c,d) (cin >> a >> b >> c >> d)
#define REV(n) reverse(n.begin(), n.end())
using namespace std;
typedef long long ll;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
vector<int>plain(3);
FOR(i,3){
cin >> plain[i];
}
SORT(plain);
int ans;
ans = plain[0] + plain[1];
OUT(ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end()
#define fi first
#define se second
#define foe(i,a,b) for(ll i=a;i<b;i++)
#define rfoe(i,a,b) for(ll i=a;i>=0;i--)
#define sz(s) s.size()
#define mem(a,s) memset(a,s,sizeof(a))
#define all(v) v.bi,v.ei
#define MAX 8000000000000000064LL
#define MIN -8000000000000000064LL
ll add(ll a, ll b){return (a%MOD + b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll sub(ll a, ll b){return (a%MOD - b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll mul(ll a, ll b){return ((a%MOD)*(b%MOD) + ((MAX)/MOD)*MOD)%MOD;}
bool isPrime(ll n)
{
if (n <= 1)
return false;
for (ll i = 2; i*i <= n; i++)
if (n % i == 0)
return false;
return true;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = mul(res,a);
a = mul(a,a);
b >>= 1;
}
return res%MOD;
}
bool compare(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.se>b.se);
}
ll lcm(ll a,ll b)
{
return(a*b)/__gcd(a,b);
}
ll fact[1000007]={0};
ll expo(ll x, ll y) {ll res=1;x=x%MOD;while(y>0){if(y&1)res=(1ll*res*x)%MOD;
y=y>>1;x=(1ll*x*x)%MOD;} return res;}
void facto() {fact[0]=1;fact[1]=1;for(ll i=2;i<1000007;i++)fact[i]=(fact[i-1]*i)%MOD;}
ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(expo(fact[r],MOD-2)))%MOD; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res;}
ll npr(ll n,ll r) {facto(); ll res=1; res=fact[n]; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res; }
int const N=2e5+9;
ll const INF = 2e18+5;
ll n,k,ans,t,g,e,f;
ll p[5005],c[5005];
vector<pair<ll,ll>>v[5005];
vector<ll>vis,a;
void dfs(ll x)
{
if(!vis[x])
{
vis[x]=1;
t++;
for(auto i:v[x])
{
a.push_back(i.se);
e+=i.se;
if(t<=k)
g=max(g,e);
dfs(i.fi);
}
}
}
void solve()
{
cin>>n>>k;
foe(i,0,n)cin>>p[i];
foe(i,0,n)cin>>c[i];
foe(i,0,n)
{
v[i+1].pb({p[i],c[i]});
}
ans=MIN;
foe(i,1,n+1)
{
a.clear();
t=0;
g=MIN;
e=0;
vis=vector<ll>(n+1,0);
dfs(i);
ans=max(ans,g);
f=k%t;
if(f==0)
{
f=t;
}
ll m=0,c=-INF;
foe(i,0,f)
{
m+=a[i];
c=max(c,m);
}
ll q=k/t;
if(f==t)q--;
ans=max(ans,c+q*e);
}
cout<<ans<<"\n";
}
int main()
{
fast
{
solve();
}
}
| 0
| 96,960,280
|
#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(){
map<string,int> kotoba;
bool ok=true;
int n;
cin >> n;
char old,now;
rep(i,n){
string s;
cin >> s;
if(kotoba[s]>0){
ok=false;
}
else kotoba[s]++;
now = s[0];
if(i!=0){
if(old != now) ok=false;
}
old = s[s.size()-1];
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
using namespace std;
typedef long long ll;
typedef long double ld;
ll const MOD=1000000007;
ll N,Y;
int main(){
cin>>N>>Y;
ll a=-1, b=-1, c=-1;
rep(i,N+1){
ll m=N-i;
rep(j,m+1){
ll k=m-j;
if(10000*i+5000*j+1000*k==Y){
a=i;
b=j;
c=k;
break;
}
}
}
cout<<a<<' '<<b<<' '<<c<<endl;
}
| 0
| 22,978,564
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using vc = vector<char>;
using pll = pair<ll, ll>;
template<class T> void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T> void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U> bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U> bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool even(T n) { return ! (n & 1); }
template<class T> bool odd(T n) { return n & 1; }
template<class T> ll rup(T a, T b) { return a % b ? a / b + 1 : a / b; }
template<class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll intpow(ll a, ll n, ll _mod=numeric_limits<ll>::max()) { ll p=1; while (n) { if (n&1) p=p*a%_mod; a=a*a%_mod; n>>=1; } return p; }
ll modc(ll a, char op, ll b, ll _mod=mod) { a %= _mod; b %= _mod; ll res = 1; switch(op) {
case '+': res = (a + b) % _mod; break;
case '-': res = (a - b) % _mod; break;
case '*': res = a * b % _mod; break;
case '/': res = modc(a, '*', modc(b, '^', _mod-2, _mod), _mod); break;
case '^': res = intpow(a, b, _mod); break;
case 'P': rep(i, a-b+1, a+1) res = modc(res, '*', i, _mod); break;
case 'C': res = modc(modc(a, 'P', b, _mod), '/', modc(b, 'P', b, _mod)); break; } if (res < 0) res += _mod; return res; }
int main()
{
ll N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
ll diff = N - K;
cout << diff << endl;
}
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1e9 + 7) };
const int inf{ 2100000000 };
typedef long long ll;
using namespace std;
int main(void) {
int N; cin >> N;
vector<int> H(N);
vector<int> ans(N, 0);
int ANS = 0;
rep(i, N) {
cin >> H[i];
if (i == 0)continue;
ans[i] += (H[i - 1] >= H[i] ? ans[i - 1] + 1: 0);
ANS = max(ANS, ans[i]);
}
cout << ANS << endl;
return 0;
}
| 0
| 69,910,546
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int num=x/100;
if(x<=105*num)cout << 1;
else cout << 0;
}
|
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int long long
#define t1(a) cout << #a << ":" << a << endl;
#define t2(a, b) cout << #a << ":" << a << " | " << #b << ":" << b << endl;
#define t3(a, b, c) cout << #a << ":" << a << " | " << #b << ":" << b << " | " << #c << ":" << c << endl;
using namespace std;
void minCost(int dp[],int H[],int n)
{
dp[0]=0;
dp[1]=abs(H[1]-H[0]);
for(int i=2;i<n;i++)
{
dp[i]=min(dp[i-1]+abs(H[i]-H[i-1]),dp[i-2]+abs(H[i]-H[i-2]));
}
}
int32_t main()
{
IOS;
int n,m,k,x,y,z,a,b,c,count=0,ans=0,temp=0,flag=0,od=0,ev=0,curr=0,prev=0,left,right,h,g,f;
cin >> n;
int H[n];
int dp[n]={0};
for(int i=0;i<n;i++)
{
cin>> H[i];
}
minCost(dp,H,n);
cout<<dp[n-1];
return 0;
}
| 0
| 45,809,992
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<string, int> mp = {{"1", 0}, {"9", 0}, {"7", 0}, {"4", 0}};
string N;
bool ans = true;
for(int i = 0; i < 4; i++)
{
cin >> N;
auto itr = mp.find(N);
if(itr != mp.end())
mp.at(N)++;
}
map<string, int>::iterator it;
for(it = mp.begin(); it != mp.end(); it++)
{
if(it->second != 1)
{
ans = false;
break;
}
}
if(ans)
cout << "YES" <<endl;
else
cout << "NO" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
int n, m;
cin >> n >> m;
vector<pll> v(n);
rep(i,n) cin >> v[i].first >> v[i].second;
sort(ALL(v));
ll c = 0;
ll ans = 0;
rep(i,n) {
if (c == m) break;
ll l = m - c;
if (l >= v[i].second) {
c += v[i].second;
ans += v[i].first * v[i].second;
} else {
c += l;
ans += v[i].first * l;
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 0
| 98,409,691
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int n, a[1 << 18], mx1[1 << 18], mx2[1 << 18];
int main() {
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", &a[i]);
mx1[i] = a[i];
}
for (int j = 0; j < n; ++j) {
for (int K = 1; K < (1 << n); ++K) {
if (K >> j & 1) {
int P = K ^ (1 << j);
auto update = [&](int X) {
if (X >= mx2[K]) {
mx2[K] = X;
if (mx2[K] > mx1[K]) {
swap(mx1[K], mx2[K]);
}
}
};
update(mx1[P]);
update(mx2[P]);
}
}
}
int mx = 0;
for (int K = 1; K < (1 << n); ++K) {
mx = max(mx, mx1[K] + mx2[K]);
printf("%d\n", mx);
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define llu unsigned long long int
int main()
{
llu n,m,res=0,cnt=0,x,b,a,i;
cin>>n>>m;
vector<pair<long long int,long long int> > p(n);
for(i=0;i<n;i++)
{
cin>>a>>b;
p[i]=make_pair(a,b);
}
sort(p.begin(),p.end());
for(i=0;i<n;i++)
{
x=m-cnt;
if(p[i].second<=x)
res+=(p[i].first*p[i].second),cnt+=p[i].second;
else
res+=(p[i].first*x),cnt+=x;
}
cout<<res<<endl;
return 0;
}
| 0
| 28,314,479
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
int ret = 0;
for (int a = 0; a < n; ++a) {
int b = 0;
auto t = s;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
t[(i + a) % n][(j + b) % n] = s[i][j];
}
}
bool ok = true;
[&] {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (t[i][j] != t[j][i]) {
ok = false;
return;
}
}
}
}();
if (ok)
ret++;
}
ret *= n;
cout << ret << "\n";
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n; cin >> n;
int cnt = 0, a = 0, b = 0, ab = 0;
for (int i = 0; i < n; ++i) {
string s; cin >> s;
bool f = false;
for (int j = 0; j < s.size() - 1; ++j)
if (s.substr(j, 2) == "AB") ++cnt;
if (s.back() == 'A') ++a, f = true;
if (s.front() == 'B') ++b;
else f = false;
if (f) ++ab;
}
cout << max(0, cnt + min(a, b) - (ab && ab == a && ab == b ? 1 : 0)) << endl;
return 0;
}
| 0
| 27,086,675
|
#include <iostream>
using namespace std;
int main() {
string S="ABA";
cin >> S;
if(S[0]!=S[1]){
cout << "Yes";
}else if(S[1]!=S[2]){
cout << "Yes";
}else{
cout << "No";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, maxv = 0, cnt = 0, before = 0;
cin >> N;
vector<int> A(N);
REP(i, N) {
cin >> A[i];
if (A[i] > maxv) {
before = maxv;
maxv = A[i];
cnt = 1;
} else if (A[i] == maxv) {
cnt++;
} else {
before = max(before, A[i]);
}
}
REP(i, N) {
if (A[i] == maxv && cnt == 1) {
cout << before << "\n";
} else {
cout << maxv << "\n";
}
}
return 0;
}
| 0
| 4,123,967
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <tuple>
#include <numeric>
#include <cstdio>
#include <cmath>
using namespace std;
using ll = long long;
const int INF = 1e9;
int a, b, c;
int N, rtn = INF;
vector<int> l(8);
void dfs(int depth, vector<pair<int, int>>& abcd) {
if (depth == N) {
if (abcd[0].second == 0 || abcd[1].second == 0 || abcd[2].second == 0) return;
int irtn = abs(a - abcd[0].first) + abs(b - abcd[1].first) + abs(c - abcd[2].first);
for (int i = 0; i < 3; i++) {
if (abcd[i].second >= 2) irtn += (10 * (abcd[i].second - 1));
}
rtn = min(rtn, irtn);
return;
}
for (int i = 0; i < 4; i++) {
abcd[i].first += l[depth];
abcd[i].second++;
dfs(depth+1, abcd);
abcd[i].first -= l[depth];
abcd[i].second--;
}
}
int main() {
cin >> N >> a >> b >> c;
vector<pair<int, int>> abcd(4);
for (int i = 0; i < N; i++) cin >> l[i];
dfs(0, abcd);
cout << rtn << endl;
}
|
#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 = 1LL << 60;
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;
}
}
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main(){
ll N,C,K;
cin >> N >> C>>K;
vector<ll> num(N);
ll ans = 0;
ll cnt = 0;
rep(i,N)cin >> num[i];
sort(all(num));
ll limit = num[0] + K;
rep(i,N){
if(num[i] > limit){
ans++;
limit = num[i] + K;
cnt = 1;
}
else if(cnt == C){
limit = num[i] + K;
ans++;
cnt = 1;
}
else cnt++;
}
if(cnt)cout << ans + 1 << endl;
else cout << ans << endl;
}
| 0
| 311,248
|
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
int main()
{
ll N, K;
cin >> N >> K;
if (N % K == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <iomanip>
#include <cmath>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#define ld long double
#define vi vector<ll>
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define iii pair<int,ii>
#define il pair<ll,ll>
#define vv vector
using namespace std;
const int MAXN = 700 + 5;
set<ii> s[(1<<18)];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int xx = n;
n = (1<<n);
int arr[n];
FOR(i,n)cin >> arr[i];
FOR(i,n)s[i].insert({arr[i],i});
FOR(i,n){
FOR(j,xx){
int v = i|(1<<j);
if(v != i){
for(auto e: s[i])s[v].insert(e);
while(s[v].size() > 2)s[v].erase(s[v].begin());
}
}
}
int mx = 0;
FOR(i,n){
int sum = 0;
for(auto e :s[i])sum += e.ff;
mx = max(mx,sum);
if(i > 0)cout << mx << endl;
}
return 0;
}
| 0
| 10,023,554
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.