code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include<iostream>
#include<cstring>
using namespace std;
bool a[10000000];
int main()
{
int n;
while(cin>>n)
{
int js=0;
for (int i=2;i<=n;i++)
if (!a[i]) {js++;for (int j=i+i;j<=n;j+=i) a[j]=true;}
cout<<js<<endl;
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define ulli unsigned long long int
#define ld long double
#define endl "\n"
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n);
for (int& x: v) {
cin >> x;
}
sort(v.begin(), v.end());
int ans = v[n/2] - v[n/2 - 1];
cout << ans << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
solve();
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
| 0
| 99,326,249
|
#include <iostream>
#include <algorithm>
#include <vector>
template <typename Iterator>
auto findMaximumSum (Iterator begin , Iterator end) -> long long
{
long long res = * begin;
auto tmp = res;
for (auto ite = begin + 1; ite != end; ++ ite)
{
tmp += * ite;
res = std::max (res , tmp);
}
return res;
}
auto main () -> int
{
int n;
while (std::cin >> n && n)
{
std::vector <int> a (n);
for (auto && elem : a)
{
std::cin >> elem;
}
long long ans = a [0];
for (auto ite = a.begin (); ite != a.end (); ++ ite)
{
auto tmp = findMaximumSum (ite , a.end ());
ans = std::max (ans , tmp);
}
std::cout << ans << std::endl;
}
}
|
#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;
cin >> N;
vl A(N);
rep(i, N) cin >> A[i];
ll left = 0, right = 0;
ll ans = 1;
ll calc = A[0];
while(right < N - 1){
if((calc ^ A[right + 1]) == (calc + A[right + 1])){
right++;
calc += A[right];
ans += right - left + 1;
} else{
calc -= A[left];
left++;
if(left > right){
right = left;
calc = A[left];
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 23,631,230
|
#include <iostream>
using namespace std;
int main(){
int n;
while(~scanf("%d",&n)){
int res = 0;
for(int a=0;a<=9;a++)
for(int b=0;b<=9;b++)
for(int c=0;c<=9;c++)
for(int d=0;d<=9;d++)
if(a+b+c+d == n) res++;
printf("%d\n",res);
}
}
|
#include <iostream>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0)break;
n = 1000 - n;
int ans=0;
if(n >= 500){
n -= 500;
ans++;
}
while(n >= 100){
n-=100;
ans++;
}
if(n >= 50){
n-=50;
ans++;
}
while(n >= 10){
n-=10;
ans++;
}
if(n >= 5){
n-=5;
ans++;
}
ans += n;
cout << ans <<endl;
}
}
| 0
| 47,329,576
|
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[200000];
int main()
{
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
flag=1;
break;
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
printf("YES\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
int n;
V<int> a;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
a = V<int>(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int x = *max_element(begin(a), end(a));
int y = -1;
auto shift = [&](int x, int y) {
if (x % 2 == 0 || y < x/2) return abs(x/2-y);
return abs((x+1)/2-y);
};
for (int i = 0; i < n; i++) {
if (a[i] == x) continue;
if (shift(x, a[i]) < shift(x, y)) {
y = a[i];
}
}
printf("%d %d\n", x, y);
return 0;
}
| 0
| 100,497,264
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9+7;
int main(){
int x, a, b;
cin >> x >> a >> b;
int day = -a + b;
if(day <= 0) cout << "delicious" << endl;
else if(day > 0 && day <= x) cout << "safe" << endl;
else cout << "dangerous" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
ll n,m,v,p,cnt,sum=0,vd; cin>>n>>m>>v>>p;
ll ans=p;
vector<ll> a(n,0),s(n+1,0);
rep(i,n) cin>>a[i];
sort(al(a)); reverse(al(a));
rep(i,n){
sum+=a[i]; s[i+1]=sum;
}
for(ll i=p;i<n;i++){
if(a[p-1]>a[i]+m) break;
vd=v-(n-i)-(p-1);
if((a[i]+m)*(i-(p-1))-(s[i]-s[p-1])>=vd*m){
ans++;
}
else break;
}
cout<<ans<<endl;
}
| 0
| 6,799,934
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S, T;
cin >> S >> T;
int ans = 0;
rep(i,3) {
if (S[i] == T[i]) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define sz(v) (int)v.size()
#define debug(var) cout << #var << ": " << var << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int h, w, m;
cin >> h >> w >> m;
vector<int> cntrow(h + 1), cntcol(w + 1);
set<pair<int, int>> targets;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
cntrow[x]++, cntcol[y]++;
targets.insert({x, y});
}
int mxcntrow = 0;
for (int e : cntrow)
mxcntrow = max(mxcntrow, e);
int mxcntcol = 0;
for (int e : cntcol)
mxcntcol = max(mxcntcol, e);
vector<int> rows, cols;
for (int i = 0; i < sz(cntrow); i++) {
int &e = cntrow[i];
if (e == mxcntrow)
rows.push_back(i);
}
for (int i = 0; i < sz(cntcol); i++) {
int &e = cntcol[i];
if (e == mxcntcol)
cols.push_back(i);
}
int flag_perfect = 0;
for (int ei : rows) {
for (int ej : cols)
if (targets.find({ei, ej}) == targets.end()) {
flag_perfect = 1;
break;
}
if (flag_perfect)
break;
}
cout << mxcntrow + mxcntcol - 1 + flag_perfect;
}
| 0
| 27,338,803
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
cout << x*800-x/15*200;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define INF 1007654321
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define FAST_IO() ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
ostream& operator<<(ostream &os, const vector<T> &v) { for (auto x : v) os << x << " "; return os << "\n"; }
struct Point {
ll x, y;
};
void print(int x, int y, int m) {
if(m <= 0) {
cout << "\n";
return;
}
if(y + x >= 0 && y - x >= 0) {
cout << 'U';
print(x, y - (1LL << (m - 1)), m - 1);
} else if(y + x >= 0 && y - x < 0) {
cout << 'R';
print(x - (1LL << (m - 1)), y, m - 1);
} else if(y + x < 0 && y - x >= 0) {
cout << 'L';
print(x + (1LL << (m - 1)), y, m - 1);
} else {
cout << 'D';
print(x, y + (1LL << (m - 1)), m - 1);
}
}
int main() {
FAST_IO();
int N; cin >> N;
vector<Point> P(N);
rep(i, N) cin >> P[i].x >> P[i].y;
bool hasOdd = false, hasEven = false;
rep(i, N) {
if((abs(P[i].x) + abs(P[i].y)) % 2 == 0) hasEven = true;
else hasOdd = true;
}
if(hasOdd && hasEven) {
cout << "-1\n";
return 0;
}
if(hasEven) {
rep(i, N) P[i].x -= 1;
}
const int m = 32;
if(hasEven) {
cout << m + 1 << "\n";
cout << 1 << " ";
}
else cout << m << "\n";
rep(i, m) {
cout << (1LL << (m - i - 1)) << " ";
}
cout << "\n";
rep(i, N) {
if(hasEven) cout << 'R';
print(P[i].x, P[i].y, m);
}
}
| 0
| 10,430,523
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main(){
int n,ans=0; cin>>n;
vector<int> a(n,0),b(n,0);
rep(i,n){
cin>>a[i];
b[i]=a[i];
}
sort(al(a));
set<int> s;
rep(i,(n+1)/2) s.insert(a[2*i]);
rep(i,(n+1)/2) if(s.count(b[2*i])==0) ans++;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> C(n - 1), S(n - 1), F(n - 1);
rep(i, n - 1) {
cin >> C[i] >> S[i] >> F[i];
}
rep(i, n - 1) {
int ans = 0;
ans += S[i] + C[i];
for (int j = i + 1; j < n - 1; j++) {
if (ans == S[j]) {
ans += C[j];
} else if (ans < S[j]) {
ans += C[j] + (S[j] - ans);
} else {
if ((ans - S[j]) % F[j] == 0) {
ans += C[j];
} else {
ans += C[j] + F[j] - (ans - S[j]) % F[j];
}
}
}
cout << ans << endl;
}
cout << 0 << endl;
}
| 0
| 47,876,401
|
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<cctype>
using namespace std;
int main(){
string card;int h,m;
string a,b;
while(true){
cin>>card;
if(card=="-")break;
cin>>m;
for(int i=0;i<m;i++){
cin>>h;
a=card.substr(0,h);
b=card.substr(h,card.size());
card=b+a;
}
cout<<card<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<long long> V(N);
for(int i=0; i<N; i++) cin >> V[i];
int ans=0;
for(int i=0; i<=K; i++){
for(int j=0; j<=K-i; j++){
if(i+j>N) continue;
vector<long long> S;
int res=0;
for(int k=0; k<i; k++){
res += V[k];
S.push_back(V[k]);
}
for(int l=0; l<j; l++){
res += V[N-l-1];
S.push_back(V[N-l-1]);
}
sort(S.begin(), S.end());
for(int k=0; k<(K-i-j); k++){
if(k>=S.size()) break;
if(S[k]>0) break;
res -= S[k];
}
ans = max(ans, res);
}
}
cout << ans << endl;
return 0;
}
| 0
| 45,127,103
|
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
#define all(x) x.begin(),x.end()
using pint = pair<int,int>;
using vec = vector<int>;
using ll=long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
double PI = acos(-1);
double a,b,x;cin>>a>>b>>x;
double area=x/a;
auto theta = [&](double t){
if(tan(t)<=b/a){
return a*b - a*(a*tan(t))/2;
}else{
return b*(b/tan(t))/2;
}
};
double l=0, r = PI/2;
for(int i=0; i<10000; ++i) {
double mid=(l+r)/2;
if(theta(mid)>=x/a) l = mid;
else r = mid;
}
cout<<fixed<<setprecision(10)<<l*180/PI<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
ll gcd(ll a, ll b){
ll r;
while (b != 0){
r = a % b;
a = b;
b = r;
}
return a;
}
ll *calc_z(string s){
ll n = s.size();
ll *z = new ll[n] {0};
ll l = 0, r = 0;
for (ll i = 1; i < n; i++){
if (r >= i) z[i] = min(z[i-l], r-i+1);
while (z[i]+i < n && s[z[i]] == s[z[i]+i]) z[i]++;
if (i + z[i] - 1 > r){
l = i;
r = i+z[i]-1;
}
}
return z;
}
ll find_lower(ll *a, ll n, ll v){
ll l = -1, r = n;
while (r>l+1){
ll m = (l+r)/2;
if (a[m] >= v) r = m;
else l = m;
}
if (r == n) return n-1;
if (a[r] == v) return r;
return r == 0 ? 0 : r-1;
}
void init(){
}
void solve(){
int x, y;
cin >> x >> y;
int s1 = 4*x-y;
int s2 = y-2*x;
if ((s1 >= 0 && s1 % 2 == 0) && (s2 >= 0 && s2 % 2 == 0)) cout << "Yes\n";
else cout << "No\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| 0
| 41,393,990
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<ll> h(n);
for (ll i = 0; i < n; i++)
{
cin >> h[i];
}
ll ans = 0;
ll buf = 0;
for (ll i = 0; i < n - 1; i++)
{
if (h[i] >= h[i + 1])
{
buf++;
ans = max(ans, buf);
}
else
{
buf = 0;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
int first[3][10];
int second[3][10];
int thired[3][10];
int force[3][10];
for(int tk = 0; tk < 3; ++tk) {
for(int num = 0;num < 10; ++num) {
first[tk][num] = 0;
second[tk][num] = 0;
thired[tk][num] = 0;
force[tk][num] = 0;
}
}
int n;
std::cin >> n;
for(int a = 0; a < n; ++a) {
int b,f,r,v;
std::cin >> b >> f >> r >> v;
switch(b) {
case 1:
first[f-1][r-1] = first[f-1][r-1] +v;
break;
case 2:
second[f-1][r-1] = second[f-1][r-1] +v;
break;
case 3:
thired[f-1][r-1] = thired[f-1][r-1] +v;
break;
case 4:
force[f-1][r-1] = force[f-1][r-1] +v;
break;
}
}
int kai = 0;
for(int c = 0; c < 10; ++c) {
std::cout<< " " << first[kai][c];
if(c == 9) {
if(kai == 2) {
std::cout<< std::endl << "####################" << std::endl;
break;
}else if(kai != 2) {
std::cout<< std::endl;
c = -1;
++kai;
}
}
}
int kai2 = 0;
for(int d = 0; d < 10; ++d) {
std::cout<< " " << second[kai2][d];
if(d == 9) {
if(kai2 == 2) {
std::cout<< std::endl << "####################" << std::endl;
break;
}else if(kai2 != 2) {
std::cout<< std::endl;
d = -1;
++kai2;
}
}
}
int kai3 = 0;
for(int e = 0; e < 10; ++e) {
std::cout<< " " << thired[kai3][e];
if(e == 9) {
if(kai3 == 2) {
std::cout<< std::endl << "####################" << std::endl;
break;
}else if(kai3 != 2) {
std::cout<< std::endl;
e = -1;
++kai3;
}
}
}
int kai4 = 0;
for(int f = 0; f < 10; ++f) {
std::cout<< " " << force[kai4][f];
if(f == 9) {
if(kai4 == 2) {
std::cout<< std::endl;
break;
}else if(kai4 != 2) {
std::cout<< std::endl;
f = -1;
++kai4;
}
}
}
}
| 0
| 26,487,348
|
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
#include <queue>
using namespace std;
typedef long long int lli;
const long long int MaxN=300005;
const lli mod=1e9+7;
#define fst first
#define snd second
#define mp make_pair
const float pi=3.1415926535897932384626433832795028;
lli mcd(lli a,lli b){
if(a==0)return b;
return mcd(b%a,a);
}
pair <lli,lli> par[MaxN];
void solve(){
lli N,M,i,j,p,q,res=0,llevo=0;
cin>>N>>M;
for(i=0;i<N;i++){
cin>>p>>q;
par[i].fst=p,par[i].snd=q;
}
sort(par,par+N);
for(i=0;i<N;i++){
if(par[i].snd+llevo>=M){
res+=(M-llevo)*par[i].fst;
break;
}
else {
llevo+=par[i].snd;
res+=par[i].fst*par[i].snd;
}
}
cout<<res;
}
int main(){
lli i,t;
t=1;
for(i=1;i<=t;i++){
solve();
}
}
|
#pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vs vector <string>
#define vvs vector <vector<string>>
#define pq priority_queue<int>
using ll = long long;
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
const int INF = 2000000000;
const int MINF=-2000000000;
constexpr ll mod = 1e9 + 7;
constexpr long double pi = 3.141592653589793238462643383279;
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
bool isprime(ll a)
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
return true;
}
ll ketasum(ll n) {
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
ll kind(vi SYURUI) {
int size = SYURUI.size();
sort(all(SYURUI));
int cnt = 1;
rep(i, size-1) {
if (SYURUI[i] != SYURUI[i + 1])cnt++;
}
return cnt;
}
#pragma endregion
signed main() {
int N; cin >> N;
vector<double> A(N); rep(i, N)cin >> A[i];
double sum = 0;
rep(i, N) {
sum += (double)1 / A[i];
}
cout << fixed << setprecision(18) << (double)1 / sum << endl;
}
| 0
| 52,208,935
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
const int N = 300030;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const ll mod = 1e9+7;
int a[5];
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int mx=0;
for(int i=0;i<6;i++)
{
int x;
cin>>x;
a[x]++;
if(a[x]>mx)
mx=a[x];
}
if(mx<=2)
cout<<"YES";
else
cout<<"NO";
}
|
#include "bits/stdc++.h"
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(X) X.begin(), X.end()
#define sz(X) (int)X.size()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main()
{ _
int n; cin >> n;
vector a(1 << n, 0);
for (int i = 0; i < (1 << n); ++i) cin >> a[i];
vector S(1 << n, pair(0, 0));
for (int i = 0; i < (1 << n); ++i)
S[i].first = a[i];
auto insert = [](pair<int, int>& S, pair<int, int> T)
{
int x = T.first, y = T.second;
if (x > S.second) S.second = x;
if (S.first < S.second) swap(S.first, S.second);
if (y > S.second) S.second = y;
if (S.first < S.second) swap(S.first, S.second);
};
for (int k = 0; k < n; ++k)
for (int x = 0; x < (1 << n); ++x)
if ((x >> k & 1) == 0) insert(S[x | (1 << k)], S[x]);
int ans = 0;
for (int i = 1; i < (1 << n); ++i)
{
ans = max(ans, S[i].first + S[i].second);
cout << ans << endl;
}
exit(0);
}
| 0
| 10,718,976
|
#include<bits/stdc++.h>
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;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
int n; cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(All(v), greater<int>());
int ans = 0, t = 0;
for(int i = 1; i < n; i++){
int d = min(v[i], abs(v[0]-v[i]));
if(d > t){
t = d;
ans = v[i];
}
}
cout << v[0] << " " << ans << endl;
system("pause");
}
|
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
char c;
cin>>c;
if(c>=65&&c<=91)
{
cout<<'A'<<endl;
}
else
{
cout<<'a'<<endl;
}
}
| 0
| 21,807,793
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
unordered_map<ll,int> mp;
ll now = 0;
ll ans = 0;
mp[0]++;
for(int i = 0; i < n; i++){
now += a[i];
ans += mp[now];
mp[now]++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int> b;
map<int,bool> f;
int m=0;
for(int _=0;_<n;_++){
int a;
cin>>a;
b[a]++;
f[a]=1;
m=max(a,m);
}
for(auto a:b){
if(a.second>1)
f[a.first]=0;
for(int i=2;a.first*i<=m;i++)
if(b.count(a.first*i))
f[a.first*i]=0;
}
int c=0;
for(auto a:f)
c+=(a.second?1:0);
cout<<c<<endl;
}
| 0
| 10,519,849
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
for (int i = 0; i < H; i++) {
cin >> a.at(i);
}
for (int i = 0; i < H; i++) {
int j = 0;
while (j < W && (a.at(i).at(j) == '.' || a.at(i).at(j) == ' ')) {
j++;
}
if (j == W) {
for (int j = 0; j < W; j++) {
a.at(i).at(j) = ' ';
}
}
}
for (int i = 0; i < W; i++) {
int j = 0;
while (j < H && (a.at(j).at(i) == '.' || a.at(j).at(i) == ' ')) {
j++;
}
if (j == H) {
for (int j = 0; j < H; j++) {
a.at(j).at(i) = ' ';
}
}
}
for (int i = 0; i < H; i++) {
int replacedCount = 0;
for (int j = 0; j < W; j++) {
if (a.at(i).at(j) != ' ') {
cout << a.at(i).at(j);
} else {
replacedCount++;
}
}
if (replacedCount < W) {
cout << endl;
}
}
}
|
#include <iostream>
#include <cctype>
using namespace std;
char const ch[4] = {'m', 'c', 'x', 'i'};
int const d[4] = {1000, 100, 10, 1};
int sptoi(char*s)
{
int num = 1, ans = 0;
while(*s) {
for (int i = 0; i < 4; i++)
if (*s == ch[i])
ans += d[i] * num;
if (isdigit(*s))
num = *s - '0';
else
num = 1;
s++;
}
return ans;
}
int main()
{
int N;
cin >> N;
while (N--) {
char sp1[10], sp2[10];
cin >> sp1 >> sp2;
int sum = sptoi(sp1) + sptoi(sp2);
char sp[10];
for (int i = 0; i < 4; i++) {
int x = sum / d[i];
sum %= d[i];
if (x >= 2)
cout << x;
if (x >= 1)
cout << ch[i];
}
cout << endl;
}
}
| 0
| 57,139,420
|
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORTASC(c) sort((c).begin(),(c).end())
#define SORTDESC(c,t) sort((c).begin(),(c).end(), std::greater<t>());
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define VMAX(a) *max_element(ALL(a))
#define VMIN(a) *min_element(ALL(a))
#define OUT(a) cout << (a) << endl;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const double PI = acos(-1.0);
template <class T, class S>
using umap = std::unordered_map<T, S>;
using ll = long long;
using namespace std;
int main() {
ll n;
long double x;
string u;
cin >> n;
long double dama = 0;
REP(i, n){
cin >> x >> u;
if (u == "JPY"){
dama += x;
} else {
dama += x*380000.0;
}
}
cout << setprecision(20) << dama << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
int min = *min_element(A.begin(), A.end());
int max = *max_element(A.begin(), A.end());
int a = 0;
while (min != max)
{
for (int i = 0; i < N; i++)
{
if (A.at(i) == min)
{
continue;
}
a = A.at(i) % min;
A.at(i) = a;
if (a != 0 && a < min)
{
min = a;
}
}
max = *max_element(A.begin(), A.end());
}
cout << min << endl;
return 0;
}
| 0
| 25,728,413
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
for(int i=0;i<=n;i++){
if(s.substr(i,s.size())==t.substr(0,t.size()-i)){
cout << n+i;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int dp[105][4][2];
int main(){
string s;
int k;
cin >> s >> k;
int n = s.size();
dp[0][0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < 4; j++){
for(int m = 0; m < 2; m++){
for(int d = 0; d < 10; d++){
int x = s[i]-'0';
int ni = i+1, nj = j, nm = m;
if(d != 0) nj++;
if(nj > k) continue;
if(nm == 0){
if(x > d) nm = 1;
else if(x < d) break;
}
dp[ni][nj][nm] += dp[i][j][m];
}
}
}
}
cout << dp[n][k][0]+dp[n][k][1] << endl;
return 0;
}
| 0
| 38,877,586
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string A;
cin >> A;
reverse(A.begin(),A.end());
cout << A <<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os << "[ "; for(auto v : V) os << v << " "; return os << "]"; }
template<class T> ostream& operator<<(ostream &os, set<T> S){ os << "{ "; for(auto s:S) os<<s<<" ";return os<<"}"; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L,R> P) { return os << "(" << P.first << "," << P.second << ")";}
template<class L, class R> ostream& operator<<(ostream &os, map<L,R> M) { os << "{ "; for(auto m:M) os<<"("<<m.first<<":"<<m.second<<") "; return os<<"}"; }
#ifdef LMAO
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){cerr << name << " : " << arg1 << endl;}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1<<" | "; __f(comma+1, args...); }
#else
#define trace(...) 42
#endif
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define tcase int tt; cin>>tt; while(tt--)
#define tcase2 int tt; cin>>tt; for(int qq=1;qq<=tt;qq++)
#define all(x) x.begin(), x.end()
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
const int MAX = 1000010;
const int MOD2 = 998244353;
const int MOD = 1000000007;
const int INF = 1e8;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ld EPS = 1e-7;
#define forn(i, n) for(int i = 0; i < (int)n; i++)
#define forne(i, a, b) for(int i = a; i <= b; i++)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);cout<<fixed<<setprecision(25);cerr<<fixed<<setprecision(10);
ll n;
cin>>n;
ll ans=0;
ll lo1=0;
while(n%2==0)
{
n/=2;
lo1++;
}
if(lo1)
ans+=max(0ll,(ll)(-1+sqrt(1+8*lo1))/2);
for(int i=3;i*1ll*i<=n;i+=2)
{
ll lo=0;
while(n%i==0)
{
n/=i;
lo++;
}
if(lo)
{
ans+=max(0ll,(ll)(-1+sqrt(1+8*lo))/2);
}
}
if(n>2)
{
ans++;
}
cout<<ans<<endl;
return 0;
}
| 0
| 23,027,269
|
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
using namespace std;
const int kInf = 1e9+19;
void Solve() {
string s;
cin >> s;
int n = s.length();
unordered_map<int, vector<int>> edges;
vector<int> pref(n + 1);
queue<int> Q;
vector<int> d(n + 1, kInf);
pref[0] = 0;
for (int i = 0; i < s.length(); ++i) {
pref[i+1] = pref[i] ^ (1<< (s[i] - 'a'));
edges[pref[i+1]].push_back(i + 1);
}
Q.push(0);
d[0] = 0;
while(!Q.empty()) {
int x = Q.front();
Q.pop();
for (int j = 0; j < 27; ++j) {
int new_pref;
if (j == 26)
new_pref = pref[x];
else new_pref = pref[x] ^ (1 << j);
auto& e = edges[new_pref];
while (!e.empty() && x < e.back()) {
int y = e.back();
Q.push(y);
d[y] = d[x] + 1;
e.pop_back();
}
}
}
cout << d[n] << "\n";
}
int main() {
int tests = 1;
for (;tests; --tests) {
Solve();
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void){
int N;
cin >> N;
if(N / 100 == 1){
cout << 9;
}
else{
cout << 1;
}
if((N % 100) / 10 == 1){
cout << 9;
}
else{
cout << 1;
}
if(N % 10 == 1){
cout << 9 << endl;
}
else{
cout << 1 << endl;
}
}
| 0
| 65,281,098
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll A, B;
scanf("%lld %lld", &A, &B);
ll val;
ll start_even = (A % 2 == 0) ? A : A + 1;
ll end_odd = (B % 2 == 1) ? B : B - 1;
ll pair_count = (end_odd - start_even + 1) / 2;
ll v = (pair_count % 2 == 1) ? 1 : 0;
if (A % 2 == 1) {
v ^= A;
}
if (B % 2 == 0) {
v ^= B;
}
cout << v << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << (#x) << "] = [", _print(x)
#else
#define debug(x...)
#endif
#pragma endregion
typedef long long ll;
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define sz(v) int((v).size())
#define int ll
#pragma region
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#pragma endregion
int x, y;
int a, b, c;
vector<int> p, q, r;
void solve()
{
cin>>x>>y>>a>>b>>c;
p.resize(a);
q.resize(b);
r.resize(c);
forn(i, a) cin>>p[i];
forn(i, b) cin>>q[i];
forn(i, c) cin>>r[i];
sort(p.rbegin(), p.rend());
sort(q.rbegin(), q.rend());
sort(r.rbegin(), r.rend());
vector<int> f;
f.reserve(a+b+1);
forn(i, x) f.pb(p[i]);
forn(i, y) f.pb(q[i]);
forn(i, a - 1) p[i+1] += p[i];
forn(i, b - 1) q[i+1] += q[i];
forn(i, c - 1) r[i+1] += r[i];
sort(f.begin(), f.end());
forn(i, sz(f) - 1) f[i+1] += f[i];
int ans = p[x-1] + q[y-1];
forn(i, c)
{
if (sz(f) <= i) break;
int dlt = f[i];
int ad = r[i];
ans = max(ans , p[x-1] + q[y-1] - dlt + ad);
}
cout << ans << '\n';
}
signed main()
{
int T = 1;
ios_base::sync_with_stdio(0); cin.tie(0);
for(int i=1;i<=T;++i)
{
solve();
}
return 0;
}
| 0
| 9,813,769
|
#include<iostream>
using namespace std;main(){int a,b,c,d=0;cin>>a>>b>>c;while(a<=b){if(c%(a++)==0)d++;}cout<<d<<endl;}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans[100009];
struct ss
{
ll v;
ll pos;
}a[100009];
const bool com(const ss &a,const ss&b)
{
if(a.v>b.v)return 1;
else if(a.v==b.v)
{
return a.pos<b.pos;
}
return 0;
}
int main()
{
ll n;
scanf("%lld",&n);
for(ll i=1;i<=n;i++)
{
scanf("%lld",&a[i].v);
a[i].pos=i;
}
sort(a+1,a+1+n,com);
a[n+1].v=0;
ll tmp=1;
ll num=a[1].pos;
for(ll i=2;i<=n+1;i++)
{
if(a[i].v==a[i-1].v)tmp++;
else
{
ans[num]+=(a[i-1].v-a[i].v)*tmp;
tmp++;
}
if(a[i].pos<num)
{
num=a[i].pos;
}
}
for(ll i=1;i<=n;i++)
{
printf("%lld\n",ans[i]);
}
}
| 0
| 81,598,115
|
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, X, Y, x, y, cur, dat[2000][2];
vector<string> ans;
vector<char> apd;
bool ck(int u, int v, int d)
{
if (abs(u) + abs(v) <= d) return true;
return false;
}
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
bool flag0 = false;
bool flag1 = false;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> dat[i][0] >> dat[i][1];
if ((abs(dat[i][0]) + abs(dat[i][1]))%2) flag1 = true;
else flag0 = true;
if (flag0 && flag1) {
cout << "-1" << E;
return 0;
}
}
if (flag1) {
for (int i = 0; i < n; i++) {
if (dat[i][0] == 0) {
if (dat[i][1] > 0) {
apd.pb('U');
dat[i][1]--;
}
else {
apd.pb('D');
dat[i][1]++;
}
}
else if (dat[i][0] > 0) {
apd.pb('R');
dat[i][0]--;
}
else {
apd.pb('L');
dat[i][0]++;
}
}
}
string s(32, '0');
int cnt = 0;
while (cnt < n) {
X = dat[cnt][0]; Y = dat[cnt][1];
cnt++;
x = abs(X); y = abs(Y);
cur = 30;
int tmp = (1 << cur);
while (1) {
if (ck(x - tmp, y, tmp)) {
s[cur + 1] = 'R';
x -= tmp;
}
else if (ck(x, y - tmp, tmp)) {
s[cur + 1] = 'U';
y -= tmp;
}
else if (ck(x + tmp, y, tmp)) {
s[cur + 1] = 'L';
x += tmp;
}
else {
s[cur + 1] = 'D';
y += tmp;
}
if (cur == 0) break;
cur--;
tmp = tmp / 2;
}
if (x == 0) {
if (y > 0) s[0] = 'U';
else s[0] = 'D';
}
else {
if (x > 0) s[0] = 'R';
else s[0] = 'L';
}
for (int i = 0; i < 33; i++) {
if (s[i] == 'L' || s[i] == 'R') {
if (X < 0) {
if (s[i] == 'L') s[i] = 'R';
else s[i] = 'L';
}
}
else {
if (Y < 0) {
if (s[i] == 'U') s[i] = 'D';
else s[i] = 'U';
}
}
}
ans.pb(s);
}
int m = 32;
if (flag1) m++;
cout << m << E;
cout << "1 " << E;
for (int i = 0; i < 31; i++) cout << (1 << i) << " ";
if (flag1) cout << 1;
cout << E;
for (int i = 0; i < n; i++) {
cout << ans[i];
if (flag1) cout << apd[i];
cout << E;
}
return 0;
}
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <math.h>
#include <iomanip>
#include <string.h>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define PI 3.14159265358979323846264338327950L
#define INF 0x3f3f3f3f
int sum(int l, int r) {
return (l + r)*(r - l + 1) / 2;
}
int gcd(int a, int b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a%b);
}
}
int32_t main() {
IOS;
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
int r = 0;
int g = 0;
int b = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
r++;
}
else if (S[i] == 'G') {
g++;
}
else {
b++;
}
}
int tot = r * g*b;
int rgb = (int)('R') + (int)('G') + (int)('B');
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
int k = 2 * j - i;
if (k < N) {
if ((int)S[i] + (int)S[j] + (int)S[k] == rgb) {
tot--;
}
}
}
}
cout << tot << endl;
}
| 0
| 66,842,441
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
int N,M;
bool check[SIZE];
int main(){
scanf("%d %d",&N,&M);
for(int i = 0; i < N; i++){
check[i] = false;
}
vector<int> G;
int from,to;
for(int i = 0; i < M; i++){
scanf("%d %d",&from,&to);
from--;
to--;
if(from > to)swap(from,to);
if(from != 0 && to != N-1)continue;
if(from == 0){
G.push_back(to);
}else{
check[from] = true;
}
}
for(int i = 0; i < G.size(); i++){
if(check[G[i]]){
printf("POSSIBLE\n");
return 0;
}
}
printf("IMPOSSIBLE\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
typedef vector<int> vi;
typedef vector<vi> vii;
#define rep(i, k, n) for (int i = k; i < (int)(n); i++)
int main()
{
cin >> n;
vii hs(n, vi(3));
rep(i, 0, n)
{
cin >> hs[i][0] >> hs[i][1] >> hs[i][2];
}
vii dp(n, vi(3));
dp[0][0] = hs[0][0];
dp[0][1] = hs[0][1];
dp[0][2] = hs[0][2];
rep(i, 1, n)
{
rep(j, 0, 3)
{
dp[i][j] = max(dp[i - 1][(j + 1) % 3], dp[i - 1][(j + 2) % 3]) + hs[i][j];
}
}
int ans = 0;
rep(i, 0, 3) ans = max(ans, dp[n - 1][i]);
cout << ans << endl;
}
| 0
| 32,880,120
|
#include <algorithm>
#include <vector>
#include <string>
#include <ctype.h>
#include <set>
#include <map>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<time.h>
#include<string>
#include<stack>
#include<cmath>
#include<iostream>
#include<cstring>
#include<complex>
#include<bitset>
#include <climits>
#include<tr1/unordered_set>
#include<tr1/unordered_map>
#define FOR(i,j,k) for(int i=j;i<k;i++)
#define FORD(i,j,k) for(int i=j;i>=k;i--)
#define ll long long
#define pii pair<int, int>
#define vi vector<int >
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define VAR(i,n) __typeof(n) i = (n)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define FORDEACH(i,c) for( VAR(i,(c).rbegin()),i!=(c).rend();i++)
#define REP(i,n) FOR(i,0,n)
#define ld long double
const int INF = 1e9+7;
const long long INFLL = (ll)INF * (ll)INF;
const ld EPS = 10e-9;
using namespace std;
class TrieNode{
public:
bool isword;
char c;
map<char,TrieNode*> m;
string word;
public:
TrieNode(){}
TrieNode(char ch){
c=ch;
isword=false;
}
};
void insert(TrieNode* root,string word){
TrieNode* temp=root;
for(char c:word){
if(temp->m.find(c)==temp->m.end())
temp->m[c]=new TrieNode(c);
temp=temp->m[c];
}
temp->isword=true;
temp->word=word;
}
#pragma GCC optimize ("Ofast")
static auto _ = [] { std::ios::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0); std::cerr.tie(0); return 0; } ();
int main() {
int n;
cin>>n;
vector<int> v(n),dp(n,INT_MAX);
for(int i=0;i<n;i++)
cin>>v[i];
dp[0]=0;
for(int i=0;i<n;i++){
if(i+1<n)
dp[i+1]=min(dp[i+1],dp[i]+abs(v[i]-v[i+1]));
if(i+2<n)
dp[i+2]=min(dp[i+2],dp[i]+abs(v[i]-v[i+2]));
}
cout<<dp[n-1];
return 0;
}
|
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <iterator>
#include <algorithm>
using namespace std;
#define LL long long
#define ll long long
#define LD long double
#define Mod 1000000007
#define L_Mod 17100000013
const double eps = 1e-9;
const int INF = 0x3f3f3f3f;
const double PI = 3.1415926535;
#define NO_TLE std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ree(a,n) memset(a,n,sizeof(a));
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define red(i,l,u) for(int (i)=(int)(l);(i)>=(int)(u);--(i))
int m[105][105];
int main()
{
int a,b;
cin>>a>>b;
rer(i,51,100)rer(j,1,100)m[i][j]=1;
a--,b--;
for(int i=1; i<=50&&a>0; i+=2)
{
for(int j=1; j<=100; j+=2)
{
m[i][j]=1;
a--;
if(a<=0)
break;
}
if(a<=0)
break;
}
for(int i=52; i<=100&&b>0; i+=2)
{
for(int j=1; j<=100; j+=2)
{
m[i][j]=0;
b--;
if(b<=0)
break;
}
if(b<=0)
break;
}
cout<<100<<' '<<100<<endl;
rer(i,1,100)
{
rer(j,1,100)
{
if(m[i][j]==1)cout<<'.';
else cout<<'#';
}
cout<<endl;
}
return 0;
}
| 0
| 34,322,500
|
# include <bits/stdc++.h>
# define long long long
# define all(vc) vc.begin(),vc.end()
# define allr(vc) vc.rbegin(),vc.rend()
# define pb push_back
# define fi first
# define se second
# define pi pair <long, long>
# define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
const long N = 100100;
void read(){freopen("input.txt" , "r" , stdin );freopen("output.txt", "w" , stdout );}
long dp[N][2];
string s;
void solve(){
long n, m;
cin >> n >> m;
vector <pi> a(n), b(m);
for (int i = 0; i < n; ++i){
cin >> a[i].fi >> a[i].se;
}
for (int i = 0; i < m; ++i){
cin >> b[i].fi >> b[i].se;
}
for (int i = 0; i < n; ++i){
long mn = 1e9;
vector < long > v;
vector < pair < long, long > > vc;
for (int j = 0; j < m; ++j){
long q = abs(a[i].fi - b[j].fi) + abs(a[i].se - b[j].se);
if( q < mn ){
v.clear(), vc.clear();
v.pb(j + 1), vc.pb({ b[i].fi, b[i].se });
mn = q;
}
if( q == mn ){
vc.pb({ b[i].fi, b[i].se });
sort( all(vc) );
if( vc[0].fi == b[i].fi && vc[0].se == b[i].se ){
vc.clear();
vc.pb({ b[i].fi, b[i].se });
}
else{
long f = vc[0].fi, g = vc[0].se;
vc.clear();
vc.pb({ f, g });
}
}
}
cout << v[0] << '\n';
}
}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long T = 1;
while( T-- ){
solve();
cout<<'\n';
}
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" << (a) << endl;
#define pb push_back
#define eb emplace_back
#define mp make_pair
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int N = 8080;
bool tmp[N];
void update(bool a[], int d) {
memset(tmp, 0, sizeof tmp);
forn(i,N) if (a[i]) {
int x = i+d;
int y = abs(i-d);
if (x < N) tmp[x] = 1;
if (y < N) tmp[y] = 1;
}
memcpy(a, tmp, N);
}
bool can[2][N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
can[0][0] = can[1][0] = 1;
string s; cin >> s; s += 'T';
int x,y; cin >> x >> y;
int axis = 0, cnt = 0;
bool first = 1;
for (char c : s) {
if (c == 'T') {
if (first) {
x -= cnt;
first = 0;
}
else if (cnt) update(can[axis], cnt);
axis = 1-axis;
cnt = 0;
}
else cnt++;
}
x = abs(x); y = abs(y);
bool ok = can[0][x] && can[1][y];
cout << (ok ? "Yes" : "No") << endl;
return 0;
}
| 0
| 57,545,278
|
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
template<typename T>
T mypow(T a, T p) {
T ret = 1;
while( p ) {
if( p & 1 ) {
ret *= a;
}
a *= a;
p >>= 1;
}
return ret;
}
int main(void) {
ll n, p;
cin >> n >> p;
vector<int> a(n);
bool odd = false;
for(int i = 0; i < n; ++i) {
cin >> a[i];
if( a[i] % 2 == 1 ) odd = true;
}
if( odd ) {
cout << mypow(2LL, n - 1LL) << endl;
} else {
if( p == 0 ) {
cout << mypow(2LL, n) << endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const int MOD = 1000000007;
template<class T> inline int add(T& a, T b, T M = MOD){a=(a+M)%M;b=(b+M)%M;a=(a+b)%M;return a;};
template<class T> inline int mul(T& a, T b, T M = MOD){if(a>=M)a%=M;if(b>=M)b%=M;a*=b;if(a>=M)a%=M;return a;};
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
ll modpow(ll a, ll n, const ll &MOD = MOD){
ll ret = n == 0 ? 1 : modpow(a, n/2, MOD);
(ret *= ret) %= MOD;
if(n%2)((ret *= a) %= MOD);
return ret;
}
ll modinv(ll d, const ll &MOD = MOD){
return modpow(d, MOD-2, MOD);
}
string s;vector<int> l;
int dp[110000][2];
signed main(){
cin>>s;int n = s.length();
l.resize(n);
rep(i,n)l[i] = (int)(s[i]-'0');
dp[0][0] = 1;dp[0][1] = 2;
repd(i,1,n){
add(dp[i][0], dp[i-1][0]*3);
if(l[i] == 1)add(dp[i][0], dp[i-1][1]);
add(dp[i][1], dp[i-1][1]*(l[i]+1));
}
cout << (dp[n-1][0] + dp[n-1][1]) % MOD << endl;
}
| 0
| 84,629,498
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PP pair<int,pair<int,int>>
const int MAX = 1000001;
const int MOD =1000000007;
const int INV2 = (MOD+1)/2;
signed main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int a[n],b[m];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++)cin>>b[i];
sort(a,a+n);sort(b,b+m);
if(a[n-1]<b[0]&&x<b[0]&&a[n-1]<y)cout<<"No War";
else cout<<"War";
}
|
#include <iostream>
int main()
{
int a, b, c, d;
std::cin >> a >> b >> c;
if (a >= b) {
d = a;
a = b;
b = d;
}
if (b >= c) {
d = b;
b = c;
c = d;
}
if (a >= b) {
d = a;
a = b;
b = d;
}
std::cout << a << " " << b << " " << c << std::endl;
return 0;
}
| 0
| 95,774,319
|
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false); cin.tie(NULL)
#define testcases freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
#define ui unsigned int
#define ll long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sz(x) (int)x.size()
#define pq priority_queue
#define pqmax priority_queue<int, vector<int>, greater<int>>
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define asc(x) sort(all(x))
#define desc(x) sort(all(x), greater<int>())
#define time_el (double)time/CLOCKS_PER_SEC
using namespace std;
const int MAX=2e6;
const ll M=1e9+7, inf=1e18;
const char nl='\n';
ll apbmc(ll a, ll b, ll c){ a%=c; ll res=1; while(b){ if(b&1) res=res*a%c; a=a*a%c; b>>=1; } return res;}
ll apb(ll x, ll y){ ll temp; if(y==0) return 1; temp=apb(x, y/2); if(y%2==0) return temp*temp; else return temp*temp*x;}
void solve(){
int n; cin>>n;
vi v(n), dp(n);
for(int &i: v) cin>>i;
dp[1]=abs(v[1]-v[0]);
for(int i=2; i<n; i++){
dp[i]=min(abs(v[i]-v[i-1])+dp[i-1], abs(v[i]-v[i-2])+dp[i-2]);
}
cout<<dp[n-1];
}
int main(){
fastio;
cout<<fixed<<setprecision(9);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
int n;
ostringstream os;
cin >> n;
set<string> dict;
REP(i, n){
string order, str;
cin >> order >> str;
if(order == "insert")
dict.insert(str);
else if(order == "find"){
if(dict.count(str))
os << "yes" << endl;
else
os << "no" << endl;
}
}
cout << os.str();
return 0;
}
| 0
| 97,246,052
|
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.end()
#define pb(i) push_back(i)
#define PB() pop_back()
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define Fi first
#define Se second
const int maxx=1e6+9;
ll _find(int d,int n){
return n<100 ? pow(100,d)*n : 101*pow(100,d);
}
void solve(){
ll n;
cin>>n;
vll M(n+1);
for(ll i=0;i<=n;i++){
cin>>M[i];
}
vll H(n);
for(ll i=0;i<n;i++){
cin>>H[i];
}
ll ans=0;
for(ll i=0;i<n;i++){
if(H[i]<=M[i]){
ans+=H[i];
M[i]-=H[i];
H[i]=0;
}
else{
ans+=M[i];
H[i]-=M[i];
M[i]=0;
if(H[i]<=M[i+1]){
ans+=H[i];
M[i+1]-=H[i];
H[i]=0;
}
else{
ans+=M[i+1];
H[i]-=M[i+1];
M[i+1]=0;
}
}
}
cout<<ans<<endl;
}
int main() {
faster;
int t=1;
while(t-->0){
solve();
}
return 0;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k;
cin >> a >> b >> k;
int x = __gcd(a,b);
for(int i=x; i>=1; i--){
if(x%i==0){
k--;
if(k==0){
cout << i << endl;
}
}
}
return 0;
}
| 0
| 49,486,129
|
#include <iostream>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<long long int,long long int>,null_type,less<pair<long long int,long long int> >,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
void go()
{
ll int n,m,mod=(ll int)1e9+7;
cin>>n>>m;
vector<vector<char> > a(n,vector<char>(m));
vector<vector<ll int> > dp(n,vector<ll int>(m,0)),temp(n,vector<ll int>(m,0));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>a[i][j];
if(a[i][j] == '.')
temp[i][j]=1;
}
}
dp[0][0]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(i > 0 && j > 0)
{
if(a[i][j]=='.')
dp[i][j]=dp[i-1][j]+dp[i][j-1],dp[i][j]%=mod;
else
dp[i][j]=0;
}
if(i == 0 && j > 0)
{
if(a[i][j]=='.')
dp[i][j]=dp[i][j-1],dp[i][j]%=mod;
else
dp[i][j]=0;
}
if(i > 0 && j == 0)
{
if(a[i][j]=='.')
dp[i][j]=dp[i-1][j],dp[i][j]%=mod;
else
dp[i][j]=0;
}
}
}
cout<<dp[n-1][m-1];
}
int main()
{
FIO;
go();
return 0;
}
|
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const char* col = "RYGB";
int main()
{
int h, w, d;
cin >> h >> w >> d;
vector<string> bd(h, string(w, '.'));
if (d % 2 == 1) {
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
bd[y][x] = col[(x + y) % 4];
}
}
} else {
int bw = d;
int bh = d - 1;
for (int y = 0; y < h + 2 * bw; y++) {
for (int x = 0; x < w + 2 * bw; x++) {
int dx = x % bw;
int dy = y % bw;
int ph = (x / bw % 2) ^ (y / bw % 2);
if (dy == bw - 1)
continue;
int tx = dx >= bw / 2 ? bw - 1 - dx : dx;
int ty = dy > bh / 2 ? bh - 1 - dy : dy;
if (!(tx + ty < bh / 2)) {
int cx = x - bw;
int cy = y - bw;
if (cx >= 0 && cx < w && cy >= 0 && cy < h)
bd[cy][cx] = col[ph + 0];
}
}
}
for (int y = 0; y < h + 2 * bw; y++) {
for (int x = 0; x < w + 2 * bw; x++) {
int dx = x % bw;
int dy = y % bw;
int ph = (x / bw % 2) ^ (y / bw % 2);
if (dy == bw - 1)
continue;
int tx = dx >= bw / 2 ? bw - 1 - dx : dx;
int ty = dy > bh / 2 ? bh - 1 - dy : dy;
if (!(tx + ty < bh / 2)) {
int cx = x + bw / 2 - bw;
int cy = y + bw / 2 - bw;
if (cx >= 0 && cx < w && cy >= 0 && cy < h)
bd[cy][cx] = col[ph + 2];
}
}
}
}
for (auto& row : bd) {
cout << row << endl;
}
return 0;
}
| 0
| 69,339,344
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a == b)
{
if( b == c)
{
cout << "Yes";
}
else
cout << "No";
}
else
cout << "No";
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,0,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int INF=1e18;
int N,P;
int powMOD(int x,int r,int MOD){
if(r==0)return 1;
if(r%2==0)return powMOD(x,r/2,MOD)*powMOD(x,r/2,MOD)%MOD;
else return powMOD(x,r-1,MOD)*x%MOD;
}
signed main(){
string S;cin>>N>>P>>S;
int ans=0;
reverse(S.begin(),S.end());
if(P!=2&&P!=5){
int R[N];
REP(i,N){
int d=(int)S[i]-'0';
if(i==0)R[0]=d%P;
else R[i]=(R[i-1]+d*powMOD(10,i,P))%P;
}
map<int,int>memo;
REP(i,N)memo[R[i]]++;
memo[0]++;
for(auto v:memo){
ans+=v.second*(v.second-1)/2;
}
}
else{
REP(i,N){
int d=S[i]-'0';
if(d%P==0)ans+=N-i;
}
}
cout<<ans<<endl;
}
| 0
| 5,112,337
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s, t; cin >> s >> t;
int ans = 0;
for (int i = 0; i < s.size(); i++) if (s[i] != t[i]) ans++;
cout << ans << '\n';
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(v) v.begin(), v.end()
typedef long long ll;
const ll inf = 1e11;
int main(){
ll n,m; cin >> n >> m;
vector<ll> a(m);
rep(i,m) cin >> a[i];
sort(a.rbegin(), a.rend());
ll cnt[9] = {2,5,5,4,5,6,3,7,6};
vector<ll> dp(n+1,-inf);
dp[0] = 0;
rep(i,n+1){
rep(j,m){
if(i >= cnt[a[j]-1]){
dp[i] = max(dp[i - cnt[a[j]-1]] + 1,dp[i]);
}
}
}
ll now = n;
rep(i,m){
while(dp[now - cnt[a[i]-1]] == dp[now] - 1){
cout << a[i];
now -= cnt[a[i]-1];
}
}
cout << endl;
}
| 0
| 63,333,699
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
string s,t;cin>>s>>t;
int cnt=s.size();
while(cnt--){
if(s==t){
return cout<<"Yes",0;
}
rotate(&s[0],&s[1],&s[int(s.size())]);
}
cout<<"No";
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using pi=pair<int,int>;
using vi=vc<int>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
string s;cin>>s;
int n=s.size()+1;
vi a(n);
rep(i,n-1)
if(s[i]=='<')
chmax(a[i+1],a[i]+1);
per(i,n-1)
if(s[i]=='>')
chmax(a[i],a[i+1]+1);
cout<<accumulate(all(a),int(0))<<endl;
}
| 0
| 100,596,588
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a) ;i<(b) ;i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0 ;i<(n) ;i++)
#define RREP(i,n) for (int i=(n)-1;i>=0 ;i--)
#define EACH(i,a,b) for (int i=(a) ;i<=(b);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const double EPS = 1e-10;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int X[N];
REP(i,N) cin >> X[i];
auto mm = minmax_element(X, X+N);
int ans = INF;
EACH(p, *mm.first, *mm.second) {
int sum = 0;
for(int xi : X) {
sum += (xi - p) * (xi - p);
}
ans = min(ans, sum);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using p = pair<int,int>;
static const long long INF = 1000000007;
int main(){
long long min = INF;
int ans = 0;
int n;
cin >> n;
vector<int> vec(n);
rep(i,n) cin >> vec[i];
rep(i,n){
if (min >= vec[i]){
ans ++;
min = vec[i];
}
}
cout << ans << endl;
}
| 0
| 93,280,641
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, x;
cin >> a >> b >> x;
if(a + b < x || x < a)cout << "NO" << endl;
else cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<int> A_m,A_p;
rep(i,N){
int A;
cin >> A;
if(A>=0) A_p.push_back(A);
else A_m.push_back(A);
}
sort(A_m.begin(),A_m.end());
sort(A_p.rbegin(),A_p.rend());
if(A_m.size()==0){
A_m.push_back(A_p.back());
A_p.pop_back();
}
if(A_p.size()==0){
A_p.push_back(A_m.back());
A_m.pop_back();
}
vector<pair<ll,ll>> op;
ll ans = A_m[0];
rep(i,A_p.size()-1){
op.push_back(make_pair(ans,A_p[i]));
ans -= A_p[i];
}
op.push_back(make_pair(A_p.back(),ans));
ans = A_p.back() - ans;
for(int i=1;i<A_m.size();i++){
op.push_back(make_pair(ans,A_m[i]));
ans -= A_m[i];
}
cout << ans << endl;
rep(i,N-1) cout << op[i].first << " " << op[i].second << endl;
return 0;
}
| 0
| 47,291,694
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n, i, j;
string s;
bool checker = true;
cin >> n >> s;
if(n % 2) {
cout << "No" << '\n';
return 0;
}
for(i = 0, j = n / 2; i < n / 2; i++, j++) {
if(s[i] != s[j]) {
checker = false;
break;
}
}
checker ? cout << "Yes" << '\n' : cout << "No" << '\n';
return 0;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1e5+5;
int n,rk,L,T;
int pos[maxn];
int read() {
int x=0,f=1;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
return x*f;
}
int main() {
n=read(),L=read(),T=read();
for(int i=1;i<=n;i++) {
int x=read(),w=read();
if(w==2)pos[i]=x-T;
else pos[i]=x+T;
rk+=pos[i]/L;
if(pos[i]%L<0)rk--;
pos[i]=(pos[i]%L+L)%L;
}
sort(pos+1,pos+n+1);
rk=(rk%n+n)%n;
for(int i=rk+1;i<=n;i++)
printf("%d\n",pos[i]);
for(int i=1;i<=rk;i++)
printf("%d\n",pos[i]);
return 0;
}
| 0
| 30,255,271
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int>H(N);
rep(i, 0, N){
cin >> H[i];
}
ll ans = 0;
ll preN = 0;
rep(i, 0, N){
if(preN >= H[i]){
preN = H[i];
} else {
ans += H[i]-preN;
preN = H[i];
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n, s) for (int i = 0; i < n; i += s)
#define graph map<int, vector<int>>
#define field vector<vector<int>>
using namespace std;
typedef long long ll;
int dfs(vector<bool> &seen, graph &G, int &v, int &cnt, vector<ll> &point, vector<ll> &ans)
{
seen[v] = true;
cnt += point[v];
ans[v] = cnt;
for (auto next_v : G[v])
{
if (seen[next_v])
continue;
dfs(seen, G, next_v, cnt, point, ans);
}
cnt -= point[v];
return 0;
}
int main()
{
int n, q;
cin >> n >> q;
graph g;
rep(i, n-1, 1)
{
int a, b;
cin >> a >> b;
g[a - 1].push_back(b - 1);
g[b - 1].push_back(a - 1);
}
vector<ll> score(n, 0);
rep(i, q, 1)
{
int p, x;
cin >> p >> x;
score[p - 1] += x;
}
vector<ll> ans(n, 0);
vector<bool> seen(n, false);
int vi = 0;
int ct = 0;
dfs(seen,g,vi,ct,score,ans);
rep(i, n, 1)
{
cout << ans[i] << " ";
}
cout << endl;
}
| 0
| 5,816,958
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
ll gcd(ll a, ll b){ if(b==0){ return a; } return gcd(b , a%b); }
int main() {
int k,n;
cin>>k>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int dist = a[n-1]-a[0];
for(int i =1 ;i<n-1;i++){
int x = abs(a[i+1]-k) + a[i];
int y = k - a[i] + a[i-1];
dist = min(dist,min(x,y));
}
cout<<dist<<"\n";
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
const int M=1005;
char ti[M][M];
int isu[M][M];
int n,m,nn;
int dx[]={0,0,-1,1};
int dy[]={-1,1,0,0};
queue<int> qu;
void init_bfs()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(ti[i][j]=='S')
{
qu.push(i*M+j);
isu[i][j]=0;
return;
}
}
int bfs()
{
int ans=0;
int edx,edy;
for(int ii=1;ii<=nn;ii++)
{
while(!qu.empty())
qu.pop();
memset(isu,-1,sizeof(isu));
if(ii==1)
init_bfs();
else
{
qu.push(edx*M+edy);
isu[edx][edy]=0;
}
int f=0;
while(!qu.empty())
{
int t=qu.front();
qu.pop();
int tx=t/M,ty=t%M;
for(int i=0;i<4;i++)
{
int x=tx+dx[i],y=ty+dy[i];
if(x<1||x>n||y<1||y>m||ti[x][y]=='X'||isu[x][y]!=-1)
continue;
if(ti[x][y]=='0'+ii)
{
ans+=isu[tx][ty]+1;
edx=x;edy=y;
f=1;
break;
}
qu.push(x*M+y);
isu[x][y]=isu[tx][ty]+1;
}
if(f==1)
break;
}
if(!f)
return -1;
}
return ans;
}
int main()
{
scanf("%d%d%d",&n,&m,&nn);
for(int i=1;i<=n;i++)
scanf("%s",ti[i]+1);
printf("%d\n",bfs());
return 0;
}
| 0
| 86,429,969
|
#include<bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
vector<string> split(string,string);
int main()
{
char s,r;
cin >> s >> r;
if(s == r)
{
cout << "=";
}
else if(s < r)
{
cout << "<";
}else
{
cout << ">";
}
}
|
#include <iostream>
using namespace std;
bool ok(int n) {
int a = n % 10;
n /= 10;
int b = n % 10;
n /= 10;
int c = n % 10;
return (a == b && b == c);
}
int main(void) {
int N;cin>>N;
for (int i = N; i <= 999; i++) {
if (ok(i)) {
cout << i << endl;
break;
}
}
return 0;
}
| 0
| 29,243,852
|
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(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;}
ll ext_gcd(ll a, ll b, ll &x, ll &y){
if(b==0){
x = 1;
y = 0;
return a;
}
ll d = ext_gcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
ll mod_inv(ll a, ll m){
ll x,y;
ext_gcd(a,m,x,y);
return (m + x%m)%m;
}
int main(){
int x,y;
cin >> x >> y;
const ll mod = 1000000007;
if((x+y)%3!=0){
cout << 0 << endl;
return 0;
}
int x1=(2*y-x)/3;
int x2=y-2*x1;
if(x1<0 || x2<0 || x1+2*x2!=x || 2*x1+x2!=y){
cout << 0 << endl;
return 0;
}
ll ans=1;
for(int i=1; i<=x1+x2; i++){
ans = (ans*i)%mod;
if(i<=x1){
ans = (ans*mod_inv(i,mod))%mod;
}else{
int factor = i-x1;
ans = (ans*mod_inv(factor,mod))%mod;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#include <cassert>
#include <complex>
#include <cstdio>
#include <list>
#include <bitset>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> PLL;
typedef pair<int, int> PI;
typedef pair<LD, LL> pdl;
typedef pair<LD, LD> pdd;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef unsigned long long ULL;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
LL N;
cin >> N;
if (N % 2 == 1) {
cout << 0 << "\n";
}
else {
LL n = N / 2;
LL ans = 0;
while (n > 0) {
ans += n / 5;
n /= 5;
}
cout << ans << "\n";
}
return 0;
}
| 0
| 58,651,504
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll inf=1e9+7;
const ll mod=1e9+7;
int main(){
ll n;
cin>>n;
vector<ll>a(n);
map<ll,ll>m;
rep(i,n){
cin>>a[i];
m[a[i]]=i;
}
ll cnt=0;
sort(all(a));
rep(i,n){
if(i%2!=m[a[i]]%2)cnt++;
}
cout<<cnt/2<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ms(x,y) memset(x, y, sizeof(x))
#define lowbit(x) ((x)&(-x))
#define sqr(x) ((x)*(x))
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void run_case() {
int n, m;
cin >> n >> m;
priority_queue<int> q;
for(int i = 0; i < n; ++i) {
int x; cin >> x;
q.push(x);
}
for(int i = 0; i < m; ++i) {
int x = q.top();
q.pop();
q.push(x / 2);
}
LL ans = 0;
while(!q.empty()) {
ans += q.top();
q.pop();
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cout.flags(ios::fixed);cout.precision(9);
run_case();
cout.flush();
return 0;
}
| 0
| 4,558,698
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define erep(i, n) for (int i = 0; i <= (n); i++)
#define erep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
int main() {
int x, n;
cin >> x >> n;
vector<int> p(n);
rep(i, n) {
cin >> p[i];
}
int ans = 0;
rep(i, 100) {
int flag = 0;
int tmp = 0;
tmp = x - i;
rep(i, n) {
if (tmp == p[i]) flag = 1;
}
if (flag == 0) {
ans = tmp;
break;
}
flag = 0;
tmp = x + i;
rep(i, n){
if (tmp == p[i]) flag = 1;
}
if (flag == 0) {
ans = tmp;
break;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
const int inf = 1001001001;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
template<class T> struct edge { int to; T cost;};
int N,M;
vector<vector<int>> cost;
vector<vector<bool>> used;
vector<vector<edge<int>>> G;
void dijkstra(int s, int t, vector<int> &dist){
dist[s] = 0;
priority_queue<Pi> que;
que.push({0, s});
while (!que.empty()){
auto p = que.top(); que.pop();
int d = p.first;
int v = p.second;
for (auto e : G[v]){
int nv = e.to;
int c = e.cost;
if (d+c >= dist[nv]) continue;
dist[nv] = d + c;
que.push({dist[nv], nv});
}
}
queue<int> que2;
que2.push(t);
while (!que2.empty()){
int v = que2.front(); que2.pop();
for (auto e : G[v]){
int nv = e.to;
int c = e.cost;
if (dist[nv]+c == dist[v]){
used[v][nv] = true;
used[nv][v] = true;
que2.push(nv);
}
}
}
}
int main() {
cin >>N >>M;
G.assign(N, vector<edge<int>>());
cost.assign(N, vector<int>(N, -1));
used.assign(N, vector<bool>(N, false));
rep(i, M){
int a,b,c; cin >>a >>b >>c;
a--; b--;
G[a].push_back({b,c});
G[b].push_back({a,c});
cost[a][b] = c;
cost[b][a] = c;
}
for (int s=0; s<N; s++){
for (int t=s+1; t<N; t++){
vector<int> dist(N, 1000000000);
dijkstra(s, t, dist);
}
}
int res = 0;
for (int i=0; i<N; i++){
for (int j=i+1; j<N; j++){
if (cost[i][j]>=0 && !used[i][j]) res++;
}
}
cout <<res <<endl;
}
| 0
| 12,815,133
|
#include<iostream>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
bool dp1[17000][4001];
bool ch1[17000][4001];
bool dp2[17000][4001];
bool ch2[17000][4001];
vector<int> vt;
int n, m;
bool func1(int ch, int x)
{
if (x*2 >= vt.size())
{
if (ch == n) {
return 1;
}
else
return 0;
}
bool &ret = dp1[ch][x];
if (ch1[ch][x])return ret;
ch1[ch][x] = 1;
ret = max(ret, func1(ch + vt[x*2], x + 1));
if(x)
ret = max(ret, func1(ch - vt[x*2], x + 1));
return ret;
}
bool func2(int ch, int x)
{
if (x*2+1 >= vt.size())
{
if (ch == m)
return 1;
else
return 0;
}
bool &ret = dp2[ch][x];
if (ch2[ch][x])return ret;
ch2[ch][x] = 1;
ret = max(ret, func2(ch + vt[x*2+1], x + 1));
ret = max(ret, func2(ch - vt[x*2+1], x + 1));
return ret;
}
int main()
{
string a;
cin >> a;
int t = a.size();
int cnt = 0;
for (int i = 0; i < t; i++)
{
if (a[i] == 'F')
cnt++;
else
{
vt.push_back(cnt);
cnt = 0;
}
}
vt.push_back(cnt);
scanf("%d %d", &n, &m);
n += 8000; m += 8000;
if (func1(8000, 0) && func2(8000, 0))
puts("Yes");
else
puts("No");
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string ans = "";
for(char c:s){
if(c == '1') ans.push_back('1');
if(c == '0') ans.push_back('0');
if(c == 'B'){
if(ans != "") ans.pop_back();
}
}
cout << ans << endl;
}
| 0
| 86,612,715
|
#include <bits/stdc++.h>
using namespace std;
#define print cout <<
int main(){
string N;
cin >> N;
int sum = 0;
for(auto s : N){
int num = (int)(s - '0');
sum += num;
}
if(sum%9==0){
print "Yes" << endl;
}else{
print "No" << endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define all(v) (v).begin(), (v).end()
#define io ios::sync_with_stdio(0)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rson rt << 1 | 1, mid + 1, r
#define lson rt << 1, l, mid
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eps 1e-12
const int mod = 1e9 + 7;
inline int ksm(int a, int b)
{
int ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
char a[500][500];
int dp[500][500];
int n,m;
void upd(int &x,int y){
if(x>y)x=y;
}
signed main(){
cin>>n>>m;
rep(i,1,n)rep(j,1,m)cin>>a[i][j];
memset(dp,0x3f,sizeof dp);
dp[0][1]=0;
rep(i,1,n){
rep(j,1,m){
if(a[i][j]=='#'){
upd(dp[i][j],dp[i-1][j] + 1 - (a[i-1][j] == '#'));
upd(dp[i][j],dp[i][j-1] + 1 - (a[i][j-1] == '#'));
}
else {
upd(dp[i][j],dp[i-1][j]);
upd(dp[i][j],dp[i][j-1]);
}
}
}
cout<<dp[n][m]<<endl;
getchar();getchar();
}
| 0
| 78,453,069
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
using Graph = vector<vector<int>>;
int main() {
int a, b;
cin >> a >> b;
int num_min = min(a, b);
int num_max = max(a, b);
rep (i, num_max) cout << num_min;
cout << endl;
return 0;
}
|
#include<cstdio>
#include<cstring>
using namespace std;
#define M 1000000
#define L 12
char H[M][L];
int getChar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
else return 0;
}
int getKey(char str[]){
int sum = 0, p=1, i;
for(i=0;i<strlen(str);i++){
sum += p*( getChar(str[i]) );
p *= 5;
}
return sum;
}
int h1(int key){ return key % M; }
int h2(int key){ return 1 + (key % (M-1)); }
int hashfunc(int key,int i){ return ( h1(key) + i*h2(key) ) % M; }
int find(char str[]){
int key,i,h;
key = getKey(str);
for( i=0 ; ; i++ ){
h = hashfunc(key,i);
if(strcmp(H[h],str) == 0) return 1;
else if( strlen(H[h]) == 0 ) return 0;
}
return 0;
}
void insert(char str[]){
int key,i,h;
key = getKey(str);
for( i=0 ; ; i++ ){
h = hashfunc(key,i);
if(strcmp(H[h],str) == 0) return;
else if(strlen(H[h]) == 0){
strcpy(H[h],str);
return;
}
}
return;
}
int main(){
int i,n,h;
scanf("%d",&n);
for(i = 0;i<n;i++){
char command[6];
char str[12];
scanf("%s%s",command,str);
if(command[0] == 'i'){
insert(str);
}else{
if(find(str)){
printf("yes\n");
}else{
printf("no\n");
}
}
}
return 0;
}
| 0
| 8,339,219
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s.size() < 4) cout << "No" << endl;
else if(s.substr(0, 4) == "YAKI") cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
#define rep(i,s,n) for(ll i = (ll)(s); i < (ll)(n); i++)
#define all(a) (a).begin(),a.end()
#define mod 1000000007
using namespace std;
using graph =vector<vector<ll>>;
const ll MAX = 510000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll com(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll per(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[n-k] % MOD) % MOD;
}
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;
}
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;
}
double dist(pair<double,double> a,pair<double,double> b){
return sqrt(pow((a.first - b.first) ,2) + pow((a.second - b.second),2));
}
double ism(double aa,ll p){
double ap=aa;
double ans=1;
while(p>0){
if(p&1){
ans*=ap;
}
p/=2;
ap=ap*ap;
}
return ans;
}
ll ismm(ll aa,ll p,ll m){
ll ap=aa;
ll ans=1;
while(p>0){
if(p&1){
ans=(ans*ap)%m;
}
p/=2;
ap=(ap*ap)%m;
}
return ans;
}
struct all_init
{
all_init()
{
cout << fixed << setprecision(12);
}
} All_init;
int main()
{
ll h,w,a,b;
cin>>h>>w>>a>>b;
vector<vector<ll>>c(h,vector<ll>(w,1));
rep(i,0,h){
rep(j,0,w){
c[i][j]=((i<b)^(j<a)?1:0);
}
}
rep(i,0,h){
rep(j,0,w){
cout<<c[i][j];
}
cout<<endl;
}
}
| 0
| 68,671,233
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
using namespace std;
typedef long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)
int main() {
int N, M, K;
cin >> N >> M >> K;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= M; j++) {
if (j * (N - i) + i * (M - j) == K) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, double> M;
bool compare_by_b(pair<int, double> a, pair<int, double> b) {
if(a.second != b.second){
return a.second < b.second;
}else{
return a.first < b.first;
}
}
int main(){
int h,n;
cin >> h >> n;
int a[n],b[n];
int dekai = -1;
vector<M> hoge;
for(int i = 0; i < n; i++){
int temp1,temp2;
cin >> temp1 >> temp2;
a[i] = temp1;
b[i] = temp2;
dekai = max(dekai,temp1);
}
int dp[h+dekai];
for(int i = 0; i < h+dekai ; i++){
dp[i] = MOD;
}
dp[0] = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < h+dekai;j++){
if(j+a[i] < h+ dekai){
dp[j+a[i]] = min(dp[j+a[i]],dp[j]+b[i]);
}
}
}
int ans = MOD;
for(int i = h; i < h+dekai;i++){
ans = min(ans,dp[i]);
}
cout << ans << endl;
}
| 0
| 59,896,217
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, H, W;
cin >> N >> H >> W;
int ans = 0;
for (int i = 0; i < N; ++i) {
int x, y;
cin >> x >> y;
if ((x >= H) && (y >= W)) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
ll MAX(ll a,ll b,ll c){return max(a,max(b,c));}
ll MIN(ll a,ll b,ll c){return min(a,min(b,c));}
const ll mod = 1e9+7;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
template<class T> inline bool chmax(T &a,T& b){if(a < b){a = b; return true;} else return false;}
template<class T> inline bool chmin(T &a,T& b){if(a > b){a = b; return true;} else return false;}
int main(){
int n;
cin >> n;
ld sum=0;
rep(i,n){
ld x;
cin >> x;
sum += 1/x;
}
cout << fixed << setprecision(8) << 1/sum << endl;
}
| 0
| 12,953,033
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
ll N;
cin >> N;
ll current = 101;
ll count = 0;
auto a = InputVec(N);
for (int i = 1; i < N; ++i) {
if(a[i-1] == a[i]){
a[i] = current;
current++;
count++;
}
}
cout << count << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=998244353;
ll modpow(ll a, ll b, ll m) {
if(b == 0) return 1 % m;
ll u = modpow(a,b/2,m);
u = (u*u)%m;
if(b%2 == 1) {
u = (u*a)%m;
}
return u;
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin >> n;
vll occ(n,0);
ll a;
cin >> a;
if(a != 0) {
cout << 0 << endl;
return 0;
}
occ[0]++;
for(int i = 0; i < n - 1; i++) {
cin >> a;
occ[a]++;
}
if(occ[0] != 1) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
for(ll i = 1; i < n - 1; i++) {
if(occ[i - 1] == 0 && occ[i] != 0) {
ans = 0;
}
ans *= modpow(occ[i-1],occ[i],mod);
ans %= mod;
}
cout << ans % mod << endl;
return 0;
}
| 0
| 88,740,483
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=2e9;
const ll INF=1e18;
using P=pair<int,int>;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int main() {
cin.tie(0),cout.tie(0);
ios::sync_with_stdio(false);
int n,cnta=0,cntb=0,cntab=0,cnt=0;
string s;
cin >> n;
for(int i=0; i<n; i++) {
cin >> s;
if(s[0]=='B'&&s[s.size()-1]=='A') {
cntab++;
}
else if(s[0]=='B') {
cntb++;
}
else if(s[s.size()-1]=='A') {
cnta++;
}
for(int j=0; j<s.size()-1; j++) {
if(s[j]=='A'&&s[j+1]=='B') {
cnt++;
}
}
}
if(cntab==0) {
cout << cnt+min(cnta,cntb) << endl;
}
else if(cnta+cntb) {
cout << cnt+cntab+min(cnta,cntb) << endl;
}
else {
cout << cnt+cntab-1 << endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define VDEL(v, n) v.erase(v.begin() + (n))
#define ALL(v) v.begin(), v.end()
#define INTMAX 2147483647
#define INF 200000000
#define TINT(str) atoi(str.c_str())
#define TSTR(num) to_string(num)
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<vector<int>> VII;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
PII goal[10];
char k[1000][1000];
int fx, fy;
int H,W;
int BFS(int x, int y)
{
VII cost;
cost = VII(H, VI(W, INT_MAX));
cost[fx][fy] = 0;
queue<PII> q;
q.push(make_pair(fx, fy));
while(!q.empty())
{
PII now = q.front();
q.pop();
int nx = now.first;
int ny = now.second;
if(nx == x && ny == y)
{
return cost[nx][ny];
}
REP(i, 4)
{
if(nx + dx[i] >= H ||
nx + dx[i] < 0) continue;
if(ny + dy[i] >= W ||
ny + dy[i] < 0) continue;
if(k[nx + dx[i]][ny + dy[i]] != 'X')
{
if(cost[nx + dx[i]][ny + dy[i]] >
cost[nx][ny] + 1)
{
cost[nx + dx[i]][ny + dy[i]] =
cost[nx][ny] + 1;
q.push(make_pair(nx + dx[i], ny + dy[i]));
}
}
}
}
return -1;
}
signed main()
{
int N;
cin >> H >> W >> N;
char str[1001];
REP(h, H)
{
scanf("%s", str);
REP(w, W)
{
k[h][w] = str[w];
if(k[h][w] == 'S')
{
fx = h;
fy = w;
}
if(k[h][w] != '.' &&
k[h][w] != 'X')
{
goal[k[h][w] - '1'] = make_pair(h, w);
}
}
}
int ans = 0;
REP(i, N)
{
ans += BFS(goal[i].first, goal[i].second);
fx = goal[i].first;
fy = goal[i].second;
}
cout << ans << endl;
return 0;
}
| 0
| 46,624,693
|
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cctype>
#include<random>
#include<bitset>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int j=i;j<n;j++)
#define in(a) cin>>a
#define out(a) cout<<a<<endl
typedef long long ll;
struct SegmentTree{
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v){
int z = v.size();
n = 1;
while(n < z) n *= 2;
node.resize(2 * n - 1, 0);
for(int i=0; i < z; i++) node[(n - 1) + i] = v[i];
for(int i=n-2;i >= 0; i--){
node[i] = compare(node[i * 2 + 1], node[i * 2 + 2]);
}
}
int compare(int a, int b){
return (a | b);
}
void update(int i, int val){
i += n - 1;
node[i] = val;
while(i > 0){
i = (i - 1) / 2;
node[i] = compare(node[2 * i + 1], node[2 * i + 2]);
}
}
int find(int a, int b, int now = 0, int l = 0, int r = -1){
if(r < 0) r = n;
if(r <= a || b < l) return 0;
if(a <= l && r <= b + 1) return node[now];
int vl = find(a, b, 2 * now + 1, l, (l + r) / 2);
int vr = find(a, b, 2 * now + 2, (l + r) / 2, r);
return compare(vl, vr);
}
int number(int m){
int tmp = 0;
while(m>0){
if(m%2==1) tmp++;
m/=2;
}
return tmp;
}
};
ll kaijo(ll n){
if(n == 0) return 1;
return n * kaijo(n-1);
}
ll POW(ll x, ll n){
ll ans = 1;
while(n > 0){
if(n & 1 == 1){
ans *= x;
}
x *= x;
n >>= 1;
}
return ans;
}
ll combination(ll a, ll b){
ll tmp;
tmp = kaijo(a) / (kaijo(b) * kaijo(a-b));
return tmp;
}
vector<bool> is_prime;
void Eratosthenes(ll n){
is_prime.resize(n+1,true);
is_prime[0]=false;
is_prime[1]=false;
for(ll i = 2; i <= n; i++){
if(is_prime[i]){
for(ll j = i*i; j <= n; j++){
is_prime[j] = false;
}
}
}
}
vector<ll> Prime;
void Prime_Enumeration(ll n){
Eratosthenes(n);
for(int i=2;i<=n;i++){
if(is_prime[i]){
Prime.push_back(i);
}
}
}
ll gcd(ll a, ll b){
if(a<b){
swap(a,b);
}
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return r;
}
ll lcm(ll a, ll b){
ll g = gcd(a,b);
ll l = (a * b) / g;
return l;
}
ll mod(ll a, ll m){
return (a % m + m) % m;
}
ll extGCD(ll a, ll b, ll &p, ll &q){
if(b == 0){ p = 1; q = 0; return a;}
ll d = extGCD(b, a % b, q, p);
q -= a /b * p;
return d;
}
pair<ll, ll> ChineseRem(ll b1, ll m1, ll b2, ll m2){
ll p, q;
ll d = extGCD(m1, m2, p, q);
if((b2-b1) % d != 0) return make_pair(0, -1);
ll m = m1 * (m2 / d);
ll tmp = (b2 - b1) / d * p % (m2 / d);
ll r =mod(b1 + m1 * tmp, m);
return make_pair(r, m);
}
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;
}
const ll MOD = 1000000007;
int binary_search(ll *a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1;
return right;
}
bool isalpha(char s){
if(('A'<=s&&s<='Z')||('a'<=s&&s<='z')){
return 1;
}else{
return 0;
}
}
bool Isalpha(string s){
ll n;
bool tmp = true;
rep(i,n){
if(isalpha(s[i])){
tmp = false;
}
}
return tmp;
}
string YES(bool a){
return a ? "YES" : "NO";
}
string Yes(bool a){
return a ? "Yes" : "No";
}
void f(ll n, vector<ll> v){
for(int i=1;i<=n;i++){
v[i]=0;
for(int h=n;h>=1;h--){
v[i] += h - i + 1;
}
}
}
using Graph = vector<vector<ll>>;
void f(int n,string v,vector<string> s){
s.push_back(v);
string tmp = v;
for(int i = n-1;i>0;i--){
if(v[i-1]>=v[i]){
tmp[i]++;
f(n,tmp,s);
}
}
}
int main(){
ll n,l;
cin>>n>>l;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
}
ll c=0,z=0;
rep(i,n-1){
ll p=c;
c=max(c,a[i]+a[i+1]);
if(p!=c) z=i;
}
if(c<l) cout<<"Impossible"<<endl;
else{
cout<<"Possible"<<endl;
rep(i,n-1){
if(i==z) break;
cout<<i+1<<endl;
}
for(int i=n-2;i>=0;i--){
if(i==z) break;
cout<<i+1<<endl;
}
cout<<z+1<<endl;
}
return 0;
}
|
#include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main(){
int input;
stack<int> cars;
while(cin >> input){
if(input > 0){
cars.push(input);
}else{
cout << cars.top() << endl;
cars.pop();
}
}
}
| 0
| 4,219,338
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s; i<n; ++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
string s = "RGBY";
int main(){
int h, w, d;
cin >> h >> w >> d;
rep(i, h){
rep(j, w) cout << s[2 * (((i+j) / d) % 2) + ((i-j + d*1000)/ d) % 2];
cout << endl;
}
return 0;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
int MOD = 1000000007;
int main() {
vector< vector< vector<int> > > a(4, vector< vector<int> >(3, vector<int>(10)));
int n; cin >> n;
while (n--) {
int b, f, r, v; cin >> b >> f >> r >> v;
a[b - 1][f - 1][r - 1] += v;
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 10; k++)
cout << ' ' << a[i][j][k];
cout << endl;
}
if (i + 1 < 4) cout << "####################" << endl;
}
}
| 0
| 28,034,003
|
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth == 0)
{
ret.push_back(s);
return ret;
}
for (ll i = 0; i < symbol.size(); i++)
{
auto vec = dfs(s + symbol[i], depth - 1, symbol);
for (auto &&e : vec)
{
ret.push_back(e);
}
}
return ret;
}
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
int main()
{
ll A, B, C;
cin >> A >> B >> C;
cout << ((A <= C && C <= B) ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
vector<string> button = {".,!?@",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"};
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++){
string s;
cin >> s;
int cnt = 0;
for(int j = 0; j < s.size(); j++){
if(s[j] == '0'){
if(cnt != 0){
char c;
int num = s[j-1] - '0';
if(num - 1 == 0 && (cnt-1)%button[num-1].size() == 4)c = ' ';
else c = button[num - 1][(cnt-1)%button[num-1].size()];
cout << c;
cnt = 0;
}
}else{
cnt++;
}
}
cout << endl;
}
}
| 0
| 89,417,500
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
string s;
cin>>s;
if(s.substr(0,4)=="YAKI")cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
signed main(){
solve();
}
|
#include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
double ax,ay,bx,by,cx,cy,dx,dy;
int n;
cin>>n;
while(cin>>ax>>ay>>bx>>by>>cx>>cy>>dx>>dy){
if((ax-bx)==0&&(cx-dx)==0){
cout<<"YES"<<endl;
}else if((ax-bx)!=0.0 && (cx-dx)!=0.0){
double a = (ay-by)/(ax-bx);
double c = (cy-dy)/(cx-dx);
if(a==c){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
}else{
cout<<"NO"<<endl;
}
}
return 0;
}
| 0
| 53,930,529
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
signed main() {
int Q; cin >> Q;
rep(z,0,Q) {
int A, B; cin >> A >> B;
if(A > B) swap(A, B);
int X = A * B;
if(A == B) cout << 2*A - 2 << endl;
else if(A+1 == B) cout << 2*A - 2 << endl;
else {
int lb = 0, ub = 1000LL * 1000LL * 1000LL + 100;
while(ub - lb > 1) {
int mid = (ub + lb) / 2;
if(mid * mid < X) {
lb = mid;
}
else {
ub = mid;
}
}
int C = lb;
if(C*(C+1) >= X) {
cout << 2*C - 2 << endl;
}
else {
cout << 2*C - 1 << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool desc(int a,int b){
return a>b;
}
int main(){
int n;
cin>>n;
int a[n],b[n],d1=0,d2=0;
string aa,bb,df;
for(int i = 1 ; i <= n ; i++){
df+=i+'0';
}
for(int i = 0 ; i < n ; i++){
cin>>a[i];
aa += a[i]+'0';
}
for(int i = 0 ; i < n ; i++){
cin>>b[i];
bb += b[i]+'0';
}
while(1){
if(aa==df) break;
prev_permutation(aa.begin(), aa.end());
d1++;
}while(1){
if(bb==df) break;
prev_permutation(bb.begin(), bb.end());
d2++;
}
cout<<abs(d1-d2);
return 0;
}
| 0
| 45,510,170
|
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f
using namespace std;
queue<ll> q;
int n;
int main()
{
cin>>n;
for(int i=1;i<=9;i++)
{
q.push(i);
}
for(int i=1;i<=n;i++)
{
ll pre=q.front();
q.pop();
if(i==n)
{
cout<<pre<<endl;
}
ll r=pre%10;
pre=pre*10+r;
if(r>0)
q.push(pre-1);
q.push(pre);
if(r<9)
{
q.push(pre+1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i,N) {
cin >> A[i];
A[i]--;
A[i] %= K;
}
vector<ll> S(N + 1);
S[0] = 0;
rep(i,N) S[i + 1] = (S[i] + A[i]) % K;
map<int, int> m;
ll ans = 0;
for (int i = 0; i <= N; i++) {
if (i >= K) {
m[S[i - K]]--;
if (m[S[i - K]] == 0) m.erase(S[i - K]);
}
if (m.find(S[i]) == m.end()) m.emplace(S[i], 1);
else {
ans += m[S[i]];
m[S[i]]++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 16,947,037
|
#include<iostream>
#include<vector>
using namespace std;
int main(void){
int n,v[50];
cin>>n;
if(n == 0 || n == 1){
cout<<1<<endl;
}else{
v[0] = v[1] = 1;
for(int i = 2 ; i <= n ; i ++){
v[i] = v[i-1] + v[i-2];
}
cout<<v[n]<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vector<int>;
using vll=vector<ll>;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
int n; cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
rep(i, n-1){
ans += a[i]/2;
a[i] %= 2;
if(a[i]==0) continue;
if(a[i+1]>0){
a[i]--;
a[i+1]--;
ans += 1;
}
}
ans += a[n-1]/2;
pr(ans);
return 0;}
| 0
| 95,043,774
|
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
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 int maxtime(long long int x, long long int y) {
return(x + y - 1) / y;
}
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
long long int modinv(long long a, long long m) {
long long int b = m, u = 1, v = 0;
while (b) {
long long int 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<long long int >meguru;
bool isOK(int index, int key) {
if (meguru[index] <= key) return true;
else return false;
}
int binary_search(int key) {
int left = -1;
int right = (int)meguru.size();
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (isOK(mid, key)) left = mid;
else right = mid;
}
return left;
}
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;
}
double PI = 3.141592653589793238;
vector<vector<int>>G(100030);
int main() {
int n, m;
cin >> n >> m;
vector<int>v;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
v.push_back(h);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int sum = G[i].size();
int s = 0;
for (auto iter : G[i]) {
if (v[i - 1] > v[iter - 1]) {
s++;
}
}
if (s == sum) {
ans++;
}
}
cout << ans;
}
|
#include<iostream>
using namespace std;
using P = pair<int, int>;
int map[22][22];
P dirs[] = {P(1, 0), P(-1, 0), P(0, 1), P(0, -1)};
int dfs(int h, int w) {
if (!map[h][w]) return 0;
map[h][w] = 0;
int ans = 0;
for (P dir : dirs) {
ans += dfs(h + dir.first, w + dir.second);
}
return ans + 1;
}
int main() {
while (1) {
int w, h;
cin >> w >> h;
if (w == 0) break;
for (int i = 0; i < 22; ++i)
for (int j = 0; j < 22; ++j)
map[i][j] = 0;
int pw, ph;
for (int i = 1; i <= h; ++i) {
for (int j = 1; j <= w; ++j) {
char c;
cin >> c;
if (c == '.') map[i][j] = 1;
if (c == '@') {
map[i][j] = 1;
ph = i;
pw = j;
}
}
}
cout << dfs(ph, pw) << endl;
}
}
| 0
| 11,451,484
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<string> w;
int n;
cin >> n;
string prev;
cin >> prev;
w.push_back(prev);
for (size_t i = 0; i < n - 1; i++)
{
string s;
cin >> s;
if (s[0] != prev[prev.length() - 1])
{
cout << "No" << endl;
return 0;
}
if (std::find(w.begin(), w.end(), s) != w.end())
{
cout << "No" << endl;
return 0;
}
prev = s;
w.push_back(s);
}
cout << "Yes" << endl;
return 0;
}
|
#include <stdio.h>
int main(){
int n,k,a[1000000],top,sum;
while(1){
scanf("%d%d",&n,&k);
if(n==0)return 0;
sum=0;
for(int i=0;i<k;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
top=sum;
for(int i=k;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
sum-=a[i-k];
if(sum>top)top=sum;
}
printf("%d\n",top);
}
}
| 0
| 55,373,742
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 100100
lli n, k;
int main(void){
cin >> n >> k;
vector<lli> a(N);
rep(i, n){
lli ai, bi;
cin >> ai >> bi;
a[ai]+=bi;
}
lli s = 0;
for(int i = 1; i <= N; i++){
s+=a[i];
if(s >= k){
cout << i << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
int n;
string s;
cin >> n >> s;
cout << (~n & 1 && s.substr(0, n / 2) == s.substr(n / 2) ?
"Yes" : "No");
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int tcs = 1;
for (int tc = 1; tc <= tcs; tc++) {
solve();
}
}
| 0
| 65,595,410
|
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
int main(){
int N;
cin >> N;
ll ans =0;
vector<ll> A(N);
for(int i = 0;i < N;i++)
cin >> A.at(i);
sort(A.begin(),A.end());
ans = A.at(N-1) - A.at(0);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,i,j,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define ittr(x,v) for(auto x=v.begin();x!=v.end();x++)
#define itr(x,n) for(x=0;x<n;x++)
#define itrab(x,a,b) for(x=a;x<b;x++)
#define itpr(v) ittr(x,v)cout<<*x<<" "; cout nn
#define itppr(v) ittr(x,v)cout<<(*x).ff<<" "<<(*x).ss<<" "; cout nn
#define sz(x) (ll)((x).size())
#define dTor(x) ((x)*pi)/180.0
#define pi 3.14159265359
#define INF 1000000000
#define INFF 1000000000000000000
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef map<ll,ll> ml;
typedef set<ll> sl;
typedef string str;
typedef pair<ll, ll> pl;
typedef vector< pl > vpl;
typedef map<pl,ll> mpl;
typedef set< pl > spl;
typedef vector<str> vst;
typedef vector<vl> vvl;
const ll M=1000000007;
const ll N=998244353;
ll power(ll x, ll y, ll p){
ll res=1;
x=x%p;
if(x==0)
return 0;
while(y>0){
if(y&1)
res=(res*x)%p;
y=y>>1;
x=(x*x)%p;
}
return res;
}
ll inv(ll x, ll m){
return power(x,m-2,m);
}
ll nCr(ll n, ll r){
if (r==0)
return 1;
vl fac(n);
return (fac[n]*inv(fac[r],M)%M*inv(fac[n-r],M)%M)%M;
}
struct comp{
template<typename T>
bool operator()(const T &a, const T &b){
if (a.ff==b.ff)
return (a.ss<b.ss);
else
return (a.ff<b.ff);
}
};
bool mod(const pair<ll,ll> &a, const pair<ll,ll> &b){
if(a.ff!=b.ff)
return (a.ff>b.ff);
else
return (a.ss>b.ss);
}
void sieve(){
vector<bool> pr(1000000+1,1);
for(ll i=2;i*i<=1000000;i++)
if(pr[i]==1)
for(ll j=i*i;j<=1000000;j+=i)
pr[j]=0;
}
bool isValid(ll i, ll j, ll n, ll m){
if(i>=0&&i<n&&j>=0&&j<m){
return true;
}
return false;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
standardVar;
cin>>k;
str s;
cin>>s;
if(sz(s)<=k)
cout<<s nn;
else{
itr(i,k)
cout<<s[i];
cout<<"..." nn;
}
return 0;
}
| 0
| 49,212,135
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x) \
for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for(bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
cin >> head;
CIN(move(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif
static inline constexpr decltype(auto)
fix(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&... args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define PI 3.141592653589793238
static const int CCW_COUNTER_CLOCKWISE = 1;
static const int CCW_CLOCKWISE = -1;
static const int CCW_ONLINE_BACK = 2;
static const int CCW_ONLINE_FRONT = -2;
static const int CCW_ON_SEGMENT = 0;
static const int ICC_SEPERATE = 4;
static const int ICC_CIRCUMSCRIBE = 3;
static const int ICC_INTERSECT = 2;
static const int ICC_INSCRIBE = 1;
static const int ICC_CONTAIN = 0;
signed main() {
LCIN(N);
VL a(N);
VECCIN(a);
MKORDER(N);
sort(All(od), [&](ll i, ll j) { return a[i] == a[j] ? i > j : a[i] > a[j]; });
VL ans(N);
ll now = INF;
REP(i, N) {
ll idx = od[i];
now = min(now, idx);
ans[now] += (i + 1) * (a[idx] - (i == N - 1 ? 0 : a[od[i + 1]]));
}
REP(i, N) { cout << ans[i] << "\n"; }
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using ll= long long;
using namespace std;
int main(){
int N,M,X;
cin>>N>>M>>X;
int C[N],A[N][M];
rep(i,N){
cin>>C[i];
rep(j,M){
cin>>A[i][j];
}
}
int ans=100000000;
rep(bit,(1<<N)){
int Csum=0;
vector<int> Asum(M,0);
bool ok=true;
rep(j,N){
if((bit>>j)&1){
Csum+=C[j];
rep(k,M){
Asum[k]+=A[j][k];
}
}
}
rep(i,M){
if(Asum[i]<X){
ok=false;
break;
}
}
if(ok==true){
ans=min(ans,Csum);
}
}
if(ans==100000000){
ans=-1;
}
cout<<ans<<endl;
}
| 0
| 89,045,785
|
#include<bits/stdc++.h>
#define INF 9223372036854775807LL
#define inf 1000000007
#define SYOU(x) setprecision(x+1)
#define abs(x,y) (max(x,y)-min(x,y))
#define lol long long
#define mp make_pair
#define fi first
#define se second
using namespace std;
lol a,b,c,d;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >>a>>b;
cout <<a+b/2<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int size1 = s1.size();
int size2 = s2.size();
int d[size1 + 1][size2 + 1];
for(int i = 0; i <= size1; ++i) {
d[i][0] = i;
}
for(int i = 0; i <= size2; ++i) {
d[0][i] = i;
}
for(int i = 1; i <= size1; ++i) {
for(int j = 1; j <= size2; ++j) {
int cost = s1[i - 1] == s2[j - 1] ? 0 : 1;
d[i][j] = min(min(d[i - 1][j] + 1, d[i][j - 1] + 1), d[i - 1][j - 1] + cost);
}
}
cout << d[size1][size2] << endl;
}
| 0
| 91,398,336
|
#include <iostream>
using namespace std;
int main(){
string s;
int w;
cin >> s >> w;
string ans = "";
for(size_t i = 0; i < s.length(); i += w){
ans += s[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
using namespace std;
#define int long long
using ll = long long;
const int MX = 1e6;
const ll inf = 1e13;
const int mod = 1e9+7;
signed main() {
int n;
cin >> n;
FOR(i,1,361) {
if((n*i)%360==0) {
cout << i << endl;
return 0;
}
}
return 0;
}
| 0
| 89,359,019
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <stack>
#include <bitset>
#include <map>
#include <cmath>
#include <climits>
#include <queue>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k, d, o;
scanf("%d %d", &n, &k);
vector<int> A(n, 0);
rep(i, k) {
scanf("%d", &d);
rep(j, d) {
scanf("%d", &o);
A[o - 1]++;
}
}
o = 0;
rep(i, n) if (A[i] == 0) o++;
printf("%d\n", o);
}
|
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
ll int MOD=998244353;
#define N 3000000
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
main(){
ll int k;
cin>>k;
ll int kk=k;
int n=50;
ll int a[50]={};
rep(i,50){
a[i]=kk/50;
k-=kk/50;
}
rep(i,50){
if(k>0){
a[i]++;
k--;
}
}
cout<<50<<endl;
rep(i,50){
a[i]=(ll)51*a[i]-kk+(ll)49;
cout<<a[i]<<" ";
}
return 0;
}
| 0
| 91,636,589
|
#include <bits/stdc++.h>
#define ll long long int
#define inv(name,Type,size) vector<Type> name(size);for(int index=0;index<n;index++) cin>>name[index];
#define F(a,n,i) for(int i=a;i<n;i++)
#define pb push_back
#define endl "\n"
#define mod 10000000007
#define modpro 99824435
using namespace std;
void solve(){
int n;
cin>>n;
vector<pair<int,int>> v(n);
F(0,n,i){
cin>>v[i].first;
v[i].second=i+1;
}
sort(v.begin(),v.end());
F(0,n,i){
cout<<v[i].second<<" ";
}
}
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n;
long long sum = 0, min, max, a;
scanf("%d", &n);
for(int i = 0; i < n; ++i){
cin >> a;
if(i == 0){
max = a;
min = a;
}
if(max < a){
max = a;
} else if(min > a){
min = a;
}
sum = sum + a;
}
cout << min << " " << max << " " << sum << "\n";
return 0;
}
| 0
| 55,926,774
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) {if (a > b) { a = b; return true; } return false; }
ll INF = 1001001001;
ll LINF = 1001001001001001001ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vector<LP> as(n);
rep(i, n) as[i].se = i;
rep(i, n) cin>>as[i].fi;
sort(rng(as));
reverse(rng(as));
ll cur = as[0].se;
ll acc = 0;
vl ans(n);
rep(i, n) {
if (as[i].se < cur) {
ans[cur] = acc - as[i].fi * i;
acc = as[i].fi * i;
cur = as[i].se;
}
acc += as[i].fi;
}
ans[0] = acc;
rep(i, n) cout<<ans[i]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define scl(n) scanf("%lld", &n)
#define pcl(n) printf("%lld\n", n)
#define pcl1(n) printf("%lld ", n)
#define nln printf("\n")
#define dev(x) cout << #x << " " << x << " ";
#define PTT pair<ll, ll>
map<ll, ll> mp, mp1;
map<ll, ll>::iterator itr;
int main()
{
ll t, n, x;
scl(n);
ll mn = 1e10, d;
for (ll i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
d = max(i, n / i);
ll cnt = 0;
while (d >= 1)
{
d /= 10;
cnt++;
}
mn = min(cnt, mn);
}
}
pcl(mn);
return 0;
}
| 0
| 54,215,408
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = 0, res = 0; lli c = 0ll, k = 0ll;
cin >> n >> c >> k;
vector<lli> t(n);
for (auto &i : t)
cin >> i;
sort(t.begin(), t.end());
for (int i = 0; i < n;)
{
++res; int j = i + 1, ct = 1;
while (ct < c && j < n && t[j] <= t[i] + k)
{
++j; ++ct;
}
i = j;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N; cin>>N;
if(N%2==1){
cout<<0<<endl;
}else{
ll cnt=0;
ll t=N;
while(t!=0){
t/=5;
cnt+=(t/2);
}
cout<<cnt<<endl;
}
}
| 0
| 86,623,412
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
using namespace std;
int main(){
int a[5];
for(int i=0 ; i<5 ; i++){
cin >> a[i];
}
for(int i=0 ; i<5 ; i++){
for(int j=i; j<5 ; j++){
if(a[i] < a[j] ){
int temp;
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
for(int i=0 ; i<4 ; i++){
cout << a[i] << ' ';
}
cout << a[4] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<(r);i++)
#define pb push_back
#define fi first
#define se second
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x%y) : x;
}
ll LCM(ll x, ll y){
return x/GCD(x, y)*y;
}
int main() {
int a, b, x; cin >> a >> b >> x;
if(a>x || a+b<x){
cout << "NO" << endl;
}else{
cout << "YES" << endl;
}
return 0;
}
| 0
| 7,726,474
|
#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 main(int argc, char **argv)
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string S, T; cin >> S >> T;
ll NS = S.size();
ll NT = T.size();
vector<string> res;
REP(si, NS)
{
if (NS - si < NT) continue;
string tmp;
REP(i, si)
{
if (S[i] == '?')
tmp.push_back('a');
else
tmp.push_back(S[i]);
}
bool ok{true};
REP(i, NT)
{
ll ss = i + si;
ll tt = i;
if (S[ss] == '?')
{
tmp.push_back(T[tt]);
}
else
{
if (S[ss] == T[tt])
tmp.push_back(S[ss]);
else
ok = false;
}
}
if (!ok) continue;
for (ll i = si + NT; i < NS; ++i)
{
if (S[i] == '?')
tmp.push_back('a');
else
tmp.push_back(S[i]);
}
res.push_back(tmp);
}
if (res.size() == 0)
{
std::cout << "UNRESTORABLE" << std::endl;
return 0;
}
sort(ALL(res));
std::cout << res[0] << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
typedef int64_t 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; }
int main() {
int N, D;
cin >> N >> D;
Graph Z(N, vector<int>(D));
rep(i, N) {
rep(j, D) {
cin >> Z.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N-1; i++)
{
for (int j = i+1; j < N; j++)
{
int norm = 0;
for (int k = 0; k < D; k++)
{
int tmp = Z.at(i).at(k) - Z.at(j).at(k);
norm += tmp * tmp;
}
bool flag = false;
for (int m = 0; m*m<= norm; m++)
{
if (m*m==norm)
{
flag = true;
}
}
if (flag)++ans;
}
}
cout << ans << endl;
}
| 0
| 28,835,083
|
#include <stdio.h>
int main(){
char huruf;
scanf("%c",&huruf);
if (huruf >=65 && huruf <=90){
printf("A\n");
}
else{
printf("a");
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main(){
int n, d, x;
cin >> n >> d >> x;
int cnt = 0;
for(int i = 0; i < n; i++){
int a;
cin >> a;
for(int j = 0; ; j++){
if(j*a+1 <= d){
cnt++;
}else{
break;
}
}
}
cout << x + cnt << endl;
}
| 0
| 35,112,873
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <cstdlib>
#include <typeinfo>
using namespace std;
const int SUP = -1;
typedef pair<int, int> P;
const int MAX_H = 1000;
const int MAX_W = 1000;
char field[MAX_H][MAX_W + 1];
int d[MAX_H][MAX_W];
int H, W, N;
int sx, sy;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int bfs(){
int time = 0;
for (int i = 1; i <= N; i++) {
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++) d[i][j] = SUP;
queue<P> que;
que.push(P(sx, sy));
d[sx][sy] = 0;
while (que.size()){
P p = que.front(); que.pop();
if (field[p.first][p.second]-'0' == i) {
time += d[p.first][p.second];
sx = p.first;
sy = p.second;
break;
}
for (int i = 0; i < 4; i++) {
int nx = p.first + dx[i], ny = p.second + dy[i];
if(0 <= nx && nx < H && 0 <= ny && ny < W && field[nx][ny] != 'X'&& d[nx][ny] == SUP){
que.push(P(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
}
return time;
}
int main(int argc, char const *argv[]) {
cin >> H >> W >> N;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> field[i][j];
if (field[i][j] == 'S'){
sx = i;
sy = j;
}
}
}
cout << bfs() << endl;
}
|
#include<bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template<typename T> inline void read(T& x) {
char c = getchar();
bool f = false;
for (x = 0; !isdigit(c); c = getchar()) {
if (c == '-') {
f = true;
}
}
for (; isdigit(c); c = getchar()) {
x = x * 10 + c - '0';
}
if (f) {
x = -x;
}
}
template<typename T, typename... U> inline void read(T& x, U& ... y) {
read(x), read(y...);
}
const int N=1e5+10;
int n,m,p;
int head[N],vis[N],In[N];
bool Flag;
struct Edge {
int to,last;
Edge () {}
Edge (int a,int b) :to(a),last(b) {}
}edge[N<<2];
void ADD(int a,int b) {
edge[++p]=Edge(b,head[a]); head[a]=p;
edge[++p]=Edge(a,head[b]); head[b]=p;
}
void DFS(int u,int c) {
if(vis[u]) {
if(vis[u]!=c) Flag=true;
return;
}
vis[u]=c;
for(int i=head[u];i;i=edge[i].last) {
int v=edge[i].to;
DFS(v,c^1);
}
}
int main() {
#ifdef rua
freopen("GG.in","r",stdin);
#endif
read(n,m);
for(int i=1;i<=m;++i) {
int u,v; read(u,v);
ADD(u,v);
++In[u]; ++In[v];
}
LL A=0,B=0,C=0;
for(int i=1;i<=n;++i) if(!vis[i]) {
if(!In[i]) ++A;
else {
Flag=false;
DFS(i,2);
if(Flag) ++C;
else ++B;
}
}
printf("%lld\n",A*n+A*(n-A)+B*B*2+C*C+C*B*2);
return 0;
}
| 0
| 64,495,733
|
#include <iostream>
#include <string>
#include <stack>
#include <map>
using namespace std;
int main() {
map<char,char> close_of;
close_of['('] = ')';
close_of['['] = ']';
while(true) {
string line;
getline(cin, line);
if(line == ".") break;
bool ok = true;
stack<char> stk;
for(int i = 0; i < line.size(); ++i) {
char c = line[i];
if(c == '(' || c == '[') {
stk.push(c);
}
else if(c == ')' || c == ']') {
if(stk.size() == 0 || c != close_of[stk.top()]) {
ok = false;
break;
}
stk.pop();
}
}
if(stk.size() != 0) ok = false;
cout << (ok?"yes":"no") << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxc 1000000007
#define maxn 100005
#define maxm 1000006
#define pii pair <int,int>
#define Task ""
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar())) x=x*10+c-48;if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
using namespace std;
int n,gt[maxn << 1],ans,cur;
int main()
{
ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
cin >> n;
n <<= 1;
gt[0] = 1;
FOR(i,1,n) gt[i] = (1ll*gt[i-1]*i) % maxc;
ans = gt[n / 2];
FOR(i,1,n)
{
int x;
char c;
cin >> c;
x = (c == 'W');
if (x)
{
if (cur & 1)
{
++cur;
}
else
{
ans = (1ll*ans*cur) % maxc;
--cur;
}
}
else
{
if (cur & 1)
{
ans = (1ll*ans*cur) % maxc;
--cur;
}
else
{
++cur;
}
}
}
if (cur) ans = 0;
cout << ans;
return 0;
}
| 0
| 23,908,092
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x, ans;
cin >> n >> x;
ans = n;
function<void(ll, ll)> solve = [&](ll x, ll y) {
ans += 2LL * (y/x) * x;
if( !(y % x)) {
ans -= x;
} else {
solve(y % x, x);
}
};
solve(min(x, n - x), max(x, n - x));
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
inline ll cntSeq(string s) {
ll cnt = 0;
ll num = 0;
REP(i, s.size() - 1) {
if (s[i] == s[i + 1]) cnt++;
else {
if (cnt > 0) {
cnt++;
num += cnt / 2;
}
cnt = 0;
}
}
if (cnt > 0) {
cnt++;
num += cnt / 2;
}
return num;
}
int main() {
cin.tie(0)->sync_with_stdio(false);
string s; cin >> s;
ll n = s.size();
ll k; cin >> k;
ll cnt1 = cntSeq(s);
ll cnt2 = cntSeq(s + s);
ll cnt = 0;
REP(i, n - 1)
if (s[i] == s[i + 1]) cnt++;
ll res = 0;
if (cnt == n - 1) res = (n * k) / 2;
else if (s[0] != s[n - 1]) res = cnt1 * k;
else {
if (cnt1 * 2 == cnt2) res = cnt1 * k;
else {
res = (cnt2 - cnt1) * (k - 1);
res += cnt1;
}
}
cout << res << '\n';
return 0;
}
| 0
| 86,825,234
|
#include <cstdio>
#include <iostream>
using namespace std;
int a, b;
int main(){
cin >> a >> b;
printf("%d %d %.5f\n", a/b, a%b, (double)a/(double)b);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
vll ans;
vector<bool> seen;
void dfs(const vector<vll> &G, ll v){
seen[v] = true;
for(auto g:G[v]){
if(seen[g])continue;
ans[g] += ans[v];
dfs(G,g);
}
}
int main()
{
int N,Q;
cin >> N >> Q;
vector<vll> G(N);
ans.assign(N,0);
seen.assign(N,false);
REP(i,N-1){
ll a,b;
cin >> a >> b;
a--;
b--;
G[a].pb(b);
G[b].pb(a);
}
REP(i,Q){
ll a,b;
cin >> a >> b;
a--;
ans[a]+=b;
}
REP(i,N){
if(seen[i])continue;
dfs(G,i);
}
REP(i,N){
cout << ans[i] << " ";
}
cout << endl;
}
| 0
| 42,928,896
|
#include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
std::istream &operator>>(std::istream &in, set<ll> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
int main() {
int n;
cin >> n;
vector<int> speeds = [&]() -> vector<int> {
vector<int> _times(n), _speeds(n);
rep(i, n) cin >> _times[i];
rep(i, n) cin >> _speeds[i];
vector<int> speeds;
rep(i, n) {
rep(j, _times[i]) speeds.push_back(_speeds[i]);
}
vector<int> speeds2;
rep(i, speeds.size()) {
if (i == 0) {
speeds2.push_back(0);
speeds2.push_back(speeds[0]);
} else {
int mi = min(speeds[i - 1], speeds[i]);
speeds2.push_back(mi);
speeds2.push_back(speeds[i]);
}
}
speeds2.push_back(0);
return speeds2;
}();
int ss = speeds.size();
vector<double> dp(ss);
rep(i, ss) dp[i] = speeds[i];
rep(i, ss) if (i != 0) cmin(dp[i], dp[i - 1] + 0.5);
for (int i = ss - 2; i > 0; i--) cmin(dp[i], dp[i + 1] + 0.5);
double sum = 0;
rep(i, ss) {
if (i == 0) continue;
double a = dp[i - 1], b = dp[i];
double now = (a + b) / 2 * 0.5;
sum += now;
}
cout << setprecision(20) << sum << endl;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<string>
struct Node {
Node* prev;
Node* next;
long long value;
};
Node* nil;
void init() {
nil = (Node*) malloc(sizeof(Node));
nil->prev = nil;
nil->next = nil;
}
void insertNode (long long value) {
Node* n = (Node*) malloc(sizeof(Node));
n->value = value;
n->next = nil->next;
nil->next->prev = n;
nil->next = n;
n->prev = nil;
}
Node* findNode(long long value) {
Node* cur = nil->next;
while (cur != nil) {
if (cur->value == value) return cur;
cur = cur->next;
}
return NULL;
}
void deleteNode (Node* n) {
if (n == NULL) return;
n->next->prev = n->prev;
n->prev->next = n->next;
free(n);
n = NULL;
}
void deleteFirst() {
deleteNode(nil->next);
}
void deleteLast() {
deleteNode(nil->prev);
}
void printList() {
Node* cur = nil->next;
while (cur != nil) {
if (cur->prev != nil) printf(" ");
printf("%lld", cur->value);
cur = cur->next;
}
printf("\n");
}
int main() {
int N;
scanf("%d", &N);
init();
for (int i = 0; i < N; ++i) {
char c[100];
long long value;
scanf("%s", c);
std::string str = c;
if (str == "insert") {
scanf("%lld", &value);
insertNode(value);
}
else if (str == "delete") {
scanf("%lld", &value);
deleteNode(findNode(value));
}
else if (str == "deleteFirst") {
deleteFirst();
}
else if (str == "deleteLast") {
deleteLast();
}
}
printList();
return 0;
}
| 0
| 61,561,386
|
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
while(true) {
ll n, m; cin >> n >> m;
if (n == 0 && m == 0) break;
vector<pair<ll, ll>> roads;
for(ll i = 0; i < n; i++) {
int d, p; cin >> d >> p;
roads.push_back({d, p});
}
sort(roads.begin(), roads.end(), [](pair<ll, ll> a, pair<ll, ll> b){ return a.second > b.second;});
ll b = 0;
for (ll i = 0; i < n; i++) {
if (roads[i].first < m) {
m -= roads[i].first;
roads[i].first = 0;
} else {
roads[i].first -= m;
m = 0;
b = i;
break;
}
}
ll ans = 0;
for (ll i = b; i < n; i++) {
ans += roads[i].first*roads[i].second;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define trav(a, x) for (auto& a : x)
using ull = uint64_t;
using ll = int64_t;
using PII = pair<int, int>;
using VI = vector<int>;
#define INF (1ll<<60)
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A> string to_string(A v) {
bool first = true; string res = "{";
for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); }
res += "}"; return res; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H); debug_out(T...); }
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int main() {
ios::sync_with_stdio(false), cin.tie(0);
ll N, M;
cin >> N >> M;
vector<ll> V(N);
REP(i, N) cin >> V[i];
unordered_map<ll, int> R;
ll sum = 0;
ll ans = 0;
REP(i, N) {
sum = (sum + V[i]) % M;
if (sum == 0) ans++;
ans += R[sum];
R[sum]++;
}
cout << ans << '\n';
}
| 0
| 12,733,294
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <climits>
int main()
{
long N,M;
std::cin >> N >> M;
if(N>M/2){
std::cout << M/2 << std::endl;
}else{
std::cout << N+(M-2*N)/4 << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N;
cin >> N;
string S;
cin >> S;
vector<int> cnt(26, 0);
for (int i = 0; i < N; i++) {
cnt[ S[i] - 'a' ]++;
}
ll ans = 1;
for (int i = 0; i < 26; i++) {
ans = ans * (cnt[i] + 1) % MOD;
}
ans--;
printf("%lld\n", ans);
}
| 0
| 78,469,490
|
#include <iostream>
using namespace std;
int main (){
int Info1,Math1,Science1,English1,Info2,Math2,Science2,English2,S,T;
cin>>Info1>>Math1>>Science1>>English1;
S=Info1+Math1+Science1+English1;
cin>>Info2>>Math2>>Science2>>English2;
T=Info2+Math2+Science2+English2;
if(S>=T){
cout<<S<<endl;
}
else {
cout<<T<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> II;
typedef vector< II > VII;
typedef vector<int> VI;
typedef vector< VI > VVI;
typedef long long int LL;
typedef vector<LL> VL;
typedef unsigned long long int ULL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define LET(x,a) __typeof(a) x(a)
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define gu getchar
#define pu putchar
#define si(n) cin>>n
#define dout(n) cout<<n<<"\n"
#define DRT() int t; si(t); while(t--)
#define PlUSWRAP(index,n) index = (index+1)%n
#define MINUSWRAP(index,n) index = (index + n -1)%n
#define ROUNDOFFINT(d) d = (int)((double)d + 0.5)
#define FLUSHN while(gu()!='\n')
#define FLUSHS while(gu()!=' ')
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
#define off ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main() {
#ifndef ONLINE_JUDGE
freopen("../input.txt", "r", stdin);
freopen("../output.txt", "w", stdout);
#endif
srand(chrono::steady_clock::now().time_since_epoch().count());
off;
string s;
cin>>s;
int n = s.length();
int d = INT_MAX;
for(int i=0;i+2 < n;i++){
int num = 100*(s[i] - '0') + 10*(s[i+1] - '0') + (s[i+2] - '0');
int a = abs(753 - num);
d = min(d, a);
}
cout<<d;
return 0;
}
| 0
| 35,752,321
|
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void solve() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int tmp = min(a, k);
int ans = tmp;
k -= tmp;
if(!k) drop(ans);
tmp = min(b, k);
k -= tmp;
if(!k) drop(ans);
tmp = min(c, k);
ans -= tmp;
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T=1;
while(T--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S;
cin>>S;
int length = S.length();
int tmp = 0;
for(int i=0;i<length;i++){
int a = S.at(i) - '0';
tmp += a;
tmp = tmp%9;
}
if(tmp == 0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
| 0
| 89,478,190
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\n'
#define dbv(v) cout<<endl;cout<<#v<<"-->> ";for(auto it:v){cout<<it<<" ";}cout<<endl;
#define dbm(m)cout<<endl;cout<<#m<<"-->> ";for(auto it:m){cout<<it.fi<<" "<<it.se.fi<<" "<<it.se.se<<endl;}
#define dbs(s)cout<<endl;cout<<#s<<"-->> ";for(auto it:s){cout<<it<<" ";}cout<<endl;
#define mod 1000000007
#define db1(x) cout<<#x<<"="<<x<<endl;
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl;
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl;
#define mx 1e18
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define double long double
#define io std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define re(s) reverse(s.begin(),s.end())
int powe(int x,int n)
{
if(n==0)return 1;
if(n%2==0)
return powe((x%mod*x%mod)%mod,n/2)%mod;
return (x%mod*powe((x%mod*x%mod)%mod,(n-1)/2)%mod)%mod;
}
int fun(int s,vector<int>&dp)
{
if(s<0)return 0;
if(dp[s]!=-1)return dp[s];
if(s==0)return dp[s]=1;
int pp=0;
for(int i=3;i<=s;i++)
{
pp+= fun(s-i,dp);
pp%=mod;
}
return dp[s]=pp;
}
int32_t main()
{
io
int n;
cin>>n;vector<int>dp(n+1,-1);
cout<<fun(n,dp);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 222;
int n, m;
char a[200][200];
int s[200][200];
int get(int xa, int ya, int xb, int yb) {
int sum = s[xb][yb];
sum -= s[xa - 1][yb];
sum -= s[xb][ya- 1];
sum += s[xa - 1][ya - 1];
return sum;
}
int dp[200][200];
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++){
int cur = 0;
for(int j = 1; j <= m; j++) {
cin >> a[i][j], dp[i][j] = 1e8;
cur += (a[i][j] == '#');
s[i][j] = s[i - 1][j] + cur;
}
}
dp[1][1] = (a[1][1] == '#');
for(int i = 1; i <= n; i++)
for(int j = 0; j <= i - 1; j++)
if(get(j + 1, 1, i, 1) == (i - j))
dp[i][1] = min(dp[i][1], dp[j][1] + 1);
else {
if(a[i][1] == '.')
dp[i][1] = min(dp[i][1], dp[i - 1][1]);
}
for(int j = 1; j <= m; j++)
for(int i = 0; i <= j - 1; i++)
if(get(1, i + 1, 1, j) == j - i)
dp[1][j] = min(dp[1][j],dp[1][i] + 1);
else if(a[1][j]=='.')
dp[1][j] =min(dp[1][j],dp[1][j-1]);
for(int i = 0; i <= max(n, m); i++)
dp[0][i]=dp[i][0]=1e6;
for(int i = 2; i <= n; i++)
for(int j = 2; j <= m; j++) {
for(int k = 1; k <= i; k++)
for(int l = 1; l <= j; l++) {
int mn = min(dp[k - 1][l], dp[k][l - 1]);
if(mn > 1e6) continue;
if(get(k , l , i, j) != (i - k + 1) * (j - l + 1) && a[i][j] == '#') continue;
if(a[i][j] =='#'){
int val = 0;
if(a[k - 1][l]!='#') val = 1;dp[i][j]=min(dp[i][j], dp[k - 1][l] + val);
val = 0;
if(a[k][l - 1]!='#') val = 1;dp[i][j]=min(dp[i][j], dp[k][l-1] + val);
}
else if(a[i][j]=='.'){
if(abs(i - k) + abs(j - l) == 1)
dp[i][j] = min(dp[i][j], dp[k][l]);
}
}
}
for(int i = n; i <= n; i++, cout << endl)
for(int j = m; j <= m; j++)
cout<<dp[i][j];
return 0;
}
| 0
| 42,831,392
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S;
cin >> S;
string ans = "No";
if (S == "abc" || S == "acb" || S == "bca" || S == "bac" || S == "cab" || S == "cba") ans ="Yes";
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
using ll = long long int;
int n;
ll k;
vector<ll> A;
vector<ll> S;
int main(){
cin >> n >> k;
A.resize(n+3);
for(int i = 1; i <= n; i++){
cin >> A[i];
A[i] %= k;
}
S.resize(n+3);
S[0] = 0;
ll tot = 0;
ll ans = 0;
map<ll, ll> M;
M[0] = 1;
for(int i = 1; i <= n; i++){
if (i >= k){
M[S[i-k]]--;
}
tot += A[i];
int ik = i % k;
ll now = (tot + k - ik) % k;
if (M.find(now) != M.end()){
ans += M[now];
M[now]++;
}
else M[now] = 1;
S[i] = now;
}
cout << ans << endl;
return 0;
}
| 0
| 20,559,452
|
#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;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long int
#define pll pair<int , int>
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define pii 3.14159265358979323
#define inf LLONG_MAX
#define ones(x) __builtin_popcount(x)
#define fill(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
#define hell 998244353
ll mod_pow(ll a,ll b,ll m)
{
ll res = 1;
while(b)
{
if(b&1)
{
res=(res*a) % m;
}
a=(a*a) % m;
b>>=1;
}
return res;
}
ll mod_inverse(ll a)
{
return mod_pow(a , mod-2 , mod);
}
void solve()
{
int a , b , c;
cin >> a >> b >> c;
cout << (a^b^c);
}
signed main() {
fast;
int t = 1;
while(t--) {
solve();
}
return 0;
}
| 0
| 86,812,454
|
#include <cstdio>
#include <vector>
#define MAX 10
using namespace std;
vector<int> sort(vector<int> &array);
int main(){
vector<int> array;
int n;
for(int i = 0; i < MAX; i++){
scanf("%d", &n);
array.push_back(n);
}
sort(array);
for(int i = 0; i < 3; i++){
printf("%d\n", array[i]);
}
return 0;
}
vector<int> sort(vector<int> &array){
int temp = 0;
for(int i = 0; i < array.size(); i++){
for(int j = 0; j < array.size() - i - 1; j++){
if(array[j] < array[j + 1]){
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
return array;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
ll N;
cin >> N;
ll countA = 0;
ll countB = 0;
ll countAB = 0;
ll count = 0;
for (int i = 0; i < N; ++i) {
string tmp;
cin >> tmp;
for (int i = 1; i < tmp.size(); ++i) {
if(tmp[i - 1] == 'A' && tmp[i] == 'B'){
count++;
}
}
if(tmp.back() == 'A'){
if(tmp.front() == 'B'){
countAB++;
}else{
countA++;
}
}else if(tmp.front() == 'B'){
countB++;
}
}
if(countAB == 0){
count += min(countA,countB);
}else{
count += countAB - 1;
if(countA > 0){
count++;
countA--;
}
if(countB > 0){
count++;
countB--;
}
count += min(countA,countB);
}
cout << count << endl;
}
| 0
| 37,302,429
|
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hell;
}}
ll gcd(ll x,ll y)
{
if(y==0)
return x;
else
return gcd(y,x%y);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
ll m=0,c=0;
ll n;
cin>>n;
for(int i=0;i<n;i++)
{
ll x;
cin>>x;
if(x>=m)
c++;
m=max(m,x);
}
cout<<c;}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
long int sum;
long int ans=0;
int num;
for(int i=1; i<=n; i++){
sum=0;
num=i;
for(int j=0; j<5; j++){
sum+=num%10;
num/=10;
}
if(a<=sum && sum<=b){
ans+=i;
}
}
cout << ans << endl;
}
| 0
| 48,171,982
|
#include <iostream>
class UnionFindTree {
int *parents;
int *ranks;
public:
UnionFindTree(int n) {
parents = new int[n];
ranks = new int[n];
for (int i = 0; i < n; i++) {
parents[i] = i;
ranks[i] = 0;
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if ( ranks[x] < ranks[y] ) {
parents[x] = y;
}
else if ( ranks[y] < ranks[x] ) {
parents[y] = x;
}
else if (x != y) {
parents[x] = y;
ranks[y] += 1;
}
}
int find(int x) {
if (parents[x] == x)
return x;
else
return parents[x] = find( parents[x] );
}
bool is_grouped(int x, int y) {
return find(x) == find(y);
}
};
int main() {
std::ios::sync_with_stdio(false);
int n, q;
std::cin >> n >> q;
UnionFindTree uft(n);
int command, x, y;
for (int i = 0; i < q; i++) {
std::cin >> command >> x >> y;
switch (command) {
case 0:
uft.unite(x, y);
break;
case 1:
bool same = uft.is_grouped(x, y);
std::cout << ( same ? 1 : 0 ) << "\n";
break;
}
}
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=500000004;
const double EPS=1e-10;
const double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
int b[110000];
long long finv[110000];
long long inv[110000];
long long fact[110000];
long long C(int a,int b){
if(a<b)return 0;
return fact[a]*finv[b]%mod*finv[a-b]%mod;
}
int t[110000];
int main(){
int a;scanf("%d",&a);
for(int i=0;i<a+1;i++){
scanf("%d",b+i);
t[b[i]]++;
}
int key=0;
for(int i=0;i<=a;i++)if(t[i]==2){
key=i;
}
int L=a+2;
int R=0;
for(int i=0;i<=a;i++){
if(b[i]==key){
L=min(L,i);
R=max(R,i);
}
}
inv[1]=fact[0]=finv[0]=1;
for(int i=2;i<110000;i++){
inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
}
for(int i=1;i<110000;i++){
fact[i]=fact[i-1]*i%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
for(int i=1;i<=a+1;i++){
long long ret=C(a+1,i);
ret=(ret+mod-C(L+a-R,i-1))%mod;
printf("%lld\n",ret);
}
}
| 0
| 92,132,240
|
#include <bits/stdc++.h>
using namespace std;
int n, a[201], ans;
int main() {
scanf("%d", &n); n <<= 1;
for(int i = 1;i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for(int i = 1;i <= n; i += 2)
ans += a[i];
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
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; }
const int INF = 1e9;
const long long INFL = 1LL<<60;
void dump(const vector<pair<int, int>>& a)
{
for (auto v : a) {
cerr << v.first << " " << v.second << endl;
}
}
static const int MAX = 100000;
bool V[MAX];
list<int> out;
vector<int> G[MAX];
int N;
int indeg[MAX];
void bfs(int s)
{
queue<int> q;
q.push(s);
V[s] = true;
while (!q.empty()) {
int u = q.front(); q.pop();
out.push_back(u);
rep(i, G[u].size()) {
int v = G[u][i];
indeg[v]--;
if (indeg[v] == 0 && !V[v]) {
V[v] = true;
q.push(v);
}
}
}
}
void topologicalSort()
{
rep(i, N) {
indeg[i] = 0;
}
rep(u, N) {
rep(i, G[u].size()) {
int v = G[u][i];
indeg[v]++;
}
}
rep(u, N) {
if (indeg[u] == 0 && !V[u]) {
bfs(u);
}
}
for (auto it = out.begin(); it != out.end(); it++) {
cout << *it << endl;
}
}
int main()
{
int s, t, M;
cin >> N >> M;
rep(i, N) {
V[i] = false;
}
rep(i, M) {
cin >> s >> t;
G[s].push_back(t);
}
topologicalSort();
return 0;
}
| 0
| 26,770,029
|
#include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef set<ll> Set;
const ll maxs = 1e5+3;
const ll maxs1 = 1e3+4;
const ll mod = 1e9 + 7;
inline ll add(ll a, ll b) { return (mod + a + b) % mod; }
inline ll sub(ll a, ll b) { return (a - b + mod) % mod; }
inline ll mul(ll a, ll b) { return (1ll * a * b) % mod; }
ll fastpow(ll x,ll y)
{ll res = 1;x = x % mod;while (y > 0){ if (y & 1)res = (res * x) % mod; y = y >> 1 ; x = (x * x) % mod; } return res;}
ll inv(ll x){ return fastpow(x , mod - 2);}
bool isPrime(ll n) { if (n <= 1) return false; if (n <= 3) return true;if (n%2 == 0 || n%3 == 0) return false; for (int i=5; i*i<=n; i=i+6) if (n%i == 0 || n%(i+2) == 0) return false; return true; }
bool pali(string s)
{
string r;
r=s;
reverse(s.begin(),s.end());
if(s==r)
return true;
else
return false;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
double l;
cin>>l;
double r=l/3;
double s=r;
double t=l-(r+s);
double mul=r*s*t;
cout << fixed << setprecision(12) << mul;
}
|
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 200005;
int n, a[MAX_N];
bool possible(int cri)
{
map<int,int> mp;
int prv = 0;
rep(i,n){
if(a[i] <= prv){
mp.erase(mp.upper_bound(a[i]), mp.end());
rrep(j,a[i]+1){
if(j == 0){
return false;
}
if(mp[j] < cri-1){
mp[j]++;
break;
}else{
mp.erase(j);
}
}
}
prv = a[i];
}
return true;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
int flag = -1;
rep(i,n){
cin >> a[i];
if(flag >= a[i]){
flag = INF;
}
cmx(flag, a[i]);
}
if(flag != INF){
cout << "1\n";
return 0;
}
int l = 1, r = n;
while(r-l>1){
int mid = (l+r)/2;
if(possible(mid)){
r = mid;
}else{
l = mid;
}
}
cout << r << "\n";
return 0;
}
| 0
| 10,034,552
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
x=x*f;
}
}
using namespace IO;
ll n,m,w,h;
int main()
{
read(n),read(m),read(w),read(h);
for(int i=1;i<=n-h;i++)
{
for(int j=1;j<=m-w;j++)
cout<<"1";
for(int j=m-w+1;j<=m;j++)
cout<<"0";
cout<<endl;
}
for(int i=n-h+1;i<=n;i++)
{
for(int j=1;j<=m-w;j++)
cout<<"0";
for(int j=m-w+1;j<=m;j++)
cout<<"1";
cout<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n+1); i++)
#define repr(i,n) for (ll i = (n-1); i>=0;i--)
#define repr3(i,n) for(ll i = (n);i>0;i--)
#define repr4(i,s,n) for(ll i = (n);i>=(s);i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll,ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
const int mod = 1000000007;
int main(){
int N,D;
cin>>N>>D;
int X[N][D];
rep(i,N)rep(j,D)cin>>X[i][j];
int count=0;
rep(i,N){
rep2(j,i+1,N){
int dist2=0;
rep(k,D){
dist2+=(int)pow(X[i][k]-X[j][k],2);
}
rep3(k,200){
if(dist2==k*k){
count++;
break;
}
}
}
}
cout<<count<<endl;
return 0;
}
| 0
| 70,025,677
|
#include<bits/stdc++.h>
using namespace std;
void func(int nn,int mm);
int n,s;
int box[10];
int sum,cnt;
int main(void){
int i;
for(i=0;i<=9;i++) box[i]=i;
while(1){
cin>>n>>s;
if(n==0&&s==0) break;
sum=0;
cnt=0;
func(0,0);
cout<<cnt<<endl;
}
return 0;
}
void func(int nn,int mm){
int i;
if(mm==n){
if(sum==s) cnt++;
}
else{
if(nn<=9){
sum+=box[nn];
func(nn+1,mm+1);
sum-=box[nn];
func(nn+1,mm);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b==0) return a;
else{
return gcd(b,a%b);
}
}
int main() {
ll a,b,c;
cin >> a >> b >> c;
if(0< -b+c && -b+c <= a){
cout << "safe" << endl;
}
else if(a+b>c){
cout << "delicious" << endl;
}
else{
cout << "dangerous" << endl;
}
}
| 0
| 56,711,322
|
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
char now;
bool ok = false;
map<string, int> a;
for(int i = 0; i< n; i++){
string s;
cin >> s;
if(a[s] == 1) ok = true;
a[s]++;
if(i != 0){
if(now == s[0]){
now = s[s.length()-1];
continue;
}
else{
ok = true;
}
}
now = s[s.length()-1];
}
if(ok){
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>a(N);
for(int i = 0; i < N; i++) {
cin >> a[i];
}
int cnt = 0;
for(int i = 0; i < N-1; i++) {
if(a[i] == a[i+1]) {
if(a[i] == a[i+1]) {
cnt++;
i++;
}
else {
cnt++;
}
}
}
cout << cnt << endl;
}
| 0
| 85,847,184
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
string s;
cin >> s;
ll n = s.size();
ll cnt = 0;
ll ans = 0;
for(i = 0;i < n;++i){
if(s.at(i) == 'W'){
ans += i;
++cnt;
}
}
for(i = 0;i < cnt;++i){
ans -= i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vll b(n+1);
rep(i, n) b[i+1] = b[i] + a[i];
VSORT(b);
ll ans = 0;
int cnt = 1;
rep(i, n+1) {
if (i<n && b[i]==b[i+1]) ++cnt;
else {
ans += (ll)cnt * (cnt-1) / 2;
cnt = 1;
}
}
cout << ans << endl;
return 0;
}
| 0
| 90,473,552
|
#include <iostream>
#include <vector>
#include <string>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main(void){
while(1){
vector<char> conv_from, conv_to;
int n,m;
char tmp;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++) {
cin >> tmp;
conv_from.push_back(tmp);
cin >> tmp;
conv_to.push_back(tmp);
}
cin >> m;
for(int i = 0; i < m; i++ ){
cin >> tmp;
for(int j = 0; j < n; j++){
if(tmp == conv_from.at(j)) {
tmp = conv_to.at(j);
break;
}
}
cout << tmp;
}
cout << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
struct node {
int parent;
int depth;
vector<int> children;
string type;
node(){
parent = -1;
depth = 0;
}
};
node nodes[100001];
int deep(int i){
if(nodes[i].parent == -1){
return 0;
}
return deep(nodes[i].parent) + 1;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int id,k;
cin>>id;
cin>>k;
for(int j=0;j<k;j++){
int num;
cin>>num;
nodes[num].parent=id;
nodes[id].children.push_back(num);
}
}
for(int i=0;i<n;i++){
nodes[i].depth = deep(i);
}
for(int i=0;i<n;i++){
cout<<"node "<<i<<": ";
cout<<"parent = "<<nodes[i].parent;
cout<<", depth = "<<nodes[i].depth;
string type;
if(nodes[i].children.empty() && nodes[i].parent != -1){
type ="leaf";
}else if(nodes[i].parent == -1){
type = "root";
}else{
type = "internal node";
}
cout<<", "<<type;
cout<<", [";
for(int k=0;k<nodes[i].children.size();k++){
if(k>0){cout<<", ";}
cout<<nodes[i].children[k];
}
cout<<"]"<<endl;
}
return 0;
}
| 0
| 19,651,208
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
int max,count;
max=0;
count=0;
for(int i=0; i<s.length();i++){
if(s[i]=='R'){
count++;
if(max<count){
max=count;
}
}
else
count=0;
}
cout<<max;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << ": " << x << endl;
#else
#define debug(x)
#endif
int main() {
cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(20);
ll N, P;
cin >> N >> P;
string S;
cin >> S;
if(P == 2 || P == 5) {
ll ans = 0;
rep(i, N) {
ll d = S[i] - '0';
if(d % P == 0) ans += i + 1;
}
cout << ans << endl;
return 0;
}
vll cnt(P, 0);
ll now = 0;
ll beki = 1;
for(ll i = N-1; i >= 0; i--) {
ll d = S[i] - '0';
now += d * beki;
now %= P;
cnt[now]++;
beki = beki * 10 % P;
}
ll ans = cnt[0];
for(auto x : cnt) if(x >= 2) ans += x * (x-1) / 2;
cout << ans << endl;
}
| 0
| 31,919,005
|
#include <cstdio>
const char map[4] = {'R', 'Y', 'G', 'B'};
int H, W, d, x, y;
int main() {
scanf("%d %d %d", &H, &W, &d);
for(int i = 1; i <= H; ++i) {
for(int j = 1; j <= W; ++j) {
x = (i + j + W) / d, y = (i - j + W) / d;
putchar(map[((x&1)<<1) | (y&1)]);
}
putchar('\n');
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, int> P;
#define MOD (1000000007ll)
#define l_ength size
#define EPS (1e-10)
int main(void){
ll n,i,a[123456],sum=0ll,d;
bool flag = true;
cin >> n;
for(i=0; i<n; ++i){
cin >> a[i];
sum += a[i];
}
if( sum % ((n*(n+1))/2) ){
cout << "NO" << endl;
return 0;
}
d = sum / ((n*(n+1))/2); sum = 0ll;
a[n] = a[0];
for(i=0; i<n; ++i){
if((a[i] - a[i+1] + d) < 0 || (a[i] - a[i+1] + d) % n){
cout << "NO" << endl;
return 0;
}else{
sum += ((a[i] - a[i+1] + d) / n);
}
}
if(flag && sum == d){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
return 0;
}
| 0
| 46,830,870
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
vector<int> V(10);
vector<int> T(10);
int N;
int ans = 1001001001;
int INF = 1001001001;
int A, B, C;
void calc(vector<int> v){
int now = 0;
int a = 0;
int b = 0;
int c = 0;
for (int i = 0; i < N; i++){
if(v[i] == 0){
if(a != 0){
now += 10;
}
a += T[i];
} else if(v[i] == 1){
if(b != 0){
now += 10;
}
b += T[i];
} else if(v[i] == 2){
if(c != 0){
now += 10;
}
c += T[i];
} else {
continue;
}
}
if(a == 0 || b == 0 || c == 0){
now = INF;
} else {
now += abs(A-a) + abs(B-b) + abs(C-c);
}
ans = min(ans, now);
return;
}
void dfs(int depth, vector<int> &v){
if(depth == N){
calc(v);
} else {
for (int i = 0; i < 4; i++){
v[depth] = i;
dfs(depth+1, v);
}
}
return;
}
int main() {
cin >> N >> A >> B >> C;
rep(i, N){
cin >> T[i];
}
dfs(0, V);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
using namespace std;
class TSort
{
public:
int solve();
void dfs( vector<vector<int>>& adj, vector<bool>& vd, vector<int>& rt, int u );
};
int TSort::solve()
{
int nv, ne;
cin >> nv >> ne;
vector<vector<int>> adj(nv);
vector<bool> visited(nv, false);
vector<int> ret;
for ( auto i = 0; i < ne; ++i )
{
int s, t;
cin >> s >> t;
adj[s].push_back( t );
}
for ( auto i = 0; i < nv; ++i )
{
if ( ! visited[i] )
dfs( adj, visited, ret, i );
}
for ( auto i = 0; i < nv; ++i )
cout << ret[nv - 1 - i] << endl;
return 0;
}
void TSort::dfs( vector<vector<int>>& adj, vector<bool>& vd, vector<int>& rt, int u )
{
vd[u] = true;
int n = adj[u].size();
for ( auto i = 0; i < n; ++i )
{
int v = adj[u][i];
if ( ! vd[v] )
{
dfs( adj, vd, rt, v );
}
}
rt.push_back( u );
}
int main()
{
TSort ts;
ts.solve();
return 0;
}
| 0
| 25,466,961
|
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ll n, a, b;
scanf("%lld%lld%lld", &n, &a, &b);
if (n == 1 && a == b)
return printf("1\n"), 0;
else if (n == 1 && a != b)
return printf("0\n"), 0;
if (b < a)
return printf("0\n"), 0;
printf("%lld\n", (b - a) * (n - 2) + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vvin=vector<vin>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vst=vector<string>;
using P = pair<ll,ll>;
const int inf=1e9+7;
const ll INF=9e18;
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(20);
long double w,h;
cin>>w>>h;
cout<<w*h/2<<endl;
long double x,y;cin>>x>>y;
if(w==2*x&&h==2*y)cout<<1<<endl;
else cout<<0<<endl;
}
| 0
| 58,965,107
|
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int collatz(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main() {
fastIO;
int n;
cin >> n;
map<int, int> mp;
int idx = 1;
while (true) {
if (mp.find(n) != mp.end()) {
cout << idx << endl;
return 0;
} else {
mp[n] = idx++;
}
n = collatz(n);
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
using namespace std;
#define i64 long long
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return;std::cout << e << std::endl;}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class X> void DEBUG(X d, T e){if(DEBUG_OUT == false)return;std::cout <<d<<" ";DEBUG(e);};
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solve(void)
{
int N,K;cin>>N>>K;
vector<int> data(K,0);
for (int i = 1; i <= N; i++)
{
data[i%K]++;
}
int ANS = 0;
int L = 1;
int R = K-1;
for (int i = 0; i <= K-1; i++)
{
if((i*2) %K == 0)
{
ANS += data[i]*data[i]*data[i];
}
}
cout<<ANS<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| 0
| 27,972,593
|
#include<iostream>
using namespace std;
const int MOD = 1046527;
string S[MOD];
int charToInt(char c){
if(c == 'A') return 1;
if(c == 'C') return 2;
if(c == 'G') return 3;
if(c == 'T') return 4;
return 0;
}
int getKey(string s){
int sum = 0, p = 1;
for(int i=0;i<s.size();++i,p*=5) sum+=p*charToInt(s[i]);
return sum;
}
int h1(int key){return key % MOD;}
int h2(int key){return 1 + (key % (MOD - 1));}
int find(string s){
int key = getKey(s);
for(int i=0;;++i){
int h = (h1(key) + i * h2(key)) % MOD;
if(S[h] == s) return 1;
if(S[h].size() == 0) return 0;
}
}
void insert(string s){
int key = getKey(s);
for(int i=0;;++i){
int h = (h1(key) + i * h2(key)) % MOD;
if(S[h] == s) return;
if(S[h].size() == 0){
S[h] = s;
return;
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin>>N;
for(int i=0;i<N;++i){
string s, t;
cin>>s>>t;
if(s == "insert") insert(t);
if(s == "find") cout<<(find(t)?"yes":"no")<<endl;
}
}
|
#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< pair<long long, long long> > vllll;
typedef map<int, int> mii;
typedef map<long long, long long> mllll;
typedef queue<int> qi;
typedef queue< pair<int, int> > qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define uni(v) do{ \
sort(v.begin(), v.end()); \
decltype(v)::iterator result = unique(v.begin(), v.end()); \
v.erase(result, v.end()); \
}while(0)
#define fi(init, n) for(int i = init; i < n; ++i)
#define fj(init, n) for(int j = init; j < n; ++j)
#define fk(init, n) for(int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
#define bitsum(x) __builtin_popcount(x)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = { 0, 1, 0, -1 };
const int dj[] = { 1, 0, -1, 0 };
template<typename T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template<typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template<typename T>
int finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size()) return 1;
else return 0;
}
ll frac(ll n){
if (n == 0) return 1;
return (n * frac(n - 1)) % MOD;
}
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 argc, char** argv) {
#ifdef HIRO
string quiz(argv[1]);
string id(argv[2]);
string filename("input/" + quiz + "/" + id + ".txt");
ifstream fin(filename);
if (fin.peek() == ifstream::traits_type::eof()) {
cout << "No input.";
return 0;
}
ifstream cin(filename);
std::cin.rdbuf(cin.rdbuf());
#endif
ll ans = 1;
ll n;
string s;
cin >> n >> s;
int cnt[26] = { 0 };
for(char c: s) {
cnt[c - 'a']++;
}
fi(0, 26)
(ans *= (cnt[i] + 1)) %= MOD;
ans--;
if(ans < 0) ans += MOD;
cout << ans << endl;
return 0;
}
| 0
| 21,154,839
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.