code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 44
101M
|
|---|---|---|---|
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string.h>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <cctype>
#include <complex>
#include <regex>
#include <unordered_map>
#include <string>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main(void) {
int A,B,C,D;
cin>>A>>B>>C>>D;
int E,F;
E=min(A,B);
F=min(C,D);
cout<<E+F<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
using v_i = vector<int>;
using v_s = vector<string>;
const int INF = 2147483647;
int main(){
int n;
cin >> n;
v_s s(n);
v_i t(n);
int sum =0;
rep(i,n){
cin >> s[i];
cin >> t[i];
sum+=t[i];
}
string x;
cin >> x;
int num;
rep(i,n){
if(x==s[i])
num = i;
}
int sum2 =0;
for(int i=0;i<=num;i++){
sum2+=t[i];
}
cout << sum-sum2 << endl;
return 0;
}
| 0
| 84,284,075
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll k = 0, dif1 = 0, dif2 = 0;
for (int i = 0; i < n; i++) {
k += b[i] - a[i];
if (a[i] < b[i]) {
dif1 += (b[i] - a[i] + 1) / 2;
} else {
dif2 += a[i] - b[i];
}
}
if (max(dif1, dif2) <= k) {
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 REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;
typedef long double ld;
int N;
void solve() {
cin >> N;
int K = 0;
int x;
for (x = 1; K < N; K += x, x += 1) ;
if (K != N) {
cout << "No\n";
return;
}
cout << "Yes\n";
cout << x << "\n";
vector<vector<int>> ans = vector<vector<int>>(x+1);
int cnt = 1;
K = 0;
for (int i = 1; K < N; K += i, i += 1) {
for (int j = 1; j <= i; j += 1) {
ans[j].push_back(cnt);
ans[i+1].push_back(cnt);
cnt += 1;
}
}
for (int i = 1; i <= x; ++i) {
cout << ans[i].size() << " ";
for (auto j: ans[i]) {
cout << j << " ";
}
cout << "\n";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| 0
| 9,342,285
|
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
int a;
cin >> a;
if(a < 1200){
cout << "ABC";
}
else
{
cout << "ARC";
}
cout << endl;
}
|
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int gcd(int x, int y) {
if (y == 0) return x;
return gcd(y, x%y);
}
const int MAX = 1e6 + 5;
vi isPrime(MAX);
void sieve() {
rep(i, MAX) isPrime[i] = i;
isPrime[0] = isPrime[1] = -1;
for (int x = 2; x*x <= MAX; x++) {
if (isPrime[x] != x) continue;
for (int y = x; y < MAX; y += x) {
isPrime[y] = x;
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n; std::cin >> n;
vi a(n); rep(i, n) std::cin >> a[i];
sieve();
vi cnt(MAX);
rep(i, n) {
set<int> s;
int x = a[i];
while (x != 1) {
s.insert(isPrime[x]);
x /= isPrime[x];
}
for (int v : s) {
cnt[v]++;
}
}
bool ispare = true;
rep(i, MAX) if (cnt[i] > 1) ispare = false;
int gcdv = a[0];
rep(i, n-1) {
gcdv = gcd(gcdv, a[i+1]);
}
if (ispare) {
std::cout << "pairwise coprime" << "\n";
} else if (gcdv == 1) {
std::cout << "setwise coprime" << "\n";
} else {
std::cout << "not coprime" << "\n";
}
}
| 0
| 85,090,912
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main(){
long long int n,b=0;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n-1;i++){
if (a[i+1]<a[i]){
b+=a[i]-a[i+1];
a[i+1]=a[i];
}
}
cout << b << endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define vi vector<int>
#define vii vector<ii>
#define all(x) x.begin(), x.end()
#define EPS 1e-9
#define INF 1e18
#define ROOT 1
#define M 1000000007
#define curtime chrono::steady_clock::now().time_since_epoch().count
#define rep(i, beg, n, s) for (int i = beg; i < n; i += s)
const double PI = acos(-1);
using namespace std;
inline int mod(int n, int m = M) {
int ret = n % m;
if (ret < 0) ret += m;
return ret;
}
int exp(int n, int k) {
if (k == 0) return 1;
if (k == 1) return n;
int ax = exp(n, k / 2);
ax = mod(ax * ax);
if (k % 2) ax = mod(ax * n);
return ax;
}
int gcd(int a, int b) {
if (a == 0)
return b;
else
return gcd(b % a, a);
}
void solution() {
int n, m, x, y;
cin >> n >> m >> x >> y;
cout << fixed << setprecision(10) << (double)(n * m) / 2 << " "
<< (2 * x == n && 2 * y == m) << endl;
}
int32_t main() {
DESYNC;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int t = 1;
#ifdef MULTIPLE_TEST_CASE
cin >> t;
#endif
while (t--) solution();
}
| 0
| 118,551
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
string s; cin>>s;
int n=s.size();
int ans=0;
rep(i,0,n-1){
if(s[i]!=s[i+1]) ++ans;
}
cout<<ans;
return 0;
}
|
#include <iostream>
#include <vector>
#define swap(type,x,y) do{type t=x;x=y;y=t;}while(0)
using namespace std;
int main(){
int n;cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a.at(i);
int mymin;
int k,count=0;
for(int j=0;j<n-1;j++){
k=j;
mymin=101;
for(int i=j;i<n;i++){
if(mymin>a.at(i)){
mymin=a.at(i);
k=i;
}
}
if(j!=k){
swap(int,a.at(j),a.at(k));
count++;
}
}
for(int i=0;i<n;i++){
cout<<a.at(i);
if(i!=n-1) cout<<" ";
}
cout<<endl;
cout<<count<<endl;
}
| 0
| 5,923,175
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl) vl.begin(),vl.end()
#define m_p make_pair
#define sz(a) sizeof(a)
#define forn(mp,it) for(it = mp.begin();it!=mp.end();it++)
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define FORE(i,a,n) FOR(i,a,n+1)
#define Endl endl
#define eNdl endl
#define enDl endl
#define endL endl
int main()
{
string s;
cin>>s;
map<char,ll> mp;
mp[s[0]]++;mp[s[1]]++;mp[s[2]]++;
if(mp['A']&&mp['B'])cout<<"Yes"<<Endl;
else cout<<"No"<<Endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <complex>
#include <cctype>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <assert.h>
#include <numeric>
#include <iomanip>
using ll = long long;
using P = std::pair<ll, ll>;
#define rep(i, a, b) for (ll(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cout << i << "\n"
const ll INF = 100000000;
const ll MOD = 1000000007;
ll pow_mod(ll a,ll b,ll mod){
if(a%mod==0){
return 0;
}
ll x = 1;
while(b>0){
if(b&1){
x = (x * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return x;
}
int main()
{
std::cin.tie(0);
std::ios::sync_with_stdio(false);
ll k;
std::cin >> k;
ll n = 50;
ll a[50];
rep(i,0,50){
a[i] = i + (k / 50);
}
rep(i,0,k%50){
a[i] += n;
rep(j, 0, n)
{
if(i!=j){
a[j]--;
}
}
}
std::cout << n << "\n";
rep(i,0,n){
std::cout << a[i] << " ";
}
return 0;
}
| 0
| 67,145,197
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp = vector<vp>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Debug
istream &operator>>(istream &is, P &a)
{
return is >> a.first >> a.second;
}
ostream &operator<<(ostream &os, const P &a) { return os << "(" << a.first << "," << a.second << ")"; }
template <typename T>
void view(const std::vector<T> &v)
{
#ifndef ONLINE_JUDGE
for (const auto &e : v)
{
std::cout << e << " ";
}
std::cout << std::endl;
#endif
}
template <typename T>
void view(const std::vector<std::vector<T>> &vv)
{
for (const auto &v : vv)
{
view(v);
}
}
#pragma endregion
int main()
{
int n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
ll leftover = 0;
rep(i, n)
{
ans += (a[i] + leftover) / 2ll;
if (a[i] == 0)
leftover = 0;
leftover = (a[i] + leftover) % 2ll;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k; cin>>a>>b>>k;
for(int i=1; i<=k; i++){
if(i%2==1){
if(a%2==0){
a=a/2;
b+=a;
}
else{
a=a-1; a=a/2;
b+=a;
}
}
else{
if(b%2==0){
b=b/2;
a+=b;
}
else{
b=b-1; b=b/2;
a+=b;
}
}
}
cout << a << " " << b << endl;
}
| 0
| 37,549,445
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 998244353
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;
bool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.first < secondElof.first;
}
bool pairCompareSecond(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.second < secondElof.second;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct edge{
ll from,to,cost;
};
typedef vector<vector<edge> > G;
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
ll n,m;
vector<vector<edge> > graph;
ll dp[105][105];
bool used[105][105];
void warshall_floyd(){
for (ll k=0;k<n;k++){
for (ll i=0;i<n;i++){
for (ll j=0;j<n;j++){
if (dp[i][j]>dp[i][k]+dp[k][j]){
dp[i][j]=dp[i][k]+dp[k][j];
}
}
}
}
}
vector<edge> dist;
int main() {
cin >> n >> m;
graph=G(n);
for (ll i=0;i<n;i++){
for (ll j=0;j<n;j++){
if (i==j){
dp[i][j]=0;
}else{
dp[i][j]=INF;
}
}
}
for (ll i=0;i<m;i++){
ll a,b,c;
cin >> a >> b >> c;
a--;
b--;
dp[a][b]=c;
dp[b][a]=c;
edge e;
e.from=a;
e.to=b;
e.cost=c;
dist.push_back(e);
e.from=b;
e.to=a;
e.cost=c;
dist.push_back(e);
}
warshall_floyd();
ll ans=0;
for (ll i=0;i<dist.size();i++){
bool flag=false;
for (ll j=0;j<n;j++){
for (ll k=0;k<n;k++){
if (dp[j][dist[i].from]+dist[i].cost+dp[dist[i].to][k]==dp[j][k]){
flag=true;
}
}
}
if (!(flag)){
ans++;
}
}
cout << ans/2 << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
#define jck 3.141592
const double EPS = 1e-10;
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
ll dp[2010][2010];
int main(){
int N,M; cin >> N >> M;
vector<int> S(N),T(M);
rep(i,N) cin >> S[i];
rep(i,M) cin >> T[i];
rep(i,N+1) dp[i][0] = 1;
rep(i,M+1) dp[0][i] = 1;
rep(i,N)rep(j,M){
if(S[i] == T[j]){
dp[i+1][j+1] += dp[i+1][j]+dp[i][j+1];
dp[i+1][j+1] %= MOD;
}
else{
dp[i+1][j+1] += ((dp[i][j+1]+dp[i+1][j])%MOD-dp[i][j]+MOD)%MOD;
dp[i+1][j+1] %= MOD;
}
}
cout << dp[N][M] << endl;
}
| 0
| 23,393,422
|
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
long long * input_num = new long long[n];
for(int i = 0; i < n; i++) cin >> input_num[i];
long long min = input_num[0];
long long max = input_num[0];
long long sum = 0;
for(int i = 0; i < n; i++) {
if(input_num[i] < min) min = input_num[i];
if(input_num[i] > max) max = input_num[i];
sum += input_num[i];
}
cout << min << " " << max << " " << sum << endl;
delete[] input_num;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
long long a = 0,b = 0,c = 0,d = 0;
long long max = 0;
cin >> a >> b >> c >> d;
max = a * c;
if (max < a * d)
max = a * d;
if (max < b * d)
max = b * d;
if (max < b * c)
max = b * c;
cout << max << endl;
}
| 0
| 85,781,652
|
#include<iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, g;
cin >> a >> b >> c;
if (a <= b) {
d = a;
e = b;
} else {
d = b;
e = a;
}
if (e <= c) {
f = c;
} else {
f = e;
e = c;
}
if (d > e) {
g = d;
d = e;
e = g;
}
cout << d << " " << e << " " << f << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> bool chmax(T &a, U b) { if (a < b) a = b; return true; }
template<class T, class U> bool chmin(T &a, U b) { if (b < a) a = b; return true; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int k; cin >> k;
vi a(k);
rep(i, k) cin >> a[i];
auto f = [&](ll x) {
rep(i, k) x -= x % a[i];
return x;
};
ll left = 0, right = 1e18;
while (right - left > 1) {
ll mid = (right + left) / 2;
if (f(mid) >= 2) right = mid;
else left = mid;
}
if (f(right) != 2) {
cout << -1 << endl;
return (0);
}
cout << left+1 << " ";
left = 0, right = 1e18;
while (right - left > 1) {
ll mid = (right + left) / 2;
if (f(mid) > 2) right = mid;
else left = mid;
}
cout << left << endl;
return (0);
}
| 0
| 54,790,027
|
#include <iostream>
using namespace std;
int main(){
int R, G, B, N, cnt=0;
cin >> R >> G >> B >> N;
for(int r=0; r<=N; r++){
for(int g=0; N - r*R - g*G >= 0; g++){
if( (N - r*R - g*G) % B == 0 ){
cnt++;
}
}
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
double v0[2], v1[2], v2[2], p[2];
while (cin >> v0[0] >> v0[1] >> v1[0] >> v1[1] >> v2[0] >> v2[1] >> p[0] >> p[1])
{
double v0v1[2] = {v1[0]-v0[0], v1[1]-v0[1]},
v1v2[2] = {v2[0]-v1[0], v2[1]-v1[1]},
v2v0[2] = {v0[0]-v2[0], v0[1]-v2[1]},
v0p[2] = {p[0]-v0[0], p[1]-v0[1]},
v1p[2] = {p[0]-v1[0], p[1]-v1[1]},
v2p[2] = {p[0]-v2[0], p[1]-v2[1]},
vv0 = v0v1[0]*v0p[1] - v0v1[1]*v0p[0],
vv1 = v1v2[0]*v1p[1] - v1v2[1]*v1p[0],
vv2 = v2v0[0]*v2p[1] - v2v0[1]*v2p[0];
if((vv0>0 && vv1>0 && vv2>0) || (vv0<0 && vv1<0 && vv2<0)) {
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
return 0;
}
| 0
| 98,039,141
|
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
#define pb(n,m) n.push_back(m)
#define fix(n) cout<<fixed<<setprecision(n);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
int main(){
int n,ans=0; string s;
cin>>n>>s;
vvi v(10);
rep(i,0,n){
int w=s[i]-48;
pb(v[w],i);
}
rep(i,0,1000){
int a=i/100,b=i%100/10,c=i%10;
int x,y,z;
if(v[a].size()==0) continue;
x=v[a][0];
y=lower_bound(all(v[b]),x+1)-v[b].begin();
if(y==v[b].size()) continue;
z=lower_bound(all(v[c]),v[b][y]+1)-v[c].begin();
if(z==v[c].size()) continue;
ans++;
}
co(ans);
return 0;
}
|
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pii;
typedef pair<pii,pii> piiii;
typedef vector<pii> vii;
typedef vector<ll> vi;
typedef queue<ll> qi;
typedef queue<char> qc;
typedef queue<string> qs;
typedef vector<char> vc;
typedef vector<string> vs;
typedef map<char,ll> mpci;
typedef map<ll,ll> mpii;
typedef map<string,ll> mpsi;
typedef set<ll> sei;
typedef set<char> sec;
typedef set<string> ses;
typedef stack<ll> si;
typedef stack<char> sc;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef vector<pll> vpll;
typedef vector<pdd> vdd;
typedef unsigned int uint;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vii> vvii;
#define pb push_back
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define sz(a) (int)(a.size())
#define len(a) (int)(a.length())
#define all(s) (s).begin(),(s).end()
#define fi first
#define se second
#define be begin
#define en end
#define m_p make_pair
#define repd(i,n) for(int i=n-1;i>=0;i--)
#define forn(i,p,n) for(int i=p;i<=n;i++)
#define ford(i,p,n) for(int i=n-1;i>=p;i--)
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();++i)
#define zero(a) memset(a,0,sizeof(a))
#define number(a,num) memeset(a,num,sizeof(a))
inline void read(int &x)
{
short negative=1;
x=0;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-')
negative=-1;
c=getchar();
}
while(c>='0' && c<='9')
x=(x<<3)+(x<<1)+(c^48),c=getchar();
x*=negative;
}
inline void write(long long x) {
static long long sta[35];
long long top = 0;
do {
sta[top++] = x % 10, x /= 10;
} while (x);
while (top) putchar(sta[--top] + 48);
puts("");
}
bool prime(int n)
{
if(n==0||n==1)
return false;
for(int i=2;i*i<=n;i++)
if(n%i==0)
return false;
return true;
}
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
ll a[100010];
ll n,v,p,m;
int main()
{
cin>>n>>m>>v>>p;
rep(i,n)
cin>>a[i];
sort(a,a+n);
ll sum=0,ans=p;
for(int i=n-p-1;i>=0;i--)
{
sum+=a[i+1];
if(a[i]+m>=a[n-p])
{
if(m*(i+p)+(n-p-i)*(a[i]+m)-sum>=m*v)
ans++;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 91,047,672
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b, c;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c;
int v1 = abs(a - b) + abs(a - c);
int v2 = abs(b - a) + abs(b - c);
int v3 = abs(c - b) + abs(a - c);
cout << min(min(v1, v2), v3) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;
int main(void) {
ll N, L;
cin >> N >> L;
ll i;
ll a[MAX];
ll s=0;
for(i=0; i<N; i++) {
cin >> a[i];
}
ll key=-1;
for(i=0; i<N-1; i++) {
if(a[i]+a[i+1]>=L) key=i;
}
if(key==-1) {
pt("Impossible");
return 0;
}
vector<ll> v;
for(i=0; i<key; i++) v.push_back(i);
for(i=N-2; i>key; i--) v.push_back(i);
v.push_back(key);
pt("Possible");
for(i=0; i<N-1; i++) pt(v[i]+1);
}
| 0
| 53,920,031
|
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
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;}
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;
}
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll const mod = 1e9+7;
int main(){
string l; cin >> l;
vector<vector<ll>> dp(l.size()+1, vector<ll>(2, 0));
dp[0][1] = 1;
REP(i, 0, l.size()){
if(l[i] == '0'){
dp[i+1][1] = dp[i][1];
dp[i+1][0] = dp[i][0]*3;
dp[i+1][1] %= mod;
dp[i+1][0] %= mod;
}else{
dp[i+1][1] = dp[i][1] * 2;
dp[i+1][0] = dp[i][0]*3 + dp[i][1];
dp[i+1][1] %= mod;
dp[i+1][0] %= mod;
}
}
cout << (dp[l.size()][0] + dp[l.size()][1] )%mod << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a)
#define chmin(x, a) x = min(x, a)
#define MAX 50000000
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int main() {
int H, W; cin >> H >> W;
vector<vector<char>> s(H+2, vector<char>(W+2));
vector<vector<int>> check(H+2, vector<int>(W+2, MAX));
queue<pair<int, int>> q;
rep(i, W+2) {
s[0][i] = '#';
s[H][i] = '#';
}
rep(i, H+2) {
s[i][0] = '#';
s[i][W+1] = '#';
}
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> s[i][j];
if (s[i][j] == '#') {
check[i][j] = 0;
q.push(make_pair(i, j));
}
}
}
int ans = 0;
while(!q.empty()) {
pair<int, int> tmp = q.front(); q.pop();
for (int k = 0; k < 4; k++) {
if (check[tmp.first+dy[k]][tmp.second+dx[k]] > check[tmp.first][tmp.second] + 1 && s[tmp.first+dy[k]][tmp.second+dx[k]] == '.') {
q.push(make_pair(tmp.first+dy[k], tmp.second+dx[k]));
check[tmp.first+dy[k]][tmp.second+dx[k]] = check[tmp.first][tmp.second] + 1;
ans = max(ans, check[tmp.first+dy[k]][tmp.second+dx[k]]);
}
}
}
cout << ans << endl;
}
| 0
| 75,748,114
|
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
inline void wt_L(char a){
putchar_unlocked(a);
}
inline void wt_L(int x){
int s=0;
int m=0;
char f[10];
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
putchar_unlocked('-');
}
while(s--){
putchar_unlocked(f[s]+'0');
}
}
int N;
int A[200000];
int s[200000];
int v[200000];
int sz;
int add(int k, int z){
if(k==0){
return 0;
}
if(sz==0 || s[sz-1] < k){
s[sz] = k;
v[sz++] = 1;
return 1;
}
v[sz-1]++;
if(v[sz-1]==z){
sz--;
return add(k-1,z);
}
return 1;
}
int main(){
int i;
int res;
rd(N);
{
int Lj4PdHRW;
for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
rd(A[Lj4PdHRW]);
}
}
int KL2GvlyY;
int Q5VJL1cS;
int e98WHCEY;
KL2GvlyY = 1;
Q5VJL1cS = N;
while(KL2GvlyY < Q5VJL1cS){
if((KL2GvlyY + Q5VJL1cS)%2==0){
e98WHCEY = (KL2GvlyY + Q5VJL1cS) / 2;
}
else{
e98WHCEY = (KL2GvlyY + Q5VJL1cS - 1) / 2;
}
sz = 0;
for(i=(1);i<(N);i++){
if(A[i-1] < A[i]){
continue;
}
while(sz && s[sz-1] > A[i]){
sz--;
}
if(e98WHCEY==1){
break;
}
if(!add(A[i],e98WHCEY)){
break;
}
}
if(i==N){
Q5VJL1cS = e98WHCEY;
}
else{
KL2GvlyY = e98WHCEY + 1;
}
}
res =Q5VJL1cS;
wt_L(res);
wt_L('\n');
return 0;
}
|
#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long int ll;
const ll mod=1e9+7;
ll f[2006];
int main()
{
ios;
f[0]=1;
for(int i=3;i<=2000;++i)
for(int j=3;j<=i;++j)
{
f[i]=(f[i]+f[i-j])%mod;
}
int s;
cin>>s;
cout<<f[s]<<'\n';
}
| 0
| 99,996,214
|
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repm(i, a, n) for (int i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vs vector<string>
#define vii vector<vector<int>>
#define vll vector<ll>
#define vllll vector<vector<ll>>
#define vd vector<double>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define reverse_v(a) reverse(a.begin(), a.end())
#define fi first
#define se second
void print(bool c)
{
(c) ? (cout << "Yes" << endl) : (cout << "No" << endl);
}
void Print(bool c)
{
(c) ? (cout << "YES" << endl) : (cout << "NO" << endl);
}
template <typename T>
T gcd(T a, T b)
{
while (1)
{
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
template <typename T>
T lcm(T a, T b)
{
return a * b / gcd(a, b);
}
bool cmp(const pii &a, const pii &b)
{
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(void)
{
string s;
cin >> s;
ll k, ans = 0;
cin >> k;
bool flag = true;
char cc = s[0];
rep(i, 0, s.size())
{
if (s[i] != cc)
flag = false;
}
if (flag)
ans = (s.size() * k) / 2;
else
{
int a = 1, b = 1;
rep(i, 1, s.size())
{
if (s[i] == s[i - 1])
a++;
else
break;
}
repm(i, s.size() - 2, 0)
{
if (s[i] == s[i + 1])
b++;
else
break;
}
ll cnt2 = 0;
char c3 = 'A';
rep(i, 0, s.size())
{
if (s[i] != c3)
{
c3 = s[i];
ans += k * (cnt2 / 2);
cnt2 = 1;
}
else
{
cnt2++;
if (i == s.size() - 1)
ans += k * (cnt2 / 2);
}
}
if (s[0] == s[s.size() - 1])
ans -= (k - 1) * (a / 2 + b / 2 - (a + b) / 2);
}
cout << ans << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main(){
int n, m;
cin >> n >> m;
vector<bool> check(n, false);
vi cnt(n, 0);
rep(i, 0, m){
int p;
string s;
cin >> p >> s;
p--;
if(s == "WA"){
if(check[p] == false)
cnt[p]++;
}
else if(s == "AC")
check[p] = true;
}
int ac = 0;
int wa = 0;
rep(i, 0, n){
if(check[i]){
ac++;
wa += cnt[i];
}
}
cout << ac << " " << wa << endl;
return 0;
}
| 0
| 78,636,349
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
string s;
cin >> s;
int l=0;int r=s.size()-1;
int ans = 0;
while(l<r){
if(s.at(l) == s.at(r)){
++l; --r;
}else{
if(s.at(l) != 'x' && s.at(r) != 'x'){
ans = -1;
break;
}else if(s.at(l) == 'x'){
ans ++;
l++;
}else{
ans ++;
r--;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
char judge(int m,int r,int f){
char grade;
int sum=m+r;
if(m==-1 || r==-1) grade='F';
else if(sum>=80) grade='A';
else if(sum>=65) grade='B';
else if(sum>=50) grade='C';
else if(sum>=30){
grade='D';
if(f>=50) grade='C';
}
else grade='F';
return grade;
}
int main(void){
int m,r,f;
while(1){
std::cin>>m>>r>>f;
if(m==-1&&r==-1&&f==-1) break;
std::cout<<judge(m,r,f)<<std::endl;
}
return 0;
}
| 0
| 94,184,746
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int N;
cin >> N;
double k = 0;
REP(i, N) {
double x;
string u;
cin >> x >> u;
k += u == "JPY" ? x : x*380000;
}
printf("%.8f\n", k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
if(S.size() <= N){
cout << S << endl;
return 0;
} else if(N < S.size()) {
S.erase(N);
cout << S << "..." << endl;
return 0;
}
}
| 0
| 14,918,443
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,a,b) for (int i = (a); i < (b); ++i)
int main(){
string s,t;
cin>>s>>t;
if(s[0]==t[2] && s[1]==t[1] && s[2]==t[0]) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int minnum = 200050;
int cnt = 0;
int n; cin>> n;
vector<int> tmp;
vector<int> p(n);
forin(p, n);
for(int i=0; i<n; i++){
tmp.push_back(p[i]);
minnum = min(minnum, p[i]);
if(minnum == p[i]) cnt++;
}
cout<< cnt << endl;
}
| 0
| 32,493,661
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << v << s; }
template <typename T> void in(T &v) { cin >> v; }
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
int n; in(n);
vector<ll> A(n+1),B(n);
loop(i,0,n+1) in(A[i]);
loop(i,0,n) in(B[i]);
ll ans = 0;
loop(i,0,n) {
ll &a1 = A[i]; ll &a2 = A[i+1]; ll &b = B[i];
ll d = min(a1, b);
a1 -= d; b -= d;
ll d2 = min(a2, b);
a2 -= d2; b -= d2;
ans += d + d2;
}
print(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define REP2(i, n) for (LL i = 1; i <= (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (x).end()
#define SUM(x) accumulate(x.begin(), x.end(),0)
#define vLL(v,n) vector<LL> v(n); REP(i,n)cin>>v[i];
#define vstr(v,n) vector<string> v(n); REP(i,n)REP(i,n)cin>>v[i];
LL INF = 1e9 + 1;
LL MOD = 1e9+7;
LL a,b,c,d,e,n,m,l,k,r,x,y,z,ans=0,ans2=0,cnt=0;
string s,S,t;
int main() {
ios_base::sync_with_stdio(false);
cin >> a>>b>>k;
for ( int i = min (a , b ); i >= 1; --i ) {
if(a%i==0&&b%i==0){
--k ;
if(0==k){
cout <<i<<endl;
return 0;
}
}
}
}
| 0
| 73,168,329
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, k, x, y;
cin >> n >> k >> x >> y;
int firstk = min(n, k);
int remainingnights = n - min(n, k);
cout << (long long)firstk*x + remainingnights*y;
}
|
#include <bits/stdc++.h>
using namespace std;
# define ll long long
# define endl "\n"
# define str string
# define vll vector<ll>
# define pb push_back
# define mll map<ll,ll>
# define mp make_pair
# define ff first
# define ss second
# define pll pair<ll,ll>
# define f(x,y) for(int x=0;x<y;x++)
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
ll y;
cin>>y;
if(y%2 !=0){
cout<<0;
}
else{
ll ans=0;
ll k=10;
while(k<=y){
ans=ans+y/k;
k=k*5;
}
cout<<ans;
}
return 0;
}
| 0
| 9,398,568
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define lb lower_bound
#define ub upper_bound
#define si(c) (int)((c).size())
#define lcm(a, b) (a * (b / __gcd(a,b)))
#define inf (int)(4e18)
#define endl '\n'
#define mp make_pair
#define time(s) (double(clock()-s)/double(CLOCKS_PER_SEC))
#define debug(args...) _F(#args, args)
#define vi std::vector<int>
#define pii pair<int, int>
#define vpi vector<pii>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
clock_t start;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
template<typename T> void _F(const char *name, T arg1){ cerr << name << " = " << arg1 << endl;}
template<typename T, typename... Args> void _F(const char *names, T arg1, Args... args)
{ const char *name = strchr(names, ',');cerr.write(names, name-names) << " = " << arg1 << endl;_F(name+2, args...);}
template< typename T1, typename T2 > istream& operator>>(istream& in, pair<T1, T2> &q){ in >> q.F >> q.S; return in;}
template< typename T1, typename T2 > ostream& operator<<(ostream& out, pair<T1, T2> &q){ out << q.F << " " << q.S; return out;}
template< typename T1, typename T2 > pair<T1, T2> operator+(pair<T1, T2> p1, pair<T1, T2> p2){ return {p1.F+p2.F, p1.S+p2.S};}
template< typename T1, typename T2 > pair<T1, T2> operator-(pair<T1, T2> p1, pair<T1, T2> p2){ return {p1.F-p2.F, p1.S-p2.S};}
template< typename T1, typename T2 > bool operator<(pair<T1, T2> p1, pair<T1, T2> p2){ return p1 < p2 ;}
template<typename T> void Unique(vector<T> &v) {
sort(all(v)), v.resize(distance(v.begin(), unique(all(v))));
}
const int N = 1e5+1;
int vis[N];
void solve() {
int n, x, m;
cin >> n >> x >> m;
if(n == 1) {
cout << x << endl;
return;
}
int cur[m+1], i = 1, sum[m+1] = {0};
cur[1] = x;
sum[1] = x;
vis[x] = 1;
for(i = 2; i <= n; i++) {
cur[i] = (cur[i-1]*cur[i-1])%m;
if(vis[cur[i]]) break;
sum[i] += cur[i]+sum[i-1];
vis[cur[i]] = i;
}
n -= vis[cur[i]]-1;
int ans = sum[vis[cur[i]]-1];
ans += (sum[i-1]-sum[vis[cur[i]]-1])*(n/(i-vis[cur[i]]));
n %= (i-vis[cur[i]]);
ans += (sum[vis[cur[i]]+n-1]-sum[vis[cur[i]]-1]);
cout << ans << endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
start = clock();
int test = 1;
cout << fixed << setprecision(2);
for(int i = 1; i <= test; ++i){
solve();
}
cerr << time(start);
return 0;
}
|
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> x(N), y(N), z(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i) >> z.at(i);
}
vector<int> sgn = {1, -1};
ll ans = 0;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < 2; k++) {
vector<ll> A(N);
for (int n = 0; n < N; n++) {
A.at(n) = sgn[i] * x[n] + sgn[j] * y[n] + sgn[k] * z[n];
}
sort(A.begin(), A.end(), greater<ll>());
chmax(ans, accumulate(A.begin(), A.begin() + M, 0LL));
}
}
}
cout << ans << endl;
}
| 0
| 42,302,496
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
for (int i = 100; i > 0; i /= 10) {
if (N / i == 7) {
cout << "Yes" << endl;
return 0;
}
N %= i;
}
cout << "No" << endl;
}
|
#include<stdio.h>
int main(void)
{
int a,b,i,j;
scanf("%d %d",&a,&b);
while(a!=0 || b!=0){
for(i=0;i<a;i++){
for(j=0;j<b;j++){
printf("#");
}
printf("\n");
}
printf("\n");
scanf("%d %d",&a,&b);
}
return 0;
}
| 0
| 93,770,536
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
char a;
int count[26] = { 0 };
a = getchar();
while (a != EOF)
{
if ('a' <= a && a <= 'z')
{
count[a- 'a']++;
}
if ('A' <= a && a <= 'Z')
{
count[a- 'A']++;
}
a = getchar();
}
for (int i=0 ; i < 26 ; i++)
{
cout<<char(i + 'a')<<" : "<<count[i]<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main() {
cin >> s;
int cnt = 0;
int n = s.length();
for (auto c : s) {
if (c == '1')
++cnt;
}
cout << min(cnt, n - cnt) * 2 << endl;
return 0;
}
| 0
| 14,218,587
|
#include<iostream>
using namespace std;
long long F[100000] = {};
long long f(int);
int main(){
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
long long f(int k){
if(F[k] != 0) return F[k];
else if (k <= 1) return F[k] = 1;
else{
return F[k] = f(k-1) + f(k-2);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> an(n);
for(int i=0; i<n; ++i) cin >> an[i];
sort(an.begin(),an.end());
int ans = 0;
for(int i=0; i<n; ++i){
if(i == 0 && an[i] > 0) ans -= an[0];
else if(i == n-1 && an[i] < 0) ans += an[n-1];
else ans += abs(an[i]);
}
cout << ans << endl;
for(int i=n-2; an[i]>=0 && i>0; --i){
printf("%d %d\n", an[0], an[i]);
an[0] -= an[i];
}
for(int i=1; an[i]<0 && i<n-1 ; ++i){
printf("%d %d\n", an[n-1], an[i]);
an[n-1] -= an[i];
}
printf("%d %d\n", an[n-1], an[0]);
}
| 0
| 40,147,908
|
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define range(i,l,h) for(int i=l;i<h;i++)
#define endl '\n'
#define I INT_MAX
#define L INT_MIN
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vi vector<int>
using namespace std;
using std::ios;
constexpr int MOD=1e9+7;
constexpr int mod=998244353;
int main()
{
string s;
cin>>s;
int n=s.length();
ll sum=0;
int i=0;
while(i<n)
{
ll cnt1=0,cnt2=0;
while(i<n&&s[i]=='<')
{
cnt1++;
i++;
}
while(i<n&&s[i]=='>')
{
cnt2++;
i++;
}
if(cnt1>cnt2)
{
cnt2--;
}
else
{
cnt1--;
}
sum+=(cnt2*(cnt2+1)/2);
sum+=(cnt1*(cnt1+1)/2);
}
cout<<sum<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7ll;
const double PI=3.14159265358979323846;
vector<vector<vector<int>>> dp(90, vector<vector<int>>(90, vector<int>(25700)));
vector<vector<int>> A(90, vector<int>(90));
vector<vector<int>> B(90, vector<int>(90));
int main() {
ll n; cin >> n;
if(n % 2 == 1ll) {
cout << 0 << endl;
return 0;
}
ll res = 0;
n /= 2ll;
while(n > 0) {
n /= 5ll;
res += n;
}
cout << res << endl;
return 0;
}
| 0
| 50,525,811
|
#include<iostream>
#include<string>
#include<stack>
using namespace std;
int main(){
string a;
while(getline(cin,a)){
if(a[0]=='.')break;
stack<char> b;
int c=0;
for(int i=0;i<a.size();i++){
if(a[i]=='['||a[i]=='(')b.push(a[i]);
if(a[i]==']'||a[i]==')'){
if(b.empty())c++;
else if((b.top()=='['&&a[i]==']')||(b.top()=='('&&a[i]==')'))b.pop();
else c++;
}
}
if(c==0&&b.empty())cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a[5+1];
for (int i = 1; i <= 5; i++)
cin >> a[i];
for (int j = 2; j <= 5; j++) {
int key = a[j];
int i = j-1;
while (i >= 1 && a[i] < key) {
a[i+1] = a[i];
i--;
}
a[i+1] = key;
}
for (int i = 1; i < 5; i++) {
cout << a[i] << " ";
}
cout << a[5] << endl;
return 0;
}
| 0
| 89,374,634
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s; cin >> s;
set<char> u;
string ans = "no";
int sn = s.size();
rep(i,sn) u.insert(s[i]);
if (u.size() == sn) ans = "yes";
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define N 100010
ll n,a[N],b[N],s[N];
int main(){
cin>>n;
for(int i=0;i<=n;i++)cin>>a[i];
if(n==0){
if(a[0]==1)cout<<1<<endl;
else cout<<-1<<endl;
return 0;
}
if(a[0]>0){
cout<<-1<<endl;
return 0;
}
s[n+1]=0;
for(int i=n;i>=0;i--){
s[i]=s[i+1]+a[i];
}
b[0]=1;
for(int i=1;i<=n;i++){
b[i]=2*b[i-1]-a[i];
chmin(b[i],s[i+1]);
if(b[i]<0||a[i]+b[i]<b[i-1]){
cout<<-1<<endl;
return 0;
}
}
ll ans=0;
for(int i=0;i<=n;i++){
ans+=a[i]+b[i];
}
cout<<ans<<endl;
}
| 0
| 69,780,296
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n);
for(int i = 0; i < n; i++) cin >> h[i];
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]));
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
struct SegmentTree {
int n;
vector<int> dat;
SegmentTree(int n_) {
n = 1;
while (n < n_) n *= 2;
dat.resize(2*n-1, INF);
}
void update(int k, int a) {
k += n-1;
dat[k] = a;
while (k > 0) {
k = (k-1)/2;
dat[k] = min(dat[k*2+1], dat[k*2+2]);
}
}
int query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0) r = n;
if (r <= a || b <= l) return INF;
if (a <= l && r <= b) return dat[k];
int vl = query(a, b, k*2+1, l, (l+r)/2);
int vr = query(a, b, k*2+2, (l+r)/2, r);
return min(vl, vr);
}
};
int main() {
int h, w, m;
cin >> h >> w >> m;
vector<int> ch(h), cw(w);
vector<int> bom[h];
rep(i, m) {
int x, y;
cin >> x >> y;
--x; --y;
ch[x]++; cw[y]++;
bom[x].push_back(y);
}
int ans = 0;
SegmentTree st(w);
rep(i, w) st.update(i, -cw[i]);
rep(i, h) {
for (auto y: bom[i]) st.update(y, -cw[y]+1);
ans = max(ans, ch[i]-st.query(0, w));
for (auto y: bom[i]) st.update(y, -cw[y]);
}
cout << ans << endl;
}
| 0
| 88,634,446
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m; cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
int k; cin >> k;
for (int j = 0; j < k; j++) {
int x; cin >> x;
x--;
s[i].push_back(x);
}
}
vector<int> p(m);
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int ans = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
vector<bool> switchOn(n, false);
for (int i = 0; i < n; ++i) {
if (bit & (1 << i)) {
switchOn[i] = true;
}
}
int onCnt = 0;
for (int i = 0; i < m; i++) {
int tmpCnt = 0;
for (auto u : s[i]) {
if (switchOn[u]) tmpCnt++;
}
if (tmpCnt % 2 == p[i]) onCnt++;
}
if (onCnt == m) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
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<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
int main() {
string s;
cin >> s;
int n = s.length();
int m = 7;
REP(i,m){
int j = m - i;
string t = s.substr(0, i);
t += s.substr(n - j, j);
if (t == "keyence"){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| 0
| 35,213,741
|
#include <bits/stdc++.h>
#include<numeric>
#include<cstdlib>
#include <iostream>
#define ll long long int
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define v vector<long long int>
#define vv vector< int>
#define gcd(m,n) __gcd(m,n)
#define vp vector<pair<long long int ,long long int>>
#define pb push_back
#define mp make_pair
#define pp pop_back
#define iter vector<int>::iterator
#define pa pair<long long int ,long long int>
#define f(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,n) for (ll i=a ; i<n ;i+=1)
#define fe(d,e) for(auto d:e)
#define mod 1000000007
#define F first
#define S second
#define sett set<long long int>
#define um unordered_map<ll,ll>
# define N 100005LL
# define cout1(x) cout<<x<<"\n";
# define deb(x) cout<<#x<<" "<<x<<"\n";
#define vii vector<pa>;
using namespace std;
v visited(N);
vector<ll> ans={-1};
v level(N);
v ind(N);
ll sz[N];
int main(){
ll n;
cin>>n;
v arr(n);
f(i,n)cin>>arr[i];
v pre(n);
pre[n-1]=arr[n-1];
for(ll i=n-2;i>0;i--){
pre[i]=pre[i+1]+arr[i];
}
ll ans=0;
f(i,n-1){
ans+=(pre[i+1]*arr[i]);
}
cout1(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll N, K;
cin >> N >> K;
vector<ll> P(N+1, 0), C(N+1, 0);
rep(i, N) cin >> P[i+1];
rep(i, N) cin >> C[i+1];
ll ans = -4e18;
rep(i, N){
ll k = K, tmp = 0, now = i+1, next = P[now];
vector<int> seen(N+1, 0);
while (seen[next] < 2 && k > 0){
seen[next]++;
tmp += C[next];
now = next;
next = P[now];
chmax(ans, tmp);
k--;
}
ll loop = 0, add = 0;
rep(i, N+1){
if (seen[i] == 2){
loop++;
add += C[i];
}
}
ll cnt = 0;
if (loop > 0)
cnt = k/loop;
cnt--;
if (cnt > 0){
tmp += add * cnt;
k -= loop * cnt;
}
chmax(ans, tmp);
while (k > 0){
tmp += C[next];
now = next;
next = P[now];
chmax(ans, tmp);
k--;
}
}
cout << ans << endl;
}
| 0
| 16,515,944
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
int X;
cin >> X;
if (X >= 1800) {
cout << 1 << endl;
} else if (X >= 1600) {
cout << 2 << endl;
} else if (X >= 1400) {
cout << 3 << endl;
} else if (X >= 1200) {
cout << 4 << endl;
} else if (X >= 1000) {
cout << 5 << endl;
} else if (X >= 800) {
cout << 6 << endl;
} else if (X >= 600) {
cout << 7 << endl;
} else {
cout << 8 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int a, b, c;
cin >> a >> b >> c;
int fi, se, th;
if(a > b){
if(b > c){
fi = a;
se = b;
th = c;
}
else{
if(c > a){
fi = c;
se = a;
th = b;
}
else{
fi = a;
se = c;
th = b;
}
}
}
else{
if(a > c){
fi = b;
se = a;
th = c;
}
else{
if(c > b){
fi = c;
se = b;
th = a;
}
else{
fi = b;
se = c;
th = a;
}
}
}
cout << fi*10 + se + th << endl;
return 0;
}
| 0
| 89,626,671
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define clr(v) v.clear()
vector<ll>v;
pair<ll,ll>p;
map<ll,ll>mp;
set<ll>st;
deque<ll>dq;
priority_queue<ll>pq;
#define f(i,b) for(i=0;i<b;i++)
#define f1(i,b) for(i=1;i<=b;i++)
#define fr(i,b)for(i=b-1;i>=0;i--)
ll mn=INT_MAX,mx=INT_MIN;
ll n,m,tc,i,j,tmp,sum,cn,ans,res,pos,flag;
string s;
ll a[200007],b[200007];
int main()
{
io;
string str;
cin>>s>>str;
ll l=s.size();
if(l!=str.size())
{
puts("No");
}
else
{
for(i=0;i<l;i++)
{
bool flag=true;
for(j=0;j<l;j++)
{
if(s[j]!=str[(j+i)%l])
{flag=false;}
}
if(flag==true)
{
puts("Yes");
return 0;
}
}
puts("No");
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
#define P pair<ll,ll>
#define vl vector<ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvl vector<vector<ll>>
#define print(n) cout<<n<<endl
const int M=100010;
const int MOD=1000000007;
const int inf=1000000007;
const long long INF=1000000000000000007;
using ll=long long;
int nomal(){
int ans=0;
ans=5*20+5*19;
return ans;
}
int mod3(){
int ans=0;
ans=20*10;
return ans;
}
int so_nissu(){
int ans=0;
ans+=333*mod3()+666*nomal();
return ans;
}
int main(){
int n,y,m,d;
int ans=so_nissu();
cin>>n;
rep(i,0,n){
int cnt=0;
cin>>y>>m>>d;
if(y%3==0){
cnt=(y/3-1)*mod3()+y*2/3*nomal();
cnt=cnt+(m-1)*20+d-1;
}else{
cnt=y/3*mod3()+(y/3*2+y%3-1)*nomal();
if(m%2==1){
cnt=cnt+m/2*39+d-1;
}else{
cnt=cnt+m/2*19+(m/2-1)*20+d;
}
}
print(ans-cnt);
}
return 0;
}
| 0
| 32,092,187
|
#include<iostream>
#include<cmath>
#include<math.h>
using namespace std;
int main(){
double a,b,c;
cin >> a >> b >> c;
cout << fixed << 0.5*a*b*sinf(c*M_PI/180) << endl;
cout << fixed << a + b + sqrt(pow(a, 2) + pow(b, 2) - 2*a*b*cosf(c*M_PI/180)) << endl;
cout << fixed << b*sin(c*M_PI/180) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f,oo = inf;
#define pi 3.14159265358979323846
#define IL inline
#define RG register
#define rep(i,a,b) for(RG int i=(a);i<(b);++i)
#define Rep(i,a,b) for(RG int i=(a);i<=(b);++i)
#define Dep(i,a,b) for(RG int i=(a);i>=(b);--i)
#define pc putchar
#define gc getchar
IL ll read(){
RG ll x=0;char f=0;RG char c=gc();
for(;!isdigit(c);c=gc())f|=(c=='-');
for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c^48);
return f?-x:x;
}
IL double readdb(){
RG double x=0,p=0.1;RG char f=0,c=gc();
for(;!isdigit(c);c=gc())f|=(c=='-');
for(;isdigit(c);c=gc())x=x*10+(c^48);
if(c=='.')for(c=gc();isdigit(c);c=gc(),p/=10)x=x+(c^48)*p;
return f?-x:x;
}
IL void write(ll x){if(x<0)x=-x,pc('-');if(x>=10)write(x/10);pc(x%10+'0');}
IL void writeln(ll x){write(x);puts("");}
IL void writeln(ll x,char c,ll y){write(x);pc(c);writeln(y);}
IL void writeln(ll x,char c,ll y,char d,ll z){write(x);pc(c);write(y);pc(d);writeln(z);}
#define debug(x) printf(#x" = %d\n",x);
#define rd() read()
#define rdb() readdb()
#define mem(x,v) memset(x,v,sizeof(x))
#define pb push_back
#define mp make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) ((x)&(-(x)))
#define fin(x) freopen(#x".in","r",stdin)
#define fout(x) freopen(#x".out","w",stdout)
#define y1 ____y1
#define hash __hash
#define union _union
const int maxn = 100500;
int sg[maxn],n,m;
vector<int> edge[maxn];
void dfs(int u,int fa){
sg[u] = 0;
for(unsigned i=0;i<edge[u].size();++i){
int v = edge[u][i];
if(v ==fa) continue;
dfs(v,u);
sg[u] ^= (sg[v] + 1);
}
}
int main(){
n = rd();
Rep(i,1,n) edge[i].clear();
rep(i,1,n){
int a = rd(),b = rd();
edge[a] . push_back(b);
edge[b] . push_back(a);
}
dfs(1,0);
puts(sg[1] ? "Alice" : "Bob");
return 0;
}
| 0
| 81,169,205
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
int mod=1e9+7;
signed main(){
int n;
cin>>n;
int a=0;
int b=0;
for(int i=0;i<n;i++){
string s,t;
cin>>s>>t;
if(s>t)a+=3;
if(s<t)b+=3;
if(s==t)a++,b++;
}
cout<<a<<" "<<b<<endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <climits>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 5;
ll mod_pow(ll k, ll p)
{
if (k == 0)
{
return 1 % p;
}
if (k == 1)
{
return 2 % p;
}
if (k % 2 == 0)
{
ll tmp = mod_pow(k / 2, p);
return tmp * tmp % p;
}
else
{
ll tmp = mod_pow((k - 1) / 2, p);
tmp *= tmp;
tmp %= p;
tmp *= 2;
tmp %= p;
return tmp;
}
}
ll pow_fast(ll n, ll k)
{
if (k == 0)
{
return 1;
}
if (k == 1)
{
return n;
}
if (k % 2 == 0)
{
ll tmp = pow_fast(n, k / 2) % MOD;
return tmp * tmp % MOD;
}
else
{
ll tmp = pow_fast(n, (k - 1) / 2);
return tmp * tmp * n;
}
}
map<ll, ll> sosuu(ll n)
{
map<ll, ll> mp;
for (ll i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
n /= i;
mp[i] += 1;
}
}
if (n != 1)
{
mp[n] += 1;
}
return mp;
}
int main()
{
ll N;
cin >> N;
cout << (N) * (N - 1) /2 << endl;
}
| 0
| 90,963,804
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int N,D,rs=0;
double wa=0,ans=0;
int digi=0;
cin >> N >> D;
vector<vector <int>> X(N,vector<int>(D));
for(int i = 0;i < N;i++)
for(int j = 0;j < D;j++){
cin >> X.at(i).at(j);
}
for(int i = 0;i < N - 1;i++){
for(int j = i + 1;j < N;j++){
wa=0;
for(int k = 0;k < D;k++){
wa += (X.at(i).at(k) - X.at(j).at(k)) * (X.at(i).at(k) - X.at(j).at(k));
}
ans = sqrt(wa);
digi = 0;
while(digi < ans){
digi++;
}
if((ans-digi) == 0)
rs++;
}
}
cout << rs << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> piipi;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
char s[55];
int cnt[26], cnt2[26];
int main(){
int n;
scanf("%d", &n);
for(int i=0;i<26;i++) cnt[i] = 1e9;
for(int i=1;i<=n;i++){
scanf("%s", s);
int l = strlen(s);
memset(cnt2, 0, sizeof(cnt2));
for(int i=0;i<l;i++){
cnt2[s[i]-'a']++;
}
for(int i=0;i<26;i++){
cnt[i] = min(cnt[i], cnt2[i]);
}
}
for(int i=0;i<26;i++){
for(int j=0;j<cnt[i];j++) printf("%c", i+'a');
}
}
| 0
| 98,935,372
|
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long int> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<long long int> v1(n, 0), v2(n, 0);
v1[0] = max(v[0], (long long int)0);
v2[n - 1] = max(v[n - 1], (long long int)0);
vector<long long int> v3(n, 0);
v3[0] = v[0];
for (int i = 1; i < n; i++) {
v1[i] = v1[i - 1] + max(v[i], (long long int)0);
v2[n - i - 1] = v2[n - i] + max(v[n - i - 1], (long long int)0);
v3[i] = v[i] + v3[i - 1];
}
long long int res = 0;
for (int i = 0; i + k <= n; i++) {
long long int r = 0;
if (i - 1 >= 0) {
r += v1[i - 1];
}
if (i + k < n) {
r += v2[i + k];
}
r += max((long long int)0, v3[i + k - 1] - (i > 0 ? v3[i - 1] : 0));
res = max(res, r);
}
cout << res << endl;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
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<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
vector<ll> B,C,D,E;
int main(){
ll N,A;
cin >> N;
rep(i,N){
cin >> A;
if(A<0){
C.pb(A);
}
else{
B.pb(A);
}
}
if(B.size()>0){
sort(ALL(B));
}
if(C.size()>0){
sort(ALL(C));
}
ll T;
if(B.size()==0){
T=C[C.size()-1];
rep(i,C.size()-1){
D.pb(T);
E.pb(C[i]);
T=T-C[i];
}
}
else if(C.size()==0){
T=B[0];
rep(i,B.size()-2){
D.pb(T);
E.pb(B[i+1]);
T=T-B[i+1];
}
D.pb(B[B.size()-1]);
E.pb(T);
T=B[B.size()-1]-T;
}
else{
T=C[0];
rep(i,B.size()-1){
D.pb(T);
E.pb(B[i]);
T=T-B[i];
}
D.pb(B[B.size()-1]);
E.pb(T);
T=B[B.size()-1]-T;
rep(i,C.size()-1){
D.pb(T);
E.pb(C[i+1]);
T=T-C[i+1];
}
}
cout << T << endl;
rep(i,D.size()){
cout << D[i] << " " << E[i] << endl;
}
}
| 0
| 6,848,777
|
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#define all(c) (c).begin(),(c).end()
using namespace std;
int main(void){
int n;
while(cin >> n,n){
vector<int>a(n);
for(int i=0;i<n;i++)cin >> a[i];
sort(all(a));
int ans = 1<<29;
for(int i=0;i+1<n;i++)
ans = min(ans,a[i+1]-a[i]);
cout << ans << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pii>
#define vpipii vector<pipii>
#define vpiipi vector<piipi>
#define pb push_back
#define pob pop_back
#define pii pair<int,int>
#define pipii pair<int,pii>
#define piipi pair<pii,int>
#define pld pair<long double,long double>
#define mod 1000000007
#define rep(i,n) for (int i = 0; i < n; i++)
#define repp(i,a,b) for(int i = a ; i<b ; i++)
#define reppr(i,a,b) for(int i = a-1 ; i>=b ; i--)
#define repr(i,n) for (int i = n - 1; i >= 0; i--)
#define ff first
#define ss second
#define pc putchar_unlocked
#define gc getchar_unlocked
#define inf 9223372036854775807
#define infn -9223372036854775807
#define pi 3.14159265358979323846
#define eps 0.0000000001
#define sp << " " <<
#define setprec(x) cout << fixed << setprecision(x);
#define REVERSE(a) reverse(all(a));
#define SORT(a) sort(all(a));
#define all(n) n.begin(),n.end()
int gcd (int a, int b) { return b ? gcd (b, a % b) : a; }
int lcm (int a, int b) { return a / gcd(a, b) * b; }
int powmod(int x,int y)
{
if (y == 0) return 1;
int p = powmod(x, y/2) % mod;
p = (p * p) % mod;
return (y%2 == 0)? p : (x * p) % mod;
}
int inverse(int a)
{
return powmod(a,mod-2);
}
int fact[500010], factinv[500010] , coefficientflag = 0;
void Util_nCr()
{
fact[0] = 1 , factinv[0] = 1;
repp(i,1,500010)
{
fact[i] = (fact[i-1] * i)%mod;
factinv[i] = (factinv[i-1] * inverse(i))%mod;
}
}
int nCr(int n , int r)
{
if(!coefficientflag) coefficientflag = 1 , Util_nCr();
return ((fact[n] * inverse(fact[n-r]) % mod * inverse(fact[r]))%mod) ;
}
void solve();
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int t = 1;
rep(i,t)
{
solve();
}
}
int sumSubarrayMins(int A[], int n)
{
int left[n], right[n];
stack<pair<int, int> > s1, s2;
for (int i = 0; i < n; ++i) {
int cnt = 1;
while (!s1.empty() && (s1.top().first) > A[i]) {
cnt += s1.top().second;
s1.pop();
}
s1.push({ A[i], cnt });
left[i] = cnt;
}
for (int i = n - 1; i >= 0; --i) {
int cnt = 1;
while (!s2.empty() && (s2.top().first) >= A[i]) {
cnt += s2.top().second;
s2.pop();
}
s2.push({ A[i], cnt });
right[i] = cnt;
}
int result = 0;
for (int i = 0; i < n; ++i)
result = (result + A[i] * left[i] * right[i]);
return result;
}
void solve()
{
int n;
cin >> n;
vpii a(n);
rep(i,n)
{
cin >> a[i].ff , a[i].ss = i;
}
SORT(a);
int diff = 0;
rep(i,n)
if(a[i].ss%2!=i%2)
diff++;
cout << diff/2 << endl;
}
| 0
| 17,457,900
|
#include <stdio.h>
int x[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 main(){
int a;
scanf("%d",&a);
printf("%d",x[a-1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
int dx[4]{0, 1, 0, -1};
int dy[4]{1, 0, -1, 0};
int main(int argc, char **argv)
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N; cin >> N;
vector<ll> A(N);REP(i, N) cin >> A[i];
ll r{0}, sum{0}, res{0};
REP(l, N)
{
while (r < N && !(sum & A[r]))
{
sum ^= A[r] ;
++r;
}
res += (r - l);
if (r == l) ++r;
else sum ^= A[l];
}
std::cout << res << std::endl;
return 0;
}
| 0
| 36,336,710
|
#include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int a,b,c; cin>>a>>b>>c;
if (a==b&&b==c&&c==a) cout<<"Yes";
else cout<<"No";
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int,int> PII;
typedef long long LL;
const int inf=(1<<30),N=100010;
int n,m;
deque<PII> q;
inline int in()
{
char ch=getchar();
int f=1,tmp=0;
while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') {tmp=(tmp<<1)+(tmp<<3)+(ch-'0');ch=getchar();}
return tmp*f;
}
bool vis[N];
int main()
{
n=in();
q.push_front(make_pair(1,1));
while(!q.empty())
{
PII x=q.front();
q.pop_front();
int fir=x.first,sec=x.second;
if(vis[fir]) continue;
vis[fir]=1;
if(fir==0) {printf("%d\n",sec);return 0;}
q.push_front(make_pair(fir*10%n,sec));
q.push_back(make_pair((fir+1)%n,sec+1));
}
return 0;
}
| 0
| 92,748,744
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n, k; cin>>n>>k;
string s; cin>>s;
vector<pair<int,int>> a(1,{1,0});
for(auto i:s){
if(a.back().first==i-'0') a.back().second++;
else a.push_back({i-'0',1});
}
if(a.back().first==0) a.push_back({1,0});
deque<int> q;
for(auto i:a) q.push_back(i.second);
int ans{}, sum{}, cnt{};
for(int i=0; i<a.size(); i++){
if(cnt<k){
if(a.at(i).first==1){
sum += a.at(i).second;
}
else{
sum += a.at(i).second;
cnt++;
}
}
else{
if(a.at(i).first==1){
sum += a.at(i).second;
}
else{
sum -= q.front();
q.pop_front();
sum -= q.front();
q.pop_front();
sum += a.at(i).second;
}
}
ans = max(ans,sum);
}
cout << ans << endl;
}
|
#include <stdio.h>
#include <iostream>
using namespace std;
int main(){
int N;
scanf("%d", &N);
int t, x, y;
int t_pre = 0, x_pre = 0, y_pre = 0;
for(int i = 0; i < N;i++){
scanf("%d %d %d", &t, &x, &y);
if(!((t - t_pre >= abs(x - x_pre)+ abs(y -y_pre)) && ((t - t_pre - (x-x_pre) - (y-y_pre)) % 2 == 0))){
printf("No");
return 0;
}
t_pre = t;
x_pre = x;
y_pre = y;
}
printf("Yes");
return 0;
}
| 0
| 44,266,845
|
#include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(a, b) for (int i = a; i < b + 1; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template <class T>inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
int main()
{
int n;
cin >> n;
vector<ll> a(n);
REP(i,n){
cin >> a[i];
a[i]-=(i+1);
}
sort(all(a));
ll tmp=0;
if(n%2==1){
tmp=a[n/2];
}
else{
if(a[n/2-1]>0){
tmp=a[n/2-1];
}
if(a[n/2]<=0){
tmp=a[n/2];
}
}
ll ans=0;
REP(i,n){
ans+=abs(a[i]-tmp);
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define vi vector<int>
#define inf (int)(1e9+7)
#define mod (ll)(1e9+7)
#define eps 1e-10
#define eb emplace_back
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define all(v) v.begin(), v.end()
#define ios cin.tie(0); ios::sync_with_stdio(false)
#define FIX(a) cout << fixed << setprecision(a)
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(unique(v.begin(), v.end(), v.end());
#define fill(x, y) memset(x, y, sizeof(x))
#define ceil(a, b) a / b + !!(a % b)
template<class T> T power_mod(T a, T b) {return b ? power(a * a % inf, b / 2) * (b % 2 ? a : 1) % inf : 1;}
template<class T> T power(T a, T b) {return b ? power(a * a, b / 2) * (b % 2 ? a : 1) : 1;}
#define LB(v, x) (int)(lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (int)(upper_bound(v.begin(), v.end(), x) - v.begin())
template<typename T> T gcd(T a, T b) {if (b == 0) return a; return gcd(b, a % b);}
template<typename T> T lcm(T a, T b) {return a / gcd(max(a, b), min(a, b)) * b;}
#define outa(a, n) rep(i_, n) cout << a[i_] << " "; cout << endl
#define out(a) cout << a << endl
#define outv(v) rep(i, SZ(v)) cout << v[i] << " "; cout << endl
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep3(i, st, n) for (int i = st; i < n; ++i)
int main() {
int n, a, b, c, x;
while (cin >> n && n) {
cin >> a >> b >> c >> x;
int y[n]; rep(i, n) cin >> y[i];
int done = 0;
int cnt = 0;
if (x == y[0]) done++;
while (done < n && cnt++ < 10000) {
x = (a * x + b) % c;
if (x == y[done]) done++;
}
if (done == n) out(cnt);
else out(-1);
}
}
| 0
| 36,555,750
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>A(N);
for (int i=0; i<N; i++)cin>>A[i];
int MAX=A[0];
int cnt=0;
for (int i=0; i<N; i++){
if (MAX<A[i])MAX=A[i];
if (MAX<=A[i])cnt++;
}
cout<<cnt<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int> a, pair<int, int> b) {
return (a.second < b.second);
}
const int MAX = 200005;
const long long MOD = 1000000007;
const long long MODMOD = 998244353;
const double PI = acos(-1);
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;
}
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 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;
}
struct UnionFind {
vector<int> p;
vector<int> s;
void init(int n) {
p.resize(n, -1);
s.resize(n, 1);
}
int find(int n) {
if(p[n] == -1) return n;
else return find(p[n]);
}
int size(int n) {
return s[find(n)];
}
void unite(int n, int m) {
int pn = find(n);
int pm = find(m);
if(pn == pm) return;
if(s[pn] > s[pm]) {
s[pn] = s[pn] + s[pm];
p[pm]= pn;
} else {
s[pm] = s[pm] + s[pn];
p[pn] = pm;
}
}
};
long long gcd(long long a, long long b) {
if(a % b == 0) return b;
else return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int front = 0;
int back = n-1;
cout << front << endl;
string str_front;
cin >> str_front;
if(str_front == "Vacant") return 0;
cout << back << endl;
string str_back;
cin >> str_back;
if(str_back == "Vacant") return 0;
rep(i, 18) {
int mid, dist;
mid = (front + (back - front + 1) / 2) % n;
dist = mid - front;
cout << mid << endl;
string s;
cin >> s;
if(s == "Vacant") break;
else if(dist % 2 == 0) {
if(s == str_front) front = mid;
else back = mid;
}
else {
if(s == str_front) back = mid;
else {
front = mid;
str_front = s;
}
}
}
return 0;
}
| 0
| 61,297,412
|
#include <iostream>
#include <cmath>
#include <iomanip>
double distanceBetweenPoints(double x1, double y1, double x2, double y2) {
return std::sqrt(std::pow((x2 - x1), 2) + std::pow((y2 - y1), 2));
}
int main() {
double x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
std::cout << std::setprecision(12) << std::fixed << distanceBetweenPoints(x1, y1, x2, y2) << std::endl;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
using namespace std;
#define all(c) c.begin(),c.end()
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
typedef long long ll;
typedef vector<int> vi;
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& val){
os << "[ ";
for(typename vector<T>::const_iterator it=val.begin();
it != val.end();++it){
os << *it << " ";
}
os << "]";
return os;
}
ll fact(ll n){
if(n == 1) return 1;
else return n * fact(n-1);
}
int main(){
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
| 0
| 27,450,878
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
int S, W;
bool ans = true;
cin >> S >> W;
if(W >= S)
ans = false;
if(ans) cout << "safe" << "\n";
else cout << "unsafe" << "\n";
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
void debug(int k){
cout << k << endl;
}
int A[2000001],B[2000001];
int C[10002];
int main(){
int n;
int max = 0;
cin >> n;
for (int i = 0; i < 10002; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
scanf("%d",&A[i]);
if (A[i] > max) {
max = A[i];
}
C[A[i]]++;
}
for (int i = 1; i <= max; i++) {
C[i] += C[i-1];
}
for (int i = 0; i < n; i++) {
B[C[A[i]]-1] = A[i];
C[A[i]]--;
}
for (int i = 0; i < n-1; i++){
printf("%d ",B[i]);
}
cout << B[n-1] << endl;
return 0;
}
| 0
| 56,942,206
|
#include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
const ll MOD=998244353;
const int INF=1e9;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
sort(s.begin(),s.end());
bool flag=1;
rep(i,3) {
if ((s[i]!=s[i+1]) ^ (i%2!=0)) flag=0;
}
if (flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
cerr << " " << h;
if (sizeof...(t) > 0) cerr << " :";
debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
ll 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: return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
return firstElof.first > secondElof.first;
}
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R;
ll MOD = 1000000007; ll INF = 1LL << 62; ll ans = 0; ll z = 0, o = 1;
vl flag, color, D; vll path;
int main() {
cin >> N >> K;
vpll P(N);
for (i = 0; i < N; i++) {
cin >> P[i].first >> P[i].second;
}
sort(P.begin(), P.end());
ans = INF;
vl X(N), Y(N);
for (i = 0; i < N; i++) {
X[i] = P[i].first;
Y[i] = P[i].second;
}
sort(X.begin(), X.end());
sort(Y.begin(), Y.end());
for (i = 0; i < N; i++) {
for (j = i; j < N; j++) {
for (k = 0; k < N; k++) {
for (l = k; l < N; l++) {
ll count = 0;
for (ll p = 0; p < N; p++) {
ll x = P[p].first;
ll y = P[p].second;
if (X[i] <= x && x <= X[j] && Y[k] <= y && y <= Y[l]) {
count++;
}
}
if (count >= K) ans = min(ans, (X[j] - X[i]) * (Y[l] - Y[k]));
}
}
}
}
cout << ans;
}
| 0
| 41,148,941
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<long long> c(n);
for (int i = 0; i < n; i++) {
c[i] = a[i] - b[i];
}
sort(c.begin(), c.end());
sort(lower_bound(c.begin(), c.end(), 0), c.end(), greater<long long>());
for (int i = 1; i < n; i++) {
c[i] += c[i - 1];
}
vector<long long>::iterator r = lower_bound(c.begin(), c.end(), 0);
cout << (r == c.begin() ? 0 : (r != c.end() ? r - c.begin() + 1 : -1)) << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main()
{
char str[200];
scanf("%s", str);
int n = strlen(str);
for (int i = n - 2; i; i -= 2) {
if(strncmp(str, str + i / 2, i / 2) == 0) {
printf("%d\n", i);
return 0;
}
}
return 0;
}
| 0
| 80,662,278
|
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)
const int MXN = 1e5 + 5;
const long long MNN = 2e3 + 200;
const long long MOD = 10;
const long long INF = 1e18;
const int OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
llong n;
llong b[MXN], mx, cnt[65], ans;
llong sum;
llong maxXor(llong n){
for (long long q = 60; q >= 0; --q) {
for(llong j = 1; j <= n; j++) {
if(((1LL << q) & b[j])) {
int ok = 1;
for (long long t = q + 1; t <= 60; ++t) {
if (((1LL << t) & b[j]) != 0) {
ok = 0;
break;
}
}
if (ok == 0) continue;
for (int t = 1; t <= n; ++t) {
if (t == j) continue;
if ((1LL << q) & b[t]) {
b[t] ^= b[j];
}
}
break;
}
}
}
llong res = 0;
for (llong i = 1; i <= n; i++) {
res ^= b[i];
}
return res;
}
int main(){
ios;
cin >> n;
for(llong i = 1; i <= n; i++){
cin >> b[i];
for(llong j = 61; j >= 0; j--){
if((b[i] >> j) & 1){
cnt[j]++;
}
}
}
for(llong i = 0; i <= 61; i++){
if(cnt[i] % 2 == 1){
ans += (1LL << i);
for(llong j = 1; j <= n; j++) {
if((b[j] >> i) & 1){
b[j] ^= (1LL << i);
}
}
}
}
for(int i = 1; i <= n; i++) {
sum ^= b[i];
}
llong mx = maxXor(n);
cout << (sum ^ mx) + mx + ans;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int INF = numeric_limits<int>::max();
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
long long gcd(ll a, ll b)
{
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(ll a, ll b)
{
return a / gcd(a, b) * b ;
}
int main()
{
int n,k; cin >> n >> k;
vector<int> a(n);
int index, minn, tmp;
rep(i,n) {
cin >> tmp;
if (tmp == 1 ) {
index = i;
}
}
if (n <= k) {
cout << 1 << endl;
return 0;
}
cout << (n-2) / (k-1) + 1<< endl;
return 0;
}
| 0
| 88,515,741
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define Mid ((l+r)/2)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define drep(i,a,b) for(int i=(a);i>=(b);--i)
#define file(a) freopen(#a".in","r",stdin),freopen(#a".out","w",stdout);
const int maxn=3e5+5,mod=1e9+7,inf=0x3f3f3f3f;
int n,m,Q,K,T,H,W;
int read(){
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}int X[maxn],Y[maxn];
int maxx,maxy,sumx,sumy;
bool px[maxn],py[maxn];
int h[maxn],w[maxn];
signed main(){
H=read(),W=read(),m=read();
rep(i,1,m){
h[i]=read(),w[i]=read();
X[h[i]]++,Y[w[i]]++;
}
rep(i,1,H)maxx=max(maxx,X[i]);
rep(i,1,W)maxy=max(maxy,Y[i]);
rep(i,1,H)if(X[i]==maxx)sumx++,px[i]=true;
rep(i,1,W)if(Y[i]==maxy)sumy++,py[i]=true;
int cnt=0;
rep(i,1,m)if(px[h[i]]&&py[w[i]])++cnt;
if(cnt>=sumx*sumy)printf("%lld\n",maxx+maxy-1);
else printf("%lld\n",maxx+maxy);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class mint {
int value;
public:
static const int MOD = 1000 * 1000 * 1000 + 7;
mint(long long x)
: value(x % MOD) {}
mint operator+(mint y) const {
return mint(value + y.value);
}
mint operator+=(mint a) {
return *this = *this + a;
}
mint operator*(mint y) const {
return mint(long(value) * y.value);
}
mint operator*=(mint a) {
return *this = *this * a;
}
mint operator-() const {
return *this * mint(-1);
}
mint operator-(mint y) const {
return *this + (-y);
}
mint operator-=(mint a) {
return *this = *this - a;
}
operator int() {
return value;
}
static mint pow(mint a, int n) {
if (n <= 0) {
return 1;
}
else if (n == 1) {
return a;
}
mint half = pow(a, n / 2);
return n % 2 ? half * half * a : half * half;
}
};
int main() {
int N, K;
cin >> N >> K;
vector<mint> part(K + 1, 0);
for (int X = K; X >= 1; X--) {
int c = floor(K / X);
part[X] = mint::pow(c, N);
for (int j = 2; j <= c; j++) {
part[X] -= part[X * j];
}
}
mint ans = 0;
for (long i = 1; i <= K; i++) {
ans += i * part[i];
}
cout << ans << endl;
}
| 0
| 87,714,664
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll INF = 1LL << 60;
ll ans = INF;
int main()
{
ll n , k ;
cin >> n >> k ;
vector<ll> h(n+1);
rep(i, n){
cin >> h[i+1];
}
vector<vector<ll>> dp(n-k+1, vector<ll>(n+1,INF) );
dp[0][0]=0;
rep(i,n){
rep(j,n-k){
rep(l,i+1){
dp[j+1][i+1]=min(dp[j+1][i+1],dp[j][l]+max(0LL,h[i+1]-h[l]));
}
}
}
rep(i,n+1){
ans=min(ans,dp[n-k][i]);
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define pb push_back
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n); rank.resize(n); diff_weight.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool same(int x, int y) {
return root(x) == root(y);
}
bool unite(int x, int y, Abel w) {
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y), w = -w;
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) {
return weight(y) - weight(x);
}
};
int main()
{
int n,m;
cin>>n>>m;
UnionFind<int> uf(n);
rep(i,m){
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
if(uf.same(a,b)){
int diff = uf.diff(a, b);
if(diff!=c){
cout << "No" << endl;
return 0;
}
}
else
{
uf.unite(a, b, c);
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 29,503,515
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
ll dfs(ll N, ll a, ll b, ll c, vector<ll> l, ll k, ll la, ll lb, ll lc)
{
if(k == N) {
ll mp = abs(a - la) + abs(b - lb) + abs(c - lc) - 30;
if(la * lb * lc == 0) mp = INF;
return mp;
}
ll r0, r1, r2, r3;
r0 = dfs(N, a, b, c, l, k + 1, la, lb, lc);
r1 = dfs(N, a, b, c, l, k + 1, la + l[k], lb, lc) + 10;
r2 = dfs(N, a, b, c, l, k + 1, la, lb + l[k], lc) + 10;
r3 = dfs(N, a, b, c, l, k + 1, la, lb, lc + l[k]) + 10;
return min(min(r0, r1), min(r2, r3));
}
void solve()
{
ll N; cin >> N;
ll a, b, c; cin >> a >> b >> c;
vector<ll> l(N); rep(i, N) cin >> l[i];
ll ans = dfs(N, a, b, c, l, 0, 0, 0, 0);
cout << ans << endl;
}
int main(void)
{
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
ll modexpo(ll a,ll b)
{
ll ans=1LL;
while(b>0)
{
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
int n,m;
int dp[205][205];
int R;
ll res;
bool used[9];
vector<int> r(9);
void dfs(int c,int last,ll dist){
if(c==R+1){
if(res>dist)res=dist;
return ;
}
for(int i=1;i<=R;i++){
if(!used[i]){
used[i]=true;
if(last==-1)dfs(c+1,i,0);
else dfs(c+1,i,dist+dp[r[last]][r[i]]);
used[i]=false;
}
}
}
int main()
{
cin>>n>>m>>R;
for(int i=1;i<=R;i++)cin>>r[i];
for(int i=0;i<=200;i++)for(int j=0;j<=200;j++)dp[i][j]=1e9;
for(int i=0;i<=200;i++)dp[i][i]=0;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
if(dp[a][b]>c){
dp[a][b]=c;
dp[b][a]=c;
}
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
res=1LL<<30;
dfs(1,-1,0);
cout<<res;
}
| 0
| 78,608,733
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;
typedef long double ld;
int N;
void solve() {
cin >> N;
int K = 0;
int x;
for (x = 1; K < N; K += x, x += 1) ;
if (K != N) {
cout << "No\n";
return;
}
cout << "Yes\n";
cout << x << "\n";
vector<vector<int>> ans = vector<vector<int>>(x+1);
int cnt = 1;
K = 0;
for (int i = 1; K < N; K += i, i += 1) {
for (int j = 1; j <= i; j += 1) {
ans[j].push_back(cnt);
ans[i+1].push_back(cnt);
cnt += 1;
}
}
for (int i = 1; i <= x; ++i) {
cout << ans[i].size() << " ";
for (auto j: ans[i]) {
cout << j << " ";
}
cout << "\n";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N , M;
cin >> N;
vector <string> s (N);
vector <string> t (M);
int num_max=0, num_now=0;
for(int i = 0;i < N; i++){
cin >> s.at(i);
}
cin >> M;
for(int i = 0;i < M; i++){
cin >> t.at(i);
}
for(int i=0;i < N; i++){
num_now=1;
for(int j=i+1;j < N;j++){
if(s.at(i) == s.at(j)){
num_now++;
}
}
for(int j=0;j < M;j++){
if(s.at(i) == t.at(j)){
num_now--;
}
}
if(num_max < num_now){
num_max = num_now;
}
}
cout << num_max << endl;
}
| 0
| 5,938,454
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(void)
{
IOS
int N, C, K;
cin >> N >> C >> K;
vector<int> T(N);
REP(i,N) cin >> T[i];
sort(ALL(T));
int c = 0, time = 0;;
int ans = 0;
c = 1, time = T[0];
FOR(i,1,N) {
if (T[i] - time > K || c >= C) {
ans++;
c = 0;
}
if (c == 0) {
time = T[i];
c++;
} else {
c++;
}
}
ans++;
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = N;
while (x >= 0) {
if (x % 4 == 0) {
cout << "Yes" << endl;
return 0;
};
x -= 7;
}
cout << "No" << endl;
return 0;
}
| 0
| 55,671,874
|
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define fo(i, n) for( int i = 0; i < n; i++ )
int main() {
int s;
cin >> s;
set<int> ns;
ns.insert(s);
s = (s & 1) ? 3 * s + 1 : s / 2;
int i;
for ( i = 2; ns.find(s) == ns.end(); i++) {
ns.insert(s);
s = (s & 1) ? 3 * s + 1 : s / 2;
}
cout << i << endl;
return 0;
}
|
#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<int, 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 n;
cin >> n;
int ans = 1, cnt = 0;
for(int i = 1; i <= n; ++i){
int num = i;
int c = 0;
while(num%2 == 0){
num /= 2;
++c;
}
if(c > cnt){
ans = i;
cnt = c;
}
}
cout << ans << endl;
return 0;
}
| 0
| 17,896,897
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1, dy = y2 - y1;
cout << x2 - dy << ' ' << y2 + dx << ' ' << x1 - dy << ' ' << y1 + dx << endl;
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define MAX 1000001
using namespace std;
class element{
private:
int key;
element *next;
element *previous;
public:
element(int K,element *N,element *P){
key = K;
next = N;
previous = P;
}
int getKey(){
return key;
}
element(int K){
key = K;
}
element *getNext(){
return next;
}
element *getPrevious(){
return previous;
}
void setNext(element *N){
next = N;
}
void setPrevious(element *P){
previous = P;
}
};
class DoublyLinkedList{
private:
element *head;
element *tail;
int num_of_elements;
public:
DoublyLinkedList(){
head = NULL;
tail = NULL;
num_of_elements = 0;
}
int num(){
return num_of_elements;
}
element *getHead(){
return head;
}
element *getTail(){
return tail;
}
void insertx(int x){
if(num_of_elements == 0){
element *X;
X = new element(x);
X->setNext(X);
X->setPrevious(X);
num_of_elements++;
head = X;
tail = X;
}else{
element *X;
X = new element(x);
head->setNext(X);
tail->setPrevious(X);
X->setNext(tail);
X->setPrevious(head);
num_of_elements++;
head = X;
}
}
void deleteFirst(){
if(num_of_elements == 1){
delete head;
tail = NULL;
num_of_elements--;
}else{
element *next_head = head->getPrevious();
next_head->setNext(tail);
tail->setPrevious(next_head);
delete head;
head = next_head;
num_of_elements--;
}
}
void deleteLast(){
if(num_of_elements == 1){
delete tail;
tail = NULL;
num_of_elements--;
}else{
element *next_tail = tail->getNext();
next_tail->setPrevious(head);
head->setNext(next_tail);
delete tail;
tail = next_tail;
num_of_elements--;
}
}
void deletex(int x){
element *pos = head;
while(true){
if(pos->getKey() == x){
if(pos == head){
deleteFirst();
return;
}else if(pos == tail){
deleteLast();
return;
}else{
(pos->getNext())->setPrevious(pos->getPrevious());
(pos->getPrevious())->setNext(pos->getNext());
delete pos;
num_of_elements--;
return;
}
}else{
if(pos == tail){
return;
}else{
pos = pos->getPrevious();
}
}
}
}
};
int main(){
DoublyLinkedList DLL;
int num_of_input;
char input_string[20];
int input_num;
cin >>num_of_input;
for(int i=0;i<num_of_input;i++){
scanf("%s",&input_string);
if(input_string[0] == 'i'){
scanf("%d",&input_num);
DLL.insertx(input_num);
}else if(input_string[6] =='F'){
DLL.deleteFirst();
}else if(input_string[6] == 'L'){
DLL.deleteLast();
}else{
scanf("%d",&input_num);
DLL.deletex(input_num);
}
}
element *pos = DLL.getHead();
for(int i=0;i<num_of_input;i++){
if(pos == DLL.getTail()){
cout <<pos->getKey() <<endl;
break;
}else{
cout <<pos->getKey() <<" ";
pos = pos->getPrevious();
}
}
return 0;
}
| 0
| 93,480,182
|
#include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, m; cin>>n>>m;
vector<lint> b(n+1,1);
vector<lint> pd(n+1,1);
pd[0] = 1;
for(int i=0;i<m;i++){
int x; cin>>x;
b[x]=0;
}
pd[1]=b[1];
for(int i=2;i<=n;i++){
pd[i] = (pd[i-1]*b[i-1] + pd[i-2]*b[i-2])%MOD;
}
cout<<pd[n]<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,m,ans=0;
cin >> n >> m;
vector<vector<long>> p(n,vector<long>(3));
for(long i=0;i<n;i++) cin >> p[i][0] >> p[i][1] >> p[i][2];
for(long i=0;i<8;i++) {
vector<long> psum(n);
for(long j=0;j<n;j++) {
if(i&1) psum[j]+=p[j][0];
else psum[j]-=p[j][0];
if(i&2) psum[j]+=p[j][1];
else psum[j]-=p[j][1];
if(i&4) psum[j]+=p[j][2];
else psum[j]-=p[j][2];
}
sort(psum.begin(),psum.end());
reverse(psum.begin(),psum.end());
long a=0;
for(long j=0;j<m;j++) a+=psum[j];
ans=max(ans,a);
}
cout << ans << endl;
}
| 0
| 74,249,588
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,h,g,br=0;
cin >> h >> n;
for (int i=0;i<n;i++)
{
cin >> g;
br+=g;
}
if(br>=h)
cout << "Yes";
else
cout << "No";
}
|
#include<iostream>
#include<vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
vector<int> digit(int num, int n){
vector<int> v(n, 0);
for(int i =0 ; i < n; i++){
v[i] = num%2;
num /= 2;
}
return v;
}
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> v;
for(int i = 0; i < m; i++){
int k;
cin >> k;
v.push_back(vector<int>(k));
for(int j = 0; j < k; j++){
cin >> v[i][j];
}
}
vector<int> p(m);
for(int i = 0; i < m; i++) cin >> p[i];
int ans = 0;
int po = pow(2, n);
for(int num = 0; num < po; num++){
vector<int> d = digit(num, n);
int light_num = 0;
for(int i = 0; i < m; i++){
int on_num = 0;
for(int j = 0; j < v[i].size(); j++){
on_num += d[v[i][j]-1];
}
if(on_num%2 == p[i]) light_num++;
}
if(light_num == m) ans++;
}
cout << ans << endl;
}
| 0
| 69,151,886
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <fstream>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
#include <cassert>
#pragma warning (disable: 4996)
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
if (n < 0)return 0;
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);
}
ll merge_cnt(vector<ll>& a) {
int n = a.size();
if (n <= 1) { return 0; }
ll cnt = 0;
vector<ll> b(a.begin(), a.begin() + n / 2);
vector<ll> c(a.begin() + n / 2, a.end());
cnt += merge_cnt(b);
cnt += merge_cnt(c);
int ai = 0, bi = 0, ci = 0;
while (ai < n) {
if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {
a[ai++] = b[bi++];
}
else {
cnt += n / 2 - bi;
a[ai++] = c[ci++];
}
}
return cnt;
}
vector<int> sm(vector<int>z,int n){
if (n == 1)return { 0 };
vector<int> x(n);
vector<int> d(n / 2);
vector<int> f(n / 2);
for (int i = 0; i < n/2; i++) {
d[i] = z[i];
f[i] = max(z[i], z[i + n / 2]);
}
vector<int> e = sm(d, n / 2);
vector<int> g = sm(f, n / 2);
for (int i = 0; i < n / 2; i++) {
x[i] = e[i];
}
for (int i = n/2; i < n; i++) {
x[i] = max(g[i - n / 2], z[i] + z[i - n / 2]);
}
return x;
}
int main() {
int n;
cin >> n;
n = (1 << n);
vector<int> z(n);
for (int i = 0; i < n; i++) {
cin >> z[i];
}
vector<int> x = sm(z, n);
for (int i = 1; i < n; i++) {
x[i] = max(x[i], x[i - 1]);
cout << x[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long double N, K;
cin >> N >> K;
long double ans;
ans = 0;
for (int i = 1; i <= N; i++)
{
if (i < K)
{
ans += powl(0.5, ceil(log2(K/i)));
}
else
{
ans += 1;
}
}
ans = ans / N;
cout << fixed << setprecision(15) << ans << endl;
}
int main() {
solve();
return 0;
}
| 0
| 15,993,862
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string N;
cin >> N;
if (N.at(1) == N.at(2))
{
if (N.at(0) == N.at(1) || N.at(2) == N.at(3))
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define SZ(x) (int)(x).size()
#define BE(x) (x).begin(), (x).end()
#define SORT(x) sort(BE(x))
#define _1 first
#define _2 second
#define x1 gray_cat_x1
#define y1 gray_cat_y1
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
#define file "I1"
const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
vi g[MAXN];
int v[MAXN];
ll dp[MAXN];
int used[MAXN];
int dfs(int s){
used[s] = 1;
ll dp_sum = 0, dp_mx = 0;
REP(i, 0, SZ(g[s])){
int to = g[s][i];
if (!used[to]){
if (dfs(to)){
return 1;
}
dp_sum += dp[to];
dp_mx = max(dp_mx, dp[to]);
}
}
if (SZ(g[s]) > 1) {
ll a = dp_sum - v[s];
ll b = v[s] - a;
if (a < 0 || b < 0 || a > dp_sum - dp_mx){
return 1;
}
dp[s] = b;
} else {
dp[s] = v[s];
}
return 0;
}
void solve(){
int n;
scanf("%d", &n);
REPN(i, 1, n){
scanf("%d", &v[i]);
}
REP(i, 1, n){
int a, b;
scanf("%d%d", &a, &b);
g[a].pb(b);
g[b].pb(a);
}
if (n == 2){
if (v[1] == v[2]){
printf("YES\n");
} else {
printf("NO\n");
}
return;
}
int s = 1;
REPN(i, 1, n){
if (SZ(g[i]) > 1){
s = i;
}
}
if (dfs(s) || dp[s]){
printf("NO\n");
} else {
printf("YES\n");
}
}
int main(){
int t = 1;
while(t--){
solve();
}
}
| 0
| 13,613,694
|
#include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
ll binary_power(ll a, ll n) {
if (n==0) return 1;
ll k=binary_power(a,n/2);
if (n%2==0) return (k*k)%MOD;
else return (((k*k)%MOD)*a)%MOD;
}
int main() {
ios_base::sync_with_stdio(false);
int n,m;
cin >> n >> m;
double ans=0;
double p=1;
ll b=binary_power(2,m);
double a=1.0/b;
rep(i,1000000) {
double tp=p*a;
ans+=((n-m)*100+m*1900)*(i+1)*tp;
p-=tp;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
int main() {
string S; cin >> S;
string T; cin >> T;
int N = S.size();
REP(i,N){
bool ok = true;
REP(j,N){
if(S[(j+i)%N] != T[j]) ok = false;
}
if(ok){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| 0
| 63,601,050
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
const ll SIZE = 1e6 * 2 + 10, INF = 1e9 * 1e9 + 10;
int main()
{
fastInp;
ll n;
cin >> n;
ll a, b;
cin >> a >> b;
vector<ll> cnt(3);
for (int i = 0; i < n; i++) {
ll vl;
cin >> vl;
if (vl <= a) {
cnt[0]++;
} else if (vl > a && vl <= b) {
cnt[1]++;
} else {
cnt[2]++;
}
}
cout << min(min(cnt[0], cnt[1]), cnt[2]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll W,H; cin >> W >> H;
ll a = W+1;
ll b = H+1;
vector<pair<ll,ll>> edge;
for(int i = 0; i < W; i++){
ll p; cin >> p; edge.push_back({p,1});
}
for(int j = 0; j < H; j++){
ll q; cin >> q; edge.push_back({q,2});
}
sort(edge.begin(),edge.end());
int itr = 0;
ll ans = 0; ll cnt = 0;
while( true ){
ll cost = edge[itr].first;
int dir = edge[itr].second;
if( dir == 1 && a > 0){
ans += cost*b; cnt += b; a--;
}
if( dir == 2 && b > 0){
ans += cost*a; cnt += a; b--;
}
if( cnt >= (W+1)*(H+1)-1){break;}
itr++;
}
cout << ans << endl;
return 0;
}
| 0
| 6,726,319
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for(int i = 1, i##_len = (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 INF 100000000
using namespace std;
int n, A, B, C;
vector<int> l;
void chmin(int &a, int b) {
if(a > b)
a = b;
}
int dfs(int i, int a, int b, int c) {
if(i == n) {
if(a == 0 || b == 0 || c == 0)
return INF;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int res = INF;
chmin(res, dfs(i + 1, a, b, c));
chmin(res, dfs(i + 1, a + l[i], b, c) + (a ? 10 : 0));
chmin(res, dfs(i + 1, a, b + l[i], c) + (b ? 10 : 0));
chmin(res, dfs(i + 1, a, b, c + l[i]) + (c ? 10 : 0));
return res;
}
int main() {
cin >> n >> A >> B >> C;
l.resize(n);
for(int i = 0; i < n; i++)
cin >> l[i];
int res = dfs(0, 0, 0, 0);
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<ll> IntegerToVector(ll bit, ll N) {
vector<ll> S;
for (ll i = 0; i < N; ++i) {
if (bit & (1 << i)) S.push_back(1);
else S.push_back(0);
}
return S;
}
int main() {
ll n, m;
cin >> n >> m;
vector<vector<ll> > s;
rep1(i, m){
ll k;
cin >> k;
vector<ll> res;
rep1(j, k){
ll _s;
cin >> _s;
_s--;
res.push_back(_s);
}
s.push_back(res);
}
vector<ll> p(m);
rep1(i, m) cin >> p[i];
ll ans = 0;
for (ll bit = 0; bit < (1<<n); ++bit) {
vector<ll> S = IntegerToVector(bit, n);
ll res = 0;
rep1(i, m){
ll sum = 0;
for (ll x: s[i]) sum += S[x];
if (sum%2 == p[i]) res++;
}
if (res==m) ans++;
}
cout << ans << endl;
}
| 0
| 97,149,776
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,av;
cin>>a>>av;
cout<<2*av-a;
}
|
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int dp[3][3];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
cin>>dp[i][j];
}
}
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n;i++)
{
for(int x=0;x<3;x++)
{
for(int y=0;y<3;y++)
{
if(dp[x][y]==arr[i])
dp[x][y]=0;
}
}
}
for(int i=0;i<3;i++)
{
if(dp[i][0]==0 && dp[i][1]==0 && dp[i][2]==0)
{
cout<<"Yes\n";
return;
}
}
for(int i=0;i<3;i++)
{
if(dp[0][i]==0 && dp[1][i]==0 && dp[2][i]==0)
{
cout<<"Yes\n";
return;
}
}
if(dp[0][0]==0 && dp[1][1]==0 && dp[2][2]==0)
{
cout<<"Yes\n";
return ;
}
if(dp[0][2]==0 && dp[1][1]==0 && dp[2][0]==0)
{
cout<<"Yes\n";
return;
}
cout<<"No\n";
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 44,631,007
|
#include<iostream>
#include<set>
int main(void){
int n, m;
std::cin >> n >> m;
std::multiset<int> as;
for(int i = 0; i < n; i++){
int a;
std::cin >> a;
as.insert(a);
}
for(int i = 0; i < m; i++){
auto max = std::next(as.end(), -1);
int redu = *max / 2;
as.erase(max);
as.insert(redu);
}
long long ans = 0;
for(auto i = as.begin(); i != as.end(); i++){
ans += *i;
}
std::cout << ans << std::endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 100005;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
cins(all(a));
RSORT(a);
ll cnt = 0,k = 0;
rep(i,n) k += a[i];
if (k > n*(n-1)) k -= n*(n-1);
else k = 0;
cnt += k;
if (k > 0){
rep(i,n) a[i] += k;
}
rep(i,n){
if (k > 0 && a[i] > n-1){
ll c = (a[i]-(n-1))/(n+1);
if ((a[i]-(n-1))%(n+1)) c++;
a[i] -= min(c,k)*(n+1);
k -= min(c,k);
}
}
while(*max_element(all(a)) >= n){
RSORT(a);
a[0] -= n;
rep(i,1,n) a[i]++;
cnt++;
}
PRINT(cnt);
}
| 0
| 34,047,628
|
#include <iostream>
using namespace std;
int main(){
int h,w;
while(1){
cin >> h >> w;
if(h==0 && w==0) break;
else{
for(int i=0;i<w;i++){
cout << "#";
}
for(int j=0;j<h-2;j++){
cout << "\n#";
for(int k=0;k<w-2;k++){
cout << ".";
}
cout << "#";
}
cout << "\n";
for(int l=0;l<w;l++){
cout << "#";
}
cout << "\n\n";
}
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define INF 1e18L+5
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef vector<int> vi;
typedef pair<int,int>ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<long long > vl;
template<typename T>
void show(vector<T> v){
bool ok=true;
for(auto it:v){
cout<<it<<" ";
}
cout<<"\n";
}
const int N=101;
int A[N],B[N];
int main() { ios_base::sync_with_stdio(false); cin.tie(0);
int a,b,n;cin>>n;ll compt=0;
for(int c=1;c<n;++c){
int cal=n-c;
for(int i=1;i*i<=cal;i++){
if(cal%i==0){
int a=i,b=cal/i;
if(a==b)compt++;
else compt+=2;
}
}
}
cout<<compt;
return 0;
}
| 0
| 55,415,467
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>> s(m,vector<int>());
for(int i=0;i<m;i++){
int k;
cin>>k;
for(int j=0;j<k;j++){
int a;
cin>>a;
a--;
s[i].push_back(a);
}
}
vector<int> p(m);
for(int i=0;i<m;i++) cin>>p[i];
int ans=0;
for(int i=0;i<(1<<n);i++){
bool flag=true;
for(int j=0;j<m;j++){
int cnt=0;
for(int k : s[j]){
if(i&(1<<k)) cnt++;
}
if(cnt%2!=p[j]) flag=false;
}
if(flag) ans++;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
const long long MAXN = 1e5+5;
long long arr[MAXN];
long long arr2[MAXN];
long long dp[MAXN];
long long dp2[MAXN];
int main(){
long long n,m;
cin>>n>>m;
for(long long i=1;i<=n;i++){
cin>>arr[i];
}
dp[1] = arr[2]-arr[1];
dp[1]%=MOD;
for(long long i=2;i<n;i++){
long long diff= arr[i+1]-arr[i];
dp[i] = (1LL*i*diff)+dp[i-1];
dp[i]%=MOD;
}
for(long long i=1;i<=m;i++){
cin>>arr[i];
}
dp2[1] = arr[2]-arr[1];
dp2[1]%=MOD;
for(long long i=2;i<m;i++){
long long diff= arr[i+1]-arr[i];
dp2[i] = (1LL*i*diff)+dp2[i-1];
dp2[i]%=MOD;
}
for(long long i=1;i<m-1;i++){
dp2[m-1]+=dp2[i];
dp2[m-1]%=MOD;
}
for(long long i=1;i<n-1;i++){
dp[n-1]+=dp[i];
dp[n-1]%=MOD;
}
cout<<(1LL*dp2[m-1]*dp[n-1])%MOD<<endl;
}
| 0
| 86,706,397
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; i++) a[i] = (n+1)*(i+1);
for(int i = 0; i < n; i++) b[i] = (n+1)*(n-i);
vector<int> r(n);
for(int i = 0; i < n; i++){
int x; cin >> x;
r[x-1] = i+1;
}
for(int i = 0; i < n; i++) cout << a[i] << " \n"[i+1==n];
for(int i = 0; i < n; i++) cout << b[i]+r[i] << " \n"[i+1==n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char *argv[]) {
int A, B, K;
cin >> A >> B >> K;
rep(i, K) {
if (i%2) {
if (B%2) --B;
A += B/2, B /= 2;
} else {
if (A%2) --A;
B += A/2, A /= 2;
}
}
cout << A << ' ' << B << endl;
return 0;
}
| 0
| 19,827,565
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N; cin >> N;
vector<vector<int>> A(N, vector<int>(26, 0));
for (int i = 0; i < N; i++) {
string S; cin >> S;
for (auto c : S) A[i][c - 'a']++;
}
vector<int> B(26, MAX);
for (int i = 0; i < 26; i++) for (int j = 0; j < N; j++) chmin(B[i], A[j][i]);
for (int i = 0; i < 26; i++) {
for (int j = 0; j < B[i]; j++) {
cout << (char)(i + 'a');
}
}
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define rrep(i,n) for(int i=(n);i>=0;--i)
#define ssort(n) sort((n).begin(),(n).end())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define INF 10101010
int main()
{
int n,m;
cin >> n >> m;
vector<vector<int>> s(m,vector<int>(n));
vector<int> p(m);
vector<int> bit(n);
vector<int> k_m(m);
ll count=0;
ll ans=0;
ll count_sw=0;
int k;
rep(i,m){
rep(j,n){
s[i][j]=-1;
}
}
rep(i,m){
cin >> k_m[i];
rep(j,k_m[i]){
cin >> s[i][j];
}
}
rep(i,m)cin >> p[i];
rep(i,(1<<n)){
rep(j,n){
int div=(1<<j);
bit[j]=(i/div)%2;
}
rep(j,m){
for(int l=0;l<k_m[j];++l){
if(bit[s[j][l]-1]==1)
count_sw++;
}
if(count_sw%2==p[j]%2){
count++;
}else{
count_sw=0;
count=0;
break;
}
count_sw=0;
}
if(count==m){
ans++;
count=0;
count_sw=0;
}else{
count=0;
count_sw=0;
}
}
cout << ans << endl;
}
| 0
| 53,526,180
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, M, X, Y;
cin >> N >> M >> X >> Y;
ll x, y, max_x = X, min_y = Y;
for (int i = 0; i < N; i++) {
cin >> x;
max_x = max(max_x, x);
}
for (int i = 0; i < M; i++) {
cin >> y;
min_y = min(min_y, y);
}
if (max_x < min_y) {
cout << "No War" << endl;
} else {
cout << "War" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
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 all(x) (x).begin(),(x).end()
typedef long long lint;
typedef vector<int> vint;
typedef vector<long long> vlint;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<vector<long long>> vlint2;
lint powint(lint x, lint y){
int ret = 1;
for (int i=0; i < y; i++) ret *= x;
return ret;
};
lint mod = 1000000007;
vector<int> dx = {1, 0, 0, -1, 1, 1, -1, -1};
vector<int> dy = {0, -1, 1, 0, 1, -1, 1, -1};
map<char, long long> counter(string s){
map<char, long long> count;
rep(i, s.size()){
count[s[i]] ++;
}
return count;
};
int powmod(int x, int y, int m){
if (y == 0) return 1;
return ((powint(powmod(x, y>>1, m), 2) % m) * powint(x, (y & 1))) % m;
};
int main() {
lint n, p; cin >> n >> p;
string s; cin >> s;
map<int, lint> cnt;
lint ans = 0;
if (p == 2){
rep(i, n){
if ((int)(s[i] - '0') % 2 == 0) ans += i + 1;
}
}
else if (p == 5){
rep(i, n){
if (s[i] == '0' || s[i] == '5') ans += i + 1;
}
}
else{
int check = 1;
int a = 0;
cnt[0] ++;
For(i, 1, n+1){
a = (a + (int)(s[n-i] - '0') * powmod(10, i-1, p)) % p;
cnt[a] ++;
}
for (auto i = cnt.begin(); i != cnt.end(); ++i){
ans += (i -> second) * ((i -> second)-1)/2;
}
}
cout << ans << endl;
}
| 0
| 16,820,987
|
#include <iostream>
using namespace std;
int main(void) {
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>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n+1);
for ( int i=0; i<n; i++ ) {
cin >> a[i];
}
for ( int i=0; i<k; i++ ) {
vector<int> b(n+1);
for ( int i=0; i<n; i++ ) {
int l=max(0,i-a[i]);
int r=min(n,i+a[i]+1);
b[l]++; b[r]--;
}
a[0]=b[0];
for ( int i=1; i<n; i++ ) {
b[i]+=b[i-1];
a[i]=b[i];
}
bool flag=1;
for ( int i=0; i<n; i++ ) {
if ( a[i]!=n ) {
flag=0;
break;
}
}
if ( flag ) break;
}
for ( int i=0; i<n; i++ ) {
cout << a[i] << ' ';
}
return 0;
}
| 0
| 63,838,889
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int m;
cin>>m;
ll sum=0,dig=0;
rep(i,m){
int d;
ll c;
cin>>d>>c;
sum+=d*c;
dig+=c;
}
cout<<dig-1+((sum-1)/9)<<endl;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N;
double x, s = 0;
string u;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x >> u;
if (u == "JPY") {
s += x;
} else {
s += x * 380000;
}
}
cout << fixed << setprecision(5) << s << endl;
}
| 0
| 50,802,636
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}
#define rep(i, c) for(int i = 0; i < int(c); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define pb push_back
int main() {
double a,b; cin>>a>>b;
double ans = a/b;
printf("%.10f\n", ans);
}
|
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; }
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; };
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9+7)
int main(void) {
ll n, m; cin >> n >> m;
vll x(n), y(m); cin >> x >> y;
ll tmp, w;
ll ret = 1;
tmp = 0, w = 1 - n;
rep(i, n) (tmp += w * x[i]) %= mo, w += 2;
ret *= tmp;
tmp = 0, w = 1 - m;
rep(i, m) (tmp += w * y[i]) %= mo, w += 2;
(ret *= tmp) %= mo;
cout << ret << endl;
return 0;
}
| 0
| 100,874,289
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
class LCS{
private:
char x[1000 + 1];
char y[1000 + 1];
int lcs[1000][1000];
public:
LCS(const char x[], const char y[]);
int calcLCS();
int calcLCS(int i, int j);
};
LCS::LCS(const char x[], const char y[])
{
strcpy(this->x, x);
strcpy(this->y, y);
for (int i = 0; (this->x)[i] != '\0'; i++) {
for (int j = 0; (this->y)[j] != '\0'; j++) {
lcs[i][j] = -1;
}
}
}
int LCS::calcLCS(){
int i, j;
for (i = 0; ; i++) {
if (x[i + 1] == '\0') break;
}
for (j = 0; ; j++) {
if (y[j + 1] == '\0') break;
}
return calcLCS(i, j);
}
int LCS::calcLCS(int i, int j)
{
if (i < 0 || j < 0) return 0;
if (lcs[i][j] != -1) return lcs[i][j];
if (x[i] == y[j]) lcs[i][j] = calcLCS(i - 1, j - 1) + 1;
else lcs[i][j] = max(calcLCS(i, j - 1), calcLCS(i - 1, j));
return lcs[i][j];
}
int main(void)
{
int q;
cin >> q;
cin.ignore(1);
for (int i = 0; i < q; i++) {
char x[1000 + 1] = "\0";
char y[1000 + 1] = "\0";
cin.getline(x, 1000 + 1);
cin.getline(y, 1000 + 1);
LCS *lcs = new LCS(x, y);
cout << lcs->calcLCS() << endl;
delete lcs;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> S(n);
rep(i, n) cin >> S[i];
vector<int> cnt(n);
int both = 0, head = 0, hip = 0;
rep(i, n) {
if (S[i].front() == 'B' && S[i].back() == 'A') both++;
else if (S[i].front() == 'B') head++;
else if (S[i].back() == 'A') hip++;
rep(j, S[i].size() - 1) {
if (S[i].substr(j, 2) == "AB") cnt[i]++;
}
}
int ans = 0;
if (both > 1) {
ans += (both - 1);
both = 1;
}
if (both == 1) {
if (hip > 0 && head > 0) {
ans += 2;
hip--;
head--;
}
else if (hip > 0 && head == 0) {
ans++;
hip--;
}
else if (hip == 0 && head > 0) {
ans++;
head--;
}
}
ans += min(hip, head);
rep(i, n) ans += cnt[i];
dunk(ans);
return 0;
}
| 0
| 64,925,516
|
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 110, LOG=20;
int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN];
int cnt[MAXN];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n;
for (int i=1; i<=n; i++) cin>>A[i];
sort(A+1, A+n+1);
if (n==1) kill("Impossible")
if (n==2){
if (A[2]==1) kill("Possible")
kill("Impossible")
}
for (int i=1; i<=n; i++) cnt[A[i]]++;
int d=A[n];
for (int i=0; i<=d; i++){
if (!(cnt[max(i, d-i)]--)) kill("Impossible")
}
for (int i=1; i<=n; i++) if (cnt[i]){
if (i<((d+1)/2+1) || d<i) kill("Impossible")
}
kill("Possible")
return 0;
}
|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, n);
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(all(d));
out(d[n / 2] - d[n / 2 - 1]);
}
| 0
| 20,233,928
|
#include <iostream>
#include <string>
using namespace std;
void test();
string ReverseStr(string str);
int main(void)
{
test();
return 0;
}
void test()
{
string s;
cin >> s;
s = ReverseStr(s);
cout << s << endl;
}
string ReverseStr(string str)
{
string s;
int i, t;
s = str;
for (i = 0,t = str.size() - 1; i < str.size(); i++, t--)
{
str[i] = s[t];
}
return str;
}
|
#include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <deque>
#include <string>
#include <list>
#include <iterator>
#include <sstream>
#include <complex>
#include <fstream>
#include <functional>
#include <numeric>
#include <utility>
#include <algorithm>
#include <assert.h>
#include <unordered_map>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
#define endl '\n'
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ai(arr,n) for(int i=0;i<n;i++)cin>>arr[i];
#define ao(arr) for(auto asdfasdfasdf:arr) cout<<asdfasdfasdf<<" ";
#define mi(arr,m,n) for(int i=0;i<m;i++){ for(int j=0;j<n;j++) cin>>arr[i][j];}
#define mo(arr,m,n) for(int i=0;i<m;i++){ for(int j=0;j<n;j++) cout<<arr[i][j]<<" "; cout<<endl;}
#define countsetbits(x) __builtin_popcount(x)
#define ll long long
#define debug cout<<"I AM EXECUTING"<<endl
#define testcases int asdf; cin>>asdf; while(asdf--)
#define vi vector<int>
#define si set<int>
#define vc vector<char>
#define sc set<char>
#define vll vector<long long int>
#define vs vector<string>
#define vpp vector<pair<int,int>>
#define vppo(prs) for(auto x:prs){cout<<x.first<<" "<<x.second<<endl;}
#define For(__,$$,adfdf) for(int __ = $$; __<adfdf;__++)
vll primeFactors(ll int n) { vll a;
while (n % 2 == 0) { a.pb(2);
n = n/2;
}for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) { a.pb(i);n = n/i;
}
} if (n > 2) a.pb(n);
return a;
}
vll printDivisors(ll int n)
{ vll v;for (ll int i = 1; i <= sqrt(n); i++) { if (n % i == 0) {
if (n / i == i)
v.pb(i);
else {
v.pb(i);
v.push_back(n / i);
}
}
}
return v;
}
ll int power(ll int a, ll int b, ll int m){
if(b==0){
return 1;
}
else{
long long int temp=power(a,b/2,m);
if(b%2==0)
return (temp*temp)%m;
else
return (((a*temp)%m)*temp)%m;
}
}
string sconvert(ll int n)
{
stringstream ss;
ss<<n;
string str = ss.str();
return str;
}
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second > b.second);
}
template<typename KeyType, typename ValueType>
std::pair<KeyType,ValueType> get_max( const std::map<KeyType,ValueType>& x ) {
using pairtype=std::pair<KeyType,ValueType>;
return *std::max_element(x.begin(), x.end(), [] (const pairtype & p1, const pairtype & p2) {
return p1.second < p2.second;
});
}
const ll int mod = 1e9+7;
ll modmul(ll a, ll b) {
return ((a%mod) * (b%mod)) % mod;
}
ll modadd(ll a , ll b){
return((a%mod)+(b%mod)+mod)%mod;
}
ll modsub(ll a , ll b){
return((a%mod) - (b%mod) + mod)%mod;
}
void single()
{
ll int n;
cin>>n;
ll int answer=0;
For(i,1,n-1){
int a =i;
answer+=(n-1)/a;
}
cout<<answer+1<<endl;
return;
}
void multiple()
{
testcases
{
single();
}
}
int main()
{
IOS;
single();
}
| 0
| 44,737,454
|
#include <bits/stdc++.h>
using namespace std;
int main(){
char x, y; cin >> x >> y;
if (x<y) cout << '<';
if (x>y) cout << '>';
if (x==y) cout << '=';
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
#define prev prev55
long long n, a[500], ss;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
long long fh = 1e18;
for (int i = 0; i < n; i++) cin >> a[i], ss += a[i];
for (long long op = ss; op >= 0 && op >= ss - n * n; op--)
{
long long cnt = 0;
for (int i = 0; i < n; i++)
{
long long x = (a[i] + op) / (n + 1);
cnt += x;
if (a[i] + op - ((a[i] + op) / (n + 1)) * (n + 1) == n)
{
cnt = 1e18;
}
}
if (cnt == op)
{
fh = op;
}
}
cout << fh;
}
| 0
| 72,746,679
|
#define ll long long
#define dn double
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define mod 1000000007
#define sob(v) v.begin(),v.end()
#define sobr(v) v.rbegin(),v.rend()
#define fr(i,a,b) for(int i=a;i<=b;++i)
#define frr(i,a,b) for(int i=a;i>=b;--i)
#define pi acos(-1.00)
#define check cout<<"*"<<endl
#define ffix(x) cout<<fixed<<setprecision(x)
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
typedef vector<int> vi;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef pair<int,vi> pp;
int dr[8]= {0,0,-1,1,-1,-1,+1,+1};
int dc[8]= {-1,1,0,0,-1,+1,-1,+1};
const int N=2000000;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
if(a>=b)
{
while(k>0)
{
b*=2;
k--;
if(b>a)break;
}
}
if(b>=c)
{
while(k>0)
{
c*=2;
k--;
if(c>b)break;
}
}
if(c>b && b>a)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
double ans = 0;
rep(i, n)
{
double x;
string u;
cin >> x >> u;
if (u == "BTC")
x *= 380000.0;
ans += x;
}
printf("%.10f\n", ans);
return 0;
}
| 0
| 60,278,526
|
#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());}
template<class A,size_t N,class T>void Fill(A(&a)[N],const T&v){fill((T*)a,(T*)(a+N),v);}
const int MOD = 1e9+7;
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=MOD){lll x,y;gcd(a,m,x,y);return(x%m+m)%m;}
ll modPow(lll a,lll n,ll m=MOD){lll p=1;for(;n;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return p;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int N = 1e5;
int n, k;
ll c[N+1];
bool z[N+1];
main(){
cin.tie(0);
ios::sync_with_stdio(false);
for (int i=2; i<=N; ++i)if(!z[i])for(int j=i*2; j<=N; j+=i) z[j]=true;
cin >> n >> k;
FOR(i, 1, k+1) c[i] = modPow(k/i, n);
FOR(i, 2, k+1)if(!z[i])FOR(j, 1, k/i+1) c[j] -= c[j*i];
ll ans = 0;
FOR(i, 1, k+1) ans += c[i]%MOD*i%MOD;
cout << (ans%MOD+MOD)%MOD << endl;
}
|
#include <iostream>
using namespace std;
int main(){
int a,b,c,m,i,g,h;
cin>>a>>b>>c;
i=0;
for(m=1;m<=c;m++){
if(c%m==0){
g=m;
if(a<=g && b>=g){
h=i+1;
i=h;
}
}
}
cout<<i<<endl;
return 0;
}
| 0
| 28,953,544
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, ans = 1;
cin >> N;
vector<int64_t> A(N + 1), MA(N + 1), MI(N + 1);
for (int i = 0; i <= N; i++)
{
cin >> A.at(i);
}
MA[N] = MI[N] = A[N];
for (int i = N - 1; i >= 0; i--)
{
MI[i] = (MI[i + 1] + 1) / 2 + A[i];
MA[i] = MA[i + 1] + A[i];
}
if (!(MI[0] <= 1 && 1 <= MA[0]))
{
cout << -1 << endl;
return 0;
}
int64_t prev = 1;
for (int i = 1; i <= N; i++)
{
ans += min((prev - A[i - 1]) * 2, MA[i]);
prev = min((prev - A[i - 1]) * 2, MA[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m;
cin>>n>>m;
int k[m],s[m][20];
rep(i,m){
cin>>k[i];
rep(j,k[i]){
cin>>s[i][j];
s[i][j]--;
}
}
int p[m];
rep(i,m) cin>>p[i];
int ans=0;
for(int bit=0;bit<(1<<n);bit++){
int a=0;
rep(i,m){
int cnt=0;
rep(j,k[i]) if(bit&(1<<s[i][j])) cnt++;
if(cnt%2==p[i]) a++;
}
if(a==m) ans++;
}
cout<<ans;
}
| 0
| 98,956,738
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
int main()
{
ll n ;
cin >> n ;
vector<ll> a(n);
ll su=0;
rep(i, n){
cin >> a[i];
su^=a[i];
}
rep(i,60){
if(su>>i & 1LL){
ans+=1LL<<i;
}
}
rep(i,n){
a[i]=(a[i]|ans)^ans;
}
ll syu=0;
for (ll i = 59; i >= 0; i--)
{
for(ll j = syu; j < n; j++){
if(a[j]>>i & 1LL){
rep(k,n){
if(j==k)continue;
if(a[k]>>i & 1LL)a[k]^=a[j];
}
swap(a[syu],a[j]);
syu++;
break;
}
}
}
ll te=0;
rep(i,syu){
te^=a[i];
}
ans+=te*2;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int N,A,B,C,X,Y[100];
while(cin>>N>>A>>B>>C>>X){
if(N==0 && A==0 && B==0 && C==0 && X==0) break;
for(int i=0; i<N; i++)
cin>>Y[i];
int Cn=0;
for(int i=0; i<=10000; i++){
if(Y[Cn]==X) Cn++;
if(Cn>=N){
cout<<i<<endl;
break;
}
X=(A*X+B)%C;
}
if(Cn<N) cout<<-1<<endl;
}
}
| 0
| 84,606,113
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
string S;
cin >> N;
cin >> S;
vector<int> a(N);
for (int i = 0; i < N; i++) {
if (S[i] == 'R') a[i] = 0;
if (S[i] == 'G') a[i] = 1;
if (S[i] == 'B') a[i] = 2;
}
vector<long long> count(3, 0);
for (int i = 0; i < N; i++) {
count[a[i]]++;
}
long long ans = count[0] * count[1] * count[2];
for (int j = 0; j < N; j++) {
for (int i = 0; i < j; i++) {
int k = j + (j - i);
if (k < N) {
if (a[i] == a[j]) continue;
if (a[j] == a[k]) continue;
if (a[k] == a[i]) continue;
ans--;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
#define str string
#define pi pair
#define tup tuple
#define vec vector
#define temp template
#define tn typename
#define ff first
#define ss second
#define SZ(x) (ll) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rsz resize
#define ins insert
#define fr front
#define bc back
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define mk make_pair
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define ROF(i, a, b) for (ll i = (a); i >= (b); i--)
#define trav(a, x) for (auto &a : x)
#define popcount __builtin_popcount
#define ctz __builtin_ctz
#define clz __builtin_clz
#define gcd __gcd
#define ts to_string
temp<tn A, tn B> str ts(pi<A, B> p);
temp<tn A, tn B, tn C> str ts(tup<A, B, C> p);
str ts(const str& s) { return '"' + s + '"'; }
str ts(const char* s) { return ts((str) s); }
str ts(bool b) { return (b ? "true" : "false"); }
str ts(vec<bool> v) { bool f = true; str res = "{";
FOR(i, 0, static_cast<ll>(v.size()) - 1)
{ if (!f) res += ", "; res += ts(v[i]);
f = false; } res += "}"; return res; }
temp<size_t N> str ts(bitset<N> v) { str res = "";
trav(a, v) { res += (char) ('0' + a); } return res; }
temp<tn A> str ts(A v) { bool f = true; str res = "{";
trav(x, v) { if (!f) res += ", "; res += ts(x);
f = false; } res += "}"; return res; }
temp<tn A, tn B> str ts(pi<A, B> p) {
return "(" + ts(p.ff) + ", " + ts(p.ss) + ")"; }
temp<tn A, tn B, tn C> str ts(tup<A, B, C> t) {
return "(" + ts(get<0>(t)) + ", " + ts(get<1>(t)) + ", " + ts(get<2>(t)) + ")"; }
void DBG() { cerr << endl; }
temp<tn H, tn... T> void DBG(H h, T... t) { cerr << " " << ts(h); DBG(t...); }
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", DBG(__VA_ARGS__);
temp<tn T> void re(T& x) { cin >> x; };
temp<tn H, tn... T> void re(H& h, T&... t) { re(h); re(t...); }
temp<tn T> void pr(T x) { cout << x; };
temp<tn H, tn... T> void pr(H h, T... t) { pr(h); pr(t...); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
auto Do = [&](ll L, ll R, ll &k) {
while (L < R && k) {
pr(L, " ", R, '\n');
--k;
++L;
--R;
}
};
ll n, m;
re(n, m);
if (n % 2 == 1) {
Do(1, n, m);
return 0;
}
Do(1, n / 2, m);
Do(n / 2 + 2, n, m);
return 0;
}
| 0
| 87,291,983
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
double a, b, x;
cin >> a >> b >> x;
x /= a;
double ans;
if (x <= a * b / 2.0)
ans = M_PI_2 - atan(2.0 * x / (b * b));
else
ans = atan(2 * (a * b - x) / (a * a));
printf("%.10lf\n", ans * 180 / M_PI);
}
|
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repm(i, a, n) for (ll i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vs vector<string>
#define vii vector<vector<int>>
#define vll vector<ll>
#define vllll vector<vector<ll>>
#define vd vector<double>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define reverse_v(a) reverse(a.begin(), a.end())
#define fi first
#define se second
void print(bool c)
{
(c) ? (cout << "Yes" << endl) : (cout << "No" << endl);
}
void Print(bool c)
{
(c) ? (cout << "YES" << endl) : (cout << "NO" << endl);
}
template <typename T>
T gcd(T a, T b)
{
while (1)
{
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
template <typename T>
T lcm(T a, T b)
{
return a * b / gcd(a, b);
}
bool cmp(const pii &a, const pii &b)
{
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int eve(int x)
{
if (x % 400 == 0)
return 1;
if (x % 100 == 0)
return 0;
if (x % 4 == 0)
return 1;
return 0;
}
int main(void)
{
ll n;
cin >> n;
vll a(n), sum(n + 1);
map<ll, ll> mp;
mp[0]++;
rep(i, 0, n)
{
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
mp[sum[i + 1]]++;
}
ll ans = 0;
for (auto x : mp)
ans += x.second * (x.second - 1) / 2;
cout << ans << endl;
}
| 0
| 40,612,836
|
#include <bits/stdc++.h>
#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 pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename A, size_t N, typename T>void Fill(A (&array)[N], const T&v)
{fill((T*)array,(T*)(array+N),v);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}
const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
ll w, h, p;
vpll v;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> w >> h;
FOR(i, 0, w){
cin >> p;
v.pb(mp(p, 0));
}
FOR(i, 0, h){
cin >> p;
v.pb(mp(p, 1));
}
ll ans = 0;
w++;
h++;
sort(rng(v));
for(pll p: v){
if(p.se){
ans += w * p.fi;
h--;
}else{
ans += h * p.fi;
w--;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long ara[2003][2003],tra[2003][2003],val[2003],tal[2003];
long long mod=1000000007;
int main()
{
long long n,m,i,j,k,x,y,z,p,q,r,a,b=1;
scanf("%lld %lld",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%lld",&a); val[i]=a;
}
for(i=1;i<=m;i++)
{
scanf("%lld",&a); tal[i]=a;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(val[i]==tal[j])
{
if(i==1 || j==1)ara[i][j]=1;
else
{
p=i-1; q=j-1;
ara[i][j]=(tra[p][q]+1)%mod;
}
}
b=(b+ara[i][j])%mod;
x=(tra[i-1][j]+tra[i][j-1]+ara[i][j])%mod;
y=tra[i-1][j-1];
if(x>=y)z=x-y;
else{ z=(mod-y)+x; }
tra[i][j]=z;
}
}
printf("%lld\n",b);
return 0;
}
| 0
| 62,181,562
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<double> Vec;
ll N;
vector<Vec> Vs;
const double EPS = 1e-10;
double R;
ll classify(Vec v, Vec w) {
Vec dotcross = conj(v) * w;
double dot = dotcross.real(), cross = dotcross.imag();
return cross > EPS ? 0 : -cross > EPS ? 1 : dot > EPS ? 2 : 3;
}
int main() {
cin >> N;
for (ll i = 0; i < N; ++i) {
ll x, y;
cin >> x >> y;
Vs.push_back(Vec(x, y));
}
for (Vec v : Vs) {
Vec sum[4];
for (Vec w : Vs) sum[classify(v, w)] += w;
R = max({R, abs(sum[0]), abs(sum[1]), abs(sum[0] + sum[2]),
abs(sum[1] + sum[2])});
}
cout << setprecision(15) << R << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int getMaxPoint(vector<int> v,int &p){
int point=INT_MIN,act=-1;
for(int i=0;i<3;i++){
if(i==p)
continue;
if(v[i]>point){
point=v[i];
act=i;
}
}
p=act;
return point;
}
int main(){
int n;
cin>>n;
vector<vector<int> > vac(n,vector<int> (3));
for(int i=0;i<n;i++){
cin>>vac[i][0]>>vac[i][1]>>vac[i][2];
}
int activity=-1;
vector<vector<int> > dp(n,vector<int> (3));
dp[0]=vac[0];
for(int i=1;i<n;i++){
dp[i][0]=vac[i][0]+max(dp[i-1][1],dp[i-1][2]);
dp[i][1]=vac[i][1]+max(dp[i-1][0],dp[i-1][2]);
dp[i][2]=vac[i][2]+max(dp[i-1][0],dp[i-1][1]);
}
cout<<max(dp[n-1][0],max(dp[n-1][1],dp[n-1][2]))<<endl;
return 0;
}
| 0
| 66,020,838
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
void solve(){
int d; cin >> d;
string s = "Christmas";
for(int i = d; i < 25; i++){
s += " Eve";
}
cout << s << endl;
return;
}
int main(){
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define ALL(x) (x).begin(),(x).end()
typedef pair<ll, ll> P;
int main() {
int n, k;
cin >> n >> k;
if(k > (n-1) * (n-2) / 2) {
cout << "-1" << endl;
return 0;
}
int muda = (n-1) * (n-2) / 2 - k;
cout << n-1 + muda << endl;
REPN(i, 1, n) {
cout << 1 << " " << i+1 << endl;
}
if(muda == 0) return 0;
int idx = 0;
REPN(i, 1, n) REPN(j, i+1, n) {
cout << i+1 << " " << j+1 << endl;
idx++;
if(idx == muda) return 0;
}
return 0;
}
| 0
| 11,259,404
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
ll f(ll n,ll x){
if(n==0){
return 1;
}
ll t=(1LL<<(n+2))-3,p=(1LL<<(n+1))-1;
ll h=(t+1)/2;
if(x==1){
return 0;
}
else if(x<h){
return f(n-1,x-1);
}
else if(x==h){
return (1LL<<n);
}
else if(x<t){
return f(n-1,x-h)+(1LL<<n);
}
else{
return p;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,x;cin >> n >> x;
cout << f(n,x) << endl;
}
|
#include<stdio.h>
int main()
{
int N, i, j, test;
unsigned long long mul;
long long A[100001], tt=1000000000000000000;
scanf("%d", &N);
mul=1;
test=1;
for(i=1; i<=N; i++){
scanf("%lld", &A[i]);
}
for(i=1; i<=N; i++){
if(A[i]==0){
test=0;
break;
}
if(tt/mul >= A[i])
{
mul *= A[i];
}
else
test=2;
}
if(test==0)
printf("0\n");
else if(test==1)
printf("%llu\n", mul);
else if(test==2)
printf("-1\n");
return 0;
}
| 0
| 30,413,763
|
#include <iostream>
using namespace std;
char conv[128];
void make() {
for(int i = 0; i < 128; ++i) conv[i] = i;
}
main() {
int n, m;
while((cin >> n) && n) {
make();
for(int i = 0; i < n; ++i) {
char a, b;
cin >> a >> b;
conv[a] = b;
}
cin >> m;
for(int i = 0; i < m; ++i) {
char c;
cin >> c;
cout << conv[c];
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e6;
int V,E;
vector<vector<long long int>> d;
int main(){
cin >> V >> E;
d.assign(V, vector<long long int>(V, INF));
for (int i=0; i<V; i++){
d[i][i] = 0;
}
vector<int> a(E), b(E), c(E);
for (int i=0; i<E; i++){
int u, v, w;
cin >> u >> v >> w;
u -= 1;
v -= 1;
d[u][v] = w;
d[v][u] = w;
a[i] = u;
b[i] = v;
c[i] = w;
}
for (int k=0; k<V; k++){
for (int i=0; i<V; i++){
for (int j=0; j<V; j++){
d[i][j] = min(
d[i][j],
d[i][k] + d[k][j]
);
}
}
}
int ans = E;
for (int i=0; i<E; i++){
bool used = false;
for (int j=0; j<V; j++){
if(d[j][a[i]] + c[i] == d[j][b[i]]) used = true;
}
if(used == true) ans -= 1;
}
cout << ans << endl;
return 0;
}
| 0
| 36,525,531
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string s; cin >> s;
string a,b;
for(int i = 0; i < s.size(); i++){
if(i < s.size() / 2){
a.push_back(s[i]);
}
if(i > s.size()/ 2){
b.push_back(s[i]);
}
}
for(int i = 0; i < s.size() / 2; i++){
if(s[i] != s[s.size() - i - 1]){
cout << "No" << endl; return 0;
}
}
for(int i = 0; i < a.size() / 2; i++){
if(a[i] != a[a.size() - i - 1]){
cout << "No" << endl; return 0;
}
}
for(int i = 0; i < b.size() / 2; i++){
if(b[i] != b[b.size() - i - 1]) {
cout << "No" << endl; return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define LL long long
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPA(i,n) for(int i=1;i<(n);++i)
#define PII pair<int,int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define MOD ((int)1e6 + 3)
#define INF ((int)1e9)
#define INFLL ((LL)1e18)
#define ALL(x) (x).begin(),(x).end()
#define ctoi(x) (x - 'a')
#define CTOI(x) (x - 'A')
#define BIT(x) (1 << (x))
using namespace std;
LL modinv(LL a){
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;
}
int exp(int a, int b){
LL res = 1;
LL sum = a;
for(int i=0;i<30;++i){
if(BIT(i)&b){
res = (res * sum)%MOD;
}
sum = (sum * sum) % MOD;
}
return res;
}
int main(){
LL N, X;
cin >> N >> X;
N-=X;
LL ans = 0;
while(N!=0&&X!=0){
if(N>=X){
LL d = N / X;
ans += d * X * 3;
N %= X;
}else{
LL d = X / N;
ans += d * N * 3;
X %= N;
}
}
cout << ans << endl;
return 0;
}
| 0
| 14,985,017
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main(){
ll N, M;
cin >> N >> M;
vl A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
map<ll, ll> rem_cnt;
rem_cnt[0]++;
ll sum = 0;
rep(i, N){
sum += A[i] % M;
sum %= M;
rem_cnt[sum]++;
}
ll cnt;
for(auto it = rem_cnt.begin(); it != rem_cnt.end(); it++){
cnt = it->second;
ans += cnt * (cnt - 1) / 2;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1e9;
const int MOD = 1e9+7;
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 (b<a) {a=b; return 1;} return 0;}
#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...)
#define print(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m; cin >> n >> m;
vector<string> a(n);
rep(i, n) cin >> a[i];
vector<string> b(m);
rep(i, m) cin >> b[i];
bool found = false;
rep(i, n-m+1) rep(j, n-m+1) {
bool ok = true;
rep(k, m) rep(l, m) {
debug(i, j, k, l);
if (a[i+k][j+l]!=b[k][l]) ok = false;
}
if (ok) found = true;
}
if (found) puts("Yes");
else puts("No");
}
| 0
| 6,653,563
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
int N;
cin >> N;
vector<double> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(ALL(v));
double ans = (v[0] + v[1]) / 2.0;
for (int i = 2; i < N; i++) {
ans = (ans + v[i]) / 2.0;
}
printf("%32.18f\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int t = 0;
if (n % 2)
{
for (int i = n-1; i >= 0; i-=2 )
{
b[t] = a[i];
t++;
}
for (int i = 1; i < n-1; i+=2)
{
b[t] = a[i];
t++;
}
}
else
{
for (int i = n-1; i > 0; i-=2 )
{
b[t] = a[i];
t++;
}
for (int i = 0; i < n-1; i+=2)
{
b[t] = a[i];
t++;
}
}
for (int i = 0; i < n; i++)
{
cout << b[i];
if (i != n-1)
{
cout << " ";
}else{
cout << endl;
}
}
}
int main() {
solve();
return 0;
}
| 0
| 34,486,492
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int w, h;
cin >> w >> h;
vector<int> p(w);
rep(i, w) cin >> p.at(i);
vector<int> q(h);
rep(i, h) cin >> q.at(i);
sort(ALL(p)), sort(ALL(q));
p.push_back(1e9), q.push_back(1e9);
int ip = 0, iq = 0;
ll ans = 0;
while(ip != p.size()-1 || iq != q.size()-1){
ll np = p.at(ip), nq = q.at(iq);
if(np < nq){
np *= h-iq+1;
ans += np;
ip++;
}else{
nq *= w-ip+1;
ans += nq;
iq++;
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#include <time.h>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
typedef vector<ll> vll;
typedef vector< vector<ll> > matrix;
#define REP(i, x, y) for(ll i = (ll)x; i < (ll)y; i++)
#define DREP(i, x, y, d) for(ll i = (ll)x; i < (ll)y; i += (ll)d)
#define PER(i, x, y) for(ll i = (ll)x; i > (ll)y; i--)
#define DPER(i, x, y, d) for(ll i = (ll)x; i > (ll)y; i -= (ll)d)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-12;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
ll len = s.size();
ll dp[len];
fill(dp, dp + len, inf);
ll now = 0;
map<ll, ll> mp;
mp[0] = 1;
REP(i, 0, len) {
ll chnum = s[i] - 'a';
now = now ^ ((ll)1 << chnum);
if (now == 0) {
mp[now] = 1;
dp[i] = 1;
} else {
REP(j, 0, 26) {
ll p = now ^ ((ll)1 << j);
if (p == 0) {
mp[now] = 1;
dp[i] = min(dp[i], (ll)1);
} else {
if (mp.count(p) != 0) {
if (mp.count(now) != 0) {
mp[now] = min(mp[now], mp[p] + 1);
} else {
mp[now] = mp[p] + 1;
}
dp[i] = min(dp[i], mp[p] + 1);
}
}
}
}
}
ll ans = dp[len - 1];
cout << ans << endl;
}
| 0
| 63,205,010
|
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long 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;}
typedef pair<int,int> P;
int main(){
int n,a,b; cin >> n >> a >> b;
if(a>b||(n==1&&a!=b)){
cout << 0 << endl;
return 0;
}
if(a==b||n==2){
cout << 1 << endl;
return 0;
}
n-=2;
ll MAX=0,MIN=0;
rep(i,n){
MAX+=b;
MIN+=a;
}
cout << MAX-MIN+1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define DAYS 5000000000000000
using namespace std;
int main(void){
string s;
long long int k, tmp, cnt = 0;
cin >> s >> k;
for (int i=0; i<s.size(); i++){
if (s[i] == '1') cnt++;
else{
for (int j=1; j<=DAYS; j++){
tmp = pow(s[i] - '0', j);
if (cnt + tmp >= k){
cout << s[i] << endl;
return 0;
}
}
cnt += tmp;
}
if (cnt >= k){
cout << s[i] << endl;
return 0;
}
}
}
| 0
| 94,328,675
|
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
int main() {
string S;
cin >> S;
sort(ALL(S));
if (S == "abc") {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(const int n, const int m, ll x, vector<ll> c, vector<vector<ll>> a) {
const int bit = 1 << n;
ll res = -1;
for(int i=0; i< bit; i++) {
ll cost = 0;
vector<ll> temp(m, 0);
for(int j=0;j<n;j++) {
if(i & (1 << j)) {
cost += c[j];
for(int k=0;k<m;k++) {
temp[k] += a[j][k];
}
}
}
for(int j=0;j<m;j++) {
if(temp[j] < x) {
break;
}
if(j==m-1) {
res = res == -1 ? cost : min(cost, res);
}
}
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
ll x;
cin >> x;
vector<ll> c(n);
vector<vector<ll>> a(n, vector<ll>(m));
for(int i=0;i<n;i++) {
cin >> c[i];
for(int j=0;j<m;j++) {
cin >> a[i][j];
}
}
cout << solve(n, m, x, c, a);
}
| 0
| 79,015,406
|
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
string S; cin >> S;
string k = "keyence";
bool flag = false;
rep(i,S.size()){
for (int j=i;j<S.size();j++){
string s = S.substr(0,i) + S.substr(j);
if (s==k) flag = true;
}
}
cout << (flag? "YES" : "NO") << endl;
return 0;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int n;
cin >> n;
vector <int> w(n);
vector <int> wa(n);
int wa2=0;
rep(i,n){
cin >> w[i];
wa2+=w[i];
wa[i]=wa2;
}
int j;
rep(i,n){
if(wa[i]>(wa2/2)){
j=i;
break;
}
}
int ans;
ans=min((wa2-2*wa[j-1]),wa[j]-(wa2-wa[j]));
cout << ans << endl;
return 0;
}
| 0
| 34,487,152
|
#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
T x; \
cin >> x;
#define AIN(T, a, n) \
vector<T> a(n); \
FOR(i, a) \
cin >> i;
#define A2IN(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) \
cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a) \
cout << #a << " = {"; \
JOUT(ALL(a), ", ", cout) << "}" << endl;
template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
if (s != e)
{
os << *s;
++s;
}
while (s != e)
{
os << sep << *s;
++s;
}
return os;
}
ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
if (cond)
{
os << yes << endl;
}
else
{
os << no << endl;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
os << '(' << p.first << ", " << p.second << ')';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
os << '[';
JOUT(ALL(v), ", ", os) << ']';
return os;
}
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template
int main()
{
IN(ll, N);
ll M = 1 << N;
AIN(ll, A, M);
ll ans = 0;
REP1(i, M - 1)
{
ll opt = 0;
ll opt2 = 0;
for (ll j = M - 1; j >= 0; --j)
{
j &= i;
if (A[j] > opt)
{
opt2 = opt;
opt = A[j];
}
else if (A[j] > opt2)
{
opt2 = A[j];
}
}
CH(max, ans, opt + opt2);
OUT(ans);
}
}
|
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans;
if(a > b) ans = 0;
else if(n == 1) {
if(a == b) ans = 1;
else ans = 0;
} else {
ans = (a + b * (n - 1)) - (b + a * (n - 1)) + 1;
}
cout << ans << endl;
return 0;
}
| 0
| 71,750,624
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define For(i,j,k) for(int i=j;i<=k;++i)
#define Dow(i,j,k) for(int i=k;i>=j;--i)
#define ll long long
#define inf 1e8
using namespace std;
inline ll read()
{
ll t=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') t=t*10+c-48,c=getchar();
return t*f;
}
ll a[200001],sum[200001],ans=1e17,n;
int main()
{
n=read();
For(i,1,n) a[i]=read();
For(i,1,n) sum[i]=sum[i-1]+a[i];
Dow(i,1,n-1)
ans=min(ans, abs(sum[n]-sum[i]-sum[i]) );
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
ll N, M;
int main(){
cin >> N >> M;
priority_queue<ll> A;
rep(i, N) {
ll a;
cin >> a;
A.push(a);
}
while(M) {
ll a = A.top();
A.pop();
A.push(a/2);
M--;
}
ll ans = 0;
while(!A.empty()) {
ll a = A.top();
A.pop();
ans += a;
}
cout << ans << endl;
}
| 0
| 82,722,779
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> H(N);
for(int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
if(N > 1) {
for(int i = 0; i < N - 1; i++) {
int count = 0;
for(int j = 0; j < N - i - 1; j++) {
if(H[i + j] >= H[i + j + 1]) {
count++;
}
else {
break;
}
}
if(count > ans) {
ans = count;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N;
vector<string> B(N);
vector<string> R(M);
map<string,int> ans;
for(int i=0; i<N; i++){
string s; cin >> s;
if(ans.count(s)){
ans.at(s)++;
}else{
ans[s] = 1;
}
}
cin >> M;
for(int i=0; i<M; i++){
string t; cin >> t;
if(ans.count(t)){
ans.at(t)--;
}else{
ans[t] = -1;
}
}
int m=0;
for(auto cnt : ans){
auto v = cnt.second;
m = max(m,v);
}
cout << m << endl;
}
| 0
| 10,576,817
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int K, A, B;
cin >> K >> A >> B;
int ans = 0;
for (int i=A ; i<=B ; i++){
if (i%K == 0){
ans = 1;
break;
}
}
if (ans == 1)
cout << "OK" << endl;
else
cout << "NG" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
struct edge {
int i, j, w;
};
int main() {
int n, m;
cin >> n >> m;
vector< vector<int> > d(n, vector<int>(n, 1001));
vector<edge> es(m);
rep(i, m) {
cin >> es[i].i >> es[i].j >> es[i].w;
}
for (auto ee = es.begin(); ee != es.end(); ee++) {
edge e = *ee;
d[e.i - 1][e.j - 1] = e.w;
d[e.j - 1][e.i - 1] = e.w;
}
rep(k, n) {
rep(i, n) {
rep(j, n) {
int l = d[i][k] + d[k][j];
if (d[i][j] > l) {
d[i][j] = l;
}
}
}
}
int c = 0;
for (auto ee = es.begin(); ee != es.end(); ee++) {
edge e = *ee;
if (d[e.i - 1][e.j - 1] < e.w) {
c++;
}
}
cout << c << endl;
}
| 0
| 67,106,081
|
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N;
int K;
int a = 0;
long long int sum = 0;
cin>>N;
cin>>K;
int arr[N];
for(int i = 0;i < N;i++){
cin>>arr[i];
}
sort(arr,arr + (N),greater<int>());
for(int i = 0;i <= N && i < K;i++){
arr[i] = 0;
a += 1;
}
for(int i = a;i < N;i++){
sum += arr[i];
}
cout<<sum<<'\n';
}
|
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
constexpr int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
constexpr double EPS = 1e-10;
constexpr double PI = M_PI;
#pragma endregion
void solve() {
int n, z, w;
cin >> n >> z >> w;
vector<int> a(n);
for (int i=0; i<n; i++) cin >> a.at(i);
if (n == 1) {
cout << abs(w - a.back()) << '\n';
} else {
cout << max(abs(w - a.back()), abs(a.at(n-1) - a.at(n-2))) << '\n';
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
solve();
return 0;
}
| 0
| 42,264,816
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
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 int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
ll H, W, D;
ll A[400][400];
ll Q;
ll L[101010];
ll R[101010];
using Pii = pair<int, int>;
map<int, Pii> mp;
ll sum[201010];
int main() {
cin >> H >> W >> D;
repe(i, 1, H) {
repe(j, 1, W) {
cin >> A[i][j];
mp[A[i][j]] = make_pair(i, j);
}
}
cin >> Q;
rep(i, 0, Q) { cin >> L[i] >> R[i]; }
for (int i = 1; i <= D; ++i) {
ll cur_num = i;
while (cur_num <= H * W) {
auto cur = mp[cur_num];
cur_num += D;
auto next = mp[cur_num];
sum[cur_num] = sum[cur_num - D] + abs(cur.first - next.first) +
abs(cur.second - next.second);
}
}
rep(i, 0, Q) {
ll l = L[i];
ll r = R[i];
ll cur_num = l;
ll ans = sum[r] - sum[l];
cout << ans << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define FOR(itr, v) for (auto itr = (v).begin(); itr != (v).end(); ++itr)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
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> void PrintVector(const vector<T> &vec) {for (auto val : vec) cout << val << " "; cout << endl;}
const long long INF = 1LL << 60;
const long long minusINF = -(1LL << 40);
const int MOD = 1000000007;
const double PI = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
ll n, m; cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a[i];
map<ll, ll> nums;
ll sum = 0;
nums[sum]++;
rep(i, n)
{
sum += a[i];
nums[sum % m]++;
}
ll ans = 0;
for (auto it : nums)
{
ans += it.second * (it.second - 1) / 2;
}
cout << ans << endl;
}
| 0
| 41,317,483
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.