code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include<stdio.h>
int main(){
int W,H,x,y,r;
scanf("%d %d %d %d %d",&W, &H, &x, &y, &r);
if (W >= x + r){
if (x >= r){
if (H >= y + r){
if (y >= r)
printf("Yes\n");
else
printf("No\n");
}
else
printf("No\n");
}
else
printf("No\n");
}
else
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
#define Sort(x) sort(all(x))
#define A first
#define B second
#define sep ' '
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define set_random mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
const int MAX1 = 5e3+10,
Md = 1e9+7,
Base = 257;
ll n, m, sum, ans, adad, num[MAX1], dp[MAX1];
bool Check(ll flg){
fill(dp, dp+MAX1, 0);
dp[0] = 1;
for (int i = 1; i <= n; ++i){
if (i == flg) continue;
for (int j = m-1; j >= num[i]; --j){
dp[j] |= dp[j-num[i]];
}
}
for (int i = m-1; i >= m-num[flg]; --i){
if (dp[i]) return false;
}
return true;
}
int main(){
fast_io;
cin >> n >> m;
for (int i = 1; i <= n; ++i){
cin >> num[i];
}
sort(num+1, num+n+1);
ll L = 0, R = n+1, Mid;
while (R-L > 1){
Mid = (R+L)/2;
if (Check(Mid)) L = Mid;
else R = Mid;
}
cout << L << '\n';
return 0;
}
| 0
| 32,809,786
|
#include<iostream>
using namespace std;
int a,b,c;
int main(){
cin>>a>>b>>c;
while(a==b && b==c){
cout<<"1"<<endl;
break;
}
while((a==b&&b!=c)||(b==c&&c!=a)||(c==a&&a!=b)){
cout<<"2"<<endl;
break;
}
while(a!=b && b!=c&&c!=a){
cout<<"3"<<endl;
break;
}
return 0;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
#define out(s) cout<<s<<endl;
#define Reverse(x) reverse(all(x));
#define Sort(x) sort(all(x));
#define pb(s) push_back(s);
#define sp " "
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(lli i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
cout << std::fixed << std::setprecision(10);
string s;
cin>>s;
bool c=false;
if (s=="keyence"){
c=true;
}
rep(i, s.size()) {
for(lli j=1;i+j<=s.size();j++){
string sc=s;
sc.erase(i, j);
if (sc=="keyence"){
c=true;
break;
}
}
}
YES(c);
}
| 0
| 59,932,898
|
#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 i, j, k, N, A, B, x, y, count=0, ans=0, sum;
cin >> A >> B;
for(i=A;i<B+1;i++){
x=i;
y=0;
rep(j,5){
y+=(x%10)*pow(10,4-j);
x/=10;
}
if(i==y)count+=1;
}
cout << count;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int N;
string S[310];
string SS[310];
bool check(int A) {
rep(i, N) {
rep(j, N) {
int ni = (i + A) % N;
SS[ni][j] = S[i][j];
}
}
rep(i, N) {
rep(j, N) {
if (SS[i][j] != SS[j][i]) return false;
}
}
return true;
}
int main() {
cin >> N;
rep(i, N) {
string s;
cin >> s;
S[i] = SS[i] = s;
}
int ans = 0;
rep(A, N) {
if (check(A)) ans += N;
}
cout << ans << endl;
}
| 0
| 79,753,812
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, n) for (ll i = n-1; i >= 0; i--)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define repd2(i, s, n) for (ll i = n-1; i >= (s); i--)
int main() {
ll n, x, t;
cin >> n >> x >> t;
ll a = (n+x-1)/x;
cout << a*t << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll n, k; cin >> n >> k;
map<ll, ll> mp;
rep(i, n){
ll a; cin >> a;
mp[a]++;
}
vector<pair<ll, ll>> ans;
for(auto p: mp) ans.push_back(make_pair(p.second, p.first));
sort(all(ans), greater<pair<ll, ll>>());
ll sum = 0;
for(ll i=k; i<ans.size(); i++){
sum += ans[i].first;
}
cout << sum << endl;
}
| 0
| 29,989,672
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rept(i, j, n) for(int i=(j); i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
set<int> st;
rep(i, 3){
int a; cin >> a;
st.insert(a);
}
cout << st.size() << ln;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(void)
{
IOS
int N, M, K;
cin >> N >> M >> K;
if (N > M) swap(N,M);
bool ans = false;
REP(i,N+1) {
int count = M*i;
int md = N - i*2;
int rest = K-count;
if (md == 0) {if (count == K) ans = true;}
else if (md > 0 && rest > 0) {if (rest % md == 0 && rest / md <= M) ans = true;}
else if (md < 0 && rest < 0) {if (rest % md == 0 && rest / md <= M) ans = true;}
if (ans) break;
}
ATYN(ans)
return 0;
}
| 0
| 18,977,560
|
#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <iomanip>
using namespace std;
#define vsort(v) sort(v.begin(), v.end())
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
#define vunique(v) unique(v.begin(), v.end())
#define mp make_pair
#define ts(x) to_string(x)
#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define repm(i, a, b) for(int i = (int)a; i > (int)b; i--)
#define bit(a) bitset<8>(a)
#define des_priority_queue priority_queue<int, vector<int>, greater<int> >
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1ll << 60;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, k, rsl;
cin >> n >> k;
rsl = n - k + 1;
cout << rsl << endl;
}
|
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n,len,x=0;
int nA=0,nB=0,nAB=0;
cin>>n;
while(n--)
{
string arr;
cin>>arr;
len=arr.size();
for(int i=0;i<len-1;i++)
{
if(arr[i]=='A'&&arr[i+1]=='B')
nAB++;
}
if(arr[0]=='B')
nB++;
if(arr[len-1]=='A')
nA++;
if(arr[0]=='B'&&arr[len-1]!='A'||arr[0]!='B'&&arr[len-1]=='A')
x=1;
}
if(x==0&&nA>0)
nA--;
cout<<nAB+min(nA,nB);
return 0;
}
| 0
| 78,373,727
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if(X == Y) cout << -1 << endl;
else {
for(long long i = 1; i <= Y; i++) {
if((X*i) % Y != 0) {
cout << X*i << endl;
break;
}
if(i == Y) cout << -1 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(a) int((a).size())
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
template<class T, class U> inline void add_self(T &a, U b){a += b;if (a >= mod) a -= mod;if (a < 0) a += mod;}
template<class T, class U> inline void min_self(T &x, U y) { if (y < x) x = y; }
template<class T, class U> inline void max_self(T &x, U y) { if (y > x) x = y; }
#define _deb(x) cout<<x;
void _print() {cerr << "]\n";} template <typename T, typename... V>void _print(T t, V... v) {_deb(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
template <class T, class U> void print_m(const map<T,U> &m, int w=3){if(m.empty()){cout<<"Empty"<<endl; return;}for(auto x: m)cout<<"("<<x.first<<": "<<x.second<<"),"<<endl;cout<<endl;}
template<class T, class U>void debp(const pair<T, U> &pr, bool end_line=1){cout<<"{"<<pr.first<<" "<<pr.second<<"}"; cout<<(end_line ? "\n" : ", ");}
template <class T> void print_vp(const T &vp, int sep_line=0){if(vp.empty()){cout<<"Empty"<<endl; return;}if(!sep_line) cout<<"{ ";for(auto x: vp) debp(x,sep_line);if(!sep_line) cout<<"}\n";cout<<endl;}
template <typename T>void print(const T &v, bool show_index = false){int w = 2;if(show_index){for(int i=0; i<sz(v); i++)cout<<setw(w)<<i<<" ";cout<<endl;}for(auto &el: v) cout<<setw(w)<<el<<" ";cout<<endl;}
template <typename T>void print_vv(const T &vv){if(sz(vv)==0) {cout<<"Empty"<<endl; return;} int w = 3;cout<<setw(w)<<" ";for(int j=0; j<sz(*vv.begin()); j++)cout<<setw(w)<<j<<" ";cout<<endl;int i = 0;for(auto &v: vv){cout<<i++<<" {";for(auto &el: v) cout<<setw(w)<<el<<" ";cout<<"},\n";}cout<<endl;}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
while(cin>>s){
ll sum = 0;
for(auto x: s){
sum+=(x-'0');
}
sum%=9;
cout<<(sum==0 ? "Yes\n" : "No\n");
}
return 0;
}
| 0
| 99,689,037
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,d;
cin>>n>>d;
int x[n][d];
int cnt=0;
rep(i,n)rep(j,d)cin>>x[i][j];
int ians=0;
double fans=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
for(int k=0;k<d;k++){
ians+=(x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
fans+=(x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
}
ians=sqrt(ians);
fans=sqrt(fans);
if(ians==fans)cnt++;
ians=0;
fans=0;
}
}
cout<<cnt<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> a(n);
vector<ll> num(n + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
num[a[i]]++;
}
ll sum = 0;
for (ll i = 0; i <= n; i++) {
if (2 <= num[i]) {
sum += num[i] * (num[i] - 1) / 2;
}
}
for (ll i = 0; i < n; i++) {
ll ans;
ans = sum;
ans -= num[a[i]] * (num[a[i]] - 1) / 2;
ans += (num[a[i]] - 1) * (num[a[i]] - 2) / 2;
cout << ans << endl;
}
return 0;
}
| 0
| 87,029,505
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << 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;
}
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; }
int n, m, k;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m >> k;
if (k % n == 0)
return yes, 0;
if (k % m == 0)
return yes, 0;
rep(i, n)
{
rep(j, m)
{
if(k==i*m+j*n-2*i*j)return yes,0;
}
}
no;
}
|
#include <bits/stdc++.h>
using namespace std;
long long N, K;
string S;
long long pow(long long N, long long K) {
long long res = 1;
for (int i = 0; i < K; i++)
{
res *= N;
}
return res;
}
long long com(long long N, long long R) {
if(N < R || R < 0) return 0;
if(R == 1) return N;
else if(R == 2) return N * (N-1) / 2;
else return N * (N-1) * (N-2) / 6;
}
long long solve(int i, int k, int smaller) {
if(i == N) {
if(k == 0) return 1;
else return 0;
}
if(k == 0) return 1;
if(smaller) return com(N-i, k) * pow(9, k);
else {
if(S[i] == '0') return solve(i+1, k, false);
else {
long long zero = solve(i+1, k, true);
long long aida = solve(i+1, k-1, true) * (S[i] - '1');
long long icchi = solve(i+1, k-1, false);
return zero + aida + icchi;
}
}
}
int main() {
cin >> S >> K;
N = S.size();
cout << solve(0, K, false) << endl;
return 0;
}
| 0
| 78,861,667
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string B[N];
for(int i=0;i<N;i++) cin>>B[i];
int M;
cin>>M;
string R[M];
for(int i=0;i<M;i++) cin>>R[i];
int A=0;
for(int i=0;i<N;i++){
int sum=0;
for(int j=i;j<N;j++){
if(B[i]==B[j]) sum++;
}
for(int k=0;k<M;k++){
if(B[i]==R[k]) sum--;
}
A=max(A,sum);
}
cout<<A<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
int H,W;
for (;;){
cin >> H >> W;
if (H == 0&&W == 0)break;
for (int a = 1;a <= W;a++){
if (W == 0||H == 0)break;
cout << "#";
}
cout << endl;
for (int b = 1;b <= H - 2;b++){
if (W == 0 || H == 0)break;
cout << "#";
for (int c = 1;c <= W - 2;c++){
cout << ".";
}
cout << "#" << endl;
}
for (int c = 1;c <= W;c++){
if (W <= 1|| H <= 1)break;
cout << "#";
}
cout << endl;
cout << endl;
}
return 0;
}
| 0
| 53,223,793
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double current_rate, next_rate;
cin >> current_rate >> next_rate;
double performance = 2 * next_rate - current_rate;
cout << performance << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i=0; i<n;i++)
s1+=s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b){
if (a == 0) return b;
return gcd(b % a, a);
}
void solve(){
ll n,k;
cin>>n>>k;
ll ans=0;
if(k%2LL==0LL){
k=k/2LL;
ll num= n/k;
ll ev= num/2,od=num-num/2;
ans+= ev*ev*ev+od*od*od;
k=2LL*k;
cout<<ans<<endl;
return;
}
ans+= (n/k)*(n/k)*(n/k);
cout<<ans<<endl;
}
int main(){
optimizeIO();
{ solve();
}
}
| 0
| 42,421,089
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
string s, p, ans = "No";
int init;
cin >> s >> p;
init = s.length();
s.append(s);
for(int i=0; i<init; i++){
bool flag = true;
for(int j=0; j<p.length(); j++){
if(p[j] != s[j+i]){
flag = false;
break;
}
}
if(flag){
ans = "Yes";
break;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll N=1e6+5,inf=1e18,mod=1e9+7;
#define test ll testcases;cin>>testcases; while(testcases--)
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define vld vector<ld>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define vpll vector<pll>
#define vpld vector<pld>
#define all(X) X.begin(),X.end()
#define sz(x) ((ll)((x).size()))
const ld pi=3.141592653589793238;
bool check_prime(ll n)
{
ll flag=0,i;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
flag=1;
break;
}
}
if(n==1)
{
return false;
}
else if(flag==0 || n==2 || n==3)
{
return true;
}
else
{
return false;
}
}
ll fastexpo(ll a,ll b,ll MOD)
{
ll result=1;
while(b>0)
{
if(b%2==1)
{
result=(result*a)%MOD;
}
a=(a*a)%MOD;
b=b/2;
}
return result;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,p;
cin>>n;
if(n%2==0)
{
n/=2;
p=0;
while(n>0)
{
p+=(n/5);
n=n/5;
}
cout<<p<<"\n";
}
else
{
cout<<"0\n";
}
return 0;
}
| 0
| 99,703,126
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,d,a;
cin>>n>>d>>a;
vector<pair<ll,ll>>ch;
for(ll i=0;i<n;i++){
ll x,y;
cin>>x>>y;
ch.push_back(make_pair(x,y));
}
sort(ch.begin(),ch.end());
queue<pair<ll,ll>>q;
ll ans=0;
ll dm=0;
for(ll i=0;i<n;i++){
ll nowx=ch[i].first;
while(q.size()!=0&&q.front().first<nowx){
dm-=q.front().second;
q.pop();
}
ch[i].second-=dm;
if(ch[i].second>0){
ans+=(ch[i].second+a-1)/a;
ll dm1=((ch[i].second+a-1)/a)*a;
dm+=dm1;
q.push(make_pair(nowx+2*d,dm1));
}
}
cout <<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define CALL(c) (c).cbegin(), (c).cend()
#define RALL(c) (c).rbegin(), (c).rend()
#define CRALL(c) (c).crbegin(), (c).crend()
#define REP(i, n) for (int i = 0; i < static_cast<int>(n); i++)
#define FOR(i, s, n) for (int i = s; i < static_cast<int>(n); i++)
#define PSORT(s,p,e) partial_sort((s), next((s), (p)), (e))
#define VIEW(v,t) for_each((v).begin(), (v).end(), [](t& a) { cout << a << " "; }); cout << endl;
using PII = pair<int, int>;
using LL = long long;
using ULL = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using V2 = vector<vector<T>>;
const ULL fr = 1000000007;
int N;
V<ULL> T;
V<ULL> A;
V<ULL> X;
V<ULL> C;
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
cin >> N;
REP(i, N) {
ULL x;
cin >> x;
T.push_back(x);
}
REP(i, N) {
ULL x;
cin >> x;
A.push_back(x);
}
ULL mt = T[0];
ULL ma = A[0];
X.push_back(min(T[0], A[0]));
FOR(i,1,N) {
if(mt < T[i]) mt = T[i];
if(ma < A[i]) ma = A[i];
if(T[i-1] > T[i] || A[i-1] < A[i]) {
cout << 0 << "\n";
return 0;
}
if(T[i-1] < T[i] && T[i] > A[i]) {
}
if(A[i-1] > A[i] && A[i-1] > T[i-1]) {
cout << 0 << "\n";
return 0;
}
X.push_back(min(T[i], A[i]));
}
if (mt != ma) {
cout << 0 << "\n";
return 0;
}
REP(i, N) {
int ct = 0;
C.push_back(1);
int e = C.size()-1;
FOR(j,i+1,N) {
if(X[i] != X[j]) break;
ct++;
}
int y = ct;
if(A[i+ct] == T[i+ct]) y--;
REP(j,y) {
C[e] *= (X[i] % fr);
C[e] = (C[e] % fr);
}
i += ct;
}
ULL ans = 1;
REP(i, C.size()) {
ans *= (C[i] % fr);
ans = (ans % fr);
}
cout << ans << "\n";
}
| 0
| 10,776,291
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll num = N/K;
ll rem = N%K;
ll count = 0;
count += pow(num, 3);
if (K % 2 == 0) {
if (rem >= K/2) num ++;
count += pow(num, 3);
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int n;
string s;
cin>>n>>s;
int type[2*n];
int cnt=0;
rep(i,2*n){
type[i]=(i+s[i])%2;
if(type[i])++cnt;
}
if(cnt!=n){
cout<<0<<endl;
return 0;
}
ll ans=1;
int sum=0;
rep(i,2*n){
if(type[i]=='B'%2){
++sum;
}
else{
ans*=sum--;
ans%=mod;
}
}
for(int i=1;i<=n;++i){
ans=(ans*i)%mod;
}
cout<<ans<<endl;
}
| 0
| 505,136
|
#include<iostream>
int main(){
int n,k;
std::cin >> n >> k;
std::cout << n-k+1;
return 0;
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <numeric>
#include <float.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef unsigned long long ll;
int my_gcd(int n , int m){
if(n < m){
int tmp = n;
n = m;
m = tmp;
}
int l = n % m;
while(l != 0){
n = m;
m = l;
l = n % m;
}
return m;
}
int ctoi(char c) {
switch (c) {
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default: return 0;
}
}
int main(){
int ans = 0;
int X; cin >> X;
int a = X / 100;
int b = X % 100;
rep(i,a){
if((i+1) * 5 >= b) ans = 1;
}
cout << ans << endl;
}
| 0
| 56,842,286
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const long long INF = 1LL <<60;
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll choose2(ll n){
return n*(n-1)/2;
}
int main(){
string n;
cin>>n;
rep(i,0,2){
if(n[i] == '9') cout<<1;
else cout<<9;
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, C, K;
cin >> N >> C >> K;
vector<int> T(N);
for (int i = 0; i < N; i++) {
cin >> T.at(i);
}
SORT(T);
int ans = 0;
for (int i = 0; i < N;) {
int passenger = 0;
int first = T.at(i);
int end = T.at(i);
while ((i < N) && (C > passenger)) {
end = T.at(i);
if (K < end - first) { break; }
++passenger;
++i;
}
++ans;
}
cout << ans << endl;
}
| 0
| 20,198,959
|
#include<iostream>
#include<limits.h>
using namespace std;
int n,m;
const int MAX = 50;
const int MAXN = 100000;
const int INF = INT_MAX;
int C[MAX];
int T[MAXN];
void solve()
{
for(int i = 1; i <= m; i++)
for(int j = C[i]; j <= n; j++)
{
T[j] = min(T[j],T[j-C[i]]+1);
}
cout << T[n]<<endl;
}
int main()
{
cin >> n >> m;
for(int i = 1 ; i <= m; i++)
cin >> C[i];
for(int i = 1 ; i <= n; i++)
T[i] = INF;
T[0] = 0;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x)
#endif
const int INF = 1e9; const LL LINF = 1e16;
const LL MOD = 1000000007; const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
template<typename F>
vector<typename F::t> ZetaTransformSubset(const int n, const vector<typename F::t>& A) {
using T = typename F::t;
vector<T>a = A;
for (int i = 0; i < n; i++) {
for (int s = 0; s < 1 << n; s++) {
if ((s >> i & 1) == 1)
a[s] = F::op(a[s], a[s ^ (1 << i)]);
}
}
return a;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N; cin >> N;
int M = 1 << N;
vector<PII> a(M);
FOR(i, 0, M) {
cin >> a[i].first; a[i].second = 0;
}
struct F {
using t = PII;
F() {}
static t op(const t& a, const t& b) {
t ret;
int x[4];
x[0] = a.first, x[1] = a.second, x[2] = b.first, x[3] = b.second;
sort(x, x + 4);
ret.first = x[3], ret.second = x[2];
return ret;
}
};
vector<PII> b = ZetaTransformSubset<F>(N, a);
int ans = 0;
FOR(i, 1, M) {
ans = max(ans, b[i].first + b[i].second);
cout << ans << "\n";
}
return 0;
}
| 0
| 6,549,811
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define dunk(a) cout << (a) << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
int main() {
int r; cin >> r;
dunk(r * r);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,k,i;
string ans="NG";
cin >> k >> a >> b;
for(i=a; i<=b; i++)
{
if(i%k == 0){
ans = "OK";
break;
}
}
cout << ans << endl;
return 0;
}
| 0
| 90,326,134
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
ll N; cin >> N;
ll A[200001];
ll maxx1 = 0, maxx2 = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if(maxx1 <= A[i]){
maxx2 = maxx1;
maxx1 = A[i];
} else if(maxx2 < A[i]){
maxx2 = A[i];
}
}
for (int i = 0; i < N; i++) {
if(A[i] == maxx1){
cout << maxx2 << endl;
} else {
cout << maxx1 << endl;
}
}
}
|
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = 1000000000;
const double PI = acos(-1);
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax&&m) {
vector<int>v;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
v.emplace_back(a);
}
sort(v.begin(), v.end(), greater<int>());
nmin--, nmax--;
int gap = 0;
int ans = 0;
for (int i = nmin; i <= nmax; i++) {
if (gap <= v[i] - v[i + 1]) {
gap = v[i] - v[i + 1];
ans = i;
}
}
cout << ans+1 << endl;
}
}
| 0
| 32,177,634
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,C;
cin>>N>>A>>B>>C;
vector<int> l(N);
for(int i=0;i<N;i++){
cin>>l[i];
}
vector<int> p((1<<N),167167167);
vector<int> q((1<<N),167167167);
vector<int> r((1<<N),167167167);
for(int i=1;i<(1<<N);i++){
int L=0,X=0;
vector<int> a;
for(int j=0;j<N;j++){
if(i&(1<<j)){
L+=l[j];
}
else{
a.push_back(j);
X++;
}
}
for(int j=0;j<(1<<X);j++){
int Y=i;
for(int k=0;k<X;k++){
if(j&(1<<k)){
Y+=(1<<a[k]);
}
}
p[Y]=min(p[Y],abs(L-A)+10*(N-X-1));
q[Y]=min(q[Y],abs(L-B)+10*(N-X-1));
r[Y]=min(r[Y],abs(L-C)+10*(N-X-1));
}
}
int Z=167167167;
for(int i=1;i<(1<<N);i++){
for(int j=1;j<(1<<N);j++){
if(i&j){
continue;
}
int k=((1<<N)-1)^(i|j);
Z=min(Z,p[i]+q[j]+r[k]);
}
}
cout<<Z<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200010;
vector<int> num(p,0);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int ans = 0;
for (int i = k; i < p; i++) {
if (num[i] == 0) break;
ans += num[i];
}
cout << ans << endl;
return 0;
}
| 0
| 55,457,689
|
#include<iostream>
#include<string>
using namespace std;
int main() {
string str;
cin >> str;
int n;
cin >> n;
for(int i = 0 ; i < n ; i++ ){
string op;
cin >> op;
if(op == "replace") {
int a, b;
string repstr;
cin >> a >> b >> repstr;
auto it = str.begin() + a;
for (int j = 0; j <= b-a; j++){
*it++ = repstr[j];
}
} else if (op == "reverse") {
int a, b;
cin >> a >> b;
string str2 = str;
auto it = str.begin() + a;
auto it2 = str2.begin() + b;
for (int j = 0; j <= b-a; j ++) {
*it++ = *it2--;
}
} else if (op == "print") {
int a, b;
cin >> a >> b;
auto it = str.begin() + a;
for (int j = 0; j <= b-a; j++){
cout << *it++;
}
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0;
int a[200005],visited[200005];
signed main()
{
cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++) visited[a[i]]++;
for (int i=1;i<=200000;i++) ans=max(ans,visited[i]+visited[i-1]+visited[i+1]);
cout<<ans<<endl;
return 0;
}
| 0
| 32,400,040
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, L;
cin >> N >> L;
vector<string> S(N);
rep(i, N) cin >> S[i];
sort(S.begin(), S.end());
rep(i, N) cout << S[i];
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void){
string s, p;
cin >> s >> p;
s = s + s;
if (s.find(p) != string::npos) {
cout << "Yes" << "\n";
}
else {
cout << "No" << "\n";
}
return 0;
}
| 0
| 71,739,956
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 10;
int a[MAXN], b[MAXN];
int n, mx = 0;
template <class T>
inline void _read(T &x)
{
x = 0;
char t = getchar();
while (!isdigit(t) && t != '-') t = getchar();
if (t == '-')
{
_read(x);
x *= -1;
return ;
}
while (isdigit(t))
{
x = x * 10 + t - '0';
t = getchar();
}
}
int main()
{
_read(n);
for (int i = 1; i <= n; ++i) _read(a[i]), mx = max(mx, a[i]), ++b[a[i]];
if(mx & 1)
{
for(int i = mx; i >= (mx + 1) / 2; --i)
if(b[i] < 2)
{
puts("Impossible");
return 0;
}
for(int i = 1; i < (mx + 1) / 2; ++i)
if(b[i])
{
puts("Impossible");
return 0;
}
if(b[(mx + 1) / 2] > 2)
{
puts("Impossible");
return 0;
}
}
else
{
for(int i = mx; i > mx / 2; --i)
if(b[i] < 2)
{
puts("Impossible");
return 0;
}
for(int i = 1; i < mx / 2; ++i)
if(b[i])
{
puts("Impossible");
return 0;
}
if(b[mx / 2] != 1)
{
puts("Impossible");
return 0;
}
}
puts("Possible");
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=100005;
int n,a[maxn],b[maxn];
ll ans;
inline int read(){
int res=0,f_f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f_f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') res=(res<<3)+(res<<1)-'0'+ch,ch=getchar();
return res*f_f;
}
int main(){
n=read();
for (int i=1;i<=n;i++){
a[i]=read(),b[i]=read();
}
for (int i=n;i;i--){
a[i]=(ans+a[i])%b[i];
if(a[i]) ans+=b[i]-a[i];
}
printf("%lld\n",ans);
return 0;
}
| 0
| 35,387,249
|
#include <bits/stdc++.h>
int main() {
int m, f, r;
for(;;) {
std::cin >> m >> f >> r;
if( m == -1 && f == -1 && r == -1 ) {
break;
}
if( m == -1 || f == -1 ) {
std::cout << "F" << std::endl;
}
else if( m + f >= 80 ) {
std::cout << "A" << std::endl;
}
else if( 65 <= m + f && m + f < 80 ) {
std::cout << "B" << std::endl;
}
else if( 50 <= m + f && m + f < 65 ) {
std::cout << "C" << std::endl;
}
else if( 30 <= m + f && m + f < 50 && r >= 50 ) {
std::cout << "C" << std::endl;
}
else if( 30 <= m + f && m + f < 50 ) {
std::cout << "D" << std::endl;
}
else {
std::cout << "F" << std::endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t,int64_t> pll;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};
#define rep(i,a,b) for (int64_t i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
#define ALL(a) begin(a),end(a)
#define sz(s) (s).size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int mcxiin(string x)
{
int sum=0;
REP(k,x.size())
{
if(x[k]=='m'){if(k==1)sum+=1000*(int)(x[0]-'0');else sum+=1000;}
else if(x[k]=='c'){if(x[k-1]<='9'&&x[k-1]>'1')sum+=100*(int)(x[k-1]-'0');else sum+=100;}
else if(x[k]=='x'){if(x[k-1]<='9'&&x[k-1]>'1')sum+=10*(int)(x[k-1]-'0');else sum+=10;}
else if(x[k]=='i'){if(x[k-1]<='9'&&x[k-1]>'1')sum+=(int)(x[k-1]-'0');else sum+=1;}
}
return sum;
}
string mcxiout(int x)
{
string xx=to_string(x);
string sum;
if(x/1000){if(xx[xx.size()-4]!='1')sum.push_back(xx[xx.size()-4]);sum.push_back('m');}
if(x/100%10){if(xx[xx.size()-3]!='1')sum.push_back(xx[xx.size()-3]);sum.push_back('c');}
if(x/10%10){if(xx[xx.size()-2]!='1')sum.push_back(xx[xx.size()-2]);sum.push_back('x');}
if(x%10){if(xx[xx.size()-1]!='1')sum.push_back(xx[xx.size()-1]);sum.push_back('i');}
return sum;
}
int main()
{
int n;cin>>n;
REP(lkafl,n)
{
string a,b;cin>>a>>b;
int av=mcxiin(a);int bv=mcxiin(b);
int ab=av+bv;
cout<<mcxiout(ab)<<endl;
}
}
| 0
| 69,105,301
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename Head, typename... Tail> const Head& var_min(const Head &head, const Tail&... tail) { return min(head, var_min(tail...)); }
template <typename Head, typename... Tail> const Head& var_max(const Head &head, const Tail&... tail) { return max(head, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
void init_io() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
#ifdef DEBUGGING
#include "../debug.cpp"
#else
#define DEBUG(...) 0
#endif
int main() {
init_io();
ll N;
cin >> N;
V<ll> A(N);
for(ll &e : A) cin >> e;
ll ok = 5e18, ng = -1;
auto ceil = [](ll n, ll k) { return n / k + !!(n % k); };
while(ok - ng > 1) {
ll mid = (ok + ng) / 2;
V<ll> cpy = A;
ll times;
bool suc = false;
for(times = max<ll>(0, mid - 2 * N); times <= mid; times++) {
ll cnt = 0;
for(ll e : cpy) {
e += times;
e -= (N - 1);
chmax(e, (ll)0);
cnt += ceil(e, N + 1);
}
if(cnt <= times) {
suc = true;
break;
}
}
if(suc) ok = mid;
else ng = mid;
}
cout << ok << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i,a,b) for(ll int i=a;i<b;i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define lower(u) transform(u.begin(), u.end(), u.begin(), ::tolower);
#define upper(u) transform(u.begin(), u.end(), u.begin(), ::toupper);
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define N 100005
void solve()
{
ll a,b;
cin>>a>>b;
string A,B;
rep(i,0,a)
{
B+='0'+b;
}
rep(i,0,b)
{
A+='0'+a;
}
if(A<B)
{
cout<<A<<endl;
}
else
{
cout<<B<<endl;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS=1;
while(TESTS--)
{
solve();
}
return 0;
}
| 0
| 61,712,600
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin() , v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
int main(){
string s; cin >> s;
if(s[0] == 'Y'
&& s[1] == 'A'
&& s[2] == 'K'
&& s[3] == 'I'){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
|
#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z) lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y)
#define deg2rad(deg) ((((double)deg)/((double)360)*2*M_PI))
#define rad2deg(rad) ((((double)rad)/(double)2/M_PI)*(double)360)
#define Find(set, element) set.find(element) != set.end()
#define Decimal(x) cout << fixed << setprecision(10) << x << endl;
#define endl "\n"
#define Case(x) printf("Case #%d: ", x);
typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<char> vch;
typedef vector<vector<char>> vvch;
constexpr ll LINF = 1001002003004005006ll;
constexpr int INF = 1001001001;
constexpr int n_max = 2e5+10;
template<class T>
inline bool chmax(T &a, T b) { if(a<b) { a=b; return true; } return false; };
template<class T>
inline bool chmin(T &a, T b) { if(a>b) { a=b; return true; } return false; };
template<class T, class U>
T POW(T x, U n) {T ret=1; while (n>0) {if (n&1) {ret*=x;} x*=x; n>>=1;} return ret;};
template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string &s) {return '"' + s + '"';};
string to_string(const char c) {return to_string((string) &c);};
string to_string(bool b) {return (b ? "true" : "false");};
template <size_t N>
string to_string(bitset<N> v){
string res = "";
for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
return res;
};
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for(const auto &x : v) {
if(!first) res += ", ";
first = false; res += to_string(x);
}
res += "}";
return res;
};
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
void debug_out() {cerr << endl;};
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); };
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 71
#endif
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
};
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
};
template <class T>
void print(vector<vector<T>> &df) {
for (auto& vec : df) {
print(vec);
}
};
int calc_black(vvi &grid) {
int h = grid.size();
int w = grid[0].size();
int ret = 0;
rep(i, 0, h) {
rep(j, 0, w) {
ret += grid[i][j];
}
}
return ret;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int H, W, K; cin >> H >> W >> K;
vvi grid(H, vi(W, 0));
rep(i, 0, H) {
rep(j, 0, W) {
char c; cin >> c;
if (c == '#') grid[i][j]++;
}
}
int ans = 0;
rep(i, 0, 1 << H) {
auto tmp_grid = grid;
rep(h, 0, H) {
if ((i>>h)&1) {
rep(w, 0, W) {
tmp_grid[h][w] = 0;
}
}
}
rep(j, 0, 1 << W) {
auto tmp_grid_ = tmp_grid;
rep(w, 0, W) {
if ((j>>w)&1) {
rep(h, 0, H) {
tmp_grid_[h][w] = 0;
}
}
}
int k = calc_black(tmp_grid_);
if (k == K) {
ans++;
}
}
}
cout << ans << endl;
return 0;
};
| 0
| 31,847,951
|
#include <iostream>
#include <climits>
using namespace std;
int main(){
int n;
int res[20];
int numres = 0;
while(1){
cin >> n;
if(n==0){
break;
}
int max = INT_MIN;
int min = INT_MAX;
int total = 0;
int read;
for(int i=0; i<n; i++){
cin >> read;
total += read;
if(read < min){
min = read;
}
if(read > max){
max = read;
}
}
res[numres] = (total - max - min)/(n-2);
numres++;
}
for(int i=0; i< numres; i++){
cout << res[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tsie(nullptr);cout.tie(nullptr)
#define watch(x) cout << (#x) << " is " << (x) <<"#" <<endl
#define PI 3.1415926535
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii ;
typedef vector<ll> vi ;
typedef vector<ii> vii ;
const ll mod = 998244353;
const ll MAX = 3e3+23;
const ll inf = 1e18+7;
int main(){
fastio;
ll a,b,ans=0;
cin>>a>>b;
f(i,1,1500){
if((i*8)/100==a && (i*10)/100 == b){ans=i;break;}
}
if(ans) cout<<ans<<"\n";
else cout<<"-1\n";
return 0;
}
| 0
| 46,886,057
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
ll a,b,c;
cin >> a >> b >> c;
for (int i = 0; i < 10; i++) {
c = a * c - b;
cout << c << endl;
}
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
const long long INF = 1e18;
const int mod = 1e9 + 7;
const double Pi = acos(-1);
void Fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n, m;
int Color[100005];
vector <int> Adj[100005];
long long cnt, bi, nbi;
signed main()
{
Fastio();
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
Color[i] = -1;
}
for(int i = 1; i <= m; i++)
{
int u, v;
cin >> u >> v;
Adj[u].eb(v);
Adj[v].eb(u);
}
for(int i = 1; i <= n; i++)
{
if(Adj[i].size() == 0)
{
cnt++;
continue;
}
if(Color[i] != -1)
{
continue;
}
queue <int> BFS;
BFS.push(i);
Color[i] = 0;
bool ok = true;
while(BFS.empty() == false)
{
int node = BFS.front();
BFS.pop();
for(auto x : Adj[node])
{
if(Color[x] == -1)
{
Color[x] = Color[node] ^ 1;
BFS.push(x);
}
else
{
if(Color[x] == Color[node])
{
ok = false;
}
}
}
}
if(ok)
{
bi++;
}
else
{
nbi++;
}
}
cout << cnt * cnt + cnt * (n - cnt) * 2 + bi * bi * 2 + 2 * bi * nbi + nbi * nbi;
}
| 0
| 41,008,169
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
float x;
x = (a + b) / 2.0 + 0.5;
cout << static_cast<int>(x) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1e9+7;
const ll INF = 1e18;
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << setprecision(15) << fixed;
chrono::system_clock::time_point start,end;
start = chrono::system_clock::now();
ll n;
cin >> n;
deque<ll> a;
rep(i,n) {
ll t;
cin >> t;
if (i%2 == 0) {
a.push_front(t);
}
else {
a.push_back(t);
}
}
if (n%2 == 0) {
for (auto itr = a.end()-1; itr != a.begin()-1; --itr) {
cout << *itr << ' ';
}
}
else {
for(auto itr = a.begin(); itr != a.end(); ++itr) {
cout << *itr << ' ';
}
}
end = chrono::system_clock::now();
auto elapsed = chrono::duration_cast< chrono::milliseconds >(end - start).count();
cerr << elapsed << "ms" << '\n';
}
| 0
| 33,716,023
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
int N, M, V, P;
vector<int> A;
bool f(int x){
if(N-P <= x) return true;
if(A[x]+M < A[N-P]) return false;
int cnt = 0;
REP(i, N-P+1){
if(i == x) continue;
cnt += min(M, A[x]+M-A[i]);
}
if(cnt >= M*(V-P)) return true;
return false;
}
signed main() {
cin >> N >> M >> V >> P;
A.resize(N);
REP(i, N) cin >> A[i];
sort(ALL(A));
int ok = N-1;
int ng = -1;
while(ok-ng > 1){
int mid = (ok+ng)/2;
if(f(mid)) ok = mid;
else ng = mid;
}
cout << A.end()-lower_bound(ALL(A), A[ok]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) {
cin >> x;
}
int max = a.at(0);
int min = a.at(0);
for (int x : a) {
if (x > max) {
max = x;
}
if (x < min) {
min = x;
}
}
cout << max - min << endl;
}
| 0
| 40,240,815
|
#include <bits/stdc++.h>
int main() {
int m,v,r;
std::queue<std::string> seiseki;
while(1) {
std::cin >> m >> v >> r;
if(m == -1 && v == -1 && r == -1) {
break;
}else if(m + v >= 80 && m != -1 && v != -1) {
seiseki.push("A");
}else if(m + v >= 65 && m + v < 80 && m != -1 && v != -1) {
seiseki.push("B");
}else if(m + v >= 50 && m + v < 65 && m != -1 && v != -1) {
seiseki.push("C");
}else if(m + v >= 30 && m + v < 50 && m != -1 && v != -1) {
if(r >= 50) {
seiseki.push("C");
}else if(r < 50){
seiseki.push("D");
}
}else{
seiseki.push("F");
}
}
while(!seiseki.empty()) {
std::cout << seiseki.front() << std::endl;
seiseki.pop();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
int to;
T cost;
edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
int R, S, P;
cin >> R >> S >> P;
string T;
cin >> T;
auto dp = make_vec(N + 1, 3, 0LL);
for(int i = 0; i < N; i++) {
for(int j = 0; j < 3; j++) {
for(int k = 0; k < 3; k++) {
if(i - K >= 0 && k == j)
continue;
int point = 0;
if(k == 0) {
if(T[i] == 's')
point = R;
} else if(k == 1) {
if(T[i] == 'r')
point = P;
} else if(k == 2) {
if(T[i] == 'p')
point = S;
}
dp[i][k] =
max(dp[i][k], (i - K >= 0 ? dp[i - K][j] : 0) + point);
}
}
}
ll res = 0;
for(int i = N - 1; i >= N - K; i--) {
ll tmp = 0;
for(int j = 0; j < 3; j++) {
tmp = max(tmp, dp[i][j]);
}
res += tmp;
}
cout << res << endl;
}
| 0
| 5,761,116
|
#include <bits/stdc++.h>
using namespace std;
int n,m;
int f[100004],h[100004];
int F(int x){
if(f[x]==x)return x;
int pa=F(f[x]);
h[x]+=h[f[x]],f[x]=pa;
return f[x];
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)f[i]=i;
for(int i=1;i<=m;i++){
int L,R,D;scanf("%d%d%d",&L,&R,&D);
int l=F(L),r=F(R);
if(l==r){
if(h[R]-h[L]!=D){
puts("No");
return 0;
}
}else{
f[r]=l;
h[r]=D+h[L]-h[R];
}
}
puts("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> cut={"maerd","remaerd","esare","resare"};
reverse(S.begin(),S.end());
bool all_cut=false;
for(int i=0;;){
if(i==S.size()){
all_cut=true;
break;
}
bool exist_cut=false;
for(int j=0;j<4;j++){
if(S.substr(i,cut.at(j).size())==cut.at(j)){
exist_cut=true;
i+=cut.at(j).size();
break;
}
}
if(!exist_cut){
break;
}
}
if(all_cut){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
| 0
| 41,785,753
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int ar[3];
for(int i=0;i<3;++i) cin>>ar[i];
sort(ar,ar+3,greater<int>());
cout<<ar[0]-ar[2];
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
if (a + b - 1 > n) {
cout << -1 << "\n";
return 0;
}
if (a * b < n) {
cout << -1 << "\n";
return 0;
}
vl arr;
arr.reserve(n);
ll val = 0;
ll to_add = n - b + 1;
for (int i = 0; i < a; ++i) {
arr.push_back(val++);
}
ll lastb = val - 1;
val -= 2 * a;
for (int i = a; i < to_add; ++i) {
arr.push_back(val++);
if (i % a == a - 1) {
lastb = val - 1;
val -= 2 * a;
to_add++;
b--;
}
}
for (int i = 0; i < b - 1; ++i) {
lastb -= a;
arr.push_back(lastb);
}
vl sorted = arr;
sort(sorted.begin(), sorted.end());
for (int i = 0; i < n; ++i) {
cout << 1 + lower_bound(sorted.begin(), sorted.end(), arr[i]) - sorted.begin() << " ";
}
cout << endl;
return 0;
}
| 0
| 56,380,930
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int a, b, x;
cin >> a >> b >> x;
double ans = 0.0;
if (x >= (a*a*b+1)/2) {
double num = (double)b - ((double)x / (a*a));
double den = (double)a / 2.0;
ans = atan(num / den) / PI * 180.0;
}
else {
double num = (double)b;
double den = ((double)x / a * 2) / b;
ans = atan(num / den) / PI * 180.0;
}
printf("%.10f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i=0; i<n;i++)
s1+=s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b){
if (a == 0) return b;
return gcd(b % a, a);
}
struct dsu{
std::vector<int> par,rank;
dsu(int n):par(n+1),rank(n+1,1){
rep(i,1,n+1) par[i]=i;
}
int root(int a){
if(a==par[a]) return a;
return par[a]=root(par[a]);
}
void merge(int a,int b){
a=root(a);
b=root(b);
if(a==b) return;
if(rank[b]>rank[a]) swap(a,b);
par[b]=a;
rank[a]+=rank[b];
}
};
void solve(){
int n,m,x,y;
cin>>n>>m;
int p[n+1];
rep(i,1,n+1) cin>>p[i];
dsu d(n);
rep(i,0,m){
cin>>x>>y;
d.merge(x,y);
}
map<int,int> m1;
rep(i,1,n+1){
m1[p[i]]=i;
}
int ans=0;
rep(i,1,n+1){
if(d.root(i)==d.root(m1[i])) ans++;
}
cout<<ans<<endl;
}
int main(){
optimizeIO();
{ solve();
}
}
| 0
| 86,223,260
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool flag = false;
if (isupper(s[1]) || isupper(s[s.size()-1])){cout << "WA" << endl; return 0;}
for (int i = 0; i < s.size(); i++){
if (i == 0 && s[i] != 'A'){cout << "WA" << endl; return 0;}
if (s[i] == 'C'){
if (flag){cout << "WA" << endl; return 0;}
else{flag = true;}
}
}
if (flag){cout << "AC" << endl;}
else{cout << "WA" << endl;}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string S,T;
cin >> S >> T;
int N = S.size();
int M = T.size();
vector<string> cand;
for (int i = 0; i <= N - M; i++) {
string str = S;
bool can = true;
for (int j = 0; j < M; j++) {
if (S[i+j] == '?' || T[j] == S[i+j]) {
str[i+j] = T[j];
} else {
can = false;
}
}
if (can) {
for (int i = 0; i < str.size(); i++) {
if (str[i] == '?') {
str[i] = 'a';
}
}
cand.push_back(str);
}
}
if (cand.size() == 0) {
cout << "UNRESTORABLE" << endl;
return 0;
}
string ans = cand[0];
for (int i = 1; i < cand.size(); i++) {
ans = min(ans,cand[i]);
}
cout << ans << endl;
return 0;
}
| 0
| 58,388,332
|
#include <iostream>
using namespace std;
int hp,n;
int atk[1001];
int cost[1001];
int mem[10001];
int templen=0;
int f(int hp){
if (hp<=0&&hp!=-99999) return 0;
if (mem[hp]>0) return mem[hp];
int minn=99999999+99999999;
for (int i=0;i<n;i++){
if (hp>0){
int x=f(hp-atk[i])+cost[i];
if (x<minn) minn=x;
}
}
mem[hp]=minn;
return minn;
}
int main() {
cin>>hp>>n;
for (int i=0;i<n;i++){
cin>>atk[i]>>cost[i];
}
mem[0]=0;
for (int i=1;i<10001;i++){
mem[i]=-99999;
}
cout<<f(hp)<<endl;
}
|
#define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define check(s) cerr << s << endl
#else
#define dump(x)
#define dump2(x, y)
#define dump3(x, y, z)
#define check(s)
#endif
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
const ll LINF = 2e18;
const int INF = 1e9;
void solve(string S, ll K) {
bool allOne = true;
char c;
rep(i, K) {
if (S.at(i) != '1') {
allOne = false;
c = S.at(i);
break;
}
}
if (allOne)
cout << 1 << endl;
else
cout << c << endl;
}
int main() {
string S;
cin >> S;
ll K;
cin >> K;
solve(S, K);
return 0;
}
| 0
| 57,870,897
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string n;
cin >> n;
if(n.find("7")!=string::npos) {
cout << "Yes" <<'\n';
} else {
cout << "No" <<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int64_t a){if(a<=1)return false;for(int64_t i=2;(int64_t)i*i<=a;i++){if(a%i==0)return false;}return true;}
int get_adp(double x, int n){return (int)round((x-(int)x)*pow(10,n))%10;}
int64_t sigma(int64_t s, int64_t n){return n*(2*s+n-1)/2;}
int main()
{
int n, m, a, b;
cin >> n >> m;
vector<set<int>> ab(n);
vector<int> ans(n, -1);
for (int i = 0; i < m; i++)
{
cin >> a >> b;
ab[a - 1].insert(b - 1);
ab[b - 1].insert(a - 1);
}
queue<int> q;
q.push(0);
while (!q.empty())
{
int temp = q.front();
q.pop();
for (auto v: ab[temp])
{
if (ans[v] == -1)
{
ans[v] = temp;
q.push(v);
}
}
}
bool flag = true;
for (int i = 1; i < n; i++)
{
if (ans[i] == -1)
{
flag = false;
break;
}
}
cout << (flag ? "Yes" : "No") << endl;
if (flag)
{
for (int i = 1; i < n; i++)
{
cout << ans[i] + 1 << endl;
}
}
}
| 0
| 3,906,402
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N;
cin>>N;
map<char, int> amap;
string S;
for(int i=0;i<N;++i) {
cin>>S;
map<char, int> bmap;
for(int j=0;j<S.size();++j) {
bmap[S[j]]++;
}
if(i==0) {
for(char a='a';a<='z';++a) amap[a] = bmap[a];
}
else {
for(char a='a';a<='z';++a) amap[a] = min(amap[a], bmap[a]);
}
}
string ans;
for(char a='a';a<='z';++a) {
for(int i=0;i<amap[a];++i) ans.push_back(a);
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void read(int &x)
{
int f=1;
x=0;
char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-')
f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-'0';
s=getchar();
}
x*=f;
}
#define N 100005
int n,m,t;
int a[N],b[N];
int main(){
cin>>n>>m>>t;
for (int i = 1; i <= n; i++)
{
cin>>a[i];
}
for (int i = 1; i <= m; i++)
{
cin>>b[i];
}
int ans=1e9;
for (int i = 0; i < t; i++)
{
int x,y,c;
cin>>x>>y>>c;
ans= min(a[x]+b[y]-c,ans);
}
sort(a+1,a+n+1);
sort(b+1,b+m+1);
cout<<min(ans,a[1]+b[1]);
return 0;
}
| 0
| 49,095,210
|
#include<bits/stdc++.h>
using namespace std;
int N;
int A[1<<18];
int mv1[1<<18];
int mv2[1<<18];
int ans[1<<18];
void upd(int a, int b)
{
set<pair<int, int> > S;
S.emplace(A[mv1[a]], mv1[a]);
S.emplace(A[mv1[b]], mv1[b]);
S.emplace(A[mv2[a]], mv2[a]);
S.emplace(A[mv2[b]], mv2[b]);
auto it = S.rbegin();
auto it2 = it; ++it2;
mv1[a] = it->second; mv2[a] = it2->second;
}
int main()
{
scanf("%d", &N);
for(int i=0; i<(1<<N); ++i)
{
scanf("%d", A+i);
mv1[i] = i;
mv2[i] = i;
}
for(int i=1; i<(1<<N); ++i)
{
for(int j=0; j<N; ++j)
if(i&(1<<j)) upd(i, i-(1<<j));
ans[i] = max(ans[i-1], A[mv1[i]]+A[mv2[i]]);
printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,c,k,t;
cin>>n>>c>>k;
std::deque<long long int> deq;
for (int i=0;i<n;i++) {
cin>>t;
deq.emplace_back(t);
}
sort(deq.begin(),deq.end());
const long long INF=1LL<<60;
long long int limit=INF;
long long int count=1;
long long int tmp=c;
for (int i=0;i<n;i++) {
if (deq[i]<=limit) {
limit=min(limit,deq[i]+k);
tmp--;
} else {
count++;
tmp=c-1;
limit=deq[i]+k;
}
if (tmp==0) {
if (i!=n-1) {
count++;
tmp=c;
limit=INF;
}
}
}
cout<<count<<endl;
}
| 0
| 51,558,616
|
#ifdef __unix__
#include <bits/stdc++.h>
#else
#include <iostream>
#include <algorithm>
#include <math.h>
#include <functional>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <bitset>
#endif
#define fastIO ios_base::sync_with_stdio(0), cin.tie(NULL)
#define pb push_back
#define all(x) x.begin(), x.end()
#define endl '\n'
#define mkp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main(){
fastIO;
string s;
cin >> s;
for(int i = 0; i < s.size(); i++)
{
if (s[i] == '9') s[i] = '1';
else
if (s[i] == '1') s[i] = '9';
}
cout << s;
return 0;
}
|
#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
const int MAX_N = 1e5 + 5;
set<ll> remain;
map<ll, int> orig;
ll arr [MAX_N];
ll pos [MAX_N];
vector<ll> ans;
ll L;
void try_del (ll cur) {
auto it = remain.find(cur);
if (it == remain.end()) return;
if (it == remain.begin()) return;
if (next(it) == remain.end()) return;
ll nxt = *next(it);
ll prv = *prev(it);
if (nxt - prv < L) return;
remain.erase(it);
ans.push_back(cur);
try_del(nxt);
try_del(prv);
}
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n >> L;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) {
pos[i] = pos[i - 1] + arr[i];
orig[pos[i]] = i;
}
for (int i = 0; i <= n; i++) {
remain.insert(pos[i]);
}
for (int i = 1; i < n; i++) {
try_del(pos[i]);
}
if ((int) remain.size() != 2) {
cout << "Impossible" << endl;
exit(0);
}
cout << "Possible" << endl;
reverse(ans.begin(), ans.end());
for (ll x : ans) {
cout << orig[x] << '\n';
}
}
| 0
| 4,410,741
|
#include<bits/stdc++.h>
using namespace std;
#define ikarus_101 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpl;
typedef map<ll,ll> mll;
typedef multiset<ll> msl;
typedef multimap<ll,ll> Mll;
using pqboro=priority_queue<ll,vll,less<ll>>;
using pqchoto=priority_queue<ll,vll,greater<ll>>;
#define all(str) str.begin(),str.end()
#define sajo(str) sort(str.begin(),str.end())
#define rev(str) reverse(str.begin(),str.end())
#define usajo(str) sort(str.rbegin(),str.rend())
#define vin(a) for(auto &it : a) cin>>it
#define vout(a) for(auto it:a) cout<<it<<' ';cout<<nn
#define pb push_back
#define eb emplace_back
#define mkp(x,y) make_pair(x,y)
#define F first
#define S second
#define yes cout<<"YES"<<nn
#define no cout<<"NO"<<nn
#define nn "\n"
#define rep(i,n) for (i=0;i<n;++i )
#define rep1(i,n) for (i=1;i<=n;++i )
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define sqr(x) ((x)*(x))
#define pi 2*acos(0.0)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/gcd(a,b))*b
#define mem(a,b) memset(a,b,sizeof (a))
#define dec(x) cout<<fixed<<setprecision(x)
#define none(n) __builtin_popcountll(n)
template < typename T > string toString ( T Number ) { stringstream ss ; ss << Number ; return ss.str() ; }
template < typename T > ll toll ( T str ) { stringstream ss ; ss << str ; ll num ; ss >> num ; return num ; }
ll power(ll n , ll k) { if(k == 0) return 1 ; if(k&1) return n*sqr(power(n,k/2)) ; else return sqr(power(n,k/2)); }
const int N = 2e6+7;
const int M = 1e9+7;
const ll inf = 0x7f7f7f7f7f7f7f7f;
int main() {
ll n,m,i,j,k,x;
cin>>k;
queue<ll>a;
rep1(i,9) a.push(i);
vll v;
while(v.size() <= k)
{
x = a.front();
a.pop();
v.eb(x);
i = x%10;
if(i>0) a.push(x * 10 + i-1);
a.push(x * 10 + i);
if(i<9) a.push(x*10 + i + 1);
}
sajo(v);
cout << v[k-1] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
struct UnionFind{
int num;
vector<int> rs,ps;
UnionFind(){}
UnionFind(int n):num(n),rs(n,1),ps(n,0){iota(ps.begin(),ps.end(),0);}
int find(int x){
return (x==ps[x]?x:ps[x]=find(ps[x]));
}
bool same(int x,int y){
return find(x)==find(y);
}
void unite(int x,int y){
x=find(x);y=find(y);
if(x==y) return;
if(rs[x]<rs[y]) swap(x,y);
rs[x]+=rs[y];
ps[y]=x;
num--;
}
int size(int x){
return rs[find(x)];
}
int count() const{
return num;
}
};
signed main(){
int n,m;
cin>>n>>m;
UnionFind uf(n),bp(n*2);
for(int i=0;i<m;i++){
int u,v;
cin>>u>>v;
u--;v--;
uf.unite(u,v);
bp.unite(u+0,v+n);
bp.unite(u+n,v+0);
}
using ll = long long;
ll odd=0,eve=0,iso=0;
for(int i=0;i<n;i++){
if(uf.find(i)!=i) continue;
if(uf.size(i)==1){
iso++;
continue;
}
if(bp.same(i,i+n)) odd++;
else eve++;
}
ll ans=(ll)n*n-(n-iso)*(n-iso);
ans+=(odd+eve)*(odd+eve);
ans+=eve*eve;
cout<<ans<<endl;
return 0;
}
| 0
| 68,530,631
|
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << max({a * c, a * d, b * c, b * d});
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T &t)
{
t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &... rest)
{
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &... rest)
{
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
template <class T>
T GCD(T a, T b)
{
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
bool yes = 0;
bool boo = 0;
int mx = -100000, mn = 100000;
int sum = 0;
int ans = 0;
int co = 0;
int main()
{
int mx = 0;
rep(i, 5)
{
VAR(int, x);
int n = ((x + 9) / 10) * 10;
ans += n;
mx = max(mx, n - x);
}
pr(ans - mx);
return 0;
}
| 0
| 50,134,534
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 1e9 + 7;
int dp[MAXN][3];
int cost[MAXN][3];
int N;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> cost[i][0] >> cost[i][1] >> cost[i][2];
}
dp[0][0] = cost[0][0], dp[0][1] = cost[0][1], dp[0][2] = cost[0][2];
for (int i = 1; i < N; ++i) {
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + cost[i][0];
dp[i][1] = max(dp[i - 1][0], dp[i - 1][2]) + cost[i][1];
dp[i][2] = max(dp[i - 1][0], dp[i - 1][1]) + cost[i][2];
}
cout << max(dp[N-1][0],max(dp[N-1][1],dp[N-1][2])) << '\n';
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
while(1){
string s;
int count=0;
cin >> s;
int judge[10000]={};
for(int i=0;i<s.size();i++){
if((s[i]=='q')||(s[i]=='w')||(s[i]=='e')||(s[i]=='r')||(s[i]=='t')||(s[i]=='a')||(s[i]=='s')||(s[i]=='d')||(s[i]=='f')||(s[i]=='g')||(s[i]=='z')||(s[i]=='x')||(s[i]=='c')||(s[i]=='v')||(s[i]=='b'))judge[i]=0;
else judge[i]=1;
if((1<=i)&&(judge[i-1]!=judge[i])) count++;
}
if(s[0]=='#')break;
cout << count << endl;
}
}
| 0
| 17,534,019
|
#include <stdio.h>
#include <math.h>
double PI;
double deg2rad(double deg){
return (deg/360)*2*PI;
}
int main()
{
int a,b,c;
double cr;
PI=acos(-1);
scanf("%d %d %d",&a,&b,&c);
cr=deg2rad(c);
printf("%f\n",(a*b*sin(cr))/2);
printf("%f\n",a+b+sqrt(a*a+b*b-2*a*b*cos(cr)));
printf("%f\n",b*sin(cr));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<int> A(N);
for(auto &e : A) cin >> e;
vector<int64_t> S(N + 1);
for(int i = 0; i < N; ++i) S[i + 1] = S[i] + A[i];
for(int i = 1; i <= N; ++i) S[i] = (S[i] - i) % K;
map<int, int> ma;
int64_t ans = 0;
for(int i = 0; i <= N; ++i) {
ans += ma[S[i]];
ma[S[i]]++;
if(i - K + 1 >= 0) ma[S[i - K + 1]]--;
}
cout << ans << '\n';
return 0;
}
| 0
| 49,780,402
|
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i, n) for(int i = 0;i < (n);i++)
#define lint long long
const lint mod=1e9+7;
const lint inf=2.19e15+1;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}
signed main(){
int n, q;
cin >> n >> q;
dsu uni(n + 1);
REP(i,q){
int t, u, v;
cin >> t >> u >> v;
if (t==0){
uni.merge(u, v);
}
else{
if (uni.same(u,v)){
cout << 1 << endl;
}
else{
cout << 0 << endl;
}
}
}
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
while(1){
int a,b,c,n[300],max,sa,ans;
cin>>a>>b>>c;
if(a==0&&b==0&&c==0)break;
for(int i=0;i<a;i++){
cin>>n[i];
}
for(int i=b-1;i<=c-1;i++){
sa=n[i]-n[i+1];
if(i==b-1)max=sa;
if(max<=sa){
max=sa;
ans=i+1;
}
}
printf("%d\n",ans);
}
return 0;
}
| 0
| 29,481,755
|
#include <iostream>
using namespace std;
#define MIN(X,Y) ((X)<(Y)?(X):(Y))
#define MAX(X,Y) ((X)>(Y)?(X):(Y))
int main(void){
long long a,b,c,d,ans;
cin >> a >> b >> c >> d;
ans = a*c;
ans = MAX(ans, a*d);
ans = MAX(ans, b*c);
ans = MAX(ans, b*d);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
typedef pair<int,int> P;
int gcd(int a,int b){
if (a%b == 0){
return b;
}
else{
return gcd(b,a%b);
}
}
int lcm(int a,int b){
return a /gcd(a,b) * b;
}
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
for (int bit = 0; bit < (1 << 3); bit++){
int tmp = s.at(0) - '0';
string ans = "";
ans += s.at(0);
rep(i, 3){
if (bit & (1 << i)){
tmp += s.at(i + 1) - '0';
ans += '+';
ans += s.at(i + 1);
}
else{
tmp -= s.at(i + 1) - '0';
ans += '-';
ans += s.at(i + 1);
}
}
if (tmp == 7) {
cout << ans << "=7" << endl;
return 0;
}
}
}
| 0
| 48,635,819
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n+1),b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans = 0;
rep(i,n){
ans += min(a[i]+a[i+1],b[i]);
a[i+1] = clamp(a[i]+a[i+1]-b[i],0,a[i+1]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long mod=1e9+7;
int main() {
int N;
string S;
cin>>N>>S;
N*=2;
string T=S;
if(S[0]=='B') T[0]='L';
else{
cout<<0<<endl;
return 0;
}
for(int i=0;i<N-1;i++){
if(T[i]=='L'){
if(S[i]=='B'&&S[i+1]=='B') T[i+1]='R';
if(S[i]=='B'&&S[i+1]=='W') T[i+1]='L';
if(S[i]=='W'&&S[i+1]=='B') T[i+1]='L';
if(S[i]=='W'&&S[i+1]=='W') T[i+1]='R';
}
else if(T[i]=='R'){
if(S[i]=='B'&&S[i+1]=='B') T[i+1]='L';
if(S[i]=='B'&&S[i+1]=='W') T[i+1]='R';
if(S[i]=='W'&&S[i+1]=='B') T[i+1]='R';
if(S[i]=='W'&&S[i+1]=='W') T[i+1]='L';
}
}
if(S[N-1]=='B'&&T[N-1]=='R') T[N-1]='R';
else{
cout<<0<<endl;
return 0;
}
int l=0,r=0;
for(int i=0;i<N;i++){
if(T[i]=='L') l++;
if(T[i]=='R') r++;
}
if(l==N/2&&r==N/2) r=0;
else{
cout<<0<<endl;
return 0;
}
long ans=1;
r=0;
for(int i=N-1;i>=0;i--){
if(T[i]=='R') r++;
if(T[i]=='L'){
if(r>0) ans*=r,r--,ans%=mod;
else{
cout<<0<<endl;
return 0;
}
}
}
for(int i=1;i<=N/2;i++){
ans *=i;
ans %= mod;
}
cout<<ans<<endl;
}
| 0
| 25,478,690
|
#include <stdio.h>
#include<math.h>
using namespace std;
int main(){
int n,maximum,sum;
while(true){
scanf("%d",&n);
if(n == 0)break;
int array[n];
for(int i=0;i<n;i++)scanf("%d",&array[i]);
maximum = -600000000;
for(int k=0;k<n;k++){
sum = 0;
for(int p=k;p<=n-1;p++){
sum += array[p];
maximum = (maximum >= sum)? maximum:sum;
}
}
printf("%d\n",maximum);
}
return 0;
}
|
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<ctime>
using namespace std;
typedef long long ll;
const int MAX=1e5+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
const string mode[4]={"dream","dreamer","erase","eraser"};
bool Match(const string&mo,const char* s,const int&k){
int l=mo.length();
for(int i=0;i<l;i++){
if(mo[i]!=s[i+k]) return false;
}
return true;
}
void DFS(const int&k,const char* s,bool &F){
if(k==strlen(s)){
F=true;
return;
}
for(int i=0;i<4;i++){
if(Match(mode[i],s,k)){
DFS(k+mode[i].length(),s,F);
if(F) return;
}
}
}
int main(){
char s[MAX];
while(~scanf("%s",s)){
bool F=false;
DFS(0,s,F);
if(F) puts("YES");
else puts("NO");
}
return 0;
}
| 0
| 50,843,291
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
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 mod = 1000000007;
struct mint {
ll x;
mint():x(0){}
mint(ll x):x((x%mod+mod)%mod){}
mint& fix() { x = (x%mod+mod)%mod; return *this;}
mint operator-() const { return mint(0) - *this;}
mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
mint operator+(const mint& a)const{ return mint(*this) += a;}
mint operator-(const mint& a)const{ return mint(*this) -= a;}
mint operator*(const mint& a)const{ return mint(*this) *= a;}
bool operator<(const mint& a)const{ return x < a.x;}
bool operator==(const mint& a)const{ return x == a.x;}
};
istream& operator>>(istream&i,mint&a){i>>a.x;return i;}
ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}
int main() {
string s;
cin >> s;
ll ans = 0;
int n = s.size();
vi a(n+1);
rep(i, n) {
if (s[i] == '<') chmax(a[i+1], a[i]+1);
}
drep(i, n) {
if (s[i] == '>') chmax(a[i], a[i+1]+1);
}
rep(i, n+1) ans += a[i];
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
int D,P;
while(1){
cin>>N>>M;
if(N==0 && M==0) break;
int p[11]={};
for(int i=0;i<N;i++){
cin>>D>>P;
p[P]+=D;
}
for(int i=10;i>0;i--){
if(M>=p[i]){
M-=p[i];
p[i]=0;
}
else{
p[i]-=M;
M=0;
}
if(M==0) break;
}
int ans=0;
for(int i=0;i<11;i++){
ans+=i*p[i];
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 22,404,807
|
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
int main(void) {
string a, b, c;
int x, y;
cin >> a >> b >> x >> y >> c;
if(a == c) {
cout << x-1 << " " << y << endl;
} else {
cout << x << " " << y-1 << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, t, x;
cin >> n >> t;
vector<ll>v;
for (ll i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll s = t;
ll ans = 0;
for (ll i = 0; i < n - 1; i++) {
ll z = abs(v[i+1]- v[i]);
if(z < t) {
ans += z;
}
else {
ans += t;
}
}
cout << ans + t << endl;
return 0;
}
| 0
| 25,759,289
|
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 1e5 + 5;
vector<int> adj [MAX_N];
int dp [MAX_N];
void dfs (int u, int p) {
for (int nxt : adj[u]) {
if (nxt != p) {
dfs(nxt, u);
dp[u] ^= dp[nxt] + 1;
}
}
}
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(1, 0);
if (dp[1] == 0) {
cout << "Bob" << endl;
} else {
cout << "Alice" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using int64 = int64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, n;
cin >> h >> n;
int mx = h + 10010;
const int INF = (int)1e8;
vector<vector<int>> dp(n + 1, vector<int>(mx, INF));
dp[0][0] = 0;
rep(i, n) {
int a, b;
cin >> a >> b;
rep(j, mx) {
if (j - a >= 0) {
dp[i + 1][j] = min(dp[i][j], dp[i + 1][j - a] + b);
} else {
dp[i + 1][j] = dp[i][j];
}
}
}
int ans = INF;
for (int i = h; i < mx; i++) {
ans = min(ans, dp[n][i]);
}
cout << ans;
return 0;
}
| 0
| 66,250,964
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main ()
{
int n;
scanf("%d",&n);
LL ans=0;
bool same = true;
int min_b = 1234567890;
for (int i=1;n>=i;i++)
{
int a,b;
scanf("%d %d",&a,&b);
same &= (a==b);
if (a<=b) ans += a;
else min_b = min(b,min_b),ans+=a;
}
if (same) puts("0");
else printf("%lld\n",ans-min_b);
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
constexpr ll MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
signed main() {
cin >> N;
vi d(N);
cin >> d;
REP(i, N)
FOR(j, i + 1, N) {
ans += d[i] * d[j];
}
cout << ans << endl;
}
| 0
| 52,614,293
|
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
using ll = long long;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
ll bit1[12345678], bit2[12345678], nn;
ll sum1(ll i) {
ll s = 0;
while (i > 0) {
s += bit1[i]; i -= i & -i;
}
return s;
}
void add1(ll i, ll x) {
while (i <= nn) {
bit1[i] += x; i += i & -i;
}
}
ll sum2(ll i) {
ll s = 0;
while (i > 0) {
s += bit2[i]; i -= i & -i;
}
return s;
}
void add2(ll i, ll x) {
while (i <= nn) {
bit2[i] += x; i += i & -i;
}
}
ll test[12345678];
signed main() {
ll n, k, a, cnt = 0, ans = 0; cin >> n >> k; nn = 2002;
vector<ll> v; map<ll, ll> ma;
for (int h = 0; h < n; h++) {
cin >> a; test[h] = a;
ans += h - sum1(a);
add1(a, 1);
}
sort(test, test + n); reverse(test, test + n);
for (int h = 0; h < n; h++) {
cnt += h - sum2(test[h]);
add2(test[h], 1);
}
cout << (((ans % mod) * k % mod) + ((cnt % mod) * ((k * (k - 1) / 2) % mod)) % mod) % mod << endl;
return 0;
}
|
#include <string>
#include <iostream>
using namespace std;
int main()
{
string S;
cin >> S;
if(S != "0")
{
int A = 0;
for(int i = 0; i < S.size(); i++)
{
A += S[i] - 48;
}
cout << A << endl;
main();
}
return 0;
}
| 0
| 96,708,674
|
#include<iostream>
using namespace std;
int main(){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int time1, time2, awake;
time1 = h1 * 60 + m1;
time2 = h2 * 60 + m2;
awake = time2 - time1;
cout << awake - k;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005],p[100005];
set<ll> s;
int main(){
ll n,ans=0;
cin>>n;
for(ll i=1;i<=n;i++){
cin>>a[i];
p[a[i]]=i;
}
s.insert(0);s.insert(n+1);
for(ll i=n;i>=1;i--){
auto x=s.upper_bound(p[i]);
auto y=--s.upper_bound(p[i]);
if(*y!=0){
auto t=--y;y++;
ans+=(*x-p[i])*(*y-*t)*i;
}
if(*x!=n+1){
auto t=++x;x--;
ans+=(p[i]-*y)*(*t-*x)*i;
}
s.insert(p[i]);
}
cout<<ans<<endl;
}
| 0
| 72,035,596
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a1,a2,a3;cin>>a1>>a2>>a3;
cout << abs(a1-a2)+abs(a2-a3)+abs(a1-a3)-max(max(abs(a1-a2),abs(a1-a3)),abs(a2-a3)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define el(a) (a).end()-(a).begin()
int main(){
int n,m;
cin>>n>>m;
int a[n];
in(a,n);
ll b=a[0],c=a[0];
rep(i,n){
b=gcd(b,a[i]);
c=lcm(c,a[i]);
}
b/=2;
c/=2;
if((c/b)%2==0){
cout<<0;
return 0;
}
cout << (m/c+1)/2;
return 0;
}
| 0
| 70,674,918
|
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
typedef pair<long long, long long> P;
int main(){
int N, K;
cin >> N >> K;
vector<long long> x(N), y(N);
for(int i = 0; i < N; i++) cin >> x[i] >> y[i];
long long ans = 5e18;
for(int i = 0; i < N; i++){
for(int j = i + 1; j < N; j++){
for(int k = 0; k < N; k++){
for(int l = k + 1; l < N; l++){
long long xmin = min(x[i], x[j]);
long long xmax = max(x[i], x[j]);
long long ymin = min(y[k], y[l]);
long long ymax = max(y[k], y[l]);
int cnt = 0;
for(int m = 0; m < N; m++){
if(xmin <= x[m] && x[m] <= xmax && ymin <= y[m] && y[m] <= ymax) cnt++;
}
if(cnt >= K) ans = min(ans, (ymax - ymin) * (xmax - xmin));
}
}
}
}
cout << ans << endl;
}
|
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
int pointT = 0, pointH = 0;
string taro, hanako;
cin >> n;
for( int i = 0; i < n; i++ )
{
cin >> taro >> hanako;
int count = 0;
if( taro.size() > hanako.size() )
for( int j = 0; j < hanako.size(); j++ )
{
if( taro[j] > hanako[j] )
{
pointT += 3;
break;
}
else if( taro[j] == hanako[j] )
{
count++;
if( count == hanako.size() )
pointT += 3;
}
else
{
pointH += 3;
break;
}
}
else if( taro.size() < hanako.size() )
for( int j = 0; j < taro.size(); j++ )
{
if( taro[j] > hanako[j] )
{
pointT += 3;
break;
}
else if( taro[j] == hanako[j] )
{
count++;
if( count == taro.size() )
pointH += 3;
}
else
{
pointH += 3;
break;
}
}
else
for( int j = 0; j < hanako.size(); j++ )
{
if( taro[j] > hanako[j] )
{
pointT += 3;
break;
}
else if( taro[j] == hanako[j] )
{
count++;
if( count == hanako.size() )
{
pointT += 1;
pointH += 1;
}
}
else
{
pointH += 3;
break;
}
}
}
cout << pointT << " " << pointH << endl;
return 0;
}
| 0
| 88,034,964
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define ALL(v) v.begin(),v.end()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using Graph = vector<vector<int>>;
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a%b);
}
int main()
{
ll N, X;
cin >> N >> X;
vector<ll> A(N);
rep(i, N) cin >> A[i];
A.pb(X);
sort(ALL(A));
vector<ll> B(N);
rep(i, N)
{
B[i] = A[i+1]-A[i];
}
ll ans = 0;
rep(i, N)
{
ans = gcd(B[i], ans);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define 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(){
int n, m;
cin >> n >> m;
int l = 0, r = n;
rep(i,m){
int li, ri;
cin >> li >> ri;
l = max(l, li);
r = min(r, ri);
}
if (l > r) cout << 0 << endl;
else cout << r-l+1 << endl;
}
| 0
| 44,279,054
|
#include<bits/stdc++.h>
#include<iomanip>
#define fast {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define N 1000000
#define ar array
#define mod 1000000007
#define ld long double
#define pb push_back
#define f first
#define s second
typedef long long int ll;
using namespace std;
int main(void){
#ifndef ONLINE_JUDGE
freopen("input1.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast;
ll n,k,ans=0,i;
cin>>n>>k;
ll p[n+2]={0};
ll s[n+2]={0};
p[1]=0;
s[n+1]=n;
for(i=2;i<=n+1;i++){
p[i]=p[i-1]+i-1;
p[i]%=mod;
}
for(i=n-1;i>=0;i--){
s[i+1]=s[i+2]+i;
s[i]%=mod;
}
for(i=k;i<=n+1;i++){
if(s[n-i+2]>=p[i])
ans+=s[n-i+2]-p[i]+1;
ans%=mod;
}
cout<<ans;
}
|
#include <iostream>
using namespace std;
int main() {
int H, W;
while(true) {
cin >> H >> W;
if((H == 0) && (W == 0)) {
break;
}
for(int h = 0; h < H; ++h) {
for(int w = 0; w < W; ++w) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
}
| 0
| 75,902,498
|
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repp(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
struct UF{
vector<int> par, sz;
void init(int n){
par.resize(n);
sz.resize(n, 1);
rep(i, 0, n) par[i] = i;
}
int find(int x){
if(par[x] == x) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y){
x = find(x); y = find(y);
if(x == y) return;
if(sz[x] > sz[y]) swap(x, y);
sz[x] += sz[y];
par[y] = x;
}
bool same(int x, int y){
return find(x) == find(y);
}
};
signed main(){
int n, q;
cin >> n >> q;
UF uf;
uf.init(n);
rep(i, 0, q){
int c, x, y;
cin >> c >> x >> y;
if(c == 0){
uf.unite(x, y);
}else{
cout << (uf.same(x, y) ? 1: 0) << endl;
}
}
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;
int main(){
int n,m[101]={0};
int maxi=0;
while(cin>>n){
m[n]++;
maxi=max(maxi,m[n]);
}
rep(i, 101){
if(m[i]==maxi)cout<<i<<endl;
}
return 0;
}
| 0
| 67,297,291
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmin(T1 &a, const T2 &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr ll INF = 0x3f3f3f3f3f3f3f3fLL;
constexpr ll mod = 1000000007;
int main() {
ll X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<pair<ll, char>> apple;
apple.reserve(A + B + C);
rep(i, A) {
ll num;
cin >> num;
apple.emplace_back(num, 'r');
}
rep(i, B) {
ll num;
cin >> num;
apple.emplace_back(num, 'g');
}
rep(i, C) {
ll num;
cin >> num;
apple.emplace_back(num, 'l');
}
sort(all(apple), greater<pair<ll, char>>());
ll cnt_r = 0;
ll cnt_g = 0;
ll cnt_l = 0;
ll ans = 0;
for (auto e : apple) {
if (e.second == 'l') {
ans += e.first;
++cnt_l;
} else if (e.second == 'r') {
if (cnt_r >= X) continue;
ans += e.first;
++cnt_r;
} else if (e.second == 'g') {
if (cnt_g >= Y) continue;
ans += e.first;
++cnt_g;
}
if (cnt_r + cnt_g + cnt_l == X + Y) {
break;
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k; cin>>k;
int a,b; cin>>a>>b;
int i;
i=(b/k)*k;
if((a<=i)) {
cout<<"OK"<<endl;
}
else{
cout<<"NG"<<endl;
}
}
| 0
| 76,664,291
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
if(a%b==0)
return(b);
else
return(gcd(b,a%b));
}
int main(){
int a,b,k;
cin >> a >> b >> k;
int x=gcd(a,b);
int answer;
int j=0;
for(int i=x;i>0;i--){
if(x%i==0){
answer=i;
j++;
}
if(j==k)
break;
}
cout << answer << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N , M;
cin >> N >> M;
map<int,int> mp;
for(int i = 0; i < M; i++){
ll tmp1,tmp2;
cin >> tmp1 >> tmp2;
mp[tmp1]++;
mp[tmp2]++;
}
for(int i = 1; i <= N; i++){
if(mp[i] % 2 != 0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 26,928,847
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0, cur = 0;
rep(i,n){
int h;
cin >> h;
if(h > cur) ans += h - cur;
cur = h;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <cstring>
#define rep(i,n) for(int i=0;i< (n);++i)
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
int ans=0;
ll H[N];
for(int i=0;i!=N;++i){
cin>>H[i];
}
int count=0;
for(int i=1;i!=N;++i){
if(H[i]>H[i-1]){
count=0;
}else{
++count;
ans=max(ans,count);
}
}
cout<<ans<<endl;
}
| 0
| 36,467,699
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> a(n);
for(int i=0;i<n;i++)
cin>>a.at(i);
for(int _=0;_<k;_++){
vector<int> p=a;
vector<int> d(n+1,0);
for(int i=0;i<n;i++){
d.at(max(i-p.at(i),0))++;
d.at(min(i+p.at(i)+1,n))--;
}
a.at(0)=d.at(0);
for(int i=1;i<n;i++)
a.at(i)=a.at(i-1)+d.at(i);
if(p==a)
break;
}
for(int i=0;i<n;i++)
cout<<a.at(i)<<(i+1<n?" ":"");
cout<<endl;
}
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
constexpr double EPS = 1e-10;
constexpr int MOD = 1'000'000'007;
template<class T> inline T sqr(T x) {return x*x;}
void solve() {
int n;
cin >> n;
if (n == 1) {
cout << "Yes" << endl;
cout << "2" << endl;
cout << "1 1" << endl;
cout << "1 1" << endl;
} else if (n == 2) {
cout << "No" << endl;
} else {
for (int i = 1; i * (i - 1) <= 2 * n; ++i) {
if (i * (i - 1) != 2 * n) continue;
vector<deque<int>> q(i);
int index = 0;
cout << "Yes" << endl;
cout << i << endl;
REP(j,0,i) {
cout << i - 1;
if (j == 0) {
REP(k,0,i-1) {
cout << " " << k + 1;
q[j].push_back(k);
++index;
}
} else {
int cnt = 0;
RREP(k,0,j) {
if (cnt == i - 1) break;
if (!q[k].empty()) {
cout << " " << q[k][0] + 1;
q[k].pop_front();
++cnt;
}
}
REP(k,cnt,i-1) {
cout << " " << index + 1;
q[j].push_back(index);
++index;
}
}
cout << endl;
}
return;
}
cout << "No" << endl;
}
}
int main() {
solve();
return 0;
}
| 0
| 19,768,605
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
#define MOD int(1e9 + 7)
int main()
{
long long N, M;
vector<long long> A;
cin >> N >> M;
map<long long, long long> count;
long long tmp = 0;
count[0]++;
for(long long i = 0; i < N; i++){
long long t;
cin >> t;
tmp = (tmp + t) % M;
count[tmp]++;
}
long long total = 0;
for(auto x : count)
total += (x.second * (x.second - 1)) / 2;
cout << total << endl;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll Nsum = 0;
rep(i, N + 1) Nsum += i;
vector<ll> A(N + 1);
ll Asum = 0;
rep(i, N) {
cin >> A[i];
Asum += A[i];
}
A[N] = A[0];
if (Asum % Nsum != 0) {
cout << "NO" << endl;
return 0;
}
ll n = Asum / Nsum;
ll s = 0;
rep(i, N) {
ll d = A[i + 1] - A[i];
if ((n - d) % N != 0 || n - d < 0) {
cout << "NO" << endl;
return 0;
}
s += (n - d) / N;
}
if (s == n) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| 0
| 86,595,339
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
ll EX(ll x,ll n){
if(n == 0) return 1;
else if(n%2 == 1) return EX(x,n-1)*x%mod;
else return EX(x*x%mod,n/2)%mod;
}
vector<bool> prime_flag;
void flag_prime(ll max){
if(max +1 > prime_flag.size()) prime_flag.resize(max+1,true);
prime_flag[0] = false;
prime_flag[1] = false;
for(int i = 2; i*i < max+1; i++){
if(prime_flag[i]){
for(int j = 2; i*j < max+1; j++) prime_flag[i*j] = false;
}
}
}
vector<int> prime_num;
void num_prime(int max){
for(int i = 0; i < max+1; i++){
if(prime_flag[i]) prime_num.push_back(i);
}
}
int main(){
ll n,k;
cin >> n >> k;
map<ll,ll> mp;
flag_prime(k+1);
num_prime(k+1);
for(int i = 1; i <= k; i++){
mp[i] = EX(k/i,n);
}
ll ans = 0;
for(int i = k; i >= 1; i--){
for(int j = i*2; j <= k; j += i){
mp[i] += -mp[j];
}
}
for(int i = 1; i <= k; i++){
ans += mp[i]*i;
ans %= mod;
}
cout << (ans+mod)%mod << endl;
return 0;
}
|
#include <iostream>
#include <string>
int main()
{
int taro = 0;
int hana = 0;
int n;
std::cin >> n;
for(int i = 0; i < n; i++){
std::string t;
std::string h;
std::cin >> t >> h;
if(t < h){
hana += 3;
}else
if(t > h){
taro += 3;
}else{
hana += 1;
taro += 1;
}
}
std::cout << taro << " " << hana << std::endl;
return 0;
}
| 0
| 31,694,447
|
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
const int INF = 1e9;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a <= c && c <= b) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
|
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(ll i=ll(x);i<(ll)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<ll,ll>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
bool f(P a,P b){
if(a.first!=b.first){
return a.first<b.first;
}
else{
return a.second<b.second;
}
}
int main(){
ll n,m;
cin>>n>>m;
map<ll,ll>mp;
vector<P>p(m);
rep(i,m){
ll d,y;
cin>>d>>y;
p[i].first=d;
p[i].second=y;
mp[i]=y;
}
sort(p.begin(),p.end(),f);
map<ll,ll>ans;
ll index=1,now;
for(auto x:p){
ll num;
if(x.first!=now)index=1;
now=x.first;
num=x.first*pow(10,6)+index;
ans[x.second]=num;
index++;
}
rep(i,m){
printf("%012lld\n",ans[mp[i]]);
}
return 0;
}
| 0
| 70,180,599
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n;
ll m;
while(cin >> n >> m, n||m) {
ll dist[11] = {};
rep(i, n) {
int d, p;
cin >> d >> p;
dist[p] += d;
}
for(int i=10; i>0 && m>0; i--) {
ll l = min( dist[i], m );
dist[i] -= l;
m -= l;
}
ll res = 0;
for(int i=1; i<=10; i++) {
res += i * dist[i];
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define pb push_back
#define ull unsigned long long
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return vector< vector<ll> >(n, vector<ll>(m));}
bool compare(char &s1,char &s2){return s1 > s2;}
bool sortmahstyle(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
if(a.second > b.second )
return true;
if( a.second==b.second && a.first > b.second )
return true;
return false;
}
bool cmp(int n, pair<int, int> const& p)
{
return (p.first < n);
}
ll const mod = 1e9+7;
ll const inf = 1e18;
ll const maxn = 1e5+1;
void solve()
{
ll r,D,x; cin >> r >> D >> x;
ll ans = x;
f(i,0,10){
ans = r*ans - D;
cout << ans << endl;
}
}
int main() {
Knucklehead
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t;
t=1;
f(testcases,0,t){
solve();
}
return 0;
}
| 0
| 76,577,769
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
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); }
using P = pair <int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll MOD = 1000000007;
ll INF =1<<30;
int main(){
ll h,w;
cin >> h >>w;
ll ans;
if(h==1||w==1) {
cout <<1 <<endl;
return 0;
}
if(h%2==1&&w%2==1) {
ans = h*w/2+1;
cout << ans <<endl;
}
else {
ans = w*h/2;
cout << ans <<endl;
}
}
|
#include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for(int i = a; i < b; i++)
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1, dy = y1 - y2;
cout << x2 + dy << " ";
cout << y2 + dx << " ";
cout << x1 + dy << " ";
cout << y1 + dx << endl;
return 0;
}
| 0
| 66,137,017
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
std::cout << std::fixed << std::setprecision(10);
ll N;
scanf("%lld", &N);
long double ans = 0;
for (ll i = 0; i < N; i++) {
string a, b;
cin >> a >> b;
if (b == "JPY") {
ans += stoll(a);
}
if (b == "BTC") {
ans += stold(a) * 380000LL;
}
}
cout << ans << endl;
}
|
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int mp[105][105];
int main() {
int w, h, n;
cin >> w >> h >> n;
rep(i, h) {
rep(j, w) { mp[i][j] = 1; }
}
rep(k, n) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) {
rep(i, h) {
rep(j, x) {
mp[i][j] = 0;
}
}
} else if (a == 2) {
rep(i, h) {
for (int j = x; j < w; j++) {
mp[i][j] = 0;
}
}
} else if (a == 3) {
rep(i, y) {
rep(j, w) {
mp[i][j] = 0;
}
}
} else {
for (int i = y; i < h; i++) {
rep(j, w) {
mp[i][j] = 0;
}
}
}
}
int ans = w * h;
rep(i, h) {
rep(j, w) {
if (!mp[i][j]) ans--;
}
}
cout << ans;
return 0;
}
| 0
| 68,225,685
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
vector<int> v(n),p(n),q(n);
for(int i=0;i<n;i++)cin>>p[i];
for(int i=0;i<n;i++)cin>>q[i];
for(int i=0;i<n;i++)v[i]=i+1;
int a=0,b=0;
int pos=1;
while(a==0||b==0)
{
if(a==0)
{
int i=0;
for(;i<n;i++)if(v[i]!=p[i])break;
if(i==n)a=pos;
}
if(b==0)
{
int i=0;
for(;i<n;i++)if(v[i]!=q[i])break;
if(i==n)b=pos;
}
pos++;
next_permutation(v.begin(),v.end());
}
cout<<abs(a-b)<<"\n";
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int university[4][3][10] = { 0 }, n, a, b, c, d;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c >> d;
university[a - 1][b - 1][c - 1] += d;
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 10; k++) {
cout << " " << university[i][j][k];
}
cout << endl;
}
if (i < 3) puts("####################");
}
}
| 0
| 70,289,021
|
#include<bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
bool solve(vint a, int b){
set<int> s, ss;
s.insert(0);
for(auto t : a){
ss.clear();
for(auto u : s){
ss.insert(u+t);
ss.insert(u-t);
}
s = ss;
}
return s.count(b);
}
int main(){
string s;
int x, y;
cin >> s; cin >> x >> y;
vint X, Y;
bool f = true;
int start = 0;
while(start < s.size() && s[start] == 'F'){
x--;
start++;
}
for(int i = start;i < s.size();i++){
int d = 0;
while(s[i] == 'F'){
d++;
i++;
if(i == s.size()) break;
}
if(d > 0) {if(f) X.push_back(d); else Y.push_back(d);}
f = !f;
}
bool ans = solve(X, x) && solve(Y, y);
if(ans) cout << "Yes" << endl; else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvec;
typedef vector<vector<bool>> vveb;
typedef vector<vector<string>> vves;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<(int)(n);i++)
#define rep2(i,n) for(int i=2;i<(int)(n);i++)
#define repk(i,k,n) for(int i=k;i<(int)(n);i++)
#define fs first
#define sc second
#define pb push_back
#define pp pop_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
#define dame { puts("-1"); return 0;}
#define YES { cout << "YES" << endl; return 0; }
#define NO { cout << "NO" << endl; return 0; }
#define Yes { cout << "Yes" << endl; return 0; }
#define No { cout << "No" << endl; return 0; }
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
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
| 34,395,660
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VII;
typedef vector<VL> VLL;
typedef pair<int, int> PII;
typedef map<int, int> MP;
typedef vector<pair<ll, ll>> PS;
template <class T, class U>
bool chmax(T &a, U b) {
if (a <= b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U>
bool chmin(T &a, U b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
int main() {
ll n, m, k, x, y , z = 0, h, ans=0, w, sum = 0, Max = -1, Min = 1e9+1;
string u= "";
bool ok=true;
cin >> n >> k;
VL a(100001);
rep(i,n){
cin >> x >> y;
a[x] += y;
}
rep2(i,1,100001){
if(k <= a[i]){
pri(i); return 0;
}
k -= a[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
string ans="";
int count=0;
for(int i=0;i<N;i++){
if(S.at(i)=='('){
count++;
ans.push_back('(');
}else if(S.at(i)==')'){
ans.push_back(')');
if(count==0){
ans.insert(ans.begin(),'(');
}else{
count--;
}
}
}
while(count>0){
ans.push_back(')');
count--;
}
cout << ans << endl;
return 0;
}
| 0
| 63,921,227
|
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
using namespace std;
void spritStr(string str, vector<string>& v)
{
while (str.find(' ') != -1)
{
v.push_back(str.substr(0, str.find(' ')));
str.erase(0, str.find(' ') + 1);
}
v.push_back(str);
}
int main()
{
string st;
getline(cin, st);
vector<string> vStr;
spritStr(st, vStr);
int f, t, v;
f = stoi(vStr[0]);
t = stoi(vStr[1]);
v = stoi(vStr[2]);
int count = 0;
for (int i = f; i <= t; i++)
{
if (v % i == 0)
{
count++;
}
}
cout << count << endl;
return 0;
}
|
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define ll long long
const ll N = 1e5+10 ;
int w[N],v[N];
int dp[N];
int main(){
int n,k;
cin >> n >> k;
int m = -1;
memset(dp,0x3f,sizeof dp);
dp[0] = 0;
for(int i = 1;i <= k;++i) {cin>>w[i]>>v[i];}
for(int i = 1;i <= k;++i){
for(int j = w[i];j <= 1e4;++j){
if(dp[j-w[i]] != 0x3f3f3f3f) dp[j] = min(dp[j],dp[j-w[i]] + v[i]);
}
}
m = 0x3f3f3f3f;
for(int i = n;i <= 1e4;++ i){
m = min(m,dp[i]);
}
cout<<m<<endl;
}
| 0
| 34,003,292
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define roop(i, n) for(int i = 0;i < n;i++)
int main(void){
string str;
cin >> str;
int al[26] = {0};
roop(i, str.length()) al[str[i]-'a']++;
roop(i, 26){
if(al[i] == 0){
str += (char)(i+'a');
cout << str << endl;
return 0;
}
}
string t = str;
if(next_permutation(t.begin(), t.end()) == false){
cout << -1 << endl;
return 0;
}
roop(i, str.length()-1){
cout << t[i];
if(t[i] != str[i]) break;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void input(vector<int>& rvnSeq)
{
int nSeqSiz;
cin >> nSeqSiz;
rvnSeq.resize(nSeqSiz);
for (int& rnSeq : rvnSeq)
cin >> rnSeq;
}
int calcLower(const vector<int>& cnrvnSeq)
{
int nMaxSeqCnt = 0;
int nBgn = 0;
while (nBgn < cnrvnSeq.size() )
{
int nSeqCnt = 0;
int nFoward = nBgn;
while ( nFoward < cnrvnSeq.size() - 1 &&
cnrvnSeq[nFoward] >= cnrvnSeq[nFoward + 1] )
{
nSeqCnt++;
nFoward++;
}
nMaxSeqCnt = max(nMaxSeqCnt, nSeqCnt);
nBgn = nFoward + 1;
}
return nMaxSeqCnt;
}
int main()
{
vector<int> vnSeq;
input(vnSeq);
cout << calcLower(vnSeq) << endl;
return 0;
}
| 0
| 65,557,025
|
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<100>>;
using namespace boost::multiprecision;
#endif
#if __has_include(<boost/stacktrace.hpp>)
#define BOOST_STACKTRACE_USE_ADDR2LINE
#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
#define _GNU_SOURCE 1
#include <boost/stacktrace.hpp>
#endif
#ifdef LOCAL_TEST
namespace std {
template<typename T> class dvector : public std::vector<T> {
public:
dvector() : std::vector<T>() {}
explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
dvector(const std::vector<T>& v) : std::vector<T>(v) {}
dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
T& operator[](size_t n) {
try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
}
const T& operator[](size_t n) const {
try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
}
};
}
class dbool {
private:
bool boolvalue;
public:
dbool() : boolvalue(false) {}
dbool(bool b) : boolvalue(b) {}
operator bool&() { return boolvalue; }
operator const bool&() const { return boolvalue; }
};
#define vector dvector
#define bool dbool
#endif
#ifdef LOCAL_DEV
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
return s << "(" << p.first << ", " << p.second << ")"; }
class SIGFPE_exception : std::exception {};
class SIGSEGV_exception : std::exception {};
void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
signed convertedmain();
signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
#define main() convertedmain()
void debug_impl() { std::cerr << '\n'; }
template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
#define debug(...) do {} while (false)
#endif
using ll = long long;
constexpr ll INF = (ll)1e18;
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n) for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n) for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n) ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }
constexpr ll N_MAX = 2*1e5;
ll N;
vector<ll> u;
vector<ll> v;
void solve() {
cin >> N;
u = vector<ll>(N-1);
v = vector<ll>(N-1);
rep(i, N-1) {
cin >> u[i] >> v[i];
}
ll ans = 0;
repeq(i,N){
ll t=i*(i+1)/2;
ans+=t;
}
rep(i,N-1){
ll a=u[i],b=v[i];
if(a>b)swap(a,b);
ll t=a*(N+1-b);
ans-=t;
}
cout << ans << endl;
}
signed main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
int main()
{
int n; cin >> n;
int a[n]; rep(i,n) cin >> a[i];
bool positive = false,negative = false;
rep(i,n){
if(a[i] > 0) positive = true;
if(a[i] <= 0) negative = true;
}
ll ans = 0;
sort(a,a+n);
ll x = a[0], y = a[n-1];
queue<int> n_que;
queue<int> p_que;
for(int i = 1; i < n-1; i++){
if(a[i] <= 0) n_que.push(a[i]);
else p_que.push(a[i]);
}
if(positive && negative){
rep(i,n) ans += abs(a[i]);
cout << ans << endl;
while(!p_que.empty()){
int k = p_que.front(); p_que.pop();
cout << x << ' ' << k << endl;
x -= k;
}
cout << y << ' ' << x << endl;
y -= x;
while(!n_que.empty()){
int k = n_que.front(); n_que.pop();
cout << y << ' ' << k << endl;
y -= k;
}
}else if(positive){
rep(i,n) ans += a[i];
cout << ans - 2 * a[0] << endl;
while(!p_que.empty()){
int k = p_que.front(); p_que.pop();
cout << x << ' ' << k << endl;
x -= k;
}
cout << y << ' ' << x << endl;
}else{
rep(i,n) ans += abs(a[i]);
cout << ans + 2 * a[n-1] << endl;
while(!n_que.empty()){
int k = n_que.front(); n_que.pop();
cout << y << ' ' << k << endl;
y -= k;
}
cout << y << ' ' << x << endl;
}
}
| 0
| 48,579,235
|
#include <iostream>
using namespace std;
int memo[50];
int fib(int n)
{
if(n == 0 || n == 1)
memo[n] = 1;
if(memo[n] != 0)
{
return memo[n];
}
else
{
memo[n] = fib(n - 1) + fib(n - 2);
return memo[n];
}
}
int main()
{
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;
int A[1005][1005]={};
int main() {
int j,k;
string a,b;
cin >> a >> b;
for(j=1;j<=a.size();j++) A[j][0] = j;
for(k=1;k<=b.size();k++) A[0][k] = k;
for(j=1;j<=a.size();j++) {
for(k=1;k<=b.size();k++) {
int m = min(A[j-1][k]+1, A[j][k-1]+1);
if(a[j-1] == b[k-1]) {
m = min(m,A[j-1][k-1]);
A[j][k] = m;
}else {
m = min(m,A[j-1][k-1]+1);
A[j][k] = m;
}
}
}
cout << A[a.size()][b.size()] << endl;
return 0;
}
| 0
| 58,561,021
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw" << endl;
else if (a == 1)
cout << "Alice" << endl;
else if (b == 1)
cout << "Bob" << endl;
else if (a > b)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
}
|
#include <iostream>
using namespace std;
using LL = long long;
const LL INF = 1L << 29;
int N, M, R;
int r[8];
bool U[8];
LL d[201][201];
LL ans = INF;
void dfs(int count, int prev, LL dist) {
if (count == R) {
ans = min(ans, dist);
return;
}
for (int i = 0; i < R; i++) {
if (!U[i]) {
U[i] = true;
dfs(count + 1, i, prev == -1 ? 0L : dist + d[r[prev]][r[i]]);
U[i] = false;
}
}
}
int main() {
cin >> N >> M >> R;
for (int i = 0; i < R; i++) {
cin >> r[i];
U[i] = false;
}
fill(d[0], d[N + 1], INF);
for (int i = 1; i <= N; i++) d[i][i] = 0;
for (int i = 0; i < M; i++) {
int A, B, C;
cin >> A >> B >> C;
d[A][B] = d[B][A] = C;
}
for (int k = 1; k <= N; k++) {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
dfs(0, -1, 0L);
cout << ans << endl;
}
| 0
| 93,057,486
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
int main()
{
int n,m;
cin>>n>>m;
int sum = 0;
for(int i=0;i<m;i++){
int x;
cin>>x;
sum+=x;
}
if(sum > n)cout<<-1;
else cout<<n-sum;
}
|
#include<iostream>
#include<vector>
#define lli long long int
#define pb push_back
using namespace std;
int main()
{
lli n;
lli p = (lli)(1e9+7);
cin>>n;
vector<lli>arr(n+1);
for(lli i=1;i<=n;i++) cin>>arr[i];
vector<lli>set(62,0);
vector<lli>unset(62,0);
for(lli i=0;i<62;i++)
{
for(lli j=1;j<=n;j++)
{
if((arr[j]&(1ll<<i))>0) set[i]++;
else unset[i]++;
}
}
lli ans=0;
lli mul;
lli mul2;
lli co;
for(int i=0;i<62;i++)
{
mul = (set[i]%p * unset[i]%p)%p;
co = (1ll<<i)%p;
mul2 = (mul%p * co%p)%p;
ans = (ans%p + mul2%p)%p;
}
cout<<ans<<endl;
}
| 0
| 14,538,734
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
long minimum = 1000000, maximum = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++){
long a;
cin >> a;
minimum = min(a, minimum);
maximum = max(a, maximum);
sum += a;
}
cout << minimum << " " << maximum << " " << sum << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, n) for(int i = 0;i < (n);++i)
#define RREP(i, n) for(int i = (n)-1; i >= 0; --i)
#define RANGE(i, a, b) for(int i=(a);i<(b);++i)
#define endl '\n'
#define pb push_back
#define eb emplace_back
#define pque priority_queue
#define umap unordered_map
#define uset unordered_set
#define BIG 2000000000
#define VERYBIG 1000000000000000ll
#define PI 3.1415926
#define coutdb cout<<fixed<<setprecision(15)
const int dx[]={1,0,-1,0,1,1,-1,-1}, dy[]={0,-1,0,1,1,-1,1,-1};
const long long MOD = 1e9+7;
#define int long long
template<typename T> inline T GCD(T a,T b){T c;while(b!=0){c=a%b;a=b;b=c;}return a;}
template<typename T> inline T LCM(T a,T b){T c=GCD(a,b);a/=c;return a*b;}
template<typename T> inline T nCr(T a,T b){T i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
template<typename T> inline T nHr(T a,T b){return nCr(a+b-1,b);}
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 pair<int, int> INTP;
typedef vector<int> INTV;
struct edge2 {int to, cost;};
struct edge3 {int from, to, cost;};
signed main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N, A[100000]; cin >> N;
int allxor = 0;
REP(i, N){
cin >> A[i];
allxor ^= A[i];
}
REP(i, N) A[i] &= ~allxor;
int rank = 0;
for(int i = 59; i >= 0; i--){
int j;
for(j = rank; j < N; j++){
if(A[j] & (1ll << i)) break;
}
if(j == N) continue;
if(j > rank) A[rank] ^= A[j];
for(j = rank+1; j < N; j++){
chmin(A[j], A[j] ^ A[rank]);
}
rank++;
}
int ans = 0;
REP(i, N){
chmax(ans, ans ^ A[i]);
}
ans *= 2; ans += allxor;
cout << ans << endl;
}
| 0
| 61,371,748
|
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N; cin >> N;
ll a[N], b[N];
rep(i,N) cin >> a[i] >> b[i];
ll retval = 0;
for (int i=N-1;i>=0;i--){
a[i] += retval;
retval += ((a[i]+b[i]-1)/b[i])*b[i] - a[i];
}
cout << retval << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 100005
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define endl "\n"
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
ll lcm(ll a, ll b) { return (a*b)/ gcd(a,b);}
void test_case() {
int n, m;
cin>>n>>m;
int ans = max(0, (n * (n-1))/2 );
ans+= max(0, (m*(m-1))/2);
cout<<ans<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while (t--)
{
test_case();
}
}
| 0
| 79,865,306
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
using ll = long long;
using namespace std;
const long long MOD = 1000000007;
const ll LINF = 1LL << 50;
int main() {
ll N;
cin >> N;
ll nend = 0;
while(nend*nend < N){
nend += 1;
}
ll ans = LINF;
for (ll n = 1; n <= nend; n++){
if (N%n == 0){
ans = min({ans,n+N/n-2});
}
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d,e,f;
cin>>a>>b;
cin>>c>>d;
cin>>e>>f;
if(a==c||a==d){
if(a==e||a==f){
cout<<"NO";
}
else{
cout<<"YES";
}
}
else if(b==c||b==d){
if(b==e||b==f){
cout<<"NO";
}
else{
cout<<"YES";
}
}
else if(a==e||a==f){
if(a==c||a==d){
cout<<"NO";
}
else{
cout<<"YES";
}
}
else if(b==e||b==f){
if(b==c||b==d){
cout<<"NO";
}
else{
cout<<"YES";
}
}
}
| 0
| 50,632,148
|
#include <iostream>
#include <string>
int main()
{
size_t K;
std::string S;
std::cin >> K >> S;
if(S.size() > K) {
S.resize(K+3);
S[K] = '.';
S[K+1] = '.';
S[K+2] = '.';
}
std::cout << S << std::endl;
return 0;
}
|
using namespace std;
#include <bits/stdc++.h>
#define frr(i, r, l) for(int i = r; i >= l; --i)
#define fr(i, l, r) for(int i = l; i < r; ++i)
#define forit(it, type, var) for(type::iterator it = var.begin(); it != var.end(); it++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define MEMS(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define m_p make_pair
#define pb push_back
#define ll long long
#define ld long double
typedef pair<ll, ll> iPair;
priority_queue< ll, vector <ll> , greater<ll>>pq1,pq2;
#define maxN 1000000000000000000
ll power(ll a,ll b){ll res=1;while(b>0){res*=a;b--;}return res;}
ll n,m,p,rw[300005],cl[300005],mx1=0,mx2=0,x,y,temp[300005];
vector<ll>w[300005],v1,v2;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m>>p;
fr(i,0,p)
{
cin>>x>>y;
rw[x]++;
if(rw[x]>=mx1)
mx1=rw[x];
cl[y]++;
if(cl[y]>=mx2)
mx2=cl[y];
w[x].pb(y);
}
fr(i,1,n+1)
{
if(rw[i]==mx1)
v1.pb(i);
}
fr(j,1,m+1)
{
if(cl[j]==mx2){
v2.pb(j);}
}
ll fl=0;
fr(i,0,v1.size())
{
ll st=v1[i];
if(v2.size()>w[st].size())
{
fl=1;
break;
}
fr(j,0,w[st].size())
{
temp[w[st][j]]++;
}
fr(j,0,v2.size())
{
if(temp[v2[j]]==0)
{
fl=1;
break;
}
}
fr(j,0,w[st].size())
{
temp[w[st][j]]=0;
}
}
if(fl==1)
{
cout<<mx1+mx2<<endl;
}
else
{
cout<<mx1+mx2-1<<endl;
}
return 0;
}
| 0
| 29,135,585
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<double> t(n), v(n);
int T = 0;
rep(i, n){
cin >> t[i];
T += t[i];
}
rep(i, n) cin >> v[i];
const int INF = 1e9;
vector<double> maxv(2*T+1, INF);
int now = 0;
rep(i, n){
rep(j, t[i]){
int t1 = now + 2*j;
int t2 = now + 2*j + 1;
maxv[t1] = min(maxv[t1], v[i]);
maxv[t2] = min(maxv[t2], v[i]);
}
now += t[i] * 2;
maxv[now] = min(maxv[now], v[i]);
}
maxv[0] = 0;
maxv[2*T] = 0;
for(int i=1; i<=2*T; i++){
maxv[i] = min(maxv[i], maxv[i-1]+0.5);
}
for(int i=2*T-1; i>=0; i--){
maxv[i] = min(maxv[i], maxv[i+1]+0.5);
}
double ans = 0;
for(int i=0; i<=2*T; i++){
ans += 0.25 * (maxv[i] + maxv[i+1]);
}
cout << fixed << setprecision(9) << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
bool comp(P x, P y) {
return x.second < y.second;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi v(n);
bool same = true;
rep(i, n) {
cin >> v[i];
if(v[0] != v[i]) same = false;
}
if(same) {
cout << n/2 << endl;
return 0;
}
map<int, int> od, ev;
rep(i, n) {
if(i&1) {
od[v[i]]++;
} else {
ev[v[i]]++;
}
}
vector<P> odp, evp;
for(P x:od) {
odp.emplace_back(x);
}
for(P x:ev) {
evp.emplace_back(x);
}
sort(rall(odp), comp);
sort(rall(evp), comp);
int ans = INT_MAX;
rep(i, min((int)odp.size(), 2)) {
rep(j, min((int)evp.size(), 2)) {
if(odp[i].first == evp[j].first) continue;
ans = min(ans, n-odp[i].second-evp[j].second);
}
}
cout << ans << endl;
}
| 0
| 100,126,687
|
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <fstream>
#include <random>
#include <ctime>
#pragma endregion
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const double PI = acos(-1.0);
const double EPS = 1e-9;
using namespace::std;
void solve(){
int H,W;
cin >> H >> W;
string str;
for(int r=0;r<H;++r){
for(int c=0;c<W;++c){
cin >> str;
if( str == "snuke" ){
cout << (char)('A'+c);
cout << r+1 << endl;
}
}
}
}
#pragma region main
signed main(void){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;
cout << setprecision(16);
solve();
}
#pragma endregion
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(void) {
int N, B[3];
cin >> N >> B[0] >> B[1] >> B[2];
vector <int>l(N);
for (int i = 0; i < N; i++) cin >> l[i];
unsigned int total_cost = 3000;
for (unsigned int i = 0; i < pow(4, N); i++) {
vector <unsigned int> usage(N);
unsigned int wk = i;
unsigned int not_bamboo_check = 0x0;
for (int j = 0; j < N; j++) {
usage[j] = wk & 0x3;
wk >>= 2;
not_bamboo_check |= (1 << usage[j]);
}
if ((not_bamboo_check&0xE) != 0x0E) continue;
unsigned int cost = 0;
for (int k = 0; k < 3; k++) {
int bamboo_len = 0;
for (int j = 0; j < N; j++) {
if (usage[j]==(k+1)) {
if (bamboo_len) {cost += 10;}
bamboo_len += l[j];
}
}
cost += abs(bamboo_len - B[k]);
}
total_cost = min(total_cost, cost);
}
cout << total_cost << endl;
return 0;
}
| 0
| 60,413,783
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
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;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll d, a;
cin >> n >> d >> a;
vector<P> p;
rep(i,n){
ll x, h;
cin >> x >> h;
p.emplace_back(x, h);
}
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, 1000000007LL);
int range = upper_bound(p.begin(), p.end(), P(rx+1, -1)) - p.begin();
bit.add(range, -damage);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define case(z) "Case " << z++ << ": "
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define quit return 0
using namespace std;
void showmyDS(set<int> ds)
{
set<int> ::iterator it;
for (it=ds.begin();it!=ds.end();it++)
{
cout << *it << endl ;
}
cout << endl;
}
int main()
{
ls
int n,l,i;
cin >> n >> l ;
string a[n];
for(i=0;i<n;i++)
cin >> a[i];
sort(a,a+n);
for(i=0;i<n;i++)
cout << a[i];
quit;
}
| 0
| 67,767,538
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B, m, c = 0;
cin >> A >> B;
for (int n = A; n <= B; n++) {
if (n >= 10000) {
if ((n % 10 == n / 10000) && ((n / 10) % 10 == (n / 1000) % 10)) {
c++;
}
} else if (n >= 1000) {
if ((n % 10 == n / 1000) && ((n / 10) % 10 == (n / 100) % 10)) {
c++;
}
} else if (n >= 100) {
if (n % 10 == n / 100) {
c++;
}
} else if (n >= 10) {
if (n % 10 == n / 10) {
c++;
}
} else {
c++;
}
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(int n, int k, vector<int>&a){
int needed = (log(n) + 1.0)/log(1.34);
needed = min(needed, k);
for(int kk = 0; kk < needed; kk++){
vector<int>B(n, 0);
for(int i = 0; i < n; i++){
int l = max(0, i - a[i]);
int r = min(n - 1, i + a[i]);
B[l]++;
if(r + 1 < n){
B[r+1]--;
}
}
for(int i = 1; i < n; i++){
B[i] += B[i-1];
}
a = B;
}
for(int i = 0; i < n; i++){
cout << a[i] << " ";
}cout << endl;
}
int main(){
int n, k;
cin >> n >> k;
vector<int>a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
solve(n, k, a);
}
| 0
| 74,956,658
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define Ma7moud_7amdy \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define Open_Sesame Open()
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define clr(arr, x) memset(arr, x, sizeof arr)
#define endl "\n"
#define watch(x) cout << #x << " = " << x << endl;
#define RT(x) return cout << (x), 0;
#define Accepted 0
#define INF 0x3f3f3f3f3f3f3f3fLL
typedef long long ll;
typedef vector<int> vi;
const int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
const int dy[] = { 0, 1, 0, -1, 1, -1, 1, -1 };
void Open()
{
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
}
const int mod = ll(1e9 + 7), N = 1e5 + 5;
int n;
vector<vector<int>>g;
int cnt = 0;
ll mem[N][2];
ll dfs(int node, int par, int lst) {
ll& ret = mem[node][lst];
if (~ret)return ret;
ret = 1;
for (int nxt : g[node]) {
ll cur = 0;
if (nxt != par) {
cur += dfs(nxt, node, 0) % mod;
if (lst != 1)
{
cur += dfs(nxt, node, 1) % mod;
}
ret *= cur % mod;
ret %= mod;
}
}
return ret;
}
int main()
{
Ma7moud_7amdy;
Open_Sesame;
clr(mem, -1);
cin >> n;
g = vector<vector<int>>(n + 1);
for (int i = 1, u, v; i < n; i++) {
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
ll ans = dfs(1, -1, 1);
ans += dfs(1, -1, 0);
cout << ans %mod<< endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K; cin >> N >> K;
vector<ll> a(N); for (int i = 0; i < N; i++) cin >> a[i];
vector<ll> cum(N); cum[0] = a[0];
for (int i = 1; i < N; i++) cum[i] = cum[i-1] + a[i];
map<ll, int> pr;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
if (i == 0) pr[cum[j]]++;
else pr[cum[j] - cum[i-1]]++;
}
}
for (int i = 62; 0 <= i; i--) {
map<ll, int> tmp;
int t = 0;
for (auto x : pr) {
if (x.first>>i & 1) {
t += x.second;
tmp[x.first] = x.second;
}
}
if (t >= K) pr = tmp;
}
ll ans = (ll)1<<60;
ans -= 1;
for (auto x : pr) {
ans &= x.first;
}
cout << ans << endl;
}
| 0
| 82,614,036
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
#define all(v) v.begin(), v.end()
int main() {
int d, s, t;
cin >> d >> t >> s;
if (d <= t*s) cout << "Yes\n";
else cout << "No\n";
}
|
#include <iostream>
using namespace std;
int main() {
int H, W;
while (1) {
cin >> H >> W;
if (H == 0 && W == 0)break;
for (int i = 0; i < H; i++) {
if (i != 0 && i != H - 1) {
for (int j = 0; j < W; j++) {
if (j == W - 1) {
cout << "#" << endl;
}
else if(j == 0){
cout << "#";
}
else {
cout << ".";
}
}
}
else {
for (int j = 0; j < W; j++) {
if (j == W - 1) {
cout << "#" << endl;
}
else {
cout << "#";
}
}
}
}
cout << "" << endl;
}
}
| 0
| 60,702,341
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);
ll L[55];
ll solve(ll N, ll X) {
if(N==1) {
if(X<=1) return 0;
else if(X<=4) return X-1;
else return 3;
}
if(X<=0) {
return 0;
}
else if(X<L[N]/2+1) {
return solve(N-1, X-1);
}
else if(X==L[N]/2+1) {
return 1+solve(N-1, L[N-1]);
}
else if(X<L[N]) {
return 1 + solve(N-1, L[N-1]) + solve(N-1, X - (2+L[N-1]));
}
else {
return 1 + solve(N-1, L[N-1])*2;
}
}
int main() {
ll N, X;
cin>>N>>X;
L[1] = 5;
for(int i=2;i<55;++i) {
L[i] = L[i-1]*2 + 3;
}
cout<<solve(N, X)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> v(n);
for (size_t i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
v[l-1]++;
v[r]--;
}
int ans = 0, num = 0;
for (size_t i = 0; i < n; i++) {
num += v[i];
if (num == m) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 98,297,747
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll Bc = B / C;
ll Bd = B / D;
ll Ac = (A - 1) / C;
ll Ad = (A - 1) / D;
ll lcm = C * (D / gcd(C, D));
ll Blcm = B / lcm;
ll Alcm = (A - 1) / lcm;
printf("%lld\n", (B - A + 1) - ((Bc - Ac) + (Bd - Ad) - (Blcm - Alcm)));
}
|
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>>g;
bool mark[1000000];
int mx=0;
void dfs(int i){
mx++;
mark[i]=true;
for(int j=0;j<g[i].size();j++){
if(!mark[g[i][j]])dfs(g[i][j]);
}
}
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int i,j,k,l,m,n,o,p;
while(cin>>m>>n)
{
for(i=0; i<=m; i++)mark[i]=false;
g.assign(m+1,vector<int>());
for(i=0; i<n; i++)
{
cin>>j>>k;
g[j].push_back(k);
g[k].push_back(j);
}
j=0;
for(i=1; i<=m; i++)
{
if(!mark[i])
{
mx=0;
dfs(i);
}
j=max(j,mx);
}
cout<<j<<endl;
}
return 0;
}
| 0
| 23,357,555
|
#include <iostream>
using namespace std;
#define M 10000000
bool prime[M];
int main()
{
int ans, n;
for (int i = 2; i * i < M; i++){
if (prime[i] == false){
for (int j = i; j < M; j += i){
if (!(i == j)) {
prime[j] = true;
}
}
}
}
while (cin >> n){
ans = 0;
for (int i = 2; i <= n; i++){
if (prime[i] == false) ans++;
}
cout << ans << endl;
}
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() {cout<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 0
#endif
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin>>n;
vector<int> a(n), p(n), q(n);
iota(a.begin(), a.end(), 1);
for (int i=0; i<n; ++i){
cin>>p[i];
}
for (int i=0; i<n; ++i){
cin>>q[i];
}
int done=0;
int pos[2];
int cnt=1;
do{
debug(a, p, q);
if (a==p){
done++;
pos[0]=cnt;
}
if (a==q){
done++;
pos[1]=cnt;
}
cnt++;
} while (next_permutation(a.begin(), a.end()) && done<2);
cout<<abs(pos[0]-pos[1]);
return 0;
}
| 0
| 31,832,441
|
#include <bits/stdc++.h>
using namespace std;
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul;
const ll oo = 1e18;
const ll N = 1e6;
const ll mod = 1e9 + 7;
#define point complex<double>
const double pi = acos(-1);
double dot(point a, point b)
{
return (conj(a) * b).real();
}
double cross(point a, point b)
{
return (conj(a) * b).imag();
}
ll inv[N],fact[N];
ll fb(ll x, ll y)
{
if(y == 0)
return 1;
ll ans = fb(x,y/2);
ans = (ans * ans)%mod;
if(y % 2 !=0)
{
ans = (ans*(x%mod))%mod;
}
return ans ;
}
void pre(ll n)
{
fact[0] = 1;
inv[0] = 1;
for ( int i = 1;i<=n;i++)
{
fact[i] = (i * fact[i-1])% mod;
inv[i] = fb(fact[i], mod-2);
}
}
ll ncr (ll n , ll r)
{
return (((fact[n] * inv[n - r]) % mod) * inv[r]) % mod;
}
ll npr (ll n,ll r)
{
return (fact[n] * inv[n - r]) % mod;
}
vector<int> adj[N];
bool visted[N];
int main()
{
int n,m,sum = 0;
cin>>n>>m;
int a[n];
for(int i = 0;i<n;i++)
cin>>a[i];
sort(a,a+n);
for(int j = 0;j<m;j++)
sum+=a[j];
cout<<sum;
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<utility>
#include<memory>
#include<cmath>
#include<stack>
#include<tuple>
#include<numeric>
#include<cassert>
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define pb push_back
#define DEBUG false
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<int,ll>;
using Pd = pair<double,double>;
using T = tuple<double,double,int>;
const int mod=1e9+7,INF=1<<30;
const double EPS=1e-12,PI=3.1415926535897932384626;
const ll LINF=1LL<<60;
const int MAX_N = 8003;
const ll lmod = 1e9+7;
int cnt[2][MAX_N];
bool dp[4][MAX_N];
int main(){
string S; int N,x,y,a;
cin >> S >> x >> y ;
N = S.length();
S = S + "T";
a = 0;
while(S[a]=='F') a++;
x -= a;
fill(dp[0],dp[0]+MAX_N*4,false);
int cnt = 0, flag = 0;
dp[0][0] = dp[1][0] = dp[2][0] = dp[3][0] = true;
int xprev = 0 ,xnow = 1 ,yprev = 2 ,ynow = 3;
REP(i,a,N+1){
if(S[i]=='F') cnt++;
else{
if(cnt!=0){
int now,prev;
if(!flag) prev = xprev, now = xnow, swap(xprev,xnow);
else prev = yprev, now = ynow, swap(yprev,ynow);
fill(dp[now],dp[now]+N,false);
rep(i,N+1){
if(i+cnt<MAX_N) dp[now][i+cnt] |= dp[prev][i];
dp[now][abs(i-cnt)] |= dp[prev][i];
}
}
cnt = 0;
(flag += 1) %= 2;
}
}
cout << (((dp[xprev][abs(x)] && dp[yprev][abs(y)])) ? "Yes" : "No") << endl;
return 0;
}
| 0
| 18,115,877
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace std;
int main()
{
string s;
cin>>s;
if(s.size()<4){
cout<<"No"<<endl;
}
else{
if(s[0]=='Y'&&s[1]=='A'&&s[2]=='K'&&s[3]=='I')cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
|
#include<iostream>
#include<string>
#define MAX 100005
#define NIL -1
using namespace std;
struct Node {int parent, left, right; };
Node Nodes[MAX];
int node_num;
int Depth[MAX] ;
void set_depth(int num, int depth){
Depth[num] = depth;
if (Nodes[num].right != NIL)
{
set_depth(Nodes[num].right, depth);
}
if (Nodes[num].left != NIL)
{
set_depth(Nodes[num].left, depth+1);
}
}
void print_children(int num){
cout << "[" ;
int temp_num = NIL;
if (Nodes[num].left != NIL) {
temp_num = Nodes[num].left;
cout << temp_num;
}
if (temp_num != NIL) {
while (Nodes[temp_num].right != NIL) {
cout << ", " << Nodes[temp_num].right ;
temp_num = Nodes[temp_num].right;
}
}
cout << "]" << endl;
}
void print_ans(){
for (int i = 0; i < node_num; ++i)
{
string type;
if (Nodes[i].parent == NIL) {
type = "root, ";
}else if (Nodes[i].left == NIL) {
type = "leaf, ";
}else{
type = "internal node, ";
}
cout << "node " << i << ": parent = " << Nodes[i].parent << ", depth = " << Depth[i] << ", " << type ;
print_children(i);
}
}
int main(){
int id, k, leaf, child, start;
cin >> node_num;
for (int i = 0; i < node_num; ++i)
{
Nodes[i].parent = Nodes[i].left = Nodes[i].right = NIL;
}
for (int i = 0; i < node_num; ++i)
{
cin >> id >> k;
for (int j = 0; j < k; ++j)
{
cin >> leaf;
if (j == 0)
{
Nodes[id].left = leaf;
} else {
Nodes[child].right = leaf;
}
child = leaf;
Nodes[child].parent = id;
}
}
for (int i = 0; i < node_num; ++i)
{
if (Nodes[i].parent == NIL)
{
start = i;
}
}
set_depth(start, 0);
print_ans();
}
| 0
| 57,804,355
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MOD = 1000000007;
const int INF = 1e9;
const int mod = 1000000007;
const int inf = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
int n;
cin >> n;
vector<int> a(n), pos(n);
ll ans = 0;
for(int i = 0; i < n; i++) cin >> a[i], a[i]--, pos[a[i]] = i;
set<int> s;
for(int i = n-1; i >= 0; i--) {
int x = pos[i];
s.insert(x);
ll c = 0;
vector<int> l(2, -1), r(2, n);
{
int f = 0;
auto it = s.find(x);
while(it!=s.begin()) {
it--;
l[f] = *it;
f++;
if(f == 2) break;
}
}
{
int f = 0;
auto it = s.find(x);
while(1) {
it++;
if(it == s.end()) break;
r[f] = *it;
f++;
if(f == 2) break;
}
}
vector<int> ls(2), rs(2);
ls[0] = x - l[0];
ls[1] = l[0] - l[1];
rs[0] = r[0] - x;
rs[1] = r[1] - r[0];
c = (ll)rs[1]*ls[0]+(ll)rs[0]*ls[1];
ans += c*(i+1);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
typedef long long ll;
void solve() {
int K,S;
cin >> K >> S;
int ans = 0;
REP(X,K+1) REP(Y,K+1) {
int Z = S - X - Y;
if(0 <= Z && Z <= K) ans++;
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 0
| 32,987,265
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define bug(x) cerr<<#x<<" "<<x<<endl;
#define T int time; scanf("%d", &time); while(time--)
int main(){
ll n,m;
cin>>n>>m;
ll r=min(n,m);
ll rr=max(n,m);
for(ll i=0; i<rr; i++)cout<<r;
cout<<endl;
}
|
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define ll long long
#define pii pair<int, int>
#define is insert
#define er erase
using namespace std;
const int MAX_N = 2e5 + 1;
const int INF = 1e9;
int solve();
#define TASK ""
int main()
{
#ifdef DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
int n;
int a[MAX_N];
void eraseFromRight(set<pii> & s, int margin)
{
while (!s.empty())
{
pii it = *s.rbegin();
if (it.X > margin)
{
s.er(it);
}
else
{
break;
}
}
}
set<pii> :: iterator findLetter(set<pii> & s, int pos)
{
if (s.empty())
{
return s.end();
}
set<pii> :: iterator it = s.upper_bound(mp(pos, INF));
if (it == s.begin())
{
return s.end();
}
else
{
it--;
if (it -> X == pos)
{
return it;
}
else
{
return s.end();
}
}
}
bool add(set<pii> & s, int pos, int x)
{
if (pos == 0)
{
return false;
}
set<pii> :: iterator it = findLetter(s, pos);
if (it == s.end())
{
if (x == 1)
{
return false;
}
s.is(mp(pos, 2));
}
else if (it -> Y < x)
{
pii cur = *it;
s.er(it);
cur.Y++;
s.is(cur);
}
else
{
s.er(it);
return add(s, pos - 1, x);
}
return true;
}
bool check(int x)
{
set<pii> s;
for (int i = 2; i <= n; ++i)
{
if (a[i] <= a[i - 1])
{
eraseFromRight(s, a[i]);
bool t = add(s, a[i], x);
if (!t)
{
return false;
}
}
}
return true;
}
int solve()
{
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
int l = 0;
int r = MAX_N;
while (r - l > 1)
{
int m = (l + r) / 2;
if (check(m))
{
r = m;
}
else
{
l = m;
}
}
cout << r << endl;
return 0;
}
| 0
| 4,481,670
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long N,M;cin>>N>>M;
vector<long>A(N);for(long i=0;i<N;i++)cin>>A[i];
unordered_map<long,long>C;
long s=0;
long ans=0;
for(long i=0;i<N;i++){
s=(s+A[i])%M;
ans+=C[s];
C[s]++;if(s==0)ans++;
}
cout<<ans;
}
|
#include <iostream>
#include <string>
#include<iomanip>
#include <algorithm>
#include <map>
#include <vector>
#include<queue>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include <map>
#include<string.h>
#include<sstream>
#include<stack>
#include<unordered_map>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <cstdio>
#include <cstdlib>
#include <complex>
#define ll long long
#define point complex<double>
#define pi acos(-1)
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define arr2dof vector vector<vector<int>>dp(N,vector<int>(2, inf));
using namespace std;
const ll N = 2e5 + 5, mod = 1e9 + 7, inff = -1e12, inf = 1e9 + 7;
const double ep = 0.0000000001;
double dot(point a, point b) {
return (conj(a)*b).real();
}
double cross(point a, point b) {
return (conj(a)*b).imag();
}
double angle(point a, point b)
{
double dt = dot(a, b);
dt /= abs(a);
dt /= abs(b);
return acos(dt) * 180.0 / pi;
}
bool isrightangel(int ind) {
vector<point>v;
return(angle(v[ind] - v[(ind + 1) % 3], v[ind] - v[(ind + 2) % 3]) == 90);
}
ll fact[1000006], inv[1000006];
ll fp(ll base, ll exp)
{
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
return ans;
}
void calcFacAndInv(ll n)
{
fact[0] = inv[0] = 1;
for (ll i = 1; i <= n; i++)
{
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r)
{
return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}
ll npr(ll n, ll r)
{
return (fact[n] * inv[n - r]) % mod;
}
int GCD(int a, int b) {
if (b == 0)
return a;
else
return GCD(b, a%b);
}
int LCM(int a, int b) {
return (a*b) / GCD(a, b);
}
int main() {
ios
int n,k, arr[100005];
cin >> n>>k;
int m = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
n--;
k--;
cout << (n / k)+(n%k!=0);
return 0;
}
| 0
| 7,660,927
|
#include<bits/stdc++.h>
using namespace std;
int n,a,b;
pair<int,int> ar[1005];
bool f(pair<int,int> p){
return p.first>=a&&p.second>=b;
}
int main(){
cin>>n>>a>>b;
for(int i=1;i<=n;i++){cin>>ar[i].first>>ar[i].second;}
cout<<count_if(ar+1,ar+n+1,f);
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
class TOPO{
public:
vvi G;
vi out;
vector<bool>V;
vi indeg;
int n;
TOPO(int size){
n=size;
G=vvi(n);
out=vi(0);
V=vector<bool>(n);
indeg=vi(n);
}
void add_edge(int s,int t){
G[s].pb(t);
}
void bfs(int s){
queue<int>q;
q.push(s);
V[s]=true;
while(!q.empty()){
int u=q.front();q.pop();
out.pb(u);
rep(i,G[u].size()){
int v=G[u][i];
indeg[v]--;
if(indeg[v]==0&&!V[v]){
V[v]=true;
q.push(v);
}
}
}
}
void tsort(){
rep(i,n)indeg[i]=0;
rep(i,n)rep(j,G[i].size()){
int v=G[i][j];
indeg[v]++;
}
rep(i,n)if(indeg[i]==0&&!V[i])bfs(i);
}
};
int main(){
int n,m;
cin>>n>>m;
TOPO topo(n);
while(m--){
int a,b;
cin>>a>>b;
topo.add_edge(a,b);
}
topo.tsort();
rep(i,n)cout<<topo.out[i]<<endl;
}
| 0
| 43,053,558
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
int a;
vector<P> s(n+1);
for (int i = 1; i <= n; i++) {
cin >> a;
s[i].first = a;
s[i].second = i;
}
sort(s.begin(), s.end());
for (int i = 1; i <= n; i++) {
cout << s[i].second << " ";
}
printf("\n");
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long gcd(long long x, long long y){
if(y==0) return x;
else return gcd(y,x%y);
}
long long lcm(long long x, long long y){
return x / gcd(x, y) * y;
}
long long com[200005];
void combination(long long n,long long k){
com[0] = 1;
for(int i=1;i<=k;i++){
com[i] = (com[i-1]*(n-i+1)%MOD)*modinv(i,MOD)%MOD;
}
}
int main(){
int A,B; cin >> A >> B;
if(A%3==0 || B%3==0 || (A+B)%3==0){
cout << "Possible" << endl;
}else{
cout << "Impossible" << endl;
}
return 0;
}
| 0
| 55,577,276
|
#include <iostream>
#include <set>
using namespace std;
const string YES = "Yes";
const string NO = "No";
int main() {
int N;
cin >> N;
set<string> s;
string W;
char lastc{'\0'};
bool pred{true};
for (int i = 0; i < N; ++i) {
cin >> W;
if(!s.insert(W).second || (lastc && W.front() != lastc)) {
pred = false;
break;
}
lastc = W.back();
}
cout << (pred ? YES : NO) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll N, K; cin >> N >> K;
string S; cin >> S;
ll i = 0;
vector<pair<ll, ll>> v;
while (i < S.size()) {
ll count_1 = 0;
while (i < S.size() && S[i] == '1') i++, count_1++;
if (i == S.size()) {
v.push_back({count_1, 0});
break;
}
ll count_0 = 0;
while (i < S.size() && S[i] == '0') i++, count_0++;
v.push_back({count_1, count_0});
}
v.push_back({0, 0});
if (v.size()-1 <= K) {
ll total = 0;
for (auto elem : v) {
total += elem.first + elem.second;
}
cout << total << endl;
return 0;
}
ll max_num = 0;
ll total = 0;
rep(i, K - 1) {
total += v[i].first + v[i].second;
}
reprr(i, K - 1, v.size()-1) {
total += v[i].first + v[i].second;
total += v[i+1].first;
max_num = max(max_num, total);
total -= v[i+1].first;
total -= (v[i - K + 1].first + v[i - K + 1].second);
}
cout << max_num << endl;
return 0;
}
| 0
| 77,952,440
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
using namespace std;
int main()
{
int64_t N, p, m = 10e+5, c = 0;
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> p;
if (m >= p)
{
c++;
}
m = min(m, p);
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << 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;
}
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; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
map<int,int> m;
rep(i, n)
{
cin >> a[i];
m[a[i]]++;
}
sort(ALL(a));
vector<bool> dp(1000001, false);
int ans = 0;
rep(i, n)
{
if (!dp[a[i]])
{
int j = 1;
if (m[a[i]] < 2)
ans++;
while (a[i] * j <= 1000000)
{
dp[a[i] * j] = true;
j++;
}
}
}
cout << ans << "\n";
}
| 0
| 72,376,271
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.