code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> graph(n+1);
for(int i = 0; i < m; i++){
int a, b; cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
queue<int> que;
que.push(1);
vector<int> seen(n+1, -1);
seen[1] = 1;
vector<int> parent(n+1);
while(!que.empty()){
int nv = que.front();
que.pop();
for(int v : graph[nv]){
if(seen[v] != -1) continue;
que.push(v);
seen[v] = 1;
parent[v] = nv;
}
}
cout << "Yes" << endl;
for(int i = 2; i <= n; i++) cout << parent[i] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin >> k;
long a[k];
for(int i=0;i<k;i++)cin >> a[i];
bool chk = true;
long upper = 2;
long lower = 2;
for(int i=k-1;i>=0;i--){
if(upper%a[i] != 0)upper -= upper%a[i];
if(lower%a[i] != 0)lower += a[i] - (lower%a[i]);
if(upper<lower){
chk = false;
break;
}
upper += a[i]-1;
}
if(chk)cout<<lower<<" "<<upper<<endl;
else cout<<-1<<endl;
}
| 0
| 43,406,899
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<pair<int, int> > R(N);
vector<pair<int, int> > B(N);
vector<bool> C(N);
for(int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
R[i] = make_pair(b, a);
}
for(int i = 0; i < N; i++) {
int c, d;
cin >> c >> d;
B[i] = make_pair(c, d);
}
sort(R.begin(), R.end(), greater<pair<int, int> >());
sort(B.begin(), B.end());
int ans = 0;
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
if(C[j]) continue;
if(R[j].second < B[i].first && R[j].first < B[i].second) {
C[j] = true;
ans++;
break;
}
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> istream& operator>>(istream &is, pair<S, T> &p){ return is >> p.first >> p.second; }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ return os << "[" << p.first << ", " << p.second << "]"; }
#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define For1(i, n) for(int i = 1; i <= (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
#define Return(x) { Cout(x); return 0; }
constexpr int MOD = 1e9+7;
using Pii = pair<int, int>;
int main(void){
Cin(int, n);
Cins(int, n, a);
Cins(int, n, b);
vc<int> u(n);
For(i, n) u[i] = min(a[i], b[i]);
ll ans = 1;
For(i, n){
int ub = -1;
if(i == 0 || a[i] != a[i-1]) ub = a[i];
if(i == n-1 || b[i] != b[i+1]){
if(ub != -1 && ub != b[i]) Return(0);
ub = b[i];
}
if(ub > u[i]) Return(0);
if(ub == -1) ans = (ans * u[i]) % MOD;
}
Cout(ans);
}
| 0
| 9,963,596
|
#include <iostream>
int main() {
int a,b,c,count;
count=0;
std::cin>>a;
std::cin>>b;
std::cin>>c;
for ( ;a<=b;a++){
if (c%a==0){
count++;
}
}
if (a>b){
std::cout << count << std::endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<string>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
bool used[27];
int main(){
string s;
cin >> s;
rep(i, (int)s.length()) {
used[s[i]-'a'] = 1;
}
if ( (int)s.length() < 26 ) {
rep(i, 26) {
if ( !used[i] ) {
s += char('a'+i);
break;
}
}
cout << s << endl;
}
else {
int id = -1;
for ( int i = (int)s.length()-2; i >= 0; --i ) {
if ( s[i] < s[i+1] ) {
id = i;
break;
}
}
if ( id == -1 ) {
cout << -1 << endl;
}
else {
string t = s.substr(0, id);
int idx2 = id + 1;
for ( int i = id + 1; i < (int)s.length(); ++i ) {
if ( s[i] < s[idx2] && s[i] > s[id] ) {
idx2 = i;
}
}
t += s[idx2];
cout << t << endl;
}
}
return 0;
}
| 0
| 18,863,968
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<int> count(n);
for(int i = 0;i <= m - 1;i++){
int a,b;
cin >> a >> b;
count[a - 1]++;
count[b - 1]++;
}
bool yes = true;
for(int i = 0;i <= n - 1;i++)if(count[i] % 2 != 0)yes = false;
if(yes)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define per1(i,n) for (int i = n; i >= 1; --i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline T intceil(T a, T b) { return (a + (b - 1)) / b; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
static const long double pi = acos(-1.0);
typedef complex<ld> cd;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m,v,p; cin >> n >> m >> v >> p;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
int lo = -1, hi = n - 1;
while(hi - lo > 1) {
int mid = (lo + hi) / 2;
vector<ll> b;
rep(i, n) {
if(i != mid) {
b.push_back(a[i]);
}
}
reverse(all(b));
ll base = a[mid] + m;
ll ok = 0;
bool ng = 0;
rep(i, b.size()) {
if(i < p - 1) ok += m;
else if(base >= b[i]) ok += min(m, base - b[i]);
else ng = 1;
}
if(ng || ok < (m * (v - 1))) {
lo = mid;
} else {
hi = mid;
}
}
cout << n - hi << endl;
}
| 0
| 64,693,814
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int K, S;
cin >> K >> S;
int z, count = 0;
for(int x=0; x<=K; x++) {
for(int y=0; y<=K; y++) {
z = S - x - y;
if(z <= K && z >= 0) {
count++;
}
}
}
cout << count << endl;
}
|
#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 1001001001
#define mod 1000000007
#define pi 3.141592653589793
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
ll r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
int main (){
ll x,y;
cin >> x >>y;
if(y>x){
if(x>=0||y<=0) cout << y-x << endl;
else cout << min(y-x,abs(y+x)+1) <<endl;
}
else {
if(x==0) cout << -y+1 <<endl;
else if(y==0) cout << x+1 <<endl;
else if(x<0||y>0) cout << x-y+2 <<endl;
else cout << abs(-x-y)+1 <<endl;
}
return 0;
}
| 0
| 99,415,326
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i <= (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int k, s;
cin >> k>> s;
int count = 0;
rep(i, k){
rep(j, k){
int l = s - (i + j);
if (l >= 0 && l <= k){
++count;
}
}
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,d,a;
cin >> n >> d >> a;
vector<pair<ll,ll>> xh(n);
for(ll i=0;i<n;++i){
ll x,h;
cin >> x >> h;
xh[i]=make_pair(x,h);
}
sort(xh.begin(),xh.end());
d=d*2;
ll ans=0;
ll tot=0;
queue<pair<ll,ll>> q;
for(ll i=0;i<n;++i){
ll x=xh[i].first;
ll h=xh[i].second;
while(q.size()!=0 && q.front().first<x){
tot-=q.front().second;
q.pop();
}
h-=tot;
if(h>0){
ll num=(h+a-1)/a;
ll damage=num*a;
ans+=num;
tot+=damage;
q.push(make_pair(x+d,damage));
}
}
cout << ans << endl;
return 0;
}
| 0
| 80,370,087
|
#include<bits/stdc++.h>
using namespace std;
#define FastRead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define sq(x) ((x)*(x))
#define pi acos(-1.0)
#define NUM 1000005
typedef long long ll;
int main()
{
FastRead
string s;
ll cnt1=0,cnt2=0;
cin>>s;
for(ll i=0; i<s.size(); i++)
{
if(i%2==0 && s[i]=='0')
{
cnt1++;
}
if(i%2==1 && s[i]=='1')
{
cnt1++;
}
}
for(ll i=0; i<s.size(); i++)
{
if(i%2==1 && s[i]=='0')
{
cnt2++;
}
if(i%2==0 && s[i]=='1')
{
cnt2++;
}
}
cout<<min(cnt1,cnt2)<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int i=0,j=0,N=0,AB=0,A=0,B=0,BA=0;
cin >> N;
string s;
for(i=0;i<N;i++){
cin >> s;
if(s[0]=='B'&&s[s.size()-1]!='A')B++;
if(s[0]!='B'&&s[s.size()-1]=='A')A++;
if(s[0]=='B'&&s[s.size()-1]=='A')BA++;
for(j=0;j<s.size()-1;j++){
if(s[j]=='A'&&s[j+1]=='B')AB++;
}
}
if(BA==0)cout << AB + min(A,B) << endl;
else if(A==0&&B==0)cout << AB + BA - 1 << endl;
else cout << AB + BA + min(A,B) << endl;
return 0;
}
| 0
| 52,217,876
|
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
int max = 0;
vector<int> a(100005, 0);
vector<int> s(100005,0);
while (n != 0 || k != 0) {
int b;
s[0] = 0;
for(int i = 0; i < n; i++) {
cin >> b;
s[i+1] = s[i] + b;
}
for (int i = 0; i < n-k; i++) {
if(max < s[i+k] - s[i]) {
max = s[i+k] - s[i];
}
}
cout << max << endl;
cin >> n >> k;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e5+10;
int a[maxn];
int cmp(const int a,const int b){
return a>b;
}
int n,m,v,p;
int b[maxn];
bool judge(int mid){
if(mid<=p)return true;
if(a[mid]+m<a[p])return false;
if(v<=p-1&&a[mid]+m>=a[p])return true;
for(int i=1;i<=n;i++)b[i]=a[i];
int temp=0;
int inx=n,cnt=v-p+1;
for (int i=n,j=v-p;i>mid&&j;i--,j--){
temp+=m;
b[i]+=m;
}
temp+=m*p;
int now=a[mid]+m;
int res=m*v-temp;
int ww=a[p];
for(int i=p;i<mid;i++){
int add=min(m,max(now-a[i],0ll));
if(add>res)add=res;
res-=add;
b[i]+=add;
if(i==p){
ww+=add;
}
}
return now>=ww&&res<=0;
}
signed main(){
cin>>n>>m>>v>>p;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+n+1,cmp);
int low=1,high=n;
int ans=0;
while(low<=high){
int mid=(low+high)>>1;
if(judge(mid)){
low=mid+1;
ans=mid;
}
else{
high=mid-1;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 92,387,365
|
#include <iostream>
#include <string>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
string n;
cin >> n;
rep(i, 3){
if (n[i] == '1') n[i] = '9';
else if (n[i] == '9') n[i] = '1';
}
cout << n << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define max(a,b) (((a) < (b)) ? (b) : (a))
#define abs(a) (((a) < 0) ? (-(a)) : (a))
int main(void) {
int64_t N,Z,W;
cin >> N >> Z >> W;
vector<int64_t> a(N);
for(int i=0;i<N;i++) {
cin >> a[i];
}
if(N == 1) {
cout << abs(W-a[0]) << "\n";
} else {
cout << max(abs(a[a.size()-1]-W),abs(a[a.size()-1]-a[a.size()-2])) << "\n";
}
return 0;
}
| 0
| 60,651,319
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int mod = 998244353;
const int N = 10000005;
const int K = 25;
int d[N], sz[N], p[N], f[N];
pair < int, int > a[N];
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++){
cin >> d[i];
a[i] = {d[i], i};
}
set < pair < int, int > > s;
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) sz[i] = 1;
for (int i = 1; i <= n; i++){
int v = a[i].S;
auto x = s.lower_bound({d[v], 0});
while(x != s.end() && (*x).F == d[v]){
int u = (*x).S;
p[u] = v;
f[v] += f[u] + sz[u];
sz[v] += sz[u];
x++;
}
s.insert({d[v] + sz[v] - (n - sz[v]), v});
}
vector < pair < int, int > > ans;
for (int i = 1; i <= n; i++){
if (p[i] != 0){
ans.pb({i, p[i]});
} else if (f[i] != d[i]){
cout << -1;
return 0;
}
}
if (ans.size() != n - 1) cout << -1; else{
for (auto i: ans){
cout << i.F << " " << i.S << endl;
}
}
}
|
#include <ctype.h>
#include <cstdio>
using namespace std;
int main() {
int x = 0;
for (;;) {
const int c = getchar();
if (c == EOF)
break;
if (c == '\n') {
if (!x)
break;
printf("%d\n", x);
x = 0;
continue;
}
if (isdigit(c))
x += c - '0';
}
return 0;
}
| 0
| 518,975
|
#include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define M 1000000007
using namespace std;
int h, w;
vector<string> g;
bool isValid(int i, int j) {
return (i >= 0 && i < h && j >= 0 && j < w && g[i][j] == '.');
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> h >> w;
for(int i = 0; i < h; i++) {
string s; cin >> s;
g.push_back(s);
}
vector<vector<long long>> dp(h, vector<long long> (w, 0));
dp[0][0] = 1;
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
ll a = (isValid(i-1, j)?dp[i-1][j]:0);
ll b = (isValid(i, j-1)?dp[i][j-1]:0);
dp[i][j] = max(dp[i][j], (a%M+b%M)%M);
}
}
cout << dp[h-1][w-1] << '\n';
}
|
#include <iostream>
using namespace std;
string s[30][30];
int n,m,i,j,x,y ;
int main()
{
ios_base :: sync_with_stdio(false) ;
cin >> n >> m ;
for(i=0; i<n; i++)
{
for(j=0; j<m; ++j)
cin >> s[i][j] ;
}
for(i=0; i<n; i++)
{
for(j=0; j<m; j++)
if(s[i][j] == "snuke")
cout << (char)('A'+j) << i+1;
}
return 0;
}
| 0
| 23,147,162
|
#include<bits/stdc++.h>
using namespace std;
int x[100000];
int main(){
int a,b,s;
cin>>a>>b>>s;
for(int i=0;i<a;i++) cin>>x[i];
int sa=abs(x[a-1]-s);
if(a!=1) sa=max(sa,abs(x[a-2]-x[a-1]));
cout<<sa<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using P = pair<int, int>;
using MATRIX = vector< vector<ll> >;
template <class T> inline bool chmin(T &x, const T &y) {if (x > y) {x = y; return 1;} return 0;}
template <class T> inline bool chmax(T &x, const T &y) {if (x < y) {x = y; return 1;} return 0;}
double N, K;
int NUM;
double p(int a, int key) {
int res = 1;
int x = key;
while(x > 0) {
if(x & 1) {
res *= a;
}
x >>= 1;
a *= a;
}
return res;
}
int main() {
cin >> N >> K;
NUM = floor(log2(K - 0.1)) + 1;
double ans = 0;
double par = pow(2, NUM);
double ch = 0;
for(int i = 1; i <= N; i++) {
if(i >= K) {
ch += par;
continue;
}
int temp = floor(log2((K - 0.1) / i)) + 1;
ch += pow(2, NUM - temp);
}
cout << std::fixed << std::setprecision(11) << ch / (par * N) << endl;
return 0;
}
| 0
| 74,674,580
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main() {
int n;
cin>>n;
int a,b,l=0,ans=MOD;
for(int i=0;i<n;i++){
cin>>a>>b;
l+=a;
if(a>b)ans=min(ans,b);
}
if(ans==MOD)cout<<0;
else cout<<l-ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
int m;
signed main(){
cin>>m;
int sum = 0, dig = 0;
rep(i,m){
int d,c;cin>>d>>c;
sum += d*c;dig += c;
}
cout << dig - 1 + (sum-1)/9 << endl;
}
| 0
| 75,522,024
|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
uint64_t g = gcd(m,n);
if(m%g==0) return (m/g)*n;
if(n%g==0) return (n/g)*m;
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
ll n;
cin >> n;
map<ll,ll> count;
ll a;
ll totalRem = 0;
ll maxRem = 0;
for(int i=0;i<n;i++){
cin >> a;
count[a]++;
if(count[a]>=2){
totalRem++;
maxRem = max(maxRem,count[a]-1);
}
}
if(maxRem<=totalRem/2){
if(totalRem%2==0){
cout << n-totalRem << endl;
}
else{
cout << n-totalRem-1 << endl;
}
}
else{
n -= (totalRem-maxRem)*2;
maxRem -= (totalRem-maxRem);
n -= maxRem*2;
if(n<=0){
n = 1;
}
cout << n << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FI(z,n) for(int j=z; j<=n; j++)
#define FL(z,n) for(l j=z; j<=n; j++)
#define inf 10000000000
#define mod 1000000007
void In_Out(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
struct Act{
ll A, B, C;
};
int main(){
ll n, a, b, c;
cin >> n;
Act arr[n];
for(ll i=0; i<n; i++){
cin >> arr[i].A >> arr[i].B >> arr[i].C;
}
ll dp[n][3];
dp[0][0] = arr[0].A;
dp[0][1] = arr[0].B;
dp[0][2] = arr[0].C;
for(ll i=1; i<n; i++){
for(ll j=0; j<3; j++){
if(j==0){
dp[i][j] = arr[i].A + max(dp[i-1][1], dp[i-1][2]);
}
else if(j==1){
dp[i][j] = arr[i].B + max(dp[i-1][0], dp[i-1][2]);
}
else if(j==2){
dp[i][j] = arr[i].C + max(dp[i-1][1], dp[i-1][0]);
}
}
}
ll ans = INT_MIN;
for(ll i=0; i<3; i++){
ans = max(ans, dp[n-1][i]);
}
cout << ans;
}
| 0
| 29,766,680
|
#include <bits/stdc++.h>
#include<iostream>
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;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
const double PI = 3.1415926535897932;
int a[1000005];
string s;
int n;
bool check(){
bool res = true;
if(a[n-1] == 1){
if(!((s[n-1] == 'o' && a[n-2] == a[0]) || (s[n-1] == 'x' && a[n-2] != a[0]))){
res = false;
}
}else{
if(!((s[n-1] == 'x' && a[n-2] == a[0]) || (s[n-1] == 'o' && a[n-2] != a[0]))){
res = false;
}
}
if(a[0] == 1){
if(!((s[0] == 'o' && a[n-1] == a[1]) || (s[0] == 'x' && a[n-1] != a[1]))){
res = false;
}
}else{
if(!((s[0] == 'X' && a[n-1] == a[1]) || (s[0] == 'o' && a[n-1] != a[1]))){
res = false;
}
}
return res;
}
void p(){
rep(i,n){
if(a[i] == 1) cout << 'S';
else cout << 'W';
}
cout << endl;
}
void make(){
for(int i = 2; i < n; i++){
if(a[i-1] == 1){
if(s[i-1] == 'o') a[i] = a[i-2];
else a[i] = (-1*a[i-2]);
}else{
if(s[i-1] == 'o') a[i] = (-1*a[i-2]);
else a[i] = a[i-2];
}
}
}
int main()
{
cin >> n; cin >> s;
a[0] = 1; a[1] = 1;
make();
if(check()){
p();
return 0;
}
a[0] = 1; a[1] = -1;
make();
if(check()){
p();
return 0;
}
a[0] = -1; a[1] = 1;
make();
if(check()){
p();
return 0;
}
a[0] = -1; a[1] = -1;
make();
if(check()){
p();
return 0;
}
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
vector<ll> A(N+1);
for (int i = 0; i < N+1; ++i) {
cin >> A[i];
}
vector<ll> B(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
ll ans = 0;
for (int i = 0; i < N; ++i) {
if (A[i] <= 0) {
if (A[i + 1] <= B[i]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
}
else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
}
else if (A[i] <= B[i]) {
B[i] -= A[i];
ans += A[i];
A[i] = 0;
if (A[i + 1] <= B[i]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
}
else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
}
else {
A[i] -= B[i];
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 52,529,036
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define INF 2147483647
#define LLINF 9223372036854775807LL
int main() {
ll l,r; cin>>l>>r;
ll ans = 3000;
for (ll i=l; i<=r-1; i++){
for (ll j=i+1; j<=r; j++){
if ((i*j) % 2019 == 0){
cout << 0 << endl;
return 0;
}
ans = min(ans, (i*j)%2019);
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
ll N,M;
cin >> N >> M;
vector<ll> v(N);
map<int,ll> m;
for(int i = 0; i < N; i++){
cin >> v.at(i);
v.at(i) %= M;
if(i > 0){
v.at(i) += v.at(i-1);
v.at(i) %= M;
}
if(m.count(v.at(i)) == 0){
m[v.at(i)] = 1;
} else {
m[v.at(i)]++;
}
}
ll ans = 0;
for(auto x: m){
if(x.first == 0){
ans += x.second;
}
ans += x.second * (x.second -1) / 2;
}
cout << ans << endl;
}
| 0
| 66,038,980
|
#include <iostream>
#include <cstdio>
using namespace std;
int hindo[100];
int main()
{
int n;
while (scanf("%d ", &n) == 1) {
hindo[n - 1]++;
}
int mx = 0;
for (int i = 0; i < 100; i++) {
mx = max(hindo[i], mx);
}
for (int i = 0; i < 100; i++) {
if (mx == hindo[i]) {
printf("%d\n", i + 1);
}
}
return 0;
}
|
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e5 + 7;
int lst[Max];
int main()
{
int n;
cin >> n;
ll res = 0;
for (int i = 1; i <= n; i++)
{
int a, b;
cin >> a >> b;
res += (b - a+1);
}
cout << res;
}
| 0
| 70,459,081
|
#include<iostream>
#include<cstring>
using namespace std;
int main() {
char s[101], s2[101], p[101];
cin >> s;
cin >> p;
strcpy(s2, s);
strcat(s, s2);
if (strstr(s, p) == NULL)
cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
}
|
#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;
}
void invalid() {
output(0);
exit(0);
}
ll fact(ll n) {
ll ans = 1;
rep(i, 1, n + 1) (ans *= i) %= mod;
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll N;
string s;
cin >> N >> s;
ll ans = 1;
int l = 1, r = 0;
if(s[0] != 'B') invalid();
int cur = 0;
rep(i, 1, 2 * N) {
if(s[i] == s[i - 1]) {
cur ^= 1;
}
if(cur == 1) {
ans *= (l - r);
ans %= mod;
}
if(cur == 0) l++;
else r++;
if(l < r) invalid();
}
if(l != r) invalid();
ans *= fact(N);
ans %= mod;
output(ans);
return 0;
}
| 0
| 59,290,025
|
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
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 long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<long long,long long> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b ;
}
int main() {
int N;cin >> N;
vector<long long> retu(N);
for(int i = 0;i<N;i++)cin >> retu.at(i);
vector<P> guuki;
for(int i = 0;i<N;i++){
guuki.push_back(make_pair(retu.at(i),i%2));
}
sort(retu.begin(),retu.end());
sort(guuki.begin(),guuki.end());
int ans = 0;
for(int i = 0;i<N;i++){
if(guuki.at(i).second != i%2) ans++;
}
cout << ans/2 << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
template<typename T>inline bool chkmin(T &x,T y){return (y<x)?(x=y,1):0;}
template<typename T>inline bool chkmax(T &x,T y){return (y>x)?(x=y,1):0;}
inline int read(){
int x;
char c;
int f=1;
while((c=getchar())!='-' && (c>'9' || c<'0'));
if(c=='-') f=-1,c=getchar();
x=c^'0';
while((c=getchar())>='0' && c<='9') x=(x<<1)+(x<<3)+(c^'0');
return x*f;
}
inline ll readll(){
ll x;
char c;
int f=1;
while((c=getchar())!='-' && (c>'9' || c<'0'));
if(c=='-') f=-1,c=getchar();
x=c^'0';
while((c=getchar())>='0' && c<='9') x=(x<<1ll)+(x<<3ll)+(c^'0');
return x*f;
}
const int maxn=1e6+10;
vector<int> G[maxn];
int ans;
bool dfs(int x,int ff){
bool flag=0;
for(auto v:G[x]) if(v!=ff){
bool b=dfs(v,x);
if(flag && b) ans=1;
flag|=b;
}
return flag^1;
}
int main(){
int n=read();
REP(i,1,n-1){
int x=read(),y=read();
G[x].push_back(y),G[y].push_back(x);
}
ans|=dfs(1,0);
printf("%s\n",ans?"First":"Second");
return 0;
}
| 0
| 97,026,971
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int a, b, c;
cin >> a >> b >> c;
if ( c >= a && c <= b ) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n,m;
cin>>n>>m;
vector<ll> a(n),b(n),c(m),d(m);
rep(i,n) cin>>a[i]>>b[i];
rep(i,m) cin>>c[i]>>d[i];
rep(i,n) {
ll dis=abs(a[i]-c[0])+abs(b[i]-d[0]);
int index=1;
for (int j=1; j<m; j++) {
ll res=abs(a[i]-c[j])+abs(b[i]-d[j]);
if (res<dis) {
index=j+1;
dis=res;
}
}
cout<<index<<endl;
}
}
| 0
| 3,640,235
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>
using namespace std;
#define DEBUG_
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b)) < EPS)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
template <typename T>
std::string printVector(const std::vector<T> &data)
{
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
const int MOD = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
int nth_bit(int x, int n){
return (x >> n) & 1;
}
signed main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int N,K; cin >> N >> K;
vector<string> c;
VI A(N);
VL B(N);
REP(i,N) cin >> A[i] >> B[i];
string ck;
REP(_,32){
ck += char('0'+K%2);
K /= 2;
}
reverse(ck.begin(),ck.end());
c.eb(ck);
int ck_len = ck.length();
FOR(i,0,ck_len){
if(ck[i] == '1'){
string tmp = ck.substr(0,i);
tmp += '0';
tmp += string(ck_len-1-i,'1');
c.eb(tmp);
}
}
LL ans = 0;
for(auto s : c){
reverse(s.begin(),s.end());
LL tmp = 0;
REP(i,N){
bool ok = 1;
REP(j,32){
if(nth_bit(A[i],j) == 0 || s[j] == '1'){
}else{
ok = 0;
}
}
if(ok) tmp += B[i];
}
ans = max(ans,tmp);
}
cout << ans << endl;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int dx[4] = {-1, 0, 0, 1};
const int dy[4] = {0, -1, 1, 0};
const int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const string dir8[8] = {"U", "RU", "R", "RD", "D", "LD", "L", "LU"};
#define MAX_N 100000
#define MAX 100000
#define INFTY (1<<30)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define REP(i, N) for (int i = 0; i < (int)(N); ++i)
#define SLN(i,N) (i == N-1 ? "\n" : " ")
ll fact(ll n) { ll res = 1; for(ll i=2;i<=n;++i) res = res * i; return res;}
ll nCr(ll n, ll r) {return (fact(n)/fact(n-r)*fact(r)) ;}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const ll MOD = 1e9+7;
const ll INF = 1LL << 60;
const int inf = 1000100011;
class Point { public: double x, y; Point(double x = 0, double y = 0) : x(x), y(y) {} Point operator+(Point p) { return Point(x + p.x, y + p.y); } Point operator-(Point p) { return Point(x - p.x, y - p.y); } Point operator*(double a) { return Point(a * x, a * y); } Point operator/(double a) { return Point(x / a, y / a); } double abs() { return sqrt(norm()); } double norm() { return x * x + y * y; } bool operator<(const Point& p) const { return x != p.x ? x < p.x : y < p.y; } bool operator==(const Point& p) const { return fabs(x - p.y) < EPS && fabs(y - p.y) < EPS; } };
typedef Point Vector;
double norm(Vector a) { return a.x * a.x + a.y * a.y; }
double abs(Vector a) { return sqrt(norm(a));}
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
struct Segment { Point p1, p2; };
typedef Segment Line;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N), D(N + 1);
REP(i, N) cin >> A[i];
sort(A.begin(), A.end());
D[0] = 0;
REP(i, N) D[i + 1] = D[i] + A[i];
int idx = -1;
REP(i, N - 1) {
if (2 * D[i] < A[i]) {
idx = i;
}
}
cout << N - idx << endl;
return 0;
}
| 0
| 40,280,771
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,P;
cin >> N >> P;
int num[2] ={};
for(int i=0;i<N;i++){
int a;
cin >> a;
num[a%2]++;
}
if(P==1 && num[1] == 0){
cout << 0 << endl;
return 0;
}
ll ans =1;
for(int i=0;i<num[0];i++){
ans *=2;
}
for(int i=0;i<(num[1]-1);i++){
ans *= 2;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<LL> v(N);
bool zflg = false;
for(int i = 0; i < N; ++i) {
cin >> v[i];
zflg = (zflg || v[i] == 0);
}
if(zflg) {
cout << 0 << endl;
return 0;
}
LL res = v[0];
const LL MX = 1000000000000000000ll;
for(int i = 1; i < N; ++i) {
LL t = MX / res;
if(v[i] > t) {
cout << -1 << endl;
return 0;
}
res *= v[i];
}
cout << res << endl;
return 0;
}
| 0
| 64,654,455
|
#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>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int main() {
int n, x, t;
cin >> n >> x >> t;
cout << (n - 1 + x)/x * t << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++)
{
string s = to_string(i);
string t(s);
reverse(t.begin(), t.end());
int x = stoi(s);
int y = stoi(t);
if (x == y)
{
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 39,970,928
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string key = "keyence";
string str;
string tmp;
cin >> str;
for(int i = 0; i < 8; i++){
tmp = str.substr(0,i) + str.substr(str.size() - (7-i), 7-i);
if(tmp == key){
cout << "YES";
return 0;
}
}
cout << "NO";
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> job(N);
rep(i, N) {
int A, B;
cin >> A >> B;
job[i] = {A, B};
}
sort(job.begin(), job.end());
int ans = 0, cnt = 0;
priority_queue<int> pq;
REP(i, M + 1) {
while (cnt < N) {
if (job[cnt].first == i) {
pq.push(job[cnt].second);
++cnt;
} else {
break;
}
}
if (pq.size()) {
ans += pq.top();
pq.pop();
}
}
cout << ans << endl;
return 0;
}
| 0
| 28,241,575
|
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int i;
for(i=0;i<s.size();i++){
if((i+1)%2==1) cout << s[i];
}
cout << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL));
ll power(ll x,ll y,ll m){ll r=1;for(;y;y>>=1){if(y&1)r=r*x%m;x=x*x%m;}return r;}
const ll mod = 1e9 + 7;
const ld pi = 3.14159265358979;
int run_test(){
int k;
cin >> k;
if(k <= 9){
cout << k;
return 0;
}
queue<int> q;
for(ll i=1; i <= 9; i++){
q.push(i);
}
int count = 9;
while(count != k){
ll a = q.front();
q.pop();
int t = a % 10;
for(int i=-1; i<=1; i++){
if(t + i <= 9 && t + i >= 0){
string s = to_string(a);
char p = (t + i) + '0';
s = s + p;
count++;
if(count == k){
cout << s;
return 0;
}
q.push(stoll(s));
}
}
}
return 0;
}
int main(){
FAST;
ll t;
t = 1;
while(t--){
run_test();
}
}
| 0
| 24,840,156
|
#include<iostream>
#include<cstdio>
using namespace std;
int n;
int y,m,d;
int dd[11]={0,20,19,20,19,20,19,20,19,20,19};
int main(void){
cin >> n;
for(int i=0;i<n;i++){
int ans=0;
cin >> y >> m >> d;
while(y!=1000 || m!=1 || d!=1){
if(y!=999){
if(y%3==0){
while(m!=11 || d!=1){
if(21==d)m++,d=1;
if(m==11 && d==1)break;
d++,ans++;
}
m=1;
y++;
}else{
while(m!=11 || d!=1){
if(dd[m]==d-1)m++,d=1;
if(m==11 && d==1)break;
d++,ans++;
}
m=1;
y++;
}
}else{
while(m!=11 || d!=1){
if(21==d)m++,d=1;
if(m==11 && d==1)break;
else d++,ans++;
}
y=1000,m=1,d=1;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> as(n);
vector<int> bs(n);
int t;
long long sum = 0;
long long minus = 0;
int count = 0;
for (int &a : as) cin >> a;
for (int i = 0; i < n; ++i) {
cin >> t;
bs[i] = as[i] - t;
sum += bs[i];
if (bs[i] < 0) {
minus -= bs[i];
++count;
}
}
if (sum < 0) {
cout << -1 << endl;
return 0;
}
sort(bs.begin(), bs.end());
int c = n;
while (minus > 0) {
--c;
minus -= bs[c];
++count;
}
cout << count << endl;
return 0;
}
| 0
| 98,612,840
|
#include <stdio.h>
int main()
{
int c = 0;
while(true)
{
int n;
scanf("%d",&n);
if(0 == n)
break;
++c;
printf("Case %d: %d\n", c, n);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(4);
vec[0] = N/1000;
vec[1] = (N/100) % 10;
vec[2] = (N%100) / 10;
vec[3] = N%10;
for(int i=0;(1<<3);i++){
bitset<3> bit(i);
int ans = vec[0];
for(int j=0;j<3;j++){
if(bit.test(j)) ans += vec[j+1];
else ans -= vec[j+1];
}
if(ans == 7){
cout << vec[0];
for(int j=0;j<3;j++){
if(bit.test(j)) cout << "+";
else cout << "-";
cout << vec[j+1];
}
cout << "=7" << endl;
break;
}
}
}
| 0
| 58,251,208
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#define uni(e) e.erase(unique(e.begin(),e.end()),e.end())
#define double long double
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int INF=1e10;
int MOD=1e9+7;
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
int keta(int a){
double b=a;
b=log10(b);
int c=b;
return c+1;
}
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
bool sosuu(int a){
bool b=1;
if(a<=1)
return 0;
else{
rep1(i,sqrt(a)-1){
if(a%(i+1)==0)
b=0;
}
return b;
}
}
signed main(){
int a,b;
cin>>a>>b;
cout<<a-b+1<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define pb push_back
#define ins insert
#define INF 1000000000000000007
#define mk make_pair
#define lb(v,x) lower_bound(all(v),x)
#define ub(v,x) upper_bound(all(v),x)
#define ff first
#define ss second
#define rev reverse
#define endl "\n"
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define sz(a) (ll)a.size()
#define ld long double
#define minpq priority_queue <ll,vector<ll>,greater<ll> >
#define fill(x,y) memset(x,y,sizeof(x))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mod 1000000007
#define bp(n) __builtin_popcountll(n)
#define mxt(a) *(max_element(a.begin(),a.end()))
#define mnt(a) *(min_element(a.begin(),a.end())
#define unique_sort(c) (sort(all(c)), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define rep(i, a, mp) for(ll i = (a); i<=(mp); ++i)
#define trav(a, x) for(auto &a : x)
#define re(i,n) for(ll i = 0; i < n; ++i)
const int N = 5e5 + 7;
const ld eps=1e-7;
typedef pair<ll,ll> pii;
typedef vector<pii> vpii;
typedef vector<ll> vll;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int dx[8]={+1, +1, +1, 0, 0, -1, -1, -1};
int dy[8]={+1, 0, -1, +1, -1, +1, 0, -1};
ll power(ll x,ll y){ll res=1;x=x;while(y>0){if(y&1)res=(res*x);y=y>>1;x=(x*x);}return res;}
template <typename T> T gcd(T a,T mp){ if(a==0) return mp; return gcd(mp%a,a); }
template <typename T> T powm(T a,T mp, ll m){T cnt=1; while(mp>0){ if(mp%2==1) cnt=(cnt*a)%m; mp/=2; a=(a*a)%m; }return cnt%m;}
ll ncr(ll n,ll r){ll res=1;if(r>n)return 0;if(r>n-r)r=n-r;for(ll i=0;i<r;i++){res*=(n-i);res/=(i+1);}return res;}
ll sqr(ll x) { return x * x;}
void prec(){
}
vll ad[N];
ll dp[N][2],x,y;
int vis[N];
void dfs(ll r)
{
vis[r]=1;
dp[r][0]=1;
dp[r][1]=1;
vector<ll>v;
for(auto it:ad[r])
if (!vis[it]) v.pb(it),dfs(it);
for(auto it:v){
dp[r][0]=(dp[r][0]*(dp[it][0]+dp[it][1]))%mod;
dp[r][1]=dp[r][1]*dp[it][0]%mod;
}
}
void run(){
int n;cin>>n;
rep(i,1,n-1){
cin>>x>>y;
ad[x].pb(y);
ad[y].pb(x);
}
dfs(1);
cout<<(dp[1][0]+dp[1][1])%mod;
}
int main()
{
cin.sync_with_stdio(0);cin.tie(0);
cin.exceptions(cin.failbit);
int tc=1;
prec();
re(i,tc)
run();
return 0;
}
| 0
| 32,420,612
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define inf 1000000100
int main()
{
string s;
cin >> s;
bool solve = 0;
bool c = 1;
while(c)
{
if(s.size() == 0)
{
solve = 1;
break;
}
c = 0;
if(s.size() >= 11 && s.substr(0, 11) == "dreameraser")
{
s.erase(0, 11);
c = 1;
}
else if(s.size() >= 10 && s.substr(0, 10) == "dreamerase")
{
s.erase(0, 10);
c = 1;
}
else if(s.size() >= 7 && s.substr(0, 7) == "dreamer")
{
s.erase(0, 7);
c = 1;
}
else if(s.size() >= 5 && s.substr(0, 5) == "dream")
{
s.erase(0, 5);
c = 1;
}
else if(s.size() >= 6 && s.substr(0, 6) == "eraser")
{
s.erase(0, 6);
c = 1;
}
else if(s.size() >= 5 && s.substr(0, 5) == "erase")
{
s.erase(0, 5);
c = 1;
}
}
if(solve)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int
main(int argc, const char *argv[])
{
int H, W;
while (cin >> H >> W) {
if (!H && !W) break;
for (int i = 0; i != H; ++i) {
for (int j = 0; j != W; ++j) putchar('#');
putchar('\n');
}
putchar('\n');
}
return 0;
}
| 0
| 28,576,846
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define sort(v) sort((v).begin(),(v).end())
#define rsort(v) sort((v).rbegin(),(v).rend())
#define gcd(a,b) __gcd((a),(b))
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout<<(x)<<endl;
#define sum(v)+x accumulate(v.begin(), v.end(),x);
typedef pair<int,int> pii;
typedef vector<int> vi;
struct type{
int k, i, j;
};
bool isPrime(int n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
int findSubarray(int arr[], int n, int k)
{
int window_sum = 0;
int min_window = INT_MAX;
int last = 0;
for (int i = 0; i < n; i++)
{
window_sum += arr[i];
if (i + 1 >= k)
{
if (min_window > window_sum)
{
min_window = window_sum;
last = i;
}
window_sum -= arr[i + 1 - k];
}
}
int sum=0;
for(int i=last-k+1;i<=last;i++)
{
sum+=arr[i];
}
return sum;
}
int nextpermutation(vi v)
{
vi t=v;
sort(t);
int x=0;
while(true)
{
x++;
if(t==v)
{
return x;
}
next_permutation(all(t));
}
}
vector<int>factors(int n)
{
vi ans;
for (int i=1; i<=sqrt(n); i++)
{
if (n%i == 0)
{
if (n/i == i )
ans.pb(i);
else
ans.pb(i);
if (i!=n/i)
ans.pb(n/i);
}
}
return ans;
}
int power(int x, int y, int p)
{
int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y/2;
x = (x*x) % p;
}
return res;
}
signed main()
{
fastio;
cout << fixed << setprecision(12);
int n;
cin>>n;
vi a(n);
f(i,n)cin>>a[i];
int x=0;
int y=0;
for(int i=0;i<n;i++)
{
if(a[i]==x+1)
{
y+=1;
x+=1;
}
}
if(y==0)print(-1)
else print(n-y)
}
|
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A == 1) { A = 14; }
if (B == 1) { B = 14; }
if (A > B) {
cout<<"Alice"<<endl;
}
else if (A < B) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
}
| 0
| 53,428,079
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<unordered_map>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(long long i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define mmax(a,b) a=max(a,b)
#define mmin(a,b) a=min(a,b)
#define mkp make_pair
#define pin pair<int,int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define sq(a) (a)*(a)
#define rev(s) reverse(s.begin(),s.end())
#define end_pr(s) cout << s <<endl;return 0
#define itn int
#define bs bitset<5001>
int kai_size = 1000001;
vel kai(kai_size, 1);
vel ink(kai_size, 1);
vel dist;
int RE() {
vel v(3, 2);
return v.at(4);
}
int ru(int a, int r) {
if (r == 0) { return 1; }
int ans = ru(a, r / 2);
ans *= ans; ans %= p;
if (r % 2 == 1) { ans *= a; }
return ans % p;
}
int inv(int a) {
return ru(a, p - 2);
}
void make_kai() {
rep(i, kai_size-1) { kai[i + 1] = (kai[i] * (i + 1)) % p; }
rep(i, kai_size) { ink[i] = inv(kai[i]); }
}
int com(int n, int r) {
if (r < 0 || n < r) { return 0; }
int ans = kai[n] * ink[r];
ans %= p; ans *= ink[n - r]; ans %= p;
return ans;
}
vel dis(int mid1, vvel &way) {
int n = way.size();
vel dist(n, -1); dist[mid1] = 0;
queue<int> q;
q.push(mid1);
while (!q.empty()) {
int st = q.front(); q.pop();
rep(i, way[st].size()) {
int to = way[st][i];
if (dist[to] == -1) {
dist[to] = dist[st] + 1;
q.push(to);
}
}
}
return dist;
}
pin most_far(int now, int n, vvel &way) {
vel dist1 = dis(now, way);
pin ans = mkp(-1, 0);
rep(i, n) {
if (dist1[i] > ans.first) { ans = mkp(dist1[i], i); }
}
return ans;
}
int per(int a, int b) {
int ans = a % b;
if (ans < 0) { ans += b; }
return ans;
}
vel uni(vel v) {
sor(v);
vel ans(1, v[0]);
for (int i = 1; i < v.size(); i++) {
if (v[i] != v[i-1]) { ans.push_back(v[i]); }
}
return ans;
}
int s_gcd(int a, int b) {
if (b == 0) { return a; }
return s_gcd(b, a%b);
}
int gcd(int a, int b) {
if (a < b) { swap(a, b); }
return s_gcd(a, b);
}
bool is_prime(int i) {
for (int j = 2; j*j <= i; j++) {
if (i%j == 0) { return false; }
}
return true;
}
int get(int i, int j, vvel &ans) {
int n = ans.size();
if (i < 0 || n <= i || j < 0 || n <= j) { return 1; }
return ans[i][j];
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
void del(vel &v, int a) {
vel ans;
for (auto x : v) {
if (x != a) { ans.push_back(x); }
}
v = ans;
}
void sz_tree(int ce0, V<V<pin>> &chi,vel &sz) {
for (auto x : chi[ce0]) {
sz_tree(x.first, chi, sz);
sz[ce0] += sz[x.first];
}
}
int ord(int n) {
if (n % 2 == 1) { return 0; }
return 1 + ord(n / 2);
}
int get(int st_val, int dif_val, int st_pla, int to_pla, vel &sum,vel &dsum) {
int ans = st_val * (sum[to_pla] - sum[st_pla]);
int pl = dsum[to_pla] - dsum[st_pla] - st_pla * (sum[to_pla] - sum[st_pla]);
pl *= dif_val;
return ans + pl;
}
signed main() {
int n; cin >> n;
vel x(n);
rep(i, n) { cin >> x[i]; }
int l; cin >> l;
vvel next(17, vel(n));
rep(i, n) {
next[0][i] = upper_bound(x.begin(), x.end(), x[i] + l) - x.begin();
next[0][i]--;
}
for (int i = 1; i < 17; i++) {
rep(j, n) {
next[i][j] = next[i - 1][next[i - 1][j]];
}
}
int q; cin >> q;
rep(i, q) {
int a, b; cin >> a >> b;
a--; b--;
if (a > b) { swap(a, b); }
int now_day = 0; int now_pla = a;
for (int i = 16; i >= 0; i--) {
if (next[i][now_pla] < b) {
now_pla = next[i][now_pla];
now_day += (1 << i);
}
}
now_day++;
cout << now_day << endl;
}
return 0;
}
|
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define REP(i,b,e) for(ll i=b; i<e; i++)
#define ALL(vec) vec.begin(),vec.end()
#define PRINT(vec) printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");
#define SCAN(vec) for(auto &i:vec)scanf("%ld",&i)
#define fi first
#define se second
const int MOD = 1e9+7;
const ll INF = 1e18;
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int main(){
int n, h, w;
scanf("%d %d %d", &n, &h, &w);
int ans = 0;
REP(i, 0, n){
int a, b;
scanf("%d %d", &a, &b);
if(a>=h && b>=w) ans++;
}
printf("%d\n", ans);
return 0;
}
| 0
| 20,816,845
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
unordered_map<ll,int>mp;
ll n;cin >>n;
for (int i = 0; i < n; ++i) {
ll a;cin >>a;
mp[a]++;
}
ll ans=0;
for(auto p:mp){
ans+=((p.second-p.first)<0)?p.second:p.second-p.first;
}
cout <<ans <<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main() {
int N;
cin >> N;
int bef = -1;
int ans = 0;
REP(i,N) {
int a;
cin >> a;
if ( a == bef) {
bef = -1;
ans++;
continue;
}
bef = a;
}
cout << ans << endl;
return 0;
}
| 0
| 13,655,391
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int s;
vector<int> cnt(1000001);
cin >> s;
cnt.at(s)++;
for(int i = 2;;i++){
if(s%2) s = 3*s + 1;
else s /= 2;
if(cnt.at(s)++){
cout << i << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, N) for (int i = 0; i < (N); ++i)
int N;
vector<int> graph[100100];
int grundy(int cur, int prv = -1) {
int ret = 0;
for (auto& nxt: graph[cur]) {
if (nxt == prv) continue;
ret ^= grundy(nxt, cur) + 1;
}
return ret;
}
signed main() {
cin >> N;
REP(i, N - 1) {
int a, b;
cin >> a >> b;
--a, --b;
graph[a].emplace_back(b);
graph[b].emplace_back(a);
}
if (grundy(0)) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
| 0
| 79,007,908
|
#include <iostream>
#include <cmath>
#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>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define mod 2019
using ll = long long;
using namespace std;
int main(){
ll l,r;
cin >> l >> r;
if(r - l >= mod) cout << 0 << endl;
else{
ll ans = mod;
for(ll i = l; i < r; i++){
for(ll j = l + 1; j <= r; j++){
ans = min(ans, i * j % mod);
}
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const int MOD = 1000000007;
const int MAX = 100000;
const ld PI = (acos(-1));
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;}
typedef pair<int, int> P;
typedef pair<ll,ll> PLL;
ld rad(ld a) {return a * 180 / PI;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
vector<pair<ll, ll>> prime_factorize(ll N) {
vector<pair<ll, ll>> res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
vector<ll> dp(100,MAX);
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll mod(ll val, ll m) {
ll res = val % m;
if (res < 0) res += m;
return res;
}
long long fac[MAX], finv[MAX], inv[MAX];
char upper(char c){
if('a' <= c && c <= 'z'){
c = c - ('a' - 'A');
}
return c;
}
char lower(char c){
if('A' <= c && c <= 'Z'){
c = c + ('a' - 'A');
}
return c;
}
const ll INF = 10000000000;
struct edge{ll to, cost;};
int main(){
ll N,X;
cin >> N >> X;
vector<ll> x(N);
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
x.at(i) = abs(X - a);
}
ll ans = x.at(0);
for (int i = 1; i < N; i++) {
ans = __gcd(ans,x.at(i));
}
cout << ans << endl;
return 0;
}
| 0
| 85,241,043
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
string a,b;
int count = 0;
cin >> a >> b;
rep(i,a.length()){
if(a[i] != b[i])count++;
}
cout << count << endl;
return 0;
}
|
#include <stdio.h>
int n;
long long int A[100000];
int main(){
int i;
long long int a=0, b, c, z=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%lld", A+i);
a ^= A[i];
}
for(i=0;i<n;i++){
A[i] &= ~a;
}
for(b=1LL<<59;b;b>>=1){
if(b&a) continue;
for(i=0;i<n;i++){
if(A[i]&b) break;
}
if(i==n) continue;
if(!(z&b)) z ^= A[i];
c = A[i];
A[i] = 0;
for(;i<n;i++){
if(A[i]&b) A[i] ^= c;
}
}
printf("%lld\n", 2*z + a);
return 0;
}
| 0
| 75,964,342
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n, n){
int mini = 114514, maxi = -114514;
int sum = 0;
for(int i = 0; i < n; i++){
int s;
cin >> s;
sum += s;
mini = min(mini, s);
maxi = max(maxi, s);
}
cout << (sum - mini - maxi) / (n - 2) << endl;
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> P;
#define F first
#define S second
int N,M;
P p[10003];
int main(){
while(1){
scanf("%d %d",&N,&M);
if(!N && !M) break;
for(int i=0;i<N;i++){
int d,pa;
scanf("%d %d",&d,&pa);
p[i]=P(pa,d);
}
sort(p,p+N);
int res=0;
for(int i=N-1;i>-1;i--){
if(M==0) res+=p[i].S*p[i].F;
else if(M>p[i].S) M-=p[i].S;
else if(M<=p[i].S){
p[i].S-=M;
M=0;
res+=p[i].S*p[i].F;
}
}
printf("%d\n",res);
}
}
| 0
| 3,404,592
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
long long max,min;
max=b*(n-1)+a;
min=a*(n-1)+b;
if(max<min)
cout<<0<<endl;
else
cout<<max-min+1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define INIT2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define LINY "YES\n"
#define Liny "Yes\n"
#define LINN "NO\n"
#define Linn "No\n"
#define umap unordered_map
ll min(ll x,ll y){return (x<y ? x:y);}
ll max(ll x,ll y){return (x>y ? x:y);}
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a*b /gcd(a,b);}
ll a[1001];
ll b[1001];
ll c[1001];
vector<ll> v;
int main(){
ll X,Y,Z,K; cin>>X>>Y>>Z>>K;
CINA(a,X);
CINA(b,Y);
CINA(c,Z);
sort(a,a+X,greater<ll>());
sort(b,b+Y,greater<ll>());
sort(c,c+Z,greater<ll>());
REP(i,X){
REP(j,Y){
REP(k,Z){
if((i+1)*(j+1)*(k+1)<=K){v.push_back(a[i]+b[j]+c[k]);}
else break;
}
}
}
sort(ALL(v),greater<ll>());
REP(i,K){
printf("%Ld\n",v.at(i));
}
}
| 0
| 77,951,236
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) for((i)=((n)-1);(i)>=(0);(i)--)
#define MOD 1000000007
signed main(){
int A,B,C;
cin>>A>>B>>C;
cout<<max(0ll,C-(A-B))<<endl;
}
|
#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>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < n; i++)
{
cin >> b[i];
}
vector<ll> am;
ll am_total = 0;
ll bm_total = 0, bm_cnt = 0;
for (int i = 0; i < n; i++)
{
if (a[i] == b[i])
{
continue;
}
else if (a[i] > b[i])
{
am_total += (a[i] - b[i]);
am.push_back(a[i] - b[i]);
}
else if (b[i] > a[i])
{
bm_total += (b[i] - a[i]);
++bm_cnt;
}
}
if (am_total < bm_total)
{
cout << -1 << endl;
return 0;
}
if (bm_total == 0)
{
cout << 0 << endl;
return 0;
}
sort(am.begin(), am.end());
reverse(am.begin(), am.end());
ll total = 0;
for (int i = 0; i < am.size(); i++)
{
total += am[i];
if (total >= bm_total)
{
cout << i + 1 + bm_cnt << endl;
return 0;
}
}
return 0;
}
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
};
| 0
| 12,631,013
|
#include <iostream>
#include <string>
using namespace std;
#define SIZE 100
int main(){
int i, j, k, flag;
string s, p;
cin >> s;
cin >> p;
flag = 0;
for(i = 0; i < s.length(); i++){
for(j = 0; j < p.length(); j++){
if((i + j) >= s.length()){
k = (i + j) - s.length();
}else{
k = i + j;
}
if(s[k] != p[j]){
break;
}else if(j == p.length() -1){
flag =1;
}
}
}
if(flag == 1){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, ans;
cin >> s;
for (int i=0; i<s.size(); i+=2) {
ans.push_back(s[i]);
}
cout << ans << endl;
return 0;
}
| 0
| 94,800,123
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <queue>
#include <vector>
#include <climits>
using namespace std;
static const int MaxV = 10000;
vector<int> AdjL[MaxV];
int InDegree[MaxV];
queue<int> Q;
int main() {
int V, E;
int s, t;
cin >> V >> E;
for (int i = 0; i < V; i++) {
InDegree[i] = 0;
}
for (int i = 0; i < E; i++) {
cin >> s >> t;
AdjL[s].push_back(t);
InDegree[t]++;
}
for (int i = 0; i < V; i++) {
if (InDegree[i] == 0) {
Q.push(i);
}
}
while (Q.empty() == false) {
s = Q.front();
Q.pop();
cout << s << endl;
for (unsigned int i = 0; i < AdjL[s].size(); i++) {
t = AdjL[s][i];
if (--InDegree[t] == 0) {
Q.push(t);
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int C[m], T[n+1];
for (int i=0; i<m; i++) {
cin >> C[i];
for (int j=0; j<n+1; j++) {
T[j]=10001;
T[0]=0;
}
}
for (int i=0; i<m; i++) {
for (int j=C[i]; j<=n; j++) {
T[j]=min(T[j],T[j-C[i]]+1);
}
}
cout << T[n] << endl;
}
| 0
| 82,118,382
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) (x).rbegin(), (x).rend()
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
map<int,int>val;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
val[x]++;
val[x-1]++;
val[x+1]++;
}
int ans=0;
for(auto t=val.begin();t!=val.end();t++){
ans=max(ans,t->second);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD = 1000000007;
int main() {
int N; cin >> N;
vector<ll> T(N);
for (int i = 0; i < N; i++) {
cin >> T[i];
}
ll lcm = T[0];
if (N > 1) {
lcm = T[0] / __gcd(T[0], T[1]) * T[1];
}
for (int i = 2; i < N; i++) {
lcm = lcm / __gcd(lcm, T[i]) * T[i];
}
cout << lcm << endl;
return 0;
}
| 0
| 56,279,219
|
#include<iostream>
using namespace std;
int main(){
int W,H,x,y,r;
cin>>W>>H>>x>>y>>r;
for(int i=0;i<=W;i++){
for(int j=0;j<=H;j++){
}
}
int A,B,C,D;
A=x-r;
B=x+r;
C=y+r;
D=y-r;
if(A>=0&&B<=W&&C<=H&&D>=0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
bool bo=false;
for(int i=0;i<S.size();i++){
if(i==0){
if(S[i]!='A'){
cout<<"WA"<<endl;
return 0;
}
}else if('A'<=S[i] && S[i]<='Z'){
if(i==1 || i==S.size()-1 || S[i]!='C' || bo){
cout<<"WA"<<endl;
return 0;
}else
bo=true;
}
}
if(bo)
cout<<"AC"<<endl;
else
cout<<"WA"<<endl;
}
| 0
| 65,915,431
|
#pragma GCC optimize(2)
#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 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 SRAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng()%a
#define ALL(a) a.begin(),a.end()
#define POB pop_back
#define ff fflush(stdout)
#define fastio ios::sync_with_stdio(false)
#define R(a) cin>>a
#define R2(a,b) cin>>a>>b
#define check_min(a,b) a=min(a,b)
#define check_max(a,b) a=max(a,b)
using namespace std;
const int INF=0x3f3f3f3f;
typedef pair<int,int> mp;
int n;
int c,k,t[100000+20];
int main(){
fastio;
R(n);
R2(c,k);
rb(i,1,n){
R(t[i]);
}
sort(t+1,t+1+n);
int l=1;
int rest=0;
rb(i,1,n){
if(t[i]-t[l]>k||i-l+1>c){
l=i;
rest++;
}
}
rest++;
cout<<rest<<endl;
return 0;
}
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ll long long int
#define MOD ((int)(1e9) + 7)
using namespace std;
class B754 {
public:
void solve(istream& cin, ostream& cout) {
string s;
cin >> s;
int n= s.length();
int ans = INT_MAX;
for(int i=0; i+2<n; i++) {
string c;
for(int j=0; j<3; j++) {
c.push_back(s[i+j]);
}
int a = stoi(c);
ans = min(ans, abs(753 - a));
}
cout << ans << '\n';
}
};
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
B754 solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0
| 84,504,028
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int N=0;
for(int i=0;i<S.size();i++){
if(S.at(i)=='x') N++;
}
cout<<(N>=8? "NO":"YES")<<endl;
}
|
#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 double long double
#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 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,K,ans=0,mx=1;
bool CAN=false;
cin>>N>>K;
ll A[N];
REP(i,N) cin>>A[i];
ll t=A[0];
REP(i,N){
t=gcd(t,A[i]);
chmax(mx,A[i]);
}
if(mx>=K){
if(t==1 || K%t==0) CAN=true;
}
if(CAN) co("POSSIBLE");
else co("IMPOSSIBLE");
return 0;
}
| 0
| 31,999,347
|
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
ll dp[6000][6000];
int main(){
ll N,K,A[10000],sum=0;
cin >> N >> K;
rep(i,N){
cin >> A[i];
sum+=A[i];
}
if(sum<K){
cout << N << endl;
return 0;
}
sort(A,A+N,[](const ll &a, const ll &b){return a>b;});
dp[0][0] = 1;
ll T = 0;
ll ma =0;
Rep(i,1,N+1){
if(ma + A[i-1]>= K){
T = i ;
}
rep(j,K){
if(j-A[i-1]>=0){
if(dp[i-1][j-A[i-1]]==1 || dp[i-1][j] == 1){
dp[i][j]=1;
ma = max(j,ma);
}
}
if(dp[i-1][j]==1){
dp[i][j]=1;
ma = max(j,ma);
}
}
}
cout << N-T << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string str;
cin >> str;
int y, m;
y = stoi(str.substr(0,4));
m = stoi(str.substr(5,2));
if(y < 2019){
cout << "Heisei" << endl;
}else if(y > 2019){
cout << "TBD" << endl;
}else{
if(m <= 4){
cout << "Heisei" << endl;
}else if(m > 4){
cout << "TBD" << endl;
}
}
}
| 0
| 20,472,002
|
#include <iostream>
int main(int argc, const char * argv[]) {
int x;
std::cin>>x;
std::cout<<(10-x/200)<<std::endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <cassert>
#include <string>
#include <memory.h>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <set>
#include <map>
#include <cctype>
#include <iomanip>
#include <sstream>
#include <cctype>
#include <fstream>
#include <cmath>
using namespace std;
#define REP2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define REP(i, n) REP2(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ITER(c) __typeof((c).begin())
#define PB(e) push_back(e)
#define FOREACH(i, c) for(ITER(c) i = (c).begin(); i != (c).end(); ++i)
#define MP(a, b) make_pair(a, b)
#define PARITY(n) ((n) & 1)
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1000 * 1000 * 1000 + 7;
const double EPS = 1e-10;
int ndays(int y, int m){
if(y % 3 == 0) return 20;
else return m % 2 ? 20 : 19;
}
int main(){
int n;
int y, m, d;
cin >> n;
while(n--){
cin >> y >> m >> d;
int days = 0;
while(y != 1000){
days++;
d++;
if(d == ndays(y, m) + 1){
d = 1;
m++;
if(m == 11){
m = 1;
y++;
}
}
}
cout << days << endl;
}
return 0;
}
| 0
| 13,620,139
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
string s;
cin>>s;
ll x=s.size();
if(x&1)s.erase(x-1,1),x-=1;
else s.erase(x-2,2),x-=2;
if(s.substr(0,(x/2))==s.substr(x/2,x/2)){cout<<x<<endl;return 0;}
while(1){
s.erase(x-2,2),x-=2;
if(s.substr(0,(x/2))==s.substr(x/2,x/2)){cout<<x<<endl;return 0;}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define INF 1e9
int main(){
int n;
cin >> n;
vector<int> r(n),c(n),p;
for(int i = 0 ; i < n ; i++){
cin >> r[i] >> c[i];
}
p.push_back(r[0]);
for(int i = 0 ; i < n ; i++){
p.push_back(c[i]);
}
int dp[n+1][n+1];
for(int i = 0 ; i <= n ; i++){
dp[i][i] = 0;
}
for(int l = 2 ; l <= n ; l++){
for(int i = 1 ; i <= n-l+1 ; i++){
int j = i + l - 1;
dp[i][j] = INF;
for(int k = i ; k <= j-1 ; k++){
int cost = dp[i][k] + dp[k+1][j] + p[i-1]*p[j]*p[k];
dp[i][j] = min(dp[i][j],cost);
}
}
}
cout << dp[1][n] << endl;
return 0;
}
| 0
| 48,233,633
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, z, w;
cin >> n >> z >> w;
vector<int> a(n);
for(auto &e : a) cin >> e;
int ans = abs(a[n - 1] - w);
if(n > 1) ans = max(ans, abs(a[n - 2] - a[n - 1]));
cout << ans << '\n';
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <stack>
#include <queue>
using namespace std;
#define Fill(a, b) memset(a, b, sizeof(a))
#define Debug(x) cout << #x << "=" << (x) << endl;
typedef long long LL;
const LL inf = 1LL << 61;
const LL mod = 1000000007;
#define DEBUG
#ifdef DEBUG
#endif
const int maxn = 510;
char mat1[maxn][maxn];
char mat2[2*maxn][2*maxn];
int main()
{
std::ios::sync_with_stdio(false);
int h, w, d;
scanf("%d%d%d", &h, &w, &d);
for(int i = 1, f1 = 0; i < 2*maxn; i+=d, f1++)
{
for(int j = 1, f2 = 0; j < 2*maxn; j+=d, f2++)
{
char ch;
if(f1%2)
{
if(f2%2)
{
ch = 'B';
}
else
{
ch = 'Y';
}
}
else
{
if(f2%2)
{
ch = 'R';
}
else
{
ch = 'G';
}
}
for(int r = i; r < min(i+d,2*maxn); r++)
{
for(int c = j; c < min(j+d,2*maxn); c++)
{
mat2[r][c] = ch;
}
}
}
}
for(int i = 1; i <= h; i++)
{
for(int j = 1; j <= w; j++)
{
int x = w+i-j, y = i+j-1;
mat1[i][j] = mat2[x][y];
}
}
for(int i = 1; i <= h; i++)
{
for(int j = 1; j <= w; j++)
{
printf("%c", mat1[i][j]);
}
puts("");
}
return 0;
}
| 0
| 83,377,841
|
#include <bits/stdc++.h>
#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 ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int d[N];
REP(i, N){
cin >> d[i];
}
sort(d, d+N);
int dif = d[N/2]-d[N/2-1];
cout << dif << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';
const int MOD = 1000 * 1000 * 1000 + 7;
int mod(int n) {
n %= MOD;
if (n < 0) return n + MOD;
else return n;
}
int fp(int a, int p) {
int ans = 1, c = a;
for (int i = 0; (1ll << i) <= p; ++i) {
if ((p >> i) & 1) ans = mod(ans * c);
c = mod(c * c);
}
return ans;
}
int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }
const int N = 2e5+7;
int f[N], inv[N];
void prec() {
f[0] = 1;
for (int i = 1; i < N; ++i)
f[i] = mod(f[i - 1] * i);
inv[N - 1] = fp(f[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; --i)
inv[i] = mod(inv[i + 1] * (i + 1));
}
int C(int n, int k) {
return mod(f[n] * mod(inv[k] * inv[n - k]));
}
vector <int> pos[N];
int ans[N];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n;
cin >> n;
vector <int> a(n+1);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
pos[a[i]].app(i);
}
int l = -1, r = -1;
for (int i = 1; i <= n; ++i) {
if (pos[i].size() == 2) {
l = pos[i][0];
r = pos[i][1];
}
}
prec();
for (int i = 1; i <= n + 1; ++i)
ans[i] = C(n+1, i);
int rs = n - r;
int sum = l + rs;
for (int i = 1; i <= n + 1; ++i) {
ans[i] = mod(ans[i] - C(sum, i - 1));
}
for (int i = 1; i <= n + 1; ++i)
cout << ans[i] << endl;
}
| 0
| 54,834,352
|
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define P pair<int, int>
#define rep(i,n) for(int i=0; i<(n); i++)
#define prtd(n, var) cout << fixed << setprecision(n) << var << "\n"
int main(){
int a, b, c;
cin >> a >> b >> c;
int A = a*10+b+c;
int B = a+b*10+c;
int C = a+b+c*10;
int ans = max(A, B);
ans = max(ans, C);
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(){
ll n,i,j,ans=0;
cin >> n;
for(i=1;i<n+1;++i){
for(j=1;i*j<n+1;++j){
ans += i*j;
}
}
cout << ans << endl;
return 0;
}
| 0
| 27,199,459
|
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <math.h>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rep3(var, min, max) for (ll (var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll (var) = (max) - 1; (var) + 1 > (min); --(var))
#define Mp(a,b) make_pair((a),(b))
#define F first
#define S second
#define CIN(s) int (s);cin>>(s);
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 pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll MOD = 1e9 + 7;
ll INF =1e18;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
V vec(n);
rep(i,n)cin>>vec[i];
reverse(all(vec));
ll k_max=2;
ll k_min=2;
if(vec[0]!=2){
cout<<-1<<endl;
return 0;
}
rep3(i,0,n-1){
k_max+=vec[i]-1;
k_max=(k_max/vec[i+1])*vec[i+1];
if(k_min%vec[i+1]!=0){
k_min=((k_min/vec[i+1])+1)*vec[i+1];
if(k_min>k_max){
cout<<-1<<endl;
return 0;
}
}
}
k_max+=vec[n-1]-1;
cout<<k_min<<" "<<k_max<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int M;
ll K;
cin >> M >> K;
if(K == 0) {
rep(i, 1<<M) cout << i << ' ' << i << ' ';
cout << "\n";
} else {
ll xorall = 0;
rep(i, 1<<M) xorall ^= i;
rep(j, 1<<M) {
if(K == j && K == (xorall^j)) {
rep(i, 1<<M) if(i!=j) cout << i << ' ';
cout << j << ' ';
rrep(i, (1<<M)) if(i!=j) cout << i << ' ';
cout << j << ' ';
cout << "\n";
return 0;
}
}
cout << -1 << "\n";
}
return 0;
}
| 0
| 35,274,314
|
#include<bits/stdc++.h>
using namespace std;
struct Unionfind{
vector<int> par,sizes;
Unionfind(int n) : par(n),sizes(n,1){
for(int i=0;i<n;i++){
par[i] = i;
}
}
int find(int x){
if(par[x] == x)return x;
else{
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];
}
int same(int x, int y){
return find(x) == find(y);
}
};
int main(){
int n,q,com,x,y;
cin >> n >> q;
Unionfind uni(n);
for(int i=0;i<q;i++){
cin >> com >> x >> y;
if(com == 1){
cout << uni.same(x,y) << endl;
}else{
uni.unite(x,y);
}
}
}
|
#include <stdio.h>
#include<math.h>
using namespace std;
#define SIZE 1001
int main(){
char buf[SIZE],longest[33],most_appear[33],tmp[33];
fgets(buf,SIZE,stdin);
int max_appear = -1,max_length = -1,tmp_length,tmp_count;
for(int i=0,k=0;buf[i] != '\0';){
tmp_length = 0;
tmp_count = 0;
for(k=i;buf[k] != '\0' && buf[k] != ' ';k++){
tmp[0+(k-i)] = buf[k];
tmp_length++;
}
if(max_length < tmp_length){
for(int p=0;p < tmp_length;p++){
longest[p] = tmp[p];
longest[p+1] = '\0';
}
max_length = tmp_length;
}
for(int p=0;buf[p] != '\0';){
int t,match_count=0;
for(t=0;buf[p+t] != '\0' && buf[p+t] != ' ' && t < tmp_length;t++){
if(buf[p+t] == tmp[t] || buf[p+t] == tmp[t]-32 || buf[p+t] == tmp[t]+32){
match_count++;
}
}
if(match_count == tmp_length && buf[p+t] == ' ')tmp_count++;
if(buf[p+t] != '\0'){
p += (t+1);
}else{
break;
}
}
if(max_appear < tmp_count){
for(int p=0;p < tmp_length;p++){
most_appear[p] = tmp[p];
most_appear[p+1] = '\0';
}
max_appear = tmp_count;
}
if(buf[k] != '\0'){
i = k+1;
}else{
break;
}
}
printf("%s %s\n",most_appear,longest);
return 0;
}
| 0
| 35,519,725
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int a[1000000],b[1000000],c;
for(int i=1;i<1000000;i++){
cin>>a[i]>>b[i];
c++;
if(a[i]==0 && b[i]==0){
goto aa;
}
}
aa:;
for(int i=1;i<c;i++){
for(int j=0;j<a[i];j++){
for(int k=0;k<b[i];k++){
cout<<"#";
}
cout<<endl;
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
#ifdef DEBUG_
#include "../program_contest_library/memo/dump.hpp"
#else
#define dump(...)
#endif
const ll INF = 1LL<<60;
int main(void) {
ll n;
cin >> n;
vector<ll> a(n), cnt(n);
REP(i, n) cin >> a[i], a[i]--, cnt[a[i]]++;
sort(ALL(cnt));
vector<ll> rui(cnt);
FOR(i, 1, n+1) rui[i] += rui[i-1];
vector<ll> able(n+1);
FOR(i, 1, n+1) {
ll itr = upper_bound(ALL(cnt), i) - cnt.begin();
able[i] = ((itr==0 ? 0 : rui[itr-1]) + (n-itr)*i) / i;
}
FOR(i, 1, n+1) {
ll lb = 0, ub = n+1;
auto check = [&](ll mid) { return i <= able[mid]; };
while(ub-lb>1) {
ll mid = (lb+ub)/2;
if(check(mid)) lb = mid;
else ub = mid;
}
cout << lb << "\n";
}
cout << flush;
return 0;
}
| 0
| 97,882,121
|
#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
T x; \
cin >> x;
#define AIN(T, a, n) \
vector<T> a(n); \
FOR(i, a) \
cin >> i;
#define A2IN(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) \
cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a) \
cout << #a << " = {"; \
JOUT(ALL(a), ", ", cout) << "}" << endl;
template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
if (s != e)
{
os << *s;
++s;
}
while (s != e)
{
os << sep << *s;
++s;
}
return os;
}
ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
if (cond)
{
os << yes << endl;
}
else
{
os << no << endl;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
os << '(' << p.first << ", " << p.second << ')';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
os << '[';
JOUT(ALL(v), ", ", os) << ']';
return os;
}
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template
int main()
{
IN(string, A);
IN(string, B);
string ans;
if (A.size() > B.size())
{
ans = "GREATER";
}
else if (A.size() < B.size())
{
ans = "LESS";
}
else
{
if (A > B)
{
ans = "GREATER";
}
else if (A == B)
{
ans = "EQUAL";
}
else
{
ans = "LESS";
}
}
OUT(ans);
}
|
#include <iostream>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,n){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define pii pair<int,int>
#define PI 3.141592653589793
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
int main(){
int H,W,D; cin>>H>>W>>D;
pii p[H*W+1];
REP(i,H){
REP(j,W){
int a; cin>>a;
p[a] = make_pair(i,j);
}
}
int d[H*W+1] = {0};
for(int i=D+1; i<=H*W; ++i){
d[i] = d[i-D] + abs(p[i].first-p[i-D].first) + abs( p[i].second-p[i-D].second );
}
int Q; cin>>Q;
REP(count,Q){
int L,R; cin>>L>>R;
ll ans = d[R]-d[L];
cout << ans << "\n";
}
}
| 0
| 72,954,040
|
#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;
cin >> N;
ll sum = 0;
ll a[N];
rep(i, N){
cin >> a[i];
sum += a[i];
}
ll cost1 = 0;
ll cost2 = 0;
ll center1 = sum / N;
ll center2 = sum / N + 1;
rep(i, N){
cost1 += (center1 - a[i]) * (center1 - a[i]);
cost2 += (center2 - a[i]) * (center2 - a[i]);
}
cout << min(cost1, cost2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, cnta=0, cntab=0, cntb=0;
cin>>N>>A>>B;
vector<int> p(N);
for(int i=0; i<N; i++){
cin>>p.at(i);
}
sort(p.begin(), p.end());
for(int i=0; i<N; i++){
if(p.at(i)<=A) cnta++;
else if(p.at(i)>=A+1 && p.at(i)<=B) cntab++;
else if(p.at(i)>=B+1) cntb++;
}
cout<<min(cnta, min(cntab, cntb))<<endl;
}
| 0
| 38,168,170
|
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a = 0;
int b = 0;
int c = 0;
int aw = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++)
{
if (c % i == 0)
{
aw++;
}
}
cout << aw << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(xi, x) for (auto &&xi : x)
template <class T> using vec = vector<T>;
using ll = long long;
using vi = vec<ll>;
using vvi = vec<vi>;
using vvvi = vec<vvi>;
using pii = pair<ll, ll>;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))
template <class T> pair<T, size_t> max(vector<T> &x) {
auto it = max_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> pair<T, size_t> min(vector<T> &x) {
auto it = min_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> inline bool chmax(T &maxval, const T &newval) {
if (maxval < newval) {
maxval = newval;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &minval, const T &newval) {
if (minval > newval) {
minval = newval;
return 1;
}
return 0;
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define inside(H, W, y, x) 0 <= (x) && (x) < (W) && 0 <= (y) && (y) < (H)
#ifdef LOCAL
#include "dump.hpp"
#define debug(x) cerr << #x << ": " << x << '\n'
#else
#define dump(...)
#define debug(x)
#endif
void yesno(bool ok, string yes = "Yes", string no = "No") {
cout << (ok ? yes : no) << endl;
}
string rotate(string S){
string R; R += S[S.size()-1];
rep(i,S.size()-1){
R += S[i];
}
return R;
}
void solve(std::string S, std::string T) {
bool ok = false;
rep(i,S.size()+1){
if(S==T){
ok = true; break;
}
S = rotate(S);
}
yesno(ok);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
std::string S;
std::cin >> S;
std::string T;
std::cin >> T;
solve(S, T);
return 0;
}
| 0
| 22,084,398
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
int ok = 1;
int X = 0, Y = 0, T = 0;
for (int i = 0; i < n; ++i)
{
int t, x, y; cin >> t >> x >> y;
X = abs(x - X);
Y = abs(y - Y);
T = t - T;
if (X + Y > T) ok = 0;
if ((X + Y) % 2 != T % 2) ok = 0;
}
cout << (ok ? "Yes" : "No") << endl;
}
|
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define PI acos(-1LL)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
int n,k;
cin>>n>>k;
vector<int>a(n);
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(rall(a));
int sum=0;
for(i=k;i<n;i++)
{
sum+=a[i];
}
cout<<sum<<endl;
}
| 0
| 58,690,618
|
#include <vector>
#include<stdio.h>
#include<string.h>
#include <cstring>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <set>
#include<cstring>
#define Max 0x3F3F3F
#define ll long long
#define MODD 1000000007
#define pii pair<int,int>
#include<stdio.h>
#include<queue>
using namespace std;
int main()
{
int a,b;cin >>a>>b;
cout<<100<<" "<<100<<endl;;
for(int i=0;i<50;i++){
for(int j=0;j<100;j++){
if(i==0)cout<<".";
else if(i%2){
if(j%2==1&&b>1)cout<<"#",b--;
else cout<<".";
}
else cout<<".";
}
cout<<endl;
}a--;
for(int i=0;i<50;i++){
for(int j=0;j<100;j++){
if(i==0)cout<<"#";
else if(i%2){
if(j%2==1&&a>0)cout<<".",a--;
else cout<<"#";
}
else cout<<"#";
}cout<<endl;
}
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=((int)(b));i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))
#define iter(v,ite) for(auto ite=(v).begin();ite!=(v).end();ite++)
#define mimunum(v,x) distance((v).begin(),lower_bound((v).begin(),(v).end(),x))
int n;
vector<int> vs[100005];
lli A[100005];
lli pn[100005];
bool dfs(int no,int pa){
lli cs=0,mcs=0;
bool isha=true;
rep(i,vs[no].size()){
int to=vs[no][i];
if(to==pa)continue;
if(!dfs(to,no))return false;
cs += pn[to];
mcs = max(mcs,pn[to]);
isha=false;
}
if(isha){
pn[no]=A[no];
return true;
}
pn[no]=A[no]*2-cs;
mcs = max(mcs,pn[no]);
if(pn[no]<0 || mcs>A[no])return false;
return true;
}
int main(){
scanf("%d",&n);
rep(i,n)scanf("%lld",&A[i]);
rep(i,n-1){
int a,b;
scanf("%d%d",&a,&b); a--; b--;
vs[a].push_back(b);
vs[b].push_back(a);
}
int st=0;
rep(i,n){
if(vs[i].size()==1)st=i;
}
puts((dfs(st,-1) && pn[st]==A[st])?"YES":"NO");
return 0;
}
| 0
| 94,491,727
|
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll DIV = 1000000007;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
long A, B, C;
cin >> A >> B >> C;
if(C-(A-B) > 0) cout << (C-(A-B)) << endl;
else cout << 0 << endl;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count() / 1000.0) << "[ms]" << endl;
#endif
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> t(n, 0), v(n, 0);
rep(i, n) cin >> t[i], t[i] *= 2;
rep(i, n) cin >> v[i];
ll tt = accumulate(all(t), 0LL);
vector<double> speed(tt + 1, 0);
ll idx = 0, sumt = 0;
reps(i, 1, tt) {
if (i > (sumt + t[idx])) {
sumt += t[idx];
idx++;
}
speed[i] = speed[i - 1] + 0.5;
speed[i] = min(speed[i], (double)v[idx]);
}
speed[tt - 1] = 0.5;
idx = n - 1, sumt = 0;
rrep(i, tt - 1) {
speed[i] = min(speed[i], speed[i + 1] + 0.5);
speed[i] = min(speed[i], (double)v[idx]);
if (i == (tt - sumt - t[idx])) {
sumt += t[idx];
idx--;
}
}
double ans = 0;
rep(i, tt) {
ans += (speed[i] + speed[i + 1]) * 0.5 / 2.0;
}
printf("%.10f\n", ans);
return 0;
}
| 0
| 8,207,294
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
char last = '-', current;
int n, sum = 0;
cin >> n;
cin.get();
for (int i = 0; i < n; i++) {
cin.get(current);
if (current != last) {
last = current;
sum++;
}
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int dfs(vector<vector<int>> &A, vector<int> &seen, int i) {
seen[i] = 1;
int res = 1;
rep(j,A[i].size()) {
int to = A[i][j];
if (seen[to]!=-1) continue;
res += dfs(A,seen,to);
}
return res;
}
int main(){
int N,M;
cin >> N >> M;
vector<vector<int>> A(N,vector<int>(0));
rep(i,M) {
int a,b;
cin >> a >> b;
a--,b--;
A[a].push_back(b);
A[b].push_back(a);
}
vector<int> seen(N,-1);
int ans = 0;
rep(i,N) {
if (seen[i]!=-1) {
continue;
}
ans = max(ans,dfs(A,seen,i));
}
cout << ans << endl;
}
| 0
| 94,666,466
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
ll a;
double b;
cin>>a>>b;
ll c=b*100+0.5;
cout<<a*c/100;
}
|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
v[k][j] %= MOD;
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
ll n,m;
cin >> n >> m;
int a[m] = {};
for(int i=0;i<m;i++){
cin >> a[i];
a[i]--;
}
ll dp[n+1] = {};
dp[0] = 1;
int j = 0;
for(int i=0;i<n;i++){
if(j<m && a[j]==i){
dp[i+1] = 0;
j++;
}
else{
dp[i+1] += dp[i];
if(i>=1) dp[i+1] += dp[i-1];
dp[i+1] %= MOD;
}
}
cout << dp[n] << endl;
return 0;
}
| 0
| 20,466,982
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define PI 3.1415926535
int main() {
double a, b, x;
cin >> a >> b >> x;
double theta;
if (x > a * a * b / 2) {
double air = a * a * b - x;
air /= a;
theta = atan(2 * air / (a * a));
} else {
x /= a;
theta = atan(b * b / (2 * x));
}
printf("%1.8f\n", theta * 180 / PI);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite) for(auto ite=begin(que) ; ite!=end(que) ; ite++)
const int max_n = 1e5;
const ll mod = 1e9+7;
const ll INF = 1LL<<60;
const int inf = 1e5;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
ll mo = 998244353;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
struct SegmentTree{
int N;
vector<int> node;
public :
void intit(vector<int>v){
int sz = v.size();
N=1;
while(N<sz) N*=2;
node.resize(N);
for(int i=0 ; i<sz ; i++) node[i+N-1] = v[i];
for(int i=N-2 ; i>=0 ; i--) node[i] = min(node[i*2+1], node[i*2+2]);
}
void update(int x, int val){
x += N-1;
node[x+N-1] = val;
while(x>0){
x = (x-1)/2;
node[x] = min(node[x*2+1], node[x*2+2]);
}
}
int getmin(int a, int b, int k, int l, int r){
if(b<=l || r<=a) return inf;
else if(a<=l && r<=b) return node[k];
else{
int vl = getmin(a, b, 2*k+1, l, (l+r)/2);
int vr = getmin(a, b, 2*k+2, (l+r)/2, r);
return min(vl, vr);
}
}
};
ll N,X;
ll rec(ll n, ll x){
if(n==0) return 1;
ll len = (1LL<<(n+1)) - 3;
ll num = (1LL<<n) - 1;
if(x==1) return 0;
else if(x<=len+1) return rec(n-1, x-1);
else if(x==len+2) return num+1;
else if(x<=(len+1)*2) return num+1+rec(n-1, x-(2+len));
else return 2*num+1;
}
int main(){
cin>>N>>X;
cout<<rec(N,X)<<endl;
return 0;
}
| 0
| 3,066,287
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0;i <= 25;i++)
{
for (int n = 0;n <= 14;n++)
{
if (N == 4 * i + 7 * n)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define ANS cout << ans << endl
#define RETURN(x) \
cout << x << endl; \
return 0
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll 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);
return (ret);
}
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;
}
signed main() {
init();
ll K, S;
cin >> K >> S;
ll ans = 0;
rep(x, K + 1) {
rep(y, K + 1) {
ll z = S - x - y;
if (0 <= z && z <= K
&& x + y + z == S) ans++;
}
}
ANS;
return 0;
}
| 0
| 57,276,189
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using Matrix = vector<vector<T>>;
const ll inf = 1LL<<60;
int main()
{
string s; cin>>s;
ll a=0, b=0;
for (auto c:s) {
int x = c-'0';
if (x == 0) a++;
else b++;
}
cout << min(a,b)*2 << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include<cstdio>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include <cstdlib>
#include <typeinfo>
#include <math.h>
#include <list>
#define REP(i, n) for(int i=0;i<n;i++)
#define REP2(i, s, n) for(int i=s;i<n;i++)
#define REP_1(i, n) for(int i=1;i<n+1;i++)
#define bitSearch(bit, n) for(int bit = 0; bit < (1 << n); bit++)
using namespace std;
template<class T>
void print(const T &value) {
std::cout << value << std::endl;
}
void yesno(bool a) { if (a)cout << "yes" << endl; else cout << "no" << endl; }
void YesNo(bool a) { if (a)cout << "Yes" << endl; else cout << "No" << endl; }
void YESNO(bool a) { if (a)cout << "YES" << endl; else cout << "NO" << endl; }
typedef long long ll;
typedef unsigned long ul;
typedef long double ld;
template<class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll INF = 10000000;
ll mod = 1000000007;
int dx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int dy[8] = {0, -1, 1, 0, -1, 1, -1, 1};
using Graph = vector<vector<int>>;
using GraphW = vector<vector<pair<int, int>>>;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using PP = pair<int, P>;
using p_queue = priority_queue<int, vector<int>, greater<int>>;
class UnionFindTree {
public:
UnionFindTree(int size) : memberSize(size) {
par.resize(size * sizeof(ll));
rnk.resize(size * sizeof(ll));
diff_weight.resize(size * sizeof(ll));
REP(i, size) {
par[i] = i;
rnk[i] = 0;
diff_weight[i] = 0;
}
}
int memberSize;
vector<int> par;
vector<int> rnk;
vector<ll> diff_weight;
void init(ll n) {
REP(i, n) {
par[i] = i;
rnk[i] = 1;
}
}
int find(ll x) {
if (par[x] == x) { return x; }
else {
int r = find(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
bool same(ll x, ll y) {
return find(x) == find(y);
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y) { return; }
if (rnk[x] < rnk[y]) {
par[x] = y;
} else {
par[y] = x;
if (rnk[x] == rnk[y]) { rnk[x]++; }
}
}
ll weight(ll x) {
find(x);
return diff_weight[x];
}
ll diff(ll x, ll y) {
return weight(y) - weight(x);
}
void merge(int x, int y, int w) {
w += weight(x);
w -= weight(y);
x = find(x);
y = find(y);
if (x == y) { return; }
if (rnk[x] < rnk[y]) {
par[x] = y;
diff_weight[x] = -w;
} else {
par[y] = x;
diff_weight[y] = w;
if (rnk[x] == rnk[y]) { rnk[x]++; }
}
}
};
int main() {
int N;
cin >> N;
ll T[N], A[N];
REP(i, N) { cin >> T[i]; }
REP(i, N) { cin >> A[i]; }
if (T[0] > A[0]) { print(0);return 0; }
if (T[N - 1] < A[N - 1]) { print(0);return 0; }
if (T[N-1] != A[0]) { print(0);return 0; }
ll ans = 1;
for (int i = 1; i < N - 1; i++) {
if (T[i] != T[i - 1]) {
if (T[i] > A[i]) { print(0);return 0; }
continue;
}
if (A[i] != A[i + 1]) {
if (A[i] > T[i]) { print(0);return 0; }
continue;
}
ans *= min(T[i], A[i]);
ans %= mod;
}
print(ans);
}
| 0
| 16,727,231
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int N, A;
cin >> N >> A;
if (N % 500 <= A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
ll prime_num[maxn],prime[maxn];
int dfs(int cur, int idx,int cnt,int sum)
{
int ans=0;
if(sum>=prime_num[idx]||cur>prime_num[idx])
{
if(sum==prime_num[idx])return cnt;
else return 0;
}
ans=max(ans,dfs(cur+1,idx,cnt+1,sum+cur));
ans=max(ans,dfs(cur+1,idx,cnt,sum));
return ans;
}
int main()
{
ll a;
cin>>a;
int cnt=0;
int mid=sqrt(a+0.5);
ll x=a;
for(int i=2; i<=mid; i++)
{
if(x%i==0)
{
prime[++cnt]=i;
while(x%i==0)
{
prime_num[cnt]++;
x/=i;
}
}
}
if(x>1)
{
prime[++cnt]=x;
prime_num[cnt]=1;
}
int ans=0;
for(int i=1; i<=cnt; i++)
{
ans+=dfs(1,i,0,0);
}
cout<<ans<<endl;
return 0;
}
| 0
| 91,230,719
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
string ans = "";
rep(i, s.size()) {
if (i % 2 == 0) ans += s[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define res(n) resize(n)
#define rev(v) reverse(v.begin(),v.end())
#define sor(v) sort(v.begin(),v.end())
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define ve vector
#define pq priority_queue
#define vi vector<int>
#define vl vector<long long>
#define vii vector<vector<int>>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
int main()
{
int N;cin>>N;
vi a(N);
in(N,a);
rep(i,N) a[i]--;
vi idx(N);
rep(i,N) idx[a[i]] = i;
ll ans = 0;
set<int> s;
for (int x = N-1; x >= 0; x--) {
int i = idx[x];
ll c = 0;
s.insert(i);
vi l(2,-1),r(2,N);
auto it = s.find(i);
rep(j,2){
if(it == s.begin()) break;
--it;
l[j] = *it;
}
it = s.find(i);
rep(j,2){
++it;
if(it == s.end()) break;
r[j] = *it;
}
vi ls(2);
ls[0] = -l[0]+i; ls[1]=l[0]-l[1];
vi rs(2);
rs[0] = r[0]-i; rs[1]=r[1]-r[0];
c = (ll)ls[0]*rs[1] + (ll)ls[1]*rs[0];
ans += c*(x+1);
}
out(ans);
return 0;
}
| 0
| 49,580,325
|
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define rep(i,n) for(int i=0; i<(n); ++i)
#define per(i,n) for(int i=n-1;i>=0;++i)
#define rep1(i,n) for(int i=1; i<=n; ++i)
#define per1(i,n) for(int i=n; i>=1; ++i)
#define debug cout << "line : " << __LINE__ << " debug" << endl
#define Dcout(N) cout << setprecision(20) << N << endl
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define INF 1e9
#define MOD 1000000007
typedef long long ll;
ll gcd(ll a, ll b) {return b ? gcd(b,a%b) : a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s; cin >> s;
int w; cin >> w;
rep(i,s.size()){
if(i%w==0) cout << s[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long int> a;
vector<char> tmp(10);
for (int i = 0; i < N; i++) {
string str;
cin >> str;
for (int j = 0; j < 10; j++) {
tmp[j] = str[j];
}
sort(tmp.begin(), tmp.end());
for (int j = 0; j < 10; j++) {
str[j] = tmp[j];
}
a[str]++;
}
long long int output = 0;
for (auto num : a) {
output += num.second * (num.second - 1) / 2;
}
cout << output << endl;
return 0;
}
| 0
| 54,004,899
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string s;
int n;
cin >> s >> n;
int a,b;
string str,str2;
for(int i = 0; i < n; i++){
cin >> str >> a >> b;
if(str == "print"){
for(int j = a; j < b+1; j++){
cout << s[j];
}
cout << endl;
}else if(str == "reverse"){
str2 = s.substr(a,b+1-a);
reverse(str2.begin(),str2.end());
s.replace(a,str2.length(),str2);
}else{
cin >> str2;
s.replace(a,str2.length(),str2);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
int ans;
if (n % k == 0) ans = 0;
else ans = 1;
cout << ans << endl;
return 0;
}
| 0
| 34,153,883
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll n, m;
cin >> n >> m;
vector<vector<ll>> v(n+1);
rep(i,m){
ll a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
bool can = false;
vector<ll> c1(n+1), c2(n+1);
for(auto i:v[1]) c1[i] = 1;
for(auto i:v[n]) c2[i] = 1;
REP(i,1,n+1) if(c1[i]+c2[i] == 2) can = true;
cout << (can ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int m, k;
cin >> m >> k;
if(k >= (1 << m))cout << -1 << endl;
else if(k == 1 && m == 1)cout << -1 << endl;
else if(k > 0){
rep(i, (1 << m))if(i != k)cout << i << ' ';
cout << k << ' ';
rep(i, (1 << m))if((1 << m) - 1 - i != k)cout << (1 << m) - 1 - i << ' ';
cout << k << endl;
}else{
rep(i, (1 << m))cout << i << ' ';
rep(i, (1 << m))cout << (1 << m) - 1 - i << ' ';
cout << endl;
}
}
| 0
| 81,344,903
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
string s;
cin >> n >> s;
vector<int> r, g, b(n, 0);
rep(i, n) {
switch (s.at(i)) {
case 'R': {
r.push_back(i);
break;
}
case 'G': {
g.push_back(i);
break;
}
case 'B': {
b[i] = 1;
break;
}
}
}
ll count = r.size() * g.size() * (n - r.size() - g.size());
for (auto i : r) {
for (auto j : g) {
int diff = abs(i - j);
int fail_a = min(i, j) - diff;
int fail_b = max(i, j) + diff;
int fail_c = (i + j) % 2 == 0 ? (i + j) / 2 : -1;
for (auto fail : {fail_a, fail_b, fail_c}) {
if (fail >= 0 && fail < n && b[fail] == 1) count--;
}
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define ll long long int
#define ld long double
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define bits(x) __builtin_popcount(x)
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#ifdef LOCAL
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template<typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << "# "<< name << " = " << arg1 << '\n';
}
template<typename Arg1, typename... Args>
void __f(const char* names, Arg1 && arg1, Args &&... args){
const char* comma = strchr(names + 1 ,',');
cout << "# ";
cout.write(names, comma - names)<< " = " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define debug(...) 36
#endif
std::mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int ri(int a, int b) {
return uniform_int_distribution<int>(a, b)(rng);
}
ll power(ll x, ll y, ll p){
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
const ll INF = (ll)(8e18);
const ll MOD = (ll)(1e9 + 7);
const ll HMOD = (ll)4222234727;
const ll Hashprime = (ll)31;
const int maxn = 1000100;
int spf[maxn], pr[maxn];
void sieve(){
spf[1] = 1;
for (int i = 2; i < maxn; i++) spf[i] = i;
for (int i = 4; i < maxn; i += 2) spf[i] = 2;
for (int i = 3; i * i < maxn; i++) {
if (spf[i] == i) {
for (int j = i * i; j < maxn; j += i)
if (spf[j] == j) spf[j] = i;
}
}
}
int32_t main(){
IOS;
#ifndef ONLINE_JUDGE
#endif
int t = 1;
while(t--){
int n; cin >> n;
std::vector<int> a(n + 1);
int tval = 0;
for(int i = 1; i <= n; i++) cin >> a[i];
sieve();
for(int i = 1; i <= n; i++){
tval = __gcd(tval, a[i]);
int val = a[i];
map <int, int> mp;
while(val != 1) {
if(mp.find(spf[val]) == mp.end()) pr[spf[val]] += 1;
mp[spf[val]] += 1;
val = val / spf[val];
}
}
bool flag = true;
for(int i = 1; i < maxn; i++){
if(pr[i] > 1) flag = false;
}
if(flag) cout << "pairwise coprime" << '\n';
else{
if(tval == 1) cout << "setwise coprime" << '\n';
else cout << "not coprime" << '\n';
}
}
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
| 0
| 62,664,044
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
bool A=false;
cin>>a>>b>>c;
for(int i=b;i<=c;i++){
if(i%a==0){
cout<<"OK"<<endl;
A=true;
break;
}
}
if(A==false)cout<<"NG"<<endl;
}
|
#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>
#define _GLIBCXX_DEBUG
#define DIVISOR 1000000007
using namespace std;
typedef pair<int,int> pii;
typedef pair<int64_t, int64_t> pII;
template<typename T>
void cins(vector<T>& arr) { for(T& e: arr) cin >> e; }
#ifdef DEBUG
#define debug(fmt, ...) \
printf("[debug: %s] " fmt, __func__, __VA_ARGS__)
#define ps(arr) \
debug("size %ld: ", arr.size()); \
for(auto e: arr) cout << e << " "; \
cout << endl;
#else
#define debug(fmt, ...)
#define ps(arr)
#endif
#define INF (1e+9)
int main(void) {
int num, cap, limit;
cin >> num >> cap >> limit;
vector<pii> ranges(num);
for(int i = 0; i < num; i++) {
int time;
cin >> time;
ranges[i] = make_pair(time, time+limit+1);
}
auto comp = [](pii a, pii b) {
return a.second < b.second;
};
sort(ranges.begin(), ranges.end(), comp);
int ans = 0;
int time = 0;
int ps = 0;
for(int i = 0; i < num; i++) {
pii r = ranges[i];
if(ps == cap) {
time = 0;
}
if(r.first < time) {
ps++;
} else {
ans++;
time = r.second;
ps = 1;
}
debug("[time: %d] %d\n", time, ans);
}
cout << ans << endl;
return 0;
}
| 0
| 81,767,413
|
#include <bits/stdc++.h>
using namespace std;
int64_t M = 1e9 + 7;
int main()
{int N; cin >> N;
vector<int64_t> A(N); for (auto &a : A) cin >> a;
auto ans = 0LL, p = 1LL;
for (int k = 0; k < 60; ++k)
{auto z = 0LL; for (auto a : A) if (!(a >> k & 1)) ++z;
ans = (ans + z * (N - z) % M * p % M) % M;
p = p * 2 % M;}
cout << ans << endl;}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, d;
long long a;
cin >> n >> d >> a;
vector<pair<int, long long> >v;
for(int i = 0; i < n; i++){
int p, q;
cin >> p >> q;
v.push_back({p, q});
}
sort(v.begin(), v.end());
vector<int>bomb;
vector<long long>val, pref;
bomb.push_back(-2000000000);
val.push_back(0);
pref.push_back(0);
for(int i = 0; i < n; i++){
int p = lower_bound(bomb.begin(), bomb.end(), v[i].first - 2 * d) - bomb.begin();
long long x;
if(p == bomb.size()){
x = v[i].second;
}
else{
long long r = pref.back() - pref[p] + val[p];
x = v[i].second - r * a;
}
if(x > 0){
long long cnt = x/a + (x % a != 0);
bomb.push_back(v[i].first);
val.push_back(cnt);
long long k = pref.back() + cnt;
pref.push_back(k);
}
}
cout << pref.back();
return 0;
}
| 0
| 97,280,900
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll INF = 1e16;
constexpr ll MOD = 1000000007;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
#define rep(i, N) for(ll i=0; i<(N); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b) { a = b; return 1; } else { return 0; }}
template<class T> inline bool chmin(T& a, T b) { if(a > b) { a = b; return 1; } else { return 0; }}
ll max(ll a, ll b) {return a < b ? b : a; }
ll min(ll a, ll b) {return a > b ? b : a; }
double maxf(double a, double b) { return a < b ? b : a; }
template<typename T> inline string toString(const T &a) {
ostringstream oss; oss << a; return oss.str();
}
ll gcd(ll x, ll y) { return x % y ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
ll repeatSquaring(ll n, ll p, ll mod) {
if(p == 0) return 1;
if(p % 2 == 0) {
ll t = repeatSquaring(n, p / 2, mod);
return t * t % mod;
} else {
return (n * repeatSquaring(n, p - 1, mod)) % mod;
}
}
ll comb(ll n, ll k, ll mod) {
ll res = 1;
rep(i, k) res = res * (n - i) % mod;
ll bunbo = 1;
rep(i, k) bunbo = bunbo * (k - i) % mod;
res = (res * repeatSquaring(bunbo, mod - 2, mod)) % mod;
return res;
}
int main() {
ll N, K;
cin >> N >> K;
int ma = (N-1)*(N-2) / 2;
if(ma < K) cout << -1 << endl;
else {
vector<pair<ll, ll>> edges;
for(int i = 1; i <= N - 1; ++i) {
edges.push_back(make_pair(i, N));
}
int rem = ma - K;
int ci = 1, cj = 2;
for(int _ = 0; _ < rem; ++_) {
edges.push_back(make_pair(ci, cj));
++cj;
if(cj == N) {
++ci;
cj = ci + 1;
}
}
cout << edges.size() << endl;
for(auto edge : edges) {
cout << (edge.first) << " " << (edge.second) << endl;
}
}
}
|
#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/(__gcd(a,b))
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define all(a) (a).begin(), (a).end()
#define vi vector<long long>
#define v vector
#define p pair
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
typedef double d;
using namespace std;
int modF=1e9+7;
int INF=1e11;
void solve(){
string s;
cin>>s;
if(s[2]==s[3] && s[4]==s[5]){
cout<<"Yes\n";
}
else{
cout<<"No\n";
}
}
signed main(){
boost_io;
solve();
return 0;
}
| 0
| 1,558,377
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int ans = 0;
rep(i,k) ans += a[i];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll sum(int n);
void go(){
int n,k;cin>>n>>k;
int ans=0;
while(n--){
int x;cin>>x;
if(x>=k) ans++;
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
go();
return 0;
}
ll sum(int n){
if(n == 0){
return n;
}else{
return sum(n/10) + n%10;
}
}
| 0
| 13,223,347
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll N;
string S[305];
bool A[305];
bool B[305];
bool solve(ll a, ll b)
{
ll s = std::min(a, b);
if (a > b)
{
return A[a - s];
}
return B[b - s];
}
int main()
{
cin >> N;
REP(i, N)
{
cin >> S[i];
}
memset(A, 0, sizeof(A));
memset(B, 0, sizeof(B));
REP(a, N)
{
A[a] = true;
REP(i, N)
{
REP(j, N)
{
int h0 = (N + i - a) % N;
int w0 = j;
int h1 = (N + j - a) % N;
int w1 = i;
if (S[h0][w0] == S[h1][w1])
continue;
A[a] = false;
break;
}
if (!A[a])
break;
}
}
REP(b, N)
{
B[b] = true;
REP(i, N)
{
REP(j, N)
{
int h0 = i;
int w0 = (N + j - b) % N;
int h1 = j;
int w1 = (N + i - b) % N;
if (S[h0][w0] == S[h1][w1])
continue;
B[b] = false;
break;
}
if (!B[b])
break;
}
}
ll ans = 0;
REP(a, N)
{
REP(b, N)
{
if (solve(a, b))
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
int a, b, counter;
char postal[100];
scanf("%d %d", &a, &b);
scanf("%s", postal);
for(int i = 0; i < a; i++){
if(postal[i]>='0'&&postal[i]<='9'){
counter++;
}
}
for(int i = a + 1; i<a+b+1; i++){
if(postal[i]>='0'&&postal[i]<='9'){
counter++;
}
}
if(postal[a]=='-'){
counter++;
}
if(counter==a+b+1){
printf("Yes");
}else{
printf("No");
}
}
| 0
| 8,245,675
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 5, P = 1e9 + 7;
int n, m, x[N], y[N];
int main() {
scanf("%d%d", &n, &m);
ll ans = 0, psum = 0;
for (int i = 1; i <= n; ++i) {
scanf ("%d", &x[i]);
ans += 1ll * (i - 1) * x[i] - psum;
ans %= P;
psum += x[i];
}
ll ans1 = 0;
psum = 0;
for (int i = 1; i <= m; ++i) {
scanf ("%d", &y[i]);
ans1 += 1ll * (i - 1) * y[i] - psum;
ans1 %= P;
psum += y[i];
}
cout << (ll)ans1 * ans % P << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
template <class T>
T GCD(T a, T b)
{
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ';
}
bool check = 0;
bool boo = 0;
int maxx = 0;
long long ans = 0;
int main()
{
INIT;
int N, K, M, L;
cin >> N >> K;
vi v(N);
rep(i, K)
{
cin >> M;
rep(j, M)
{
cin >> L;
v[L - 1]++;
}
}
for (auto &i : v)
i = !i;
cout << accumulate(ALL(v), 0) << endl;
return 0;
}
| 0
| 42,147,679
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <random>
using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x)
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0)
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs
i64 n;
vector<i64> a;
int main() {
cin >> n;
read_n(a, n);
i64 s = 0;
for (i64 x : a) s ^= x;
for (i64 i = 0; i < n; ++i) a[i] &= ~s;
for (i64 i = 59, k = 0; i >= 0; --i) {
bool f = false;
for (i64 j = k; j < n; ++j) {
if ((1ll << i) & a[j]) {
swap(a[k], a[j]);
f = true;
break;
}
}
if (!f) continue;
for (i64 j = 0; j < n; ++j) {
if (j != k && (1ll << i) & a[j]) a[j] ^= a[k];
}
++k;
}
i64 x = 0;
for (i64 y : a) x ^= y;
cout << s + 2 * x << endl;
return 0;
}
|
#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;
}
| 0
| 11,170,594
|
#include<iostream>
#include<algorithm>
#include<map>
#include<queue>
#include<cstdint>
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int N; std::cin >> N;
std::vector<int64_t> ans(N, 0);
std::map<int,std::pair<int,int64_t>> m;
for(int i = 0; i < N; ++i) {
int a; std::cin >> a;
if(m.count(a)>0) ++m[a].second;
else m[a] = std::make_pair(i, 1);
}
while(m.size() > 1) {
auto it = m.end();
--it;
auto p = it->second;
int64_t a = it->first;
m.erase(it);
ans[p.first] += (a - m.rbegin()->first)*p.second;
auto& np = m.rbegin()->second;
np.first = std::min(np.first, p.first);
np.second += p.second;
}
int a = m.begin()->first;
auto p = m.begin()->second;
ans[p.first] += a*p.second;
for(int i = 0; i < N; ++i) std::cout << ans[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 123;
char a[N][N];
bool sc[N], sr[N];
void solve() {
int h, w; scanf("%d%d", &h, &w);
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
scanf(" %c", a[i]+j);
if (a[i][j] == '#') {
sr[i] = true;
sc[j] = true;
}
}
}
for (int i = 0; i < h; ++i) {
if (!sr[i]) continue;
for (int j = 0; j < w; ++j) {
if (!sc[j]) continue;
putchar(a[i][j]);
}
puts("");
}
}
int main() {
init();
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 0
| 44,632,583
|
#include <bits/stdc++.h>
using namespace std;
int dp[1 << 20], pd[1 << 26], state[1 << 20];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
for (int i = 0; i < s.length(); i++) s[i] -= 'a';
for (int i = 0; i < s.length(); i++) {
if (i) state[i] = state[i - 1];
state[i] ^= (1 << s[i]);
}
for (int i = 0; i < 1 << 26; i++) pd[i] = 1 << 20;
pd[0] = 0;
for (int i = 0; i < s.length(); i++) {
if (i == 0) {
dp[i] = 1;
pd[state[i]] = 1;
continue;
}
int now = state[i - 1];
dp[i] = min(pd[now], pd[now ^ (1 << s[i])]) + 1;
for (int j = 0; j < 26; j++) dp[i] = min(dp[i], pd[now ^ (1 << s[i]) ^ (1 << j)] + 1);
pd[state[i]] = min(dp[i], pd[state[i]]);
}
cout << dp[s.length() - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> x(n);
for (ll i = 0;i < n;i++){
cin >> x[i];
}
deque<ll> a;
deque<ll> b;
for (ll i = 0; i < n; i++){
if (i%2 == 0){
a.push_back(x[i]);
}
else{
b.push_back(x[i]);
}
}
if (n%2 == 0){
reverse(b.begin(),b.end());
for (ll i = 0; i < b.size(); i++){
cout << b[i] << " ";
}
for (ll i = 0; i < a.size(); i++){
cout << a[i] << " ";
}
}
else{
reverse(a.begin(),a.end());
for (ll i = 0; i < a.size(); i++){
cout << a[i] << " ";
}
for (ll i = 0; i < b.size(); i++){
cout << b[i] << " ";
}
}
cout << endl;
}
| 0
| 46,353,749
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void solve1()
{
int n;
cin >> n;
vector<int> a(n);
vector<int> dp(n);
for (int i = 0; i < n; ++i)
{
cin >> a[i];
dp[i] = 1;
}
int res = 0;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if (a[j] < a[i])
{
dp[i] = max(dp[i], dp[j] + 1);
}
}
res = max(res, dp[i]);
}
cout << dp[n - 1] << endl;
}
void solve2()
{
int n;
cin >> n;
vector<int> a(n);
vector<int> dp(n);
for (int i = 0; i < n; ++i)
{
cin >> a[i];
dp[i] = 2e9;
}
for (int i = 0; i < n; ++i)
{
*lower_bound(dp.begin(), dp.end(), a[i]) = a[i];
}
cout << lower_bound(dp.begin(), dp.end(), 2e9) - dp.begin() << endl;
}
int main()
{
solve2();
return(0);
}
|
#include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I1000000007 (1000000007)
#define I998244353 (998244353)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define yesno(cond) YESNO((cond), "Yes", "No")
#define YESNO(cond, a, b) cout << ((cond) ? (a) : (b)) << "\n"
template<class T> inline bool chmin(T& a, const T& b) {
if (a > b) { a = b; return true; } else return false;
}
template<class T> inline bool chmax(T& a, const T& b) {
if (a < b) { a = b; return true; } else return false;
}
namespace solver {
using namespace std;
using ll = long long;
void init() {
}
void solve() {
string S, T;
map<char, char> m;
vector<bool> used(30);
fill(ALL(used), false);
cin >> S >> T;
rep(i, S.size()) {
if(m.find(S[i]) == m.end() && !used[T[i]-'a']) m[S[i]] = T[i], used[T[i]-'a'] = true;
else if(m.find(S[i]) == m.end() || m[S[i]] != T[i]) {
cout << "No" << "\n";
return;
}
}
cout << "Yes" << "\n";
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solver::init();
solver::solve();
return 0;
}
| 0
| 6,012,460
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll N,K;
string S;
cin >> N>>K;
vector<ll> A(N);
REP(i,N){
cin >> A.at(i);
}
ll num = 0;
REP(i, N)
{
if(A.at(i)==1){
num = i;
break;
}
}
if(num==0||num==N-1){
if((N-1)%(K-1)==0){
cout << (N - 1) / (K - 1) << endl;
}
else{
cout << (N - 1) / (K - 1) + 1 << endl;
}
}
else
{
if ((N - 1) % (K - 1) == 0)
{
cout << (N - 1) / (K - 1) << endl;
}
else
{
cout << (N - 1) / (K - 1) + 1 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans,num,s[100010];
int main()
{
int n,i,m,a;
cin >> n >> m;
for(i = 1; i <= n; i ++)
{
scanf("%d",&a);
s[i] = (s[i-1] + a) % m;
}
sort(s+1,s+n+1);
for(i = 1; i < n; i ++)
{
if(s[i] == s[i+1]) ans ++;
else
{
ans ++;
if(s[i] == 0)
num += ans * (ans+1) / 2;
else
num += ans * (ans-1) / 2;
ans = 0;
}
}
if(s[n] == s[n-1]) ans ++;
if(s[n-1] == 0)
num += ans * (ans+1) / 2;
else
num += ans * (ans-1) / 2;
cout << num << endl;
return 0;
}
| 0
| 49,130,904
|
#include <iostream>
#include <string>
using namespace std;
int const NMAX = 1e5;
int v[1 + NMAX];
int main() {
int n, pos = 1, p, ans = 0;
string A, B;
cin >> A >> B;
if(A.size() < B.size()){
cout << "LESS";
}else if(A.size() > B.size()){
cout << "GREATER";
}else{
if(A < B){
cout << "LESS";
}else if(A > B){
cout << "GREATER";
}else{
cout << "EQUAL";
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#define int long long
using namespace std;
inline int in() {int32_t x ; scanf("%d",&x) ; return x ; }
inline string getStr() {char ch[1000000] ; scanf("%s",ch) ; return ch ;}
const int MAX_N = 1e4 + 5;
int pr[MAX_N];
int sz[MAX_N];
int find(int p)
{
if (pr[p] == p ) return p;
return pr[p] = find(pr[p]);
}
int32_t main()
{
int n = in() , q = in();
for (int i = 0 ; i < n ; i ++)
pr[i] = i , sz[i] = 1;
for (int i = 0 ; i < q ; i ++)
{
bool tp = in();
int u = in() , v = in();
if (tp)
{
cout << (find(u) == find(v)) << "\n";
}
else
{
u = find(u) , v = find(v);
if (sz[u] < sz[v]) swap(u , v);
pr[v] = u;
if (sz[v] == sz[u]) sz[u] ++;
}
}
}
| 0
| 76,528,322
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
#define mrep(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> dp(n + 1);
dp.at(0) = 1;
ll sm = 0;
mrep(i, 1, n + 1){
if(i >= 3){
sm = (sm + dp.at(i - 3)) % mod;
}
dp.at(i) = sm % mod;
}
cout << dp.at(n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include<iostream>
#include <string>
using namespace std;
int main() {
int A,B,M;
cin >> A >> B >> M;
vector<int>a(A);
vector<int>b(B);
for(int i = 0;i < A;i++){
cin >> a.at(i);
}
for(int i = 0;i < B;i++){
cin >> b.at(i);
}
int tmp,x,y,z,ans(9999999);
for(int i = 0;i < M;i++){
cin >> x >> y >> z;
x--;
y--;
tmp = a[x] + b[y] - z;
ans = min(ans,tmp);
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
tmp = a.at(0) + b.at(0);
ans = min(ans,tmp);
cout << ans;
}
| 0
| 5,711,321
|
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
string S;
cin >> S;
S = S.substr(5, 2);
int m = std::stoi(S);
if (m <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
ll binpow(ll a, ll b) {
if (b == 0)
{
return 1;
}
ll res = binpow(a, b / 2);
res*=res;
if (b % 2)
{
return res * a;
}
return res;
}
ll gcd(ll a,ll b)
{
if (b==0) return a;
return gcd(b,a%b);
}
string to_upper(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
return a;
}
string to_lower(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
return a;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n,k,s;
cin>>n>>k>>s;
for (int i=0;i<n;++i)
{
if (i<k)
cout<<s<<" ";
else if (s!=1e9)
cout<<s+1<<" ";
else
cout<<s-1<<" ";
}
return 0;
}
| 0
| 51,331,277
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
vector<string> G(x);
vector<vector<int>> flip(x,vector<int>(y));
for (auto &s : G) cin >> s;
if (G[0][0] == '.') flip[0][0] = 0;
else flip[0][0] = 1;
for (int i = 1; i < y; i++) {
flip[0][i] = flip[0][i-1];
if (G[0][i-1] == '.' && G[0][i] == '#') flip[0][i] += 1;
}
for (int i = 1; i < x; i++) {
for (int j = 0; j < y; j++) {
if (j == 0) {
flip[i][0] = flip[i-1][0];
if (G[i-1][0] == '.' && G[i][0] == '#') flip[i][0] += 1;
}
else {
int u = flip[i-1][j];
int l = flip[i][j-1];
if (G[i][j] == '#') {
if (G[i-1][j] == '.') u++;
if (G[i][j-1] == '.') l++;
}
flip[i][j] = min(u,l);
}
}
}
cout << flip[x-1][y-1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long K, std::string S)
{
if (S.size() <= K)
{
cout << S << endl;
}
else
{
for (ll i = 0; i < K; i++)
{
cout << S[i];
}
cout << "..." << endl;
}
}
signed main()
{
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| 0
| 57,697,201
|
#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 rall(x) (x).rbegin(), (x).rend()
#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 vc = vector<char>;
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, K;
string S;
cin >> N >> S >> K;
char al = S[K-1];
string ans;
rep(i, 0, N) {
if (S[i] != al) {
ans += '*';
} else {
ans += S[i];
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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, d;
cin >> a >> b >> c >> d;
if(a+b == c+d){
cout << "Balanced" << endl;
}
else if (a+b > c+d){
cout << "Left" << endl;
}
else {
cout << "Right" << endl;
}
}
| 0
| 29,242,309
|
#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 mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((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;}
template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n;
ll ans=0LL;
cin >>n;
VPi a(n);
rep(i, n) { cin >> a[i].F;
a[i].S = i;
}
sort(all(a));
int ns = 0;
rep(i,n){
if((i%2)!= (a[i].S%2)){
ns++;
}
}
cout<<ns/2<<endl;
}
|
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int n;
int d[120][120];
int main(){
cin>>n;
for(int i =0;i < n;i++){
int u,k;
cin>>u>>k;
for(int j =0;j <k;j++){
int c;
cin>>c;
d[u][c]=1;
}
}
for(int i =1;i <=n;i++){
for(int j =1;j <=n;j++){
if(j==1)cout <<d[i][j];
else cout <<" "<<d[i][j];
}
cout <<endl;
}
return 0;
}
| 0
| 57,163,336
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int n;
cin >> n;
double a;
rep(i, n){
int d;
cin >> d;
a += (double)1/d;
}
cout << fixed << setprecision(10) << (double)1/a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(), a.end());
int cnt = 0;
int uk = 0;
while (uk < n && a[uk] == a[0]) {
++cnt;
++uk;
}
if (cnt > 2) {
cout << "Impossible\n";
return 0;
}
if (cnt == 1) {
if (a.back() > 2 * a[0]) {
cout << "Impossible\n";
return 0;
}
} else {
if (a.back() >= 2 * a[0]) {
cout << "Impossible\n";
return 0;
}
}
for (int i = 1; i < n; ++i) {
if (a[i] - a[i - 1] > 1) {
cout << "Impossible\n";
return 0;
}
}
cout << "Possible\n";
}
| 0
| 21,244,325
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
int main(){
FAST
int n, m; cin >> n >> m;
vector<int> rows[n + 2];
vector<int> cols[m + 2];
int lastOR[n + 2];
int lastOC[m + 2];
mm(lastOR); mm(lastOC);
string mat[n + 2];
string s = " ";
for(int i = 0; i < m + 2; i++){
s += '#';
}
mat[0] = s;
mat[n + 1] = s;
for(int i = 1; i <= n; i++){
cin >> mat[i];
mat[i] = '#' + mat[i];
mat[i] += '#';
}
for(int i = 0; i <= n + 1; i++){
for(int j = 0; j <= m + 1; j++){
if(mat[i][j] == '#'){
rows[i].pb(j);
cols[j].pb(i);
}
}
}
int ans = 0;
for(int i = 0; i <= n + 1; i++){
for(int j = 0; j <= m + 1; j++){
if(mat[i][j] == '.'){
int curr = j - lastOR[i] + i - lastOC[j] - 1;
int ind = lower_bound(rows[i].begin(), rows[i].end(), j) - rows[i].begin();
if(rows[i].size() == ind){
curr += m - j - 1;
}
else{
ind = rows[i][ind];
curr += ind - j - 1;
}
ind = lower_bound(cols[j].begin(), cols[j].end(), i) - cols[j].begin();
if(ind == cols[j].size()){
curr += n - i - 1;
}
else{
ind = cols[j][ind];
curr += ind - i - 1;
}
ans = max(ans, curr);
}
else{
lastOR[i] = j;
lastOC[j] = i;
}
}
}
cout << ans;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
char b;
for(int i=0;i<5;i++){
char a;
cin>>a;
cout<<a;
}
cin>>b;
cout<<" ";
for(int i=0;i<7;i++){
char a;
cin>>a;
cout<<a;
}
cin>>b;
cout<<" ";
for(int i=0;i<5;i++){
char a;
cin>>a;
cout<<a;
}
cout<<endl;
}
| 0
| 15,314,731
|
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(n);
vector<int> c(m);
vector<int> d(m);
for(int in=0;in<n;in++) {
cin >> a.at(in) >> b.at(in);
}
for(int im=0;im<m;im++) {
cin >> c.at(im) >> d.at(im);
}
int ans, dis, distmp;
for(int in=0;in<n;in++) {
ans = 0;
dis = 1e9;
distmp;
for(int im=0;im<m;im++) {
distmp = abs(a.at(in)-c.at(im)) + abs(b.at(in)-d.at(im));
if(dis>distmp) {
dis = distmp;
ans = im+1;
}
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
vector<int> v(n);
rep(i,n){
cin >> v.at(i);
}
vector<int> fr(n+1),fl(n+1);
fl.at(0) = 0;
fr.at(0) = 0;
rep(i,n){
fl.at(i+1) = fl.at(i) + v.at(i);
fr.at(i+1) = fr.at(i) + v.at(n-1-i);
}
vector<pair<int,int>> vp;
rep(i,n){
if(v.at(i) < 0) vp.push_back({v.at(i), i});
}
sort(vp.begin(), vp.end());
int res = 0;
for(int i=0;i<=n;i++){
for(int j=0;j<=n && i+j<=k && i+j<=n;j++){
int kmx = k-i-j;
int kcr=0;
int tot=0;
tot += fl.at(i);
tot += fr.at(j);
for(auto p:vp){
if(kcr>=kmx) break;
if(p.second < i || p.second > n-1-j){
kcr++;
tot -= p.first;
}
}
res = max(res,tot);
}
}
cout << res << endl;
return 0;
}
| 0
| 27,672,053
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define int long long
#define vi vector<int>
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repr(i, a, b) for(int i = a - 1; i >= b; i--)
#define iter(m) for(auto it = m.begin(); it != m.end(); it++)
#define iterr(m) for(auto it = m.rbegin(); it != m.rend(); it++)
#define N 500500
#define PI 3.14159265358979323846264338327950L
#define speed ios_base :: sync_with_stdio(0);cin.tie(0);cout.tie(0);
signed main(){
speed;
int n; cin >> n;
stack<char> st;
string s; cin >> s;
rep(i, 0, s.size()) {
char c; c = s[i];
if(st.empty()) {
st.push(c);
} else {
if(st.top() != c && st.top() == '(') {
st.pop();
} else {
st.push(c);
}
}
}
int cnt1 = 0, cnt2 = 0;
while(!st.empty()) {
if(st.top() == '(') cnt2++;
else cnt1++;
st.pop();
}
rep(i, 0, cnt1) cout << '(';
cout << s;
rep(i, 0, cnt2) cout << ')';
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
int n;
cin>>n;
vector<ll> a(n),b(n);
for(int i=0; i<n; i++) cin>>a[i];
for(int i=0; i<n; i++) cin>>b[i];
vector<ll> ab(n);
for(int i=0; i<n; i++){
ab[i]=b[i]-a[i];
}
sort(ab.begin(),ab.end());
ll cnt=0,tmp=0;
for(int i=0; i<n; i++){
if(ab[i]>0){
tmp+=ab[i];
cnt++;
}
}
for(int i=0; i<n; i++){
if(tmp>0&&ab[i]<0){
tmp+=ab[i];
cnt++;
}
}
if(tmp>0) cout<<-1<<endl;
else cout<<cnt<<endl;
}
| 0
| 86,926,676
|
#include <stdio.h>
int main(){
int n;
char str[50010];
int x = 0;
int ctr = 0;
scanf("%d", &n);
scanf("%s", str);
for(int i = 0;i < 10;i++){
for(int j = 0;j<10;j++){
for(int k = 0;k<10;k++){
char test[] = {i,j,k};
x = 0;
for(int a = 0;a <n;a++){
if(str[a] - '0' == test[x]){
x++;
}
if(x == 3){
ctr++;
break;
}
}
}
}
}
printf("%d", ctr);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<bitset<20>> vbi;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
ll modpow(ll x, ll n, ll mod = MAX)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll factorial(ll n)
{
if (n > 0)
return n * factorial(n - 1);
else
return 1;
}
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
void Main()
{
ll n, h; cin >> n >> h;
vll a(n), b(n);
ll A = 0;
rep(i, n)
{
cin >> a[i] >> b[i];
A = max(A, a[i]);
}
sort(all(b));
reverse(all(b));
ll flag = 0;
rep(i, n)
{
if(b[i] > A)
{
flag++;
h -= b[i];
}
else break;
if(h <= 0) fin(flag);
}
fin(flag + (h + A - 1) / A);
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
| 0
| 16,190,665
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template <class T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
const int MAX = 100100;
int N;
vector<int> A;
ll acc_l[MAX] = {0};
void solve() {
cin >> N;
int a;
A.push_back(0);
loop(n,0,N) {
cin >> a;
A.push_back(a);
}
A.push_back(0);
N += 2;
loop(n,1,N) acc_l[n] = acc_l[n-1] + abs(A[n] - A[n-1]);
loop(k,1,N-1) {
cout << acc_l[k-1] + abs(A[k+1]-A[k-1]) + (acc_l[N-1] - acc_l[k+1]) << endl;
}
}
int main() {
solve();
return 0;
}
|
#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl
const ll mod = 1e9 + 7;
const ll inf = 1e18;
string getLine(char c, int length){
stringstream ss;
FOR(i, 0, length){
ss << c;
}
return ss.str();
}
vector<string> grid(100);
int paintDot(char color, int rowIndex, int maxInkNuM){
int offset = 0;
if(rowIndex % 2 == 1){
offset = 2;
}
int i = 0;
int paintNum = 0;
while(i < 100 && maxInkNuM - paintNum > 0){
grid[rowIndex][i+offset] = color;
i+=4;
paintNum++;
}
return paintNum;
}
void printGrid(){
FOR(i, 0, 100){
p(grid[i]);
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
FOR(i, 0, 50){
grid[i] = getLine('#', 100);
}
FOR(i, 50, 100){
grid[i] = getLine('.', 100);
}
int drawNum = A-1;
int rowIndex = 0;
while(drawNum>0){
int drawnNum = paintDot('.', rowIndex, drawNum);
drawNum -= drawnNum;
rowIndex++;
}
drawNum = B-1;
rowIndex = 51;
while(drawNum>0){
int drawnNum = paintDot('#', rowIndex, drawNum);
drawNum -= drawnNum;
rowIndex++;
}
p("100 100");
printGrid();
return 0;
}
| 0
| 34,760,405
|
#include<iostream>
#include<string>
#include<sstream>
#include<cctype>
#include<cstdlib>
#include<map>
using namespace std;
#define REP(i, j) for(int i = 0; i < j; i++)
map<char, int> alpha_to_num;
map<int, char> num_to_alpha;
int solve(string s){
int ret = 0;
REP(i, s.length()){
if(isdigit(s[i])) continue;
if(i == 0 || isalpha(s[i - 1])) ret += alpha_to_num[s[i]];
else ret += (alpha_to_num[s[i]] * (s[i - 1] - '0'));
}
return ret;
}
void disp(int n){
stringstream ss;
for(int i = 1000; i > 0; i /= 10){
int now = n / i;
if(now == 0) continue;
if(now == 1) ss <<num_to_alpha[i];
else ss <<now <<num_to_alpha[i];
n -= (now * i);
}
cout <<ss.str() <<endl;
}
int main(){
alpha_to_num['m'] = 1000;
alpha_to_num['c'] = 100;
alpha_to_num['x'] = 10;
alpha_to_num['i'] = 1;
num_to_alpha[1000] = 'm';
num_to_alpha[100] = 'c';
num_to_alpha[10] = 'x';
num_to_alpha[1] = 'i';
int n; cin >>n;
REP(z, n){
string a, b; cin >>a >>b;
disp(solve(a) + solve(b));
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define PI 3.14159265358979323846
#define lp(i,n) for(int i = 0; i <n;i++)
#define rlp(i,n) for(int i = int(n);i >= 0;i--)
#define range1(i,a,b,c) for(int i = int(a);i <= int(b);i+=int(c))
#define range(i,a,b) for(int i = int(a);i <= int(b);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define MP make_pair
#define fr first
#define sc second
#define sz(v) ((int)((v).size()))
#define sfi1(v) scanf("%d",&v)
#define sfi2(v1, v2) scanf("%d %d",&v1,&v2)
#define sfi3(v1, v2, v3) scanf("%d %d %d",&v1,&v2,&v3)
#define sfll1(v) scanf("%I64d",&v);
#define sfll2(v1, v2) scanf("%I64d %I64d",&v1,&v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d",&v1,&v2,&v3)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
typedef pair<int, int> pii;
template<class T> using ordered_set=tree<T,
null_type,
less<T>,
rb_tree_tag,
tree_order_statistics_node_update>;
const ll MOD = 1e9 + 7;
const int OO = (int)1e6;
const int N = (int)1e7;
int dx[] = {0,0,-1,1};
int dy[] = {1,-1,0,0};
void init(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
# ifdef LOCAL_PROJECT
freopen("in.txt", "r", stdin);
# endif
int n,l;
scanf("%d %d",&n,&l);
vector<string>v;
v.resize(n);
for(string &s:v){
cin>>s;
}
sort(all(v));
lp(i,n)
cout<<v[i];
return 0;
}
| 0
| 87,131,852
|
#include <stdio.h>
int main(void) {
int i, ans = 0, j, n;
while(scanf("%d", &n) != EOF) {
ans = 0;
for(i = 0; i * n < 600; ++i) ans += n * i * i * n * n;
printf("%d\n", ans);
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max({a, b, c}) << endl;
return 0;
}
| 0
| 96,530,567
|
#include<iostream>
int main(){
int n,a,b,c,d,f;
while(std::cin>>n){
f=0;
for(a=0;a<10;a++)
for(b=0;b<10;b++)
for(c=0;c<10;c++)
for(d=0;d<10;d++)
if(a+b+c+d==n)f++;
std::cout<<f<<"\n";
}
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p)
{
return os << '(' << p.first << ", " << p.second << ')';
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec)
{
int n = 0;
for (auto e : vec)
os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &st)
{
int n = 0;
for (auto e : st)
os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::map<T, U> &mp)
{
int n = 0;
for (auto e : mp)
os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &vec)
{
for (T &e : vec)
is >> e;
return is;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out()
{
std::cerr << '\n';
}
template <class Head, class... Tail>
void debug_out(Head &&head, Tail &&... tail)
{
std::cerr << head;
if (sizeof...(Tail) != 0)
std::cerr << ", ";
debug_out(std::forward<Tail>(tail)...);
}
using namespace std;
using int64 = long long;
int main()
{
int N;
cin >> N;
vector<int> D(N);
cin >> D;
if (D[0] != 0)
{
cout << 0 << endl;
return 0;
}
map<int, int> mp;
int mx = 0;
for (int i = 0; i < N; i++)
{
mx = max(mx, D[i]);
if (mp.count(D[i]))
{
mp[D[i]]++;
}
else
{
mp[D[i]] = 1;
}
}
debug(mp);
if (mp[0] != 1)
{
cout << 0 << endl;
return 0;
}
int64 ans = 1;
for (int i = 1; i <= mx; i++)
{
if (!mp.count(D[i]))
{
cout << 0 << endl;
return 0;
}
for (int j = 0; j < mp[i]; j++)
{
ans *= mp[i - 1];
ans %= 998244353;
}
}
cout << ans << endl;
return 0;
}
| 0
| 32,590,190
|
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mod 1000000007
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
#define yes cout<<"Yes"<<'\n';
#define no cout<<"No"<<'\n';
using namespace std;
int main()
{
godspeed
ll i,j,n,k,ans,cnt=0;
string s;
cin>>n>>k;
cout<<n-k+1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
constexpr int INF = 1e9;
constexpr long long INFLL = 1LL<<60;
constexpr double eps = (1e-9);
ll calc(const vector<ll>& n_all, const vector<ll>& n_p, ll n, ll x) {
if (n == 0 && x > 0) return 1;
else if (n == 0) return 0;
x--;
ll ret = 0;
if (x >= n_all[n-1]) {
ret += n_p[n-1];
x -= n_all[n-1];
if (x > 0) {
ret++;
x--;
}
}
if (x <= 0) return ret;
ret += calc(n_all, n_p, n-1, x);
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vector<ll> n_p(51);
vector<ll> n_all(51);
n_p[0] = 1;
n_all[0] = 1;
for (int i = 1; i <= 50; i++) {
n_p[i] = n_p[i-1] * 2 + 1;
n_all[i] = n_all[i-1] * 2 + 3;
}
ll ans = calc(n_all, n_p, n, x);
cout << ans << endl;
return 0;
}
| 0
| 21,152,500
|
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).substr((f),(t)-(f)))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
struct UF
{
vector<int> par;
vector<int> sz;
vector<int> rank;
UF(int n):par(n),sz(n),rank(n){
for(int i = 0; i < n; i++){
par[i] = i;sz[i] = 1;rank[i] = 0;
}
}
int find(int x) {
if (par[x] == x) return x;
else return par[x] = find(par[x]);
}
void merge(int x, int y) {
x = find(x); y = find(y);
if (x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
sz[y] += sz[x];
}
else{
par[y] = x;
sz[x] += sz[y];
if(rank[x] == rank[y])rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int n){return sz[find(n)];}
};
bool isdig(char c){
return '0' <= c && c <= '9';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,h,w;cin>>n>>h>>w;
ll ans = 0;
for(int i=0;i<n;i++){
ll a,b;cin>>a>>b;
ans += min(a/h,b/w);
}
cout<<ans<<endl;
return 0;
}
|
#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()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODADD(ADD_X,ADD_Y) (ADD_X+ADD_Y)%MOD;
#define MODSUB(SUB_X,SUB_Y) (SUB_X-SUB_Y)+MOD)%MOD;
#define MODMUL(MUL_X,MUL_Y) (MUL_X*MUL_Y)%MOD;
#define LCM(LCM_X,LCM_Y) (LCM_X*LCM_Y)/__gcd(LCM_X,LCM_Y);
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
int dx[]= {1,0,-1,0,1,-1,1,-1};
int dy[]= {0,1,0,-1,1,-1,-1,1};
int main()
{
FastRead
int n;
double sum=0;
cin>>n;
while(n--){
double x;
cin>>x;
sum+=(1.0/x);
}
sum=(1.0)/sum;
cout<<setprecision(10)<<fixed<<sum<<endl;
return 0;
}
| 0
| 88,374,025
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
int acc[100010];
signed main() {
int N, K;
while(cin >> N >> K, N || K) {
memset(acc, 0, sizeof(acc));
for(int i=0; i<N; i++) {
cin >> acc[i+1];
acc[i+1] += acc[i];
}
int ans = -INF;
for(int i=K; i<=N; i++) {
chmax(ans, acc[i] - acc[i-K]);
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("No");}
#define printd(x) printf("%.12f\n", ans);
template<class T> bool chmin(T& a, const T& b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> bool chmax(T& a, const T& b) {if (a < b) {a = b; return 1;} return 0;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int n, m;
cin >> n >> m;
int a[m], b[m];
rep (i, m) cin >> a[i] >> b[i];
vector<int> num(n + 1, 0);
bool ok = true;
rep (i, m) {
num[a[i]]++;
num[b[i]]++;
}
rrep (i, n) if (num[i] % 2) ok = false;
cout << (ok ? "YES" : "NO") << endl;
return 0;
}
| 0
| 73,091,198
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max((x),(y))
#define mins(x,y) x=min((x),(y))
#define show(x) cout<<#x<<" = "<<(x)<<endl;
#define all(a) ((a).begin()),((a).end())
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define bit(n) (1LL<<(n))
typedef long long ll;
typedef __int128_t lll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>using P=pair<T,Y>;
template<class T,class Y>ostream& operator<<(ostream&o,P<T,Y>&p){return o<<"("<<p.fi<<","<<p.se<<")";}
template<class T>ostream& operator<<(ostream&o,V<T>&v){for(T&t:v)o<<t<<",";return o;}
template<class T>void uniq(V<T>&v){sort(all(v));v.erase(unique(all(v)), v.end());}
lll gcd(lll a,lll b,lll&x,lll&y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return(x%m+m)%m;}
ll modPow(lll a,lll n,ll m){lll p=1;for(;n;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return p;}
V<ll>Fac,Rac;void setF(int n,int mod){Fac=Rac=V<ll>(++n);Fac[0]=1;FOR(i,1,n)Fac[i]=Fac[i-1]*i%mod;Rac[n-1]=modInv(Fac[n-1],mod);FORR(i,n-1,1)Rac[i-1]=Rac[i]*i%mod;}
ll comb(int a,int b,int m){return a<b||b<0?0:Fac[a]*Rac[b]%m*Rac[a-b]%m;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
bool ask(ll a){
cout << "? " << a << endl << flush;
string s;
cin >> s;
return s[0]=='Y';
}
void ans(ll a){
cout << "! " << a << endl << flush;
exit(0);
}
main(){
cin.tie(0);
ios::sync_with_stdio(false);
if(ask(1e10)){
ll a = 1e9;
FOR(_, 0, 9){
if(!ask(a-1)) ans(a);
a /= 10;
}
ans(1);
}
ll l, r, m;
l=0;
r=9;
while(r-l>1){
m = (l+r)/2;
if(ask(modPow(10, m, LINF))){
l = m;
}else{
r = m;
}
}
l = modPow(10, l, LINF);
r = l*10;
while(r-l>1){
m = (l+r)/2;
if(!ask(m*10)){
l = m;
}else{
r = m;
}
}
ans(r);
}
|
#include <iostream>
using namespace std;
int main(){
while(1){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if(m==0) break;
int cur,prev;
cin >> prev;
int pmax=0,gmax=0;
for(int i=1; i<m; i++){
cin >> cur;
if(nmin<=i && i<=nmax){
int gap = prev-cur;
if(gap >= gmax){
gmax = gap;
pmax = i;
}
}
prev = cur;
}
cout << pmax << endl;
}
return 0;
}
| 0
| 96,518,017
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.