code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <iostream>
using namespace std;
int a[5000], b[5000], c[5000];
int main(){
int n;
while(cin >> n && n){
for(int i = 0; i < n; i++){
cin >> a[i];
}
if(n == 1){
cout << a[0] << endl;
}else{
b[0] = a[0];
for(int i = 1; i < n; i++){
b[i] = b[i-1] + a[i];
}
c[0] = b[0];
for(int i = 1; i < n; i++){
c[i] = min(c[i-1], b[i]);
}
int ans = a[0];
for(int i = 1; i < n; i++){
ans = max(ans, b[i] - c[i-1]);
ans = max(ans, b[i]);
}
cout << ans << endl;
}
}
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
int main(){
ll N;
string S;
cin >> N;
cin >> S;
ll ans = 0;
char lastChar = 'A';
rep(i, N){
if(S[i] != lastChar){
ans++;
}
lastChar = S[i];
}
cout << ans << endl;
return 0;
}
| 0 | 45,966,003 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
ll cnt = 0;
for(int i = 1; i <= n; i++) {
string s= to_string(i);
if(s.length() & 1 )
cnt++;
}
cout << cnt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) swap(&a,&b);
if(b<1) return -1;
if(a%b==0) return b;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a * b / gcd(a,b);
}
int main(){
int numQ;
std::cin>>numQ;
std::vector<int> d(numQ);
for(int i=0;i<numQ;i++) std::cin>>d[i];
std::sort(d.begin(),d.end());
int ans = d[numQ/2]-d[(numQ/2)-1];
std::cout<<ans<<std::endl;
return 0;
}
| 0 | 47,125,006 |
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int i=0, j, ar[11];
while( scanf("%d" , &j)!= EOF){
if(j!=0) ar[++i]=j;
else printf("%d\n",ar[i--]);
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
int N, K;
ll a[5001];
ll asum;
bool dp[5001];
bool isNoNeed(int x) {
if (asum < K) {
return true;
}
fill(dp, dp + K, false);
dp[0] = true;
if (K - a[x] <= 0) {
return false;
}
for (int i = 0; i < N; i++) {
if (i == x) continue;
for (int j = K - 1; j >= a[i]; j--) {
dp[j] = dp[j] || dp[j - a[i]];
if (dp[j] && K - a[x] <= j) {
return false;
}
}
}
return true;
}
int main() {
cin >> N >> K;
asum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
asum += a[i];
}
sort(a, a + N);
int L = -1;
int R = N;
while (R - L > 1) {
int M = (L + R) / 2;
if (isNoNeed(M)) {
L = M;
} else {
R = M;
}
}
cout << L + 1 << endl;
return 0;
}
| 0 | 82,420,542 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define lrep(i,n,m) for(int i = n; i < m; i++)
using ll = long long;
using ld = long double;
using Vii = vector<vector<int> >;
using Gjudge = vector<vector<bool>>;
using Vi = vector<int>;
using Vl = vector<ll>;
using Vd = vector<double>;
using Vld = vector<long double>;
using Vll = vector<vector<ll> >;
using Vldd = vector<vector<ld> >;
using Vs = vector<string>;
using Vb = vector<bool>;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Pli = pair<ll, int>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, 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 int Mod = static_cast<int>(1e9 + 7);
const int INF = INT_MAX;
const ll LINF = LLONG_MAX / 10000;
const int dx[4] = { 1,0,-1,0 };
const int dy[4] = { 0,1,0,-1 };
int main()
{
int k;
cin >> k;
queue<ll> Q;
lrep(i, 1, 10) Q.push(i);
ll ans = 0;
rep(i, k) {
ll x = Q.front();
Q.pop();
if (i == k - 1) ans = x;
if (x % 10 != 0) Q.push(x * 10 + (x % 10) - 1);
Q.push(x * 10 + x % 10);
if (x % 10 != 9) Q.push(x * 10 + (x % 10) + 1);
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(int argc, char* argv[]){
vector<string> result;
double x1,y1,x2,y2,x3,y3,x4,y4;
int N = 0;
cin >> N;
for (int i=0; i<N; ++i){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
double inc1,inc2;
inc1 = (y1 - y2) / (x1 - x2);
inc2 = (y3 - y4) / (x3 - x4);
if (inc1 == inc2){
result.push_back("YES");
}
else{
result.push_back("NO");
}
}
vector<string>::iterator it = result.begin();
while (it != result.end()){
cout << *it << endl;
++it;
}
return 0;
}
| 0 | 6,231,724 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> ans(n+1);
rep(i,n) {
int a;
cin >> a;
ans[a] = i+1;
}
for(int i = 1; i < n; i++)
cout << ans[i] << " ";
cout << ans[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
vector<int> vec(N);
for (int i = 0; i < N; i++){
cin >> vec.at(i);
}
int a = 1, count = 0;
for (int i = 0; i < N; i++){
a = vec.at(a-1);
count++;
if (a == 2){
cout << count << endl;
break;
}
}
if (count == N)cout << -1 << endl;
}
| 0 | 91,863,764 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n;
cin>>n;
ll a[n];
ll sum=0,mn=0;
for(int i=0;i<n;i++){
cin>>a[i];
mn=__gcd(mn,a[i]);
}
cout<<mn<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef map <str,int> mapsi;
typedef map <str,int> :: iterator mapsitr;
typedef map <int , int> mint;
typedef map <ll , ll> mll;
typedef set <int> si;
typedef set <ll> sll;
typedef si :: iterator sitr;
typedef si :: reverse_iterator rsitr;
typedef sll :: iterator sltr;
typedef sll :: reverse_iterator rsltr;
#define mset multiset
typedef mset <int> msi;
typedef mset <ll> msll;
typedef msi :: iterator msitr;
typedef msi :: reverse_iterator msritr;
typedef msll :: iterator msltr;
typedef msll :: reverse_iterator mslritr;
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
char to_upper (char x){
if( 97 <= int(x) && int(x) <= 126)return char(x-32);
else if( 65 <= int(x) && int(x) <= 90)return x;
}
char to_lower (char x){
if( 97 <= int(x) && int(x) <= 126)return x;
else if( 65 <= int(x) && int(x) <= 90)return char(x+32);
}
int numerize (char x){
if(48 <= int(x) && int(x) <= 57)return int(x-'0');
else if( 97 <= int(x) && int(x) <= 126)return int(x-96);
else if( 65 <= int(x) && int(x) <= 90)return int(x-64);
}
ll n,z,w,a[3000];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>z>>w;
for(int i=1;i<=n;i++)cin>>a[i];
ll ans = abs(w-a[n]);
if(n>1)ans = max(ans, abs(a[n] - a[n-1]));
cout<<ans<<newl;
}
| 0 | 92,852,837 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(void)
{
int n, a[100], mode = 0;
rep(i, 100) {
a[i] = 0;
}
while (cin >> n)
a[n]++;
rep(i,100) {
if (mode < a[n]) {
mode = a[n];
}
}
rep(i,100) {
if (a[i] == mode) {
cout << i << endl;
}
}
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;
}
| 0 | 44,822,946 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) && (N.at(1) == N.at(2) && N.at(2) == N.at(3)) ){
cout << "Yes" <<endl;
}
else if (N.at(0) == N.at(1) && N.at(1) == N.at(2) ){
cout << "Yes" <<endl;
}
else if (N.at(1) == N.at(2) && N.at(2) == N.at(3)){
cout << "Yes" <<endl;
}
else{
cout << "No" << endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
#define 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 Rep(i, n) for (long long i = 0; i< (long long)(n); i++)
#define RRep(i,n) for (long long i = ((long long)(n)-1); i>=0; i--)
struct Edge{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w){ }
};
using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
template <class T>
inline bool chmin(T &a, T b){
if (a > b){
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b){
if (a < b){
a = b;
return true;
}
return false;
}
template <class T>
T gcd(T a, T b){
if( b==0 ) return a;
else return gcd(b, a%b);
}
template <class T>
T lcm(T a, T b){
return (a*b)/gcd(a,b);
}
int INF = 1e9+7;
vector<int> dx = {-1,0,1,0};
vector<int> dy = {0,-1,0,1};
int main(){
string s;
cin >> s;
vector<int> a(26,0);
rep(i,s.size()){
a[s[i]-'a']++;
}
if(s.size()<26){
rep(i,26){
if(a[i]) continue;
else{
cout << s << char('a'+i) << endl;
return 0;
}
}
}
else{
rrep(i,s.size()-1){
if(s[i+1]<s[i]){
continue;
}
else{
int ans = INF;
for(int j = i+1; j<s.size(); j++){
if(s[i]<s[j]){
chmin(ans,s[j]-0);
}
}
rep(j,i){
cout << s[j];
}
cout << char(ans) << endl;
return 0;
}
}
cout << -1 << endl;
}
return 0;
}
| 0 | 58,394,420 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> mt;
for (int i = 0; i < 10; i++) {
int tmp;
cin >> tmp;
mt.push_back(tmp);
}
sort(mt.begin(), mt.end());
for (int i = mt.size()-1, j = 0; j < 3; i--, j++) {
cout << mt[i] << endl;
}
return 0;
}
|
#include <stdio.h>
#include <stack>
int main(){
std::stack<int> st;
int n;
while(scanf("%d", &n) != EOF){
if(n == 0){
printf("%d\n", st.top());
st.pop();
}
else{
st.push(n);
}
}
return 0;
}
| 0 | 98,420,178 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long,long long> pll;
typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs;
typedef long double ld;
#define _GLIBCXX_DEBUG
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPD(i,n) for (int i = (n-1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debug2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << '\n'
#define debug3(x, y, z) cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z << ": " << z << '\n'
#define debugs(s) cerr << s << "\n"
#define hyphen() cerr << "--\n"
#define ALL(vec) (vec).begin(), (vec).end()
#define REVALL(vec) (vec).rbegin(), (vec).rend()
static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
#define fst first
#define snd second
#define pb push_back
#define mk(x,y) make_pair((x),(y))
int qp(int a,ll b){int ans=1;do{if(b&1)ans=1ll*ans*a;a=1ll*a*a;}while(b>>=1);return ans;}
int qpm(int a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
#define sz(v) int(v.size())
#define x1 x192837465
#define x2 x123456789
#define y1 y192837465
#define y2 y123456789
#define itn int
#define reutrn return
#define reutnr return
#define srting string
#define make(type, x) type x; cin>>x;
#define make2(type, x, y) type x, y; cin>>x>>y;
#define make3(type, x, y, z) type x, y, z; cin>>x>>y>>z;
#define make4(type, x, y, z, t) type x, y, z, t; cin>>x>>y>>z>>t;
const int MOD = (int)1e9 + 7;
const int INF = numeric_limits<int>::max();
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
signed main() {
make(srting, S);
int ans = INF;
FORE(start, 0, S.size()-3) {
int n = ctoi(S.at(start)) * 100 + ctoi(S.at(start+1)) * 10 + ctoi(S.at(start+2));
int diff = abs(753-n);
ans = min(ans, diff);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[100055];
long long suff[100055];
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
scanf("%lld", &a[i]);
}
if (a[0] > 1 || (a[0] == 1 && n != 0)) {
puts("-1");
return 0;
}
for (int i = n; i >= 0; i--) {
suff[i] = a[i] + suff[i + 1];
}
long long cur = 1;
long long res = 1;
for (int i = 1; i <= n; i++) {
long long can = min(cur * 2, suff[i]);
res += can;
cur = can - a[i];
if (cur < 0) {
puts("-1");
return 0;
}
}
cout << res;
return 0;
}
| 0 | 91,780,455 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define N 51
ll n,x;
ll ans=0;
ll mai[N];
ll pat[N];
void dfs(ll pos,ll level){
if(level==0){
if(pos>=x)return;
pos++;
ans++;
return;
}
pos++;
if(pos>=x)return;
if(pos+mai[level-1]>=x){
dfs(pos,level-1);
return;
}
pos+=mai[level-1];
ans+=pat[level-1];
if(pos>=x)return;
pos++;
ans++;
if(pos>=x)return;
if(pos+mai[level-1]>=x){
dfs(pos,level-1);
return;
}
pos+=mai[level-1];
ans+=pat[level-1];
return;
}
int main(){fastio
cin>>n>>x;
mai[0]=1;
pat[0]=1;
rep(i,1,N-1){
mai[i]=mai[i-1]*2+3;
pat[i]=pat[i-1]*2+1;
}
dfs(0,n);
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define print(s) cout << s << endl; return 0;
#define yes cout << "Yes" << endl; return 0;
#define no cout << "No" << endl; return 0;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,n) for (int i = 1; i < (n)+1; ++i)
using ll = long long;
const ll modseed = pow(10,9) + 7;
template <typename T>
vector<T> getValues(ll num){
vector<T> values(num);
for(ll i=0;i<num;i++){
cin >> values.at(i);
}
return values;
}
ll calculateDivNums(ll tg){
ll ans = 0;
for(ll a=1;a*a<=tg;a++){
if(tg%a!=0){
continue;
}
ans++;
if(tg!=a*a){
ans++;
}
}
return ans;
}
string S;
int A,B,C,K,N, cnt;
int main(){
cin >> A >> B >> K;
stack<int> s;
rep2(i,min(A,B)){
if(A%i==0 && B%i==0){
s.push(i);
}
}
rep(i,K-1){
s.pop();
}
printl(s.top());
}
| 0 | 38,128,358 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n,m;
cin >>n>>m;
int ac=0,wa=0;
pair<int,string>state;
VPi data(n,mp(0,0));
rep(i,m){
cin>>state.F>>state.S;
state.F--;
if(data[state.F].F==0){
if(state.S=="AC"){
data[state.F].F++;
}else{
data[state.F].S++;
}
}
}
rep(i,n){
ac+=data[i].F;
if(data[i].F==1){
wa+=data[i].S;
}
}
printf("%d %d\n",ac,wa);
}
|
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int kfactor(int a,int k){
vector<int>v1,v2;
for(int i=1;i<=sqrt(a);i++)
{
if(a%i==0)
{
v1.push_back(i);
v2.push_back(a/i);
}
}
if(k<=v2.size())
{
k--;
return v2[k];
}
if(sqrt(a)*sqrt(a)==a){
k++;
}
k-=v2.size();
k=v1.size()-k;
return v1[k];
}
int main(){
int a,b,k;
cin>>a>>b>>k;
int hcf=gcd(a,b);
cout<<kfactor(hcf,k);
}
| 0 | 80,030,812 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
int main(){
int n; cin >> n;
vector<double> v(n);
rep (i, n) cin >> v[i];
sort(v.begin(), v.end());
double vi = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
vi = (vi + v[i]) / 2;
}
cout << vi << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n); rank.resize(n); diff_weight.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y, Abel w) {
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y), w = -w;
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) {
return weight(y) - weight(x);
}
};
int main()
{
int n, m;
cin >> n >> m;
UnionFind<int> uf(n);
rep(i,m)
{
int l, r, d;
cin >> l >> r >> d;
--l;--r;
if(uf.issame(l, r))
{
int diff = uf.diff(l,r);
if(diff != d)
{
cout << "No" << endl;
return 0;
}
}
else
{
uf.merge(l,r,d);
}
}
cout << "Yes" << endl;
}
| 0 | 61,494,003 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
int main(){
ll N, M;
cin >> N >> M;
VS s(N);
rep(i, 0, N){
cin >> s[i];
}
rep(j, 0, N){
cout << s[j] << endl;
cout << s[j] << endl;
}
return 0;
}
|
#include <iostream>
int main(int argc, const char * argv[]) {
std::string line;
int chars[26] = {};
for ( ; getline(std::cin, line); ) {
for (size_t i = 0; i < line.length(); i++) {
if ('a' <= line[i] && line[i] <= 'z') {
chars[line[i] - 'a']++;
} else if ('A' <= line[i] && line[i] <= 'Z') {
chars[line[i] - 'A']++;
}
}
}
for (size_t i = 0; i < 26; i++) {
std::cout << (char)(i + 'a') << " : " << chars[i] << std::endl;
}
return 0;
}
| 0 | 78,727,238 |
#include<iostream>
using namespace std;
int main(){
for(;;){
int i,j,o;
cin >> i >> j;
if((i == 0) && (j == 0)){
break;
}
if(i > j){
o = i;
i = j;
j = o;
}
cout << i << " " << j << endl;
}
}
|
#include <iostream>
using namespace std;
int main(void){
string k_l = "qwertasdfgzxcvb";
string k_r = "yuiophjklnm";
while(1) {
string s;
cin >> s;
int result = 0;
int mode = -1;
if (s == "#") break;
for(int i=0; i<s.length(); i++) {
if ((int)k_r.find(s[i]) >= 0) {
if (mode==0) result += 1;
mode = 1;
} else {
if (mode==1) result += 1;
mode = 0;
}
}
cout << result << endl;
}
}
| 0 | 65,453,161 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
int n;
cin>>n;
int b;
int count=0;
for(int a=1;a<n;a++)
{
b=floor((n-1)/a);
count+=b;
}
cout<<count<<endl;
}
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<bool> a(n+1);
vector<int>w(n+1,0);
int acnt=0,wcnt=0;
for(int i=0;i<m;i++){
string s;
int tmp;
cin>>tmp>>s;
if(s=="AC"){
if(!a[tmp]){
acnt++;
wcnt+=w[tmp];
a[tmp]=true;
}
}else{
w[tmp]++;
}
}
cout<<acnt<<" "<<wcnt<<endl;
return 0;
}
| 0 | 9,398,432 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int a, b, c;
cin >> a >> b >> c;
bool flg = false;
int n = abs(a - b);
int d = abs(a - b);
while (n != 0)
{
if (n == c)
{
flg = true;
break;
}
if (n >= a)
{
n = (n - a) % b;
}
else
{
n = (n + d) % b;
}
}
if (flg)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long>a(n + 1);
vector<long long>b(n);
for(int i = 0;i < n + 1;i++){
cin >> a[i];
}
for(int i = 0;i < n;i++){
cin >> b[i];
}
long long count = 0;
for(int i = 0;i < a.size();i++){
if(i != 0){
if(a[i] >= b[i - 1]){
a[i] -= b[i - 1];
count += b[i - 1];
b[i - 1] = 0;
}else{
b[i - 1] -= a[i];
count += a[i];
a[i] = 0;
}
}
if(i != a.size() - 1){
if(a[i] >= b[i]){
a[i] -= b[i];
count += b[i];
b[i] = 0;
}else{
b[i] -= a[i];
count += a[i];
a[i] = 0;
}
}
}
cout << count;
}
| 0 | 48,387,265 |
#include <iostream>
using namespace std;
int main()
{
int f[100];
int n;
cin >> n;
f[0] = 1;
f[1] = 1;
for(int i = 0; i < n; i++)
{
f[i+2] = f[i+1] + f[i];
}
cout << f[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA_ARGS__);cout<<endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head,class... Args>void show(Head t,Args... args){std::cout<<t<<" ";show(args...);}
#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 REP1(i, n) for(ll i = 1; i <= n; i++)
#define REPR1(i, n) for(ll i = n; i >= 1; i--)
#define FOR1(i, m, n) for(ll i = m; i <= n; i++)
const ll INF = LLONG_MAX;
#define VEC(type,A,N) vector<type> A(N)
#define VECi(type,A,N,i) vector<type> A(N,i)
#define VEC2(type,A,N,M) vector<vector<type>> A(N,vector<type>(M))
#define VEC2i(type,A,N,M,i) vector<vector<type>> A(N,vector<type>(M,i))
#define ALL(v) v.begin(), v.end()
ll frac(ll k){
int s = 1;
for (ll i=1; i<=k; ++i)s *= i;
return s;
}
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);
}
ll antidiv(ll N,ll C,ll D){
return N-floor(N/C)-floor(N/D)+floor(N/lcm(C,D));
}
vector<ll> yakusuu(ll N){
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N) ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main(){
ll N;
cin>>N;
map<string,ll> st;
REP(i,N){
string s;
cin>>s;
VECi(ll,num,26,0);
REP(j,10){
num[ll(s[j])-97]++;
}
string t;
REP(j,26){
t+=char(num[j]+48);
}
if(st.count(t)==0)st[t]=1;else st[t]++;
}
ll sum=0;
for(const auto t:st){
ll n = t.second;
if(n>=2){
sum+=n*(n-1)/2;
}
}
cout<<sum;
cout<<endl;
return 0;
}
| 0 | 19,950,305 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
string res;
int main()
{
ll a, b;
string s;
cin >> a >> b >> s;
res = "Yes";
for (int i = 0; i < s.length(); i++)
{
if (i == a)
{
if (s[i] != '-')
{
res = "No";
}
}
else
{
if (!('0' <= s[i] && s[i] <= '9'))
{
res = "No";
}
}
}
println(res);
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const double PI = acos(-1);
struct Point
{
double x, y;
};
void koch(int n, int i, Point p1, Point p2)
{
if(i == n) return;
Point s, t, u, p;
s.x = (2 * p1.x + p2.x) / 3;
s.y = (2 * p1.y + p2.y) / 3;
koch(n, i+1, p1, s);
printf("%.8lf %.8lf\n", s.x, s.y);
u.x = (p1.x + 2 * p2.x) / 3;
u.y = (p1.y + 2 * p2.y) / 3;
p.x = u.x - s.x;
p.y = u.y - s.y;
t.x = cos(PI / 3) * p.x - sin(PI / 3) * p.y + s.x;
t.y = sin(PI / 3) * p.x + cos(PI / 3) * p.y + s.y;
koch(n, i+1, s, t);
printf("%.8lf %.8lf\n", t.x, t.y);
koch(n, i+1, t, u);
printf("%.8lf %.8lf\n", u.x, u.y);
koch(n, i+1, u, p2);
}
int main()
{
int n;
cin >> n;
Point p1, p2;
p1.x = p1.y = p2.y = 0;
p2.x = 100;
printf("%.8lf %.8lf\n", p1.x, p1.y);
koch(n, 0, p1, p2);
printf("%.8lf %.8lf\n", p2.x, p2.y);
}
| 0 | 86,838,530 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int main()
{
string L; cin >> L;
int len = L.size();
vector<int> x3(len);
x3[0] = 1;
for (int i = 1; i < x3.size(); i++) {
x3[i] = (ll)x3[i-1] * 3 % MOD;
}
ll ans_eq = 1, ans_lt = 0;
for (int i = 0; i < len; i++) {
if (L[i] == '1') {
ans_lt = (ans_lt + (ans_eq * x3[len - i - 1] % MOD)) % MOD;
ans_eq = (ans_eq * 2) % MOD;
}
}
ll ans = (ans_eq + ans_lt) % MOD;
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using P = pair<int,int>;
int main(){
int n;
while(cin>>n,n){
vector<P> V;
V.clear();
for(int i=0;i<n;i++){
int hh,mm,ss;
cin>>hh;
cin.ignore();
cin>>mm;
cin.ignore();
cin>>ss;
cin.ignore();
int ts = hh*3600+mm*60+ss;
V.emplace_back(ts,+1);
cin>>hh;
cin.ignore();
cin>>mm;
cin.ignore();
cin>>ss;
cin.ignore();
int te = hh*3600+mm*60+ss;
V.emplace_back(te,-1);
}
sort(V.begin(), V.end());
int ans=0,cnt=0;
for(auto v:V){
cnt+=v.second;
ans=max(ans,cnt);
}
cout<<ans<<endl;
}
return 0;
}
| 0 | 29,520,860 |
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) for(int a=0;a<b;++a)
#define KEEP while(1)
#define SRAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng()%a
#define ALL(a) a.begin(),a.end()
#define ff fflush(stdout)
using namespace std;
const int INF=0x3f3f3f3f;
typedef pair<int,int> mp;
typedef pair<mp,mp> superpair;
bool check(LL x){
cout<<"? "<<x<<endl;
ff;
char flag;
cin>>flag;
if(flag=='Y') return 1;
else return 0;
}
int main(){
char flag;
int wei;
wei=1;
string s="1";
rb(i,1,10) {
cout<<"? "<<s<<endl;
ff;
cin>>flag;
s+='0';
if(flag=='N'){
wei--;
break;
}
wei++;
}
if(wei==11){
string s1="2";
wei=1;
rb(i,1,10){
cout<<"? "<<s1<<endl;
ff;
cin>>flag;
if(flag=='Y'){
break;
}
wei++;
s1+='0';
}
cout<<"! 1";
rep(i,wei-1){
cout<<"0";
}
cout<<endl;
return 0;
}
LL l=1,r;
rb(i,1,wei-1) l*=10;
r=l*10-1;
while(l+2<r){
LL mid=(l+r)>>1;
if(check(mid*10)) r=mid+1;
else l=mid;
}
for(LL i=l;i<=r;i++){
if(check(i*10)) break;
l++;
}
cout<<"! "<<l<<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(){
cin.tie(0);ios::sync_with_stdio(false);
int n;
string s;
cin>>n>>s;
string ans=s;
stack<char> st;
rep(i,n){
if(st.empty())st.push(s[i]);
else{
if(st.top()=='('&&s[i]==')')st.pop();
else st.push(s[i]);
}
}
while(!st.empty()){
char c=st.top();
st.pop();
if(c==')')ans.insert(0,"(");
else ans.insert(ans.size(),")");
}
cout<<ans<<endl;
}
| 0 | 7,708,675 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int n, x[N];
int calc(int p) {
int ans = 0;
for (int i = 1; i <= n; ++i)
ans += (x[i] - p) * (x[i] - p);
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int avg = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> x[i];
avg += x[i];
}
avg /= n;
cout << min(calc(avg), calc(avg + 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
int x = -1;
rep(i, n) {
cin >> a[i];
if (a[i]==1) x = i;
}
int ans = 1001001001;
rep(i, k) {
int l = max(x-i, 0);
int r = max(n-x-1-(k-1-i), 0);
int res = 1;
if (l>0) res += (l-1)/(k-1)+1;
if (r>0) res += (r-1)/(k-1)+1;
chmin(ans, res);
}
cout << ans << endl;
return 0;
}
| 0 | 69,518,155 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
ll X, Y;
cin >> X >> Y;
if (X % Y == 0){
cout << -1 << "\n";
} else {
ll prod = 1;
ll val = X;
while (val <= 1e18) {
if (val % Y != 0){
cout << val << "\n";
return 0;
}
prod++;
val = X * prod;
}
cout << -1 << "\n";
}
return 0;
}
|
bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define ncouts(x) numout(x),outst[outst_N++] = ' '
#define ncoutn(x) numout(x),outst[outst_N++] = '\n'
#define scouts(x) strout(x),outst[outst_N++] = ' '
#define scoutn(x) strout(x),outst[outst_N++] = '\n'
#define dcouts(x) if(DBG) couts(x)
#define dcoutn(x) if(DBG) coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x,a) (((x)>>(a))&1LL)
#define IBIT(x,a) (((x)>>(a))&1)
#define BCOUNT(x) (__builtin_popcount(x))
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1,T2> &p){is >> p.first >> p.second; return is; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec){ os << "deque["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<class T> using V = vector<T>;
template<class T> using V2 = V<V<T>>;
template<class T> using V3 = V<V2<T>>;
template<class T> using V4 = V<V3<T>>;
char outst[20'000'000]; int outst_N = 0;
char outst_tmp[200];
template<class NUM >
void numout(NUM n){
if(n<0) { n*=-1; outst[outst_N++] = '-';}
if(n==0){ outst[outst_N++] = '0'; return;}
int cnt = 0;
while(n>0){
outst_tmp[cnt++] = '0' + (n % 10);
n /= 10;
}
IFOR(i,0,cnt){
outst[outst_N++] = outst_tmp[i];
}
}
void strout(std::string s){
for(auto x: s){
outst[outst_N++] = x;
}
}
constexpr ll LINF = 1LL << 60;
constexpr int IINF = 1 << 28;
constexpr ll mod = 1'000'000'007;
void solve(){
auto f = [](ll p)->ll{
ll ret = 0;
if(p%2) ret = ((p+1)/2 % 2);
else ret = (p/2 % 2)^p;
return ret;
};
ll a, b; cin >> a >> b;
ll A=f(max<ll>(0,a-1)), B=f(b);
coutn( A^B );
}
int main(void){
cin.tie(0);
solve();
return 0;
}
| 0 | 14,783,204 |
#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int a,b,c;
cin >> a >> b >> c;
cout << max(0ll,b+c-a);
}
|
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(i,n) reps(i,0,n)
#define rept(i,n) rep(i,(n)+1)
#define repst(i,s,n) reps(i,s,(n)+1)
#define reprt(i,n,t) for(int (i)=(n);(i)>=(t);--(i))
#define repr(i,n) reprt(i,n,0)
#define each(itr,v) for(auto &(itr):(v))
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define tmax(x,y,z) max(x,max(y,z))
#define tmin(x,y,z) min(x,min(y,z))
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define ln '\n'
#define bln(i,n) (((i)==(n)-1)?'\n':' ')
#define dbg(x) cout<<#x" = "<<(x)<<ln<<flush
#define dbga(x,n) {cout<<#x" : ";for(int (i)=0;i<(n);++i){cout<<((x)[i])<<(i==((n)-1)?'\n':' ')<<flush;}}
#define zero(a) memset(a,0,sizeof(a))
#define unq(a) sort(all(a)),a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vector<int> > mat;
const ll inf = (ll)1e9+10;
const ll linf = (ll)1e18+10;
const ll mod = (ll)(1e9+7);
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
const double eps = 1e-10;
ll mop(ll a,ll b,ll m=mod) {ll r=1;a%=m;for(;b;b>>=1){if(b&1)r=r*a%m;a=a*a%m;}return r;}
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b) {return a*b/gcd(a,b);}
bool ool(int x,int y,int h,int w) {return((x<0)||(h<=x)||(y<0)||(w<=y));}
bool deq(double a,double b) {return abs(a-b)<eps;}
struct oreno_initializer {
oreno_initializer() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} oreno_initializer;
int h, w, d, res[505][505];
string s = "RGBY";
signed main() {
cin >> h >> w >> d;
if (d%2) {
rep(i,h) rep(j,w) res[i][j] = (i+j)%2;
}
else {
rep(i,h) rep(j,w) {
int di = i+j+1000, dj = i-j+1000;
res[i][j] = di/d%2*2 + dj/d%2;
if ((i+j)%2) res[i][j] ^= 3;
}
}
rep(i,h) {
rep(j,w) cout << s[res[i][j]];
cout << endl;
}
}
| 0 | 23,121,680 |
#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;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
vector<int> ki[200010];
ll sum[200010];
bool seen[200010];
int main() {
int n,m;cin>>n>>m;
rep(i,n-1) {
int a,b;cin>>a>>b;
a--;b--;
ki[a].push_back(b);
ki[b].push_back(a);
}
rep(i,m) {
int p,x;cin>>p>>x;
p--;
sum[p]+=x;
}
queue<int> qu;
qu.push(0);
seen[0]=true;
while(!qu.empty()) {
int now = qu.front();qu.pop();
for(auto nxt: ki[now]) {
if(!seen[nxt]) {
seen[nxt]=true;
sum[nxt]+=sum[now];
qu.push(nxt);
}
}
}
rep(i,n) {
cout<<sum[i]<<" ";
if(i==n-1) cout<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,M;
cin >> N >> M;
vector<int>A(N);
int sum = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];
sum+=A[i];
}
sort(A.rbegin(),A.rend());
for(int i = 0; i < M; i++) {
if(A[i]*4*M < sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| 0 | 94,039,458 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
struct combination {
ll operator()(int n, int r) {
ll num = 1;
for(int i = 1; i <= r; i++){
num = num * (n - i + 1) / i;
}
return num;
}
};
int main(){
int n,p;
ll test=1;
rep(i,20){
test*=(i+1);
}
std::vector<int> a(2);
combination c;
std::cin >> n>>p;
rep(i,n){
int temp;
std::cin >> temp;
a[temp%2]++;
}
ll ans=0;
ll evenall=0;
rep(i,a[0]+1){
evenall+=c(a[0],i);
}
if(p==0){
ans+=evenall;
for (int i = 2; i <=a[1]; i+=2) {
ans+=c(a[1],i)*evenall;
}
}else{
for (int i = 1; i <= a[1] ; i+=2) {
ans+=c(a[1],i)*evenall;
}
}
std::cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using lint = long long;
int main() {
string s;
lint K;
cin >> s >> K;
int n = s.size();
vector<lint> vt = {1};
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1]) vt.back()++;
else vt.push_back(1);
}
if (vt.size() == 1) {
cout << vt[0] * K / 2 << endl;
return 0;
}
lint ans = 0;
for (int x : vt) ans += x / 2;
ans *= K;
if (s[0] == s[n - 1]) {
lint a = vt.front(), b = vt.back();
ans -= (a / 2 + b / 2 - (a + b) / 2) * (K - 1);
}
cout << ans << endl;
return 0;
}
| 0 | 77,262,518 |
#include <bits/stdc++.h>
using namespace std;
string S; int N, cnt;
int main() {
string S,T;
cin >> S >> T;
int ans=0;
for(int i=0;i<3;i++){
if(S[i]==T[i])ans++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(1){
string str;
getline(cin,str);
if(str==".") break;
int i=0;
int sum = 0;
vector<int> inkakko;
while(1){
if(str[i]=='('){
inkakko.push_back(1);
sum++;
}else if(str[i]==')'){
if(inkakko.size()){
if(inkakko[inkakko.size()-1]==1){
inkakko.pop_back();
sum--;
}else{
cout << "no" << endl;
break;
}
}else{
cout << "no" << endl;
break;
}
}else if(str[i]=='['){
inkakko.push_back(2);
sum++;
}else if(str[i]==']'){
if(inkakko.size()){
if(inkakko[inkakko.size()-1]==2){
inkakko.pop_back();
sum--;
}else{
cout << "no" << endl;
break;
}
}else{
cout << "no" << endl;
break;
}
}else if(str[i]=='.'){
if(inkakko.size()){
cout << "no" << endl;
}else{
cout << "yes" << endl;
}
break;
}
i++;
}
}
}
| 0 | 1,026,743 |
#include<bits/stdc++.h>
#define lol long long
#define gcd(x,y) __gcd(x,y)
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define fixed fixed<<setprecision(14)
using namespace std;
using pii=pair<int,int>;
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
template <class A> inline lol abs(A &a) { return (a < 0 ? -a : a); }
template <class A, class B> inline A max(A a, B b){return(a>b?a:b);}
template <class A, class B> inline A min(A a, B b){return(a<b?a:b);}
const lol inf=(1LL<<60);
const lol MOD=(1e9)+7;
const lol mod=998244353;
const int dx[]={1,0,-1,0,1,1,-1,-1};
const int dy[]={0,1,0,-1,1,-1,1,-1};
lol n,m,k,r;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin >>s>>t;
bool yes=false;
for(int i=0;i<26;i++){
string tmp=s+(char)('a'+i);
if(tmp==t) yes=true;
}
if(yes) cout <<"Yes\n";
else cout <<"No\n";
return (0);
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
char room[25][25] = {'#'};
int walk(int x, int y) {
int ret = 1;
room[y][x] = '#';
if (room[y-1][x] == '.') ret += walk(x, y-1);
if (room[y+1][x] == '.') ret += walk(x, y+1);
if (room[y][x-1] == '.') ret += walk(x-1, y);
if (room[y][x+1] == '.') ret += walk(x+1, y);
return ret;
}
int main() {
int W, H;
while (cin >> W >> H, W || H) {
int x, y;
for (int i=0; i<25; ++i) {
for (int j=0; j<25; ++j) {
room[i][j] = '#';
}
}
for (int i=1; i<=H; ++i) {
for (int j=1; j<=W; ++j) {
cin >> room[i][j];
if (room[i][j] == '@') {
room[i][j] = '.';
y = i, x = j;
}
}
}
cout << walk(x, y) << endl;
}
return 0;
}
| 0 | 82,583,928 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,a;
cin >> n;
cin >> a;
if(n%500-a<=0)cout << "Yes" <<endl;
else cout << "No" <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string a,b;
cin >> a >> b;
bool f = true;
for(int i = 0; i < 3; i++){
if(a[i] != b[2 - i]){
f = false;
break;
}
}
if(f) puts("YES");
else puts("NO");
}
| 0 | 85,659,275 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
struct UnionFind {
vector<int> parent,s;
UnionFind(int n): parent(n), s(n){
rep(i,n) {
parent[i] = i;
s[i] = 1;
}
}
int root(int x) { return parent[x]==x ? x : parent[x] = root(parent[x]); }
bool same(int x, int y) { return root(x)==root(y); }
int size(int x){ return s[root(x)]; }
void unite(int x, int y) {
x = root(x); y = root(y);
if (x == y) return;
if (s[x] < s[y]) {
parent[x] = y;
s[y] += s[x];
} else {
parent[y] = x;
s[x] += s[y];
}
}
};
const ll inf = 1e18L;
int main() {
int n,k;
cin >> n >> k;
vector<int> p(n),c(n);
rep(i,n) cin >> p[i], --p[i];
rep(i,n) cin >> c[i];
UnionFind u(n);
rep(i,n) u.unite(i,p[i]);
vector<ll> s(n);
rep(i,n) s[u.root(i)] += c[i];
rep(i,n) s[i] = s[u.root(i)];
ll ans = -inf;
rep(i,n){
ll res = -inf, t = 0;
int m = k/u.size(i);
if(m>=2 && s[i]>0) t += s[i]*(m-1);
int v=i;
m = min(k,k%u.size(i)+u.size(i));
rep(_,m){
t += c[v=p[v]];
res = max(res,t);
}
ans = max({ans,res,t});
}
cout << ans << endl;
}
|
#include <stdio.h>
using namespace std;
typedef long long llong;
#define MAX
const llong mod = 1000000000 + 7;
int main()
{
int A, B, C, K;
int ans = 0;
scanf("%d%d%d%d", &A, &B, &C, &K);
if (A > K)
{
ans += 1 * K;
printf("%d\n", ans);
return 0;
}
else
{
ans += 1 * A;
}
K -= A;
if (B > K)
{
ans += 0 * K;
printf("%d\n", ans);
return 0;
}
else
{
ans += 0 * B;
}
K -= B;
if (C > K)
{
ans += -1 * K;
printf("%d\n", ans);
return 0;
}
else
{
ans += -1 * C;
}
printf("%d\n", ans);
return 0;
}
| 0 | 7,653,235 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, tmp, ans;
cin >> N;
if (N == 1){
cout << 1;
return 0;
}
for (int i = 1; i <= 7; i++){
tmp = pow(2, i);
if(tmp > N){
cout << pow(2, i - 1);
return 0;
}
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> z(n, vector<ll>(n, 1000000000));
vector<tuple<ll, ll, ll>> ky(m);
vector<vector<ll>> ans(n, vector<ll>(n, 1000000000));
for (int i = 0; i < m; i++) {
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
z[a][b] = c;
z[b][a] = c;
ky[i] = make_tuple(a, b, c);
}
for (int i = 0; i < n; i++) {
vector<bool> used(n);
for (int j = 0; j < n; j++) {
used[j] = false;
}
ans[i][i] = 0;
ll mint = 0;
while (1) {
mint = -1;
for (ll j = 0; j < n; j++) {
if (!used[j] && (mint== -1 || ans[i][mint] > ans[i][j]))mint = j;
}
if (mint == -1)break;
used[mint] = true;
for (ll j = 0; j < n; j++) {
ans[i][j] = min(ans[i][mint] + z[j][mint], ans[i][j]);
}
}
}
ll ansans = 0;
for (int i = 0; i < m; i++) {
if (ans[get<0>(ky[i])][get<1>(ky[i])] != get<2>(ky[i])) { ansans++; }
}
cout << ansans << endl;
}
| 0 | 78,563,977 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int x = a[1];
for (int i = 1; i <= n; i++)
{
if (x == 2)
{
cout << i << endl;
return 0;
}
x = a[x];
}
cout << -1 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int n;
cin>>n>>s;
for(int i=0;i<2;i++)
for(int j=0;j<2;j++)
{
string t;
t+=(i+'0');
t+=(j+'0');
for(int k=1;k<n-1;k++)
{
if(t[k]=='0')
{
if(s[k]=='o')
t+=t[k-1];
else
t+=(t[k-1]=='0'?'1':'0');
}
else
{
if(s[k]=='x')
t+=t[k-1];
else
t+=(t[k-1]=='0'?'1':'0');
}
}
if(t[n-1]=='1')
{
if(s[n-1]=='o'&&t[0]=='0'&&t[n-2]=='1'||s[n-1]=='o'&&t[0]=='1'&&t[n-2]=='0')
{
if(t[0]=='0')
{
if(s[0]=='o'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='x'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
else
{
if(s[0]=='x'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='o'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
}
if(s[n-1]=='x'&&t[0]=='1'&&t[n-2]=='1'||s[n-1]=='x'&&t[0]=='0'&&t[n-2]=='0')
{
if(t[0]=='0')
{
if(s[0]=='o'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='x'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
else
{
if(s[0]=='x'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='o'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
}
}
else
{
if(s[n-1]=='o'&&t[0]=='0'&&t[n-2]=='0'||s[n-1]=='o'&&t[0]=='1'&&t[n-2]=='1')
{
if(t[0]=='0')
{
if(s[0]=='o'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='x'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
else
{
if(s[0]=='x'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='o'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
}
if(s[n-1]=='x'&&t[0]=='1'&&t[n-2]=='0'||s[n-1]=='x'&&t[0]=='0'&&t[n-2]=='1')
{
if(t[0]=='0')
{
if(s[0]=='o'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='x'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
else
{
if(s[0]=='x'&&t[1]=='1'&&t[n-1]=='1'||s[0]=='x'&&t[1]=='0'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
if(s[0]=='o'&&t[1]=='0'&&t[n-1]=='1'||s[0]=='o'&&t[1]=='1'&&t[n-1]=='0')
{
for(int i=0;i<n;i++)
{
if(t[i]=='0')
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
}
}
}
cout<<-1;
return 0;
}
| 0 | 40,804,089 |
#include<stdio.h>
int main()
{
int n,x;
double r,y;
x=100000;
r=1.05;
scanf("%d",&n);
for(int i=0;i<n;i++){
x=r*x;
if(x%1000>0)x=x+1000-(x%1000);
}
printf("%d\n",x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(pos, len) for(int pos=0;pos<len;pos++)
#define repp(pos, len) for(int pos=1;pos<=len;pos++)
#define INF 987654321
#define IINF 2987654321987654321
#define MOD 998244353
const int MAXN = 1e5 + 50;
ll d[MAXN], pa[MAXN], sz[MAXN], depth[MAXN];
vector<int> adj[MAXN];
int n;
bool check(int root) {
queue<int> que;
que.push(root);
ll sum = 0;
depth[root] = 0;
while(!que.empty()) {
int v = que.front(); que.pop();
for(auto c : adj[v]) {
depth[c] = depth[v] + 1;
sum += depth[c];
que.push(c);
}
}
return sum == d[root];
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%lld", &d[i]);
map<ll, int> M;
for(int i = 1; i <= n; i++)
M[d[i]] = i;
for(int i = 1; i <= n; i++)
sz[i] = 1;
vector<int> v;
for(int i = 1; i <= n; i++) v.push_back(i);
sort(v.begin(), v.end(), [](int i, int j){ return d[i] > d[j]; });
int root = v.back();
for(auto c : v) {
if(c == root) break;
ll dval = d[c] + 2*sz[c] - n;
if(M.find(dval) == M.end() || M[dval] == c) {
printf("-1");
exit(0);
}
int p = M[dval];
adj[p].push_back(c);
pa[c] = p;
sz[p] += sz[c];
}
if(!check(root)) {
printf("-1");
exit(0);
}
for(int i = 1; i <= n; i++)
if(i != root) printf("%d %d\n", i, pa[i]);
}
| 0 | 61,835,647 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include <ctype.h>
#include <string>
typedef long long ll;
using namespace std;
int main(){
double n,m,ans=0;
cin>>n;
rep(i,n){
cin>>m;
m=1/m;
ans+=m;
}
cout<<fixed<<setprecision(8);
ans=1/ans;
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
for(ll r = 0; r * R <= N; r++){
for(ll g = 0; g * G <= N; g++){
if(r * R + g * G > N) continue;
ll num = N - r * R - g * G;
if(num % B == 0) ans++;
}
}
cout << ans << endl;
return 0;
}
| 0 | 52,356,746 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
double w,h,x,y;
cin>>w>>h>>x>>y;
double res = w*h/2;
bool flag = (x==w/2 && y==h/2);
cout<<fixed<<setprecision(15)<<res<<" ";
cout<<flag<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <bitset>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B;
string S, T;
const ll MOD = (1e+9) + 7;
const ll INF = 1LL << 60;
typedef pair<ll,ll> P;
int main(){
cin>>N>>K;
vec a(N);
rep(i,N) cin>>a[i];
rep(i,N) {
ll temp = a[i];
reps(j, i + 1, N) {
temp += a[j];
a.push_back(temp);
}
}
vector<vector<bool> > can_use(2, vector<bool>(N * (N + 1) / 2, true));
ll ans = 0;
Rrep(i,41){
ll num = 0;
rep(j, N * (N + 1) / 2){
if(can_use[0][j] && (a[j]>>i)&1){
++num;
can_use[1][j] = true;
}else{
can_use[1][j] = false;
}
}
if(num >= K){
swap(can_use[0], can_use[1]);
ans += (1LL<<i);
}
}
cout<<ans<<endl;
}
| 0 | 4,281,045 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
ll ans = 0;
for(i = 1;i <= sqrt(n)+1;++i){
if(n%i) continue;
j = n/i;
ll m = j-1;
if(i >= m) continue;
else ans += m;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const ll INF = 1e14;
void solve(){
int x, n; cin >> x >> n;
unordered_set<int> set;
while(n--){
int num; cin >> num;
set.insert(num);
}
int pos = 0;
while(true){
if(set.find(x-pos) == set.end()){
cout << x-pos;
return;
}
if(set.find(x+pos) == set.end()){
cout << x+pos;
return;
}
++pos;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| 0 | 89,021,263 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define forn(i,a,b) for(ll i=a;i<=b;i++)
#define ft first
#define sd second
#define sz size()
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
typedef pair<double,double> pdd;
typedef pair<long long,long long> pll;
const int MAX = 1e7;
ll a[MAX],b[MAX];
int main(){
fastIO;
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
int n;
cin>>n;
ll ans=0;
forn(i,1,n){
ll div=n/i;
ll s=(div*(div+1))/2;
ans+=s*i;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, b, d, r;
double f;
cin >> a >> b;
d=a/b;
r=a%b;
f=(double)a/b;
cout << fixed << setprecision(5);
cout << d << " " << r << " " << f << endl;
return 0;
}
| 0 | 23,011,580 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int r;
cin >> r;
int g;
cin >> g;
cout << 2*g-r << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
long long q,h,s,d;
long long n;
cin >> q >> h >> s >> d >> n;
if(n==1){
q*=4;
h*=2;
long long ans = min(q,min(h,s));
cout << n*ans << endl;
}else{
q*=8;
h*=4;
s*=2;
long long ans = min(q,min(h,min(s,d)));
if(n%2==1){
if(ans==d){
long long ans2 = min(q,min(h,s));
ans2/=2;
cout << (n/2)*ans + ans2;
}else{
ans/=2;
cout << n*ans << endl;
}
}else{
cout << (n/2)*ans << endl;
}
}
}
| 0 | 34,259,110 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M,ans=0;
cin >> A >> B >> M;
vector<int> a(A);
for (int i=0;i<A;i++){
cin >> a.at(i);
}
vector<int> b(B);
for (int i=0;i<B;i++){
cin >> b.at(i);
}
vector<vector<int>> c(M,vector<int>(3));
vector<int> d(M);
for (int i = 0; i <M; i++) {
for (int j = 0; j < 3; j++) {
cin >> c.at(i).at(j);
}
d.at(i) = a.at(c.at(i).at(0)-1)+b.at(c.at(i).at(1)-1)-c.at(i).at(2);
}
sort(d.begin(),d.end());
sort(a.begin(),a.end());
sort(b.begin(),b.end());
ans=min(d.at(0),a.at(0)+b.at(0));
cout << ans << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#include <time.h>
#include <functional>
#include <atcoder/all>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<ll, ll, ll, ll> tlglglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
typedef vector<ll> vll;
typedef vector< vector<ll> > matrix;
typedef unsigned int uint;
typedef unsigned long long ull;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
#define REP(i, x, y) for(ll i = (ll)x; i < (ll)y; i++)
#define DREP(i, x, y, d) for(ll i = (ll)x; i < (ll)y; i += (ll)d)
#define PER(i, x, y) for(ll i = (ll)x; i > (ll)y; i--)
#define DPER(i, x, y, d) for(ll i = (ll)x; i > (ll)y; i -= (ll)d)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-12;
void yesno(bool ok, string yes = "Yes", string no = "No") {
if (ok) {
cout << yes << endl;
} else {
cout << no << endl;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
dsu d(N);
REP(i, 0, Q) {
ll t, u, v;
cin >> t >> u >> v;
if (t == 0) {
d.merge(u, v);
} else {
if (d.same(u, v)) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
}
}
| 0 | 70,261,946 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string moji[]={".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int i,j,n;
string figure;
cin >> n;
for(i = 0; i < n; i++){
cin >> figure;
int count=0;
for(j = 0; j < figure.size(); j++){
if(figure[j]-'0'==0){
continue;
}else if(figure[j]-'0'!=0){
char suuji=figure[j];
if(figure[j+1]-'0'==0){
cout << moji[suuji-'0'-1][count%(moji[suuji-'0'-1]).size()];
count=-1;
}
count++;
}
}
cout << endl;
}
return 0;
}
|
#include<stdio.h>
int main(){
int a;
while(~scanf("%d",&a)){
int ans=0;
for(int i=0;i<10;i++)
for(int j=0;j<10;j++)
for(int k=0;k<10;k++)
for(int l=0;l<10;l++)
if(i+j+k+l==a)ans++;
printf("%d\n",ans);
}
}
| 0 | 26,483,341 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int m;
cin >> m;
vector<ll> d(m);
vector<ll> c(m);
ll ans = 0;
ll sum = 0;
for(int i = 0; i < m; i++)
{
cin >> d[i] >> c[i];
ans += c[i];
sum += d[i] * c[i];
}
cout << ans - 1 + (sum-1) / 9 << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932
#define rep(i, n) for (int i = 0; i < n; i++)
#define repe(i, j, n) for (int i = j; i < n; i++)
#define repi(i, n) for (int i = 0; i <= n; i++)
#define repie(i, j, n) for (int i = j; i <= n; i++)
#define all(x) x.begin(), x.end()
#define println() cout << endl
#define P pair<int, int>
#define fi first
#define se second
typedef long long ll;
long long modinv(long long a, long long m)
{
long long b = m, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
struct UnionFind
{
vector<int> par;
UnionFind(int N) : par(N)
{
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x)
{
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y)
{
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y)
{
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
void solve1()
{
int h, w, k; cin >> h >> w >> k;
vector<vector<char>> c(h, vector<char>(w));
rep(i, h) {
rep(j, w) {
cin >> c[i][j];
}
}
int cnt = 0;
int ans = 0;
for(int i = 0; i < (1 << h); i++) {
for(int j = 0; j < (1 << w); j++) {
cnt = 0;
for(int k = 0; k < h; k++) {
for(int l = 0; l < w; l++) {
if ( !(i & (1 << k)) && !(j & (1<<l)) &&
c[k][l] == '#')
{
cnt ++;
}
}
}
if(cnt == k) {
ans ++;
}
}
}
cout << ans << endl;
}
int main()
{
solve1();
}
| 0 | 2,794,515 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char** argv)
{
int num;
cin >> num;
cin.ignore();
vector<int64_t> array(num);
int64_t sum = 0;
for (int i = 0; i < num; i++) {
std::cin >> array[i];
sum += array[i];
}
int64_t sum2 = array[0];
sum -= array[0];
int64_t diff = abs(sum2 - sum);
for (int i = 1; i < (num - 1); ++i)
{
sum2 += array[i];
sum -= array[i];
int64_t tmp_diff = abs(sum2 - sum);
if (diff > tmp_diff)
diff = tmp_diff;
}
cout << diff;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
ll sum=0;
rep(i,n) sum+=a.at(i);
if(sum%(n*(n+1)/2)!=0){
cout << "NO" << endl;
return 0;
}
ll k=sum/(n*(n+1)/2);
vector<ll> b(n);
rep(i,n-1) b.at(i)=a.at(i+1)-a.at(i);
b.at(n-1)=a.at(0)-a.at(n-1);
rep(i,n){
if(b.at(i)>k || (k-b.at(i))%n!=0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| 0 | 2,070,955 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int N,n,a[500000],id[500000][2],ans=0;
inline bool cmp(int x,int y){
return a[x]<a[y];
}
int main(){
scanf("%d",&N);
n=1<<N;
for(int i=0;i<n;i++) scanf("%d",&a[i]);
a[n]=0;
id[0][0]=0,id[0][1]=n;
for (int i=1;i<n;i++){
id[i][0]=i,id[i][1]=n;
int x[4];
for(int j=0;j<N;j++){
if(i&(1<<j)){
int t=i^(1<<j);
x[0]=id[i][0],x[1]=id[i][1],x[2]=id[t][0],x[3]=id[t][1];
sort(x,x+4,cmp);
id[i][0]=x[3];
if(x[2]==x[3]) id[i][1]=x[1];
else id[i][1]=x[2];
}
}
}
for(int i=1;i<n;i++){
ans=max(ans,a[id[i][0]]+a[id[i][1]]);
printf("%d\n",ans);
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<list>
#include<queue>
#include<limits>
using namespace std;
const int maxn=100001;
const int Max_INF=numeric_limits<int>::max();
int n,m;
int indeg[maxn];
bool visited[maxn];
vector<int> G[maxn];
vector<int> out_put;
void topological_sort_bfs(int s)
{
queue<int> q;
q.push(s);
visited[s]=true;
while(!q.empty())
{
int u=q.front();
q.pop();
out_put.push_back(u);
for(int i=0;i<G[u].size();++i)
{
int v=G[u][i];
indeg[v]--;
if(indeg[v] == 0 && !visited[v])
{
q.push(v);
visited[v]=true;
}
}
}
}
int main()
{
scanf("%d%d",&n,&m);
memset(visited,0,sizeof(visited));
memset(indeg,0,sizeof(indeg));
for(int i=0;i<m;++i)
{
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
indeg[v]++;
}
for(int u=0 ;u < n;++u)
if(indeg[u] == 0 && !visited[u])
topological_sort_bfs(u);
int num=out_put.size();
while(num)
{
printf("%d\n",out_put[out_put.size()-num]);
num--;
}
return 0;
}
| 0 | 2,183,726 |
#include <cstdio>
int main(){
int a, b, c;
scanf("%s %s %s", &a, &b, &c)+1;
if (a == b && b == c) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
|
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define double long double
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e18;
const int mod=1e9+7;
const int M=100005;
main()
{
fast
int n,m,d;
cin>>n>>m>>d;
double lob,hor,ses;
lob=(n-d)*(m-1);
if(d!=0)lob=lob*2.00;
hor=n*n;
ses=lob/hor;
cout<<fixed<<setprecision(15)<<ses<<endl;
return 0;
}
| 0 | 42,362,535 |
#include<iostream>
using namespace std;
long long factorial(long long n){
long long int ans;
if(n==0)
ans=1;
else
ans =n*factorial(n-1);
return ans;
}
int main(){
long long n=0;
cin>>n;
long long int ans=1;
ans=factorial(n);
cout<<ans<<endl;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define MOD 1000000007
#define INF 1e9
#define PIE 3.14159265358979323
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
T GCD(T a, T b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
template <class T>
inline T LCM(T a, T b) {
return (a * b) / GCD(a, b);
}
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
int ans = INF;
while (n) {
chmin(ans, abs(n % 1000 - 753));
n /= 10;
if (n < 100)
break;
}
cout << ans << endl;
}
| 0 | 73,386,199 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, M;
cin >> H >> W >> M;
set<pair<int, int>> targets;
vector<int> hSum(H), wSum(W);
for(int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
targets.insert({x - 1, y - 1});
hSum[x - 1]++;
wSum[y - 1]++;
}
int maxWVal = 0, maxHVal = 0;
vector<int> maxWs, maxHs;
for(int i = 0; i < H; i++) {
if(hSum[i] > maxHVal) {
maxHs.clear();
maxHs.push_back(i);
maxHVal = hSum[i];
} else if(hSum[i] == maxHVal) {
maxHs.push_back(i);
}
}
for(int j = 0; j < W; j++) {
if(wSum[j] > maxWVal) {
maxWs.clear();
maxWs.push_back(j);
maxWVal = wSum[j];
} else if(wSum[j] == maxWVal) {
maxWs.push_back(j);
}
}
int ans = maxWVal + maxHVal - 1;
bool ok = false;
for(int w : maxWs) {
for(int h : maxHs) {
if(targets.find({h, w}) == targets.end()) {
ans += 1;
ok = true;
break;
}
}
if(ok) break;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));
rep(i,H) rep(j,W) {
cin >> s[i][j];
}
vector<vector<int>> dp(H, vector<int>(W));
if (s[0][0] == '#') dp[0][0] = 1;
else dp[0][0] = 0;
rep(i,H) rep(j,W) {
if (i > 0 && j > 0) {
int u, v;
u = dp[i-1][j];
v = dp[i][j-1];
if (s[i-1][j] == '.' && s[i][j] == '#') u++;
if (s[i][j-1] == '.' && s[i][j] == '#') v++;
dp[i][j] = min(u,v);
}
if (i == 0 && j > 0) {
dp[i][j] = dp[i][j-1];
if (s[i][j-1] == '.' && s[i][j] == '#') dp[i][j]++;
}
if (i > 0 && j == 0) {
dp[i][j] = dp[i-1][j];
if (s[i-1][j] == '.' && s[i][j] == '#') dp[i][j]++;
}
}
cout << dp[H-1][W-1] << endl;
}
| 0 | 23,870,414 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll N,ans;
cin>>N;
ll A[N+1];
vector<ll> S;
S.PB(0);
RREP(i,N){
cin>>A[i];
S.PB(S.at(i-1)+A[i]);
}
SORT(S);
ll t=S.at(0),cnt=1;
for(int i=1; i<S.size(); ++i){
if(t!=S.at(i) || i==S.size()-1){
t=S.at(i);
if(i==S.size()-1 && S.at(i)==S.at(i-1)) cnt++;
ans+=cnt*(cnt-1)/2;
cnt=1;
}
else{
cnt++;
}
}
co(ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL N;
string S;
cin >> N >> S;
LL R = count(begin(S), end(S), 'R');
LL ans = 0;
for(auto g=0; g<N; ++g) {
for(auto b=0; b<N; ++b) {
if(S[g] != 'G') continue;
if(S[b] != 'B') continue;
ans += R;
auto d = abs(g-b);
for(auto r: {(g+b)/2, min(g,b)-d, max(g,b)+d}) {
vector<LL> i = {r, g, b};
sort(begin(i), end(i));
if(S[r] != 'R') continue;
if(i[2]-i[1] != i[1]-i[0]) continue;
if(i[0]<0 || N-1<i[2]) continue;
--ans;
}
}
}
cout << ans << endl;
}
| 0 | 46,045,421 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb(n) push_back(n)
#define GSORT(v) sort(v.begin(), v.end(), greater<int>())
#define SORT(v) sort(v.begin(), v.end());
#define REV(v) reverse(v.begin(), v.end());
#define db(a) cout<<#a<<" = "<<a<<endl;
#define FIN freopen("in.txt","r",stdin);
#define FOUT freopen("out.txt","w",stdout);
#define REP(i,n) for(int i = (int)(0); i < (int)(n); i++)
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define MAX 50005
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin>>a>>b>>c>>d;
cout<<max(0, min(b, d) - max(a, c))<<"\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,ll >
#define vps vector< pair< string, string> >
#define vpi vector< pair< int, int> >
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn(i,a,n) for(ll i=a;i<n;i++)
#define forr(i,n,a) for(ll i=n-1;i>=a;i--)
#define scan(arr,a,n) for(int i=(a);i<(n);i++)cin>>(arr)[i];
#define print(arr,a,n) for(int i=(a);i<(n);i++)cout<<(arr)[i]<<' ';
const ll inf = 1e18;
ll add(ll x, ll y) {ll res = x + y; return (res >= mod ? res - mod : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= mod ? res % mod : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + mod : res);}
ll power(ll x, ll y) {ll res = 1; x %= mod; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, mod - 2);}
int main(){
fast;
ll n, m;
cin>>n>>m;
ll mx = max(m/2, n);
if(mx == n){
cout<<m/2<<endl;
} else {
cout<<n +((m/2 - n)/2)<<endl;
}
}
| 0 | 65,915,257 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using ll = unsigned long long int;
using namespace std;
int harshad(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
fastIO;
int x;
cin >> x;
if (x % harshad(x) == 0)
cout << "Yes";
else
cout << "No";
}
|
#pragma GCC optimize ("trapv")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
vector< string > ss(n);
map< vector<ll>, ll> mp1;
for (auto& e:ss) {
vector<ll> freq(26);
cin >> e;
for(auto& f:e) {
freq[(f-'a')]++;
}
mp1[freq]++;
}
ll ans = 0;
for(auto& e:mp1) {
if (e.second > 1) {
ll v = e.second;
ans += (v*(v-1))/2;
}
}
cout << ans << '\n';
return 0;
}
| 0 | 76,292,178 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
s.erase(unique(s.begin(), s.end()), s.end());
cout << s.size()-1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
while (cin >> n, n) {
vector<ll> v(n); cin >> v;
ll ans = linf;
rep(i, n) rep(j, i+1, n) chmin(ans, abs(v[i]-v[j]));
cout << ans << endl;
}
}
| 0 | 30,731,456 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k; cin >> n >> k;
ll const mod = 1000000007;
ll ans = 0;
for (ll i = k; i <= n + 1; i++) {
ll ans1 = i * (2 * n - i + 1) / 2;
ll ans2 = (i - 1) * i / 2;
ll ans3 = ans1 - ans2 + 1;
ans = (ans + ans3) % mod;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
int ctoi(char c) {
switch (c) {
case '0': return 0; case '1': return 1; case '2': return 2;
case '3': return 3; case '4': return 4; case '5': return 5;
case '6': return 6; case '7': return 7; case '8': return 8;
case '9': return 9; default: return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
return firstElof.second < secondElof.second;
}
ll nod(ll F) { return log10(F) + 1; }
ll i, j, k, l, m, n; ll N, M, K, H, W, L; string S;
ll MOD = 1000000007; ll ans = 1; ll INF = 9999999999999;
vl flag, color; vll path;
int main() {
string L;
cin >> L;
N = L.length();
vl A(N);
for (i = 0; i < N; i++) {
A[i] = ctoi(L[i]);
}
vll dp(N + 1, vl(2,0));
for (i = 0; i < N + 1; i++) {
for (j = 0; j < 2; j++) {
dp[i][k] = 0;
}
}
dp[0][0] = 1;
for (i = 0; i < N; i++) {
for (ll smaller = 0; smaller < 2; smaller++) {
for (ll x = 0; x <= (smaller ? 1 : A[i]); x++) {
if (!smaller && x > A[i]) {
dp[i + 1][smaller || x < A[i]] = 0;
}
else {
dp[i + 1][smaller || x < A[i]] = (dp[i + 1][smaller || x < A[i]] + (dp[i][smaller]) * (x + 1)) % MOD;
}
}
}
}
cout << (dp[N][0] + dp[N][1])%MOD;
}
| 0 | 38,859,228 |
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], * ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) { fread(cn, 1, cm, stdin); ci = cn; }
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm) while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
else while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';
return A;
}
const int dm = 1 << 22;
char dn[dm], * di = dn;
char C[10];
int keta = 0;
inline void putint(int X) {
keta = 0;
while (X) {
*(C + keta) = '0' + X % 10;
X /= 10;
keta++;
}
for (int i = keta - 1; i >= 0; i--)* di++ = (*(C + i));
*di++ = '\n';
}
inline void putmae() {
for (int i = keta - 1; i >= 0; i--)* di++ = (*(C + i));
*di++ = '\n';
}
int main() {
int N = getint();
int n = 1 << N;
int dp1[1 << 18], dp2[1 << 18];
rep(i, n) {
dp1[i] = getint();
dp2[i] = 0;
}
rep(k, N) {
int m = 1 << k;
int m1 = n - 1 << k;
int m2 = ~m1;
for (int p = (n >> 1) - 1; p >= 0; p--) {
int j = ((p & m1) << 1) + (p & m2);
int i = j | m;
int k = min(dp1[i], dp1[j]);
dp1[i] = max(dp1[i], dp1[j]);
dp2[i] = max(dp2[i], k);
dp2[i] = max(dp2[i], dp2[j]);
}
}
int saidai = 0;
rep1(i, n - 1) {
if (saidai < dp1[i] + dp2[i]) {
saidai = dp1[i] + dp2[i];
putint(saidai);
}
else putmae();
}
fwrite(dn, 1, di - dn, stdout);
Would you please return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i)=(n); (i)<(m); ++i)
constexpr ll INF = 1LL << 62;
constexpr int mod = 1e9+7;
int main(){
int K, N;
cin >> N >> K;
vector<ll> x(N), y(N), px(N), py(N);
REP(i, N){
cin >> x[i] >> y[i];
px[i] = x[i], py[i] = y[i];
}
sort(px.begin(), px.end());
sort(py.begin(), py.end());
REP(i, N){
auto itr = lower_bound(px.begin(), px.end(), x[i]);
x[i] = itr-px.begin()+1;
itr = lower_bound(py.begin(), py.end(), y[i]);
y[i] = itr-py.begin()+1;
}
vector<vector<ll>> sum(N+1, vector<ll>(N+1, 0));
REP(i, N){
sum[y[i]][x[i]]++;
}
REP(i, N+1){
REP(j, N){
sum[i][j+1] += sum[i][j];
}
}
REP(j, N+1){
REP(i, N){
sum[i+1][j] += sum[i][j];
}
}
ll ans = INF;
REP(i, N+1){
FOR(j, i+1, N+1){
REP(k, N+1){
FOR(l, k+1, N+1){
ll v = sum[j][l] - sum[j][k] - sum[i][l] + sum[i][k];
if(v >= K){
ll u = j-1, b = i, left = l-1, right = k;
u = py[u], b = py[b], left = px[left], right = px[right];
ll S = (u-b) * (left-right);
ans = min(ans, S);
}
}
}
}
}
cout << ans << endl;
return 0;
}
| 0 | 41,272,750 |
#include<bits/stdc++.h>
using namespace std;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<lli, lli> pi;
int main()
{
int n, m;
cin >> n >> m;
priority_queue<lli>pq;
vector<pi> v;
for(int i=0; i<n; i++){
lli a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
int j=0;
lli ans = 0;
for(int i=1; i<=m; i++){
while(j<n && v[j].first <= i){
pq.push(v[j].second);
j++;
}
if(!pq.empty()){
ans += pq.top();
pq.pop();
}
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <queue>
using namespace std;
int c[101][102],ch[101];
queue<int> q;
int main(){
int a,b,e,d,n,k;
cin>>a;
for(int i=1;i<=a;i++)ch[i]=-1;
for(int i=0;i<a;i++){
cin>>b>>e;
c[b][0]=e;
for(int j=1;j<=e;j++){
cin>>d;
c[b][j]=d;
}
}
q.push(1);
ch[1]=0;
while(q.size()){
n=q.front();q.pop();
for(int i=1;i<=c[n][0];i++){
if(ch[c[n][i]]==-1){
q.push(c[n][i]);
ch[c[n][i]]=ch[n]+1;
}
}
}
for(int i=1;i<=a;i++)cout<<i<<" "<<ch[i]<<endl;
return 0;
}
| 0 | 85,480,231 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans=0, x, y;
cin >> n;
vector<long long> a(n);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
queue<long long> q;
for(int i=0; i<n-1; i++) {
if(a[i]==a[i+1]) {
q.push(a[i]);
i++;
}
}
if(q.size()>=2) {
x=q.front();
q.pop();
y=q.front();
ans=x*y;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
int ans = 0, a = 0, b = 0, ab = 0;
for (string st : s) {
REP(i, st.size() - 1) {
if (st[i] == 'A' && st[i+1] == 'B') ans++;
}
if (st[0] == 'B' && st[st.size() - 1] == 'A') ab++;
else if (st[0] == 'B') b++;
else if (st[st.size() - 1] == 'A') a++;
}
if (ab == 0) ans += min(a, b);
else if (a == 0 && b == 0) ans += ab - 1;
else if (a == 0 || b == 0) ans += ab;
else ans += ab + 1 + min(a - 1, b - 1);
cout << ans << endl;
}
| 0 | 72,294,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
const long long INF = 1LL<<60;
ll gcd(ll a,ll b){
if(b == 0) return a;
else return gcd(b,a%b);
}
ll lcm(ll a, ll b){
ll g = gcd(a, b);
return (a / g) * b;
}
using Edge = pair<int,int>;
using Graph = vector<vector<Edge> >;
int main() {
int n,k,ans;
cin >> n >> k;
if(k == 1) ans = 0;
else ans = n-k;
cout << ans << endl;
return 0;
}
|
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...) 42
#define eprintf(...) 42
#endif
#define PI 3.1415926535897932384626433832795
#define INF 2e9
#define SINV(t) greater<t>()
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##_len; ++i)
#define FOREACH(i, v) for(const auto& i : v)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef long long ll;
#define vv(t) vector< t >
#define CHC(mp, x) if(mp.end() != mp.find(x))
#define CHCV(mp, x) if(mp.end() != find(ALL(mp), x))
template<typename T>
inline T lcm(T a, T b) {return a / __gcd(a, b) * b;}
#pragma endregion
template<typename T>
void SV(vector<T> v){
#ifdef LOCAL
REP(i,v.size()){
cout << i << " : " << v[i] << endl;
}
#endif
}
template<typename T>
void SV(map<int, T> v){
#ifdef LOCAL
FOREACH(i, v){
cout << i.first << " : " << i.second << endl;
}
#endif
}
int bitCount(int bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >> 16);
}
int main(void){
int n=0;
cin >> n;
map<int, int> odd, even;
odd[0]=0, even[0]=0;
REP(i, n){
int v;
cin >> v;
if(i%2){
CHC(odd, v){}
else{
odd[v]=0;
}
odd[v]++;
}else{
CHC(even, v){}
else{
even[v]=0;
}
even[v]++;
}
}
int maxodd=0, maxeven=0;
int secondodd=0, secondeven=0;
FOREACH(i, odd){
if(odd[maxodd]<i.second){
secondodd=maxodd;
maxodd=i.first;
}else if(odd[secondodd]<i.second){
secondodd=i.first;
}
}
FOREACH(i, even){
if(even[maxeven]<i.second){
secondeven=maxeven;
maxeven=i.first;
}else if(even[secondeven]<i.second){
secondeven=i.first;
}
}
debug(maxodd, secondeven, maxeven, secondeven);
debug(even[maxeven]-even[secondeven], odd[maxodd]-odd[secondodd]);
if(maxeven==maxodd){
if(even[maxeven]-even[secondeven]>odd[maxodd]-odd[secondodd]){
maxodd=secondodd;
}else{
maxeven=secondeven;
}
}
cout << (n-even[maxeven]-odd[maxodd]) << endl;
return 0;
}
| 0 | 99,536,088 |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define fo(i, n) for(int i=0; i<n; i++)
#define Fo(i, k, n) for(int i=k; i<n; i++)
#define w(x) int x; cin>>x; while(x--)
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define watch3(x,y,z) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<"\n"
#define watch4(x,y,z,q) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<" and "<<(#q)<<" is "<<(q)<<"\n"
#define MOD 1000000007
#define INF 1000000007;
#define F first
#define S second
#define pb(x) push_back(x);
#define ll long long
#define all(c) (c).begin(),(c).end()
#define endl "\n"
typedef vector<int> vl;
typedef vector< vl > vvl;
typedef pair< int, int> pll;
typedef map< int, int> mll;
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void c_p_c()
{
#ifndef ONLINE_JUDGE
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void parray(int a[],int n){
for(int i=0;i<n;i++){
cout<<a[i]<<" ";
}
cout<<endl;
}
int disum(int n){
int sum=0;
while(n){
sum+=n%10;
n/=10;
}
return sum;
}
int main() {
int i,n,m,k,c=0,sum=0;
c_p_c();
string s,t;
cin>>s>>t;
int p=0;
for (int i = 0; i < s.size(); ++i)
{
if(s==t){
p=1;
break;
}
rotate(s.begin(), s.begin() + 1, s.end());
}
if(p==1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define MP make_pair
#define MT make_tuple
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
ll POW(ll x,ll n){
x%=MOD;
if(n==0)return 1;
if(n%2==0)return POW(x*x,n/2)%MOD;
return x%MOD*POW(x,n-1)%MOD;
}
ll POW2(ll x,ll n){
if(n==0)return 1;
if(n%2==0)return POW2(x*x,n/2);
return x*POW2(x,n-1);
}
ll POW3(ll x,ll n,ll m){
x%=m;
if(n==0)return 1;
if(n%2==0)return POW3(x*x,n/2,m)%m;
return x*POW3(x,n-1,m)%m;
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v; u = v; v = r;
}
return u;
}
ll lcm(ll u, ll v) {
return u/gcd(u,v)*v;
}
ll KAI(ll m)
{
if(m<0) return 0;
if(m==0) return 1;
return m*KAI(m-1)%MOD;
}
ll KAI2(ll m)
{
if(m<0) return 0;
if(m==0) return 1;
return m*KAI2(m-1);
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a%b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) {
return (a % m + m) % m;
}
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m,ll n)
{
if(m<n) return 0;
if(n<0) return 0;
if(n==0) return 1;
if(m==n) return 1;
return KAI(m)%MOD*modinv(KAI(n)%MOD*KAI(m-n)%MOD)%MOD;
}
ll COM2(ll m,ll n)
{
if(m<n) return 0;
if(n<0) return 0;
if(n==0) return 1;
if(m==n) return 1;
return KAI2(m)/KAI2(n)/KAI2(m-n);
}
ll DEC(ll x,ll m,ll n)
{
return x%POW2(m,n+1)/POW2(m,n);
}
ll keta(ll x,ll n)
{
if(x==0)return 0;
return keta(x/n,n)+1;
}
ll DIV(ll x,ll n)
{
if(x==0)return 0;
return x/n+DIV(x/n,n);
}
ll ORD(ll x,ll n)
{
if(x==0)return INF;
if(x%n!=0)return 0;
return 1+ORD(x/n,n);
}
ll SUP(ll x,ll n)
{
if(x==0)return 0;
if(x%n!=0)return x;
return SUP(x/n,n);
}
ll SGS(ll x,ll y, ll m)
{
if(y==0)return 0;
if(y%2==0){
return (1+POW3(x,y/2,m))*SGS(x,y/2,m)%m;
}
return (1+x*SGS(x,y-1,m))%m;
}
ll SSGS(ll x,ll y,ll m)
{
if(y==0)return 0;
if(y==1)return 1;
if(y%2==0){
return (SSGS(x,y/2,m)*(POW3(x,y/2,m)+1)%m+SGS(x,y/2,m)*y/2%m)%m;
}
return (SSGS(x,y-1,m)*x%m+y)%m;
}
void shuffle(ll array[], ll size) {
for(ll i = 0; i < size; i++) {
ll j = rand()%size;
ll t = array[i];
array[i] = array[j];
array[j] = t;
}
}
ll SQRT(ll n){
ll ok,ng,mid;
ng=n+1;
if(303700500<ng)ng=303700500;
ok=0;
while(abs(ok-ng)>1){
mid=(ok+ng)/2;
if(mid*mid<=n){
ok=mid;
}
else{
ng=mid;
}
}
return ok;
}
struct UnionFind
{
vector<int> par;
vector<int> sizes;
UnionFind(int n) : par(n), sizes(n, 1) {
rep(i,n) par[i] = i;
}
int find(int x) {
if (x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (sizes[x] < sizes[y]) swap(x, y);
par[y] = x;
sizes[x] += sizes[y];
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return sizes[find(x)];
}
};
map< int64_t, int > prime_factor(int64_t n) {
map< int64_t, int > ret;
for(int64_t i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
bool is_prime(int64_t x) {
if(x==1)return false;
for(int64_t i = 2; i * i <= x; i++) {
if(x % i == 0) return false;
}
return true;
}
struct edge{ll to, cost;};
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<LP,vector<LP>, greater<LP> > que;
que.push(LP(0,s));
while(!que.empty()){
LP p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(LP(d[e.to],e.to));
}
}
}
}
};
ll d[300][300];
void warshall_floyd(ll n){
rep(i,n)rep(j,n)rep(k,n)d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
}
struct bit{
ll m;
vector<ll> b;
bit(ll i){
m=i;
b.resize(m+1);
}
ll num(ll i){
return b[i];
}
ll sum(ll i){
ll s=0;
while(i>0){
s+=b[i];
i-=i&-i;
}
return s;
}
void add(ll i, ll x){
while(i<=m){
b[i]+=x;
i+=i&-i;
}
}
};
int main(){
ll n,k,h[310]={},dp[310][1000][3],o=0;
cin >> n >> k;
rep(i,n)cin >> h[i+1];
rep(i,n+1)rep(j,k+1)rep(l,2)dp[i][j][l]=INF;
dp[0][0][1]=0;
rep(i,n){
rep(j,k+1){
rep(l,i+1)dp[i+1][j+i+1-l][0]=min(dp[l][j][1],dp[i+1][j+i+1-l][0]);
rep(l,i+1){
dp[i+1][j+i-l][1]=min(dp[l][j][1]+max(h[i+1]-h[l],o),dp[i+1][j+i-l][1]);
}
}
}
printf("%lld",min(dp[n][k][0],dp[n][k][1]));
}
| 0 | 42,770,612 |
#include <bits/stdc++.h>
using namespace std;
int isp(int x) {
for (int i = 2; i * i < x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
int n;
int d, x;
cin >> n >> d >> x;
for(int i = 0 ; i < n ; i++){
int a;
cin >> a;
x += (d+a-1) / a;
}
cout << x << endl;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,M,count=0;
cin>>N;
vector<string> s(N);
for(int i=0;i<N;++i)cin>>s[i];
cin>>M;
vector<string> t(M);
for(int i=0;i<M;++i)cin>>t[i];
auto calc=[&](string find){
int buf=0;
for(string word:s){
if(word==find)buf++;
}
for(string word:t){
if(word==find)buf--;
}
return buf;
};
for(string word : s ){
count=max(count,calc(word));
}
cout<<count;
}
| 0 | 13,480,279 |
#include<bits/stdc++.h>
#include<cstdlib>
using namespace std;
#define ll long long
#define in(x) scanf("%d",&x);
#define out(x) printf("%d",x);
#define ins(x) scanf("%s",x);
#define outs(x) printf("%s",x);
#define lin puts("");
#define _ putchar(' ');
int t;
ll i, j;
ll n, k , p, q, d, m, c, c1, c2, d1,x;
ll mx = LLONG_MIN, mn = LLONG_MAX;
char s[6], s1, s2;
ll a [1000001], b [200001] , mox [200001];
map <int, int > mp;
vector <vector<ll>> vc;
vector <ll> v;
set <ll> st;
bool r;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
t = 1;
while (t--) {
cin>>n>>k;
for(i=n;i<=k;i++){
sprintf(s,"%d",i);
for(j=0;j<=2;j++){
if (s[j]!=s[5-j-1])
{
break;
}
}
if(j==3){
c++;
}
}
cout<<c<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int s,x,z,a;
int main(){
cin>>x>>a>>z;
s=a+x;
if((a<=500)&&(a>=1)&&(x>=1)&&(x<=500)){
if(s>=z){
cout<<"Yes";
} else {
cout << "No";
}
}
else{
cout<<"you can't buy";
}
return 0;
}
| 0 | 72,562,819 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; ++i){
cin >> a[i];
}
int mn = *min_element(a.begin(), a.end());
int mx = *max_element(a.begin(), a.end());
int ans = 99999999;
for(int i=mn; i<=mx; ++i){
int st=0;
for(int j=0; j<n; ++j){
st += (a[j]-i) * (a[j]-i);
}
ans = min(ans, st);
}
cout << ans;
return 0;
}
|
#include<iostream>
#define ll long long
using namespace std;
ll n,y;
int main(){
cin >> n >> y;
bool f = false;
for(int a=0;a <= 2000;a++){
for(int b=0;b <= 2000;b++){
int c = n - a - b;
if(y == 10000*a + 5000*b + 1000*c && c >= 0){
cout << a << " " << b << " " << c << endl;
f = true;
break;
}
}
if(f) break;
}
if(!f) cout << -1 << " " << -1 << " " << -1 << endl;
return 0;
}
| 0 | 56,313,622 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int count_1=0,count_2=0,count_3=0;
int i;
for(i=0;i<3;i++){
if(s.at(i)=='a'){
count_1++;
}
if(s.at(i)=='b'){
count_2++;
}
if(s.at(i)=='c'){
count_3++;
}
}
if(count_1==count_2 && count_1==count_3){
cout << "Yes";
}else{
cout << "No";
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> D(N);
for (int i=0;i<N;i++){
cin >> D[i];
}
if (D[0] != 0) {
cout << 0 << "\n";
return 0;
}
for (int i=1;i<N;i++){
if (D[i] <= 0) {
cout << 0 << "\n";
return 0;
}
}
vector<int> num(N);
int mx = 0;
for (int i=0;i<N;i++) {
num[D[i]]++;
if (D[i] > mx) mx = D[i];
}
ll ans = 1;
for (int i=1;i<=mx;i++){
for (int j=0;j<num[i];j++){
ans *= num[i-1];
ans %= MOD;
}
}
cout << ans << "\n";
}
| 0 | 53,804,261 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if (N == 0){
cout << 2 <<endl;
return 0;
}else if (N == 1){
cout << 1 << endl;
return 0;
}
int64_t t0 = 2;
int64_t t1 = 1;
int64_t t2;
for (int i; i < N - 1; i++){
t2 = t0 + t1;
t0 = t1;
t1 = t2;
}
cout << t2 << endl;
}
|
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<P> red(N), blue(N);
rep(i,N) cin >> red[i].first >> red[i].second;
rep(i,N) cin >> blue[i].first >> blue[i].second;
vector<pair<int, P>> pairs;
sort(red.begin(), red.end(), [](const P& x, const P& y) {return x.second > y.second;});
sort(blue.begin(), blue.end(), [](const P& x, const P& y) {return x.first < y.first;});
vector<bool> r(N, false);
int count = 0;
rep(i,N) {
rep(j,N) {
if (!r[j] && blue[i].first > red[j].first && blue[i].second > red[j].second) {
count++;
r[j] = true;
break;
}
}
}
cout << count << endl;
}
| 0 | 5,996,079 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
ll ans = 0;
h = min(h, q*2);
s = min(s, 2*h);
if(2*s < d){
ans = n * s;
}else{
if(n % 2 == 0){
ans = n * d / 2;
}else{
ans = (n-1) * d / 2+ s;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m, h[100001], ma[100001];
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] = 0;
}
for(int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for(int i = 1; i <= n; i++) {
ans += h[i] > ma[i];
}
cout << ans << endl;
return 0;
}
| 0 | 83,104,522 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
const double pi = acos(-1);
typedef long long ll;
int main()
{
ll a,b,x;
cin>>a>>b>>x;
if(a<=x && b>=(x-a))
cout<<"YES\n";
else
cout<<"NO\n";
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; if(i!=num-1) cout<<" ";}
cout << endl;
}
template <typename T>
void print_pairvec(const vector<T> &v, int num=0){
if(num == 0) num = (int)v.size();
cout << endl;
for(int i=0; i<num; i++){ cout << v[i].first << " " << v[i].second << endl;}
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for(int i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(int i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(int j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";
}
cout << "\x1B[0m" << endl;
}
}
int main(){
ll N;
cin >> N;
vector<ll> C(N-1), S(N-1), F(N-1);
for(int i=0; i<N-1; i++) cin >> C[i] >> S[i] >> F[i];
S.push_back(0);
for(int i=0; i<N; i++){
ll time = 0;
for(int now=i; now<N-1; now++){
ll num = max(time-S[now], (ll)0);
ll start_time = S[now] + (num + F[now] - 1)/F[now]*F[now];
time = start_time + C[now];
}
cout << time << endl;
}
return 0;
}
| 0 | 63,430,219 |
#include<bits/stdc++.h>
#define INF 1e12
using namespace std;
typedef long long int ll;
int main()
{
int N,M; cin >> N >> M;
vector<vector<bool>>G(N,vector<bool>(N,false));
for(int i = 0; i < M; i++)
{
int a,b; cin >> a >> b;
G[a-1][b-1] = true;
G[b-1][a-1] = true;
}
vector<int>V(N);
for(int i = 0; i < N; i++) V[i] = i;
int ans = 0;
do
{
bool f = true;
for(int i = 0; i < N-1; i++)
{
if(G[V[i]][V[i+1]] == false) f = false;
}
if(f) ans++;
}while(next_permutation(V.begin()+1,V.end()));
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
namespace BasicMath {
static Int Max(const Int a, const Int b);
Int Max(const Int a, const Int b) {
if (a >= b) {
return a;
} else {
return b;
}
}
}
using namespace BasicMath;
int main(void) {
Int n;
cin >> n;
VI h(n);
for (Int i = 0; i < n; ++i) {
cin >> h[i];
}
Int max_value = 0;
for (Int i = 0; i < n; ++i) {
max_value = Max(h[i], max_value);
}
h.push_back(-1);
Int result = 0;
for (Int i = 0; i < max_value; ++i) {
for (Int j = 0; j < n; ++j) {
if (h[j] > i) {
} else {
continue;
}
while (h[j] > i) {
++j;
}
result++;
}
}
cout << result << endl;
}
| 0 | 38,337,302 |
#include "bits/stdc++.h"
using namespace std;
struct Solver {
Solver() {
ios::sync_with_stdio( false );
cout << fixed << setprecision( 10 );
}
void solve() {
int N, H, W;
cin >> N >> H >> W;
int ans = 0;
for( int i = 0; i < N; ++i ) {
int a, b;
cin >> a >> b;
ans += a >= H && b >= W;
}
cout << ans << endl;
}
};
int main() {
Solver().solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).begin(), (s).end()
#define SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int r,g,b,n;
cin>>r>>g>>b>>n;
ll cnt=0;
REP(i,n/r+1)REP(j,n/g+1)
{
if((n-i*r-j*g)%b==0 && n-i*r-j*g>=0)
{
cnt++;
}
}
cout<<cnt<<endl;
return 0;
}
| 0 | 47,089,861 |
#include<stdio.h>
int main(void){
double f=0.0;
int a = 0, b = 0,d = 0, r = 0;
scanf("%d", &a);
scanf("%d", &b);
d = a / b;
r = a%b;
f = double(a) / double(b);
printf("%d %d %.5f\n", d, r, f);
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define rep(i, n)for(int i=0; i<n; i++)
int hy[] = {0, 1, 0, -1};
int wx[] = {1, 0, -1, 0};
int H, W;
bool closed(int x, int y){
bool flag = true;
if(x<0 || W<=x)
flag = false;
if(y<0 || H<=y)
flag = false;
return flag;
}
int main(){
cin >> H >> W;
char s[H][W];
rep(i, H)
rep(j, W)
cin >> s[i][j];
bool flag;
rep(i, H){
rep(j, W){
if(s[i][j] == '.')
continue;
flag = false;
rep(k, 4){
if(closed(j+wx[k], i+hy[k]) ){
if(s[i+hy[k] ][j+wx[k] ] == '#'){
flag = true;
}
}
}
if(!flag){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0 | 63,380,364 |
#include<iostream>
using namespace std;
int main() {
int N, M, X, Y; cin >> N >> M >> X >> Y;
int x[N];
for (int i = 0; i < N; i++) {
cin >> x[i];
}
int y[M];
for (int i = 0; i < M; i++) {
cin >> y[i];
}
for (int i = X + 1; i <= Y; i++) {
bool willStartWar = false;
for (int j = 0; j < N; j++) {
if (x[j] >= i) {
willStartWar = true;
}
}
for (int k = 0; k < M; k++) {
if (y[k] < i) {
willStartWar = true;
}
}
if (!willStartWar) {
cout << "No War" << endl;
return 0;
}
}
cout << "War" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> ll llpow(ll x,T n){ll ans=1;if(x==0)ans=0;while(n){if(n&1)ans*=x;x*=x;n>>=1;}return ans;}
long long modpow(long long a, long long n, long long mod) {long long res = 1;while (n > 0) {if (n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}
template<class T> inline T gcd(T x,T y){if(y==0)return x; else {return gcd(y,x%y);}}
template<class T> inline T lcm(T x,T y){return x/gcd(x,y)*y;}
long long modinv(long long a, long long m) {long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
#define rep(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
#define irep(i, end_i, begin_i) for (ll i = (ll)begin_i-1; i >= (ll)end_i; i--)
long long INF = 1LL<<60;
int main( ){
int n;
cin>>n;
vpii r(n);
vpii b(n);
rep(i,0,n){
int a,b;
cin>>a>>b;
r[i].first=b;
r[i].second=a;
}
rep(i,0,n){
int x,y;
cin>>y>>x;
b[i].first=y;
b[i].second=x;
}
sort(r.begin(),r.end());
sort(b.begin(),b.end());
vb rused(n,false);
int ans=0;
rep(bi,0,n){
ll alt=-1;
rep(ai,0,n){
if(!rused[ai]&&b[bi].first>r[ai].second&&b[bi].second>r[ai].first){
chmax(alt,ai);
}
}
if(alt!=-1)rused[alt]=true,ans++;
}
cout<<ans<<endl;
return 0;
}
| 0 | 33,031,164 |
#include<stdio.h>
#include<string.h>
int main(){
int A,B;
char S[15],T[15],U[15];
scanf("%s %s",&S,&T);
scanf("%d %d",&A,&B);
getchar();
scanf("%s",&U);
if( strcmp(S,U)==0){
A--;
}
else {
B--;
}
printf("%d %d",A,B);
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
static const int MOD = 1000000007;
static const int MAXN = 100000 + 10;
LL factors[MAXN];
LL power(LL base, int n) {
LL cur = base;
LL ret = 1;
while (n) {
if (n & 1) {
ret *= cur;
ret %= MOD;
}
cur *= cur;
cur %= MOD;
n = n >> 1;
}
return ret;
}
LL combine(int n, int k) {
LL ret = 1;
ret *= factors[n];
ret *= power(factors[k], MOD-2);
ret %= MOD;
ret *= power(factors[n-k], MOD-2);
ret %= MOD;
return ret;
}
LL compute(int n, int k, int d) {
if (k == 1) return n;
if (k == n+1) return 1;
LL ret = combine(n+1, k);
if (n-d >= k) ret -= combine(n-1-d, k-1);
if (ret < 0) ret += MOD;
return ret;
}
int main() {
int n;
scanf("%d", &n);
factors[0] = 1;
for (int i = 1; i <= n+1; i++) {
factors[i] = factors[i-1]*i;
factors[i] %= MOD;
}
vector<LL> nums(n+1, 0);
LL cnt = 0;
for (int i = 0; i <= n; i++) {
scanf("%lld", &nums[i]);
cnt += nums[i];
}
LL tmp = n;
tmp = (tmp + 1) * tmp;
LL dupitem = cnt - (tmp >> 1);
vector<int> dupos;
for (int i = 0; i <= n; i++) {
if (nums[i] == dupitem) dupos.push_back(i);
if (dupos.size() == 2) break;
}
int d = dupos[1] - dupos[0] - 1;
for (int k = 1; k <= n+1; k++) {
cout << compute(n, k, d) << endl;
}
}
| 0 | 39,364,019 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll cnt = 0;
for (ll i = k; i <= n + 1; i++) {
cnt += (i * (n - i + 1) + 1) % MOD;
}
cout << cnt % MOD << endl;
return 0;
}
|
#include <string>
#include <iostream>
using namespace std;
int main() {
int N; string S; bool t = true; cin >> N >> S;
if (N % 2 == 1) t = false;
else for (int i = 0; i < (N / 2); i++) {
if (S[i] != S[(N / 2) + i]) {
t = false;
break;
}
}
if (t) cout << "Yes";
else cout << "No";
cout << endl;
}
| 0 | 31,056,872 |
#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;
cin >> N;
set<int> as;
F0R(i, N) {
int a;
cin >> a;
as.insert(a);
}
while (as.size() > 1) {
set<int> bs;
int a = -1;
for (auto n : as) {
if (a < 0) a = n;
else {
int b = n % a;
if (b) bs.insert(b);
}
}
bs.insert(a);
as = move(bs);
}
cout << *as.begin();
}
#endif
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n_min, n_max;
while (cin >> m >> n_min >> n_max, m | n_min | n_max) {
vector<int> a(m);
for (int i = 0; i < m; ++i) {
cin >> a[i];
}
int ans = 0;
int gap = 0;
for (int k = n_min; k <= n_max; ++k) {
if (a[k - 1] - a[k] >= gap) {
gap = a[k - 1] - a[k];
ans = k;
}
}
cout << ans << endl;
}
return 0;
}
| 0 | 44,162,919 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Z, W;
cin >> N >> Z >> W;
vector<int> a(N);
vector<int> x(N, 1000000005);
vector<int> y(N);
for(int i = 0; i < N; i++) cin >> a[i];
for(int i = N - 2; i >= 0; i--) {
for(int j = i + 1; j < N - 1; j++) {
x[i] = min(x[i], y[j]);
}
x[i] = min(x[i], abs(a[i] - a[N - 1]));
for(int j = i + 1; j < N - 1; j++) {
y[i] = max(y[i], x[j]);
}
y[i] = max(y[i], abs(a[i] - a[N - 1]));
}
x[N - 1] = abs(a[N - 1] - W);
cout << *max_element(x.begin(), x.end()) << endl;
}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string.h>
#define s(n) scanf("%d",&n)
#define sc(n) scanf("%c",&n)
#define sl(n) scanf("%I64d",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define INF (int)1e9
#define EPS 1e-9
#define bitcount __builtin_popcount
#define gcd __gcd
#define forall(i,a,b) for(int i=a;i<b;i++)
#define foreach(v, c) for( typeof( (c).begin()) v = (c).begin(); v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define pb push_back
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define mp make_pair
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<string> a,b;
for(int i = 0;i<n;i++)
{
string str;cin>>str;
a.push_back(str);
}
for(int i = 0;i<m;i++)
{
string str;cin>>str;
b.push_back(str);
}
if(m > n)
{
cout<<"No"<<endl;
}
else
{
bool ans = false;
for(int i = 0;i<=n-m;i++)
{
for(int j = 0;j<=n-m;j++)
{
bool is = true;
for(int l = 0;l<m;l++)
{
for(int x = 0;x<m;x++)
{
if(a[i+l][j+x] != b[l][x]) is = false;
}
}
ans|=is;
}
}
if(ans) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
| 0 | 7,869,740 |
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <cfenv>
#include <cinttypes>
#include <cstdint>
#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 <chrono>
#include <forward_list>
#include <initializer_list>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#if __cplusplus >= 201402L
#include <shared_mutex>
#endif
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
ll gcd(ll x,ll y){
x = x%y;
return x == 0 ? y : gcd(y,x);
}
ll lcm(ll x, ll y){
return x*y/gcd(x,y);
}
int main(){
int n;
cin >> n;
priority_queue<int> q;
vector<int> a(n);
rep(i,n) {
cin >> a[i];
q.push(a[i]);
}
rep(i,n){
int t = q.top();
if(t == a[i]){
q.pop();
cout << q.top() << endl;
q.push(t);
}else{
cout << t << endl;
}
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define MAX 512
int main(void){
char words[MAX][33];
int wcnt=0;
int f[MAX], len[MAX];
char word[33];
int longest, mostf;
while (scanf("%s", word)!=EOF){
int wid=-1;
for (int i=0; i<wcnt; i++){
if (strcmp(word, words[i])==0){
wid = i;
}
}
if (wid==-1){
strcpy(words[wcnt], word);
len[wcnt] = strlen(word);
f[wcnt] = 1;
wcnt++;
} else {
f[wid]++;
}
}
longest = mostf = 0;
for (int i=0; i<wcnt; i++){
if (len[longest] < len[i]) longest = i;
if (f[mostf] < f[i]) mostf = i;
}
printf("%s %s\n", words[mostf], words[longest]);
return 0;
}
| 0 | 31,633,211 |
# include <iostream>
# include <math.h>
using namespace std;
int main()
{
int N, M, sum = 0;
int* A;
cin >> N >> M;
A = new int[M];
for (int i = 0; i < M; i++)
{
cin >> A[i];
sum += A[i];
}
int rest = N - sum;
if (rest < 0)
cout << "-1";
else
cout << rest;
return 0;
}
|
#include <iostream>
#include <climits>
using namespace std;
int main() {
int coin[] = {1,5,10,50,100,500};
int dp[1000];
fill_n(dp, 1000, INT_MAX);
dp[0] = 0;
for (int i=1; i<1000; ++i) {
for (int j=0; j<6; ++j) {
if (i - coin[j] >= 0) {
dp[i] = min(dp[i], dp[i-coin[j]]+1);
}
}
}
int n;
while (cin >> n && n!=0) {
cout << dp[1000-n] << endl;
}
return 0;
}
| 0 | 15,321,936 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a<=c){
if(c<=b){
puts("Yes");
return 0;
}
}
puts("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;
#define ld long double
#define mp(a,b) make_pair(a,b)
int main(){
int64_t n;
cin>>n;
int64_t ans=0;
set<int64_t> s;
s.insert(1);
s.insert(n);
for(int64_t i=2;i*i<=n;i++){
if(n%i==0){
s.insert(i);
s.insert(n/i);
}
}
for(auto c:s){
int64_t x = c;
int64_t m = n/c-1;
if(m>x) ans += m;
}
cout<<ans<<endl;
}
| 0 | 15,253,966 |
#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>;
int main() {
ll h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
auto is_range = [&](int x, int y) {
return (0 <= x) && (x < h) && (0 <= y) && (y < w);
};
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {-1, 1, 0, 0};
vector<vector<int>> d(h, vector<int>(w, -1));
queue<P> q;
rep(i, h) rep(j, w) {
if (s[i][j] == '#') {
q.push(P(i, j));
d[i][j] = 0;
}
}
while (!q.empty()) {
int cx = q.front().first, cy = q.front().second;
q.pop();
rep(i, 4) {
int nx = cx + dx[i], ny = cy + dy[i];
if (is_range(nx, ny) && d[nx][ny] == -1) {
d[nx][ny] = d[cx][cy] + 1;
q.push(P(nx, ny));
}
}
}
int ans = 0;
rep(i, h) rep(j, w) ans = max(ans, d[i][j]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
static const int INF (1<<30);
ll get_min(ll h, ll w) {
ll y = INF;
for (int x = 1; x <= w-2; x++) {
ll s1 = x * h;
ll s2, s3;
if (w-x % 2 == 0) {
s2 = s3 = h * ((w-x) / 2);
} else {
s2 = h * ((w-x) / 2);
s3 = h * (1 + (w-x) / 2);
}
ll t2, t3;
if (h % 2 == 0) {
t2 = t3 = (h / 2) * (w-x);
} else {
t2 = (h / 2) * (w-x);
t3 = (1 + h / 2) * (w-x);
}
ll d1 = max(s1, max(s2, s3)) - min(s1, min(s2, s3));
ll d2 = max(s1, max(t2, t3)) - min(s1, min(t2, t3));
y = min(y, min(d1, d2));
}
return y;
}
int main() {
ll H, W; cin >> H >> W;
if (H % 3 == 0 || W % 3 == 0) {
cout << 0 << endl;
return 0;
}
if (H == 2 && W == 2) {
cout << 1 << endl;
return 0;
}
ll ans = min(get_min(H, W), get_min(W, H));
cout << ans << endl;
return 0;
}
| 0 | 50,770,703 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) cout<<a[0];for(int i=1;i<sz;i++)cout<<" "<<a[i];cout<<endl
#define ranD srand(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int>pi;
typedef pair<ll,ll>pll;
const int N=100010;
int main()
{
IOS;
string s;cin>>s;
string temp;
for(int i=0;i<s.length();i++)
if(s[i]!='x')temp+=s[i];
bool pal=1;
for(int i=0;i<temp.length();i++)
{
if(temp[i]!=temp[temp.length()-i-1]){
pal=0;
break;
}
}
if(pal==0){
cout<<-1<<endl;
return 0;
}
int res=0;
int l=0;
int r=s.length()-1;
while(l<=r)
{
if(s[l]==s[r])l++,r--;
else if(s[l]=='x')l++,res++;
else r--,res++;
}
cout<<res<<endl;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[100002];
ll sum = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
if(sum % (n * (n + 1) / 2) != 0){
cout << "NO" << endl;
return 0;
}
ll lar[100002] {0};
ll sumlar = 0;
ll t = sum / (n * (n + 1) / 2);
for(int i = 0; i < n; i++){
if((a[i] + t - a[(i + 1) % n]) % n != 0){
cout << "NO" << endl;
return 0;
}
lar[i] = (a[i] + t - a[(i + 1) % n]) / n;
sumlar += lar[i];
}
if((t - sumlar) % n != 0){
cout << "NO" << endl;
return 0;
}
for(int i = 0; i < n; i++){
lar[i] += (t - sumlar) % n;
if(lar[i] < 0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| 0 | 77,204,634 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
long double ans = 0;
for(int i=0;i<n;i++){
long double x;
string u;
cin >> x >> u;
if(u=="JPY"){
ans += x;
}else if(u=="BTC"){
ans += x*380000;
}
}
printf("%.10Lf\n",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
string s;
cin>>s;
stack<char>st;
int cnt=0;
for(int i=0;i<s.length();i++){
if(st.size()==0){
st.push(s[i]);
}
else{
if(st.top()=='0' && s[i]=='1'){
st.pop();
cnt+=2;
}
else if(st.top()=='1' && s[i]=='0'){
st.pop();
cnt+=2;
}
else
st.push(s[i]);
}
}
cout<<cnt<<endl;
return 0;
}
| 0 | 1,157,444 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<string> S(N);
REP(i, N) cin >> S[i];
auto isOk = [&](ll a) -> bool
{
vector<string> tmp(N);
REP(i, N) tmp[i] = S[(i+a)%N];
REP(h, N)REP(w, N)
if (tmp[h][w] != tmp[w][h])
return false;
return true;
};
ll res{0};
REP(h, N)
res += isOk(h);
std::cout << res*N<< std::endl;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
else if (n == 1) return p % m;
else if (n % 2 == 1) return p * pow_mod(p, n - 1, m) % m;
else {
ll tmp = pow_mod(p, n / 2, m);
return (tmp * tmp) % m;
}
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
ll com_mod(ll n, ll k, ll m) {
if (k == 0) return 1;
else {
ll x = 1;
ll y = 1;
for (ll i = 0; i < k; i++) {
x = (x * (n - i)) % m;
y = (y * (i + 1)) % m;
}
ll res = (x * pow_mod(y, m - 2, m)) % m;
return res;
}
}
int main() {
int x, y; cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
}
| 0 | 2,944,142 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FIR first
#define SEC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;
signed main(){
int n;
while(cin>>n,n){
map<char,char> M;
REP(i,n){
char a,b;
cin>>a>>b;
M[a]=b;
}
int m;
cin>>m;
REP(i,m){
char c;
cin>>c;
if(M.find(c)!=M.end()){
cout<<M[c];
}else cout<<c;
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string query(int n) {
cout << n << '\n';
fflush(stdout);
string s; cin >> s;
if (s == "Vacant") exit(0);
return s;
}
int main() {
int n; cin >> n;
int l = 0;
int r = n - 1;
string L = query(l);
string R = query(r);
while (l < r) {
int m = (l + r) / 2;
R = query(m);
if (m % 2) {
if (L == R) r = m;
else l = m;
} else {
if (L == R) l = m;
else r = m;
}
if (r - l == 1)
query(r);
}
return 0;
}
| 0 | 35,273,448 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using ll=long long;
using namespace std;
const long MOD=1e9+7;
template<class T>
T lcm(T a,T b){
return a/__gcd(a,b)*b;
}
int main(){
long n;cin >> n;
vector<long> a(n);
long ans=-1;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
ans=max(ans,abs(a[i]-a[j]));
}
}
cout << ans;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n, m, x, y, s = 0, _s, p;
vector<int> vx, vy;
cin >> n >> m;
for(int i = 0; i < n + m; i++){
cin >> x >> y;
vx.emplace_back(x);
vy.emplace_back(y);
}
for(int i = 0; i < n; i++){
for(int j = n; j < n + m; j++){
_s = abs(vx[i] - vx[j]) + abs(vy[i] - vy[j]);
if(s > _s || j == n){
s = _s;
p = j - n + 1;
}
}
cout << p << endl;
}
}
| 0 | 56,514,871 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI =3.14159265358979323846;
const ll M=1e9+7;
const ll inf=1e18;
const ll ms=2e5+5;
fast;
ll ans,temp;
void solve()
{
string s;cin>>s;
for(int i=0;i<3;i++)
{
temp*=10;
temp+=s[i]-'0';
}ans=abs(753ll-temp);
for(int i=3;i<s.size();i++)
{
temp=(temp%100)*10+s[i]-'0';
ans=min(abs(753ll-temp),ans);
}
cout<<ans<<endl;
}
int main()
{
{
solve();
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
long int sum = 0;
long int before = 0;
cin>>before;
for(int i=0; i<n-1; i++){
long int a;
cin>>a;
if(before > a)
sum += before - a;
else
{
before = a;
}
}
cout<<sum<<endl;
return 0;
}
| 0 | 69,102,604 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,i,sum;
sum=0;
cin >>a >>b >>c;
for(i=a;i<=b;i++){
if(c%i==0){
sum++;
}
else{
continue;
}
}
cout << sum <<endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
void solve(){
int n, m; cin >> n >> m;
string sn[n], sm[m];
for(int i = 0; i < n; ++i) cin >> sn[i];
for(int i = 0; i < m; ++i) cin >> sm[i];
for(int i = 0; i < n-m+1; i++){
for(int j = 0; j < n-m+1; j++){
int flag = 1;
int cnt = 0;
for(int k = 0; k < m && flag; k++){
if(sn[i+k].substr(j, m) != sm[k]) flag = 0;
else cnt++;
}
if(cnt == m) {
cout << "Yes" << endl;
return;
}
}
}
cout << "No" << endl;
}
int main(){
solve();
return 0;
}
| 0 | 98,883,393 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<map<int, int>> py(n+1);
vector<vector<int>> numm(m + 1, vector<int>(2));
int tmp1, tmp2;
for (int i = 1; i <= m; i++) {
cin >> tmp1 >> tmp2;
py[tmp1][tmp2]=0;
numm[i][0] = tmp1;
numm[i][1] = tmp2;
}
for (int i = 1; i <= n; i++) {
int counter = 1;
for (auto itr = py[i].begin(); itr != py[i].end(); itr++) {
itr->second = counter;
counter++;
}
}
for (int i = 1; i <= m; i++) {
cout << std::setfill('0') << std::right << std::setw(6) << numm[i][0]
<< std::setfill('0') << std::right << std::setw(6) << py[numm[i][0]][numm[i][1]] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first
#define se second
#define setpre(x) cout << fixed << setprecision(x)
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x)?("Yes"):("No")) << endl
#define YN(x) cout << ((x)?("YES"):("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger(){ cout << endl; }
template<typename A, typename... B>
void logger(const A& a, const B&... b){
cout << a << " , ";
logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 100005;
int main(){
int n; cin >> n;
string s; cin >> s;
int o[] = {0, 3, 1, 2};
int x[] = {1, 2, 0, 3};
string sr[] = {"SS", "SW", "WS", "WW"};
rep(t, 4){
int u = t; vector<int> v;
rep(i, n){
v.push_back(u);
if(s[i] == 'o') u = o[u];
else u = x[u];
}
if(u != t) continue;
string ans = "";
rep(i, n){
if(v[i] % 2) ans += "W";
else ans += "S";
}
out(ans); return 0;
}
out(-1);
}
| 0 | 49,961,429 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int maxn = 1e5 + 5;
const int inf = 1e9;
const int mod = 1e9 + 7;
ll a[maxn];
int n;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(taskname".INP","r")){
freopen(taskname".INP", "r",stdin);
freopen(taskname".OUT", "w",stdout);
}
cin >> n;
for(int i = 1 ; i <= n ; ++i){
cin >> a[i];
}
ll res = 0;
while(true){
bool add = 0;
for(int i = 1 ; i <= n ; ++i){
if(a[i] >= n)add = 1;
for(int j = 1 ; j <= n ; ++j){
if(j != i)a[j] += a[i] / n;
}
res += a[i] / n;
a[i] %= n;
}
if(add == 0)break;
}
cout << res;
}
|
#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, K;
cin >> N >> K;
if (K > (N - 1) * (N - 2) / 2) {
cout << -1;
return 0;
}
int m = N * (N - 1) / 2 - K;
cout << m << newl;
FOR(i, 1, N) {
cout << "1 " << (i + 1) << newl;
}
FOR(i, 1, N) {
FOR(j, i + 1, N) {
if (K) {
K--;
continue;
}
cout << (i + 1) << " " << (j + 1) << newl;
}
}
}
#endif
| 0 | 35,210,041 |
#include <iostream>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
int main(){
int N;
cin >> N;
cout << 800*N-200*(N/15) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int INF = 1000000000;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
rep(i, n) {
scanf("%d", &a[i]);
}
int len = 1;
vector<int> l(n+1, INF);
rep(i, n) {
if (i == 0) {
l[len] = a[i];
continue;
}
if (a[i] > l[len]) {
len++;
l[len] = a[i];
} else {
int ng = 0, ok = len;
while (ng + 1 < ok) {
int mid = (ok + ng) / 2;
if (a[i] <= l[mid]) {
ok = mid;
} else {
ng = mid;
}
}
l[ok] = a[i];
}
}
printf("%d\n", len);
}
| 0 | 95,524,741 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main()
{
int a, b;
cin >> a >> b;
Cout(a * b - a - b + 1);
return 0;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
int main()
{
ll n, k;
cin >> n >> k;
vector<ll> v[n];
rep(i, n)
{
ll t, d;
cin >> t >> d;
t--;
v[t].push_back(d);
}
rep(i, n) sort(ALL(v[i]), greater<ll>());
vector<ll> y0, y1;
rep(i, n)
{
rep(j, v[i].size())
{
if (j == 0)
y1.push_back(v[i][j]);
else
y0.push_back(v[i][j]);
}
}
sort(ALL(y0), greater<ll>());
sort(ALL(y1), greater<ll>());
ll ans = 0;
ll u = min((ll)k - 1, (ll)y0.size());
rep(i, u) ans += y0[i];
ll cnt = k - u;
rep(i, cnt) ans += y1[i];
ans += (cnt * cnt);
int j = 1;
ll sum = ans;
for (ll i = (ll)cnt; i < min((ll)y1.size(), (ll)k); i++)
{
sum = sum - i * i;
sum -= y0[u - j];
sum += y1[i];
sum += (i + 1) * (i + 1);
j++;
ans = max(ans, sum);
}
OP(ans);
return 0;
}
| 0 | 14,649,801 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll=long long;
using lb = long double;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
const int MOD = 1e9 + 7;
const int INF = 1e18 + 9;
constexpr long double pi = 3.141592653589793238462643383279;
int fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int keta(int n) {
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
int ketasum(int n) {
int sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << max({ a,b,c }) * 9 + a + b + c << endl;
return 0;
}
|
#include <bits/stdc++.h>
#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(i,0,(n))
#define REPS(i,n) FOR(i,1,(n)+1)
#define RREP(i,n) RFOR(i,0,(n))
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(rng(x))
#define RSORT(x) sort(rrng(x))
#define SUM(x) accumulate(rng(x),0)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define uni(x) x.erase(unique(rng(x)),x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
const string MINF = "-";
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
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 chmax(string &a, string b) {
if (a == MINF) a = b;
else if (a.size() < b.size()) a = b;
else if (a.size() == b.size()) {
if (a < b) a = b;
}
}
long long match[10] = {-1,2,5,5,4,5,6,3,7,6};
string dp[10010];
int main () {
int n, m;
cin >> n >> m;
vi a(m);
rep(i,m) cin >> a[i];
rep(i,10010) dp[i] = MINF;
dp[0] = "";
rep(i,n) {
if (dp[i] == MINF) continue;
for (auto A : a) {
chmax(dp[i+match[A]], dp[i] + (char)('0'+A));
}
}
cout << dp[n] << endl;
return 0;
}
| 0 | 73,568,034 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S; cin >> S;
vector<long long>Bigger(S.size() + 1, 0), Less(S.size() + 1, 0);
for (long long i = 0; i < S.size(); i++) {
if (S.at(i) == '<') {
Less.at(i + 1) = Less.at(i) + 1;
}
}
for (long long i = S.size() - 1; i >= 0; i--) {
if (S.at(i) == '>') {
Bigger.at(i) = Bigger.at(i + 1) + 1;
}
}
long long ans = 0;
for (long long i = 0; i <= S.size(); i++) {
ans += max(Less.at(i), Bigger.at(i));
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string str, x, y;
cin >> str;
int q;
cin >> q;
int a, b, p;
for(int i = 0; i < q; i++){
cin >> x >> a >> b;
p = b - a + 1;
if(x == "print"){
cout << str.substr(a, p) << endl;
}
if(x == "reverse"){
b += 1;
reverse(str.begin() + a,str.begin() + b);
}
if(x == "replace"){
cin >> y;
str.replace(a, p, y);
}
}
return 0;
}
| 0 | 98,697,113 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T>bool even(T n) { return ! (n & 1); }
template<class T>bool odd(T n) { return n & 1; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N;
cin >> N;
vllvll dp(50, vll(101010, inf));
dp[0][0] = 0;
vll choice = {0, 1, 6, 9};
ll now = 36;
while (now < 101010) {
choice.push_back(now);
now *= 6;
}
now = 81;
while (now < 101010) {
choice.push_back(now);
now *= 9;
}
sort(all(choice));
rep(i, 1, len(choice)) {
rep(j, 0, 101010) {
if (j - choice[i] >= 0) chmin(dp[i][j], min(dp[i-1][j-choice[i]] + 1, dp[i][j-choice[i]] + 1));
else chmin(dp[i][j], dp[i-1][j]);
}
}
ll ans = inf;
rep(i, 1, len(choice)) {
chmin(ans, dp[i][N]);
}
cout << ans << endl;
}
|
#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
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int n,m;
cin >> n >> m;
int b[m][n];
rep(i,m)rep(j,n)b[i][j]=0;
rep(i,m){
int k;
cin >> k;
rep(j,k){
int s;
cin >> s;
s--;
b[i][s] = 1;
}
}
int p[m];
rep(i,m)cin>>p[i];
int ans = 0;
rep(i,1<<n){
int s[m];
fill(s,s+m,0);
rep(j,n){
if(i>>j & 1){
rep(k,m){
if(b[k][j]==1){
s[k]++;
}
}
}
}
int flag = 1;
rep(j,m){
if (s[j]%2!=p[j]){
flag = 0;
}
}
if(flag){
ans++;
}
}
cout << ans << endl;
}
| 0 | 54,073,255 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int x,a,b;cin>>x>>a>>b;
if(a-b>=0)cout<<"delicious"<<endl;
else if(b-a<=x) cout<<"safe"<<endl;
else cout<<"dangerous"<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
ll mpow(ll x, ll n) {
ll ans=1;
while(n>0) {
if(n&1) {
ans=ans*x%mod;
}
x=x*x%mod;
n>>=1;
}
return ans;
}
int main() {
ll n,k;
cin >> n >> k;
vec c(k+1);
ll ans=0;
for(ll i=k;i;i--) {
c[i]=mpow(k/i,n);
for(ll j=2;j*i<=k;j++) {
c[i]=(c[i]-c[j*i]+mod)%mod;
}
(ans+=c[i]*i)%=mod;
}
cout << ans << endl;
}
| 0 | 78,235,052 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define dmp(x) cerr << #x << ": " << x << 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;
}
template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T>
vector<T> vect(int len, T elem) {
return vector<T>(len, elem);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size()) os << ' ';
}
return os;
}
template <class T>
istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
#define endl "\n"
void solve() {
ll A, B, C, K;
cin >> A >> B >> C >> K;
if (K % 2ll == 1ll)
cout << B - A << endl;
else
cout << A - B << endl;
return;
}
signed main() {
fastio();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
string s;
ll k;
cin >> s >> k;
ll n = s.size();
vll a(0);
for (ll i = 0; i < n; i++) {
char c = s[i];
ll cnt = 0;
while (c == s[i] && i < n) {
i++;
cnt++;
}
a.push_back(cnt);
i--;
}
ll ans = 0;
for (ll i = 0; i < a.size(); i++) {
ans += a[i] / 2;
}
if (s[0] != s[n - 1]) cout << ans * k << endl;
else {
if (a.size() == 1) {
cout << a[0] * k / 2 << endl;
return 0;
}
a[0] += a.back();
a.pop_back();
ll m = 0;
for (ll i = 0; i < a.size(); i++) {
m += a[i] / 2;
}
cout << ans + m * (k - 1) << endl;
}
}
| 0 | 59,265,399 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }
GraphC A(100, vector<char>(100));
int main() {
int H, W;
cin >> H >> W;
rep(i, H) {
rep(j, W) {
cin >> A.at(i).at(j);
}
}
rep(i, H) {
rep(j, W) {
cout << A.at(i).at(j);
}
cout << endl;
rep(j, W) {
cout << A.at(i).at(j);
}
cout << endl;
}
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
string S;
cin>>S;
string tmp;
bool can = false;
for(int i=0;i<S.size();++i){
for(int j=i;j<S.size();++j){
tmp = "";
for(int k=0;k<i;++k){
tmp += S[k];
}
for(int k=j;k<S.size();++k){
tmp += S[k];
}
if(tmp=="keyence") can = true;
}
}
if(can) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
| 0 | 64,430,349 |
#include <iostream>
using namespace std;
int main(){
int n,i,j;
cin >> n >> i;
j=(n-i)+1;
cout << j;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int ai, ao, bi, bo;
cin >> ai >> ao >> bi >> bo;
int a = 0;
int b = 0;
int ans = 0;
rep(i, 101){
if(ai == i) a = 1;
if(bi == i) b = 1;
if(ao == i) a = 0;
if(bo == i) b = 0;
if(a == 1 && b == 1) ans++;
}
cout << ans << endl;
return 0;
}
| 0 | 5,533,447 |
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <queue>
#include <climits>
#include <set>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ve vector
#define umap unordered_map
#define iter iterator
void solve() {
int n;cin>>n;
int res=0;
for(int i=0;i<n;i++) {
int l,r;cin>>l>>r;
res += r-l+1;
}
cout<<res<<endl;
}
int main() {
solve();
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<queue>
#define INF 2100000000
using namespace std;
typedef pair<int,int> P;
int glid[1001][1001];
char put[1001][1001];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
char su[9]={'1','2','3','4','5','6','7','8','9'};
int main(void)
{
int i,j,k,h,w,n,sum,x,y;
int sx,sy;
P pop_xy;
queue<P> push_xy;
cin>>h>>w>>n;
for(i=0;i<h;i++) cin>>put[i];
for(i=0;i<h;i++) {
for(j=0;j<w;j++) {
glid[i][j]=INF;
}
}
for(i=0;i<h;i++) {
for(j=0;j<w;j++) {
if(put[i][j]=='S') {
push_xy.push(P(i,j));
glid[i][j]=0;
break;
}
}
}
sum=0;
for(i=0;i<n;i++) {
if(i>0) {
for(j=0;j<h;j++) {
for(k=0;k<w;k++) glid[j][k]=INF;
}
while(push_xy.size()!=0) push_xy.pop();
push_xy.push(P(sy,sx));
glid[sy][sx]=0;
}
while(push_xy.size()!=0) {
pop_xy=push_xy.front();push_xy.pop();
if(put[pop_xy.first][pop_xy.second]==su[i]) {
sum+=glid[pop_xy.first][pop_xy.second];
sy=pop_xy.first;sx=pop_xy.second;
break;
}
for(j=0;j<4;j++) {
y=dy[j]+pop_xy.first;
x=dx[j]+pop_xy.second;
if(y>=0 && y<h && x>=0 && x<w &&
put[y][x]!='X' && glid[y][x]==INF) {
push_xy.push(P(y,x));
glid[y][x]=glid[pop_xy.first][pop_xy.second]+1;
}
}
}
}
cout<<sum<<endl;
return 0;
}
| 0 | 89,506,708 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N;
cin>>N;
string S;
cin>>S;
map<char, ll> amap;
vector<char> arr;
for(int i=0;i<S.size();++i) {
if(amap[S[i]]==0) arr.push_back(S[i]);
amap[S[i]]++;
}
ll ans = 1;
for(int i=0;i<arr.size();++i) {
ans *= amap[arr[i]]+1;
ans %= mod;
}
cout<<(ans-1+mod)%mod<<endl;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
if(p) cout << fixed << setprecision(p) << a << "\n";
else cout << a << "\n";
}
template <typename T> inline void voutput(T &v){
rep(i, v.size()){
if (i) cout << " " << v[i];
else cout << v[i];
}
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
string s;
cin >> s;
vector<int> dp(1 << 26, inf);
vector<int> C(s.size() + 1);
C[0] = 0;
rep(i, s.size()){
C[i + 1] = C[i] ^ (1 << (s[i] - 'a'));
}
dp[0] = 0;
rep(i, 1, s.size() + 1){
int tmp = dp[C[i]] + 1;
rep(j, 26){
int c = C[i] ^ (1 << j);
tmp = min(tmp, dp[c] + 1);
}
if(i == s.size()) output(tmp);
dp[C[i]] = min(dp[C[i]], tmp);
}
return 0;
}
| 0 | 100,613,772 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
#define all(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,k,n) for(int i=(k);i<(n);++i)
int main() {
int N; cin >> N;
map<string,int> mp;
int sum = 0;
REP(i,N) {
string s; int a;
cin >> s >> a;
sum += a;
mp[s] = sum;
}
for(auto &p:mp) {
p.second = sum - p.second;
}
string t; cin >> t;
cout << mp[t] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define ALL(x) (x).begin(),(x).end()
signed _main(); signed main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> using v = vector<T>;
template<class T> using vv = vector<v<T>>;
const int MOD=1e9+7;
const long long INF = 1LL << 60;
using P=pair<int,int>;
signed _main(){
int H,W,A,B; cin >> H >> W >> A >> B;
if(W/2>=A && H/2>=B);
else{
No
return 0;
}
vv<int> field(H,v<int>(W,1));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(i<B && j<A) field[i][j]=0;
else if(i>=B && j>=A) field[i][j]=0;
}
}
rep(i,H){
rep(j,W-1){
cout << field[i][j];
}
cout << field[i][W-1] << endl;
}
return 0;
}
| 0 | 81,802,814 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int a,b;
cin>>a>>b;
string s;
cin>>s;
bool ans=true;
rep(i,0,s.size()){
if(i<a){
if(s[i]<'0'||s[i]>'9')ans=0;
}
else if(i==a){
if(s[i]!='-')ans=false;
}
else{
if(s[i]<'0'||s[i]>'9'){
ans=0;
}
}
}
if(ans)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d) \
vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
vl A(N);
REP(i, N) cin >> A[i];
ll now = 0;
ll ans = 0;
REP(i, N) {
ll po = (A[i] - 1) / (now + 1);
ans += po;
if (i == 0)
now = 1;
else if (po == 0) {
now = max(now, A[i]);
}
}
cout << ans << endl;
return 0;
}
| 0 | 41,628,715 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,K,ans=0; cin>>N>>K;
queue<ll> A,B,W;
vector<ll> C(N+1,0);
for(ll i=1; i<=N; i++) cin>>C[i];
for(ll i=1; i<=N; i++) C[i]=C[i-1]+C[i];
for(ll i=1; i<=N; i++) for(ll j=0; j<i; j++) A.emplace(C[i]-C[j]);
B=A;
for(ll i=50; i>=0; i--){
A=B;
queue<ll> emp;
W.swap(emp);
while(!A.empty()){
ll n=A.front(); A.pop();
if(1&n>>i) W.emplace(n);
}
if(W.size()<K) continue;
B=W;
}
if(!B.empty()){
ans=B.front();
B.pop();
}
while(!B.empty() && --K>0){
ans=ans&B.front();
B.pop();
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
using vs = vector<string> ;
#define all(v) v.begin(),v.end()
const int MAX_V = 210;
const int INF = 1e5;
int V;
vll G[MAX_V];
int match[MAX_V];
bool used[MAX_V];
void add_edge(int u,int v){
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(int v){
used[v]=true;
rep(i,G[v].size()){
int u = G[v][i], w = match[u];
if(w<0 || !used[w] && dfs(w)){
match[v] = u;
match[u] = v;
return true;
}
}
return false;
}
int bipartite_matching(){
int res = 0;
memset(match, -1, sizeof(match));
rep(v,V){
if(match[v]<0){
memset(used, 0, sizeof(used));
if(dfs(v)) res++;
}
}
return res;
}
int main(){
cin>>V;
vector<pair<int,int>> red,blue;
rep(i,V){
int a,b;cin>>a>>b;red.push_back(make_pair(a,b));
}
rep(i,V){
int c,d;cin>>c>>d;blue.push_back(make_pair(c,d));
}
rep(i,V){
rep(j,V){
pair<int,int> r,b;
r = red[i],b=blue[j];
if(r.first<b.first && r.second<b.second) add_edge(i,j+V);
}
}
cout << bipartite_matching() << endl;
}
| 0 | 44,737,926 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
long long int ans=1000;
long long int counter=1000;
long long int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n-1;i++)
{
if(a[i]<a[i+1])
{
counter=ans/a[i];
ans-=(counter)*a[i];
ans+=counter*a[i+1];
}
}
cout<<ans;
}
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define EPS 1e-10
#define INF 1000000
#define mp make_pair
#define pb push_back
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pii;
typedef long long ll;
int const N_MAX = 100000;
int main() {
int m, n_min, n_max;
while (1) {
cin >> m >> n_min >> n_max;
if (!m && !n_min && !n_max) {
return 0;
}
vi points, people(N_MAX+1, 0);
for (int i = 0; i < m; i++) {
int p;
cin >> p;
points.pb(p);
people[p]++;
}
sort(points.begin(), points.end(), greater<int>());
for (int i = N_MAX; i > 0; i--) {
people[i-1] += people[i];
}
pii ans = mp(0, 0);
for (int i = 0; i < points.size(); i++) {
int point = points[i],
n = people[point];
if (n < n_min) {
continue;
} else if (n > n_max) {
break;
}
int diff = point - points[i+1];
if (diff > ans.second || (diff == ans.second && n > ans.first)) {
ans = mp(n, diff);
}
}
cout << ans.first << endl;
}
}
| 0 | 100,002,693 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N-1);
for(int i = 0; i < N-1; i++){
cin >> B.at(i);
}
long long score = B.at(0);
for(int i = 0; i < N-2; i++){
if(B.at(i) < B.at(i+1)){
score += B.at(i);
}else{
score += B.at(i+1);
}
}
score += B.at(N-2);
cout << score << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N,K;
cin >> N >> K;
vector<ll> A(N);
for (int i=0;i<N;i++) cin >> A[i];
ll p = 0;
for (int i=0;i<N-1;i++){
for (int j=i+1;j<N;j++){
if (A[i]>A[j]) {
p++;
}
}
}
ll q=0;
for (int i=0;i<N;i++){
for (int j=0;j<N;j++){
if (A[j] > A[i]){
q++;
}
}
}
ll ans = ((K*p)%MOD + ((K*(K-1)/2)%MOD*q)%MOD)%MOD;
cout << ans << "\n";
}
| 0 | 56,175,774 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.