code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <cassert>
#include <limits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <array>
#include <map>
#include <set>
#include <deque>
#include <list>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <climits>
#include <cstring>
#include <bitset>
#include <stack>
#include <queue>
#define MOD (1e9 + 7);
#define PI (3.14159265358979323846)
using ll = int64_t;
using ull = uint64_t;
using namespace std;
[[maybe_unused]] static auto __x = [](){ios_base::sync_with_stdio(0); cin.tie(0);};
int main() {
string a;
cin >> a;
unordered_set<char> s;
for (char ch : a) s.insert(ch);
cout << (s.size() == 2 ? "Yes" : "No");
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define pb push_back
#define pf push_front
int gcd(int a,int b){
while(min(a,b)>0){if(a<b)swap(a,b);a%=b;}return max(a,b);
}
int dx[]={1,0,-1,0,1,-1,-1,1};
int dy[]={0,1,0,-1,1,1,-1,-1};
const int MOD = 1e9+7;
const int INF = 1e18+10;
vi to[200200];
int cnt[200200];
void dfs(int v,int p=-1){
for(int u:to[v]){
if(u==p) continue;
cnt[u]+=cnt[v];
dfs(u,v);
}
}
signed main(){
int n,q;
cin>>n>>q;
rep(i,n-1){
int a,b;
cin>>a>>b;
a--;b--;
to[a].pb(b);
to[b].pb(a);
}
rep(i,q){
int p,x;
cin>>p>>x;
p--;
cnt[p]+=x;
}
dfs(0,-1);
rep(i,n){
cout<<cnt[i];
if(i<n-1) cout<<" ";
}
cout<<endl;
return 0;
}
| 0
| 49,998,896
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <functional>
#include <iomanip>
#include <bitset>
#include <numeric>
#include <queue>
#include <map>
#include <cstdint>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
typedef long long int ll;
typedef pair<ll, ll> P;
const vector<int> di = { -1, 0, 1, 0 };
const vector<int> dj = { 0, 1, 0, -1 };
const double PI = 3.14159265358979323846;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = min(b, d) - max(a, c);
if (ans < 0) ans = 0;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
ll n,a,b; cin>>n>>a>>b;
if(n==1 && a!=b)cout<<0<<endl;
else if(a>b)cout<<0<<endl;
else cout<<(n-2)*(b-a)+1<<endl;
return 0;
}
| 0
| 92,624,322
|
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = std::pair<ll, ll>;
constexpr ll INF = 1ll<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }
template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }
ll A[2], B[2];
int main()
{
rep( i, 2 )
std::cin >> A[i];
rep( i, 2 )
std::cin >> B[i];
std::cout << std::min(A[0], A[1])+std::min(B[0], B[1]) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
template<class T>bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
void func(long long N){
lli sum=0;
REP(i,1,N+1){
sum += 800;
if(i%15==0)sum-=200;
}
cout<<sum<<endl;
}
int main(){
long long N;
scanf("%lld",&N);
func(N);
return 0;
}
| 0
| 83,303,702
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const* argv[]) {
int A, B, C, D;
scanf("%d %d %d %d", &A, &B, &C, &D);
if (A + B > C + D) printf("Left\n");
else if (A + B < C + D) printf("Right\n");
else printf("Balanced\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll>pos[21];
ll inp[100];
map<ll,ll>mp;
vector<ll>points;
vector<ll>::iterator upper1, upper2;
int main()
{
ll i,j,k,l,t,n,x=0,y=0,p,q,z=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>p;
points.push_back(p);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
x=x+points[i]*points[j];
}
}
cout<<x;
}
| 0
| 70,513,041
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
if(a%500<=b)
cout<<"Yes";
else
cout<<"No";
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
int n; cin >> n;
V<ll> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> b[i];
ll o = 0, s = 0;
V<ll> v;
for(int i = 0; i < n; i++){
if(a[i] <= b[i]) s += b[i] - a[i];
else{
o += a[i] - b[i];
v.push_back(a[i] - b[i]);
}
}
if(o < s){
cout << -1 << endl;
return 0;
}
if(s == 0){
cout << 0 << endl;
return 0;
}
ll ans = n;
ll x = o - s;
if(0 < x){
int m = v.size();
sort(ALL(v));
for(int i = 0; i < m; i++){
if(0 <= x - v[i]){
ans--;
x -= v[i];
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 70,046,040
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> price(N);
for (int i = 0; i < N; i++) {
cin >> price.at(i);
}
sort(price.begin(), price.end());
int sum = 0;
for (int i = 0; i < M; i++) {
sum += price.at(i);
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep(i,n,N) for(ll i=n;i<=N;++i)
#define rap(i,n,N) for(ll i=n;i>=N;--i)
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define lc (id<<1)
#define rc ((id<<1)|1)
#define db(x) cout << ">>>>>> " << #x << " -> " << x << endl;
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define piii pair<int,pii>
#define plll pair<ll,pii>
#define piiii pair<pii,pii>
#define psi pair<string,int>
const int MAX = 1e5+5;
const ll MAX2 = 11;
const ll MOD = 1000000007;
const ll INF = 1e18;
const int dr[]={1,0,-1,0,1,1,-1,-1,0};
const int dc[]={0,1,0,-1,1,-1,1,-1,0};
const double pi = acos(-1);
const double EPS = 1e-9;
const int block = 450;
ll n,x[MAX],y[MAX],z,ttl,nw;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n;
rep(i,1,n)cin>>x[i], z+=x[i];
if(z%(n*(n+1)/2)!=0)return cout<<"NO\n",0;
z/=n*(n+1)/2;
rep(i,2,n){
if((z+x[i-1]-x[i])%n!=0)return cout<<"NO\n",0;
y[i-1] = (z+x[i-1]-x[i])/n;
}
if((z+x[n]-x[1])%n!=0)return cout<<"NO\n",0;
y[n] = (z+x[n]-x[1])/n;
rep(i,1,n)ttl+=y[i];
if(ttl!=z)return cout<<"NO\n",0;
nw = x[n]+z-n*y[n];
rep(i,1,n){
if(nw!=x[i]||y[i]<0)return cout<<"NO\n",0;
nw+=z-n*y[i];
}
if(nw!=x[1])return cout<<"NO\n",0;
cout<<"YES\n";
return 0;
}
| 0
| 51,747,435
|
#include<bits/stdc++.h>
using namespace std;
const int N=100100;
vector<int>g[N];
int n;
int dfs(int x,int fa=-1){
int ret=0;
for(int i:g[x])if(i!=fa){
ret+=dfs(i,x);
if(ret==2){
cout<<"First\n";
exit(0);
}
}
return !ret;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<n;++i){
int x,y;cin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
cout<<(dfs(1)?"First\n":"Second\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define endl "\n"
#define pb push_back
#define mod 1000000007
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int dx8[]={1,-1,0,0,1,1,-1,-1};
int dy8[]={0,0,1,-1,1,-1,1,-1};
ll binexp(ll a, ll b, ll m) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modinvfermat(ll a, ll m)
{
return binexp(a, m - 2, m);
}
void task(bool flag)
{
if (flag)
cout << "YES\n";
else
cout << "NO\n";
}
ll lcm(ll a, ll b)
{
return ((1LL * a * b) / (__gcd(a, b)));
}
void solve(){
ll x,y;
cin>>x>>y;
ll maxl=x*4;
ll minl=x*2;
if(y>=minl&&y<=maxl&&y%2==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast;
ll t;
t=1;
while(t--){
solve();
}
#ifndef ONLINE_JUDGE
cout << "\nTime Elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " sec\n";
#endif
return 0;
}
| 0
| 64,617,740
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
template <class T, class F>
T UpperBound(T i0, T i1, F f) {
while (i0 < i1) {
T i = i0 + (i1 - i0) / 2;
if (f(i)) i0 = i + 1; else i1 = i;
}
return i0;
}
int main() {
int q;
cin >> q;
for (int _ = 0; _ < q; _++) {
ll a, b;
cin >> a >> b;
if (a > b) swap(a, b);
ll r = 0;
if (a < b) {
ll c = a * b;
auto i = UpperBound<ll>(a, b, [&](auto i) {
return i * i < c;
});
r = (i - a) * 2;
r -= (i - 1) * i >= c;
r -= r > 0;
}
r += (a - 1) * 2;
cout << r << '\n';
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
for(ll i=0;i<v.size();i++) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
for(ll i=0;i<s.size()-1;i++){
if(s[i]==s[i+1]){
x++;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll w,b;
cin>>w>>b;w--;b--;
vector<string> v1;
vector<string> v2;
rep(i,50) v1.push_back("####################################################################################################");
rep(i,50) v2.push_back("....................................................................................................");
ll c=w/49;
ll d=w%49;
cout<<100<<' '<<100<<endl;
rep(i,c){
rep(j,49){
v1[2*i+1][2*j+1]='.';
}
}
rep(i,d){
v1[48][2*i+1]='.';
}
c=b/49;
d=b%49;
rep(i,c){
rep(j,49){
v2[2*i+1][2*j+1]='#';
}
}
rep(i,d){
v2[48][2*i+1]='#';
}
rep(i,50) cout<<v1[i]<<endl;
rep(i,50) cout<<v2[i]<<endl;
}
| 0
| 65,909,640
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N],B[N];
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<P> Q;
for (int i = 0; i < N; i++) {
Q.push_back(make_pair(A[i]+B[i],i));
}
sort(Q.begin(),Q.end());
reverse(Q.begin(),Q.end());
ll Asum = 0;
ll Bsum = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
Asum += A[Q[i].second];
} else {
Bsum += B[Q[i].second];
}
}
cout << Asum - Bsum << endl;
return 0;
}
|
#include <iostream>
#include <climits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = 1000000007;
typedef long long ll;
typedef pair< int, int > pii;
typedef pair< ll, ll > pll;
typedef pair< ll, int > pli;
typedef pair< int, ll > pil;
int ceil(int x, int y){
return (x % y == 0) ? x / y : x / y + 1;
}
int gcd(int x, int y){
return y ? gcd(y, x % y) : x;
}
int lcm(int x, int y){
return x / gcd(x, y) * y;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll w, h;
cin >> w >> h;
ll p[w], q[h];
for(int i = 0; i < w; i++) cin >> p[i];
for(int i = 0; i < h; i++) cin >> q[i];
pll r[2 * MAX];
for(int i = 0; i < w; i++){
r[i] = make_pair(p[i], true);
}
for(int i = 0; i < h; i++){
r[i + w] = make_pair(q[i], false);
}
sort(r, r + w + h);
ll x = 0, y = 0;
ll sum = 0;
for(int i = 0; i < w + h; i++){
if(r[i].second){
sum += (h + 1 - y) * r[i].first;
++x;
}
else{
sum += (w + 1 - x) * r[i].first;
++y;
}
}
cout << sum << endl;
return 0;
}
| 0
| 88,522,955
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <cmath>
#include <numeric>
#include <functional>
#include <stack>
#include <iomanip>
#include <map>
#include <cstdio>
int main() {
long long n;
std::cin >> n;
std::vector<std::pair<std::string, long long> > v(n);
for (long long i = 0; i < n; i++)
{
long long a;
std::string s;
std::cin >> s >> a;
v[i] = { s, a };
}
std::string s;
std::cin >> s;
bool flag = false;
long long ans = 0;
for (size_t i = 0; i < v.size(); i++)
{
if (flag) {
ans += v[i].second;
}
if (v[i].first == s) {
flag = true;
}
}
std::cout << ans << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define db long double
#define mp make_pair
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define INF 1000000000
#define MOD 1000000007
#define MAXN 1000005
using namespace std;
char matrix[1002][1002];
ll dp[1002][1002];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests=1,t=1;
while(tests--)
{
ll i,j,h,w;
cin>>h>>w;
rep(i,1,h)
{
rep(j,1,w)
cin>>matrix[i][j];
}
dp[h][w]=1;
for(i=h;i>=1;i--)
{
for(j=w;j>=1;j--)
{
if(matrix[i][j]=='#') continue;
dp[i][j]+=dp[i+1][j]+dp[i][j+1];
dp[i][j]%=MOD;
}
}
cout<<dp[1][1];
}
return 0;
}
| 0
| 34,077,890
|
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
const int INF = 1001;
int main()
{
string s;
cin >> s;
int mini = INF;
rep(i, s.size() - 2) {
mini = min(mini, abs(100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0') - 753));
}
cout << mini << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base :: sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<pair<string, int>> songs(n);
for(int i = 0; i < n; i++){
cin >> songs[i].first >> songs[i].second;
}
reverse(songs.begin(), songs.end());
string x; cin >> x;
int sum = 0;
for(int i = 0; i < n; i++){
if(songs[i].first == x){
break;
}
sum += songs[i].second;
}
cout << sum << '\n';
return 0;
}
| 0
| 50,632,282
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
ll h,n; cin>>h>>n;
vl v(n);
rep(i,0,n){
cin>>v[i];
}
sort(all(v));
ll c=0;
for(int i=n-1;i>=0;i--){
c+=v[i];
if(c>=h){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<bool> stairs(n+1, true);
for (size_t i = 0; i < m; i++) {
int a;
cin >> a;
stairs[a] = false;
}
vector<long long> dp(n+1);
dp[0] = 1;
for (size_t i = 0; i <= n; i++) {
if (stairs[i+1]) {
dp[i+1] += dp[i];
dp[i+1] %= 1000000007;
}
if (stairs[i+2]) {
dp[i+2] += dp[i];
dp[i+2] %= 1000000007;
}
}
cout << dp[n] << endl;
return 0;
}
| 0
| 74,568,365
|
#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
pair<int,int> road[10000];
int main() {
int N,M,d,p;
while(cin>>N>>M, N|M) {
for(int i=0; i<N; ++i) {
cin>>d>>p;
road[i] = pair<int,int>(p,d);
}
sort(road,road+N);
int ans = 0;
for(int i=N-1; i>=0; --i) {
if(M <= 0) {
ans += road[i].first*road[i].second;
}else if(M <= road[i].second) {
ans += road[i].first*(road[i].second-M);
M = 0;
} else {
M -= road[i].second;
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
while (m--) {
int a, b;
cin >> a;
cin >> b;
mp[a]++;
mp[b]++;
}
for (auto &x :mp) {
if ((x.second) % 2 != 0) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 74,191,333
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
long a, b, k;
cin >> a >> b >> k;
if(a < k) {
b = max(b-(k-a), 0L);
a = 0;
} else {
a = a - k;
}
cout << a << " " << b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
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; }
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
string s;
ll k;
cin >> s >> k;
int n=s.size();
ll ctr=1;
bool first=true;
ll ans=0;
ll fi=0;
rp(i,n-1){
if(s[i]==s[i+1]) ctr++;
else{
if(first){
ans+=ctr/2;
fi=ctr;
first=false;
}
else{
ans+=ctr/2;
}
ctr=1;
}
}
if(s[0]!=s[n-1]){
ans+=ctr/2;
print(ans*k);
return 0;
}
else{
if(!first){
ans -= fi/2;
print(ans*k+fi/2+ctr/2+((fi+ctr)/2)*(k-1));
}
else{
print(n*k/2);
}
}
return 0;
}
| 0
| 13,637,479
|
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii;
const int MD = (int)1e9 + 7; typedef vector<ll> VL;
void dbg(){ cerr << "\n"; } template <class T, class ...T2>
void dbg(const T& fst, const T2&...rst){ cerr << fst << ": "; dbg(rst...); }
template <class T, class T2> void amax(T& a,T2 b){ if(a < b) a = b;}
typedef pair<ll, ll> pll;
int main()
{
cin.tie(0); ios_base::sync_with_stdio(false);
int k;
cin >>k;
vector<vector<pii>> r(k);
rep(i, k){
r[i].emplace_back((i+1)%k, 1);
r[i].emplace_back((i*10)%k, 0);
}
const ll INF = 1e18;
vector<ll> d(k, INF);
deque<int> q;
d[1] = 1;
q.push_back(1);
while(!q.empty()){
int v = q.front(); q.pop_front();
for(const auto& rp : r[v]){
int rto = rp.first;
ll ncst = d[v] + rp.second;
if(d[rto] > ncst){
d[rto] = ncst;
if(rp.second>0) q.push_back(rto);
else q.push_front(rto);
}
}
}
cout <<d[0] <<"\n";
return 0;
}
|
#include <iostream>
#define oo 0x7fffff
namespace MyNameIsLzz {
int N, M, X;
int map[15][15];
int C[15];
int val[15];
int ans = oo;
void dfs(int cur, int sum) {
if (cur == N) {
for (int i = 0; i < M; i++)
if (val[i] < X)
return;
ans = std::min(ans, sum);
return;
}
for (int i = 0; i < M; i++) val[i] += map[cur][i];
dfs(cur + 1, sum + C[cur]);
for (int i = 0; i < M; i++) val[i] -= map[cur][i];
dfs(cur + 1, sum);
}
void solve() {
std::cin >> N >> M >> X;
for (int i = 0; i < N; i++) {
std::cin >> C[i];
for (int j = 0; j < M; j++) std::cin >> map[i][j];
}
dfs(0, 0);
if (ans != oo)
std::cout << ans << std::endl;
else
std::cout << -1 << std::endl;
}
}
int main() {
MyNameIsLzz::solve();
return 0;
}
| 0
| 39,488,550
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int input;
cin >> input;
int D = input%10;
int C = (input%100 - D)/10;
int B = (input%1000 - C*10 - D)/100;
int A = (input - B*100 - C*10 -D)/1000;
bool is_seven = false;
int op1, op2, op3;
for(int i=0; i<pow(2,3);i++){
op1 = (i>>0 & 1) ? 1 : -1;
op2 = (i>>1 & 1) ? 1 : -1;
op3 = (i>>2 & 1) ? 1 : -1;
if(A + op1*B + op2*C + op3*D == 7){
is_seven = true;
break;
}
}
if(is_seven){
string st_op1 = (op1 == 1) ? "+" : "-";
string st_op2 = (op2 == 1) ? "+" : "-";
string st_op3 = (op3 == 1) ? "+" : "-";
cout << to_string(A) << st_op1 << to_string(B) << st_op2 << to_string(C) << st_op3 << to_string(D) << "=7" << endl;
}else{
cout << "unexpected input" << 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)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
const int MAX_V = 3000;
int X[MAX_V][MAX_V], Y[MAX_V][MAX_V];
int main()
{
int H, W;
cin >> H >> W;
vector<string> S(H);
rep(i, H) cin >> S[i];
repd(i, 1, H + 1) {
repd(j, 1, W + 1) {
if (S[i - 1][j - 1] == '.') {
X[i][j] = X[i][j - 1] + 1;
}
}
}
repd(i, 1, H + 1) {
int ct = X[i][W];
for (int j = W - 1; j >= 1; j--) {
if (X[i][j] == 0) {
ct = 0;
continue;
}
if (ct == 0) ct = X[i][j];
else {
X[i][j] = ct;
}
}
}
repd(j, 1, W + 1) {
repd(i, 1, H + 1) {
if (S[i - 1][j - 1] == '.') {
Y[i][j] = Y[i - 1][j] + 1;
}
}
}
repd(j, 1, W + 1) {
int ct = Y[H][j];
for (int i = H - 1; i >= 1; i--) {
if (Y[i][j] == 0) {
ct = 0;
continue;
}
if (ct == 0) ct = Y[i][j];
else {
Y[i][j] = ct;
}
}
}
int ans = 0;
rep(i, H) {
rep(j, W) {
chmax(ans, X[i + 1][j + 1] + Y[i + 1][j + 1] - 1);
}
}
cout << ans << endl;
return 0;
}
| 0
| 5,842,507
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w,'*'));
rep(i,h) rep(j,w) cin >> a[i][j];
rep(i,h) {
bool flag = true;
rep(j,w) if (a[i][j] == '#') flag = false;
if (flag) rep(j,w) a[i][j] = 'o';
}
rep(i,w) {
bool flag = true;
rep(j,h) if (a[j][i] == '#') flag = false;
if (flag) rep(j,h) a[j][i] = 'o';
}
rep(i,h){
rep(j,w) {
if (a[i][j] != 'o') cout << a[i][j];
}
rep (j,w) {
if (a[i][j] != 'o') {
cout << endl;
break;
}
}
}
}
|
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORL(i,a,b) for(LL i=(a);i<(b);++i)
#define REPL(i,n) FORL(i,0,n)
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
const double EPS = 1e-10;
const double PI = acos(-1.0);
template<typename T>
void vprint(vector<T> v) {
for(auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template<typename T>
void vvprint(vector<vector<T>> vv) {
REP(i, SIZE(vv)) {
REP(j, SIZE(vv[i])) {
cerr << vv[i][j] << " ";
}
cerr << endl;
}
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k, const Iterator last)
{
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1)
{
if (*--itr1 < *itr2)
{
Iterator j = k;
while (!(*itr1 < *j)) ++j;
iter_swap(itr1,j);
++itr1;
++j;
itr2 = k;
rotate(itr1,j,last);
while (last != j)
{
++j;
++itr2;
}
rotate(k,itr2,last);
return true;
}
}
rotate(first,k,last);
return false;
}
inline double get_time_sec(void){
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count())/1000000000;
}
template<typename T>
T gcd(T a, T b) {
if(a > b) swap(a, b);
if(a == 0) return b;
else return gcd(b%a, a);
}
template<typename T>
T lcm(T a, T b) {
return (a / gcd(a, b)) * b;
}
template<typename T>
map<T, T> prime_list(T n) {
map<T, T> ret;
for(T i = 2; i*i <= n; i++) {
if(n % i == 0) {
ret[i] = 0;
while(n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if(n != 1) ret[n]++;
return ret;
}
#define MOD 1000000007
LL mypow(LL a, LL n) {
if(n == 1) return a % MOD;
if(n % 2 == 1) return (a * mypow(a, n-1)) % MOD;
LL t = mypow(a, n/2);
return (t * t) % MOD;
}
LL mycomb(LL n, LL k) {
if(n == 0 || n == k) return 1;
LL x = 1, y = 1;
REP(i, k) {
x = x * (n-i) % MOD;
y = y * (i+1) % MOD;
}
return x * mypow(y, MOD - 2) % MOD;
}
VI par, rnk;
int root(int x) {
if(par[x] == x) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
x = root(x);
y = root(y);
return x == y;
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if(rnk[x] < rnk[y]) {
par[x] = y;
} else {
par[y] = x;
if(rnk[x] == rnk[y]) rnk[x]++;
}
}
#define INF 1e8
int main(void) {
LL n, k;
cin >> n >> k;
VLL v(n);
REP(i, n) cin >> v[i];
VPLL w(n, PLL(0, 0));
REP(i, n) w[i] = make_pair(v[i], i);
sort(ALL(w));
LL ans = 0;
REP(i, k+1) {
int l = i, r = n;
if(i > n) continue;
for(; l >= 0; l--, r--) {
LL sum = 0LL;
REP(j, l) {
sum += v[j];
}
FOR(j, r, n) {
sum += v[j];
}
int idx = 0, cnt = 0;
while(w[idx].first < 0 && cnt < k-i) {
int jdx = w[idx].second;
if(jdx < l || r <= jdx) {
sum -= w[idx].first;
cnt++;
}
idx++;
}
ans = max(ans, sum);
}
}
cout << ans << endl;
}
| 0
| 45,521,372
|
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b!=0?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
int main(){
ll n,t;
cin>>n>>t;
vector<ll> ti(n);
rep(i,n) cin>>ti[i];
ll sum=0;
rep(i,n-1) sum+=min(t,ti[i+1]-ti[i]);
sum+=t;
cout<<sum<<endl;
return 0;
}
|
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define all(c) begin(c), end(c)
#define tr(i,c) for(auto i=begin(c);i!=end(c);i++)
#define rtr(i,c) for(auto i=(c).rbegin();i!=(c).rend();i++)
#define rep(i,b) for(auto i=0;i<(b);i++)
#define pb push_back
#define sz(c) int((c).size())
static int swap_count;
void selectionSort(vi& A, int N) {
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) minj = j;
}
if (i != minj) {
swap(A[i], A[minj]);
swap_count++;
}
}
}
int main(int argc, char **argv)
{
int N;
cin >> N;
vi A(N);
for (auto& a:A) {
cin >> a;
}
selectionSort(A, N);
string sp = "";
for (auto& a:A) {
cout << sp << a;
sp = " ";
}
cout << endl;
cout << swap_count << endl;
return 0;
}
| 0
| 43,495,573
|
#include <iostream>
using namespace std;
int main(){
int n, b, f, r, v;
cin >> n;
int a[4][3][10];
for(int h=0; h<4; h++){
for(int i=0; i<3; i++){
for(int j=0; j<10; j++){
a[h][i][j] = 0;
}
}
}
for(int i=0; i<n; i++){
cin >> b >> f >> r >>v;
b -= 1; f -= 1;r -= 1;
a[b][f][r] += v;
}
for(int h=0; h<3; h++){
for(int i=0; i<3; i++){
for(int j=0; j<10; j++){
cout << " " << a[h][i][j];
}
cout << endl;
}
cout << "####################" << endl;
}
for(int i=0; i<3; i++){
for(int j=0; j<10; j++){
cout << " " << a[3][i][j];
}
cout << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int find_par(vector<int> &par, int ver){
if(par[ver] == ver)return ver;
return par[ver] = find_par(par,par[ver]);
}
void make(vector<int> &par,int x,int y){
int px = find_par(par, x);
int py = find_par(par, y);
par[px] = py;
}
int main(){
int n,m;
cin>>n>>m;
vector<int> par(n+1);
for(int i=0; i <= n;i++)par[i] = i;
while(m--){
int x,y;
cin>>x>>y;
make(par, x, y);
}
map<int, int> mp;
for(int i=1;i<=n;i++){
mp[find_par(par, i)]++;
}
int ans = -1;
for(auto it:mp){
ans = max(ans, it.second);
}
cout<<ans<<endl;
}
| 0
| 55,652,103
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll x,t;cin >>x>>t;
x-=t;
cout <<max(x,0LL)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
string s;
int k;
ll dp[200][4][2];
ll f(int i,int cnt,bool b)
{
if (i==(int)s.length())
return(cnt==k);
if (dp[i][cnt][b]!=-1)
return dp[i][cnt][b];
int lmt;
if (!b)
{
lmt=s[i]-'0';
}
else
{
lmt=9;
}
ll res=0;
for (int j=0;j<=lmt;j++){
bool t=b;
int c=cnt;
if (!b&&j<lmt)
t=1;
if (j!=0)
c++;
if (c<=k)
res+=f(i+1,c,t);
}
return dp[i][cnt][b]=res;
}
int main()
{
FASTINOUT;
cin>>s;
cin>>k;
memset(dp,-1,sizeof dp);
cout<<f(0,0,0);
return 0;
}
| 0
| 99,690,369
|
#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()0
#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=100009;
void solve(){
ll k,n;
cin>>k>>n;
vll arr(n);
for(ll i=0;i<n;i++){
cin>>arr[i];
}
if(n==0){
cout<<"0"<<endl;
return ;
}
ll sum=k-arr[n-1]+arr[0];
ll maxm=sum;
for(ll i=1;i<n;i++){
sum+=arr[i]-arr[i-1];
maxm=max(maxm,arr[i]-arr[i-1]);
}
cout<<sum-maxm<<endl;
}
int main() {
faster;
int t=1;
while(t-->0){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
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;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1)/b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
int nmax=200000;
vvec g(nmax);
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int n,m;
cin>>n>>m;
vector<int> a(m);
REP(i,m) cin >> a[i];
sort(all(a));
vec x={0,2,5,5,4,5,6,3,7,6};
vec b;
rep(i,m) b.pb(x[a[i]]);
vec dp(n+10,-1);
dp[0]=0LL;
for(int i=1;i<=n;i++){
rep(k,m){
if(i-b[k]<0||dp[i-b[k]]==-1) continue;
chmax(dp[i],dp[i-b[k]]+1);
}
}
pvec xx(m);
rep(i,m) xx[i]=P(a[i],b[i]);
sort(rall(xx));
string ans="";
for(int i=n;i>=0;i--){
rep(j,m){
if(i-xx[j].sc>=0&&dp[i]==dp[i-xx[j].sc]+1){
ans+=to_string(xx[j].fs);
i-=xx[j].sc;
i++;
break;
}
}
}
cout<<ans<<endl;
}
| 0
| 94,264,913
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
#define scl1(a) scanf("%lld", &a)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a) printf("%lld\n", a)
#define prl2(a, b) printf("%lld %lld\n", a, b)
#define ssl1(s) scanf(" %[^\n]", s)
#define scd1(a) scanf("%lf", &a)
#define scd2(a, b) scanf("%lf %lf", &a, &b)
#define prd(a) printf("%lf\n", a)
#define prld(a) printf("%Lf\n", a)
#define prcase(cs) printf("Case %lld: ", cs)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cot1(a) cout << a << "\n"
#define cot2(a, b) cout << a << " " << b << "\n"
#define cot3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline cout << "\n"
#define cotminus cout << "-1\n"
#define cot0 cout << "0\n"
#define cotyes cout << "YES\n"
#define cotno cout << "NO\n"
#define cotcase(cs) cout << "Case " << cs << ": "
#define reversed(s) reverse(s.begin(), s.end())
#define asort(s) sort(s.begin(), s.end())
#define dsort(s) sort(s.rbegin(), s.rend())
#define all(s) s.begin(), s.end()
#define uniq(s) s.resize(distance(s.begin(),unique(s.begin(), s.end())))
#define found(s, x) (s.find(x) != s.end())
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define fora(i, a, b) for (i = a; i <= b; i++)
#define forb(i, b, a) for (i = b; i >= a; i--)
#define fori(it, s) for(auto it = s.begin(); it != s.end(); it++)
#define FR ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
#define pi acos(-1)
const ll INF = LLONG_MAX;
const ll SZ = 1e5+5;
const ll mod = 1e9+7;
ll n;
struct info {
ll t, d, tp;
} a[SZ];
bool f[SZ];
bool cmp1(info x, info y) {
return x.d > y.d;
}
bool cmp2(info x, info y) {
if(x.tp == y.tp) return x.d > y.d;
return x.tp > y.tp;
}
int main() {
ll cs = 0, tc = 1, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
string s, s1, s2;
cin2(n, k);
for1(i, n) cin2(a[i].t, a[i].d);
sort(a+1, a+n+1, cmp1);
for1(i, n) {
p = a[i].t;
if(f[p]) continue;
f[p] = 1;
t++;
a[i].tp = 1;
}
sort(a+1, a+n+1, cmp2);
priority_queue <ll> pq;
j = min(t, k);
for1(i, j) c += a[i].d;
fora(i, j+1, k) {
c += a[i].d;
}
ans = c + (j * j);
fora(i, k+1, n) pq.push(a[i].d);
sum = c;
forb(i, j-1, 1) {
sum -= a[i+1].d;
if(pq.empty()) sum += a[i+1].d;
else {
if(pq.top() < a[i+1].d) sum += a[i+1].d;
else {
sum += pq.top();
pq.pop();
pq.push(a[i+1].d);
}
}
ans = max(ans, sum+(i*i));
}
cot1(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl vector<pll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pr_d(x) cout << fixed << setprecision(15) << x << endl
#define ud(c, x) distance(c.begin(), upper_bound(all(c), x))
#define ld(c, x) distance(c.begin(), lower_bound(all(c), x))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep3(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep4(i, a, b) for (int i = (a); i > (b); --i)
#define pb push_back
#define out(x) cout << x << "\n"
bool odd(int i) { return i % 2; }
#define all(v) v.begin(), v.end()
#define size(x) int(x.size())
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
void Yes_No(bool f) {
if (f)
printf("Yes\n");
else
printf("No\n");
}
void YES_NO(bool f) {
if (f)
printf("YES\n");
else
printf("NO\n");
}
template <typename T>
void deb1(T x) {
cout << x << "\n";
}
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void solve(void) {
string s;
cin >> s;
set<char> st;
rep(i, 26) st.insert('a' + i);
rep(i, size(s)) st.erase(s[i]);
if (size(st) != 0)
out(*st.begin());
else
out("None");
}
int main(void) { solve(); }
| 0
| 6,841,031
|
#include <iostream>
using namespace std;
constexpr int infty = 1000000000;
int main() {
int N, K, S;
cin >> N >> K >> S;
if (S < infty) {
for (int i = 0; i != N; ++i) {
cout << (i ? " " : "") << S+(i>=K);
}
} else {
for (int i = 0; i != N; ++i) {
cout << (i ? " " : "") << (i<K ? S : 1);
}
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
set<int> s;
int n;
cin >> n;
int a;
cin >> a;
s.insert(a);
rep(i,n-1){
cin >> a;
if(s.find(a) != s.end()){
cout<< "NO"<<endl;
return 0;
}
s.insert(a);
}
cout<<"YES"<<endl;
}
| 0
| 56,344,966
|
#include <iostream>
int ans;
int count(int change)
{
if(!change)
return 0;
if(change >= 500){
ans += change / 500;
count(change % 500);
}
else if(change >= 100){
ans += change / 100;
count(change % 100);
}
else if(change >= 50){
ans += change / 50;
count(change % 50);
}
else if(change >= 10){
ans += change / 10;
count(change % 10);
}
else if(change >= 5){
ans += change / 5;
count(change % 5);
}
else if(change >= 1){
ans += change / 1;
count(change % 1);
}
}
int main()
{
int pay;
while(1){
ans=0;
std::cin >> pay;
if(!pay)
break;
int change = 1000 - pay;
count(change);
std::cout << ans << std::endl;
}
}
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
static inline DOUBLE ABS(DOUBLE a) {return 0 <= a ? a : -a;}
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr)
{
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr)
{
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void)
{
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void)
{
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void)
{
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));
}
}
}
}
int main(void)
{
SQWORD sqH1 = inputSQWORD();
SQWORD sqM1 = inputSQWORD();
SQWORD sqH2 = inputSQWORD();
SQWORD sqM2 = inputSQWORD();
SQWORD sqTime = (sqH2 * 60 + sqM2) - (sqH1 * 60 + sqM1);
SQWORD sqK = inputSQWORD();
printf("%lld\n", max((sqTime-sqK), (SQWORD)0));
return 0;
}
| 0
| 43,437,021
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int ara[n+5];
for(int i=0;i<n;i++)cin>>ara[i];
sort(ara,ara+n);
reverse(ara,ara+n);
int sum=0;
for(int i=0;i<k;i++)sum+=ara[i];
cout<<sum<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define VV(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a); i>n; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
int main() {
int a, b, c; cin >> a >> b >> c;
int cnt = 0;
rep(i, a, b + 1) {
if(c % i == 0) ++cnt;
}
P(cnt);
return 0;
}
| 0
| 19,482,754
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int size = 101;
vector<int> numbers(size, 0);
vector<int> result;
for (int n; cin >> n;)
numbers[n]++;
int max = 0;
for (int i = 0; i < size; i++)
if (numbers[i] == max)
result.push_back(i);
else if (numbers[i] > max) {
max = numbers[i];
result.clear();
result.push_back(i);
}
for (int n: result)
cout << n << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <array>
using namespace std;
struct Dice
{
array<int, 6> roll;
void toNorth()
{
array<int, 6> t = roll;
roll[4] = t[0];
roll[0] = t[1];
roll[5] = t[4];
roll[1] = t[5];
}
void toSouth()
{
array<int, 6> t = roll;
roll[1] = t[0];
roll[5] = t[1];
roll[0] = t[4];
roll[4] = t[5];
}
void toWest()
{
array<int, 6> t = roll;
roll[3] = t[0];
roll[0] = t[2];
roll[5] = t[3];
roll[2] = t[5];
}
void toEast()
{
array<int, 6> t = roll;
roll[2] = t[0];
roll[5] = t[2];
roll[0] = t[3];
roll[3] = t[5];
}
void toCCW()
{
array<int, 6> t = roll;
roll[2] = t[1];
roll[4] = t[2];
roll[1] = t[3];
roll[3] = t[4];
}
void toCW()
{
array<int, 6> t = roll;
roll[3] = t[1];
roll[1] = t[2];
roll[4] = t[3];
roll[2] = t[4];
}
int serchRight(int upper, int front)
{
for(int i = 0; i < 2; i++)
{
for(int j = 0; j < 4; j++)
{
if(roll[0] == upper) {
for(int k = 0; k < 4; k++)
{
if(roll[1] == front)
return roll[2];
else
toCW();
}
}
toNorth();
}
toCW();
}
return 9999;
}
void print()
{
for(int i = 0; i < 6; i++)
{
cout << "[" << i << "]:" << roll[i] << " ";
}
cout << endl;
}
};
int main()
{
int count;
Dice dice;
for (int i=0; i<6; i++) {
cin >> dice.roll[i];
}
cin >> count;
for (int i=0; i<count; i ++ ) {
int n1,n2;
cin >> n1 >> n2;
cout << dice.serchRight(n1,n2) << endl;
}
return 0;
}
| 0
| 7,066,384
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int mod=1e9+7;
int fac[100005];
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int compute(int a,int b)
{
if(a<b)
return 0;
int z=(fac[b]*fac[a-b])%mod;
z=modInverse(z,mod);
z=fac[a]*z;
z%=mod;
return z;
}
signed main()
{
int n;
cin>>n;
fac[0]=1;
for (int i = 1; i <=n+1 ; ++i) {
fac[i]=(fac[i-1]*i)%mod;
}
int a[n+2];
int mm[n+2]={0};
int ind1,ind2;
n++;
for (int i = 1; i <=n ; ++i) {
cin>>a[i];
if(mm[a[i]])
{
ind1=mm[a[i]];
ind2=i;
}
mm[a[i]]=i;
}
for (int j = 1; j <=n ; ++j) {
int ans=(compute(n,j)-compute(n-(ind2-ind1+1),j-1)+mod)%mod;
cout<<ans<<"\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
ll myctoi(char C) {return C - '0';}
char myitoc(ll N) {return '0' + N;}
#define FINALANS(A) {cout << (A) << '\n'; exit(0);}
int main()
{
ll N, K;
cin >> N >> K;
vector<vector<ll>> P(N);
for (ll i = 0; i < N; i++)
{
ll t, d;
cin >> t >> d;
t--;
P.at(t).push_back(d);
}
for (auto &p : P)
{
if (p.empty())
p.push_back(-(K * K + 10));
sort(p.begin(), p.end(), greater<ll>());
}
sort(P.begin(), P.end(),
[](const vector<ll> &a, const vector<ll> &b)
{ return (a.front() > b.front()); });
priority_queue<ll> Q;
ll tmp = 0;
for (ll i = 0; i < K; i++)
{
tmp += P.at(i).front();
for (ll j = 1; j < P.at(i).size(); j++)
{
Q.push(P.at(i).at(j));
}
}
for (ll i = K; i < N; i++)
{
for (ll j = 0; j < P.at(i).size(); j++)
{
Q.push(P.at(i).at(j));
}
}
ll ans = tmp + K * K;
for (ll x = K - 1; x > 0; x--)
{
ll v = P.at(x).front();
ll w = Q.top();
if (v < w)
{
Q.pop(), Q.push(v);
tmp -= v, tmp += w;
}
chmax(ans, tmp + x * x);
}
cout << ans << endl;
}
| 0
| 20,675,758
|
#include <bits/stdc++.h>
using namespace std;
#define fore(i, a, b) for (int i = a, to = b; i < to; i++)
#define foref(i, a, b) for (int i = b - 1, to = a; i >= to; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SZ(v) (int)v.size()
#define pb push_back
typedef long long Long;
typedef pair<int, int> Pair;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
vector<Long> v(n);
fore(i, 0, n) cin >> v[i];
Long ans = 0;
int maxi = 0;
fore(i, 0, n) {
if (v[i] < maxi)
ans += (maxi - v[i]);
else
maxi = v[i];
}
cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
int m , n_min , n_max;
int P[200];
while(true){
int ans, max_gap = 0;
cin >> m >> n_min >> n_max;
if(m == 0 && n_min == 0 && n_max == 0) break;
for(int i = 0 ; i < m ; i++) cin >> P[i];
for(int i = n_min - 1 ; i < n_max ; i++){
if(max_gap <= P[i] - P[i + 1]){
max_gap = P[i] - P[i + 1];
ans = i + 1;
}
}
cout << ans << endl;
}
return 0;
}
| 0
| 50,377,396
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A = 0, W = 0;
cin >> N >> M;
vector<int> a(N, 0), b(N, 0);
for(int i = 0;i < M;i++) {
int p;
string s;
cin >> p >> s;
if(a[p-1] == 0) {
if(s == "AC") {
a[p-1] = 1;
A++;
} else {
b[p-1]++;
}
}
}
for(int i = 0;i < N;i++) {
if(a[i] == 1) W += b[i];
}
cout << A << " " << W << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
vector<int>vec(N);
vector<int>vec2(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
vec2.at(i)=vec.at(i);
}
sort(vec2.begin(),vec2.end());
reverse(vec2.begin(),vec2.end());
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(vec.at(i)==vec2.at(j)){
if(vec2.at(j)==vec2.at(j+1)){
cout <<vec2.at(j)<<endl;
break;
}
}
if(vec.at(i)!=vec2.at(j)){
cout <<vec2.at(j)<<endl;
break;
}
}
}
}
| 0
| 94,588,598
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.insert(c);
for (auto &i : s) d.erase(i);
if (d.size()) {
s += *d.begin();
cout << s << '\n';
return;
}
set<char> g;
while (s.size()) {
char c = s.back();
s.pop_back();
auto it = g.upper_bound(c);
if (it != g.end()) {
s += *it;
cout << s << '\n';
return;
}
g.insert(c);
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) MAIN();
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
const long long INF=1e18;
int main(){
int v,e;
cin >> v >> e;
vector<vector<long long> > dif(101,vector<long long>(101,INF));
for(int i = 0; i < v; i++) dif[i][i] = 0;
for(int i = 0; i < e; i++){
int a,b; cin >> a >> b;
cin >> dif[a][b];
}
for(int k = 0; k < v; k++){
for(int i = 0; i < v; i++){
for(int j = 0; j < v; j++){
if(dif[i][k] == INF || dif[k][j] == INF) continue;
dif[i][j] = min(dif[i][j],dif[i][k] + dif[k][j]);
}
}
}
bool can = false;
for(int i = 0; i < v; i++){
if(dif[i][i] < 0) can = true;
}
if(can) cout << "NEGATIVE CYCLE" << endl;
else{
for(int i = 0; i < v; i++){
for(int j = 0; j < v; j++){
if(dif[i][j] == INF) cout << "INF";
else cout << dif[i][j];
if(j != v-1) cout << ' ';
}
cout << endl;
}
}
return 0;
}
| 0
| 23,699,875
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector <ll> primes;
ll divi[1000005];
vector <ll> fact;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i,j,k,l,m,n,t;
cin >> n;
if(n == 1)
{
cout << 0 << '\n';
return 0;
}
for(i=2;i<1000005;i++)
{
for(j=i+i;j<1000005;j+=i)
{
divi[j] = -1;
}
}
for(i=2;i<1000005;i++)
{
if(divi[i] != -1)
primes.push_back(i);
}
for(i=0;i<primes.size();i++)
{
if(n%primes[i] == 0)
{
l = 0;
while(n%primes[i] == 0)
{
n = n/primes[i];
l++;
}
fact.push_back(l);
}
}
if(n > 1)
fact.push_back(1);
ll ans = 0;
for(i=0;i<fact.size();i++)
{
l = 0;
k = 1;
while(fact[i] >= l)
{
l += k;
k++;
if(fact[i] >= l)
ans++;
else
break;
}
}
cout << ans << '\n';
}
|
#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() {
int n;
cin >> n;
vector<int> A(n), B(n);
rep(i, n) cin >> A[i];
rep(i, n) cin >> B[i];
vector<ll> V;
ll suf = 0, insuf = 0, tot = 0;
rep(i, n) {
int a = A[i] - B[i];
if(a > 0) {
suf += a;
V.push_back(a);
}
if(a < 0) {
insuf += abs(a);
tot++;
}
}
if(suf - insuf < 0) {
cout << -1 << endl;
return 0;
}
sort(ALL(V), greater<ll>());
ll ans = tot;
rep(i, V.size()) {
if(insuf <= 0) break;
insuf -= V[i];
ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 64,233,894
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cmath>
#include<cstdlib>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long LL;
typedef pair<int,int> PII;
#define X first
#define Y second
inline int read()
{
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=x*10+c-'0';c=getchar();}
return x*f;
}
const int maxn=5010;
const LL oo=1ll<<60;
int n,K,p[maxn],cnt;
LL c[maxn],ans=-oo,now_ans;
bool vis[maxn];
vector<LL> V;
int main()
{
n=read();K=read();
for(int i=1;i<=n;i++)p[i]=read();
for(int i=1;i<=n;i++)c[i]=read();
for(int i=1;i<=n;i++)
{
int now=i;
LL pre=c[now];
V.clear();
V.push_back(pre);
now=p[now];
while(now!=i)pre+=c[now],V.push_back(pre),now=p[now];
int sz=V.size();
for(int j=0;j<sz && K-(j+1)>=0;j++)
ans=max(ans,V[j]+((K-(j+1))/sz)*max(pre,0LL));
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N; cin >> N;
string s; cin >> s;
ll l = 0, r = 0;
ll cnt = 0;
rep(i, s.size()) {
switch(s[i]) {
case '(':
cnt ++;
break;
case ')':
cnt --;
if(cnt < 0) {
l ++;
cnt = 0;
}
break;
}
}
cnt = 0;
rep(i, s.size()) {
switch(s[s.size() - i - 1]) {
case ')':
cnt ++;
break;
case '(':
cnt --;
if(cnt < 0) {
r ++;
cnt = 0;
}
break;
}
}
rep(i, l) cout << '(';
cout << s;
rep(i, r) cout << ')';
cout << endl;
}
int main(void)
{
solve();
}
| 0
| 20,219,122
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <stack>
#define rep(x,to) for(x=0;x<to;x++)
#define rep2(x,from,to) for(x=from;x<to;x++)
using namespace std;
int main(void){
stack<int> stk;
int ww;
while(cin >> ww){
if(ww != 0){
stk.push(ww);
}else{
cout << stk.top() << endl;
stk.pop();
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define REP(i,x) for(int i=0,i##_len=(x);i<i##_len;++i)
#define rep(i,a,b) for(int i=(a),i##_len(b);i<i##_len;++i)
#define All(x) begin(x),end(x)
#define rAll(x) rbegin(x),rend(x)
using namespace std;
using ll = long long;
int main(){
ll n,m,d;cin>>n>>m>>d;
ll ans=0;
if(d<=n){
if(d==0) ans=n;
else if(2*d<=n) ans=d+2*(n-2*d)+d;
else ans=2*(n-d);
}
else{
cout<<0<<endl;
return 0;
}
double res=ans*(m-1)/double(n*n);
printf("%.16f\n",res);
}
| 0
| 26,904,191
|
#include<stdio.h>
int main(void) {
int n, a[100][100] = {0}, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &u);
scanf("%d", &k);
for (j = 0; j < k; j++)
{
scanf("%d", &v);
a[u - 1][v - 1] = 1;
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
printf("%d", a[i][j]);
if (j != n - 1) printf(" ");
}
printf("\n");
}
return 0;
}
|
#include<stdio.h>
int main()
{
int a[55];
int n,k;
for(int i = 0 ; i <= 55 ; i ++ )
{
a[i] = i;
}
scanf("%d%d",&n,&k);
int sum = 0;
int p = 1;
int t = 0;
while(p <= n)
{
p ++ ;
t ++ ;
if(t == k)
{
sum ++ ;
t = 0;
p = (p - k) + 1;
}
}
printf("%d\n",sum);
return 0;
}
| 0
| 72,499,858
|
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#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;
int main() {
int A, B, X;
cin >> A >> B >> X;
cout << (A <= X && X <= A + B ? "YES" : "NO") << endl;
return 0;
}
|
#include<iostream>
#include <cstring>
using namespace std;
int r[105];
int c[105];
int cache[105][105];
int f(int a, int b) {
if (a == b) return 0;
if (cache[a][b] == -1) {
cache[a][b] = 2000000000;
for (int i = a; i < b; i++) {
int res = f(a, i) + f(i + 1, b) + r[a] * c[i] * c[b];
if (res < cache[a][b]) cache[a][b] = res;
}
}
return cache[a][b];
}
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r[i];
cin >> c[i];
}
memset(cache, -1, sizeof(cache));
cout << f(0, n-1) << endl;
}
| 0
| 88,133,337
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define debug(v) cout << #v<< ": " << v <<endl;
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL<<60;
ll M = 1000000007;
int main(){
ll n, m; cin >> n >> m;
vll a(m), b(m);
rep(i, 0, m){
cin >> a[i] >> b[i];
}
vll imos(n+1, 0);
rep(i, 0, m){
imos[a[i]]++;
imos[b[i]]--;
}
ll s = 0;
vll p(n);
rep(i, 1, n){
s += imos[i];
p[i] = s;
}
bool v = true;
rep(i, 1, n){
if(p[i]%2 == 1){
v = false;
}
}
if(v){
prtl("YES");
}else{
prtl("NO");
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {}
void add(int i, T x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i&-i) {
x += d[i];
}
return x;
}
T sum(int l, int r) {
return sum(r-1) - sum(l-1);
}
};
int main()
{
int n, d, a;
cin >> n >> d >> a;
vector<P> p(n);
rep(i,n) cin >> p[i].first >> p[i].second;
sort(p.begin(),p.end());
BIT<ll> bit(n+1);
ll ans = 0;
rep(i,n) {
ll x = p[i].first;
ll h = p[i].second;
h -= bit.sum(i);
if (h <= 0) continue;
ll num = (h+a-1)/a;
ans += num;
ll damage = num*a;
bit.add(i,damage);
int rx = min(x+d*2, 1001001001ll);
int j = upper_bound(p.begin(),p.end(), P(rx+1,-1)) - p.begin();
bit.add(j, -damage);
}
cout << ans << endl;
}
| 0
| 77,834,407
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int S, W;
cin >> S >> W;
cout << ((W >= S) ? "unsafe" : "safe") << "\n";
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main(int argc, char **argv)
{
int D;
cin >> D;
switch (D) {
case 22:
cout << "Christmas Eve Eve Eve" << endl;
break;
case 23:
cout << "Christmas Eve Eve" << endl;
break;
case 24:
cout << "Christmas Eve" << endl;
break;
case 25:
cout << "Christmas" << endl;
break;
}
return 0;
}
| 0
| 92,566,905
|
#include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a), i##_END_ = (b); i <= i##_END_; i++)
#define DNF(i, a, b) for (int i = (a), i##_END_ = (b); i >= i##_END_; i--)
template <typename Tp> void in(Tp &x) {
char ch = getchar(), f = 1; x = 0;
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') ch = getchar(), f = -1;
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= f;
}
template <typename Tp> void out(Tp x) {
if (x > 9) out(x / 10);
putchar(x % 10 + '0');
return;
}
template <typename Tp> Tp Max(const Tp &x, const Tp &y) {return x > y ? x : y;}
template <typename Tp> Tp Min(const Tp &x, const Tp &y) {return x < y ? x : y;}
template <typename Tp> bool chkmax(Tp &x, Tp y) {return x >= y ? 0 : (x=y, 1);}
template <typename Tp> bool chkmin(Tp &x, Tp y) {return x <= y ? 0 : (x=y, 1);}
const int MAXN = 100010;
int n;
int A[MAXN];
int abs(int x) {return x < 0 ? -x : x;}
int main()
{
in(n);
FOR(i, 1, n) in(A[i]);
std::sort(A + 1, A + n + 1);
int min = 0x3f3f3f3f, son;
FOR(i, 1, n - 1) {
if (abs(A[i] - A[n] / 2) <= min) min = abs(A[i] - A[n] / 2), son = A[i];
}
printf("%d %d\n", A[n], son);
return 0;
}
|
#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define int long long
using namespace std;
const int N = 5e5 + 5, mod = 1e9 + 7;
int n, ar[N], cnt[N], l, r, pref[N], len1, len2, fc[N], rf[N];
int binpow (int a, int b)
{
if (b == 0) return 1ll;
if (b & 1)
return a * binpow(a, b - 1) % mod;
int res = binpow(a, b / 2);
return res * res % mod;
}
int Cnk(int n, int k)
{
return fc[n] * rf[k] % mod * rf[n - k] % mod;
}
main ()
{
scanf("%lld", &n);
fc[0] = 1;
rf[0] = binpow( fc[0], mod - 2 );
for (int i = 1; i < N; i++)
{
fc[i] = fc[i - 1] * i % mod;
rf[i] = binpow( fc[i], mod - 2 );
}
for (int i = 1; i <= n + 1; i++)
{
scanf("%lld", &ar[i]);
if (cnt[ ar[i] ])
{
l = cnt[ ar[i] ];
r = i;
}
cnt[ ar[i] ] = i;
}
len1 = l - 1;
len2 = n - r + 1;
for (int k = 1; k <= n + 1; k++)
{
int ans = Cnk(n + 1, k);
if (len1 + len2 >= k - 1)
{
ans -= Cnk(len1 + len2, k - 1);
if (ans < 0)
ans += mod;
}
cout << ans << endl;
}
}
| 0
| 34,786,682
|
#include <stdio.h>
#include <string.h>
int main(void) {
char str[1001], p[1001], state[10];
int a, b, q;
scanf("%s\n%d", str, &q);
for (int i = 1; i <= q; i++) {
scanf("%s", state);
if (strcmp(state, "replace") == 0) {
scanf("%d %d %s", &a, &b, p);
for (int j = 0; j < b - a + 1; j++) {
str[a + j] = p[j];
}
} else {
scanf("%d %d", &a, &b);
if (strcmp(state, "reverse") == 0) {
for (int j = a; j <= b; j++) {
p[j] = str[j];
}
for (int j = a; j <= b; j++) {
str[j] = p[b + a - j];
}
} else {
for (int j = a; j <= b; j++) {
printf("%c", str[j]);
}
printf("\n");
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
typedef long long ll;
int N;
ll a[50];
ll K;
int main() {
cin >> N;
for (int i = 0; i < N; i++)cin >> a[i];
while (true) {
bool update = false;
ll total = 0, dec[50] = {};
for (int i = 0; i < N; i++) {
total += (a[i] / N);
dec[i] = (a[i] / N);
if (a[i] / N != 0)update = true;
}
K += total;
for (int i = 0; i < N; i++) {
a[i] %= N;
a[i] += (total - dec[i]);
}
if (!update)break;
}
cout << K << endl;
return 0;
}
| 0
| 36,821,874
|
#include <iostream>
using namespace std;
int main(int argc, char** argv) {
int x = 0;
int i = 1;
while (cin >> x, x) {
cout << "Case " << i << ": " << x << endl;
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define mk make_pair
typedef long long ll;
typedef long double ld;
ll f(ll n){
ll res = n - n % 4;
for(ll m = res + 1; m <= n; m++){
res ^= m;
}
return res;
}
void solve(){
ll a, b;
cin >> a >> b;
cout << (f(b) ^ f(a - 1)) << "\n";
return;
}
int main(){
IOS;
int t = 1;
for(int i = 1; i <= t; i++){
solve();
}
return 0;
}
| 0
| 98,278,538
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
#define scl1(a) scanf("%lld", &a)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a) printf("%lld\n", a)
#define prl2(a, b) printf("%lld %lld\n", a, b)
#define ssl1(s) scanf(" %[^\n]", s)
#define scd1(a) scanf("%lf", &a)
#define scd2(a, b) scanf("%lf %lf", &a, &b)
#define prd(a) printf("%lf\n", a)
#define prld(a) printf("%Lf\n", a)
#define prcase(cs) printf("Case %lld: ", cs)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cot1(a) cout << a << "\n"
#define cot2(a, b) cout << a << " " << b << "\n"
#define cot3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline cout << "\n"
#define cotminus cout << "-1\n"
#define cot0 cout << "0\n"
#define cotyes cout << "YES\n"
#define cotno cout << "NO\n"
#define cotcase(cs) cout << "Case " << cs << ": "
#define reversed(s) reverse(s.begin(), s.end())
#define asort(s) sort(s.begin(), s.end())
#define dsort(s) sort(s.rbegin(), s.rend())
#define all(s) s.begin(), s.end()
#define uniq(s) s.resize(distance(s.begin(),unique(s.begin(), s.end())))
#define found(s, x) (s.find(x) != s.end())
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define fora(i, a, b) for (i = a; i <= b; i++)
#define forb(i, b, a) for (i = b; i >= a; i--)
#define fori(it, s) for(auto it = s.begin(); it != s.end(); it++)
#define FR ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
#define pi acos(-1)
const ll INF = LLONG_MAX;
const ll SZ = 2e2+5;
const ll mod = 1e9+7;
ll n, k;
ll a[SZ];
ll solve(ll r1, ll r2, ll c) {
ll i, x, sum(0);
priority_queue <ll, vector <ll>, greater<ll> > pq;
fora(i, r1, r2) {
pq.push(a[i]);
}
while(c--) {
if(pq.empty()) break;
x = pq.top();
if(x >= 0) break;
pq.pop();
}
while(!pq.empty()) {
sum += pq.top();
pq.pop();
}
return sum;
}
int main() {
ll cs = 0, tc = 1, x, y, z, i, j, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
string s, s1, s2;
cin2(n, k);
for1(i, n) cin1(a[i]);
for1(i, n) a[n+i] = a[i];
for1(i, n) {
if(i <= k) ans = max(ans, solve(1, i, k-i));
fora(j, i, n+i-1) {
t = j - i + 1;
c = k - t;
if(c < 0 || j < n) continue;
ans = max(ans, solve(i, j, c));
}
}
cot1(ans);
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N; cin>>N;
vector<ll> A(N);
vector<ll> B(N);
rep(i,N) cin>>B[i]>>A[i];
ll ans=0;
rrep(i,N){
B[i]+=ans;
ans+=((B[i]+A[i]-1)/A[i])*A[i]-B[i];
}
cout<<ans<<endl;
}
| 0
| 26,050,140
|
#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];
}
for (int i = n-1; i >= 0; i -= 2) {
cout << a[i] << " ";
}
if (n % 2) {
for (int i = 1; i < n; i += 2) {
cout << a[i] << " ";
}
} else {
for (int i = 0; i < n; i += 2) {
cout << a[i] << " ";
}
}
cout << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=1e5+5;
int ara[MX];
int main(){
int i, j, k;
int n, l;
cin >> n >> l;
for(i=0; i<n; ++i){
cin >> ara[i];
}
for(i=0; i+1<n; ++i){
if(ara[i]+ara[i+1]>=l) break;
}
if(i>=n-1){
cout << "Impossible" << endl;
return 0;
}
cout << "Possible" << endl;
for(j=0; j<i; ++j) cout << j+1 << " ";
for(j=n-2; j>i; --j) cout << j+1 << " ";
cout << i+1 << endl;
}
| 0
| 95,100,394
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
ll odd(ll x){ return (x+1)/2 % 2;}
ll cal(ll x){
if(x%2==1) return odd(x);
else return odd(x+1) ^ (x+1);
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = cal(b) ^ cal(a-1);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iterator>
#include <set>
#include <map>
using namespace std;
const double PI=acos(-1);
int main(){
long n;
cin >> n;
vector<long> l(n);
for(int i = 0; i < n; i++){
cin >> l[i];
l[i]--;
}
long cnt = 0;
for(int i = 0; i < n; i++){
if(i == l[l[i]]) cnt++;
}
cnt /= 2;
cout << cnt << endl;
return 0;
}
| 0
| 7,747,957
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n,ans=0,r[4001]={},g[4001]={},b[4001]={};;
string s;
cin >> n >> s;
rep(i,n){
if(s[i]=='R') r[i+1] = r[i] + 1;
else r[i+1] = r[i];
if(s[i]=='G') g[i+1] = g[i] + 1;
else g[i+1] = g[i];
if(s[i]=='B') b[i+1] = b[i] + 1;
else b[i+1] = b[i];
}
rep(i,n){
for(int j=i+1;j<n;j++){
int a = 'R'+'B'+'G';
if(s[i]==s[j]) continue;
char d = a-s[i]-s[j];
if(d=='R') ans += r[n]-r[j];
if(d=='G') ans += g[n]-g[j];
if(d=='B') ans += b[n]-b[j];
if(s[2*j-i]==d) ans--;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
string s,t; cin>>s>>t;
ll n=s.size(), m=t.size();
for(ll i=n-m+1; i>=0; i--){
bool tmp=true;
rep(j,m){
if(!(s[i+j]=='?'||s[i+j]==t[j])) tmp=false;
}
if(tmp){
rep(j,m){
s[i+j]=t[j];
}
rep(j,n) if(s[j]=='?') s[j]='a';
cout<<s<<endl;
return 0;
}
}
cout<<"UNRESTORABLE"<<endl;
}
| 0
| 48,333,439
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 0; 7*i<=n; i++){
if((n - 7*i)%4==0){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
const ll N = 1e5;
const ll M = 1e6;
const ll A = 1e7;
const ll inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10;
const double pi = 3.141592653589793238463;
const ll lx[4] = {0, 0, 1, -1};
const ll ly[4] = {1, -1, 0, 0};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
ll power(ll a, ll b = MOD-2){
if(b == 0) return 1;
ll r = power(a, b/2);
r = (r*r)%MOD;
if(b%2 == 1) r = (r*a)%MOD;
return r;
}
void solve()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
if(i == 0 && a[i] != 0) ANS(0);
}
sort(all(a));
if(a[0] != 0) ANS(0);
if(a[0] == a[1]) ANS(0);
rep(i, n-1)
{
if(a[i] != a[i+1] && a[i+1] - a[i] != 1) ANS(0);
}
ll ans = 1, k = -1;
for(ll i = 0, j = 0; i < n; ){
while(a[j] == a[i] && j < n) j++;
if(k == -1) {}
else{
ans = (ans* power(k, j-i)) %MOD;
}
k = j-i; i = j;
}
cout << ans;
}
int main(int argc, char const* argv[])
{
ll t = 1;
while(t--) {
solve();
}
return 0;
}
| 0
| 3,655,730
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__);
void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
cin >> t;
in(u...);
}
void out() {
cout << endl;
}
template <typename T, class... U>
void out(const T& t, const U&... u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
#define rep(i, n) for (long long i = 0; i < n; i++)
void solve();
#ifndef ONLINE_JUDGE
#include "./lib.hpp"
#endif
void solve() {
ini(N);
vll c(100001, 0);
rep(i, N) {
ini(A);
c[A]++;
}
rep(i, 100001) {
if (c[i] <= 2)
continue;
if (c[i] % 2 == 1)
c[i] = 1;
else
c[i] = 2;
}
ll ret = count_if(c.begin(), c.end(), [](auto x) { return x != 0; });
if (count(c.begin(), c.end(), 2) % 2 == 1)
out(ret - 1);
else
out(ret);
}
|
#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define MP make_pair
const ll MOD = 1e9+7;
ll INF = 1e18;
void chmin(ll &a,ll b){if(a>b)a=b;}
void chmax(ll &a,ll b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
void ans(bool x,ll y,ll z){if(x)cout<<y<<endl;else cout<<z<<endl;}
void anss(bool x,string y,string z){if(x)cout<<y<<endl;else cout<<z<<endl;}
ll gcd(ll x,ll y){ll r;while((r=x%y)!=0){x=y;y=r;}return y;}
int main(){
ll i,j,o;
ll res=0,res1=0,res2=INF,buf=0,buf1=0,buf2=0,buf3=0,buf4=0,sum=0;
ll l,r;
bool judge = true;
ll n,k;
cin>>n>>k;
vector<ll> a;
a.push_back(0);
for(i=0;i<n;i++){
cin>>buf;
if(buf<k){
a.push_back(buf);
res+=buf;
}
}
sort(ALL(a));
l=0;r=a.size()-1;
while(abs(l-r)>1){
buf=(l+r)/2;
vector<bool> dp(k,false);
dp[0]=true;
for(i=0;i<a.size();i++){
if(buf!=i){
for(j=k-1;j>=0;j--){
if(dp[j]&&j+a[i]<k)dp[j+a[i]]=true;
}
}
}
judge=false;
for(i=k-1;i>=0;i--){
if(dp[i]&&i+a[buf]>=k){
judge=true;
break;
}
}
if(judge)r=buf;
else l=buf;
}
if(res<k)l=r;
cout<<l<<endl;
return 0;
}
| 0
| 44,934,179
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,k;
cin >> n >> k;
long long mod=1000000007;
long long ans=0;
long long a[n+2];
a[0]=0;
for(long long i=1;i<=n+1;i++){
a[i]=a[i-1]+i-1;
}
for(long long i=k;i<=n+1;i++){
ans+=(((a[n+1]-a[n-i+1])-(a[i]-a[0])+1)%mod);
ans=ans%mod;
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <regex>
#include <random>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exout(x) printf("%.10f\n", x)
const double pi = acos(-1.0);
const ll MOD = 1000000007;
const ll INF = 1e10;
const ll MAX_N = 1010;
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)return 0;
return (x / gcd(x, y) * y);
}
ll dp[201010][2];
ll dx[4] = { 0,0,-1,1 };
ll dy[4] = { -1,1,0,0 };
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll left = 0;
ll right = 0;
rep(i, n) {
if (s[i] == '(') {
left++;
}
else {
right++;
if (left > 0) {
left--;
right--;
}
}
}
string left2;
string right2;
rep(i, left) {
right2 += ')';
}
rep(i, right) {
left2 += '(';
}
left2 += s;
left2 += right2;
cout << left2 << endl;
return 0;
}
| 0
| 19,242,878
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<bitset<20>> vbi;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
ll modpow(ll x, ll n, ll mod = MAX)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll factorial(ll n)
{
if (n > 0)
return n * factorial(n - 1);
else
return 1;
}
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
void Main()
{
ll n, h; cin >> n >> h;
vll a(n), b(n);
ll A = 0;
rep(i, n)
{
cin >> a[i] >> b[i];
A = max(A, a[i]);
}
sort(all(b));
reverse(all(b));
ll flag = 0;
rep(i, n)
{
if(b[i] > A)
{
flag++;
h -= b[i];
}
else break;
if(h <= 0) fin(flag);
}
fin(flag + (h + A - 1) / A);
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int n;
cin >> n;
vector<ll>a(100000);
int cnt = 0;
rep(i, 0, n){
ll b;
cin >> b;
if(b>100000){
cnt++;
continue;
}
b--;
a[b]++;
}
rep(i, 0, 100000){
if(a[i]==0)continue;
if(a[i]>i+1)cnt += a[i]-(i+1);
if(a[i]<i+1) cnt += a[i];
}
cout << cnt << endl;
}
| 0
| 55,642,027
|
#include <iostream>
#include <cstring>
#include <cmath>
#define Rep(i, b, e)\
for (int i = (int)b; i < (int)e; i++)
using namespace std;
const int MAXN = 999999;
bool isPrime[MAXN];
int countPrime(int n) {
memset(isPrime, true, sizeof isPrime);
Rep(i, 0, 1000)
isPrime[i] = true;
isPrime[0] = false;
isPrime[1] = false;
Rep(i, 2, n) {
Rep(k, 2, n) {
if (i*k > n)
break;
isPrime[i*k] = false;
}
}
int primeCount = 0;
int j = 0;
while (j <= n) {
if (isPrime[j]) {
primeCount++;
}
j++;
}
return primeCount;
}
int num;
int main()
{
while (cin >> num) {
cout << countPrime(num) << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e10
typedef long long ll;
typedef long double ld;
int main(){
string x;
cin>>x;
string head, tail;
ll n=SIZE(x);
if(n<3){
cout<<0<<endl;
}else{
head=x.substr(0,n-2), tail=x.substr(n-2,2);
ll head_num=stoll(head), tail_num=stoll(tail);
cout<<((head_num*5>=tail_num)?1:0)<<endl;
}
return 0;
}
| 0
| 47,658,745
|
#include <stdio.h>
int main() {
int hoge = 0, ahoge = 0;
scanf("%d %d", &hoge, &ahoge);
printf("a %s b\n", hoge < ahoge ? "<" : hoge == ahoge ? "==" : ">");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum=0;
for(int i=0; i<n; i++){
cin >> a[i];
sum += a[i];
}
int cnt=0;
rep(i,n){
if(a[i]*100 >= 25*sum/m){
cnt++;
}
}
if(cnt >= m) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 41,817,905
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string str;
string str2;
int n,s,s2;
int cou[1024][1024] = {{}};
int max = 0;
cin >> n;
for(int i = 0;i < n;i++){
cin >> str >> str2;
str = ' ' + str;
str2 = ' ' + str2;
s = str.size();
s2 = str2.size();
for(int j = 1;j < s;j++){
for(int k = 1;k < s2;k++){
if(str[j] == str2[k]){
cou[j][k] = cou[j - 1][k - 1] + 1;
if(cou[j][k] > max) max = cou[j][k];
}
else if(cou[j - 1][k] > cou[j][k - 1]){
cou[j][k] = cou[j - 1][k];
}
else {
cou[j][k] = cou[j][k - 1];
}
}
}
cout << max << endl;
max = 0;
for(int j = 0;j <= s;j++){
for(int k = 0;k <= s2;k++){
cou[j][k] = 0;
}
}
}
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= int(a); i--)
#define WRAP(y, x, h, w) (0 <= y && y < h && 0 <= x && x < w)
#define ALL(x) (x).begin(), (x).end()
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
REP(i, n)
{
cin >> a[i];
a[i]--;
}
vector<ll> b(n,0);
REP(i,n){
b[a[i]]++;
}
vector<ll> c(n);
ll ans=0;
REP(i,n){
c[i]=b[i]*(b[i]-1)/2;
ans+=c[i];
}
REP(i,n){
cout<<ans-c[a[i]]+(c[a[i]]*(b[a[i]]-2)/b[a[i]])<<endl;
}
}
| 0
| 3,521,070
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
typedef pair<ll,ll> l_l;
typedef pair<int,int> i_i;
const ll mod=1e9+7;
const int inf=1<<30;
ll dp[100100][2];
int main(){
string s; cin >> s;
int n=s.size();
dp[0][0]=1;
rep(i,n){
if(s[i]=='1'){
dp[i+1][0]=dp[i][0]*2%mod;
dp[i+1][1]=(dp[i][1]*3+dp[i][0])%mod;
}
else{
dp[i+1][0]=dp[i][0];
dp[i+1][1]=dp[i][1]*3%mod;
}
}
cout << (dp[n][0]+dp[n][1])%mod << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9+7;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<ll> arr(n+1, 0);
arr[0] = 0;
arr[1] = 1;
for (int i = 2; i <= n; i++) {
arr[i] = (arr[i-1] + i) % mod;
}
for (int i = k; i <= n; i++) {
ll sm = arr[i-1], lr = (((arr[n] - arr[n-i])%mod) + mod) % mod;
ans = (ans + ((lr - sm) % mod + 1) % mod) % mod;
}
cout << ((ans+1) % mod + mod) % mod << endl;
}
| 0
| 91,818,511
|
#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,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF=1e18;
const int MOD=1e9+7;
signed main(){
int n;cin>>n;
int ans=0;
if(n==1){
cout<<0<<endl;
return 0;
}
int c=n;
map<int,int>memo;
memo.clear();
for(int i=2;i<=sqrt(n);i++){
while(c%i==0){
c/=i;
memo[i]++;
}
}
if(c!=1)memo[c]++;
for(auto v:memo){
int sum=0;
for(int i=1;sum+i<=v.second;i++){
ans++;
sum+=i;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define EPS (1e-10)
#define equals(a, b) (fabs((a)-(b)) < EPS)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vi A(N);
rep(i,N) {
cin >> A[i];
}
ll m = 1000;
rep(i,N-1) {
ll s = 0;
if(A[i]<A[i+1]) {
s = m / A[i];
}
m += (A[i+1]-A[i])*s;
}
cout << m << endl;
return 0;
}
| 0
| 97,337,808
|
#include<iostream>
#include<cmath>
#include<iomanip>
int main(){
int a, b, C;
std::cin >> a >> b >> C;
std::cout << std::fixed << std::setprecision(8) << a*b*sin(C*M_PI/180)/2 << std::endl;
std::cout << std::fixed << std::setprecision(8) << a+b+sqrt(pow(a,2)+pow(b,2)-2*a*b*cos(C*M_PI/180)) << std::endl;
std::cout << std::fixed << std::setprecision(8) << b*sin(C*M_PI/180) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C,a,b,c,K;
cin >> A >> B>>C>>K;
for(int i=0;i<=K;i++)
for(int j=0;j<=K-i;j++)
for(int s=0;s<=K-i-j;s++){
a = (i==0)? A : A*pow(2.0,(double)i);
b = (j==0)? B : B*pow(2.0,(double)j);
c = (s==0)? C : C*pow(2.0,(double)s);
if(a<b&&b<c){ cout << "Yes" << endl; return 0; }
}
cout << "No" << endl;
}
| 0
| 56,481,439
|
#include <iostream>
using namespace std;
int a,b;
int main()
{
cin >> a;
cin >> b;
const char* gg = ((a * b) % 2 == 0) ? "Even" : "Odd";
cout << gg;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1 << 30;
double ans = 0;
int main()
{
ll n;
cin >> n;
ll t[n] = {};
ll v[n] = {};
double co[50010]={};
double ma[50010]={};
double mi[50010]={};
rep(i, n)
{
cin >> t[i];
}
rep(i, n)
{
cin >> v[i];
}
co[0]=0;
ll a=t[0],b=0;
rep1(i,50010){
if(i<a*2)co[i]=v[b];
else {
b++;
if(b>=n){co[i]=0;break;}
else co[i]=min(v[b],v[b-1]);
a+=t[b];
}
}
rep1(i,50010){
ma[i]=min(ma[i-1]+0.5,co[i]);
}
for (ll i = 50008; i >=0; i--){
mi[i]=min(mi[i+1]+0.5,co[i]);
}
rep1(i,50009){
ans+=(double)min(ma[i],mi[i]);
}
double answer=ans/2.0;
cout << fixed << answer << endl;
return 0;
}
| 0
| 27,520,299
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
const int MAX = 200;
const int MOD = 1000000007;
ll fact[MAX], inv_fact[MAX], inv[MAX];
void init() {
fact[0] = 1;
fact[1] = 1;
inv[0] = 1;
inv[1] = 1;
inv_fact[0] = 1;
inv_fact[1] = 1;
repi(i, 2, MAX){
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
inv_fact[i] = inv_fact[i - 1] * inv[i] % MOD;
}
}
ll nCk(int n, int k) {
ll x = fact[n];
ll y = inv_fact[n-k];
ll z = inv_fact[k];
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return x * ((y * z) % MOD) % MOD;
}
int main(){
init();
int N, M;
cin >> N >> M;
cout << nCk(N, 2) + nCk(M, 2) << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
}
else {
ll ans = 2018;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
}
| 0
| 52,309,562
|
#include<bits
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
int n, m,x,y; cin >> n >> m;
vector<int> p(n);
UnionFind tree(n);
rep(i,n)cin >>p[i];
rep(i,m){
cin >> x>>y;x--;y--;
tree.unite(x,y);
}int ans = 0;
rep(i,n){
if(tree.same(i,p[i]-1))ans++;
}cout << ans << endl;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 0;
int l = 0,r = s.size() - 1;
while(l < r)
{
if(s[l] == s[r])
{
l++;
r--;
}
else if(s[l] == 'x')
{
l++;
ans++;
}
else if(s[r] == 'x')
{
r--;
ans++;
}
else
{
ans = -1;
break;
}
}
cout << ans << "\n";
return 0;
}
| 0
| 89,929,029
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for(int i=0;i<n;i++)
#define ms(x) memset(x,0,sizeof(x))
#define ms2d(x,m,n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define uniq(vec) vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())))
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pi pair<int,int>
#define tc(t) int t;cin>>t;while(t--)
#define bits(n) __builtin_popcount(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int> >
#define ins insert
#define ALL(v) v.begin(),v.end()
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numeric_limits<x>::min()
#define Inf INFINITY
#define minv(v) *min_element(v.begin(),v.end())
#define maxv(v) *max_element(v.begin(),v.end())
#define fi first
#define se second
#define PI acos(-1)
#define sz(a) (int)a.size();
#define IOS ios::sync_with_stdio(false);
using namespace std;
int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a);}
typedef tree<pair<int, int>,null_type,less<pair<int, int>>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1,-1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const long long MOD = 1000000007;
double sq(double x) {return x*x;}
template<typename T>inline T Bigmod(T base, T power, T MOD){
T ret=1;
while(power)
{
if(power & 1)ret=(ret*base)%MOD;
base=(base*base)%MOD;
power>>=1;
}
return ret;
}
bool sortinrev(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.first > b.first);
}
signed main()
{
IOS
int n,r;
cin>>n>>r;
if(n>=10)cout << r << endl;
else{
cout << r+(100*(10-n)) << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#include <time.h>
#include <functional>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<ll, ll, ll, ll> tlglglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
typedef vector<ll> vll;
typedef vector< vector<ll> > matrix;
typedef unsigned int uint;
typedef unsigned long long ull;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
#define REP(i, x, y) for(ll i = (ll)x; i < (ll)y; i++)
#define DREP(i, x, y, d) for(ll i = (ll)x; i < (ll)y; i += (ll)d)
#define PER(i, x, y) for(ll i = (ll)x; i > (ll)y; i--)
#define DPER(i, x, y, d) for(ll i = (ll)x; i > (ll)y; i -= (ll)d)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-12;
void yesno(bool ok, string yes = "Yes", string no = "No") {
if (ok) {
cout << yes << endl;
} else {
cout << no << endl;
}
}
vll nums(300010, 0);
vll ds(300010, 0);
vll kds(300010, 0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vll A(N);
REP(i, 0, N) {
cin >> A[i];
nums[A[i]]++;
}
REP(i, 0, N + 1) {
ds[nums[i]]++;
}
REP(i, 0, N + 1) {
kds[i] = ds[i] * i;
if (i > 0) {
kds[i] += kds[i - 1];
}
}
PER(i, N - 1, -1) {
ds[i] += ds[i + 1];
}
vll f(N + 1);
f[0] = inf;
REP(i, 1, N) {
f[i] = (kds[i] + i * ds[i + 1]) / i;
}
f[N] = kds[N] / N;
ll ans = N;
REP(i, 1, N + 1) {
while (i > f[ans]) {
ans--;
}
cout << ans << endl;
}
}
| 0
| 52,001,461
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define MAX 510000
#define INF 1<<30
#define LINF (ll)1<<62
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(ll i=(a); i<(b); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main(){
ll n; cin >> n;
char s[n][n];
rep(i,n) rep(j,n) cin >> s[i][j];
ll ans = 0;
rep(b,n){
bool flag = true;
rep(i,n-1){
REP(j,i,n){
if(s[i%n][(j+b)%n]!=s[j%n][(i+b)%n]){
flag = false;
break;
}
if(!flag) break;
}
if(!flag) break;
}
if(flag) ans++;
}
cout << ans*n << endl;
}
|
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> T(N);
rep(i, N) { cin >> T[i]; }
vector<int> A(N);
rep(i, N) { cin >> A[i]; }
int Tpeak;
int prev = 0;
vector<bool> Lower(N, true);
rep(i, N) {
if (prev < T[i]) Tpeak = i;
if (prev != T[i]) Lower[i] = false;
prev = T[i];
}
int Apeak;
prev = 0;
for (int i = N - 1; i >= 0; --i) {
if (prev < A[i]) Apeak = i;
if (prev != A[i]) Lower[i] = false;
prev = A[i];
}
if (T[Tpeak] != A[Apeak] || Apeak < Tpeak) {
cout << 0 << endl;
return 0;
}
int64_t answer = 1;
int64_t mod = 1e9 + 7;
rep(i, N) {
if (!Lower[i]) continue;
answer *= (int64_t)min(T[i], A[i]);
answer %= mod;
}
cout << endl;
cout << answer << endl;
return 0;
}
| 0
| 69,056,955
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
ll n, m;
cin >> n >> m;
if (n == 1 && m == 1){
cout << 1 << endl;
}
else if (n == 1){
cout<< m-2 << endl;
}else if (m == 1){
cout << n-2 << endl;
}else{
cout << (n-2)*(m-2) << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
const ll T = 1e9+7;
int main(){
vector<ll> t(4);
ll w[4][4]={};
ll a,b;
for(int i=0;i<3;i++){
cin >> a >> b;
if(w[a-1][b-1]!=0||w[b-1][a-1]!=0){
cout << "NO";
return 0;
}
w[a-1][b-1]++;w[b-1][a-1]++;
t[a-1]++;t[b-1]++;
}
sort(t.begin(),t.end());
if(t[0]==1&&t[1]==1&&t[2]==2&&t[3]==2) cout << "YES";
else cout << "NO";
return 0;
}
| 0
| 58,743,676
|
#include <iostream>
using namespace std;
int main() {
string S,T;
int N,syutsuryoku;
cin >> S;
cin >> T;
N = S.size();
for (int i=0;i<(N-1);i++) {
if (S.at(i) != T.at(i)) {
syutsuryoku++;
}
}
if (syutsuryoku != 0) cout << syutsuryoku+1 << endl;
else cout << syutsuryoku << endl;
}
|
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll =unsigned long long;
using dl = long double;
const ll m=1000000007;
ll fac[1000001];
void pre(){
fac[0]=fac[1]=1;
for(int i=2;i<=1000001;i++)
{
fac[i]=(fac[i-1]*1LL*i)%m;
}
}
ll power(ll a,ll n){
ll res=1;
while(n){
if(n%2)
res = (res*1LL*a)%m;
n/=2;
a=(a*1LL*a)%m;
}
return res;
}
ll nCr(ll n,ll r){
ll res= fac[n];
res = (res*1LL*power(fac[r],m-2))%m;
res= (res*1LL*power(fac[n-r],m-2))%m;
return res;
}
int main()
{
pre();
ll x,y;
cin>>x>>y;
int z=max(x,y);
int necr=x;
int necc=y;
ll ans=0;
ll one = (2*y-x)/3;
ll two = (2*x-y)/3;
if(one<0||two<0||(2*y-x)%3!=0)cout<<0<<endl;
else if(one+two==0||one+two<0||(2*x-y)%3!=0)cout<<0<<endl;
else{
ll a= one;
ll b= two;
ll f=1;ll nos = a+b;
cout<<nCr(nos,a);
}
return 0;
}
| 0
| 100,792,199
|
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector< pair<int,int> > vii;
const double pi = 2*acos(0) ;
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define fi first
#define se second
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forab(i,a,b) for(int i=a;i<=b;i++)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define sq(a) (a)*(a)
#define nw "\n"
#define abs(x) fabs(x)
#define pcase(z,x) cout<<"Case "<<z<<": "<<x<<"\n"
int main()
{
int i,n,p;
cin>>n;
vi a(100010,0);
for0(i,n){
cin>>p;
a[p]++;
}
int t,x = 0;
for(i=1 ; i<=100000 ; i++){
t = 0;
t += a[i];
t += a[i-1];
t += a[i+1];
x = max(x,t);
}
cout<<x<<nw;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p, q;
cin >> a >> b;
for(int i = 0; i < a; i++){
bool r = 0;
for(int j = 0; j < b; j++){
string s;
cin >> s;
if(s == "snuke"){
p = i + 1;
q = j;
r = 1;
break;
}
}
if(r)
break;
}
char c = 'A' + q;
cout << c << p << endl;
}
| 0
| 49,015,040
|
#include<bits/stdc++.h>
#define ll long long int
#define l(i,a,b) for(ll i=a;i<b;i++)
#define PI 3.14159265358979323846
using namespace std;
int main(){
ll n,m,sum=0;
cin>>n>>m;
ll a[m];
l(i,0,m) cin>>a[i],sum+=a[i];
if(sum>n) cout<<-1<<"\n";
else{
cout<<n-sum<<"\n";
}
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template < class T > using Tree = tree < T , null_type , less < T > , rb_tree_tag , tree_order_statistics_node_update >;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair < ll , ll > pll;
#define X first
#define Y second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (ll)(x.size())
#define sep ' '
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbl_io(x) cout << fixed << setprecision(x);
const int N = 1e5 + 10;
const ll mod = 1e9 + 7;
const ll inf = 1e18 + 10;
ll ans[10], h, w;
map < pll , ll > mp;
void upd(ll x, ll y){
if (!(1 <= x && x <= h && 1 <= y && y <= w && x + 2 <= h && y + 2 <= w))
return ;
ll t = 0;
for (ll i = 0; i < 3; i ++)
for (ll j = 0; j < 3; j ++)
if (mp[make_pair(x + i, y + j)])
t ++;
ans[t] ++;
ans[t - 1] --;
}
int main(){
fast_io
cin >> h >> w;
ans[0] = (h - 2) * (w - 2);
ll q; cin >> q;
while (q --){
ll x, y;
cin >> x >> y;
mp[make_pair(x, y)] = 1;
for (ll i = 0; i < 3; i ++)
for (ll j = 0; j < 3; j ++)
upd(x - i, y - j);
}
for (ll i = 0; i < 10; i ++)
cout << ans[i] << '\n';
return 0;
}
| 0
| 88,179,940
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define SIZE 1000001
#define pib pair<int,bool>
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin>>n;
vector<int> num(n);
for(int i=0;i<n;i++){
cin>>num[i];
}
sort(num.begin(), num.end());
vector<bool> isPrime(SIZE, true);
vector<pib> ans;
for(int i=0;i<n;i++){
bool check = true;
int sqrtn = (int)sqrt(num[i]);
for(int j=1;j<=sqrtn && check;j++){
if(!(num[i] % j)){
if(!isPrime[j]) check = false;
if(!isPrime[num[i] / j]){
check = false;
if(ans.back().first == num[i]) ans.back().second = true;
}
}
}
if(check){
ans.push_back(make_pair(num[i], false));
}
isPrime[num[i]] = false;
}
int val = 0;
for(int i=0;i<ans.size();i++){
if(!ans[i].second) val++;
}
cout<<val;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = (1LL << 61);
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
int ans = 0;
rep(i, n - 1) {
if (s[i] != s[i + 1]) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 15,198,732
|
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i=init;i<(n);i++)
int main() {
string s;
cin >> s;
int ans = INF;
repi(i, s.size() - 2, 0) {
int num = 0;
repi(j, i + 3, i) {
num += pow(10,i - j + 2) * (s[j] - '0');
}
ans = min(ans,abs(753 - num));
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(){
double a, b ,C;
cin >>a >> b >>C;
double C_r = C * M_PI /180;
double c = pow( (pow(a,2)+pow(b,2)-(2.0*a*b*cos(C_r))),0.5);
double S = (a * b * sin(C_r)) /2;
double L = a + b + c;
double h = S / a * 2;
cout << fixed << S <<" "<< L<< " "<< h <<endl;
return 0;
}
| 0
| 57,239,653
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int Min(int a,int b,int c){
return min(a,min(b,c));
}
int main(){
string X,Y;
cin>>X>>Y;
vector<vector<int> > v(X.size()+1,vector<int>(Y.size()+1,0));
for(int i=0;i<=X.size();i++) v[i][0]=i;
for(int i=0;i<=Y.size();i++) v[0][i]=i;
for(int i=0;i<X.size();i++){
for(int j=0;j<Y.size();j++){
v[i+1][j+1] = Min(v[i][j]+(X[i]!=Y[j]),v[i+1][j]+1,v[i][j+1]+1);
}
}
cout<<v[X.size()][Y.size()]<<endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s; cin>>s;
ll K; cin>>K;
if(s.size()==1){
cout<<K/2<<endl;
return 0;
}
vector<ll>a(110);
char c;
ll cnt;
ll j=0;
rep(i,s.size()){
c=s[i];
cnt=1;
while(s[i+1]==c){
cnt++;
i++;
if(i>=s.size()-1)break;
}
if(cnt>=2){
a[j]=cnt;
j++;
}
}
ll sum=0;
rep(i,j){
sum+=a[i]/2;
}
ll b,d;
if(s[0]!=s[s.size()-1]){
cout<<sum*K<<endl;
}
else{
c=s[0];
cnt=1;
ll i=0;
while(s[i+1]==c){
cnt++;
i++;
if(i==s.size()-1)break;
}
b=cnt;
i=s.size()-1;
cnt=1;
while(s[i-1]==c){
cnt++;
i--;
if(i==0)break;
}
d=cnt;
if(b+d>=s.size())cout<<(s.size()*K)/2<<endl;
else cout<<sum*K-(K-1)*((b/2)+(d/2)-((b+d)/2))<<endl;
}
}
| 0
| 64,534,592
|
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string.h>
#include<string>
#include<functional>
#include<iomanip>
using namespace std;
#define INF 1<<21
#define DIV 1000000007
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax, (m || nmin || nmax)) {
int p[10005];
int gap = 0, gap1=0, gap2=0;
int ans = 0;
for (int i = 1; i <= m; i++) {
cin >> p[i];
}
for (int i = nmin; i <= nmax; i++) {
if (gap <= p[i] - p[i+1]) {
gap = p[i] - p[i + 1];
ans = i;
}
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int main(){
int a,b,c,d;
cin >> a >> b>> c >>d;
if (b < c) cout << 0;
else if(a < c ) cout << min(b,d)-c;
else cout << max(min(b,d)-a,0);
return 0;
}
| 0
| 20,753,423
|
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define PB push_back
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define NMAX (int)(1e3+5)
#define INF 0x3f3f3f
#define MOD (int)(1e9+7)
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
int N, M, dp[NMAX][NMAX];
bool G[NMAX][NMAX];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> N >> M;
for (int i = 1; i <= N; i++) {
string s; cin >> s;
for (int j = 1; j <= M; j++) {
if (s[j-1] == '.') {
dp[i][j] = (i==1 && j==1);
dp[i][j] += dp[i-1][j] + dp[i][j-1];
dp[i][j] %= MOD;
}
}
}
cout << dp[N][M] << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace std;
typedef pair<long long, long long> P;
vector<P> prime_factorize(long long n)
{
vector<P> res;
for (long long p = 2; p * p <= n; ++p)
{
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0)
{
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
long long gcd(long long x, long long y)
{
if (y == 0)
{
return x;
}
else
{
return gcd(y, x % y);
}
}
const int MOD = 1000000007;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
int main()
{
int n;
cin >> n;
string s;
cin >> s;
ll r = 0, g = 0, b = 0;
for(auto c:s){
if(c=='R'){
r++;
}else if(c=='G'){
g++;
}else{
b++;
}
}
ll all = r * g * b;
ll equel = 0;
for (int i = 0; i < n ; i++)
{
for (int j = i + 1; j < n ;j++){
int k = 2 * j - i;
if(k>=n){
continue;
}
if(s[i]==s[j]||s[i]==s[k]||s[j]==s[k]){
continue;
}
equel++;
}
}
cout << all - equel << endl;
return 0;
}
| 0
| 41,762,809
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int64_t N,P;
cin>>N>>P;
vector<int>A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
if(A[i]%2!=0){cout<<(int64_t)pow(2,N-1)<<endl;return 0;}
}
if(P==0){cout<<(int64_t)pow(2,N)<<endl;}
else{cout<<0<<endl;}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main(void){
int n,q;
cin >> n >> q;
int a[n+1],b[n+1];
int p[q],x[q];
vector<vector<int>> s(n+1);
vector<bool> seen;
vector<int> num(n+1,0);
seen.assign(n+1,false);
for(int i = 1;i < n;i++){
cin >> a[i] >> b[i];
s[a[i]].push_back(b[i]);
s[b[i]].push_back(a[i]);
}
for(int i = 0;i < q;i++){
cin >> p[i] >> x[i];
num[p[i]] += x[i];
}
queue<int> que;
que.push(1);
while(!que.empty()){
int t = que.front();
que.pop();
seen[t] = 1;
for(auto v:s[t]){
if(!seen[v]){
num[v] += num[t];
que.push(v);
}
}
}
for(int i = 1;i <= n;i++)cout << num[i] << " ";
}
| 0
| 48,614,968
|
#include <iostream>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
long long res=0;
for(int i=0;i<=N;i++){
int tmp=i, sum=0;
while(1){
sum+=tmp%10;
if(tmp/10 == 0) break;
else tmp/=10;
}
if(A<=sum && sum<=B) res+=i;
}
cout << res << endl;
}
|
#include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,y) for(long long x=0;x<y;x++)
#define makevec(x,y,n) vector <x> y(n); for(ll i=0;i<n;i++) cin>>y[i]
#define M (ll)1000000007
#define MM (ll) 1e8
#define INF (ll) 1e18
# define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
template <typename T>
T modpow(T base, T exp, T modulus) {
base %= modulus;
T result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
bool sortbysec(const pair <ll,ll> &a,const pair <ll,ll> &b){
return a.second<b.second;
}
struct cmp {
bool operator() (const pair<int, int> &a, const pair<int, int> &b) const {
int lena = a.second - a.first + 1;
int lenb = b.second - b.first + 1;
if (lena == lenb) return a.first < b.first;
return lena > lenb;
}
};
struct c_h {
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
x ^= FIXED_RANDOM;
return x ^ (x >> 16);
}
};
ll calcpow(ll x, ll y)
{
ll temp;
if(y == 0)
return 1;
temp = calcpow(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
{
if(y > 0)
return x * temp * temp;
else
return (temp * temp) / x;
}
}
ll gcd(ll a, ll b){
if(b==0) return a;
return gcd(b,a%b);
}
ll egcd(ll a, ll b, ll &x,ll &y){
if(b==0){
x=1;
y=0;
return a;
}
ll x1;
ll y1;
ll g=egcd(b,a%b,x1,y1);
x=y1;
y=x1-y1*(a/b);
return g;
}
bool isprime(ll a){
bool flag=1;
for(ll i=2;i*i<=a;i++){
if(a%i==0) {flag=0; break;}
}
return flag;
}
ll dx8[8]={1,0,-1,0,1,-1,1,-1};
ll dy8[8]={0,1,0,-1,1,-1,-1,1};
ll dx4[4]={0,0,1,-1};
ll dy4[4]={1,-1,0,0};
ll N=1e5+5;
int main(){
IOS;
make2(ll,a,b);
make2(ll,c,d);
ll cd=(c*d)/gcd(c,d);
cout<<b-(b/c+b/d-b/cd)-a+1+((a-1)/c+(a-1)/d-(a-1)/cd)<<endl;
return 0;
}
| 0
| 39,871,683
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
long double sum=0;
int n;
cin >> n;
rep(i,n){
long double x;
string s;
cin >> x >> s;
if(s=="JPY"){
sum += x;
}
else{
sum += x*380000.0;
}
}
printf("%.12llf\n",sum);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll N, M;
vector<ll> p, x, y;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
int root(int A) {
if (Parent[A] < 0) return A;
return Parent[A] = root(Parent[A]);
}
int size(int A) {
return -Parent[root(A)];
}
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B) {
return false;
}
if (size(A) < size(B)) swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
int main() {
cin >> N >> M;
p.resize(N);
rep(i, N) {
cin >> p[i];
p[i]--;
}
x.resize(M);
y.resize(M);
UnionFind uf(N);
rep(i, M) {
ll tmp1, tmp2;
cin >> tmp1 >> tmp2;
tmp1--;
tmp2--;
x[i] = tmp1;
y[i] = tmp2;
uf.connect(tmp1, tmp2);
}
ll ans = 0;
rep(i, N) {
if (uf.root(i) == uf.root(p[i])) {
ans++;
}
}
cout << ans << endl;
}
| 0
| 64,633,594
|
#include <iostream>
#include<string>
#include<map>
#include<vector>
using namespace std;
int main()
{
map<char, char>m;
string s, t;
cin >> s ;
cin >> t;
vector<int>start(26, -1);
vector<int>goal(26, -1);
bool ok = true;
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
int b = t[i] - 'a';
if (start[a] != -1 || goal[b] != -1) {
if (start[a] != b || goal[b] != a) {
cout << "No" << endl;
return 0;
}
}
else {
start[a] = b;
goal[b] = a;
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc084_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18+100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N;
cin >> N;
vector<int> c(N - 1);
vector<int> s(N - 1);
vector<int> f(N - 1);
rep(i, N - 1) { cin >> c[i] >> s[i] >> f[i]; }
vector<int> ans(N, 0);
rep(i, N - 1) {
int time = 0;
repi(j, i, N - 1) {
if (time < s[j]) {
time += s[j] - time;
} else {
int rest = (time - s[j]) % f[j];
time += rest == 0 ? 0 : f[j] - rest;
}
time += c[j];
}
ans[i] = time;
}
rep(i, N) cout << ans[i] << endl;
}
| 0
| 75,617,527
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int n,l,t,k,cnt,w[N];
int main()
{
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;i++) {scanf("%d%d",&w[i],&k),w[i]+=(k==1)?t:-t,cnt+=w[i]/l; if(w[i]%l<0) cnt--; ((w[i]%=l)+=l)%=l;}
sort(w+1,w+n+1),((cnt%=n)+=n)%=n; for(int i=cnt+1;i<=n;i++) printf("%d\n",w[i]);
for(int i=1;i<=cnt;i++) printf("%d\n",w[i]);
return 0;
}
|
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DEBUG
#define fi first
#define se second
#define pqueue priority_queue
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define int long long
#define mk(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ull> vull;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector< vector<ll> > vvll;
typedef vector<char> vc;
const ll INF = 1e9 + 228;
const ll INFLL = 1e18;
const ll MOD = 1e9 + 7;
const ld eps = 1e-6;
const ld eps2 = 1e-9;
const ll MOD2 = 998244353;
const ll dosz = 5e5;
const ll SZ = (1<<18);
const ld PI = atan2l(0, -1);
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int mod(int a, int b){
a %= b;
if(a<0)
a += b;
return a;
}
void solve(){
int n, k;
cin >> n >> k;
vi nums(n+1);
for(int i=1; i<=n; i++){
cin >> nums[i];
}
for(int i=1; i<=n; i++){
nums[i] += nums[i-1];
}
for(int i=1; i<=n; i++){
nums[i] -= (i);
nums[i] = mod(nums[i], k);
}
map<int, int> cnt;
int ans = 0;
for(int i=0; i<=n; i++){
if(i>=k){
cnt[nums[i-k]]--;
}
ans += cnt[nums[i]];
cnt[nums[i]]++;
}
cout << ans << endl;
}
signed main(){
fast_io();
srand(time(NULL));
cout << fixed << setprecision(12);
int q = 1;
while(q--)
solve();
}
| 0
| 93,510,798
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll R[400009];
string s;
cin >> s;
ll n = s.size();
map<char, int>mp;
for (int i = 0; i < n; i++) {
mp[s[i]]++;
}
ll ans = n*(n-1)/2;
for (auto& p : mp) {
ll v = p.second;
ans -= v*(v-1)/2;
}
cout << ans + 1 << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
int main() {
int A, B;
cin >> A >> B;
vector<vector<char>> G(100, vector<char>(100));
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 100; j++) {
if (j <= 49) {
G[i][j] = '.';
} else {
G[i][j] = '#';
}
}
}
int cnt = 0;
bool finish = false;
for (int i = 0; i < 100; i += 2) {
for (int j = 51; j < 100; j += 2) {
if (cnt >= A - 1) {
finish = true;
break;
};
G[i][j] = '.';
cnt++;
}
if (finish) break;
}
cnt = 0;
finish = false;
for (int i = 0; i < 100; i += 2) {
for (int j = 0; j < 50; j += 2) {
if (cnt >= B - 1) {
finish = true;
break;
};
G[i][j] = '#';
cnt++;
}
if (finish) break;
}
cout << 100 << " " << 100 << endl;
rep(i, 100) {
rep(j, 100) {
cout << G[i][j];
}
cout << endl;
}
}
| 0
| 13,658,909
|
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
int n,x;
scanf("%d%d",&n,&x);
if (x<=(500*n))
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#include<iostream>
using namespace std;
class Cube{
public:
int f[6];
Cube(){}
void roll_z(){ roll(1, 2, 4, 3);}
void roll_y(){ roll(0, 2, 5, 3);}
void roll_x(){ roll(0, 1, 5, 4);}
void roll(int i, int j, int k, int l){
int t = f[i]; f[i] = f[j]; f[j] = f[k]; f[k] = f[l]; f[l] = t;
}
void move(char ch){
if ( ch == 'W' ) roll_y();
if ( ch == 'N' ) roll_x();
if ( ch == 'E' ) for ( int i = 0; i < 3; i++ ) roll_y();
if ( ch == 'S' ) for ( int i = 0; i < 3; i++ ) roll_x();
}
};
int getRight( Cube c1, int f1, int f2 ){
for(int i = 0; i < 6; i++){
for ( int j = 0; j < 4; j++ ){
if ( c1.f[0] == f1 && c1.f[1] == f2 ) return c1.f[2];
c1.roll_z();
}
if ( i % 2 == 0 ) c1.roll_y();
else c1.roll_x();
}
return -1;
}
int main(){
Cube c;
int f1,f2;
for ( int i = 0; i < 6; i++ ) cin >> c.f[i];
int q; cin >> q;
for ( int i = 0; i < q; i++ ){
cin >> f1 >> f2;
cout << getRight(c, f1, f2) << endl;
}
return 0;
}
| 0
| 92,853,877
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int INF = 1e18 + 5;
const int mod = 1e9 + 7;
const int N = 2e5 + 314;
const long double pi = 3.1415926535897932384626433832795;
void solve(){
int n;
string s;
cin>>n>>s;
int cnt=0;
for(char i = '0'; i <= '9'; i++){
for(char j = '0'; j <= '9'; j++){
string x = "";
x+=i, x+=j;
for(char l = '0'; l <= '9'; l++){
string y = x;
y+=l;
int z = 0;
for(int k = 0; k < n; k++){
if(s[k]==y[z])z++;
}
if(z==3)cnt++;
}
}
}
cout<<cnt;
}
signed main(){
speed;
int t=1;
while(t--)solve();
}
|
#include <stdio.h>
int main (){
int a,b,c;
scanf ("%d", &a);
scanf ("%d", &b);
if (a == 1 && b == 2 || a == 2 && b == 1){
printf ("3");
}
else if (a == 1 && b == 3 || a == 3 && b == 1){
printf ("2");
}
else if(a == 2 && b == 3 || a == 3 && b == 2){
printf ("1");
}
return 0;
}
| 0
| 27,378,848
|
#include <iostream>
#include <utility>
int selectionSort(int A[], int N){
int ans = 0;
for(int i = 0; i < N; i++){
int minj = i;
for(int j = i; j < N; j++){
if(A[j] < A[minj]){
minj = j;
}
}
if(minj != i){
std::swap(A[minj], A[i]);
ans++;
}
}
for(int i = 0; i < N; i++){
if(i) std::cout << " ";
std::cout << A[i];
}
std::cout << std::endl;
return ans;
}
int main(){
int N;
std::cin >> N;
int A[N];
for(int i = 0; i < N; i++){
std::cin >> A[i];
}
int ans = selectionSort(A, N);
std::cout << ans << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
int H,W;
cin >> H >> W;
vector<vector<int>> left(H, vector<int>(W,0));
vector<vector<int>> right(H, vector<int>(W,0));
vector<vector<int>> up(H, vector<int>(W,0));
vector<vector<int>> down(H, vector<int>(W,0));
vector<vector<char>> v(H, vector<char>(W));
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> v.at(i).at(j);
}
}
auto check = [&H,&W](int i, int j){
if(i < 0 || i >= H ) return false;
if(j < 0 || j >= W ) return false;
return true;
};
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
if(v.at(i).at(j) == '#'){
continue;
}
if(check(i,j-1) && v.at(i).at(j-1) == '.'){
left.at(i).at(j) = left.at(i).at(j-1) + 1;
}
if(check(i-1,j) && v.at(i-1).at(j) == '.'){
up.at(i).at(j) = up.at(i-1).at(j) + 1;
}
}
}
for(int i = H-1; i >= 0; i--){
for(int j = W-1; j >= 0; j--){
if(v.at(i).at(j) == '#'){
continue;
}
if(check(i,j+1) && v.at(i).at(j+1) == '.'){
right.at(i).at(j) = right.at(i).at(j+1) + 1;
}
if(check(i+1,j) && v.at(i+1).at(j) == '.'){
down.at(i).at(j) = down.at(i+1).at(j) + 1;
}
}
}
int max_val = 0;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
if(v.at(i).at(j) == '#') continue;
int tmp_val = 1;
tmp_val += left.at(i).at(j) + right.at(i).at(j);
tmp_val += up.at(i).at(j) + down.at(i).at(j);
max_val = max( tmp_val, max_val);
}
}
cout << max_val << endl;
}
| 0
| 11,821,293
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF=1e18;
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<endl;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b){ a = b; return 1; } return 0; }
int main(int argc, char const *argv[]) {
int k, x;
cin >> k >> x;
if (500 * k >= x) puts("Yes");
else
puts("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define tcase() int t; cin >> t; while(t--)
const int MOD = 1e9 + 7;
const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = acos((ld) -1);
void setIO(string name = "") {
ios_base::sync_with_stdio(0); cin.tie(0);
if(sz(name)){
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
}
int main(){
setIO();
ll n, k;
cin >> n >> k;
ll Ans = 0LL;
for(ll i = k; i < n + 2LL; i++){
Ans += (n * i) - (i * i) + i + 1;
Ans %= MOD;
Ans = (Ans + MOD) % MOD;
}
cout << Ans;
}
| 0
| 38,440,370
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
const ll MOD = 1e9;
int main(){
ll n;
cin>>n;
if(n==1){
cout<<"Yes"<<endl;
cout<<2<<endl;
cout<<1<<" "<<1<<endl;
cout<<1<<" "<<1<<endl;
return 0;
}
ll f=0;
ll k;
for(int i=0;i<n;i++){
if(i*(i+1)==n*2){
f=1;
k=i;
}
}
if(f==0){
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
cout<<k+1<<endl;
ll cnt=1;
vector<ll> v[1111];
for(int i=1;i<=k;i++){
v[1].push_back(i);
cnt++;
}
for(int i=2;i<=k;i++){
v[i].push_back(i);
for(int j=2;j<i;j++){
v[i].push_back(v[j][i-2]);
}
ll r=k-v[i].size();
for(int j=0;j<r;j++){
v[i].push_back(cnt);
cnt++;
}
}
for(int i=1;i<=k;i++){
cout<<k;
for(int j=0;j<v[i].size();j++){
cout<<" "<<v[i][j];
}
cout<<endl;
}
cout<<k<<" "<<1;
for(int i=2;i<=k;i++){
cout<<" "<<v[i][k-1];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int A[N], sum = 0;
for (int i = 0; i < N; i++) cin >> A[i], sum += A[i];
sort(A, A + N);
reverse(A, A + N);
cout << (A[M - 1] * 4 * M < sum ? "No" : "Yes") << endl;
return 0;
}
| 0
| 87,357,952
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n,k;
ll h[310],dp[310][310][310];
void solve(){
cin >> n >> k;
rep(i,n){
cin >> h[i+1];
}
rep(i,n+1){
rep(j,n+1){
rep(l,k+1){
dp[i][j][l]=INF;
}
}
}
dp[0][0][0]=0;
rep(i,n){
rep(l,min(i+1,k)){
rep(j,i+1){
dp[i+1][j][l+1]=min(dp[i+1][i+1][l+1],dp[i][j][l]);
}
}
rep(l,min(i+1,k+1)){
rep(j,i+1){
dp[i+1][i+1][l]=min(dp[i+1][i+1][l],dp[i][j][l]+max(h[i+1]-h[j],0ll));
}
}
}
ll ans=INF;
rep(j,n+1){
rep(l,k+1){
ans=min(ans,dp[n][j][l]);
}
}
rep(i,n+1){
rep(j,n+1){
rep(l,k+1){
if (dp[i][j][l]==INF) continue;
}
}
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
typedef string STR;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef priority_queue<int> PQI;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
typedef vector<STR> VS;
typedef vector<char> VC;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<STR,int> PSI;
typedef pair<int,STR> PIS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef map<int,int> MII;
typedef map<LL,LL> MLL;
typedef map<STR,int> MSI;
typedef map<char,int> MCI;
typedef map<int,STR> MIS;
typedef set<STR> SS;
typedef set<int> SI;
typedef set<LL> SLL;
#define FF first
#define SS second
#define PB push_back
#define PF push_front
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define dec(n) cout<<fixed<<setprecision(n);
#define f(i, n) for(LL i=0; i<(LL)n; i++)
#define fr(i,n) for(LL i=(LL)(n-1); i>=0; i--)
#define fa(i, a, n) for(LL i=(LL)a; i<(LL)n; i++)
#define fra(i, a, n) for(LL i=(LL)(n-1); i>=a; i--)
#define fsort(a) sort(a.begin(), a.end())
#define rsort(a) sort(a.rbegin(), a.rend())
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL))
template<class T> T maxT(T a, T b){return (a>b?a:b);}
template<class T> T minT(T a, T b){return (a<b?a:b);}
template<class T> void setmax(T &a, T b){a=(a>b ?a:b);}
template<class T> void setmin(T &a, T b){a=(a<b ?a:b);}
void fileio(){
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
}
void ofileio(){
freopen("input.txt","r", stdin);
freopen("output.txt", "w", stdout);
}
void clock_out(){
cerr<<"\nTime Elapsed : " << 1.0*clock() / CLOCKS_PER_SEC << " s\n";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define fio() fileio()
#define ofio ofileio()
#define clock() clock_out()
#else
#define debug(...) 1
#define fio() 1
#define ofio() ofileio()
#define clock() 1
#endif
const LL MOD = 1000000007;
const LL SIZE = 100000;
const int INF = 0x3f3f3f3f;
const LL LL_INF = 0x3f3f3f3f3f3f3f3f;
const LD PI = acos(-1);
const LL MAXN = numeric_limits<LL>::max();
void solve(){
int n, k;
cin>>n>>k;
string s;
cin>>s;
VI zero, one;
int cnt=1;
if(s[0]=='0') one.PB(0);
for(int i=1; i<n; i++){
if(s[i]==s[i-1]) cnt++;
else{
if(s[i-1]=='1'){
one.PB(cnt);
}else if(s[i-1]=='0'){
zero.PB(cnt);
}
cnt=1;
}
}
if(s[n-1]=='0')zero.PB(cnt);
else one.PB(cnt);
one.PB(0);
int ans=0;
int sum=0;
if(zero.size()<=k){
cout<<n;
return;
}
for(auto v: zero) cerr<<v<<" ";cerr<<endl;
for(auto v: one) cerr<<v<<" ";
for(int i=0; i<k; i++){
sum+=one[i];
sum+=zero[i];
}
sum+=one[k];
ans=sum;
for(int i=k; i<zero.size(); i++){
sum-=one[i-k];
sum-=zero[i-k];
sum+=one[i+1];
sum+=zero[i];
setmax(ans, sum);
}
cout<<ans;
}
int main(){
fast;
LL t=1;
while(t--){
solve();
}
clock();
return 0;
}
| 0
| 47,172,311
|
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
#define PI 3.141592653589
int main(){
int n, a, b, c, d;
char ss;
while(1){
cin >> a >> b >> c;
if(a == -1 && b == -1 && c == -1)break;
if(a == -1 || b == -1){
a = 0;
b = 0;
}
if(80 <= a + b)ss = 'A';
else if(65 <= a + b)ss = 'B';
else if(50 <= a + b)ss = 'C';
else if(30 <= a + b)ss = 'D';
else ss = 'F';
if(ss == 'D' && 50 <= c)ss = 'C';
cout << ss << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T>
inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template <class T>
inline void chmin(T& a, T b) {
a = std::min(a, b);
}
#define mod (ll)(1e9 + 7)
const long long INF = 1LL << 60;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll a(n);
rep(i, n) {
cin >> a[i];
}
sort(all(a));
ll ans = 0;
while (a[n - 1] >= n) {
vll b(n);
ll sum = 0;
rep(i, n) {
if (a[i] >= n) {
b[i] = a[i] / n;
}
sum += b[i];
}
ans += sum;
rep(i, n) {
a[i] += sum - (n + 1) * b[i];
}
sort(all(a));
if (a[0] >= n) {
ll cnt = (a[0] - (n - 1));
ans += n * cnt;
rep(i, n) {
a[i] -= cnt;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 32,011,485
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin >> n;
long long int ans=0;
long long five=10;
if(n%2==1) cout << 0 << endl;
else{
while(1){
if(five>n) break;
ans+=n/five;
five*=5;
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define foo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(a,min(b,min(c,d)))
#define max4(a,b,c,d) max(a,max(b,max(c,d)))
#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
int mpow(int base, int exp);
void ipgraph(int m);
void DFS(int n);
bool isprime(ll n);
ll gcd(ll a,ll b);
void rstgraph(int n);
const int mod = pow(10,9)+7;
const int N = 3e5, M = N;
vi g[N];
int vis[N];
int nodes=0;
void iluzn() {
ll a,b;
cin>>a>>b;
cout<<(a*b)/gcd(a,b);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t=1,i;
while(t--) iluzn();
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
bool isprime(ll n){
if(n<=1)
return false;
if(n==2)
return true;
if(n%2==0)
return false;
ll rt = sqrt(n);
for(ll i=3;i<rt;i+=2){
if(n%i==0)
return false;
}
return true;
}
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
void ipgraph(int m){
int u, v;
while(m--){
cin>>u>>v;
g[u].pb(v);
}
}
void DFS(int n)
{ ++nodes;
vis[n] = 1;
for(vector<int>::iterator i = g[n].begin(); i != g[n].end() ; i++)
{
if(!vis[*i])
DFS(*i);
}
}
void rstgraph(int n){
int i;
fo(i,n+1){
g[i].clear();
vis[i]=0;
}
nodes=0;
}
| 0
| 32,703,289
|
#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;
vector<int> cnt(26);
int ans = 0;
rep(i, 4) {
int t;
t = s[i]-'A';
if (cnt[t] == 1) {
ans++;
}
cnt[t]++;
}
if (ans == 2) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 1e4 + 5 ;
int cost[] = {2,5,5,4,5,6,3,7,6} ;
int can[MAX], dig[MAX] , arr[12];
int m ;
void solve(int n)
{
if(n == 0)
return ;
for(int i = m-1 ; i >= 0 ; --i)
{
if(n-cost[arr[i]-1] < 0)
continue ;
if(can[n-cost[arr[i]-1]] && dig[n] == dig[n-cost[arr[i]-1]]+1)
{
cout<<arr[i] ;
solve(n-cost[arr[i]-1]) ;
return ;
}
}
return ;
}
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
int n ;
cin>>n>>m ;
for(int i = 0 ; i < m ; ++i)
cin>>arr[i] ;
sort(arr , arr + m) ;
can[0] = 1 ;
for(int i = 0 ; i <= n ; ++i)
{
for(int j = 0 ; j < m ; ++j)
{
if(i-cost[arr[j]-1] < 0)
continue ;
can[i] |= can[i-cost[arr[j]-1]] ;
if(can[i-cost[arr[j]-1]])
dig[i] = max(dig[i] , dig[i-cost[arr[j]-1]]+1) ;
}
}
solve(n) ;
return 0 ;
}
| 0
| 38,718,053
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, m;
cin >> n >> m;
vector<vector<ll>> a(8, vector<ll>(n));
rep(i, n){
ll ai, bi, ci;
cin >> ai >> bi >> ci;
a.at(0).at(i) = +ai+bi+ci;
a.at(1).at(i) = +ai+bi-ci;
a.at(2).at(i) = +ai-bi+ci;
a.at(3).at(i) = +ai-bi-ci;
a.at(4).at(i) = -ai+bi+ci;
a.at(5).at(i) = -ai+bi-ci;
a.at(6).at(i) = -ai-bi+ci;
a.at(7).at(i) = -ai-bi-ci;
}
rep(i, 8){
sort(a.at(i).begin(), a.at(i).end());
reverse(a.at(i).begin(), a.at(i).end());
}
vector<ll> sum(8);
rep(i, 8) sum.at(i) = 0;
rep(i, 8) rep(j, m) sum.at(i) += a.at(i).at(j);
ll ans = -100000000000000;
rep(i, 8) ans = max(ans, sum.at(i));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define uniq(v) v.erase(unique(v.begin(),v.end()),v.end())
#define lb(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define ub(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
using Pair = pair<ll,pair<int,int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod=1000000007;
const ld pi=acos(-1.0);
const ll INF = 1LL<<61;
template<class T>bool chmax(T &a, const T &b) {
if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) {
if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<ll> p(n);
rep(i,n){
cin>>p[i];
}
reverse(all(p));
if(p[0]!=2) {
cout << -1 << endl;
return 0;
}
ll s=2,d=3;
repo(i,n){
ll ss=p[i]*((s+p[i]-1)/p[i]);
ll dd=p[i]*(d/p[i]);
if(ss>dd) {
cout << -1 << endl;
return 0;
}
s=ss,d=dd+p[i]-1;
}
cout << s << " " << d << endl;
}
| 0
| 83,081,560
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n; cin >> n;
vi v(n + 2), jf(n + 2, n + 1), jf2(n + 2, n + 1), jb(n + 2, 0), jb2(n + 2, 0);
rep(i, 1, n + 1) cin >> v[i];
{
set<int> indices;
set<int, greater<int>> indices_dec;
vector<pair<int, int>> prs;
rep(i, 1, n + 1) prs.push_back({ v[i], i });
sort(all(prs)); reverse(all(prs));
for (auto p : prs) {
{
auto it = indices.upper_bound(p.second);
if (it != indices.end()) {
jf[p.second] = *it;
++it;
if (it != indices.end()) {
jf2[p.second] = *it;
}
}
}
{
auto it = indices_dec.upper_bound(p.second);
if (it != indices_dec.end()) {
jb[p.second] = *it;
++it;
if (it != indices_dec.end()) {
jb2[p.second] = *it;
}
}
}
indices.insert(p.second);
indices_dec.insert(p.second);
}
}
ll ans = 0;
rep(i, 1, n + 1) {
ll p = 0;
p += 1ll * (jb[i] - jb2[i]) * (jf[i] - i);
p += 1ll * (i - jb[i]) * (jf2[i] - jf[i]);
ans += 1ll * p * v[i];
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<pair<string,ll> > svp;
#define spc ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair
#define GCD(x,y) __gcd(x,y)
#define PI 2*acos(0.0);
#define lb lower_bound
#define bs binary_search
#define all(x) x.begin(),x.end()
#define LCM(x,y) ((x*y)/__gcd(x,y))
#define btpc __builtin_popcountll
#define sp(x) cout<<fixed<<setprecision(x)
const long long cs=2e5+5;
const long long inf=1e18;
const long long mod=1e9+7;
void solve()
{
ll t,n,m,a,b,d,e,i,j,k,x,y,z,cnt=0,cnt1=0,cnt2=0;
bool flag = false;
cin>>a>>b;
string s;
for(i=0;i<a;i++)
{
cin>>s;
cout<<s<<endl;
cout<<s<<endl;
}
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
return 0;
}
| 0
| 5,184,282
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int num;
int len;
cin >> num >> len;
string words[num];
for (int i = 0; i < num; i++)
{
cin >> words[i];
}
for (int i = 0; i < num - 1; i++)
{
for (int j = num - 1; j > i; j--)
{
string temp;
if (0 < words[j - 1].compare(words[j]))
{
temp = words[j - 1];
words[j - 1] = words[j];
words[j] = temp;
}
}
}
for (int i = 0; i < num; i++)
{
cout << words[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int MOD = 1000000007;
double PI = 3.14159265358979323846;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
#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 rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define For(i,s,n) for (int i=s;i<(int)(n);i++)
#define vi vector<int>
#define vii vector< vector<int> >
#define vs vector<string>
#define All(c) (c).begin(), (c).end()
#define Print(x) cout<<(x)<<"\n"
int A, B, K;
int main() {
cin >> A >> B >> K;
rep(i, K) {
if (i % 2 == 0) {
A -= A % 2;
A /= 2;
B += A;
}
if (i % 2 == 1) {
B -= B % 2;
B /= 2;
A += B;
}
}
cout << A << ' ' << B << endl;
}
| 0
| 55,237,307
|
#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<ll,ll>;
int main(){
int n;cin>>n;
vector<int> a(n+1);
ll sum=0;
a[0]=0;
rep(i,n+1){
if(i==0)continue;
cin>>a[i];
sum+=abs(a[i-1]-a[i]);
}
sum+=abs(a[0]-a[n]);
rep(i,n){
if(i==0)continue;
int mi=abs(a[i-1]-a[i])+abs(a[i+1]-a[i]);
int pl=abs(a[i-1]-a[i+1]);
cout<<sum-mi+pl<<endl;
}
cout<<sum-abs(a[n-1]-a[n])-abs(a[0]-a[n])+abs(a[0]-a[n-1])<<endl;
}
|
#include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main() {
typedef unordered_set<string> set_t;
set_t A;
int n;
string s,t;
cin >> n;
for (int i = 0; i<n; i++){
cin >> s >> t;
if (s == "insert"){
A.insert(t);
}
else if (s == "find"){
bool find = A.count(t);
cout << (find?"yes":"no") << endl;
}
}
}
| 0
| 27,579,453
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ss set<string>
#define si set<int>
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pq priority_queue<int>
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define M(arr,n,type) type *arr=new type[n];
#define T(x) int x; cin>>x; while(x--)
#define FOR for(int i=0;i<n;i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define Mamun ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
void solve(){
int d,t,s;cin>>d>>t>>s;
if(s*t>=d)
cout<<"Yes";
else cout<<"No";
}
int main()
{
Mamun;
solve();
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n);
std::set<int> as;
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
as.insert(a[i]);
}
std::sort(a.begin(), a.end());
int ans = 0;
std::vector<int> am;
if (as.size() > k)
{
for (auto itr = as.begin(); itr != as.end(); itr++) {
int num = std::upper_bound(a.begin(), a.end(), *itr) - std::lower_bound(a.begin(), a.end(), *itr);
am.push_back(num);
}
std::sort(am.begin(), am.end());
for (int i = 0; i < as.size() - k; i++) {
ans += am[i];
}
}
std::cout << ans << "\n";
}
| 0
| 30,530,596
|
#include<iostream>
using namespace std;
int main() {
int datas[100] = { 0 };
int num,biggest_num=0;
while (cin >> num) {
datas[num-1]++;
}
for (int i = 0; i < 100; i++) {
if (biggest_num < datas[i]) {
biggest_num = datas[i];
}
}
for (int i = 0; i < 100; i++) {
if (biggest_num == datas[i]) {
cout << i + 1<<endl;
}
}
return 0;
}
|
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<unordered_set>
#include<vector>
#define ll long long
#define P pair<int,int>
#define FOR(i,N) for(int i=0;i<(int)N;i++)
#define FORIN(i,a,b) for(int i=a;i<(int)b;i++)
#define ALL(x) (x).begin(),(x).end()
#define LAST(x) (x)[(x).size()-1]
#define GI(name) int (name);scanf("%d",&(name))
#define GI2(name1,name2) int (name1),(name2);scanf("%d %d",&(name1),&(name2))
#define GI3(name1,name2,name3) int (name1),(name2),(name3);scanf("%d %d %d",&(name1),&(name2),&(name3))
#define GVI(name,size) vector<int> (name)(size);FOR(i,(size))scanf("%d",&(name)[i])
#define MOD 1000000007
using namespace std;
string to_hex(int x){
stringstream ss;
ss<<hex<<x;
return ss.str();
}
inline int get_int(){
int ret;
scanf("%d",&ret);
return ret;
}
inline vector<int> get_ints(int n){
vector<int> ret(n);
FOR(i,n){
scanf("%d",&ret[i]);
}
return ret;
}
inline string get_str(){
string ret;
cin>>ret;
return ret;
}
bool is_prime(int n){
int s=sqrt(n)+1;
for(int i=2;i<=s;++i){
if(n%i==0){
return 0;
}
}
return 1;
}
vector<P> prime_division(int n){
vector<P> ret;
int s=sqrt(n)+1;
int c=0;
for(int i=2;i<=n;++i){
if(n%i==0){
c=0;
do{
++c;
n/=i;
}while(n%i==0);
ret.push_back(P(i,c));
}
}
return ret;
}
struct UnionFind{
vector<int> data;
UnionFind(int size){
data=vector<int>(size,-1);
}
bool union_set(int x,int y){
x=root(x);
y=root(y);
if(x!=y){
if(data[y]<data[x])swap(x,y);
data[x]+=data[y];
data[y]=x;
}
return x!=y;
}
bool find(int x,int y){
return root(x)==root(y);
}
int root(int x){
return data[x]<0?x:data[x]=root(data[x]);
}
int size(int x){
return -data[root(x)];
}
};
string to_string(string s){
return s;
}
template<class T>
string to_string(vector<T> v){
string ret="{";
FOR(i,v.size()-1){
ret+=to_string(v[i])+",";
}
if(v.size()>0){
ret+=to_string(LAST(v));
}
ret+="}";
return ret;
}
void debug_print(){
cerr<<endl;
}
template<class Head,class... Tail>
void debug_print(Head head,Tail... tail){
cerr<<to_string(head)<<" ";
debug_print(tail...);
}
template<class... T>
void debug(T... args){
cerr<<"["<<__LINE__<<"]: ";
debug_print(args...);
}
void print(){
cout<<endl;
}
template<class Head,class... Tail>
void print(Head head,Tail... tail){
cout<<to_string(head);
print(tail...);
}
int main(){
GI3(A,B,K);
FOR(i,K/2){
if(A%2==1)A--;
A/=2;
B+=A;
if(B%2==1)B--;
B/=2;
A+=B;
}
if(K%2){
if(A%2==1)A--;
A/=2;
B+=A;
}
cout<<A<<" "<<B<<endl;
return 0;
}
| 0
| 20,618,518
|
#include<iostream>
using namespace std;
int main(){
int N, K, h;
int ans = 0;
std::cin >> N >> K;
for(int i = 0; i < N; i++){
std::cin >> h;
if(h >= K){
ans++;
}
}
std::cout << ans;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int n; cin >> n;
vector<int> b(n-1);
rep(i,n-1) cin >> b[i];
vector<int> a(n);
a[0] = b[0]; a[n-1] = b[n-2];
int sum = a[0] + a[n-1];
for(int i=0; i<n-2; i++){
a[i+1] = min(b[i],b[i+1]);
sum+=a[i+1];
}
cout << sum << endl;
return 0;
}
| 0
| 65,353,966
|
#include <iostream>
using namespace std;
int main()
{
int x, n, i, j, k, C;
while(1)
{
C=0;
cin >> n >> x;
if(n==0 && x==0)
break;
for(i=1;i<=n-2;i++)
for(j=1+i;j<=n-1;j++)
for(k=1+j;k<=n;k++)
if(i+j+k==x)
C += 1;
cout << C << endl;
}
}
|
#include <string>
#include <cctype>
#include <iostream>
using namespace std;
int toInt(char c){
switch(c){
case 'm':
return 1000;
case 'c':
return 100;
case 'x':
return 10;
case 'i':
return 1;
}
cout << "impossible" << endl;
return 0;
}
int encode(string str){
int ret=0;
for(int i=0;i<str.size();i++){
char c = str[i];
int mul=1;
if('0' <= c && c<='9'){
mul=c-'0';
i++;
c = str[i];
}
ret += mul*toInt(c);
}
return ret;
}
string decode(int n){
string ret;
if(n>=1000){
int d = n/1000;
n = n%1000;
if(d>1)ret.push_back('0'+d);
ret.push_back('m');
}
if(n>=100){
int d = n/100;
n = n%100;
if(d>1)ret.push_back('0'+d);
ret.push_back('c');
}
if(n>=10){
int d = n/10;
n = n%10;
if(d>1)ret.push_back('0'+d);
ret.push_back('x');
}
if(n>=1){
int d = n/1;
if(d>1)ret.push_back('0'+d);
ret.push_back('i');
}
return ret;
}
int main(){
int n;
cin >> n;
for(int i = 0;i<n;i++){
string a,b;
cin >> a >> b;
string ans = decode(encode(a)+encode(b));
cout << ans << endl;
}
}
| 0
| 23,078,318
|
#include <algorithm>
#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>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N, D; cin >> N >> D;
vector<vector<int>>X(N, vector<int>(D));
rep(i, N)rep(j, D)cin >> X[i][j];
vector<int>A(N);
rep(i, N)A[i] = i+1;
int answer = 0;
rep(i, N * (N - 1)) {
long double ans = 0;
rep(j, D) {
ans += pow(abs(X[A[0]-1][j] - X[A[1]-1][j]), 2);
}
ans = sqrt(ans);
if (ans == int(ans))answer++;
if (N == 2 || N == 3) {
rep(i, 1)next_permutation(A.begin(), A.end());
}
else {
int count = 1;
REP(i, N - 1)count *= i;
rep(i, count)next_permutation(A.begin(), A.end());
}
}
cout << answer/2 << endl;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n;
int h[N], e[N], ne[N], idx;
int match[N];
bool st[N];
PII point[N];
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
bool find(int u)
{
for (int i = h[u]; ~i; i = ne[i])
{
int j = e[i];
if (!st[j])
{
st[j] = true;
if (match[j] == 0 || find(match[j]))
{
match[j] = u;
return true;
}
}
}
return false;
}
int main()
{
memset(h, -1, sizeof h);
cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> point[i].F >> point[i].S;
for (int i = n + 1; i <= 2 * n; i ++ ) cin >> point[i].F >> point[i].S;
for (int i = 1; i <= n; i ++ )
for (int j = n + 1; j <= 2 * n; j ++ )
if (point[i].F < point[j].F && point[i].S < point[j].S)
add(i, j);
int res = 0;
for (int i = 1; i <= n; i ++ )
{
memset(st, 0, sizeof st);
if (find(i)) res ++ ;
}
cout << res << endl;
return 0;
}
| 0
| 66,408,893
|
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(i,n) for(int i=0; i<(n); i++)
#define REPinit(a,n) for(int i=a; i<(n); i++)
#define REPinitj(a,n) for(int j=a; j<n; j++)
#define CLR(a) memset((a), 0 ,sizeof(a))
template <typename T>
void swapAlgorithm(T& a, T& b) {
T tmp = a;
a = b;
b = tmp;
}
LL euclideanAlgorithm(LL a, LL b) {
LL a_tmp = a;
LL b_tmp = b;
if (a_tmp > b_tmp) {
swapAlgorithm<LL>(a_tmp, b_tmp);
}
LL r = a_tmp % b_tmp;
while (r != 0) {
a_tmp = b_tmp;
b_tmp = r;
r = a_tmp % b_tmp;
}
return b_tmp;
}
LL getLCM(LL a, LL b) {
return (a * b)/(euclideanAlgorithm(a, b));
}
double eauclidDistance(pair<double, double>& x1, pair<double, double>& x2) {
return sqrt((x1.first - x2.first) * (x1.first - x2.first) + (x1.second - x2.second) * (x1.second - x2.second));
}
void swap(int& a, int& b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}
map<string, int> blueCard;
map<string, int> redCard;
int main(int argc, char const *argv[])
{
int A,B,C,D;
cin >> A >> B >> C >> D;
cout << (min(A,B)+min(C,D)) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <queue>
using namespace std;
int main() {
long long K;
cin >> K;
queue<long long> Que;
for (long long i = 1; i <= 9; i++) Que.push(i);
long long res = 0;
for (long long i = 0; i < K; i++){
long long a = Que.front();
Que.pop();
if (i == K - 1) res = a;
if (a % 10 == 0) {
Que.push(a * 10);
Que.push(a * 10 + 1);
}
else if (a % 10 == 9) {
Que.push(a * 10 + 8);
Que.push(a * 10 + 9);
}
else {
Que.push(a * 10 + (a % 10) - 1);
Que.push(a * 10 + (a % 10));
Que.push(a * 10 + (a % 10) + 1);
}
}
cout << res << endl;
}
| 0
| 46,663,876
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
char A;
cin >> A;
if(isupper(A)){
cout << 'A' << endl;
}else{
cout << 'a' << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, a, b) for(int i = a, i##_len = (b); i < i##_len; ++i)
int graph[4][4];
bool visited[4];
bool all_vis(int cur) {
visited[cur] = true;
for(int i = 0; i < 4; ++i) if(graph[cur][i]) {
if(visited[i]) continue;
if(all_vis(i)) return true;
}
for(int i = 0; i < 4; ++i) if(!visited[i]) {
visited[cur] = false;
return false;
}
visited[cur] = false;
return true;
}
bool tansaku() {
for(int i = 0; i < 4; ++i) {
for(int j = 0; j < 4; ++j) visited[i] = false;
if(all_vis(i)) return true;
}
return false;
}
int main()
{
for(int i = 0; i < 3; ++i) {
int a,b;
scanf("%d %d", &a, &b);
--a, --b;
graph[a][b] = graph[b][a] = 1;
}
if(tansaku()) printf("YES\n");
else printf("NO\n");
return 0;
}
| 0
| 70,835,742
|
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define BLACK 0
#define RED 1
#define MAN 2
int count;
int tile[20][20];
int dx[] = {0,0,-1,1};
int dy[] = {-1,1,0,0};
int W,H;
int countdebug;
void hukasa(int width,int height);
int main(){
int height,width;
int i,j;
char s;
while(scanf("%d %d",&W,&H) && W && H){
count = 0;
for(j=0; j<H; j++){
scanf("%*c");
for(i=0; i<W; i++){
scanf("%c",&s);
if(s == '.'){
tile[i][j] = BLACK;
}
else if(s == '#'){
tile[i][j] = RED;
}
else if(s == '@'){
tile[i][j] = RED;
height = j;
width = i;
}
}
}
hukasa(width,height);
printf("%d\n",count+1);
}
return 0;
}
void hukasa(int width,int height){
int i;
for(i=0;i<4;i++){
if(!(width + dx[i] < 0 || height + dy[i] < 0 || width + dx[i] > W - 1 || height + dy[i] > H - 1) ){
if(tile[width + dx[i]][height + dy[i]] == BLACK){
tile[width + dx[i]][height + dy[i]] = RED;
count++;
hukasa(width + dx[i],height + dy[i]);
}
}
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int Q;
string str_x, str_y;
int memo[1001][1001];
cin >> Q;
for(int q = 0;q < Q;q++){
cin >> str_x >> str_y;
for(unsigned int i = 0;i < str_x.size();i++){
for(unsigned int j = 0;j < str_y.size();j++){
if(str_x.at(i) == str_y.at(j)){
memo[i+1][j+1] = memo[i][j] + 1;
}else{
memo[i+1][j+1] = max(memo[i][j+1], memo[i+1][j]);
}
}
}
printf("%d\n", memo[str_x.size()][str_y.size()]);
}
return 0;
}
| 0
| 42,284,550
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N,vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> C.at(i);
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int cost = 12 * 100000 + 1;
for (int k = 0; k < (1 << N); k++) {
bitset<12> b(k);
int tmp = 0;
vector<int> tmp_a(M);
for (int i = 0; i < N; i++) {
if (b[i] == 1) {
tmp += C.at(i);
for (int j = 0; j < M; j++) {
tmp_a.at(j) += A.at(i).at(j);
}
}
}
bool tf = true;
for (int j = 0; j < M; j++) {
if (tmp_a.at(j) < X) tf = false;
}
if (tf) {
cost = min(cost, tmp);
}
}
if (cost == 12 * 100000 + 1) cost = -1;
cout << cost << endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define mod 1000000007
#define string_mod 2549536629329_base_255
#define pb push_back
#define F first
#define S second
#define ff first
#define endl "\n"
#define ss second
#define all(v) v.begin(), v.end()
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int power(int x, unsigned int y, int p)
{
int res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res % p;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc;
tc = 1;
while (tc--)
{
string s;
cin >> s;
string t = s;
int k;
cin >> k;
int ans = 0;
map<char, int> mp;
int c = 0;
for (int i = 0; i < s.size(); i++)
{
if (mp[s[i]] == 0)
{
mp[s[i]] = 1;
c++;
}
}
if (c == 1)
{
int f = s.size();
f = f * k;
f /= 2;
cout << f << endl;
continue;
}
for (int i = 1; i < s.size(); i++)
{
if (s[i] == s[i - 1])
{
char ch = 'a';
if (ch == s[i - 1] || ch == s[(i + 1) % s.size()])
{
ch++;
}
if (ch == s[i - 1] || ch == s[(i + 1) % s.size()])
{
ch++;
}
s[i] = ch;
ans++;
}
}
ans = ans * k;
if (s[0] == s[s.size() - 1])
{
int c = 0;
for (int i = 0; i < t.size();i++){
if(t[i]==t[0]){
c++;
}
else
{
break;
}
}
reverse(all(t));
for (int i = 0; i < t.size(); i++)
{
if (t[i] == t[0])
{
c++;
}
else
{
break;
}
}
if(c%2==0)
ans += k - 1;
}
cout << ans << endl;
}
return 0;
}
| 0
| 68,001,726
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
string s;
cin>>n;
cin>>s;
ll r,g,b;
r=g=b=0;
for(char ch: s){
if(ch == 'R'){
++r;
}else if(ch == 'G'){
++g;
}else if (ch == 'B'){
++b;
}
}
ll total = r*g*b;
if(total == 0){
cout<<total<<endl;
}else{
for(ll i=0;i<n;++i){
for(ll j= i+1;j<n;++j){
ll k = j + (j-i);
if(k < n && (s[i] != s[j] && s[j] != s[k] && s[i] != s[k])){
total -=1;
}
}
}
cout<<total<<endl;
}
}
int main()
{
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int long long int
#define mod 1000000007
#define test int t;cin>>t;while(t--)
#define REP(i,a,b) for(int i=a,i<=b;i++)
#define MAXN 200001
int32_t main()
{
int n,k;cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
int dp[n+1];
for(int i=0;i<=n;i++){
dp[i]=INT_MAX;
}
dp[0]=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<=(i+k);j++){
if(j<n){
int val=dp[i]+abs(arr[j]-arr[i]);
dp[j]=min(dp[j],val);
}
}
}
cout<<dp[n-1]<<endl;
return 0;
}
| 0
| 21,907,198
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin>>n;
vector<int> a(n);rep(i,n)cin>>a[i];
a.push_back(-1);
int ans = 0, p = -1, l = 0;
for(int i=0; i<=n; i++){
if(p==a[i]){
l++;
}
else{
p=a[i];
ans += l/2;
l = 1;
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 1000;
rep(i, n - 1) {
ll pre = ans / a[i];
if (a[i] < a[i + 1])
ans += (a[i + 1] - a[i]) * pre;
}
cout << ans << endl;
return 0;
}
| 0
| 23,967,837
|
#include<stdio.h>
int main(){
int n,k,i,c=0,d=0,e=0;
scanf("%d%d",&n,&k);
e=(n-1)-(k-2);
printf("%d\n",e);
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int n;
cin >> n;
for(int i=0;i<n;i++){
string m;
int a,b;
cin >> m >> a >> b;
if(m=="print") cout << s.substr(a,b-a+1) << endl;
else if(m=="reverse"){
string t;
for(int j=0;j<a;j++) t += s[j];
for(int j=b;j>=a;j--) t += s[j];
for(int j=b+1;j<s.length();j++) t += s[j];
s = t;
}
else if(m=="replace"){
string p,t;
cin >> p;
t = s.substr(0,a) + p + s.substr(b+1,s.length()-b+1);
s = t;
}
}
}
| 0
| 45,258,782
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
double sol = 0;
double c;
double x,y;
int n;
cin>>n;
vector<pair<int,int>>data;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
data.push_back(make_pair(a,b));
}
for(int r = 0; r < 100; r++) {
random_shuffle(data.begin(), data.begin() + n);
for(int i = 0; i < n; i++) {
double x = data[i].first, y = data[i].second, c = sqrt(pow(x, 2) + pow(y, 2));
for(int j = 0; j < n; j++) {
if(i == j) continue;
x += data[j].first;
y += data[j].second;
double length = sqrt(pow(x, 2) + pow(y, 2));
if(length > c) c = length;
else {
x -= data[j].first;
y -= data[j].second;
}
}
sol = max(c, sol);
}
}
cout<<setprecision(40)<<sol<<endl;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main() {
while(1) {
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if (n == 0) break;
vector<int> y;
for (int i = 0; i < n; ++i) {
int yi;
cin >> yi;
y.push_back(yi);
}
int i;
int tmp = 0;
for (i = 0; i < 10001; ++i) {
if (x == y[tmp]){
tmp++;
if(tmp == n) break;
}
x = (a * x + b) % c;
}
cout << (i == 10001 ? -1 : i) << endl;
}
}
| 0
| 59,052,272
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.