code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s;
for (size_t i = 0; i < s.size(); i++)
{
if (s.at(i)!='x')
{
t += s.at(i);
}
}
for (size_t i = 0; i < t.size()/2; i++)
{
if (t.at(i)!=t.at(t.size()-1-i))
{
cout << -1;
return 0;
}
}
vector<int> spot(t.size() + 1);
int chking = 0;
for (size_t i = 0; i < s.size(); i++)
{
if (chking<t.size()&&s.at(i)==t.at(chking))
{
chking++;
}
else
{
spot.at(chking)++;
}
}
int ans=0;
for (size_t i = 0; i < spot.size()/2; i++)
{
ans += abs(spot.at(i) - spot.at(spot.size() - 1 - i));
}
cout << ans;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>b;i--)
#define vint vector<int>
#define vvint vector<vint>
#define CST(x) cout<<fixed<<setprecision(x)
#define ct(a) cout<<a<<endl
static const double pi = 3.141592653589793;
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
map<char, int> mp;
string S,cpy;
int ans;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> S;
int N = S.length();
int mae = 0;
int usiro = N - 1;
bool flag = false;
while (usiro - mae > 0) {
if (S[mae] == S[usiro]) {
mae++; usiro--;
continue;
}
if (S[mae] == 'x') {
ans++;
mae++;
continue;
}
if (S[usiro] == 'x') {
ans++;
usiro--;
continue;
}
flag = true;
break;
}
if (flag)cout << -1 << endl;
else cout << ans << endl;
return 0;
} | 1 | 55,781,794 |
#include<iostream>
using namespace std;
#define MAX 16
int a,b,n,x,y,cnt;
bool field[MAX][MAX];
void rec(int x,int y)
{
if(field[x][y]==false)return;
if(x==a-1&&y==b-1){
cnt++;
return;
}
if(x+1<a)rec(x+1,y);
if(y+1<b)rec(x,y+1);
return;
}
int main()
{
int i,j;
while(cin>>a>>b>>n,a|b){
for(i=0;i<a;i++)for(j=0;j<b;j++)field[i][j]=true;
while(n-->0){
cin>>x>>y;
field[x-1][y-1]=false;
}
cnt=0;
rec(0,0);
cout<<cnt<<endl;
}
} | #include <cstdio>
#include <cstring>
using namespace std;
#define MAX_L 16
int table[MAX_L + 1][MAX_L + 1];
bool wall[MAX_L + 1][MAX_L + 1];
int a, b, n;
int main(){
while(1){
scanf("%d%d", &a, &b);
if(a == 0 && b == 0) return 0;
scanf("%d", &n);
int in_x, in_y;
memset(wall, 0, sizeof(wall));
for(int i = 0; i < n; i++){
scanf("%d%d", &in_x, &in_y);
wall[in_x][in_y] = true;
}
memset(table, 0, sizeof(table));
table[1][1] = 1;
for(int y = 1; y <= b; y++){
for(int x = 1; x <= a; x++){
if(wall[x][y] || (x == 1 && y == 1)) continue;
table[x][y] = table[x - 1][y] + table[x][y - 1];
}
}
printf("%d\n", table[a][b]);
}
} | 1 | 83,943,015 |
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define REP(i,s,e) for(int i=int(s);i<=int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)
int main(){
int a[6]={500,100,50,10,5,1};
int b,s;
while(true){
cin >> b;
if(b==0) break;
int coins=0;
s=1000-b;
rep(i,6){
coins+=s/a[i]; s%=a[i];
}
cout << coins << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
int a;
while (scanf("%d", &a), a) {
int coin[] = { 500,100,50,10,5,1 };
a = 1000 - a;
int cnt = 0;
rep(i, 6) {
while (a - coin[i] >= 0) {
a -= coin[i];
cnt++;
}
if (a == 0)break;
}
printf("%d\n", cnt);
}
return 0;
} | 1 | 36,577,757 |
#include <algorithm>
#include <iostream>
using namespace std;
int ch(int n, int k) {
return n < k ? 0 : k == 0 ? 1 : ch(n - 1, k - 1) * n / k;
}
int power(int a, int k) {
return k == 0 ? 1 : power(a, k - 1) * a;
}
int main() {
string s; cin >> s;
int n = s.length();
int k; cin >> k;
int cnt = 0;
for (int i = 0; i < n; i++) {
int d = s[i] - '0';
if (d)
cnt++;
}
int ans = cnt == k;
cnt = 0;
for (int i = 0; i < n; i++) {
int d = s[i] - '0';
if (d == 0)
continue;
ans += ch(n - 1 - i, k - cnt) * power(9, k - cnt);
if (k > cnt)
ans += ch(n - 1 - i, k - cnt - 1) * power(9, k - cnt - 1) * (d - 1);
if (cnt++ == k)
break;
}
cout << ans << '\n';
return 0;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
long long calc1(string N) {
return (long long)9 * (N.size() - 1) + ((long long)N[0] - '0');
}
long long calc2(string N) {
long long ans = 0;
rep(i, N.size() - 2)ans += 9 * ((long long)i + 1) * 9;
ans += ((long long)N[0] - '0' - 1) * 9 * (N.size() - 1);
rep(i, N.size() - 1) {
if (N[i + 1] != '0') {
ans += calc1(N.substr(i + 1));
break;
}
}
return ans;
}
int main() {
string N; cin >> N;
int K; cin >> K;
long long ans = 0;
if (K == 1)ans = calc1(N);
if (K == 2)ans = calc2(N);
if (K == 3) {
rep(i, N.size() - 3)ans += 9 * 9 * ((long long)i + 2) * ((long long)i + 1) * 9 / 2;
if (N.size() >= 3) {
long long num = 0;
num = ((long long)N.size() - 1) * (N.size() - 2) / 2 * 9 * 9;
ans += ((long long)N[0] - '0' - 1) * num;
rep(i, N.size() - 1) {
if (N[i + 1] != '0') {
ans += calc2(N.substr(i + 1));
break;
}
}
}
}
cout << ans;
} | 1 | 18,840,688 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
a[i]--;
}
set<int> st;
int ans=0;
int pos=0;
bool ok=1;
st.insert(pos);
while(true){
ans++;
if(a[pos]==1) break;
if(st.count(a[pos])){
ok=0;
break;
}
st.insert(a[pos]);
pos=a[pos];
}
cout<<(ok?ans:-1)<<endl;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> visited;
visited.push_back(1);
int now = 1;
int output = 1;
while (1) {
now = a[now - 1];
if (now == 2) {
cout << output << endl;
return 0;
}
if (find(visited.begin(), visited.end(), now) != visited.end()) {
cout << -1 << endl;
return 0;
}
visited.push_back(now);
output++;
}
return 0;
} | 1 | 55,995,841 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
string S1, S2;
cin >> S1 >> S2;
reverse(all(S1));
if (S1 == S2)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
string a, b;
int main () {
cin >> a >> b;
reverse (a.begin(), a.end());
if (a == b){
cout << "YES";
} else {
cout << "NO";
}
} | 1 | 51,645,219 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>x>>y;
if(abs(x-y)<=1)
cout<<"Brown"<<endl;
else
cout<<"Alice"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define INF 1007654321
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define FAST_IO() ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
ostream& operator<<(ostream &os, const vector<T> &v) { for (auto x : v) os << x << " "; return os << "\n"; }
int main() {
FAST_IO();
ll X, Y; cin >> X >> Y;
if(abs(X - Y) <= 1) cout << "Brown\n";
else cout << "Alice\n";
return 0;
} | 1 | 38,937,319 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); ++i)
#define TS to_string
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define endl "\n"
ll INF = 1e9;
ll MOD = 1000000007;
ll LINF = 1e18;
ld EPS = 1e-9;
ld PI = M_PI;
vll dx = {1, 0, -1, 0, 1, -1, -1, 1};
vll dy = {0, 1, 0, -1, 1, 1, -1, -1};
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;}
void yes(){ cout << "Yes" << endl;}
void no(){ cout << "No" << endl;}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n, m;
cin >> n >> m;
vector<pll> vec(n);
REP(i,n) cin >> vec[i].first >> vec[i].second;
sort(ALL(vec));
deque<pll> deq;
REP(i,n) deq.push_back(vec[i]);
ll ans = 0;
bpqll que;
for(ll i = m; i >= 0; i--){
while(!deq.empty() && m - i >= deq.front().first){
que.push(deq.front().second);
deq.pop_front();
}
if(!que.empty()){
ans += que.top(); que.pop();
}
}
cout << ans <<endl;
return 0;
} | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using ll = int64_t;
using namespace std;
int64_t n,m;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
using P = pair<ll,ll>;
int64_t ans = 0;
priority_queue<P> p;
priority_queue<int64_t> q;
REP(i,n){
int64_t a,b;cin >> a >> b;
p.emplace(-a,b);
}
for(int64_t i = 1;i <= m;i++){
while(p.size()){
if(-p.top().first <= i){
q.push(p.top().second);
p.pop();
}else break;
}
if(q.size()){
ans += q.top();
q.pop();
}
}
cout << ans << '\n';
} | 1 | 63,454,744 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i =a; i < b; i++)
#define all(a) a.begin(), a.end()
#define PI 3.14159265359
int main(){
string s; cin >> s;
int alphabet[123] = {};
rep(i, s.size()){
alphabet[int(s[i])]++;
}
bool flg = true;
repr(i, 97, 122){
if(alphabet[i] > 1){
flg = false;
break;
}
}
if(flg){
cout << "yes" << endl;
}else{
cout << "no" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
const double pi=3.141592653589793;
template<class T> using V=vector<T>;
using Graph = vector<vector<int>>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const ll INF=1e18;
int main(){
string s;
cin>>s;
set<char> st;
int n=s.size();
rep(i,n)st.insert(s[i]);
if(st.size()==n)cout<<"yes"<<endl;
else cout<<"no"<<endl;
} | 1 | 17,605,057 |
#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
string s;
cin >> s;
if (s.size()>=4 &&
s[0] == 'Y' &&
s[1] == 'A' &&
s[2] == 'K' &&
s[3] == 'I'){
cout << "Yes" << endl;
}else {
cout << "No" << endl;
}
} | #include<iostream>
#include<complex>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
typedef long long int llint;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
char s[110];
cin >> s;
if (strlen(s) < 4) {
cout << "No" << endl;
return 0;
}
if (s[0] == 'Y'&&s[1] == 'A'&&s[2] == 'K'&&s[3] == 'I') {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | 1 | 51,404,232 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
}
map<ll, ll> b, c;
for (int i = 0; i < n; i++){
if (i % 2){
c[a[i]]++;
}
else
b[a[i]]++;
}
vector<P> bs(0), cs(0);
for (auto p : b){
bs.emplace_back(P(p.second, p.first));
}
for (auto p : c){
cs.emplace_back(P(p.second, p.first));
}
sort(bs.begin(), bs.end());
sort(cs.begin(), cs.end());
if (bs[bs.size()-1].second == cs[cs.size()-1].second){
if (bs.size() == 1){
if (cs.size() == 1){
cout << n/2 << endl;
}
else {
cout << n/2 - cs[cs.size()-2].first << endl;
}
}
else {
if (cs.size() == 1)
cout << n/2 - bs[bs.size()-2].first << endl;
else {
ll s = bs[bs.size()-1].first + cs[cs.size()-2].first;
ll t = bs[bs.size()-2].first + cs[cs.size()-1].first;
cout << n - max(s, t) << endl;
}
}
}
else
cout << n - bs[bs.size()-1].first - cs[cs.size()-1].first << endl;
return 0;
} | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b;
*b=temp;
}
int main(void){
int N;
cin>>N;
vector<int> a(N);
for(int i=0;i<N;i++){
cin>>a[i];
}
set<int> s;
map<int,int> mp1,mp2;
for(int i=0;i<N;i++){
if(i%2==0) mp1[a[i]]++;
else mp2[a[i]]++;
s.insert(a[i]);
}
if(s.size()==1){
cout<<N/2<<endl;
return 0;
}
vector<pair<int,int>> odd,even;
for(auto x:mp1){
odd.push_back({x.first,x.second});
}
for(auto y:mp2){
even.push_back({y.first,y.second});
}
sort(odd.begin(),odd.end(),sort_sec);
sort(even.begin(),even.end(),sort_sec);
int X=odd.size();
int Y=even.size();
if(odd[X-1].first!=even[Y-1].first){
cout<<N-odd[X-1].second-even[Y-1].second<<endl;
}else{
int result1=N-odd[X-1].second-even[Y-2].second;
int result2=N-odd[X-2].second-even[Y-1].second;
cout<<min(result1,result2)<<endl;
}
return 0;
} | 1 | 58,282,180 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
string s;
cin >> s;
int s_len = s.size();
deque<char> dq;
for ( int i = 0; i < s_len; i++ ) {
if ( s.at(i) != 'B' )
dq.push_back(s.at(i));
else if ( !dq.empty() )
dq.pop_back();
}
while ( !dq.empty() ) {
cout << dq.front();
dq.pop_front();
}
cout << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
int inf = sizeof(int) == sizeof(long long) ? 2e18 : 1e9 + 10;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string S;
cin>>S;
vector<string> ans;
for (int i=0, str_size=S.size();i<str_size;++i) {
if (S[i] == '0') ans.push_back("0");
if (S[i] == '1') ans.push_back("1");
if (S[i] == 'B' && !ans.empty()) ans.erase(ans.end());
}
for(auto x : ans) cout<<x;
cout<<endl;
return 0;
} | 1 | 15,594,531 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int A,B,C; cin >> A >> B >> C;
if (A<=C && C<=B) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES";} else {return "NO";}}
int main(){
int A, B, C;
cin >> A >> B >> C;
Cout(Yes(A <= C && C <= B));
} | 1 | 54,437,491 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int main(){
string L;
cin >> L;
int n = L.size();
vector<vector<ll>> dp(n+1,vector<ll>(2,0));
dp[0][0] = 1;
for(int i=1;i<=n;i++){
int ld = L[i-1] - '0';
if(ld == 1){
dp[i][0] = (2*dp[i-1][0])%MOD;
dp[i][1] = (3*dp[i-1][1] + dp[i-1][0])%MOD;
}else{
dp[i][0] = dp[i-1][0];
dp[i][1] = (3*dp[i-1][1])%MOD;
}
}
cout << (dp[n][0] + dp[n][1])%MOD << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA() cerr << "AAAAA" << endl
#define debug_() cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
using Graph = vector<vector<int>>;
int main()
{
string s;
cin >> s;
int MOD = 1000000007;
vector<vector<int>> dp(100005, vector<int>(2, 0));
dp[0][0] = 1;
for (int i = 0; i < s.size(); i++)
{
if (s[i] == '0')
{
(dp[i + 1][0] += dp[i][0]) %= MOD;
(dp[i + 1][1] += dp[i][1]) %= MOD;
}
else
{
(dp[i + 1][1] += (dp[i][0] + dp[i][1])) %= MOD;
}
if (s[i] == '0')
{
(dp[i + 1][1] += dp[i][1] * 2 % MOD) %= MOD;
}
else
{
(dp[i + 1][0] += dp[i][0] * 2 % MOD) %= MOD;
(dp[i + 1][1] += dp[i][1] * 2 % MOD) %= MOD;
}
}
cout << (dp[s.size()][0] + dp[s.size()][1]) % MOD << endl;
} | 1 | 51,513,121 |
#include <iostream>
#include <string>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
using namespace std;
int k;
string s;
int main() {
cin >> k >> s;
int sl = s.length();
if(sl > k){
rep(i, 0, k) cout << s[i];
cout << "..." << endl;
}
else {
cout << s << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int K;string S;cin>>K>>S;
int l=S.size();
string ans;
if(l<=K) ans=S;
else {
ans=S.substr(0,K);
ans = ans+"...";
}
cout<<ans<<endl;
} | 1 | 29,340,309 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
#define MOD 1000000007
using namespace std;
int main(int argc, char* argv[])
{
long n;
scanf("%ld", &n);
vector<long> a(n);
long i;
for(i=0; i<n; i++) {
scanf("%ld", &a[i]);
}
long p=1;
ll cnt=0;
for(i=0; i<n; i++) {
if(a[i]==p) {
p++; continue;
}
if(p==1) {
cnt += (a[i]-1);
p++;
}
else if(a[i]%p==0) {
cnt += (a[i]/p-1);
}
else {
cnt += (a[i]/p);
}
}
printf("%lld\n", cnt);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A;
int main() {
scanf("%d", &N);
A.resize(N);
for(int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int mn = 2;
ll ans = (A[0] - 1);
for(int i = 1; i < N; i++) {
if(A[i] == mn) {
mn++;
continue;
}
ans += (A[i] - 1) / mn;
}
cout << ans;
} | 1 | 37,536,614 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=1e9+7;
int main() {
int x,t;
cin>>x>>t;
cout<<max(x-t,0)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll a,b;
cin>>a>>b;
if(a-b>0){
cout<<a-b<<endl;
}else{
cout<<"0"<<endl;
}
return 0;
} | 1 | 86,267,663 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
ll h,w,n;
cin >> h >> w >> n;
vector<P> pos;
for (int i=0;i<n;i++){
ll a,b;
cin >> a >> b;
for (int j=0;j<3;j++){
for (int k=0;k<3;k++){
if (a-j>0 && b-k>0 && a-j<=h-2 && b-k<=w-2){
P temp = make_pair(a-j,b-k);
pos.push_back(temp);
}
}
}
}
sort(pos.begin(),pos.end());
ll ans[9];
fill(ans,ans+9,0);
ll prevfirst = -1;
ll prevsecond = -1;
ll plus = 0;
int count = 0;
for (int i=0;i<pos.size();i++){
if (pos[i].first == prevfirst &&
pos[i].second == prevsecond){
count++;
}else {
plus++;
if (count > 0){
ans[count-1]++;
}
count = 1;
}
prevfirst = pos[i].first;
prevsecond = pos[i].second;
}
if (count>0){
ans[count-1]++;
}
ll anszero = (h-2)*(w-2)-plus;
cout << anszero << endl;
for (int i=0;i<9;i++){
cout << ans[i] << endl;
}
} | #include <iostream>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unordered_set<ll> pset;
ll pii(int y, int x) {
return ll(y-1) * 1000000000LL + ll(x-1);
}
int neighbor_search(const pset& bs, int y, int x) {
int r = 0;
for(int i=y-1; i<=y+1; i++) for(int j=x-1; j<=x+1; j++) {
if(bs.find(pii(i, j)) != bs.end()) {
r++;
}
}
return r;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
pset blacks;
for(int i=0; i<n; i++) {
int a, b;
cin >> a >> b;
blacks.insert(pii(a, b));
}
pset visited;
ll count[10] = {};
for(auto itr=blacks.begin(); itr!=blacks.end(); ++itr) {
int a = int(*itr / 1000000000LL) + 1, b = int(*itr % 1000000000LL) + 1;
for(int i=max(a-1, 2); i<=min(a+1, h-1); i++) {
for(int j=max(b-1, 2); j<=min(b+1, w-1); j++) {
auto pib = visited.insert(pii(i, j));
if(pib.second) {
int r = neighbor_search(blacks, i, j);
count[r]++;
}
}
}
}
ll s = 0;
for(int i=1; i<=9; i++) {
s += count[i];
}
count[0] = ll(h-2) * ll(w-2) - s;
for(int i=0; i<=9; i++) {
cout << count[i]<< endl;
}
} | 1 | 52,864,667 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAXN = 100005;
const int mod = 998244353;
bool query(lint x){
printf("? %lld\n", x);
fflush(stdout);
char str[10]; cin >> str;
return *str == 'Y';
}
int main(){
if(query(1e10)){
lint cur = 9;
for(int i=1; ; i++){
if(query(cur) == 1){
printf("! %lld\n", (cur + 1) / 10);
return 0;
}
cur = cur * 10 + 9;
}
}
lint pwr = 1;
for(int i=0; ; i++){
if(!query(pwr)){
lint s, e;
s = pwr / 10;
e = pwr - 1;
while(s != e){
lint m = (s + e) / 2;
if(query(1000000 * m + 696969) == 0){
s = m + 1;
}
else e = m;
}
printf("! %lld\n", s);
return 0;
}
pwr *= 10;
}
} | #include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <time.h>
using namespace std;
long double esp=1e-11;
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define cle(a) while(!a.empty())a.pop()
#define mem(p,c) memset(p,c,sizeof(p))
#define mp(A, B) make_pair(A, B)
#define pb push_back
typedef long long int LL;
const long double PI = acos((long double)-1);
const LL INF=0x3f3f3f3f3f3f3f3fll;
const int MOD =1000000007ll;
const int maxn=100100;
char s[100];
char g[100];
int main()
{
printf("? 1000000000000\n");
fflush(stdout);
scanf("%s",s);
if(s[0]=='Y')
{
LL ans=1;
LL tem=9;
for(int x=1;x<=10;x++)
{
printf("? %lld\n",tem);
fflush(stdout);
scanf("%s",s);
if(s[0]=='Y')
break;
ans*=10;
tem=tem*10+9;
}
printf("! %lld\n",ans);
fflush(stdout);
return 0;
}
else
{
g[0]='1';
for(int x=1;x<=10;x++)
{
g[x]='0';
printf("? %s\n",g);
fflush(stdout);
scanf("%s",s);
if(s[0]=='N')
{
g[x]='\0';
break;
}
}
int len=strlen(g);
if(len==1)
{
for(int x=1;x<=9;x++)
{
printf("? %d\n",x*10);
fflush(stdout);
scanf("%s",s);
if(s[0]=='Y')
{
printf("! %d\n",x);
fflush(stdout);
return 0;
}
}
}
for(int x=0;x<=len-2;x++)
{
int l,r;
if(x==0)l=1;
else l=0;
r=9;
while(l<r)
{
int m=(l+r+1)/2;
g[x]=m+'0';
string ss(g,g+x+1);
printf("? %s\n",ss.c_str());
fflush(stdout);
scanf("%s",s);
if(s[0]=='Y')l=m;
else r=m-1;
}
g[x]=l+'0';
}
g[len]='9';
for(int x=0;x<=9;x++)
{
g[len-1]='0'+x;
string ss(g,g+len+1);
printf("? %s\n",ss.c_str());
fflush(stdout);
scanf("%s",s);
if(s[0]=='Y')
{
string ss(g,g+len);
printf("! %s\n",ss.c_str());
fflush(stdout);
return 0;
}
}
}
return 0;
} | 1 | 80,704,795 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
template<typename T, typename U>
size_t operator()(const pair<T, U> &x) const {
size_t seed = hash<T>()(x.first);
return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);
int k, n;
int a[200100];
int solve() {
int d = 0;
for (int i = 0; i < n-1; i++) {
d = max(d, a[i+1] - a[i]);
}
d = max(d, a[0]+k-a[n-1]);
return k - d;
}
void input() {
cin >> k >> n;
for (int i = 0; i < n; i++) cin >> a[i];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
} | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double lld;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int k,n;
cin>>k>>n;
vector<int> a(n);
int start = 0;
int dist_max = 0;
for (int i = 0;i<n;i++) cin>>a[i];
ll ans = 0;
for (int i = 0;i<n;i++){
if ((a[(i+1)%n]-a[i]+k)%k > dist_max){
dist_max = (a[(i+1)%n]-a[i]+k)%k;
start = (i+1)%n;
}
}
for (int i = start; i<start+n-1;i++){
ans+= (a[(i+1)%n]-a[i%n]+k)%k;
}
cout<<ans<<"\n";
} | 1 | 61,636,730 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int a,b,c;
cin >> a >> b >> c;
set<int> s;
s.insert(a);
s.insert(b);
s.insert(c);
cout << s.size() << endl;
return 0;
} | #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 ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int a, b, c;
cin >> a >> b >> c;
set<int> st{a, b, c};
cout << st.size() << endl;
return 0;
} | 1 | 64,956,596 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 100001
int A[MAX];
vector<int> v[MAX];
void dfs(int root, int parent) {
if(v[root].size() == 1) return;
ll mx = -1, sum = -A[root];
for(int vv : v[root]) {
if(vv != parent) {
dfs(vv, root);
sum += A[vv];
if(mx < A[vv]) mx = A[vv];
}
}
if(sum < 0 || A[root] < mx || (A[root]-=sum) < 0) puts("NO"), exit(0);
}
int main(void) {
int i, n, a, b, root;
scanf("%d", &n);
for(i=0; i<n; i++) scanf("%d", A+i);
if(n == 2) return puts(A[0] == 1 && A[1] == 1 ? "YES" : "NO"), 0;
for(i=0; i<n-1; i++) {
scanf("%d%d", &a, &b);
v[a-1].emplace_back(b-1);
v[b-1].emplace_back(a-1);
}
for(root=0; root<n; root++) {
if(v[root].size() > 1) {dfs(root, -1); break;}
}
puts(A[root] ? "NO" : "YES");
return 0;
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_set>
#include <complex>
#include <valarray>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#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 i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __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& i:r)std::cin>>i;
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
template<class T> std::vector<std::vector<T>> VV(int n) {
return std::vector<std::vector<T>>(n);
}
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
#define int ll
using ll = long long;
using ull = unsigned long long;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
signed main() {
INIT;
VAR(int, n);
VEC(int, a, n);
VEC_ROW(int, n - 1, u, v);
std::vector<std::vector<int>> g(n);
REP(i, n-1) {
--u[i]; --v[i];
g[u[i]].emplace_back(v[i]);
g[v[i]].emplace_back(u[i]);
}
bool f = true;
std::function<void(int, int)> dfs = [&](int v, int par) {
int sum = 0;
int max = 0;
bool chi = true;
for (auto to : g[v]) {
if (to == par) continue;
chi = false;
dfs(to, v);
sum += a[to];
CHMAX(max, a[to]);
}
if (chi) return;
if (max > a[v] || sum > 2 * a[v] || sum < a[v]) {
f = false;
return;
}
a[v] -= sum - a[v];
};
dfs(0, -1);
if (g[0].size() != 1 && a[0] != 0) f = false;
OUT((f ? "YES" : "NO"))BR;
return 0;
} | 1 | 57,767,238 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int64_t n;
cin >> s >> n;
int64_t k=s.size(),cnt=0;
if(s==string(k,s[0]))cout << n*k/2 << endl;
else{
for(int64_t i=0;i<k;i++){
if(s[i]==s[i+1] && s[i+1]==s[i+2]){
cnt++;
i++;
}else if(s[i]==s[i+1])cnt++;
}
if(s[0]==s[k-1]){
int a=0,b=0;
for(int i=0;i<k;i++){
if(s[i]==s[0])a++;
else break;
}
for(int i=k-1;i>=0;i--){
if(s[i]==s[k-1])b++;
else break;
}
cout << (int64_t)cnt*n-(int64_t)((a/2)+(b/2)-((a+b)/2))*(n-1) << endl;
}else cout << (int64_t)cnt*n << endl;
}
} | #include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define all(v) v.begin(),v.end()
#define lllim 2147483648
#define Pi 2*acos(0.0)
#define sci(n) scanf("%d",&n)
#define scii(n,m) scanf("%d%d",&n,&m)
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld%lld",&n,&m)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mem(a,b) memset(a, b, sizeof(a))
#define fill_(a,b) fill(a,a+n,b);
#define MOD 1000000007
#define fast_cin ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define filein freopen("input.txt","r", stdin)
#define D(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
#define case int t,cas=1;cin>>t;while(t--)
#define rep(i,a,n) for(int i=a;i<n;i++)
#define rev(i,n,a) for(int i=n;i>=a;i--)
template<class T> void ckmin(T& a, const T& b) {
a= b < a? b:a;
}
template<class T> void ckmax(T& a, const T& b) {
a= b > a? b:a;
}
template<class T> void read(T& a) {
std::cin>>a;
}
template<class T> void read(T& a,const int sidx, const int eidx) {
for(int i=sidx; i<eidx; i++)
std::cin>>a[i];
}
using namespace std;
using namespace __gnu_pbds;
const int maxn=100005;
vector<int>pr;
bool mark[maxn];
void si()
{
mem(mark,0);
for(int i=4; i<maxn; i+=2) mark[i]=1;
for(int i=3; i*i<maxn; i+=2)
{
if(!mark[i])
for(int j=i*i; j<maxn; j+=2*i)
mark[j]=1;
}
pr.pb(2);
for(int i=3; i<maxn; i+=2)
if(!mark[i])
pr.pb(i);
}
void solve()
{
string s;
ll k;
read(s);
read(k);
ll ans=0;
ll prv=1;
ll pos=0;
ll cnt=-1;
rep(i,1,s.size())
{
if(s[i]!=s[i-1])
{
if(cnt==-1)
{
cnt=i;
}
ans+=prv/2;
prv=1;
}
else
{
prv++;
}
}
ans+=prv/2;
if(cnt==-1)
{
ll res=((ll)s.size() * k)/2;
cout<<res<<endl;
return;
}
ll res=ans*k;
if(s[0]==s[s.size()-1])
{
ll cnt2=1;
for(int i=s.size()-2; i>=pos; i--)
{
if(s[i]==s[i+1])
{
cnt2++;
}
else break;
}
res-=(cnt/2+cnt2/2-(cnt+cnt2)/2)*(k-1);
}
cout<<res<<endl;
}
int main()
{
fast_cin;
{
solve();
}
return 0;
} | 1 | 57,051,148 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;cin>>s;
int result=0;
int l=0, r = s.size()-1;
while(r>l){
if(s[l]==s[r]){
l++;
r--;
continue;
}
if(s[l]!=s[r]){
if(s[l]=='x'){
l++;
result++;
}else if(s[r]=='x'){
r--;
result++;
}else{
cout<<-1<<endl;return 0;
}
}
}
cout<<result<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
string s;
int main(){
cin >> s;
string left = s, right = s;
reverse(right.begin(), right.end());
int res = 0;
for(int i = 0; i < (left.size() + 1) / 2; i++){
char r = right.at(i), l = left.at(i);
int n = left.size();
if(r == l){
continue;
}
if(r != 'x' && l != 'x'){
res = -1;
cerr << "break" << endl;
break;
}
if(r == 'x'){
right.insert(n - i, "x");
left.insert(i, "x");
}else if(l == 'x'){
right.insert(i, "x");
left.insert(n - i, "x");
}
res++;
}
cout << res << endl;
return 0;
} | 1 | 55,637,111 |
#include<bits/stdc++.h>
using namespace std;
vector<int>g[200010];
int ans[100010];
bool vis[100010];
void bfs(int rt)
{
vis[rt]=1;
queue<int>q;
q.push(rt);
while(!q.empty())
{
int adj=q.front(); q.pop();
for(auto x: g[adj])
{
if(vis[x]==0)
{
vis[x]=1;
ans[x]=adj;
q.push(x);
}
}
}
}
int main()
{
int n,m,a,b;
cin>>n>>m;
for(int i=0; i<m; i++)
{
scanf("%d%d", &a,&b);
g[a].push_back(b);
g[b].push_back(a);
}
bfs(1);
for(int i= 1; i<=n; i++)
{
if(vis[i]==0)
{
cout<<"No";
return 0;
}
}
cout<<"Yes"<<endl;
for(int i=2; i<=n; i++)
printf("%d\n", ans[i]);
} | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define F first
#define S second
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
using namespace std;
ll mod=1e9 +7;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=0){
if(exponent&1) ans=(1LL*ans*base)%mod;
base=(1LL*base*base)%mod;
exponent>>=1;
}
return ans%mod;
}
vector<bool> prime(90000002,true);
void Sieve()
{
for (int p=2; p*p<=90000001; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=90000001; i += p)
prime[i] = false;
}
}
}
const ll M=200006;
ll f[M],inv[M];
void compute(){
f[0]=1;
rep(i,1,M-1){
f[i]=(1LL*i*f[i-1])%mod;
}
inv[M-1]=expo(f[M-1],mod-2,mod);
for(ll i=M-2;i>=0;i--){
inv[i]=(1LL*(i+1)*inv[i+1])%mod;
}
}
ll C(ll n,ll r){
return (1LL*((1LL*f[n]*inv[r])%mod)*inv[n-r])%mod;
}
ll n,m;
vector<ll> graph[100005];
ll ans[100005]={0};
ll vis[100005]={0};
ll dis[100005];
void bfs()
{
queue<pair<ll,ll>>q;
q.push({1LL,0LL});
vis[1]=1;
dis[1]=0;
while(!q.empty())
{
pair<ll,ll>p=q.front();
q.pop();
for(auto x:graph[p.first])
{
if(vis[x]==0)
{
vis[x]=1;
dis[x]=p.second+1;
q.push({x,p.second+1LL});
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll tests=1;
while(tests--)
{
ll i,j;
cin>>n>>m;
rep(i,0,m-1)
{
ll a,b;
cin>>a>>b;
graph[a].pb(b);
graph[b].pb(a);
}
for(i=0;i<=n;i++) {vis[i]=0;dis[i]=500000;}
bfs();
bool flag=true;
for(i=1;i<=n;i++)
{
if(vis[i]==0) {flag=false;break;}
}
if(!flag) {cout<<"No";return 0;}
for(i=2;i<=n;i++)
{
for(auto x:graph[i])
{
if(dis[x]<dis[ans[i]]) ans[i]=x;
}
}
cout<<"Yes"<<"\n";
for(i=2;i<=n;i++) cout<<ans[i]<<"\n";
}
return 0;
} | 1 | 32,650,435 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dl double long
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rrep(i, m, n) for(ll i = (ll)(m); i > (ll)(n); --i)
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
int n;
void countingsort(int a[], int b[], int k){
int c[10001];
rep(i, 0, k+1) c[i] = 0;
rep(j, 1, n+1) c[a[j]]++;
rep(i, 1, k+1) c[i] += c[i-1];
rrep(j, n, 0) {
b[c[a[j]]] = a[j];
c[a[j]]--;
}
}
int main(void){
int *a, *b;
cin >> n;
a = new int[n+1];
b = new int[n+1];
rep(i, 1, n+1) cin >> a[i];
countingsort(a, b, 10000);
rep(i, 1, n+1) {
if(i-1) cout << ' ';
cout << b[i];
}
cout << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#define MAXV 10000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(MAXV, 0);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
cnt[temp]++;
}
int count = 0;
for (int i = 0; i < cnt.size(); i++) {
while (cnt[i]) {
if (count)
cout << " ";
cout << i;
count++;
cnt[i]--;
}
}
cout << endl;
return 0;
} | 1 | 80,400,430 |
#include <iostream>
#include <cstdio>
using namespace std;
long long a, b, k, c;
int main() {
cin >> a >> b >> k;
for(int i=0; i<k; i++) {
if(i%2==0) {
if(a&1) a--;
c = a/2;
a -= c;
b += c;
} else {
if(b&1) b--;
c = b/2;
b -= c;
a += c;
}
}
cout << a << ' ' << b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL A, B;
void recursive(int k, bool b){
if(k == 0) return;
if(b){
if(A & 1) A--;
A >>= 1, B += A;
}else{
if(B & 1) B--;
B >>= 1, A += B;
}
recursive(k - 1, !b);
}
int main(){
int K;
scanf("%lld %lld %d", &A, &B, &K);
recursive(K, true);
printf("%lld %lld\n", A, B);
return 0;
} | 1 | 25,003,875 |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
string s;
vector<int> v;
ll calc(ll x, ll y) {
if(x < y) swap(x,y);
return x*(x+1)/2 + y*(y-1)/2;
}
int main() {
cin>>s;
int N = s.size();
int cnt = 0;
if(s[0] != '<') {
v.pb(0);
}
for(int i=0;i<N;++i) {
++cnt;
if(i == N-1 || s[i] != s[i+1]) {
v.pb(cnt);
cnt = 0;
}
}
if(s[N-1] != '>') {
v.pb(0);
}
ll sum = 0;
for(int i=0;i<v.size();i+=2) {
sum += calc(v[i], v[i+1]);
}
cout<<sum<<"\n";
return 0;
} | #include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
vector <int> vec;
long long calc(){
long long res = 0;
for(int i = 0; i < vec.size(); i++){
res += vec[i];
}
return res;
}
void solution(string s){
for(int i = 0; i < s.size(); i++){
if(s[i] == '<')
vec[i+1] = vec[i] + 1;
}
for(int i = s.size()-1; i >= 0; i--){
if(s[i] == '>')
vec[i] = max(vec[i], vec[i+1]+1);
}
cout << calc() << endl;
}
int main(){
string s;
cin >> s;
for(int i = 0; i < s.size()+1; i++)
vec.push_back(0);
solution(s);
} | 1 | 91,220,221 |
#include<iostream>
using namespace std;
#define MAX 100005
#define HN -1
struct Node{
int p,l,r;
};
Node Ta[MAX];
int num,Da[MAX];
void express(int d){
int i,o;
cout << "node "<< d <<": ";
cout << "parent = "<< Ta[d].p << ", ";
cout << "depth = "<<Da[d] <<", ";
if(Ta[d].p == HN){
cout << "root, ";
}
else if(Ta[d].l == HN){
cout << "leaf, ";
}
else cout << "internal node, ";
cout << "[";
for(i=0,o=Ta[d].l;o!=HN;i++,o=Ta[o].r){
if(i){
cout<<", ";
}
cout << o;
}
cout <<"]"<<endl;
}
int jug(int u,int p){
Da[u] =p;
if(Ta[u].r != HN){
jug(Ta[u].r,p);
}
if(Ta[u].l != HN){
jug(Ta[u].l,p+1);
}
}
int main(){
int i,j,d,vi,ci,l,r;
cin >> num;
for(i=0;i<num;i++){
Ta[i].p=Ta[i].l=Ta[i].r=HN;
}
for(i=0;i<num;i++){
cin >> vi >>d;
for(j=0;j<d;j++){
cin>>ci;
if(j==0){
Ta[vi].l =ci;
}
else Ta[l].r=ci;
l=ci;
Ta[ci].p=vi;
}
}
for(i=0;i<num;i++){
if(Ta[i].p ==HN){
r=i;
}
}
jug(r,0);
for(i=0;i<num;i++){
express(i);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i)=0; (i)<(n); i++)
#define pb push_back
using veci = vector<int>;
using ll = long long;
using G = vector<vector<int>>;
struct Node{
int id;
int parent;
int depth;
veci children;
void addChild(int num){
children.pb(num);
}
};
using P = pair<Node, int>;
Node tree[100100];
void init(int n){
rep(i, n){
tree[i].depth = tree[i].parent = -1;
tree[i].children.clear();
}
return;
}
int main(){
int n, id, num, childsid;
cin >> n;
init(n);
rep(i, n){
cin >> id >> num;
tree[id].id = id;
rep(j, num){
cin >> childsid;
tree[id].addChild(childsid);
tree[childsid].parent = id;
}
}
int root;
rep(i, n){
if (tree[i].parent == -1){
root = i;
break;
}
}
queue<P> q;
q.push(make_pair(tree[root], -1));
while(!q.empty()){
P p = q.front(); q.pop();
tree[p.first.id].depth = p.second + 1;
rep(i, p.first.children.size()){
q.push(make_pair(tree[p.first.children[i]], p.second+1));
}
}
rep(i, n){
cout << "node " << i << ": parent = ";
cout << tree[i].parent << ", depth = ";
cout << tree[i].depth << ", ";
if(tree[i].parent == -1){
cout << "root";
}
else if(tree[i].children.empty())cout << "leaf";
else cout << "internal node";
cout << ", [";
rep(j, tree[i].children.size()){
cout << tree[i].children[j];
if (j != tree[i].children.size()-1) cout << ", ";
}
cout << "]" << endl;
}
} | 1 | 75,662,985 |
#include <bits/stdc++.h>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, X;
cin >> A >> B >> X;
int total = A * A * B;
double ans;
if (X * 2 >= total) {
double air = total - X;
double tanTheta = air / (A * A * A * .5);
ans = atan(tanTheta) * 180 / M_PI;
} else {
double tanTheta = X / (A * B * B * .5);
ans = 90 - atan(tanTheta) * 180.0 / M_PI;
}
printf("%.8f\n", ans);
return 0;
} | #include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
#define PI 3.14159265
int main(){
double a, b, x; cin >> a >> b >> x;
double s = a * a * b;
cout << fixed << setprecision(6);
if (x <= s / 2) cout << 90 - atan(x / (a * b * b) * 2) * 180.0 / PI << '\n';
else cout << atan((s - x)/(a * a * a / 2)) * 180.0 / PI << '\n';
} | 1 | 35,801,076 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N+1],B[N+1],answer=0;
A[0] = 0;
B[0] = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
B[i] = B[i-1]^A[i];
A[i] += A[i-1];
}
for (int r = 1, l = 1; r <= N; r++) {
while (A[r]-A[l-1] != (B[r]^B[l-1]) && l++);
answer += r-l+1;
}
cout << answer;
} | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for(int in=0;in<n;in++) {
cin >> a.at(in);
}
llint ans=0;
int r = 0, sum = 0;
for(int l=0;l<n;l++) {
while(r<n && (sum^a.at(r))==(sum+a.at(r))) {
sum += a.at(r);
r++;
}
ans += r-l;
if(l==r) r++;
else {
sum -= a.at(l);
}
}
cout << ans << endl;
return 0;
} | 1 | 4,322,987 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c; cin >> a >> b >> c;
if (a + b >= c){
puts("Yes");
}else {
puts("No");
}
} | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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; }
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9+7;
const ll LINF = 1LL<<60;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 1,047,693 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include <cctype>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
int main(){
vector<char> s(19);
rep(i,19){
cin >> s[i];
if(s[i]==',') s[i]=' ';
}
rep(i,19) cout << s[i];
cout << endl;
} | #include <stdio.h>
int main (){
char str [20];
scanf ("%s", str);
for (int i = 0; i < 19; i++) {
if (i == 5 || i == 13) {
printf(" ");
continue;
}
printf("%c", str[i]);
}
puts("");
return 0;
} | 1 | 54,999,116 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int nHr(int a,int b){return nCr(a+b-1,b);}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}
int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}
int sankaku(int x){return ((1+x)*x)/2;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llnHr(long long a,long long b){return llnCr(a+b-1,b);}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}
long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}
long long llsankaku(long long x){return ((1+x)*x)/2;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) ; for(int i=(a); i<(b); i++)
#define clean(arr,val) memset(arr,val,sizeof(arr))
#define forn(i,n) forr(i,0,n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
bool is_prime (int x){
if (x<=1) return false ;
for (int i=2 ; i*i<=x ; i++){
if (x%i==0) return false ;
}
return true;
}
string alpha = "abcdefghijklmnopqrstuvwxyz" ;
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ;
int rec[1000000];
int dp(int n){
if ( rec[n] >= 0){
return rec[n];
}
int res ;
if (n == 0) {
res = 1;
}
if ( n < 100 && n > 0){
res = 0;
}
if ( n > 104){
res = (dp(n-100)-1) * (dp(n-101)-1) *(dp(n-102)-1) *(dp(n-103)-1) *(dp(n-104)-1) *(dp(n-105)-1)*-1 + 1;
}
return rec[n] = res ;
}
int main() {
memset (rec , -1 , sizeof(rec) ) ;
int n;
cin >> n;
cout << dp(n) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int x;
cin >> x;
int hundred = x / 100;
int have = hundred * 5;
int need = x - hundred * 100;
if(have >= need) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | 1 | 67,806,567 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <utility>
#include <deque>
#include <stack>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
#define rep(i,n) for (int i=0;i<n;++i)
#define REP(i,n) for (int i=1;i<=n;++i)
#define all(x) x.begin(),x.end()
#define mp make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define read(x) scanf("%d",&x)
int n;
ll d[100005];
map<ll,int> m;
ll dp[100005];
int sz[100005];
vector<pii> ans;
int main(){
ios::sync_with_stdio(false);
cin>>n;
for (int i=1;i<=n;++i){
cin>>d[i];m[d[i]]=i;sz[i]=1;
}
sort(d+1,d+n+1);reverse(d+1,d+n+1);
memset(dp,0,sizeof(dp));
for (int i=1;i<n;++i){
int u=m[d[i]];
ll want=d[i]+(sz[u]<<1)-n;
if (!m.count(want)){
cout<<-1<<endl;return 0;
}
int pa=m[want];
ans.pb(mp(u,pa));
sz[pa]+=sz[u];
dp[pa]+=dp[u]+sz[u];
}
if (dp[m[d[n]]]!=d[n]){
cout<<-1<<endl;return 0;
}
for (int i=0;i<n-1;++i) cout<<ans[i].F<<' '<<ans[i].S<<endl;
return 0;
} | #include<cstdio>
#include<algorithm>
#include<vector>
#define N_ 101000
using namespace std;
int n, C[N_];
vector<int>E[N_];
struct point {
long long x;
int num;
bool operator<(const point &p)const {
return x != p.x ? x < p.x : num < p.num;
}
}w[N_];
long long sum;
void DFS(int a, int d) {
sum += d;
for (auto &x : E[a])DFS(x, d + 1);
}
int main() {
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &w[i].x);
w[i].num = i, C[i] = 1;
}
sort(w + 1, w + n + 1);
for (i = n; i > 1; i--) {
int t = w[i].num;
long long nx = w[i].x - n + C[t] * 2;
point tp = { nx,-1 };
int j = lower_bound(w + 1, w + n + 1, tp) - w;
if (nx >= w[i].x || j<1 || j>n || w[j].x != nx) {
puts("-1");
return 0;
}
C[w[j].num] += C[t];
E[w[j].num].push_back(t);
}
DFS(w[1].num, 0);
if (sum != w[1].x)puts("-1");
else {
for (i = 1; i <= n; i++)for (auto &x : E[i])printf("%d %d\n", i, x);
}
} | 1 | 77,549,276 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int A;
cin >> A;
int G = A, M = A;
for (int i = 1; i < N; i++) {
int a;
cin >> a;
G = __gcd(a, G);
M = max(a, M);
}
if (K <= M && K % G == 0) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
} | #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[i];
}
int g = 0;
int mx = 0;
for (int i = 0; i < N; i++){
g = __gcd(g, A[i]);
mx = max(mx, A[i]);
}
if (K > mx || K % g != 0){
cout << "IMPOSSIBLE" << endl;
} else {
cout << "POSSIBLE" << endl;
}
} | 1 | 10,122,237 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i,n) for(int i=0; i<(n); i++)
#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(n) begin(n),end(n)
#define IN(a, x, b) (a<=x && x<b)
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
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; }
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
int main()
{
INIT;
int n;
cin >> n;
int count = 0;
vector<int> h(n);
REP(i,n){
cin >> h.at(i);
}
for(int i = 1; i < n; i++){
int ma = h.at(i-1);
for(int j = 0; j < i; j++){
ma = max(ma, h.at(j));
}
if(ma <= h.at(i)) count++;
}
cout << count + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define fore(i,x,n) for(int i=x;i<n;i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define ordenar(a) sort(all(a))
typedef long long ll;
typedef vector<int> vi;
int n, h, pre = 0, cont = 0;
int main(){
IOS
cin>>n;
fore(i,0,n){
cin>>h;
if(h >= pre) {
cont++;
pre = h;
}
}
cout<<cont;
return 0;
} | 1 | 83,161,469 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iterator>
#include <set>
#include <map>
using namespace std;
const double PI=acos(-1);
int main(){
long n;
string s, t;
cin >> n >> s >> t;
long pos = s.length();
for(int i = 0; i < s.length(); i++){
string u = s.substr(i), v = t.substr(0, u.length());
if(u == v){
pos = i;
break;
}
}
cout << pos + t.length() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int N;
string s,t;
cin >> N >> s >> t;
int ans;
rep(i,N+1) {
string tmp = s.substr(0,i);
tmp += t;
if (tmp.substr(0,N)==s) {
ans = i+N;
break;
}
}
cout << ans << endl;
} | 1 | 72,637,456 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, t, r;
cin >> x >> t;
r = x - t;
if (r < 0) {
cout << 0 << '\n';
} else {
cout << r << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main() {
ll x,t;cin >>x>>t;
ll ans=max(x-t,0LL);
cout<<ans <<endl;
} | 1 | 46,974,328 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
using namespace std;
int main(void){
string s1,s2;
cin>>s1>>s2;
int dp[1010][1010];
for(int i=0;i<=s1.size();i++){
dp[0][i]=i;
}
for(int i=0;i<=s2.size();i++){
dp[i][0]=i;
}
for(int i=1;i<=s2.size();i++){
for(int j=1;j<=s1.size();j++){
dp[i][j]=10000;
}
}
for(int i=1;i<=s2.size();i++){
for(int j=1;j<=s1.size();j++){
int a=dp[i-1][j]+1,b=dp[i][j-1]+1;
dp[i][j]=min(a,b);
if(s2[i-1]==s1[j-1])dp[i][j]=min(dp[i][j],dp[i-1][j-1]);
else dp[i][j]=min(dp[i][j],dp[i-1][j-1]+1);
}
}
cout<<dp[s2.size()][s1.size()]<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(string& s1, string& s2){
vector<vector<ll> > dp(s1.length()+1, vector<ll>(s2.length()+1,INT_MAX));
dp[0][0] = 0;
for (ll i = 0; i < s1.length(); i++)
{
dp[i+1][0] = i+1;
}
for (ll i = 0; i < s2.length(); i++)
{
dp[0][i+1] = i+1;
}
for (ll i = 1; i < s1.length()+1; i++)
{
for (ll j = 1; j < s2.length()+1; j++)
{
dp[i][j] = min(dp[i][j-1] + 1, dp[i-1][j] + 1 );
dp[i][j] = min(dp[i][j], dp[i-1][j-1] + (s1[i-1] == s2[j-1] ? 0:1));
}
}
cout << dp[s1.length()][s2.length()] << endl;
}
int main(){
string s1,s2;
cin >> s1 >> s2;
solve(s1,s2);
return 0;
} | 1 | 9,697,591 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1000000007;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
ll a, b, c, d;
cin >> a >> b >> c >> d;
vector<ll> x(101,0 );
for (ll i = a; i < b;i++){
x[i]++;
}
for (ll i = c; i < d;i++){
x[i]++;
}
ll ans = 0;
rep(i,101){
if(x[i]==2){
ans++;
}
}
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
int main()
{int A, B, C, D; cin >> A >> B >> C >> D;
cout << max(0, min(B, D) - max(A, C));} | 1 | 17,338,529 |
#include <iostream>
#include <sstream>
#include <string>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <iomanip>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(v) ((int)v.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
ll MOD = 1000000007;
ll modPow(ll x, ll y)
{
ll r=1, a=x;
while (y > 0) {
if ( (y&1)==1 ) {
r = (r * a) % MOD;
}
a = (a * a) % MOD;
y /= 2;
}
return r;
}
ll modInverse(ll x)
{
return modPow(x, MOD-2);
}
ll modDivision(ll p, ll q)
{
return (p * modInverse(q)) % MOD;
}
ll n_choose_k(ll n, int k)
{
if (k > n) {
return 0;
}
ll p = 1, q = 1;
for (int i=1; i<=k; i++) {
q = ( q * i) % MOD;
p = ( p * (n - i + 1) ) % MOD;
}
return modDivision( p, q);
}
vector<ll> make_choose_table(ll N) {
vector<ll> table(N+1);
table[0] = 1;
FOR(k, 1, N+1) {
auto nxt = (table[k-1] * (N - (k - 1))) % MOD;
table[k] = modDivision(nxt, k);
}
return table;
}
int main(void)
{
cin.sync_with_stdio(false);
int N;
cin >> N;
vector<ll> As(N+1);
vector<int> count(N+1);
ll target = -1;
REP(n,N+1) {
cin >> As[n];
++count[As[n]];
if (count[As[n]] == 2) target = As[n];
}
vector<int> splits(3);
int idx = 0;
for(auto a: As) {
if (a == target) ++idx;
else ++splits[idx];
}
auto left = splits[0];
auto right = splits[2];
vector<ll> ans(N+2);
vector<ll> cache_N1 = make_choose_table(N-1);
vector<ll> cache_LR = make_choose_table(left + right);
FOR(k, 1, N) {
ans[k] += cache_N1[k];
ans[k] %= MOD;
}
FOR(k, 0, N) {
ans[k+2] += cache_N1[k];
ans[k+2] %= MOD;
}
FOR(k, 0, N) {
ans[k+1] += cache_N1[k] * 2;
ans[k+1] %= MOD;
if (k <= left + right) {
ans[k+1] -= cache_LR[k];
if (ans[k+1] < 0) ans[k+1] += MOD;
}
}
FOR(i, 1, N+2) cout << ans[i] << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
const int MOD = 1E9+7;
const int N = 100000+5;
const int dx[] = {-1,1,0,0,-1,-1,1,1};
const int dy[] = {0,0,-1,1,-1,1,-1,1};
using namespace std;
LL a[N];
LL inv[N];
LL fac[N];
map<LL,int> bucket;
void init() {
fac[0]=1;
fac[1]=1;
inv[0]=1;
inv[1]=1;
for(LL i=2;i<N;i++) {
fac[i]=fac[i-1]*i%MOD;
inv[i]=(MOD-MOD/i)*inv[MOD%i]%MOD;
}
for(int i=1;i<N;i++)
inv[i]=inv[i]*inv[i-1]%MOD;
}
LL C(LL n, LL m){
if(m>n)
return 0;
return ((fac[n]*inv[m]%MOD)*inv[n-m])%MOD;
}
int main() {
init();
LL n;
while(cin >> n)
{
map<LL, int>q;
LL p = 0;
for(int i = 1; i <= n + 1; i++)
{
scanf("%lld", a + i);
if(!q[a[i]])
q[a[i]] = i;
else
p = i;
}
for(int i = 0; i <= n; i++)
{
LL ans = 0;
ans = (ans + C(n + 1, i + 1)) % MOD;
ans = (ans - C(n - p + q[a[p]], i)) % MOD;
while(ans < 0)
ans += MOD;
printf("%lld\n", ans);
}
}
return 0;
} | 1 | 54,580,343 |
#include <iostream>
#include <cstring>
#include <cctype>
using namespace std;
int McxiTen (char *c) {
int i = 0;
int n = 0;
while(i < strlen(c)) {
int tmp = 1;
if(isdigit(c[i])) {
tmp = c[i] - '0';
i++;
} else {
}
switch(c[i]) {
case 'i' : n += tmp; break;
case 'x' : n += tmp * 10; break;
case 'c' : n += tmp * 100; break;
case 'm' : n += tmp * 1000; break;
default : break;
}
i++;
}
return n;
}
void TenMcxi (int n, char *c) {
int ns[4];
ns[0] = n / 1000;
n = n % 1000;
ns[1] = n / 100;
n = n % 100;
ns[2] = n / 10;
n = n % 10;
ns[3] = n;
int j = 0;
for(int i = 0; i < 4; i++) {
if(ns[i] != 0) {
if(ns[i] != 1) {
c[j++] = (char)(ns[i] + '0');
}
switch(i) {
case 0 : c[j++] = 'm'; break;
case 1 : c[j++] = 'c'; break;
case 2 : c[j++] = 'x'; break;
case 3 : c[j++] = 'i'; break;
}
}
}
c[j] = '\0';
return;
}
int main(void) {
char a[1000], b[1000];
int n;
cin >> n;
while(cin >> a >> b) {
char c[9999];
int sum = McxiTen(a) + McxiTen(b);
TenMcxi(sum, c);
cout << c << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
void solve()
{
int n;
cin >> n;
while(n--)
{
string s1, s2;
cin >> s1 >> s2;
int num1 = 0, num2 = 0;
if(s1.size() == 1)
{
if(s1[0] == 'm')
{
num1 = 1000;
}
else if(s1[0] == 'c')
{
num1 = 100;
}
else if(s1[0] == 'x')
{
num1 = 10;
}
else if(s1[0] == 'i')
{
num1 = 1;
}
}
else
{
for(int i = 0; i < s1.size(); ++i)
{
if(s1[i] == 'm')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1])
{
num1 += 1000;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 1000 * (s1[i - 1] - '0');
}
}
if(s1[i] == 'c')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1] )
{
num1 += 100;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 100 * (s1[i - 1] - '0');
}
}
if(s1[i] == 'x')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1] )
{
num1 += 10;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 10 * (s1[i - 1] - '0');
}
}
if(s1[i] == 'i')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1] )
{
num1 += 1;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 1 * (s1[i - 1] - '0');
}
}
}
}
if(s2.size() == 1)
{
if(s2 == "m")
{
num2 = 1000;
}
else if(s2 == "c")
{
num2 = 100;
}
else if(s2 == "x")
{
num2 = 10;
}
else if(s2 == "i")
{
num2 = 1;
}
}
else
{
for(int i = 0; i < s2.size(); ++i)
{
if(s2[i] == 'm')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1])
{
num2 += 1000;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 1000 * (s2[i - 1] - '0');
}
}
if(s2[i] == 'c')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1] )
{
num2 += 100;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 100 * (s2[i - 1] - '0');
}
}
if(s2[i] == 'x')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1] )
{
num2 += 10;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 10 * (s2[i - 1] - '0');
}
}
if(s2[i] == 'i')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1] )
{
num2 += 1;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 1 * (s2[i - 1] - '0');
}
}
}
}
int ans = num1 + num2;
if(ans >= 2000)
{
cout << ans / 1000 << "m";
}
else if(ans >= 1000)
{
cout << "m";
}
ans %= 1000;
if(ans >= 200)
{
cout << ans / 100 << "c";
}
else if(ans >= 100)
{
cout << "c";
}
ans %= 100;
if(ans >= 20)
{
cout << ans / 10 << "x";
}
else if(ans >= 10)
{
cout << "x";
}
ans %= 10;
if(ans >= 2)
{
cout << ans << "i";
}
else if(ans >= 1)
{
cout << "i";
}
cout << endl;
}
}
int main()
{
solve();
return(0);
} | 1 | 2,882,552 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
char x,a;
while(1){
scanf("%c",&x);
if(islower(x)){
a = toupper(x);
cout << a;
}else if(isupper(x)){
a = tolower(x);
cout << a;
}else{
cout << x;
}
if(x == '\n'){
break;
}
}
return 0;
} | #include <cstdio>
#include <cctype>
int main() {
char ch;
while (1) {
scanf("%c", &ch);
if (isalpha(ch)) {
if (isupper(ch)) {
printf("%c", tolower(ch));
} else {
printf("%c", toupper(ch));
}
} else {
printf("%c", ch);
}
if (ch == '\n') break;
}
return 0;
} | 1 | 91,028,822 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
if(v[0] == v[1]) {
cout << v[2] << "\n";
} else {
cout << v[0] << "\n";
}
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int arr[3];
int main(){
for(int i=0;i<3;i++){cin>>arr[i];}
sort(arr,arr+3);
if(arr[0]!=arr[1]) cout<<arr[0];
else cout<<arr[2];
return 0;
} | 1 | 68,881,381 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0)
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define SZ(c) ((int)(c).size())
#define debug(x) cerr << #x << " = " << (x) << '\n';
using P = pair<int,int>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll MOD = 1000000007;
const int INF = 1 << 30;
class UnionFind {
public:
UnionFind(int N) {
_N = N;
_make_set();
}
int find(int x) {
if (_parent[x] != x) {
_parent[x] = find(_parent[x]);
}
return _parent[x];
}
void unite(int x, int y) {
int x_root = find(x);
int y_root = find(y);
if (x_root == y_root) return;
int x_rank = _rank[x_root];
int y_rank = _rank[y_root];
if (x_rank > y_rank) {
_parent[y_root] = x_root;
_size[x_root] += _size[y_root];
} else if (x_rank < y_rank) {
_parent[x_root] = y_root;
_size[y_root] += _size[x_root];
} else {
_parent[y_root] = x_root;
_rank[x_root] += 1;
_size[x_root] += _size[y_root];
}
}
bool same_set(int x, int y) { return find(x) == find(y); }
int size(int x) { return _size[find(x)]; }
private:
int _N;
vector<int> _parent, _rank, _size;
void _make_set() {
_parent = vector<int>(_N + 1);
iota(_parent.begin(), _parent.end(), 0);
_rank = vector<int>(_N + 1, 0);
_size = vector<int>(_N + 1, 1);
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
int N, Q; cin >> N >> Q;
auto uf = UnionFind(N);
REP(_, Q) {
int t, u, v; cin >> t >> u >> v;
u++; v++;
if (t == 0) {
uf.unite(u, v);
} else {
cout << (uf.same_set(u, v) ? 1 : 0) << '\n';
}
}
return 0;
} | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
struct UnionFind {
std::vector<int> _parent;
std::vector<int> _size;
UnionFind(int size) : _parent(size, -1), _size(size, 1) { }
void unite(int a, int b) {
int ra = root(a), rb = root(b); if (ra == rb) { return; }
if (_size[ra] >= _size[rb]) { _parent[rb] = ra, _size[ra] += _size[rb]; } else { _parent[ra] = rb, _size[rb] += _size[ra]; }
}
int root(int a) {
int p = _parent[a];
if (p < 0) { return a; }
while (_parent[p] >= 0) { p = _parent[p]; }
return _parent[a] = p;
}
int size(int a) { return _size[root(a)]; }
};
void solve(long long N, long long Q, std::vector<long long> &t, std::vector<long long> &u, std::vector<long long> &v) {
UnionFind uf(N);
for (LL i = 0; i < Q; ++i) {
if (t[i] == 0) {
uf.unite(u[i], v[i]);
} else {
cout << (uf.root(u[i]) == uf.root(v[i])) << endl;
}
}
}
int main() {
long long N;
std::cin >> N;
long long Q;
std::cin >> Q;
std::vector<long long> t(Q);
std::vector<long long> u(Q);
std::vector<long long> v(Q);
for (int i = 0; i < Q; i++) {
std::cin >> t[i];
std::cin >> u[i];
std::cin >> v[i];
}
solve(N, Q, t, u, v);
return 0;
} | 1 | 39,280,540 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
string str;
bool flag=false;
cin >> str;
sort(str.begin(),str.end());
if(str.at(0)==str.at(1)){
if(str.at(2)==str.at(3)){
if(str.at(1)!=str.at(2)){
flag=true;
}
}
}
if(flag) cout << "Yes" <<endl;
else cout <<"No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
string s;
cin >> s;
bool flag = false;
if(s[0] == s[1] && s[2] == s[3]) flag = true;
if(s[0] == s[2] && s[1] == s[3]) flag = true;
if(s[0] == s[3] && s[1] == s[2]) flag = true;
if(s == string((int)s.size(), s[0])) flag = false;
if(flag) cout << "Yes" << '\n';
else cout << "No" << '\n';
} | 1 | 20,368,251 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S, T;
int cnt = 0;
cin >> S >> T;
for (int i = 0; i < S.size(); i++){
if (S[i] == T[i]) cnt++;
}
if (T[S.size()] >= 'a' && T[S.size()] <= 'z') cnt++;
if (cnt == T.size()) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s,t;
cin >> s >> t;
t.pop_back();
if (s==t)cout << "Yes" << endl;
else cout << "No" <<endl;
return 0;
} | 1 | 99,500,733 |
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define Debug(x) cout << #x " = " << (x) << endl
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define mod 1000000007
#define pi 3.141592653589793238
#define ll long long int
#define ull unsigned long long
#define be begin()
#define en end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORI(i, a, b) for (int i = a; i >= b; i--)
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef vector<PI> VPI;
int main()
{
IOS;
int a, b, c, k;
cin >> a >> b >> c >> k;
if (a < b && b < c)
{
cout << "Yes" << endl;
}
else
{
while (k > 0 && a >= b)
{
k--;
b *= 2;
}
while (k > 0 && b >= c)
{
k--;
c *= 2;
}
if (a < b && b < c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int cnt = 0;
while (a >= b) {
b *= 2;
cnt++;
}
while (b >= c) {
c *= 2;
cnt++;
}
cout << (cnt <= k ? "Yes" : "No") << endl;
return 0;
} | 1 | 82,753,597 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i,n) for(ll i=0; i<(n); i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define ALL(n) begin(n),end(n)
#define IN(a, x, b) (a<=x && x<b)
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
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; }
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
const long long MOD = 1000000007;
int main(void){
ll n;
ll k;
ll ans =0;
cin >> n >> k;
REP(i,n){
ll tmp;
cin >> tmp;
if(tmp >= k){
ans++;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,i,cnt=0;
cin>>n>>k;
int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
if(a[i]>=k)
{
cnt++;
}
}
cout<<cnt<<endl;
} | 1 | 32,372,688 |
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
string Shf(string s, int n){
string t = s.substr(0,n);
s.erase(0,n);
s += t;
return s;
}
int main(){
string s;
int m,n;
while(1){
cin >> s;
if (s == "-") break;
cin >> m;
for(int i = 0;i < m; i++){
cin >> n;
s = Shf(s,n);
}
cout << s << endl;
}
return 0;
} | #include<iostream>
#include <cstdio>
#include<cctype>
#include <algorithm>
#include<string>
using namespace std;
int main(){
string card,ans;
int m,h,total_h,act_h;
while(1){
cin >> card;
if(card == "-") break;
cin >> m;
total_h = 0;
for(int i = 0; i < m; i++){
cin >> h;
total_h += h;
}
int n = card.length();
act_h = 0;
act_h = total_h % n;
card += card;
ans = card.substr(act_h,n);
cout << ans << endl;
}
return 0;
} | 1 | 78,673,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin >> c;
if(c.at(0) == 'a' || c.at(0) == 'i' || c.at(0) == 'u' || c.at(0) == 'e' || c.at(0) == 'o'){
cout << "vowel" << endl;
}
else{
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
const int MOD = 1e9 + 7;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define ceiv(a, b) ((int)((a) + (b) - 1)/(int)(b))
signed main() {
char c; cin >> c;
char b[] = {'a','i','u','e','o'};
cout << (count(b, b+5, c) ? "vowel" : "consonant") << endl;
} | 1 | 15,888,147 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
#define all(a) a.begin(),a.end()
const ll mod=1e9+7,di=998244353,N=3e5+1;
bool IsQuery=false;
ll q=1,a[N];
map<int,vector<int>> edge;
map<int,bool> occ;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
void solve(){
ll n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>a[i];
ll dp[n];
memset(dp,-1,sizeof(dp));
dp[0]=0;
for(int i=0;i<n;i++){
for(int j=1;j<=k && i+j<n;j++){
if(dp[i+j]==-1)
dp[i+j]=dp[i]+abs(a[i+j]-a[i]);
dp[i+j]=min(dp[i+j],dp[i]+abs(a[i+j]-a[i]));
}
}
cout<<dp[n-1];
return;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
if(IsQuery)
cin>>q;
for(int i=0;i<q;i++){
solve();
cout<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define vl vector<ll>
#define pl pair<ll,ll>
#define vpl vector<pl>
#define vvl vector<vl>
using namespace std;
const ll N = 1e5 +5;
vl t;
ll frog(vl& v,ll n,ll k)
{
ll cst;
t [0] = 0;
for(ll i = 1;i <= n;i++)
{
ll mn = LONG_MAX;
for(ll j = 1;j <= k;j++){
if(i >= j)cst = abs(v[i-j]-v[i])+t[i-j];
mn = min(mn,cst);
}
t[i] = mn;
}
return t[n];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
ll n,h,k ;
vl v;
cin >> n >> k;
t.resize(n);
for(auto x = 0 ;x< n;x++)cin >> h,v.pb(h),t[x] = -1;
ll cst = frog(v,n-1,k);
cout << cst;
return 0;
} | 1 | 32,700,506 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define maxN 200015
int n, m, cnt;
vector<int> visited(maxN, 0);
vector<int> adj[maxN];
void dfs(int s) {
visited[s] = 1;
cnt++;
for (auto i : adj[s]) {
if (visited[i] == 0) {
dfs(i);
}
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
#endif
int a, b;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
int ans = -1;
for (int i = 1; i <= n; i++) {
if (visited[i] == 0) {
cnt = 0;
dfs(i);
ans = max(ans, cnt);
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define mp unordered_map
#define fi first
#define se second
#define endl '\n'
#define INF 1e18
#define PI 3.14159265358979323846
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main()
{
ll n,m,i,j;
cin>>n>>m;
vector<ll>adj[n];
unordered_map<ll, vector<ll> >mp;
for(i=0;i<m;i++)
{
ll a,b;
cin>>a>>b;
a--;
b--;
adj[a].pb(b);
adj[b].pb(a);
}
bool vis[n];
memset(vis,false,sizeof(vis));
ll x=1;
for(i=0;i<n;i++)
{
if(!vis[i])
{
queue<ll>q;
q.push(i);
vis[i]=true;
mp[x].pb(i);
while(!q.empty())
{
ll p = q.front();
q.pop();
for(j=0;j<adj[p].size();j++)
{
if(!vis[adj[p][j]])
{
q.push(adj[p][j]);
vis[adj[p][j]]=true;
mp[x].pb(adj[p][j]);
}
}
}
x++;
}
}
ll ans = -1;
for(auto it:mp)
{
vector<ll>v = it.se;
n = v.size();
ans = max(ans,n);
}
cout<<ans<<endl;
} | 1 | 44,072,995 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a,b,c,k;
cin>>a>>b>>c>>k;
long long t=0;
long long m=0;
if(k%2==0){
t=k*a+(k-1)*(b+c);
m=k*b+(k-1)*(a+c);
}
else{
t=(k-1)*a+k*(b+c);
m=(k-1)*b+k*(a+c);
}
if(abs(t-m)>1000000000000000000){
cout<<"Unfair"<< endl;
}
else{
cout<<t-m<< endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define INF 100000000000
#define MOD 1000000007
using namespace std;
using ll = long long;
using P = pair<int, int>;
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
int main()
{
ll a, b ,c, k;
cin >> a >> b >> c >> k;
if (a == b && a ==c) {
cout << 0 << endl;
return 0;
}
if (abs(a-b) >= pow(10,18)) {
cout << "Unfair" << endl;
return 0;
}
if (k % 2 == 0) {
cout << a - b << endl;
} else {
cout << b - a << endl;
}
return 0;
} | 1 | 44,060,519 |
#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++){
cout << "#";
}
} else {
for (int k = 0; k < W; k++){
if (k == 0 || k == W - 1){
cout << "#";
} else {
cout << ".";
}
}
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int H, W;
int i = 1;
while (1){
cin >> H >> W;
if (H == 0 && W == 0)break;
if (i)i = 0;
else cout << endl;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
if (i >0 && i <H-1){
if (j>0 && j<W-1)
cout << '.';
else cout << '#';
}
else{ cout << '#'; }
}
cout << endl;
}
}
cout << endl;
return 0;
} | 1 | 8,752,488 |
#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 all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
template <typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts)
{
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T &t, const V &v)
{
for (auto &e : t)
fill_v(e, v);
}
int main()
{
int N;
string S;
cin >> N;
cin >> S;
deque<char> ans(N);
int m = 0;
int b = 0;
for (size_t i = 0; i < N; i++)
{
ans[i] = S[i];
}
for (int i = 0; i < N; ++i)
{
if (S[i] == ')')
m++;
else
m--;
if (m > 0)
{
ans.push_front('(');
m--;
}
}
m = 0;
for (int i = N - 1; i >= 0; --i)
{
if (S[i] == '(')
m++;
else
m--;
if (m > 0)
{
ans.push_back(')');
m--;
}
}
for (auto &&i : ans)
{
cout << i;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
string s, res; cin >> s;
ll cl{0}, cr{0};
for (auto &e : s)
{
if (e == '(')
{
++cr;
}
if (e == ')')
{
if (cr > 0) --cr;
else ++cl;
}
}
REP(x, cl) std::cout << "(";
std::cout << s;
REP(x, cr) std::cout << ")";
std::cout << std::endl;
} | 1 | 80,370,926 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int h,w;
string data;
cin>>h>>w;
while(getline(cin,data)){
cout<<data<<endl;
cout<<data<<endl;
}
} | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
using namespace std;
int main() {
int H, W;
string *C;
cin >> H >> W;
C = new string[H];
for (int i = 0; i < H; i++) {
cin >> C[i];
}
for (int i = 0; i < H; i++) {
cout << C[i] << "\n" << C[i] << "\n";
}
return 0;
} | 1 | 97,081,703 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <list>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;
vector<int> out;
vector< vector<int> > Adj(MAX);
vector<int> indeg(MAX, 0), color(MAX, WHITE);
void bfs(int u);
int main() {
int V, E, v, u;
cin >> V >> E;
for (int i = 0; i < E; i++) {
cin >> v >> u;
Adj[v].push_back(u);
indeg[u]++;
}
for (int u = 0; u < V; u++) {
if (indeg[u] == 0 && color[u] == WHITE) {
bfs(u);
}
}
for (auto o : out)
cout << o << '\n';
}
void bfs(int u) {
queue<int> Q;
int s, t;
Q.push(u);
color[u] = GRAY;
while (!Q.empty()) {
s = Q.front();
Q.pop();
out.push_back(s);
for (int i = 0; i < Adj[s].size(); i++) {
t = Adj[s][i];
indeg[t]--;
if (indeg[t] == 0 && color[t] == WHITE) {
color[t] = GRAY;
Q.push(t);
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int v, e;
vector<int> g[10000];
bool visited[10000];
vector<int> ans;
void dfs(int now)
{
if (visited[now]) return;
visited[now] = true;
for (auto &nxt: g[now]) {
dfs(nxt);
}
ans.emplace_back(now);
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> v >> e;
for (int i = 0; i < e; i++) {
int s, t; cin >> s >> t;
g[s].emplace_back(t);
}
for (int i = 0; i < v; i++) dfs(i);
reverse(ans.begin(), ans.end());
for (auto &x: ans) cout << x << '\n';
return 0;
} | 1 | 46,707,731 |
#include<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll N = 100005;
ll n, d[N], cnt[N], rd[N];
map<ll,ll> dti, itd;
vector<ll> adj[N];
vector<pll> ans;
void dfs1 (ll I) {
for(auto &T : adj[I]) {
dfs1(T);
rd[I] += rd[T] + cnt[T];
}
}
void dfs2 (ll I) {
for(auto &T : adj[I]) {
rd[T] = rd[I] - cnt[T] + (n-cnt[T]);
dfs2(T);
}
}
int main()
{
scanf("%lld",&n);
for(ll i=1;i<=n;i++) {
scanf("%lld",&d[i]);
dti[d[i]] = i;
itd[i] = d[i];
}
sort(d+1, d+1+n);
for(ll i=n;i>=2;i--) {
ll I = dti[d[i]];
ll C = ++cnt[I];
ll J = dti[d[i] - (n-C) + C];
if(J == 0) {
puts("-1");
return 0;
}
ans.push_back({I, J});
cnt[J] += cnt[I];
adj[J].push_back(I);
}
ll R = dti[d[1]];
dfs1(R);
dfs2(R);
for(ll i=1;i<=n;i++) {
if(itd[i] != rd[i]) {
puts("-1");
return 0;
}
}
for(auto &T : ans) {
printf("%lld %lld\n", T.X, T.Y);
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#define VEC2(TYPE, A, B, NAME, INIT) vector<vector<TYPE>> NAME(A, vector<TYPE>(B, (INIT)))
int main()
{
int n;
cin >> n;
struct Node{
int idx = -1;
ull cost = 1;
ull costSum = 0;
};
map<ull, Node> mp;
REP(i, n)
{
ull a;
cin >> a;
mp[a].idx = i;
}
struct Edge{
int i;
int j;
};
VEC(Edge, 0, edgeAry, Edge());
for( auto it = mp.rbegin(); it != mp.rend(); ++it )
{
const ull d = it->first;
Node& node = it->second;
if( d == mp.begin()->first ) break;
ull sub = n - 2*node.cost;
auto& nextNode = mp[d-sub];
if( nextNode.idx == -1 )
{
cout << -1 << endl;
return 0;
}
nextNode.cost += node.cost;
nextNode.costSum += node.cost + node.costSum;
Edge edge;
edge.i = node.idx;
edge.j = nextNode.idx;
edgeAry.push_back( edge );
}
{
const ull d = mp.begin()->first;
Node& node = mp.begin()->second;
if( node.costSum != d )
{
cout << -1 << endl;
return 0;
}
}
for( auto& e : edgeAry )
{
cout << e.i + 1 << " " << e.j + 1 << endl;
}
return 0;
} | 1 | 3,374,114 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) { a = b; return 1; }
return 0; }
template<class T> inline bool chmin(T& a, T b) {
if (a > b) { a = b; return 1; }
return 0; }
ll INF = 1000000007;
ll fac[10000000];
ll inv[10000000],finv[10000000];
void solve(ll n, ll m){
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for(int i =2; i <= n+m; i++){
fac[i] = fac[i-1] * i %INF;
inv[i] =INF - inv[INF%i]*(INF/i)%INF;
finv[i] = finv[i-1]*inv[i]%INF;
}
}
ll COM(ll n, ll k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n]*(finv[k]*finv[n-k]%INF)%INF;
}
int main(void){
ll X,Y; cin >> X >> Y;
ll n = (2*X-Y)/3, m = (2*Y-X)/3;
if((X+Y)%3 != 0){
cout << 0 << endl;
return 0;
}
if(n < 0 || m < 0){
cout << 0 << endl;
return 0;
}
solve(n,m);
cout << COM(n+m,m) << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll MOD = 1000000007;
ll fpow(ll a, ll b, ll p){
ll res = 1;
while(b > 0){
if(b&1) res = (res * a) % p;
a = (a * a) % p;
b >>= 1;
}
return res;
}
ll inv(ll a, ll p){
return fpow(a,p - 2, p);
}
ll nCk(ll n, ll k, ll p){
vector<ll> fn(n + 1);
fn[0] = 1;
for(ll i = 1; i <= n; ++i){
fn[i] = (fn[i - 1] * i) % p;
}
ll aux = (fn[k] * fn[n -k]) % p;
ll pw = fpow(aux, p - 2, p) % p;
ll ok = (pw * fn[n]) % p;
return ok;
}
signed main(){
io();
ll x, y; cin >> x >> y;
if((x + y) % 3){
cout << 0 << '\n';
}else{
ll a = (x + x - y)/3;
ll b = (y + y - x)/3;
if(a < 0 || b < 0){
cout << 0 << '\n';
}else{
cout << nCk(a+b, b, MOD) << '\n';
}
}
return 0;
} | 1 | 77,770,033 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using pii = pair<int, int>;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) {
for (int i = 0; i < n; i++) par[i] = i;
}
int root(int x) {
return par[x] == x ? x : par[x] = root(par[x]);
}
bool same(int x, int y) {
return root(x) == root(y);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return;
par[x] = y;
}
};
int main() {
int n, m;
cin >> n >> m;
vector<int> p(n);
rep(i, n) {
cin >> p[i];
p[i]--;
}
UnionFind u(n);
rep(i, m) {
int x, y;
cin >> x >> y;
x--, y--;
u.unite(x, y);
}
int ans = 0;
rep(i, n) {
if (u.same(i, p[i])) ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int n,m;
cin >> n >> m;
int p[n]={};
for(int i=0;i<n;i++){
cin >> p[i];
p[i]--;
}
vector< vector<int> > op(n);
int x,y;
for(int i=0;i<m;i++){
cin >> x >> y;
x--;y--;
op[x].push_back(y);
op[y].push_back(x);
}
int flag[n] = {};
int groupCount = 1;
int totalCount = 0;
for(int i=0;i<n;i++){
if(flag[i]!=0) continue;
list<int> currentGrp;
map<int, int> currentGrpPMap;
queue<int> q; q.push(i);
flag[i] = groupCount;
while(!q.empty()){
int node = q.front(); q.pop();
currentGrp.push_back(node);
currentGrpPMap[p[node]]++;
for(auto nd:op[node]){
if(flag[nd]==0) q.push(nd);
flag[nd] = groupCount;
}
}
for(auto nd:currentGrp){
if(currentGrpPMap[nd]>0){
totalCount++;
}
}
groupCount++;
}
cout << totalCount << endl;
return 0;
} | 1 | 69,163,989 |
#include<iostream>
using namespace std;
int main(){
int n, x, i, j, k, cnt;
cin>>n>>x;
while(n!=0 || x!=0){
cnt=0;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
for(k=1;k<=n;k++){
if(i!=j && j!=k && i!=k){
if(i+j+k==x){
cnt++;
}
}
}
}
}
cnt /= 6;
cout << cnt << endl;
cin>>n>>x;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int N, X, cnt;
while(true) {
cin >> N >> X;
if(N == 0 && X == 0) break;
cnt = 0;
for(int i=1; i <= N; i++)
for(int j=i+1; j <= N; j++)
for(int k=j+1; k <= N; k++)
if((i + j + k) == X) cnt++;
cout << cnt << endl;
}
return 0;
} | 1 | 83,275,862 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, X, Y;
cin >> N >> K >> X >> Y;
int sum;
if (N<=K) {
sum = X*N;
}
else{
sum = X*K + Y*(N-K);
}
cout << sum <<endl;
} | #include<iostream>
using namespace std;
int main(){
int N , K , X , Y;
cin >> N>>K>>X>>Y;
if( X>Y && X<=10000 && N>=K){
X*=K;
Y=Y*(N-K);
cout<<X+Y<<endl;
}
else if(K>N && X>Y &&( X <=10000)){
K=N;
X*=K;
Y=Y*(N-K);
cout<<X+Y<<endl;
}
} | 1 | 94,557,675 |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep = ""; for(const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void dbg_out() { cerr << "\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
const int mod = 1e9+7;
const int N = 1e3+5;
char grid[N][N];
LL dp[N][N];
void solve(){
int h, w;
cin >> h >> w;
for(int i = 1; i <= h; ++i)
for(int j = 1; j <= w; ++j)
cin >> grid[i][j];
memset(dp, 0, sizeof dp);
dp[1][1] = 1;
for(int i = 1; i <= h; ++i){
for(int j = 1; j <= w; ++j){
if(grid[i][j] == '.'){
dp[i][j] = (dp[i][j] + dp[i-1][j] + dp[i][j-1]) % mod;
}
else{
dp[i][j] = 0;
}
}
}
cout << dp[h][w] << "\n";
}
int main()
{
Fast;
solve();
return 0;
} | #include<bits/stdc++.h>
#define ll long long
ll mod = 1e9+7;
using namespace std;
int main(){
int H,W ;
cin>>H>>W;
char arr[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>arr[i][j];
}
}
ll dp[H][W];
memset(dp, 0, sizeof(dp));
dp[H-1][W-1]=1;
for(int i=W-2;i>=0;i--) {
if(arr[H-1][i]=='.'){
dp[H-1][i]+=dp[H-1][i+1];
}
}
for(int i=H-2;i>=0;i--) {
if(arr[i][W-1]=='.'){
dp[i][W-1]+=dp[i+1][W-1];
}
}
for(int i=H-2;i>=0;i--){
for(int j=W-2;j>=0;j--){
if(arr[i][j]=='.'){
dp[i][j]= (dp[i][j+1]%mod + dp[i+1][j]%mod )%mod;
}
}
}
ll ans= dp[0][0]%mod;
cout<<ans<<endl;
return 0;
} | 1 | 99,321,509 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int result = 4000000;
for (int i = -100; i <= 100; i++) {
int adder = 0;
for (int j = 0; j < N; j++) {
int tmp = (a.at(j) - i) * (a.at(j) - i);
adder += tmp;
}
result = min(adder, result);
}
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 1e9;
for (int i = -100; i < 101; i++) {
int calc = 0;
for (int j : v) {
calc += pow(j - i, 2);
}
if (calc < ans) ans = calc;
}
cout << ans;
} | 1 | 32,871,721 |
#include<iostream>
using namespace std;
int main(){
int n,b,f,r,v,a[4][3][14]={0};
cin>>n;
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
a[b-1][f-1][r-1]=a[b-1][f-1][r-1]+v;
}
for(int k=0;k<4;k++){
for(int j=0;j<3;j++){
for(int s=0;s<10;s++){
cout<<" "<<a[k][j][s];
}
cout<<endl;
}
if(k==0||k==1||k==2){cout<<"####################"<<endl;}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
int b, f, r, v;
int room[4][3][10];
for (int j = 0; j < 4; j++){
for (int k = 0; k < 3; k++){
for (int l = 0; l < 10; l++){
room[j][k][l] = 0;
}
}
}
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> b >> f >> r >> v;
room[b-1][f-1][r-1] += v;
}
for (int j = 0; j < 4; j++){
for (int k = 0; k < 3; k++){
for (int l = 0; l < 10; l++){
cout <<" " << room[j][k][l];
}
cout << endl;
}
if(j != 3){for (int m = 0; m < 20; m++){
cout << "#";
}
cout << endl;}
}
return 0;
} | 1 | 43,394,758 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD = 1000000007;
const double PI = acos(-1);
int main() {
int x, a, b; cin >> x >> a >> b;
if (a >= b) {
cout << "delicious" << endl;
} else if (b - a <= x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using namespace std;
ll n, k;
const ll mod = 1000000007;
int main(){
int x, a, b;
cin >> x >> a >> b;
if(a-b>=0) out("delicious");
else if(a+x+1-b>0) out("safe");
else out("dangerous");
} | 1 | 29,642,582 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll a,b,k;
cin >> a >> b >> k;
if(a>=k){
a-=k;
cout << a << " " << b << endl;
}
else {
k-=a;
a=0;
b-=k;
if(b<0)b=0;
cout << a << " " << b << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll a,b,k;
cin >> a >> b >> k;
if(a >= k){
cout << a-k << " " << b << endl;
return 0;
}
else if((a+b) >= k){
cout << 0 << " " << b - (k - a) << endl;
return 0;
}
else{
cout << 0 << " " << 0 << endl;
return 0;
}
} | 1 | 98,125,763 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
ll GCD(ll a,ll b){
if(b==0) return a;
return GCD(b,a%b);
}
int main() {
int n;
cin>>n;
vector<ll> a(n);
ll lcm,gcd;
rep(i,n){
cin>>a[i];
if(i==0) lcm=a[i];
else{
gcd=GCD(lcm,a[i]);
lcm=(lcm/gcd)*a[i];
}
}
cout<<lcm;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
ll gcd(ll a, ll b){
if(b==0)
return a;
else
return gcd(b, a % b);
}
int main(){
int n;
cin >> n;
ll lcm;
cin >> lcm;
rep(i, n-1){
ll val;
cin >> val;
lcm = lcm / gcd(lcm, val) * val;
}
cout << lcm << endl;
return 0;
} | 1 | 81,691,639 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
const int INF=1e9;
const ll MX = 1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
int main() {
char c;
cin>>c;
printf("%c",(c+1));
} | #include <stdio.h>
int main()
{
char character;
do
{
scanf("%c", &character);
} while (character == 122);
printf("%c", character + 1);
return 0;
} | 1 | 83,773,302 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
int a[100005];
P A[100005];
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
sort(a,a+n);
if(a[n-1] < 0) {
for(int i = 0; i < n - 1; i++) {
A[i] = P(a[n-1],a[i]);
a[n-1] = a[n-1] - a[i];
}
}
else if(a[0] < 0 && a[n-1] >= 0) {
int i = n - 2;
int k = 0;
while(i >= 0 && a[i] >= 0) {
A[k++] = P(a[0],a[i]);
a[0] = a[0] - a[i];
i--;
}
for(int j = 0; j <= i; j++) {
A[k++] = P(a[n-1],a[j]);
a[n-1] = a[n-1] - a[j];
}
}
else {
for(int i = 0; i < n - 2; i++) {
A[i] = P(a[i],a[i+1]);
a[i+1] = a[i] - a[i+1];
}
A[n-2] = P(a[n-1],a[n-2]);
a[n-1] = a[n-1] - a[n-2];
}
cout << a[n-1] << endl;
for(int i = 0; i < n - 1; i++) {
cout << A[i].first <<" "<< A[i].second << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i > 0; --i)
#define srep(i,s,n) for(int i = s; i < (n); ++i)
#define rsrep(i,s,n) for(int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define aall(a) (a), (a)+countof(a)
#define raall(a) (a), (a)+countof(a), greater<>()
#define show(x) cout<<#x<<" = "<<x<<endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) { if (f) puts("YES"); else puts("NO"); }
#define yns(f) { if (f) puts("Yes"); else puts("No"); }
#define show_ary(...) { cout<<#__VA_ARGS__<<" = "; for (const auto& x : (__VA_ARGS__)) { cout<<x<<" "; } cout<<endl; }
#define show_pair(...) cout<<#__VA_ARGS__<<" = "<<endl; for (const auto& x : (__VA_ARGS__)) { cout<<" "<<x.fi<<" : "<<x.se<<endl; }
#define out_ary(...) { int n = (__VA_ARGS__).size(); rep(i, n) printf("%d%s", (__VA_ARGS__)[i], i != n-1 ? " " : "\n"); }
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
ll mx = 0;
vint p, m;
rep(i, n) {
mx += abs(a[i]);
if (a[i] >= 0) p.push_back(a[i]);
else m.push_back(a[i]);
}
sort(rall(p));
sort(all(m));
if (m.empty()) {
m.push_back(p.back());
p.pop_back();
}
if (p.empty()) {
p.push_back(m.back());
m.pop_back();
}
ll sum = m[0];
vll x, y;
rep(i, p.size()-1) {
x.push_back(sum);
y.push_back(p[i]);
sum -= p[i];
}
x.push_back(p.back());
y.push_back(sum);
sum = p.back() - sum;
srep(i, 1, m.size()) {
x.push_back(sum);
y.push_back(m[i]);
sum -= m[i];
}
cout << sum << endl;
rep(i, n-1) {
cout << x[i] << " " << y[i] << endl;
}
return 0;
} | 1 | 57,409,016 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main() {
int n;
cin >> n;
int x = n;
int answer = 0;
for (int d = 2; d * d <= n; d++) {
int cnt = 0;
while(x % d == 0) {
cnt++;
x /= d;
}
int sub = 1;
while(true) {
cnt -= sub;
if(cnt < 0) break;
answer++;
sub++;
}
}
if(x > 1) answer++;
cout << answer << '\n';
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool prime(ll n){
bool x = true;
for(ll k=2;k*k<=n;k++)
if(n%k==0) x = false;
if(n==1) x = false;
return x;
}
int main(){
ll N,i,ans;
ans = 0;
cin >> N;
for(i=2;i*i<=N;i++)
if(N%i==0 && prime(i)){
ll count = 0;
ll a = 0;
while(N%i==0){
N /= i;
count++;
}
for(ll j = 1;j<=100;j++){
a += j;
if(a > count) break;
ans++;
}
}
if(prime(N)) ans++;
cout << ans << endl;
} | 1 | 63,459,270 |
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int main(){
int N,M;cin>>N>>M;
vector<long long>A(N);
for(int i=0;i<N;i++)cin>>A[i];
map<long long,long long>nums;
long long sum=0;
nums[sum]++;
for(int i=0;i<N;i++){
sum+=A[i];
nums[sum%M]++;
}
long long res=0;
for(map<long long, long long>::iterator it=nums.begin();it!=nums.end();it++){
res+=it->second*(it->second-1)/2;
}
cout<<res<<endl;
} | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rrep(i, a, b) for(ll i = a; i >= b; --i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define all(a) a.begin(), a.end()
#define endl '\n'
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int MOD=1e9+7;
const ll INF=1e18;
const double PI=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};
int ddx[5] = {2,1,0,-1,-2};
int ddy[5] = {2,1,0,-1,-2};
const int MAX=510000;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<ll> s(n+1);
rep(i,n) s[i+1] = s[i] + a[i];
map<ll,ll>mp;
rep(i,n+1){
ll x = s[i];
x %= m;
mp[x]++;
}
ll ans = 0;
for(auto p:mp){
ans += p.second*(p.second-1)/2;
}
cout << ans << endl;
return 0;
} | 1 | 55,542,027 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define fi first
#define se second
#define ll long long
#define pll pair<ll,ll>
#define pq priority_queue
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
int main(int argc, const char * argv[]) {
int A;
int B;
int C;
int D;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
if ( A + C <= A + D && A + C <= B + C && A + C <= B + D ) {
cout << A + C << endl;
}
else if ( A + D <= A + C && A + D <= B + C && A + D <= B + D ) {
cout << A + D << endl;
}
else if ( B + C <= A + C && B + C <= A + D && B + C <= B + D ) {
cout << B + C << endl;
}
else {
cout << B + D << endl;
}
return 0;
} | #include<cstdio>
using namespace std;
int main(){
int a,b,c,d;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
int ans = 0;
if (a > b) ans += b;
else ans += a;
if (c > d) ans += d;
else ans += c;
printf("%d\n", ans);
} | 1 | 36,669,579 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(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<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
int main(){
int n,m;
cin>>n>>m;
vector<int>a(m);
rep(i,m)cin>>a[i];
sort(a.rbegin(),a.rend());
vector<int>nd(10);
vector<int>dp(n+1,-1);
vector<int>cnt(n+1);
dp[0]=0;
nd[1]=2;
nd[2]=5;
nd[3]=5;
nd[4]=4;
nd[5]=5;
nd[6]=6;
nd[7]=3;
nd[8]=7;
nd[9]=6;
rep(i,n+1){
rep(j,m){
if(i>=nd[a[j]]&&dp[i-nd[a[j]]]>=0){
dp[i]=max(dp[i],dp[i-nd[a[j]]]+1);
}
}
}
int num=dp[n];
while(num>0){
rep(j,m){
if(n>=nd[a[j]]&&dp[n-nd[a[j]]]+1==dp[n]){
cout<<a[j];
num--;
n-=nd[a[j]];
break;
}
}
}
cout<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:vec) cout<<itr<<' ';
cout<<endl;
}
typedef pair<ll,ll> P;
const ll mod=1e9+7;
const ll inf=1e15;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
cin>>n>>m;
vector<int> a(m);
rep(i,m) cin>>a[i];
sort(begin(a),end(a),greater<ll>());
map<int,int> cnt;
cnt[1]=2,cnt[2]=5,cnt[3]=5,cnt[4]=4;
cnt[5]=5,cnt[6]=6,cnt[7]=3,cnt[8]=7,cnt[9]=6;
vector<int> dp(n+1,-1e9);
dp[0]=0;
FOR(i,1,n+1){
rep(j,m){
if(i-cnt[a[j]]>=0) dp[i]=max(dp[i],dp[i-cnt[a[j]]]+1);
}
}
string ans;
int num=n;
while(num){
rep(i,m){
if(num-cnt[a[i]]>=0 && dp[num-cnt[a[i]]]==dp[num]-1){
ans.push_back((char)a[i]+'0');
num-=cnt[a[i]];
break;
}
}
}
cout<<ans<<endl;
} | 1 | 6,429,019 |
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(0);
int n;
cin>>n;
string a,b;
int x=0,y=0;
while(n--){
cin>>a>>b;
if(a==b){
x++; y++;
}else if(a>b){
x+=3;
}else{
y+=3;
}
}
cout<<x<<" "<<y<<endl;
return 0;
} | #include <iostream>
using namespace std;
#include <stdio.h>
#include <string>
int main(void)
{
string word_T;
string word_H;
int n;
int point_T=0;
int point_H=0;
cin >> n;
for (int i=0; i< n; i++ ){
cin >> word_T >> word_H ;
if( word_T > word_H ){
point_T =point_T + 3 ;
} else if ( word_T < word_H ){
point_H = point_H +3;
}else if( word_T == word_H ){
point_T++ ;
point_H++ ;
} else {
}
}
cout << point_T << " "<< point_H << endl;
return 0;
} | 1 | 94,282,498 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector <ll> primes;
ll divi[1000005];
vector <ll> fact;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i,j,k,l,m,n,t;
cin >> n;
if(n == 1)
{
cout << 0 << '\n';
return 0;
}
for(i=2;i<1000005;i++)
{
for(j=i+i;j<1000005;j+=i)
{
divi[j] = -1;
}
}
for(i=2;i<1000005;i++)
{
if(divi[i] != -1)
primes.push_back(i);
}
for(i=0;i<primes.size();i++)
{
if(n%primes[i] == 0)
{
l = 0;
while(n%primes[i] == 0)
{
n = n/primes[i];
l++;
}
fact.push_back(l);
}
}
if(n > 1)
fact.push_back(1);
ll ans = 0;
for(i=0;i<fact.size();i++)
{
l = 0;
k = 1;
while(fact[i] >= l)
{
l += k;
k++;
if(fact[i] >= l)
ans++;
else
break;
}
}
cout << ans << '\n';
} | #include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
int main() {
int64_t n; cin >> n;
vector<int> pf;
for (int64_t i = 2; i * i <= n; ++i) {
if (n % i) continue;
int cnt = 0;
while (n % i == 0) {
++cnt;
n /= i;
}
pf.push_back(cnt);
}
if (n != 1) {
pf.push_back(1);
}
int ans = 0;
for (auto e : pf) {
for (int i = 1; i <= e; ++i) {
e -= i;
++ans;
}
}
cout << ans << endl;
} | 1 | 98,081,646 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#define FASTREAD ios_base::sync_with_stdio(0);cin.tie(nullptr);
#define ll long long
#define dd double
#define scl(n) scanf("%lld",&n)
#define scd(n) scanf("%lf",&n)
#define scc(n) scanf("%c",&n)
#define scs(n) scanf("%s",&n)
#define ptl(n) printf("%lld",n)
#define ptd(n) printf("%f",n)
#define ptc(n) printf("%c",n)
#define pts(n) printf("%s",n)
#define nline printf("\n")
#define pb push_back
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORr(i,a,b) for(ll i=a;i>=b;i--)
#define pi 2*acos(0.0)
#define pii pair<ll,ll>
#define uu first
#define vv second
using namespace std;
int main()
{
ll n,h[100150],dp[100150],k;
scl(n);
scl(k);
FOR(i,1,n)
{
scl(h[i]);
}
FOR(i,n+1,n+k)
{
h[i]=999999999;
dp[i]=999999999;
}
dp[n]=0;
FORr(i,n-1,1)
{
dp[i]=9999999999;
FOR(j,1,k)
{
dp[i]=min(dp[i],dp[i+j]+abs(h[i]-h[i+j]));
}
}
ptl(dp[1]);
nline;
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
#define inf 999999999
using namespace std;
int num;
int main()
{
int a,b;
int temp;
vector<int> cost(1e5+1);
vector<int> dp(1e5+1);
while(cin>>a>>b){
fill(cost.begin(),cost.end(),0);
fill(dp.begin(),dp.end(),inf);
for(int i=0;i<a;i++){
cin>>cost[i];
}
dp[0]=0;
dp[1]=abs(cost[1]-cost[0]);
for(int i=1;i<a;i++){
for(int j=1;j<=i && j<=b;j++){
dp[i]=min(dp[i],dp[i-j]+abs(cost[i-j]-cost[i]));
}
}
cout<<dp[a-1]<<endl;
}
} | 1 | 37,161,738 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;
template <class T, class U>
using umap = unordered_map<T, U>;
using umii = umap<int, int>;
using seti = set<int>;
template <class T>
using uset = unordered_set<T>;
using useti = uset<int>;
template <class T>
using less_queue = priority_queue<T>;
template <class T>
using greater_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr int INF = 1e18;
template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };
template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
int c = v.size() - 1;
for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
if (c > -1) cout << v[c];
cout << endl;
}
template <class T>
bool amin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ceil_div(int x, int y) { return (x - 1) / y + 1; }
#pragma endregion header
void solve(int a, int b, int c) {
vi v = {a, b, c};
for(int i = 0;;i++) {
if(v[0] == v[1] && v[1] == v[2]) {
COUT(i);
return;
}
SORT(v);
if(v[0] < v[1])v[0] += 2;
else {
v[0]++;
v[1]++;
}
}
}
#pragma region main
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(15);
int a;
cin >> a;
int b;
cin >> b;
int c;
cin >> c;
solve(a, b, c);
}
#pragma endregion main | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=2e5+10;
int a[8005];
int dp[8005][8005];
int sum[8005];
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a>b){
swap(a,b);
}
if(a>c){
swap(a,c);
}
if(b>c){
swap(b,c);
}
int x=(c-b);
int y=(c-(a+x));
if(y%2){
printf("%d\n",x+y/2+2);
}
else{
printf("%d\n",x+y/2);
}
return 0;
} | 1 | 95,724,138 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
int main()
{
int n,m;
cin>>n>>m;
if(n%2){
for(int i=1;i<=m;i++){
cout<<i<<" "<<n-i<<endl;
}
}
else{
int r=n;
for(int i=1;i<=m;i++){
if(i==n/4+1){
r--;
}
cout<<i<<" "<<r<<endl;
r--;
}
}
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> used(N);
vector<pair<int, int>> arenas;
for (int i = 0; i < M; i++) {
int left = i + 1;
int right = N - i;
if (N % 2 == 0 && left * 2 * 2 > N) {
left++;
}
arenas.push_back(make_pair(left, right));
}
for (int i = 0; i < M; i++) {
int left = arenas[i].first;
int right = arenas[i].second;
printf("%d %d\n", left, right);
}
return 0;
} | 1 | 99,696,077 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<map>
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int main() {
int N, M, K;
cin >> N >> M >> K;
rep(x, 0, N + 1) {
rep(y, 0, M + 1) {
if (x * y + (N - x) * (M - y) == K) {
puts("Yes");
return 0;
}
}
}
puts("No");
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, m, k;
cin >> n >> m >> k;
exrep(i, 0, n) {
exrep(j, 0, m) {
if(i*j + (n-i)*(m-j) == k) {
out("Yes");
re0;
}
}
}
out("No");
re0;
} | 1 | 8,272,407 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int N;
cin >> N;
if(N<1200) cout<<"ABC"<<endl;
else cout<<"ARC"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int x;
cin >> x;
if(x < 1200){
cout << "ABC" << endl;
}else{
cout << "ARC" << endl;
}
return 0;
} | 1 | 88,369,692 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a>b){
int tmp = a;
a = b;
b = tmp;
}
if(b>c){
int tmp = b;
b = c;
c = tmp;
}
if(a>b){
int tmp = a;
a = b;
b = tmp;
}
cout << a << ' ' << b << ' ' << c << '\n';
return 0;
} | #include <iostream>
int main(){
int data[3];
int tmp;
std::cin >> data[0] >> data[1] >> data[2];
for (int i = 0; i < 3; i++){
for (int j = 2; j > 0 + i; j--){
if (data[j] < data[j - 1]){
tmp = data[j];
data[j] = data[j - 1];
data[j - 1] = tmp;
}
}
}
std::cout << data[0] << " " << data[1] << " " << data[2] << "\n";
return 0;
} | 1 | 68,742,075 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
const ll nmax = 1e9 + 7;
const ll Mod = 998244353;
const double PI = 2 * asin(1);
int main(){
int N, K; cin >> N >> K;
ll X[N], Y[N];
for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];
ll ans = 4e18;
for (int i1 = 0; i1 < N; i1++){
for (int i2 = 0; i2 < N; i2++){
for (int i3 = 0; i3 < N; i3++){
for (int i4 = 0; i4 < N; i4++){
ll x1 = min(min(X[i1], X[i2]), min(X[i3], X[i4]));
ll x2 = max(max(X[i1], X[i2]), max(X[i3], X[i4]));
ll y1 = min(min(Y[i1], Y[i2]), min(Y[i3], Y[i4]));
ll y2 = max(max(Y[i1], Y[i2]), max(Y[i3], Y[i4]));
int cnt = 0;
for (int i = 0; i < N; i++){
if (x1 <= X[i] && X[i] <= x2 && y1 <= Y[i] && Y[i] <= y2) cnt++;
}
if (cnt >= K){
ans = min(ans, (x2 - x1) * (y2 - y1));
}
}
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
ll gcd(ll a, ll b) {
if (b == 0) { return a; }
if (a < b) { return gcd(b, a); }
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
struct edge {
ll ind;
ll to;
ll d;
};
int main() {
ll K, N;
cin >> N >> K;
vector<ll> x(N + 1), y(N + 1);
repn(i, N) cin >> x[i] >> y[i];
ll ans = 5e18;
repn(d, N)repn(u, N)repn(l, N)repn(r, N) {
if (x[r] < x[l] || y[u] < y[d]) { continue; }
ll cnt = 0;
repn(i, N) {
if (x[l] <= x[i] && x[i] <= x[r] && y[d] <= y[i] && y[i] <= y[u]) { cnt++; }
}
if (cnt >= K) { ans = min(ans, (x[r] - x[l])*(y[u] - y[d])); }
}
cout << ans;
system("PAUSE");
} | 1 | 56,581,038 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
int main() {
int a,b;
scanf("%d%d",&a,&b);
int h = 100;
cout << h << ' ' << h << endl;
int dp[100][100];
rep(i,100){
rep(j,100){
if(j<50){
dp[i][j]=0;
}else{
dp[i][j]=1;
}
}
}
int countb = 0;
int counta = 0;
rep(i,b-1){
int tate = countb / 100;
int yoko = countb % 100;
dp[yoko][tate*2] = 1;
countb += 2;
}
rep(i,a-1){
int tate = counta / 100;
int yoko = counta % 100;
dp[yoko][60+tate*2] = 0;
counta += 2;
}
rep(i,100){
rep(j,100){
if(dp[i][j]==0){
cout << '.';
}else{
cout << '#';
}
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
int nextInt() { int x; scanf("%d", &x); return x;}
ll nextLong() { ll x; scanf("%lld", &x); return x;}
char t[105][105];
int main2() {
int A = nextInt();
int B = nextInt();
int N = 100;
REP(i, N) REP(j, N) {
if (i < N / 2)
t[i][j] = '.';
else
t[i][j] = '#';
}
int a = 0, b = 0;
for (int i = 0; i < N/2; i+=2) {
for (int j = 0; j < N; j += 2) {
if (b < B-1) {
t[i][j] = '#';
b++;
}
}
}
for (int i = N/2 + 1; i < N; i +=2) {
for (int j = 0; j < N; j += 2) {
if (a < A-1) {
t[i][j] = '.';
a++;
}
}
}
cout << N << " " << N << endl;
REP(i, N) {
REP(j, N) cout << t[i][j];
cout << endl;
}
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
} | 1 | 10,125,175 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int k =n*n;
cout<<k<<endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main()
{
int64 rr;
cin >> rr;
cout << rr * rr << endl;
return 0;
} | 1 | 26,346,913 |
#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,K;
cin >> N >> K;
cout << N-(K-1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, count = 0;
cin >> N >> K;
for (int i=0; i<N-K+1; i++)
count++;
cout << count << endl;
} | 1 | 82,554,042 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
int main() {
ll N;
cin >> N;
vi X(N), Y(N);
for (ll i = 0; i < N; i++) cin >> X[i] >> Y[i];
for (ll i = 0; i < N - 1; i++) {
if ((X[i] + Y[i] + X[i + 1] + Y[i + 1]) % 2 != 0) {
cout << -1 << endl;
return 0;
}
}
bool flag = false;
if ((X[0] + Y[0]) % 2 == 0) {
flag = true;
}
ll m = 31;
if (flag) {
cout << m + 1 << endl;
cout << 1;
for (ll i = 0; i < m; i++) {
cout << ' ' << (1ll << i);
}
cout << endl;
for (ll i = 0; i < N; i++) {
X[i] -= 1;
}
} else {
cout << m << endl;
for (ll i = 0; i < m; i++) {
if (i > 0) {
cout << ' ';
}
cout << (1ll << i);
}
cout << endl;
}
for (ll i = 0; i < N; i++) {
ll x = X[i], y = Y[i];
ll u = x + y, v = x - y;
vi v1(m, 1), v2(m, 1);
{
ll k = (1ll << m) - 1 - u;
for (ll j = m - 1; j >= 0; j--) {
if (k >= (1ll << j) * 2) {
k -= (1ll << j) * 2;
v1[j] = -1;
}
}
}
{
ll k = (1ll << m) - 1 - v;
for (ll j = m - 1; j >= 0; j--) {
if (k >= (1ll << j) * 2) {
k -= (1ll << j) * 2;
v2[j] = -1;
}
}
}
string s;
if (flag) {
s += 'R';
}
for (ll j = 0; j < m; j++) {
if (v1[j] == 1) {
if (v2[j] == 1) {
s += 'R';
} else {
s += 'U';
}
} else {
if (v2[j] == 1) {
s += 'D';
} else {
s += 'L';
}
}
}
cout << s << endl;
}
} | #include<bits/stdc++.h>
#include<bits/extc++.h>
#define file(s) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define go(x, i) for(register int i = head[x]; i; i = nxt[i])
#define For(i, a, b) for(register int i = (a), i##_end_ = (b); i <= i##_end_; ++ i)
#define FOR(i, a, b) for(register int i = (a), i##_end_ = (b); i >= i##_end_; -- i)
#define debug(x) cout << #x << " = " << x << endl
#define mem(a, b) memset(a, b, sizeof(a))
#define cpy(a, b) memcpy(a, b, sizeof(a))
#define min(a, b) (a < b ? a : b)
#define max(a, b) (b < a ? a : b)
#define inf (0x3f3f3f3f)
#define INF (1e18)
#define pb push_back
#define mp make_pair
#define x first
#define y second
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long long ll;
typedef std::pair<ll, int> PLI;
typedef std::pair<int, int> PII;
typedef long double ldb;
typedef double db;
using namespace std;
const int N = 1e3 + 10;
int n, m, d[N];
struct Point {
int x, y;
}A[N];
void Solve(int x, int y) {
FOR(i, 30, 0) {
int now = 1 << i;
if(abs(x) >= now) {
if(x > 0) x -= now, putchar('R');
else x += now, putchar('L');
}
else if(abs(y) >= now) {
if(y > 0) y -= now, putchar('U');
else y += now, putchar('D');
}
else {
if(abs(x) > abs(y)) {
if(x < 0) x += now, putchar('L');
else x -= now, putchar('R');
}
else {
if(y < 0) y += now, putchar('D');
else y -= now, putchar('U');
}
}
}
if(x != 0 || y != 0) puts("fuck");
}
int main() {
#ifdef ylsakioi
file("d");
#endif
cin >> n; For(i, 1, n) cin >> A[i].x >> A[i].y;
int flag = abs(A[1].x + A[1].y) & 1;
For(i, 2, n) if((abs(A[i].x + A[i].y) & 1) ^ flag) return puts("-1"), 0;
cout << (32 - flag) << endl;
FOR(i, 30, 0) cout << (1 << i) << ' ';
puts(flag ? "" : "1");
if(!flag) For(i, 1, n) ++ A[i].y;
For(i, 1, n) {
Solve(A[i].x, A[i].y);
puts(flag ? "" : "D");
}
return 0;
} | 1 | 64,540,023 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<string> &o) {
string a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
typedef pair<ll, ll> P;
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
int n;
cin >> n;
vector<int> numbers(n);
rep(i, n) cin >> numbers[i];
int ma = *max_element(numbers.begin(), numbers.end());
multiset<int> ps;
for (int i : numbers) ps.insert(i);
rep(i, ma + 1) {
int j = max(i, ma - i);
auto it = ps.find(j);
if (it == ps.end()) {
cout << "Impossible" << endl;
ret();
}
ps.erase(it);
}
for (int i : ps) {
int b = ma % 2 == 0 ? ma / 2 + 1 : (ma + 1) / 2 + 1;
if (i >= b) continue;
cout << "Impossible" << endl;
ret();
}
cout << "Possible" << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#include <cstring>
#include <random>
using namespace std;
#define int long long
#define ld long double
#define ull unsigned long long
#define endl '\n'
#define try tr
#define pii pair<int, int>
#define ti tuple <int, int, int>
#define vi vector <int>
#define vpi vector <pii>
#define umap unordered_map
#define uset unordered_set
#define left left11
#define right right11
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define sqr(a) ((a) * (a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define X first
#define Y second
ld TL = 1.0;
bool is_tl = 0;
int CALLS = 0;
inline bool IS() {
if (++CALLS == 1000) {
CALLS = 0;
is_tl |= clock() > (TL - 0.1) * CLOCKS_PER_SEC;
}
return is_tl;
}
template<typename T1, typename T2>
inline void amin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2>
inline void amax(T1 &a, T2 b) { if (a < b) a = b; }
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << ' ' << p.second << endl;
return os;
}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &u : v) os << u << ' ';
os << endl;
return os;
}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e6 + 7, NS = 2e3 + 7, lg = 19, sq = 550, inf = 2e9 + 7, SM = 1e2 + 7;
const ld eps = 1e-9;
int hash_mod[4] = {1000000007, 998244353, 1000000009, 999999937}, mod = hash_mod[rnd() % 4];
int hash_pows[4] = {179, 239, 1007, 2003}, P = hash_pows[rnd() % 4];
void solve() {
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
multiset <int> s(all(a));
int mx = *(--s.end());
for (int i = mx; i >= (mx + 1) / 2; i--) {
if(s.find(i) == s.end()) {
cout << "Impossible\n";
return;
}
s.erase(s.find(i));
if(mx % 2 != 0 || i != (mx + 1) / 2) {
if(s.find(i) == s.end()) {
cout << "Impossible\n";
return;
}
s.erase(s.find(i));
}
}
for (auto u : s) {
if(u <= mx && u > (mx + 1) / 2) {
continue;
}
cout << "Impossible\n";
return;
}
cout << "Possible";
}
signed main() {
fast
solve();
} | 1 | 80,526,189 |
#include<stdio.h>
int main(void){
int A,B,C;
scanf("%d%d%d",&A,&B,&C);
if(A==B && B==C){
printf("Yes");
}
else{
printf("No");
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int A,B,C;
cin >> A >> B >> C;
if(A == B && B== C){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
return 0;
} | 1 | 22,966,126 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define fi first
#define se second
#define debug(x) cout << #x << ": " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
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; }
template<class T> void Print(vector<T> v) {
F0R(i, v.size()) {
cout << v[i] << ' ';
}
cout << newl;
}
#if 1
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, M;
cin >> N >> M;
map<int, vector<int>> bs;
F0R(i, N) {
int a, b;
cin >> a >> b;
bs[a].push_back(b);
}
priority_queue<int, vector<int>, less<int>> qu;
i64 result = 0;
F0R(i, M) {
for (auto e : bs[i + 1]) {
qu.push(e);
}
if (qu.size()) {
result += qu.top();
qu.pop();
}
}
cout << result;
}
#endif | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(x) (x).begin(),(x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
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(){
int n,m;cin>>n>>m;
vii a(n);
rep(i,n){
cin>>a[i].F>>a[i].S;
}
sort(all(a));
deque<int>A,B;
rep(i,n){
A.PB(a[i].F);
B.PB(a[i].S);
}
rep(i,n){
}
priority_queue<int>q;
int d=1;
ll ans=0;
while(d<=m){
int x=A.front();
while(x==d&&!A.empty()){
A.pop_front();
int y=B.front();
B.pop_front();
q.push(y);
x=A.front();
}
if(!q.empty()){
int v=q.top();
q.pop();
ans+=v;}
d++;
}
cout<<ans<<endl;
} | 1 | 42,732,532 |
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
string s;
string p;
cin>>s;
cin>>p;
s+=s;
int loc=s.find(p,0);
if(loc!=string::npos)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <string>
int main(int argc, char** argv)
{
std::string s;
std::getline(std::cin, s);
std::string p;
std::getline(std::cin, p);
for (int si = 0; si < (int)s.size(); ++si)
{
if (s[si] == p[0])
{
bool match = true;
for (int pi = 0; pi < (int)p.size() && match; ++pi)
{
match = (s[(si + pi) % (int)s.size()] == p[pi]);
}
if (match)
{
std::cout << "Yes" << std::endl;
return 0;
}
}
}
std::cout << "No" << std::endl;
return 0;
} | 1 | 25,165,667 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define DB(a) cerr << #a << " = " << (a) << endl;
#define OUT( a , n ) for( int J = 0; J < (n); J++ )cout<< (a)[J] << " \n"[J == (n) - 1 ]
#define WAIT cout << flush , system("PAUSE");
#define lowbit(x) ((x) & (-x))
#define CONTAINS(a, x) ((a).find(x) != (a).end())
#define endl '\n'
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repi(i,0,n)
typedef long long ll;
const int N = 1e6+100;
int n , k , p;
char s[15];
char ans[15];
bool test(){
printf("? %s\n",s); fflush(stdout);
scanf("%s", ans);
return ans[0] == 'Y';
}
bool is_pow_10(ll x){
while(x > 1){
if(x % 10)return false;
x /= 10;
}
return true;
}
bool checkend(int pos){
long long num = 0;
for( int i = 0; i <= pos; ++i){
num = num * 10 + s[i] - '0';
}
int last_dig = num % 10;
if(last_dig == 9){
long long other = num + 1;
printf("? %lld\n",other); fflush(stdout);
scanf("%s", ans);
if(is_pow_10(other)){
return ans[0] == 'N';
}
else{
return ans[0] == 'Y';
}
}
else{
num++;
printf("? %lld\n",num); fflush(stdout);
scanf("%s", ans);
return ans[0] == 'Y';
}
}
int main()
{
ios::sync_with_stdio( 0 );
cin.tie( 0 );
for( int i = 0; i < 14; i++ ){
s[i] = '9';
}
for( int i = 0; i < 11; i++ ){
s[i] = '1';
int lo = i == 0 ? 1 : 0;
int hi = 9;
while(lo < hi){
int mid = (lo + hi) / 2;
s[i] = '0' + mid;
if(test()){
hi = mid;
}
else lo = mid + 1;
}
s[i] = '0' + lo;
if(checkend(i)){
s[i + 1] = 0;
printf("! %s\n",s); fflush(stdout);
exit(0);
}
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
char s[10];
void query(ll x)
{
printf("? %lld\n",x);
fflush(stdout);
scanf("%s",s);
}
int main()
{
int x=1000000000;
query(x);
if(s[0]=='Y')
{
for(int i=9;i>=1;i--)
{
query(x-1);
if(s[0]=='N') break;
x/=10;
}
printf("! %d\n",x);
return 0;
}
for(int i=9;i>=1;i--)
{
x/=10;
query(x);
if(s[0]=='Y') break;
}
int l=x+1,r=x*10-1,ans;
while(l<=r)
{
ll mid=((l+r)>>1);
query(mid*10);
if(s[0]=='Y') r=mid-1,ans=mid;
else l=mid+1;
}
printf("! %d\n",ans);
return 0;
} | 1 | 35,302,882 |
#include<bits/stdc++.h>
using namespace std;
long long max_(long long a,long long b)
{
if(b>a)
return b;
else
return a;
}
int main()
{
long long a,b,c,d;
cin>>a>>b>>c>>d;
long long a1=a*c,a2=a*d,a3=b*c,a4=b*d;
long long ans=max_(a1,max_(a2,max_(a3,a4)));
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define foi(i,k,n) for(int i=(k); i<(int)(n); i+=1)
#define fod(i,n,k) for(int i=k; i>=(int)n; i-=1)
#define fast_io ios_base::sync_with_stdio(false) , cin.tie(NULL);
#define all(x) x.begin(), x.end()
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define endl "\n"
#define int long long
#define INF 0x3f3f3f3f
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define fir first
#define sec second
#define pb push_back
#define mp make_pair
typedef long long llint;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<llint> VL;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int,int> MII;
typedef set<int> SI;
string tostr(int n) {stringstream rr;rr<<n;return rr.str();}
llint toint(string s) {stringstream ss(s); llint x; ss >> x; return x;}
void solve(){
int a, b, c, d;
cin >> a >> b >> c >> d;
auto v = {a * c, b * c, a * d, b * d};
cout << *max_element(all(v));
}
int32_t main() {
fast_io;
int t = 1;
while(t--) {
solve();
}
return 0;
} | 1 | 35,580,406 |
#pragma GCC optimize(3)
#pragma comment(linker,"/stack:16777216")
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<functional>
#include<utility>
#include<algorithm>
#include<sstream>
#include<cstring>
#include<cmath>
#include<cctype>
#include<exception>
#include<climits>
#include<cfloat>
#include<iomanip>
#include<bitset>
#include<streambuf>
#include<cstdlib>
#include<ctime>
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define np next_permutation
#define fi first
#define sc second
#define vi vector<int>
#define vll vector<long long>
#define vvi vector<vector<int> >
#define vpi vector<pair<int,int> >
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pff pair<float,float>
#define pdd pair<double,double>
#define psi pair<string,int>
#define pis pair<int,string>
#define ppi pair<pii,int>
#define pdi pair<pii,pii>
#define LN 84757
#define INF 1e9
#define LLINF 1e18
#define MAXINT 0x7fffffff
#define MAXLL 0x7fffffffffffffff
#define EPS 1e-5
#define DEPS 1e-9
#define LDEPS 1e-13
#define MOD 1000000007
#define E 2.7182818284
#define PI 3.1415926535
#define rep(a,b) for(int a=0;a<b;a++)
#define forn(a,n) for(int a=1;a<=n;a++)
#define forr(a,n) for(int a=n;a>=0;a--)
#define repn(a,n,p) for(int a=0;a<n;a+=p)
#define foreach(a,b) for(__typeof(b.begin())a=b.begin();a!=b.end();a++)
#define fillemp(a) memset(a,0,sizeof(a))
#define fillinf(a) memset(a,0x3f,sizeof(a))
#define frestream freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define stdf(a,b) freopen(a,"r",stdin);freopen(b,"w",stdout);
#define inputf(a) freopen(a,"r",stdin);
#define outputf(a) freopen(a,"w",stdout);
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
using namespace std;
#define int long long
int n,m,v,p;
int a[100010];
bool check(int pos){
int tot=m*(n-v);
if(pos<p)return 1;
int sub=0;
for(int i=p-1;i<pos;i++){
sub+=(a[i]-a[pos]);
if(a[i]-a[pos]>m)return 0;
}
if(sub<=tot)return 1;
else return 0;
}
signed main(){
cin>>n>>m>>v>>p;
rep(i,n){
cin>>a[i];
a[i]+=m;
}
sort(a,a+n);
reverse(a,a+n);
int l=0,r=n-1,mid=0,ans=0;
rep(i,30){
mid=(l+r)/2;
if(check(mid)){
ans=mid;
l=mid+1;
}
else{
r=mid-1;
}
}
cout<<ans+1;
return 0;
} | #include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int MN = 1e5 + 1;
int N, M, V, P;
int A[MN], B[MN];
bool check(int p) {
for(int i = 0; i < N; i++) B[i] = A[i];
ll total_points = (ll)M * V;
auto give = [&](int i, int amount) {
ll v = min(total_points, (ll)min(amount, M - (B[i] - A[i])));
B[i] += v;
total_points -= v;
};
give(p, M);
int free = P - 1;
for(int i = N-1; i >= 0 && free > 0; i--) {
if(i == p) continue;
give(i, M);
free--;
}
for (int i = 0; i < N; i++) {
if (i == p) continue;
give(i, max(0, B[p] - B[i]));
}
if (total_points > 0) return false;
int larger_count = 0;
for(int i = 0; i < N; i++) {
if (B[i] > B[p]) larger_count++;
}
return larger_count < P;
}
int main() {
scanf("%d%d%d%d", &N, &M, &V, &P);
for(int i = 0; i < N; i++) scanf("%d", &A[i]);
sort(A, A+N);
int left = 0, right = N-1, mid, ans;
while(left <= right) {
mid = (left + right) / 2;
if (check(mid)) {
ans = mid;
right = mid - 1;
}
else {
left = mid + 1;
}
}
printf("%d\n", N - ans);
return 0;
} | 1 | 91,575,294 |
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
int main(){
int n;
cin >> n;
map<int, int> m;
m[n]++;
int count=1;
while(1){
if(n&1){
n = (3*n)+1;
}
else{
n = n/2;
}
m[n]++;
count++;
if(m[n] == 2){
cout << count;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
int m = 0;
vector<int> a;
a.push_back(s);
for (int i=1 ; ; i++){
if (a.at(a.size()-1)%2 == 0)
a.push_back(a.at(a.size()-1)/2);
else
a.push_back(3*a.at(a.size()-1) + 1);
for (int j=0 ; j<a.size()-1 ; j++){
if (a.at(a.size()-1) == a.at(j)){
m = i+1;
break;
}
}
if (m != 0)
break;
}
cout << m << endl;
} | 1 | 20,430,140 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll MOD = 1000000007;
int N, M;
cin >> N >> M;
vector<ll> s(N);
vector<ll> t(M);
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < M; i++)
cin >> t[i];
vector<vector<ll>> dp(N+1, vector<ll>(M+1, 0));
vector<vector<ll>> sum_dp(N+1, vector<ll>(M+1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
if (s[i-1] == t[j-1]) {
dp[i][j] = (sum_dp[i-1][j-1]+1) % MOD;
sum_dp[i][j] = ((sum_dp[i][j-1]-sum_dp[i-1][j-1]+sum_dp[i-1][j])%MOD+dp[i][j])%MOD;
}
else {
dp[i][j] = 0;
sum_dp[i][j] = (sum_dp[i][j-1]-sum_dp[i-1][j-1]+sum_dp[i-1][j])%MOD;
}
}
}
ll ans = 0;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
ans = (ans + dp[i][j]) % MOD;
if ((ans+1)%MOD >= 0)
cout << (ans+1)%MOD << endl;
else
cout << (ans+1)%MOD + MOD << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
int main() {
int n, m;
cin >> n >> m;
ll s[n], t[m];
rep(i, n) { cin >> s[i]; }
rep(j, m) { cin >> t[j]; }
ll dp[n + 1][m + 1];
rep(i, n + 1) { dp[i][0] = 1; }
for (int i = 0; i <= m; i++) {
dp[0][i] = 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % mod;
} else {
dp[i + 1][j + 1] =
(dp[i + 1][j] + dp[i][j + 1] - dp[i][j] + mod) % mod;
}
}
}
cout << dp[n][m] << endl;
} | 1 | 72,436,996 |
#include <iostream>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
typedef pair<int,int> pint;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
string mp[1000];
int visit[1000][1000];
int main(){
int h,w,n,cx,cy,ans=0;
cin>>h>>w>>n;
for(int i=0;i<h;++i){
cin>>mp[i];
if(mp[i].find('S')!=string::npos){
cy=i;cx=mp[i].find('S');
}
}
for(int i=1;i<=n;++i){
memset(visit,0,sizeof(visit));
visit[cy][cx]=1;
queue<pint> q;
q.push(make_pair(cx,cy));
while(!q.empty()){
pint pi=q.front();q.pop();
cx=pi.first;cy=pi.second;
int vc=visit[cy][cx];
if(mp[cy][cx]==i+'0'){
ans+=vc-1;break;
}
for(int j=0;j<4;++j){
int tx=cx+dx[j];int ty=cy+dy[j];
if(tx>=0&&ty>=0&&tx<w&&ty<h&&visit[ty][tx]==0&&mp[ty][tx]!='X'){
q.push(make_pair(tx,ty));
visit[ty][tx]=vc+1;
}
}
}
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <string.h>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
struct node
{
int x;
int y;
int dist;
node(int x , int y , int dist)
{
this -> x = x;
this -> y = y;
this -> dist = dist;
}
};
bool vis[1010][1010];
char input[1010][1010];
int dx[4] = {- 1 , 0 , 1 , 0};
int dy[4] = {0 , 1 , 0 , - 1};
queue<node> q;
bool inArea(int x , int y , int n , int m)
{
return x >= 0 && x < n && y >= 0 && y < m;
}
int solve(int sx , int sy , int h , int w , int n)
{
while (!q.empty())
q.pop();
int value = 1;
q.push(node(sx , sy , 0));
vis[sx][sy] = true;
while (!q.empty())
{
node no = q.front();
q.pop();
if (input[no.x][no.y] >= '0' && input[no.x][no.y] <= '9' && ((input[no.x][no.y] - '0') == value))
{
value ++;
if (value == n + 1)
return no.dist;
while (!q.empty())
q.pop();
for (int i = 0;i < h;i ++)
for (int j = 0;j < w;j ++)
vis[i][j] = false;
vis[no.x][no.y] = true;
}
for (int i = 0;i < 4;i ++)
{
int tx = no.x + dx[i];
int ty = no.y + dy[i];
if (inArea(tx , ty , h , w) && !vis[tx][ty] && input[tx][ty] != 'X')
{
vis[tx][ty] = true;
q.push(node(tx , ty , no.dist + 1));
}
}
}
return - 1;
}
int main()
{
int i , j , h , w , n;
while (scanf("%d%d%d" , &h , &w , &n) != EOF)
{
for (i = 0;i < h;i ++)
for (j = 0;j < w;j ++)
vis[i][j] = false;
int sx , sy;
for (i = 0;i < h;i ++)
{
scanf("%s" , input[i]);
for (j = 0;j < w;j ++)
{
if (input[i][j] == 'S')
{
sx = i;
sy = j;
}
}
}
printf("%d\n" , solve(sx , sy , h , w , n));
}
return 0;
} | 1 | 60,617,469 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,A,B; cin>>N>>A>>B;
if((N==1&&A!=B)||A>B){cout<<0<<endl; return 0;}
if(N==1){cout<<1<<endl; return 0;}
cout<<B*(N-1)+A-A*(N-1)-B+1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
ll n, a, b;
cin >> n >> a >> b;
if (a > b) {
cout << 0 << endl;
return 0;
}
if (a != b && n == 1) {
cout << 0 << endl;
return 0;
}
ll min = b + a * (n - 1);
ll max = a + b * (n - 1);
ll ans = max - min + 1;
cout << ans << endl;
} | 1 | 10,456,970 |