code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C,D;
cin >> A >> B >> C >> D;
int ans = 0;
for (int i = A; i <= B; i++) {
if (C <= i && i <= D) {
ans++;
}
}
if (ans != 0) {
cout << ans-1 << endl;
return 0;
}
cout << ans << endl;
}
|
#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 = 2e3+23;
char s[N][N];
int a[N][N], b[N][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", s[i]+j);
}
}
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (s[i][j] == '#') continue;
a[i][j] = 1;
if (j) a[i][j] += a[i][j-1];
}
int m = 0;
for (int j = w-1; j >= 0; --j) {
if (s[i][j] == '#') {
m = 0;
continue;
}
if (m) {
a[i][j] = m;
} else {
m = a[i][j];
}
}
}
int ans = 0;
for (int i = 0; i < w; ++i) {
for (int j = 0; j < h; ++j) {
if (s[j][i] == '#') continue;
b[j][i] = 1;
if (j) b[j][i] += b[j-1][i];
}
int m = 0;
for (int j = h-1; j >= 0; --j) {
if (s[j][i] == '#') {
m = 0;
continue;
}
if (m) {
b[j][i] = m;
} else {
m = b[j][i];
}
ans = max(ans, m+a[j][i]-1);
}
}
printf("%d", ans);
}
int main() {
init();
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 0
| 13,951,839
|
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7ll;
const double PI=3.14159265358979323846;
int main() {
int n; cin >> n;
map<int, ll> loc;
rp(i, 0, n) {
int p; cin >> p; loc[p] = (ll)i;
}
ll res = 0;
multiset<ll> past = {-1, -1, n, n};
for(int i = n; i>= 1; i--) {
auto itr = past.lower_bound(loc[i]);
ll r1 = *itr;
ll r2 = *(++itr);
itr--;
ll l1 = *(--itr);
ll l2 = *(--itr);
res += i*((r2-r1)*(loc[i]-l1) + (l1-l2)*(r1-loc[i]));
past.insert(loc[i]);
}
cout << res << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
vector<int64_t>B(N);
for(int i=0;i<N;i++)
cin>>B.at(i);
vector<int64_t>C(N);
for(int i=0;i<N;i++){
C.at(i)=A.at(i)-B.at(i);
}vector<int64_t>P={};
vector<int64_t>M={};
for(int i=0;i<N;i++){
if(0<=C.at(i))
P.push_back(C.at(i));
else
M.push_back(C.at(i));
}sort(P.begin(),P.end());
reverse(P.begin(),P.end());
int64_t p=P.size();
int64_t m=M.size();
int64_t sum1=0;
int64_t sum2=0;
for(int i=0;i<p;i++)
sum1+=P.at(i);
for(int i=0;i<m;i++)
sum2+=M.at(i);
if(sum1+sum2<0)
cout<<-1<<endl;
else{
int ans=m;
int64_t sum3=0;
for(int i=0;i<p+1;i++){
if(-sum2<=sum3){
ans+=i; break;
}sum3+=P.at(i);
}cout<<ans<<endl;
}
return 0;
}
| 0
| 88,424,806
|
#include "bits/stdc++.h"
using namespace std;
int main() {
vector<int> AB(6);
vector<int> cnt(4);
for (int i = 0; i < 6; i++) {
cin >> AB[i];
cnt[AB[i] - 1]++;
}
int res1 = 0, res2 = 0;
for (int i = 0; i < 4; i++) {
if (cnt[i] == 1) res1++;
else if (cnt[i] == 2) res2++;
}
if (res1 == 2 && res2 == 2) cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
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;}
int main(){
int n;
cin>>n;
vector<int> a(n);
vector<int> cnt(n+1);
int j=1;
rep(i,n){
cin>>a[i];
if(a[i]==j){
++cnt[a[i]];
++j;
}
}
int i=1;
while(cnt[i]!=0){
++i;
}
if(cnt[1]==0)cout<<-1<<endl;
else cout<<n-(i-1)<<endl;
return 0;
}
| 0
| 805,434
|
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define itfr(it,x) for(it=x.begin();it!=x.end();it++)
#define flash ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
int main()
{
flash;
ll T=1,t,n,m,q,k,i,j;
while(T--)
{
cin>>n;
cout<<n*(n+1)/2<<endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
string s,p;
int s_num = 0;
int p_num = 0;
bool discover =false;
getline(cin,s);
getline(cin,p);
string s_search = s+s;
for(int i = 0; i < s_search.length();i++){
if(s_search[i]==p[0]){
for(int j =0; j < p.length();j++){
if(s_search[i+j] != p[j]){
break;
}else if(j == p.length() -1&&s_search[i+j]== p[j]){
cout << "Yes" << endl;
discover = true;
}
}
}
if(discover == true)break;
}
if(discover == false)cout << "No" <<endl;
}
| 0
| 30,877,799
|
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
const int N=1e5+3;
int c[N];
int main()
{
ft
int t,i,j,n,m,l=0,r=0,s=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>m;
c[m]++;
}
for(i=1;i<N;i++)
{
if(c[i]>0)
{
if(c[i]%2==1)
{
l++;
}
else
{
r++;
}
}
}
if(r%2==0)
{
cout<<(l+r)<<"\n";
}
else
{
cout<<(l+r-1)<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
int main(){
INT(n);
vector<vector<int>> graph(n);
rep(i,n){
INT(x,y);
rep(j,y){
INT(z);
graph[x-1].push_back(z-1);
}
}
queue<int> Q;
vector<int> checked(n,-1);
Q.push(0);
checked[0]=0;
while(!Q.empty()){
int x=Q.front();
Q.pop();
rep(i,graph[x].size()){
if(checked[graph[x][i]]==-1){
checked[graph[x][i]]=checked[x]+1;
Q.push(graph[x][i]);
}
}
}
rep(i,n)out(i+1,checked[i]);
}
| 0
| 51,675,339
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define MUL(A,B,C) (max(A*C, B*C))
int main(){
ll a[4];
for(int i=0; i<4; i++) scanf("%lld", &a[i]);
printf("%lld\n", max(MUL(a[0],a[1],a[2]), MUL(a[0],a[1],a[3])));
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define EPS 1e-10
using namespace std;
int n,v[100+1][100+1]={},d[1000]={},color[1000]={};
int q[1000]={},head=0,tail=0;
void bfs(int s){
rep(i,n){
if(v[s][i]==0&&s!=i){
color[s]=0;
d[i]=INT_MAX;
}
}
color[s]=1;
d[s]=0;
head=tail=0;
q[tail++]=s;
while(head!=tail){
int u=q[head++];
rep(i,n){
if(v[u][i]==0)continue;
if(color[i]==0){
color[i]=1;
d[i]=d[u]+1;
q[tail++]=i;
}
}
color[u]=2;
}
}
int main(){
cin>>n;
int u,k,in;
rep(i,n){
cin>>u>>k;
rep(j,k){
cin>>in;
v[u-1][in-1]=1;
}
}
bfs(0);
rep(i,n){
cout<<i+1<<" ";
if(d[i]==INT_MAX)cout<<-1;
else cout<<d[i];
cout<<endl;
}
return 0;
}
| 0
| 83,384,569
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
ll mod(ll a)
{
if(a<inf)return a;
else
return a%inf;
}
void test_cases()
{
char a,b;
cin>>a>>b;
if(a=='H')cout<<b;
else
{
if(b=='H')cout<<"D";
if(b=='D')cout<<"H";
}
}
int main()
{
fast;
ll t;
t=1;
while(t--)
test_cases();
}
|
#include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define rrep(i,m,n) for(int i = m; i < (int)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define res resize
#define as assign
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum accumulate
#define keta fixed<<setprecision
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 9223372036854775806ll;
const int mod = 1000000007ll;
const ll MOD = 1000000007LL;
int main(){
double n,m,d;
std::cin >> n>>m>>d;
double nn=min(n,2*d);
if(d==0)nn=n;
double ans=double(1.0*(n-nn)*2+nn*1)/(n*n)*(m-1);
std::cout << keta(30)<<ans << std::endl;
}
| 0
| 6,849,955
|
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define vi vector<int>
#define vll vector<ll>
#define vi2 vector<vector<int>>
#define eb emplace_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
using P = pair<ll,ll>;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};
#define INT(name) int name;cin >> name;
#define VEC(type,name,n) vector<type> name(n);REP(i,n) cin >> name[i];
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main()
{
ll N;
cin >> N;
VEC(ll,A,N);
ll right = 0;
ll sum = 0;
ll xorsum = 0;
ll ans = 0;
REP(left,N){
while(right<N&&sum+A[right]==(xorsum^A[right])){
sum+=A[right];
xorsum=(xorsum^A[right]);
right++;
}
ans+=right-left;
if(right==left){
right++;
}else{
sum-=A[left];
xorsum=(xorsum^A[left]);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 110, dx[2] = {0, 1}, dy[2] = {1, 0};
typedef pair<int, int> pii;
int n, m, idx[MAX_N][MAX_N], head[MAX_N * MAX_N], current, dist[MAX_N * MAX_N], start_pos;
char str[MAX_N][MAX_N];
bool vis[MAX_N * MAX_N];
struct edge
{
int to, nxt, weight;
} edges[MAX_N * MAX_N << 3];
void addpath(int src, int dst, int weight)
{
edges[current].to = dst, edges[current].nxt = head[src];
edges[current].weight = weight, head[src] = current++;
}
void shortestPath()
{
memset(dist, 0x3f, sizeof(dist));
priority_queue<pii> pq;
pq.push(make_pair(0, start_pos)), dist[start_pos] = 0;
while (!pq.empty())
{
int u = pq.top().second;
pq.pop();
if (vis[u])
continue;
vis[u] = true;
for (int i = head[u]; i != -1; i = edges[i].nxt)
if (dist[edges[i].to] > dist[u] + edges[i].weight)
dist[edges[i].to] = dist[u] + edges[i].weight, pq.push(make_pair(-dist[edges[i].to], edges[i].to));
}
}
int main()
{
memset(head, -1, sizeof(head));
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%s", str[i] + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
idx[i][j] = m * (i - 1) + j;
start_pos = n * m + 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int d = 0; d < 2; d++)
{
int dstx = i + dx[d], dsty = j + dy[d];
if (str[dstx][dsty] != 0)
if (str[i][j] == '.')
if (str[dstx][dsty] != str[i][j])
addpath(idx[i][j], idx[dstx][dsty], 1);
else
addpath(idx[i][j], idx[dstx][dsty], 0);
else
addpath(idx[i][j], idx[dstx][dsty], 0);
}
addpath(start_pos, idx[1][1], str[1][1] == '#');
shortestPath(), printf("%d\n", dist[idx[n][m]]);
return 0;
}
| 0
| 66,752,085
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < m; j++) cin >> b[j];
bool ans = false;
for (int i = 0; i + m <= n; i++) {
for (int j = 0; j + m <= n; j++) {
bool res = true;
for (int x = 0; x < m; x++) {
for (int y = 0; y < m; y++) {
res &= (a[i + x][j + y] == b[x][y]);
}
}
ans |= res;
}
}
cout << (ans ? "Yes" : "No") << '\n';
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
string s,t;
map<char,int>mp;
map<int,char>mpinv;
set<char>vec;
int to_number1(){
int num = 0;
for(int i=0;i<s.length();){
if(vec.count(s[i])==1){
num+=mp[s[i]]*mp[s[i+1]];
i+=2;
}
else{
num+=mp[s[i]];
i++;
}
}
return num;
}
int to_number2(){
int num = 0;
for(int i=0;i<t.length();){
if(vec.count(t[i])==1){
num+=mp[t[i]]*mp[t[i+1]];
i+=2;
}
else{
num+=mp[t[i]];
i++;
}
}
return num;
}
string convert(int multiply){
string z = "";
int digit = 0;
while(multiply>0){
int r = multiply%10;
if(r>0){
if(r == 1){
z.push_back(mpinv[pow(10,digit)]);
}
else{
z.push_back(mpinv[pow(10,digit)]);
z.push_back(mpinv[r]);
}
}
multiply/=10;
digit++;
}
reverse(z.begin(),z.end());
return z;
}
int main(void){
for(int i=2;i<=9;i++){
char x = i+'0';
mp[x]=i;
mpinv[i]=x;
vec.insert(x);
}
mp['i']=1;
mpinv[1]='i';
mp['x']=10;
mpinv[10]='x';
mp['c']=100;
mpinv[100]='c';
mp['m']=1000;
mpinv[1000]='m';
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>s>>t;
int x = to_number1();
int y = to_number2();
string z = convert(x+y);
cout<<z<<endl;
}
return 0;
}
| 0
| 7,765,605
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int mx = N - K + 1;
int mn = (K > 1) ? 1 : (N - K + 1);
cout << mx - mn << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << endl;}
#define bug4( x , y , z , w) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << endl;}
#define bug5( x , y , z , w ,p) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << endl;}
#define bug6( x , y , z , w ,p , q) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << " " << (#q) <<"="<< q << endl;}
#define bugn( x , n ) {cerr << (#x) <<":";for(int i=0;i<n;i++)cerr << x[i] <<" "; cerr << endl;}
#define bugnm( x , n , m ) {cerr << (#x)<<endl;for(int i=0;i<n;i++){cerr << "Row #" << i<< ":";for(int j=0;j<m;j++)cerr << x[i][j] << " ";cerr << endl;}}
typedef long long ll;
typedef long double ld;
using namespace std;
const int maxn = 100+5;
int dp[maxn][2][maxn],n,k;
string s;
int solve(int i,int bnd,int cnt){
if( i == n )return cnt == k;
int &ans = dp[i][bnd][cnt];
if( ans != -1 )return ans;
ans = 0;
if(bnd){
for(int d=0;d<s[i]-'0';d++){
ans+=solve(i+1,0,cnt+(d!=0));
}
ans+=solve(i+1,1,cnt+(s[i]-'0'!=0));
}else{
for(int d=0;d<10;d++){
ans+=solve(i+1,0,cnt+(d!=0));
}
}
return ans;
}
int32_t main(){
IOS
memset(dp,-1,sizeof(dp));
cin>>s>>k;n=s.length();
cout<<solve(0,1,0);
}
| 0
| 44,864,861
|
#include <stdio.h>
int main()
{
int N, R;
scanf("%d%d",&N,&R);
if(R>4111)
{
printf("second value must between 0-4111");
}
else if(N>=10)
{
printf("%d", R);
}
else
{
printf("%d", R+100*(10-N));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
int a,b,flag=0;
b=x-a;
for(int a=0;a<=x;a++)
{
if ((2 * a) + (4 * (x-a)) == y)
flag=1;
}
if(flag==1)
{
cout<<"Yes"<<"\n";
}
else
{
cout<<"No"<<"\n";
}
return 0;
}
| 0
| 98,836,446
|
#include<bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int main(){
ll l, r; cin >> l >> r;
ll ans = 2019;
bool flg = false;
for(ll i=l; i<=r; i++){
for(ll j=i+1; j<=r; j++){
ll tmp = (i*j) % 2019;
ans = min(ans, tmp);
if(tmp==0){
flg = true; break;
}
}
if(flg) break;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat;
typedef vector<vector<bool> > matb;
typedef vector<string> vst;
typedef pair<lli,lli> pll;
typedef pair<double,double> pdd;
lli n;
vll p;
mat t;
vll d;
lli depth(lli x){
if(p[x] == -1) return d[x] = 0;
if(d[x]) return d[x];
return d[x] = depth(p[x]) + 1;
}
int main(){
cin >> n;
p = vll(n,-1);
t = mat(n);
d = vll(n);
for(lli i = 0;i < n;i++){
lli node,k;
cin >> node >> k;
for(lli j = 0;j < k;j++){
lli c;
cin >> c;
t[node].push_back(c);
p[c] = node;
}
}
for(lli i = 0;i < n;i++){
cout << "node " << i << ": ";
cout << "parent = " << p[i] << ", ";
cout << "depth = " << depth(i) << ", ";
if(p[i] == -1) cout << "root, ";
else if(t[i].size() == 0) cout << "leaf, ";
else cout << "internal node, ";
cout << "[";
for(lli j = 0;j < t[i].size();){
cout << t[i][j];
if(++j < t[i].size()) cout << ", ";
}
cout << "]" << endl;
}
return 0;
}
| 0
| 36,502,850
|
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=int64_t;
int main() {
int A,B,C; cin >>A >>B >>C;
string ans="NO";
rep_eq(i,1,B) {
if((A*i)%B==C) {
ans="YES";
break;
}
}
cout <<ans <<endl;
}
|
#define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(ll i=0;i<(n);++i)
#define _rep3(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define _repe2(i,n) for(ll i=0;i<=(n);++i)
#define _repe3(i,a,b) for(ll i=(a);i<=(b);++i)
#define repe(...) _overload3(__VA_ARGS__,_repe3,_repe2)(__VA_ARGS__)
#define _rrep2(i,n) for(ll i=(n)-1;i>=0;i--)
#define _rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
template<class T>
bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
template<class T>
using pq=priority_queue<T,vector<T>,greater<T>>;
void solve();
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
solve();
}
template<typename T>
struct edge{
int src,to;
T cost;
edge(int from,int to,T cost):src(src),to(to),cost(cost){}
edge(int to,T cost):edge(-1,to,cost){}
operator int()const{return to;}
};
template<typename T>
using Edges=vector<edge<T>>;
template<typename T>
using Graph=vector<Edges<T>>;
void solve(){
ll x,y;cin>>x>>y;
vl a={x,y,-x,-y};
Graph<ll> g(4);
rep(i,4)rep(j,4){
if(abs(a[i])==abs(a[j]))g[i].emplace_back(j,1);
if(a[i]<=a[j])g[i].emplace_back(j,a[j]-a[i]);
}
vl d(4,LINF);
d[0]=0;
pq<pl> q;
q.emplace(0,0);
while(q.size()){
ll dd,src;
tie(dd,src)=q.top();q.pop();
if(dd>d[src])continue;
for(auto &e:g[src]){
if(d[e.to]<=d[src]+e.cost)continue;
d[e.to]=d[src]+e.cost;
q.emplace(d[e.to],e.to);
}
}
cout<<d[1]<<endl;
}
| 0
| 35,962,219
|
#include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
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(){
int n,z,w; cin >> n >> z >> w;
vector<int> a(n);
rep(i,n) cin >> a[i];
if(n==1){
cout << abs(a[0]-w) << endl;
}else cout << max(abs(a[n-1]-w),abs(a[n-2]-a[n-1])) << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
namespace BasicMath {
static Int Max(const Int a, const Int b);
Int Max(const Int a, const Int b) {
if (a >= b) {
return a;
} else {
return b;
}
}
}
using namespace BasicMath;
int main(void) {
Int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - Max(a, Max(b, c)) << endl;
return 0;
}
| 0
| 26,786,140
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <tuple>
#include <iomanip>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (int i = (l); i < (r); i++)
#define reper(i, l, r) for (int i = (r)-1; i >= (l); i--)
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N,H,W;
cin>>N>>H>>W;
int ans=0;
rep(i,N){
int h,w;
cin>>h>>w;
if(h>=H&&w>=W)ans++;
}
cout<<ans<<endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T>
inline bool chmax(T& a, T b) {
return a = (a < b) ? b : a;
}
template <class T>
inline bool chmin(T& a, T b) {
return a = (a > b) ? b : a;
}
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
int main() {
INIT;
ll N, C, K;
cin >> N >> C >> K;
vector<ll> T(N);
rep(i, N) cin >> T[i];
sort(ALL(T));
vector<ll> lims(N);
rep(i, N) { lims[i] = T[i] + K; }
ll idx = 0, ans = 0;
for (ll i = 0; i < N;) {
ans++;
idx = i;
while (i < N && lims[i] <= lims[idx] + K && i - idx < C) {
i++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 55,751,254
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
float a, b;
cin >> a >> b;
cout << round((a + b) / 2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll W,H;
cin >> W >> H;
struct edge{
int i,j;
ll c;
};
vec<edge> E;
for(int i=0;i<W;i++){
ll c;
cin >> c;
E.push_back({i,-1,c});
}
for(int i=0;i<H;i++){
ll c;
cin >> c;
E.push_back({-1,i,c});
}
ll cntW = W+1,cntH = H+1;
sort(E.begin(),E.end(),[](edge& a,edge& b){
return a.c<b.c;
});
ll ans = 0;
for(auto& e:E){
if(e.j==-1){
ans += e.c*cntH;
cntW--;
}else{
ans += e.c*cntW;
cntH--;
}
}
cout << ans << "\n";
}
| 0
| 84,516,791
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a;
string s, t;
set<string> x;
bool shiritori = true;
for(int i=0; i<n; i++) {
cin >> s;
if(i != 0 && s[0] != t[t.size()-1]) shiritori = false;
t = s;
a = x.size();
x.insert(s);
if(a == x.size()) shiritori = false;
}
if(shiritori) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
const int MAX = 510000;
const ll MOD = 10000000000007;
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;
}
int main() {
ll N,M;
cin >>N>>M;
cout << N*(N-1)/2+M*(M-1)/2 << endl;
return 0;
}
| 0
| 6,123,391
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i<(n);i++)
#define fore(i,a) for(auto &i:a)
#define debug(a,b) cout << "debug : " << a << " , "<< b << endl
using ll=long long;
const ll INF=1LL<<60;
const ll mod=1E9+7;
int main(){
ll n,k;
cin >> n >> k;
vector<ll>a(n),b(n,0);
rep(i,n)cin >> a[i];
int cnt=0;
do{
rep(i,n)b[i]=0;
rep(i,n){
ll r,l;
l=max((ll)0,i-a[i]);
r=min(n-1,i+a[i]);
b[l]++;
if(r+1<n)b[r+1]--;
}
rep(i,n){
if(i!=n-1)b[i+1]+=b[i];
a[i]=b[i];
}
cnt++;
if(cnt==k)break;
}while(a[0]!=n);
rep(i,n)cout << a[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(12);
string S,T;
cin >> S >> T;
ll a,b;
cin >> a >> b;
string U;
cin >> U;
if(U == S){
cout << a-1 << " " << b << "\n";
}else{
cout << a << " " << b-1 << "\n";
}
}
| 0
| 96,056,463
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(){
int n; cin >> n;
string s; cin >> s;
string c;
int ans = 0;
rep(i, 10) rep(j, 10) rep(k, 10){
c[0] = i + '0';
c[1] = j + '0';
c[2] = k + '0';
int id = 0;
rep(si, n){
if(s[si] == c[id]){
id++;
if(id == 3) break;
}
}
if(id == 3) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef vector<int>V;
void func(int node,int par,int rang);
bool flg[100000]={0};
int n,u,k,c;
V v[100000];
struct Node{
int parent,depth;
};
Node T[100000];
int main(void){
int i,j;
cin>>n;
for(i=0;i<n;i++){
cin>>u>>k;
T[i].parent=0;
T[i].depth=0;
for(j=0;j<k;j++){
cin>>c;
flg[c]=1;
v[u].push_back(c);
}
}
for(i=0;i<n;i++){
if(!flg[i]){
func(i,-1,0);
}
}
for(i=0;i<n;i++){
cout<<"node "<<i<<": parent = "<<T[i].parent<<", depth = "<<T[i].depth<<", ";
if(v[i].empty()){
if(T[i].parent==-1){
cout<<"root, []"<<endl;
}
else{
cout<<"leaf, []"<<endl;
}
}
else{
if(T[i].parent==-1){
cout<<"root, ["<<v[i][0];
for(j=1;j<v[i].size();j++){
cout<<", "<<v[i][j];
}
cout<<"]"<<endl;
}
else{
cout<<"internal node, ["<<v[i][0];
for(j=1;j<v[i].size();j++){
cout<<", "<<v[i][j];
}
cout<<"]"<<endl;
}
}
}
return 0;
}
void func(int node,int par,int rang){
int i;
T[node].parent=par;
T[node].depth=rang;
for(i=0;i<v[node].size();i++){
func(v[node][i],node,rang+1);
}
}
| 0
| 66,203,742
|
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+5,mod=1e9+7;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
ll INF=1e18;
ll mn=INF;
ll sum=0;
for(int i=0;i<n;i++)
{
ll x,y;
cin>>x>>y;
sum+=x;
if(x>y) mn=min(mn,y);
}
if(mn==INF) mn=sum;
cout<<sum-mn<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=998244353;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
char c;
int main(){
cin>>c;
if(isupper(c)) cout<<'A'<<endl;
else cout<<'a'<<endl;
}
| 0
| 16,822,477
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int H, N;
cin >> H >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
int sum = 0;
rep(i, N) sum += A[i];
if (sum >= H)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define res(i,n) for(int i=n;;i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define req(i,n,m) for(int i=n;i<m;i++)
#define REQ(i,n,m,l) for(int i=n;i<m;i+=l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(long long x, long long y) {
if (y == 0)return x;
return gcd(y, x % y);
}
signed lcm(long long x, long long y) {
return x / gcd(x, y) * y;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
string S; cin >> S;
REP(i, S.size()) {
if ((S.size() - i) % 2 == 1)continue;
rep(j,(S.size() - i) / 2) {
if (S.at(j) != S.at(j + (S.size() - i) / 2))break;
if (j == (S.size() - i) / 2 - 1) {
cout << S.size() - i << endl;
return 0;
}
}
}
}
| 0
| 16,903,943
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
int a , p;
cin >> a >> p;
p += a * 3;
cout << p / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long H,W,c=0; cin>>H>>W;
long long counter=0;
long long a[H]={0};
long long aco=0;
long long bco=0;
cin>>a[0];
long long cco=a[0];
counter=a[0];
long long counter1=counter;
long long counter2;
long long answer=0;
long long ddo=0;
for(long long i=1;i<H;i++){
cin>>a[i];}
while(cco%2==0){
aco++;
cco/=2;}
for(long long i=1;i<H;i++){
cin>>a[i];
ddo=a[i];
while(ddo%2==0){
bco++;
ddo/=2;}
if(aco!=bco){
c=1;
goto asd;}
bco=0;}
for(long long j=0;j<H;j++){
counter=a[j];
counter2=__gcd(counter1,counter);
answer=counter*counter1/counter2;
counter1=answer;}
asd:
if(c==1)
cout<<0<<endl;
else
cout<<(W+answer/2)/answer<<endl;
}
| 0
| 57,870,691
|
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
int main(){
string s; cin >> s;
int count = 0;
for(int i = 0, j = s.size() - 1; i < j;){
if(s[i] == s[j])i++, j--;
else if(s[i] == 'x'){
count++;
i++;
}else if(s[j] == 'x'){
count++;
j--;
}else{
cout << -1 << endl;
return 0;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> t = {"maerd", "remaerd", "esare", "resare"};
string ans = "YES";
reverse(s.begin(), s.end());
int i;
while(s.size() > 0) {
int tmp = s.size();
for(i = 0; i < 4; i++) {
if (s.substr(0, t[i].size()) == t[i]) {
s.erase(s.begin(), s.begin() + t[i].size());
}
}
if (tmp == (int)s.size()) {
ans = "NO";
break;
}
}
cout << ans << endl;
}
| 0
| 51,649,048
|
#include <iostream>
using namespace std;
int main(void){
int N, i;
cin >> N >> i;
int ans = (N - i) + 1;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define mk make_pair
using namespace std;
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
int main(){
int h,w,n,sum=0,x1,y1;
cin>>h>>w>>n;
string s[h];
for(int i=0;i<h;i++)cin>>s[i];
r(i,h)r(j,w)if(s[i][j]=='S')y1=i,x1=j;
for(int o=1;o<=n;o++){
int used[h][w]={};
queue<pair<pair<int,int>,int> >q;
q.push(mk(mk(y1,x1),0));
used[y1][x1]=1;
while(!q.empty()){
pair<pair<int,int>,int> p=q.front();q.pop();
int x=p.first.second,y=p.first.first,sum2=p.second;
if(s[y][x]-'0'==o){
sum+=sum2;
y1=y;
x1=x;
goto L;
}
r(j,4){
int xx=x+dx[j],yy=y+dy[j];
if(xx>=0&&yy>=0&&yy<h&&xx<w)
if(!used[yy][xx])
if(s[yy][xx]!='X'){
q.push(mk(mk(yy,xx),sum2+1));
used[yy][xx]++;
}
}
}L:;
}
cout<<sum<<endl;
}
| 0
| 8,406,956
|
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<set>
#include<functional>
using namespace std;
#define INF 1<<21
#define MOD 1000000007
int main() {
int n;
string s1, s2;
int x, y;
int mul;
cin >> n;
for (int i = 0; i < n; i++) {
x = 0; y = 0;
cin >> s1 >> s2;
int kk = 1;
for (int j = 0; j < s1.length(); j++) {
switch (s1[j]) {
case 'm':
x += 1000*kk;
kk = 1;
break;
case 'c':
x += 100*kk;
kk = 1;
break;
case 'x':
x += 10 * kk;
kk = 1;
break;
case 'i':
x += kk;
kk = 1;
break;
default:kk = s1[j] - '0';
}
}
kk = 1;
for (int j = 0; j < s2.length(); j++) {
switch (s2[j]) {
case 'm':
x += 1000 * kk;
kk = 1;
break;
case 'c':
x += 100 * kk;
kk = 1;
break;
case 'x':
x += 10 * kk;
kk = 1;
break;
case 'i':
x += kk;
kk = 1;
break;
default:kk = s2[j] - '0';
}
}
int o, p;
o = (x + y) / 1000;
if (o>1)cout << o << "m";
if (o == 1)cout << "m";
o = (x + y) % 1000;
p = o / 100;
if (p>1)cout << p << "c";
if (p == 1)cout << "c";
p = o % 100;
o = p / 10;
if (o>1)cout << o << "x";
if (o == 1)cout << "x";
o = (x + y) % 10;
p = o / 1;
if (p>1)cout << p << "i";
if (p == 1)cout << "i";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
if (M == 1){
cout << 1 << ' ' << 2 << endl;
return 0;
}
if (N % 2 == 1){
for (int i = 0; i < M; i++) {
cout << i+1 << ' ' << M*2 - i << endl;
}
}
else {
for (int i = 0; i < (M+1)/2; i++) {
cout << i+1 << ' ' << N/2 - i << endl;
}
for (int i = 0; i < M/2; i++) {
cout << N/2 + i + 2 << ' ' << N - i << endl;
}
}
}
| 0
| 19,658,041
|
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"
using namespace std;
typedef long long ll;
typedef pair<int, int> Pint;
typedef pair<ll, ll> Pll;
#define rep(begin, i, end) for (ll i = begin; i < (ll)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
ll N, C, K;
cin >> N >> C >> K;
vector<ll> T(N);
rep(0, i, N)
{
cin >> T.at(i);
}
sort(all(T));
ll due = T.at(0) + K, wait = 0, send = 0, ans = 0;
rep(0, i, N)
{
if (due == T.at(i))
{
wait++;
if (wait > C)
{
ans += wait / C;
send += (wait / C) * C;
wait = wait % C;
}
else
{
ans++;
send += wait;
wait = 0;
}
if (send < N)
{
due = T.at(send) + K;
}
}
else if (due < T.at(i))
{
if (wait > C)
{
ans += wait / C;
send += (wait / C) * C;
wait = wait % C;
}
else
{
ans++;
send += wait;
wait = 0;
}
if (send < N)
{
due = T.at(send) + K;
}
wait++;
}
else
{
wait++;
}
}
if (wait != 0)
{
ans += (wait + C - 1) / C;
}
cout << ans << endl;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define deb(x) cout<<#x<<" "<<x<<endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void Raghav()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main()
{
Raghav();
int n;
cin >> n;
cout<<n*n;
return 0;
}
| 0
| 69,941,960
|
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
int n,i;
string s;
set<int>s1;
cin>>s;
n=s.size();
for(i=0;i<n;++i){
s1.insert(s[i]);
}
if(s1.size()==n){
printf("yes\n");
}
else{
printf("no");
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
ll box(double a)
{
ll b = a;
return b;
}
ll fff(double a)
{
ll b = a + 0.5;
return b;
}
ll sum(ll n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
bool prime(ll num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
int main() {
string s;
ll k;
cin >> k;
cin >> s;
if (s.size() <= k) {
cout << s << endl;
}
else {
cout << s.substr(0, k) << "..." << endl;
}
}
| 0
| 47,623,411
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vec vector<int>
#define map map<int,int>
#define scn(t) scanf("%d",&t);
#define lscn(t) scanf("%lld",&t);
#define mod 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl "\n"
using namespace std;
const int N=2e5+5;
int main()
{
int n;
scn(n);
cout<<((n*(n+1))/2)<<endl;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
typedef long long ll;
typedef unsigned long long ull;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int A, B, m; cin >> A >> B >> m;
vector<int> a(A), b(B);
REP(i, A) cin >> a[i];
REP(i, B) cin >> b[i];
int ans = *std::min_element(a.begin(), a.end()) + *std::min_element(b.begin(), b.end());;
REP(_, m) {
int x, y, c; cin >> x >> y >> c;
ans = min(ans, a[x - 1] + b[y - 1] - c);
}
cout << ans << endl;
}
| 0
| 27,211,235
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long res = 1LL<<60;
for (int i = 0; i <= N; ++i) {
long long val = (1LL<<i) + K * (N-i);
res = min(res, val);
}
cout << res << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) cin >> a[i];
vector<int> cnt(n + 1);
REP(i, n) cnt[a[i]]++;
vector<int> cnt2(n + 1);
REP1(i, n) cnt2[cnt[i]]++;
vector<ll> sum1(n + 1), sum2(n + 1);
REP1(i, n) {
sum1[i] = sum1[i - 1] + i * cnt2[i];
sum2[i] = sum2[i - 1] + cnt2[i];
}
REP1(k, n) {
int ok = 0, ng = n + 1;
while (1 < abs(ok - ng)) {
int x = (ok + ng) / 2;
ll sum = sum1[x] + x * (sum2[n] - sum2[x]);
if (k <= sum / x) {
ok = x;
} else {
ng = x;
}
}
cout << ok << endl;
}
return 0;
}
| 0
| 34,478,048
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
char B;
cin >> B;
switch (B) {
case 'A':
cout << 'T';
break;
case 'C':
cout << 'G';
break;
case 'G':
cout << 'C';
break;
case 'T':
cout << 'A';
break;
}
cout << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
if(n == 1){
cout << "Yes" << endl;
return 0;
}
vector<int> alpha_s(26, -1);
vector<int> alpha_t(26, -1);
vector<vector<int>> compose_s(n);
vector<vector<int>> compose_t(n);
rep(i, n){
int s_i = s[i] - 'a';
int t_i = t[i] - 'a';
if(alpha_s[s_i] == -1){
alpha_s[s_i] = i;
}
if(alpha_t[t_i] == -1){
alpha_t[t_i] = i;
}
compose_s[alpha_s[s_i]].push_back(i);
compose_t[alpha_t[t_i]].push_back(i);
}
if(compose_s == compose_t){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| 0
| 18,901,729
|
#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(){
ll n;
cin >> n;
map<ll,ll> mp;
rep(i,n){
ll a;
cin >> a;
mp[a]++;
}
ll ans=0;
for(auto p: mp){
if(p.first<p.second){
ans+=p.second-p.first;
}else if(p.first>p.second){
ans+=p.second;
}
}
cout << ans;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin>>s;
if(s.size() == 2){
if(s[0] == s[1])puts("1 2");
else puts("-1 -1");
}
else {
for(int l = 0; l + 2 < s.size(); ++l){
int r = l + 2;
if(s[l] == s[l + 1] || s[l] == s[l + 2] || s[l + 1] == s[l + 2]){
cout<<l + 1 <<" " << l+3<<endl;
return 0;
}
}
puts("-1 -1");
}
}
| 0
| 48,372,940
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
vector<long long> v;
for (int i=0; i<n; i++) {
long long sum = 0;
for (int j=i; j<n; j++) {
sum += a[j];
v.push_back(sum);
}
}
for (int i=62; i>=0; i--) {
vector<long long> nv;
for (long long vi: v) {
if ((vi >> i) & 1) {
nv.push_back(vi);
}
}
if (nv.size() >= k) {
v = nv;
}
}
long long ans = v[0];
for (int i=1; i<v.size(); i++) {
ans = ans & v[i];
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
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 n, k;
ll s;
cin >> n >> k >> s;
ll ans_num;
ll rep_num;
if ( s == 1e9 ) {
rep_num = 1LL;
}
else {
rep_num = s + 1LL;
}
int cnt = 0;
rep(i, n) {
if ( i != 0 ) cout << " ";
if ( cnt == k ) cout << rep_num;
else {
cout << s;
++cnt;
}
}
cout << endl;
return 0;
}
| 0
| 4,963,368
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#define READINTA(X) while((ct=readchar())>='0')(X)=(X)*10+ct-'0';
#define READINTB(X) while((ct=*ci++)>='0')(X)=(X)*10+ct-'0';
using namespace std;
uint16_t d, k;
uint32_t M = 0;
int_fast64_t c, sd = 0, sc = 0;
constexpr int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char readchar() {
if(ci-cn==cm){fread_unlocked(cn,1,cm,stdin);ci=cn;}
return *ci++;
}
int main() {
READINTA(M);
while(M--) {
c = 0;
if(ci-cn+20>cm) {
d = readchar() - '0';
readchar();
READINTA(c);
} else {
d = *ci++ - '0';
ci++;
READINTB(c);
}
sc += c;
sd += c * d;
}
printf("%lld\n", --sc + --sd / 9);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
const int N_MAX = 200005;
int counter[N_MAX];
int plusc[N_MAX];
vector<int> root[N_MAX];
void dfs(int n, int p, int num){
int nownum = num + plusc[n];
counter[n] = nownum;
for(auto u: root[n]){
if (u == p)continue;
dfs(u, n, nownum);
}
}
int main(){
int n, q;
cin >> n >> q;
for(int i = 0; i < n-1; i++){
int a, b;
cin >> a >> b;
root[a].push_back(b);
root[b].push_back(a);
}
memset(plusc, 0, sizeof(plusc));
for(int i = 0; i < q; i++){
int p, x;
cin >> p >> x;
plusc[p] += x;
}
dfs(1, -1, 0);
for(int i = 1; i <= n; i++){
cout << counter[i];
if (i != n)cout << " ";
}
return 0;
}
| 0
| 7,438,361
|
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
typedef long long ll;
vector<int> compress(vector<ll> a) {
int n = a.size();
vector<ll> vals;
rep(i,n) vals.push_back(a[i]);
sort(vals.begin(), vals.end());
vals.erase(unique(vals.begin(), vals.end()), vals.end());
vector<int> res;
rep(i,n) {
int id = lower_bound(vals.begin(), vals.end(), a[i]) - vals.begin() + 1;
res.push_back(id);
}
return res;
}
ll dp[310][310][310];
int main()
{
int n,k;cin >> n >> k;
vector<ll> h(n);
rep(i,n) cin >> h[i];
vector<int> comp = compress(h);
vector<ll> mp(n+1);
mp[0] = 0;
rep(i,comp.size()) mp[comp[i]] = h[i];
rep(i,n+1) rep(j,k+1) rep(l,n+1) dp[i][j][l] = 1e+15;
dp[0][0][0] = 0;
rep(i,n) {
rep(j,k+1) {
rep(l,n+1) {
int nl = comp[i];
chmin(dp[i+1][j][nl], dp[i][j][l] + max(mp[nl] - mp[l], 0LL) );
if(j + 1 <= k) chmin(dp[i+1][j+1][l], dp[i][j][l]);
}
}
}
ll res = 1e+15;
rep(j,k+1) rep(l,n+1) {
chmin(res, dp[n][j][l]);
}
cout << res << "\n";
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
using namespace std;
int main(){
long long hy,wx,i,j;
queue<long long>quex,quey;
scanf("%lld%lld ",&hy,&wx);
char a[1005][1005];
for(i=1;i<=hy;i++){
for(j=1;j<=wx+1;j++){
scanf("%c",&a[j][i]);
if(a[j][i]=='#'){
quex.push(j);quey.push(i);
}
}
}
long long num[1005][1005]={0};
long long u,v,ans=0;
while(!quex.empty()){
u=quex.front();
v=quey.front();
quex.pop();quey.pop();
if(a[u-1][v]=='.'){
a[u-1][v]='#';
num[u-1][v]=num[u][v]+1;
ans=num[u-1][v];
quex.push(u-1);quey.push(v);
}
if(a[u+1][v]=='.'){
a[u+1][v]='#';
num[u+1][v]=num[u][v]+1;
ans=num[u+1][v];
quex.push(u+1);quey.push(v);
}
if(a[u][v-1]=='.'){
a[u][v-1]='#';
num[u][v-1]=num[u][v]+1;
ans=num[u][v-1];
quex.push(u);quey.push(v-1);
}
if(a[u][v+1]=='.'){
a[u][v+1]='#';
num[u][v+1]=num[u][v]+1;
ans=num[u][v+1];
quex.push(u);quey.push(v+1);
}
}
printf("%lld\n",ans);
return 0;}
| 0
| 11,555,462
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
scanf("%d%d",&n,&m);
int mid;
if(m&1) mid=(m*2+1)/2;
else mid=(m*2+1)/2+1;
int cnt=1;
for(int i=1;cnt<=m;cnt++,i++){
if(cnt<=mid/2) printf("%d %d\n",i,mid-i+1);
if(cnt==mid/2+1) i=mid+1;
if(cnt>mid/2 ) printf("%d %d\n",i,mid+1+m*2+1-i);
}
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
vector<ll> a(n); REP(i, n) cin >> a[i];
vector<ll> b(n); REP(i, n) cin >> b[i];
vector<ll> diff(n);
int cnt = 0;
REP(i, n) {
if (a[i] >= b[i]) cnt++;
diff[i] = a[i] - b[i];
}
sort(diff.begin(), diff.end(), greater<ll>());
ll sum = accumulate(diff.begin(), diff.end(), 0LL);
int ans = 0;
if (cnt == n) ans = 0;
else if (sum < 0) ans = -1;
else {
ll sumM = 0;
REP(i, n) {
if (diff[i] < 0) {
ans++;
sumM += abs(diff[i]);
}
}
REP(i, n) {
sumM -= diff[i];
ans++;
if (sumM <= 0) break ;
}
}
cout << ans << '\n';
return 0;
}
| 0
| 90,972,802
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
ll n;
cin >> n;
ll sum = 0;
ll a[n];
rep(i,n){
cin >> a[i];
sum += a[i];
}
if(sum % (n * (n + 1) / 2) != 0){
cout << "NO" << endl;
return 0;
}
ll d[n];
ll k = sum / (n * (n + 1) / 2);
for(int i = 0; i < n; i++){
d[i] = a[(i + 1) % n] - a[i] - k;
}
sum = 0;
for(int i = 0; i < n; i++){
if(d[i] % n != 0 || d[i] > 0){
cout << "NO" << endl;
return 0;
}
sum -= d[i];
}
cout << (sum / n == k ? "YES" : "NO") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,t=0,f=0;cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
t++;
if(a[f]==2)
break;
else
f=a[f]-1;
}
if(t<n)cout<<t;
else cout<<-1;
return 0;
}
| 0
| 97,235,501
|
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int n;
cin >> n;
if (n<1200) cout << "ABC" << endl;
else if (n<2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
}
|
#include<stdio.h>
int main(){
int n,m;
int sum1=0;
int sum2=0;
scanf("%d %d",&n,&m);
if(n>1){
for(int i=1;i<n;i++){
sum1+=i;
}
}
if(m>1){
for(int i=1;i<m;i++){
sum2+=i;
}
}
printf("%d", sum1+sum2);
return 0;
}
| 0
| 18,552,984
|
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef vector<pair<ll,ll> > vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>(b);--i)
const int MOD = 1000000007;
const int MAX = 510000;
int main(){
string s;cin>>s;
rep(i,0,5){
cout<<s[i];
}
cout<<" ";
rep(i,6,13){
cout<<s[i];
}
cout<<" ";
rep(i,14,19){
cout<<s[i];
}
cout<<endl;
}
|
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x) BEGIN(x), END(x)
#define PAIR make_pair
#define VEC(type) vector<type >
#define FOR(i, A, B) for(auto i = (A);i != (B); i++)
#define FORD(i, A, B) for(auto i = (A);i != (B); i--)
#define READRANGE(begin, end) FOR(it, begin, end) cin >> *it
#define READVEC(V) READRANGE(BEGIN(V), END(V))
using namespace std;
typedef long long lint;
typedef pair<int, int> Pii;
typedef pair<int, lint> Pil;
typedef pair<lint, lint> Pll;
typedef pair<lint, int> Pli;
void io_init()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
typedef pair<lint, VEC(int)> Entry;
int main(int argc, char **argv)
{
io_init();
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
VEC(lint) A(X), B(Y), C(Z);
READVEC(A); sort(ALL(A));
READVEC(B); sort(ALL(B));
READVEC(C); sort(ALL(C));
priority_queue<Entry> pq;
set<VEC(int)> seen;
auto heapAdd = [&](int x, int y, int z) {
if (x < 0 || y < 0 || z < 0)
return;
VEC(int) tuple{x, y, z};
if (seen.count(tuple))
return;
seen.insert(tuple);
pq.push(PAIR(A[x] + B[y] + C[z], tuple));
};
heapAdd(X - 1, Y - 1, Z - 1);
while (K--) {
auto pr = pq.top();
pq.pop();
auto& i = pr.second;
cout << pr.first << endl;
int x = i[0], y = i[1], z = i[2];
heapAdd(x - 1, y, z);
heapAdd(x, y - 1, z);
heapAdd(x, y, z - 1);
}
return 0;
};
| 0
| 86,402,292
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i, n) ;for (int i = 0;i < (int)(n);i++)
#define rep2(i, s, n) ;for (int i = s; i < (int)(n);i++)
#define ALL(vec) (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF (922337203685477587+1)
#define sosuu 1000000007
lli combi[55][55];
lli nCr(lli n, lli r)
{
if(n<r) return 0;
if(n==r) return combi[n][r] = 1;
if(r==0) return combi[n][r] = 1;
if(r==1) return combi[n][r] = n;
if(combi[n][r]) return combi[n][r];
return combi[n][r] = nCr(n-1,r) + nCr(n-1,r-1);
}
int main() {
lli N;
cin >> N;
lli ocount=0, count=0;
int P;
cin >> P;
lli a;
rep(i, N){
cin>>a;
if(a%2==0) ocount++;
else count ++;
}
lli ans=0;
if(P==0){
rep(i, count/2+1){
ans+=nCr(count,2*i);
}
rep(j, ocount){ans*=2;}
}
if(P==1){
rep(i, (count+1)/2){
ans+=nCr(count,2*i+1);
}
rep(j, ocount){ans*=2;}
}
cout <<ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
using ll=long long;
int main()
{
ll n,m,ac=0,wa=0;
cin>>n>>m;
vector<ll> a(n+1),w(n+1);
rep(i,m)
{
ll x;
string s;
cin>>x>>s;
if(s=="AC")
{
if(a[x]==0)
{
ac++;
a[x]++;
}
}
else if(s=="WA")
{
if(a[x]==0)
{
w[x]++;
wa++;
}
}
}
rep(i,n) if(a[i]==0) wa-=w[i];
cout<<ac<<" "<<wa;
}
| 0
| 45,071,221
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
vector<int> vec;
for(int i=0; i<n; i++){
int a;
cin >> a;
vec.push_back(a);
}
sort(vec.begin(),vec.end());
int ans = vec[n/2]-vec[(n/2)-1];
cout <<ans <<endl;
}
|
#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 iabs(const T& x) { return max(x, -x); }
int main() {
int a, b;
cin >> a >> b;
vector<string> s(40);
for (int i = 0; i < 40; ++i) {
s[i] = string(100, i < 20 ? '#' : '.');
}
for (int k = 0; k < 2; ++k) {
for (int c = 0; c < (k == 0 ? a : b) - 1; ++c) {
int i = c / 50 * 2 + (k == 1 ? 21 : 0), j = c % 50 * 2;
s[i][j] = k == 0 ? '.' : '#';
}
}
cout << "40 100\n";
for (auto t : s) cout << t << '\n';
return 0;
}
| 0
| 90,442,593
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
vector<vector<int>> f(const vector<vector<int>>& dist) {
int n = dist.size() - 1;
vector<vector<int>> res(n + 1, vector<int>(n + 1, 0x3f3f3f3f));
for (int i = 1; i <= n; i++) {
res[i][i] = 0;
priority_queue<pair<int, int>> pq;
pq.push(make_pair(0, i));
while (pq.size() > 0) {
auto p = pq.top();
pq.pop();
int d = -p.first, index = p.second;
if (res[i][index] < d) continue;
for (int j = 1; j <= n; j++) {
if (res[i][j] > res[i][index] + dist[index][j] && dist[index][j] > 0) {
res[i][j] = res[i][index] + dist[index][j];
pq.push(make_pair(-res[i][j], j));
}
}
}
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> path;
vector<vector<int>> dist(n + 1, vector<int>(n + 1, -1));
for (int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >> c;
path.push_back({a, b, c});
dist[a][b] = c;
dist[b][a] = c;
}
int res = 0;
auto min_dist = f(dist);
for (int i = 0; i < m; i++) {
int a, b, c;
a = path[i][0];
b = path[i][1];
c = path[i][2];
int flag = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j) continue;
if (min_dist[i][a] + c + min_dist[b][j] == min_dist[i][j]) {
flag = 1;
break;
}
if (min_dist[i][b] + c + min_dist[a][j] == min_dist[i][j]) {
flag = 1;
break;
}
}
}
res += 1- flag;
}
cout << res << endl;
}
|
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
int col[10][10];
int main(void)
{
int H,W,K;
scanf("%d%d%d",&H,&W,&K);
char s[10];
for (int i=1;i<=H;i++)
{
scanf("%s",s);
for (int j=0;j<W;j++)
if (s[j]=='.') col[i][j+1] = 0;
else col[i][j+1] = 1;
}
int ans = 0;
int a[10],b[10];
for (int i=0;i<(1<<H);i++)
for (int j=0;j<(1<<W);j++)
{
int cnta = 0,cntb = 0;
for (int k=0;k<H;k++)
if (((1<<k)&i)==0) a[++cnta] = k+1;
for (int k=0;k<W;k++)
if (((1<<k)&j)==0) b[++cntb] = k+1;
int tmp = 0;
for (int ki=1;ki<=cnta;ki++)
for (int kj=1;kj<=cntb;kj++)
tmp+=col[a[ki]][b[kj]];
if (tmp==K)
{
ans++;
}
}
printf("%d\n",ans);
return 0;
}
| 0
| 32,799,104
|
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> vec(3);
for(int i=0;i<3;i++){
cin >> vec.at(i);
}
stable_sort(vec.begin(),vec.end());
cout << vec.at(2)-vec.at(0) << endl;
}
|
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;
template <class T, class U>
using umap = unordered_map<T, U>;
using umii = umap<int, int>;
using seti = set<int>;
template <class T>
using uset = unordered_set<T>;
using useti = uset<int>;
template <class T>
using less_queue = priority_queue<T>;
template <class T>
using greater_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr int INF = 1e18;
template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };
template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
int c = v.size() - 1;
for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
if (c > -1) cout << v[c];
cout << endl;
}
template <class T>
bool amin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ceil_div(int x, int y) { return (x - 1) / y + 1; }
#pragma endregion header
void solve(int a, int b, int c) {
vi v = {a, b, c};
for(int i = 0;;i++) {
if(v[0] == v[1] && v[1] == v[2]) {
COUT(i);
return;
}
SORT(v);
if(v[0] < v[1])v[0] += 2;
else {
v[0]++;
v[1]++;
}
}
}
#pragma region main
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(15);
int a;
cin >> a;
int b;
cin >> b;
int c;
cin >> c;
solve(a, b, c);
}
#pragma endregion main
| 0
| 62,587,620
|
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
const int INF = 1<<29;
typedef long long int ll;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n>>b)&1; }
inline void set_bit(int & n, int b) { n |= two(b); }
inline void unset_bit(int & n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) { int res = 0; while(n && ++res) n-=n&(-n); return res; }
template<class T> void chmax(T & a, const T & b) { a = max(a, b); }
template<class T> void chmin(T & a, const T & b) { a = min(a, b); }
const int MOD=1000000007;
bool isPowerOfTwo (ll x)
{
return x && (!(x&(x-1)));
}
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 highestPowerof2(unsigned int n)
{
if (n < 1)
return 0;
int res = 1;
for (int i=0; i<8*sizeof(unsigned int); i++)
{
int curr = 1 << i;
if (curr > n)
break;
res = curr;
}
return res;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
const int dx[] = {1,0,-1,0,1,1,-1,-1};
const int dy[] = {0,-1,0,1,1,-1,-1,1};
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
while(t--)
{
ll n;
cin>>n;
const ll p = 998244353;
ll a[n];
map<ll,ll> mp;
REP(i,n)
{
cin>>a[i];
mp[a[i]]++;
}
if(mp[0]!=1)
{
cout<<0;
return 0;
}
ll ans=1;
for(int i=1;i<n;i++)
{
ans*=mp[a[i]-1];
ans%=p;
}
cout<<ans;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#ifdef DEBUG
#define DEBUG_PRINT(fm, ...) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout << "DEBUG PRINT ";std::printf(fm, __VA_ARGS__);}while(0)
#define DEBUG_VAL(a, b) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout <<"DEBUG VAL " << a << ":" << b << endl;}while(0)
#else
#define DEBUG_PRINT(...)do{}while(0);
#define DEBUG_VAL(a, b)do{}while(0);
#endif
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
int A, B, M;
cin >> A >> B >> M;
v1 a(A+1);
v1 b(B+1);
int ma = 1e6;
int mb = 1e6;
rep(i, A){
int aa;
cin >> aa;
a[i+1] = aa;
ma = min(ma, aa);
}
rep(i, B){
int bb;
cin >> bb;
b[i+1] = bb;
mb = min(mb, bb);
}
int ans = ma+mb;
rep(i, M){
int x, y, c;
cin >> x >> y >> c;
int value = a[x] + b[y] -c;
ans = min(ans, value);
}
cout << ans << endl;
}
| 0
| 67,127,693
|
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin >> n && n > 0)
{
int s[100];
int max=-1, min=1001;
int sum=0, ave=0;
for(int i=0;i<n;i++)
{
cin >> s[i];
sum += s[i];
if(s[i] > max)
max = s[i];
if(s[i] < min)
min = s[i];
}
sum -= (max + min);
ave = sum/(n-2);
cout << ave << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
typedef unsigned int UI;
typedef pair<int, int> PII;
const int inf = 0x7f7f7f7f;
#define rdi() read<int>()
#define rdl() read<LL>()
#define rds(a) scanf("%s", a)
#define mk(i, j) make_pair(i, j)
#define pb push_back
#define fi first
#define se second
#define For(i, j, k) for (int i = j; i <= k; i ++)
#define Rep(i, j, k) for (int i = j; i >= k; i --)
#define Edge(i, u) for (int i = head[u]; i; i = e[i].nxt)
template<typename t> t read() {
t x = 0; int f = 1; char c = getchar();
while (c > '9' || c < '0') f = c == '-' ? -1 : 1 , c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - 48 , c = getchar();
return x * f;
}
template<typename t> void write(t x) {
if (x < 0){
putchar('-'), write(-x);
return;
}
if (x >= 10) write(x / 10);
putchar(x % 10 + 48);
}
const int P = 1e9 + 7;
const int N = 1e5 + 10;
int fac[N], facinv[N], a[N], n, pos, vis[N], id;
int power(int a, int b) {
int c = 1;
for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) c = 1ll * c * a % P;
return c;
}
int C(int x, int y) {
return 1ll * fac[x] * facinv[y] % P * facinv[x - y] % P;
}
int main() {
n = rdi() + 1;
for (int i = 1; i <= n; i ++) a[i] = rdi();
fac[0] = fac[1] = 1;
for (int i = 2; i <= n; i ++) fac[i] = 1ll * fac[i - 1] * i % P;
facinv[n] = power(fac[n], P - 2);
for (int i = n - 1; i >= 0; i --) facinv[i] = 1ll * facinv[i + 1] * (i + 1) % P;
for (int i = 1; i <= n; i ++) {
if (vis[a[i]]) {
pos = i;
id = a[i];
break;
}
vis[a[i]] = i;
}
int len = n - pos + 1;
for (int i = 1; i <= n; i ++) {
int ans = C(n, i);
if (i - 1 <= len - 1 + vis[id] - 1) ans -= C(len - 1 + vis[id] - 1, i - 1);
ans = (ans + P) % P;
write(ans), putchar(10);
}
return 0;
}
| 0
| 91,571,955
|
#include<iostream>
int intager[101]={0};
int main(){
int a;
int max=0;
while(std::cin>>a){
intager[a]+=1;
if(intager[a]>max)max=intager[a];
}
for(int i=1;i<101;++i){
if(intager[i]==max)std::cout<<i<<std::endl;
}
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
ll arr[maxsize];
vector<ll> v(maxsize);
map<ll, ll> m;
ll gcd(ll a, ll b) {
if(a == 0) return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
bool is_palindrome(string s) {
string t(s.rbegin(), s.rend());
return t == s;
}
void solve() {
string s;
bool flag = true;
cin >> s;
int n = s.length();
if(is_palindrome(s) && is_palindrome(s.substr(0, (n - 1) / 2)) && is_palindrome(s.substr((n + 1) / 2)))
cout << "Yes" << endl;
else cout << "No" << endl;
}
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.precision(35);
solve();
return 0;
}
| 0
| 49,890,184
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n,a,b; cin>>n>>a>>b;
ll ans=(b*(n-1)+a)-(a*(n-1)+b)+1;
if(ans<0) cout<<0<<endl;
else cout<<ans<<endl;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
REP(i,v.size()){if(i)os<<" ";os<<v[i];}return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v) {
REP(i,v.size()){if(i)os<<endl;os<<v[i];}return os;}
#define vi vector<int>
#define vii vector<vector<int>>
#define mii map<int,int>
#define Sort(v) sort(v.begin(),v.end())
#define Reverse(v) reverse(v.begin(),v.end())
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
const int md = 1000000007;
const int INF = 1<<30;
int main(){
int n; cin >> n;
vector<vector<int>> e(n);
rep(i,n){
int s; cin >> s;
int tmp; cin >> tmp;
rep(j,tmp){
int to; cin >> to;
e[i].push_back(to-1);
}
}
vi ans(n,-1);
rep(i,n){
queue<pair<int,int>> bfs;
bfs.emplace(0,0);
vector<bool> visit(n,false);
while(!bfs.empty()){
auto tmp = bfs.front();
if(tmp.first == i) {
ans[i] = tmp.second;
break;
}
visit[tmp.first] = true;
bfs.pop();
rep(j,e[tmp.first].size()){
if(!visit[e[tmp.first][j]]) {
bfs.emplace(e[tmp.first][j],tmp.second+1);
}
}
}
}
rep(i,n){
cout << i+1 << " " << ans[i] << endl;
}
}
| 0
| 95,731
|
#include <bits/stdc++.h>
using namespace std;
int powe(int k){
int ans=1;
for(int i=1; i<=k; i++)
ans*=2;
return ans;
}
int main(int argc, const char * argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int m, k; cin>>m>>k;
if(k>=powe(m))
cout<<"-1\n";
else if(m==1){
if(k==0){
cout<<"0 1 1 0\n";
}
else if(k==1){
cout<<"-1\n";
}
}
else{
for(int i=0; i<(1<<m); i++){
if(i==k) continue;
else cout<<i<<" ";
}
cout<<k<<" ";
for(int i=(1<<m)-1; i>=0; i--){
if(i==k) continue;
else cout<<i<<" ";
}
cout<<k<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#define _GLIBCXX_DEBUG
#define DIVISOR 1000000007
using namespace std;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
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 vs, es;
cin >> vs >> es;
vector<vector<int>> graph(vs);
for(int i = 0; i < es; i++) {
int v1, v2;
cin >> v1 >> v2;
v1--; v2--;
graph[v1].push_back(v2);
graph[v2].push_back(v1);
}
vector<pii> table(vs, make_pair(INF, 0));
table[0] = make_pair(0, 0);
queue<int> queue;
queue.push(0);
while(!queue.empty()) {
int src = queue.front(); queue.pop();
debug("v: %d\n", src);
int count = table[src].first;
for(int dst: graph[src]) {
if(table[dst].first > count+1) {
table[dst] = make_pair(count+1, src);
queue.push(dst);
}
}
}
bool flag = true;
for(int i = 0; i < vs; i++) {
if(table[i].first == INF) flag = false;
}
if(flag) {
cout << "Yes" << endl;
for(int i = 1; i < vs; i++) {
cout << table[i].second + 1 << endl;
}
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 63,325,040
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define INF 1000000000000
#define F first
#define S second
#define P pair<int,int>
#define all(vec) vec.begin(),vec.end()
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*b/gcd(a,b);
}
int log(int a){
int b=a;
int cnt=0;
while(b%2==0){
b/=2;
cnt++;
}
return cnt;
}
int n;
string s[60];
int t[60];
string x;
int ans=0;
bool awake=true;
signed main(){
cin>>n;
rep(i,n){
cin>>s[i]>>t[i];
}
cin>>x;
rep(i,n){
if(!awake)ans+=t[i];
if(s[i]==x)awake=false;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long long MOD = 1000000007;
int N;
const int N_MAX = 201;
long long dist[N_MAX][N_MAX];
void floyd(){
for(int k = 0; k < N; k++){
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
}
ll M, edge[101][101];
signed main(){
cin >> N >> M;
ll a, b, c;
REP(i, N) REP(j, N) edge[i][j] = dist[i][j] = LONG_LONG_MAX / 2;
REP(i, N) edge[i][i] = dist[i][i] = 0;
REP(i, M){
cin >> a >> b >> c;
a--; b--;
edge[a][b] = edge[b][a] = dist[a][b] = dist[b][a] = c;
}
floyd();
ll ans = 0;
REP(i, N - 1){
FOR(j, i + 1, N){
if(edge[i][j] < LONG_LONG_MAX / 2 && edge[i][j] > dist[i][j]) ans++;
}
}
PRINT(ans);
return 0;
}
| 0
| 65,573,869
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#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()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
signed main(void)
{
int n, sum = 0, idx;
cin >> n;
FOR(i, 1, n+1) {
sum += i;
if(sum >= n) {
idx = i;
break;
}
}
VI ans;
while(n) {
if(n >= idx) {
n -= idx;
ans.push_back(idx);
}
idx--;
}
for(int i: ans) cout << i << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int main(){
int n; std::cin >> n;
std::string s,t;
std::cin >> s >> t;
int ans = 2*n;
for(int i=n-1; i>=0; i--){
std::string si = s.substr(i);
std::string ti = t.substr(0,n-i);
if(si==ti){
ans = 2*n - si.size();
}
}
std::cout << ans << "\n";
return 0;
}
| 0
| 26,612,161
|
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
ll gcd(ll a , ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll lcm(ll a , ll b){
ll g = gcd(a , b);
ll lc = (a/g) * b;
return lc;
}
int main()
{
dhoom;
int n;
cin >> n;
if(n < 1200)
cout << "ABC" << endl;
else if(n < 2800)
cout << "ARC" << endl;
else
cout << "AGC" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define fuckit(){ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
}
using namespace std;
int main()
{
fuckit();
int h,w,i,j;
cin>>h>>w;
char c[h+1][w+1],C[h*2+1][w];
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
cin>>c[i][j];
}
}
for(i=1;i<=2*h;i++){
for(j=1;j<=w;j++){
C[i][j]=c[(i+1)/2][j];
}
}
for(i=1;i<=2*h;i++){
for(j=1;j<=w;j++){
cout<<C[i][j];
}
cout<<"\n";
}
return 0;
}
| 0
| 29,955,745
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template<typename T> void setmax(T& x, T y) {x = max(x, y);}
template<typename T> void setmin(T& x, T y) {x = min(x, y);}
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int m, k;
cin >> m >> k;
if (k >= (1 << m))
{
cout << -1;
return 0;
}
if (m == 1)
{
if (k == 0) cout << "0 0 1 1 ";
else cout << -1;
return 0;
}
vector<int> all(1 << m);
iota(ALL(all), 0);
swap(all[k], all.back());
for(auto i: all) cout << i << ' ';
all.pop_back();
reverse(ALL(all));
for(auto i: all) cout << i << ' ';
cout << k << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int a,b,k;cin>>a>>b>>k;
int i = 0;
while(true){
a /= 2;
b += a;
i++;
if(i == k) break;
b /= 2;
a += b;
i++;
if(i == k) break;
}
cout << a << " " << b << endl;
}
| 0
| 88,473,300
|
#include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r);
template <class T1, class T2>
void vadd(vector<T1> &v, T2 x);
#define int long long int
void solve(long long N, const std::vector<long long> x, const std::vector<long long> y)
{
vector<int> idx;
rep(i, N) if (x[i] != 0 || y[i] != 0) idx.push_back(i);
sort(vall(idx), [&](int l, int r) -> bool {
return atan2(y[l], x[l]) < atan2(y[r], x[r]);
});
double ans = 0;
rep(i, 2 * idx.size()) rep(j, i + 1)
{
lli X = 0, Y = 0;
if (i - j + 1 <= idx.size())
{
for (int k = j; k <= i; k++)
{
X += x[idx[k % idx.size()]];
Y += y[idx[k % idx.size()]];
}
chmax(ans, sqrt(X * X + Y * Y));
}
}
printf("%.10f", ans);
}
signed main()
{
long long N;
scanf("%lld", &N);
std::vector<long long> x(N);
std::vector<long long> y(N);
for (int i = 0; i < N; i++)
{
scanf("%lld", &x[i]);
scanf("%lld", &y[i]);
}
solve(N, std::move(x), std::move(y));
return 0;
}
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r)
{
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r)
{
return (l < r) ? (l = r, true) : false;
}
template <class T1, class T2>
void vadd(vector<T1> &v, T2 x)
{
for (auto &s : v)
s += T2(x);
}
|
#include <iostream>
using namespace std;
int main(void){
int W;
int H;
int x;
int y;
int r;
cin>>W>>H>>x>>y>>r;
if(W<x+r||H<y+r){
cout<<"No"<<endl;
}
else if(0>x-r||0>y-r){
cout<<"No"<<endl;
}
else if(0<=x-r&&0<=y-r){
cout<<"Yes"<<endl;
}
else if(W>=x+r&&H>=y+r){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
| 0
| 9,284,118
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) && (N.at(1) == N.at(2) && N.at(2) == N.at(3)) ){
cout << "Yes" <<endl;
}
else if (N.at(0) == N.at(1) && N.at(1) == N.at(2) ){
cout << "Yes" <<endl;
}
else if (N.at(1) == N.at(2) && N.at(2) == N.at(3)){
cout << "Yes" <<endl;
}
else{
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
char C[36][3];
char Cb[36][3];
char Cs[36][3];
int Ib[36];
int Is[36];
int N;
bool is_stable(char c[][3], int ind[]){
char num='1';
for (int i=1; i<N; i++) {
if (c[i][1] == num) {
if (ind[i-1] > ind[i]) {
return false;
}
}
num = c[i][1];
}
return true;
}
void print_cards(char c[][3]){
for (int i=0; i<N; i++) {
printf("%s", c[i]);
putchar(i<N-1 ? ' ' : '\n');
}
}
int main()
{
scanf("%d", &N);
for (int i=0; i<N; i++) {
scanf("%s", C[i]);
strcpy(Cb[i], C[i]);
strcpy(Cs[i], C[i]);
Ib[i] = Is[i] = i;
}
for (int i=0; i<N; i++) {
for (int j=N-1; j>i; j--) {
if (Cb[j-1][1] > Cb[j][1]) {
char temp[3];
strcpy(temp, Cb[j-1]);
strcpy(Cb[j-1], Cb[j]);
strcpy(Cb[j], temp);
int tempi = Ib[j];
Ib[j] = Ib[j-1];
Ib[j-1] = tempi;
}
}
}
print_cards(Cb);
puts(is_stable(Cb, Ib)?"Stable":"Not stable");
for (int i=0; i<N; i++) {
int minj = i;
for (int j=i; j<N; j++) {
if (Cs[j][1] < Cs[minj][1]) {
minj = j;
}
}
char temp[3];
strcpy(temp, Cs[minj]);
strcpy(Cs[minj], Cs[i]);
strcpy(Cs[i], temp);
int tempi = Is[minj];
Is[minj] = Is[i];
Is[i] = tempi;
}
print_cards(Cs);
puts(is_stable(Cs, Is)?"Stable":"Not stable");
}
| 0
| 11,777,177
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = (B-1); I >= (A); --I)
#define SORT(x) (sort(x.begin(),x.end()))
const ll INF=1e18+7;
const ll MOD=1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
FOR(i,0,n)cin>>a[i];
SORT(a);
ll x,y=a[0];
x = a[n-1];
FOR(i,0,n){
if(abs(x-2*y)>abs(x-2*a[i]))y=a[i];
}
cout << x << " " << y <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll K;
cin >> K;
if (K < 10) {
cout << K << endl;
return 0;
}
vector<vector<string>> lunluns(12);
for (ll i = 1; i < 10; i++) {
lunluns[1].push_back(to_string(i));
}
ll cnt = 9;
ll order = 1;
while (cnt < K) {
for (auto l : lunluns[order]) {
if (*l.rbegin() == '0') {
lunluns[order + 1].push_back(l + "0");
lunluns[order + 1].push_back(l + "1");
cnt += 2;
} else if (*l.rbegin() == '9') {
lunluns[order + 1].push_back(l + "8");
lunluns[order + 1].push_back(l + "9");
cnt += 2;
} else {
ll last_digit = *l.rbegin() - '0';
lunluns[order + 1].push_back(l + to_string(last_digit - 1));
lunluns[order + 1].push_back(l + to_string(last_digit));
lunluns[order + 1].push_back(l + to_string(last_digit + 1));
cnt += 3;
}
}
order++;
}
vector<string> flat;
for (auto lo : lunluns) {
for (auto s : lo) {
flat.push_back(s);
}
}
cout << flat[K - 1] << endl;
}
| 0
| 53,655,853
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<int> c(n);
rep(i,n) {
int px;
cin >> px;
p[i] = px-1;
}
rep(i,n) cin >> c[i];
ll ans = LLONG_MIN;
rep(sp,n) {
int pos = sp;
vector<int> v;
ll tot = 0;
while (1) {
pos = p[pos];
v.push_back(c[pos]);
tot += c[pos];
if (pos == sp) break;
}
int l = v.size();
ll cum = 0;
rep(i,l) {
cum += v[i];
if (i+1 > k) break;
ll t = cum;
if (tot > 0) {
ll e = (k-i-1)/l;
t += tot*e;
}
ans = max(t, ans);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
void solve(){
int q;
cin >> q;
Vi ans;
while(q--){
ll a,b;
cin >> a >> b;
ll lim=a*b-1;
ll mid, ok = 0, ng = min(lim,1000000000ll);
while(abs(ok-ng)>1){
mid = (ok+ng)/2;
if(mid*(mid+1)<=lim)ok = mid;
else ng = mid;
}
if(a==b)ans.pb(ok+lim/(ok+1));
else ans.pb(ok-1+lim/(ok+1));
}
for(auto l:ans){
print(l);
}
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
}
| 0
| 60,294,928
|
#include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for (int i = 0; i <(int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll MOD=100000007;
const ll INF=1000000101001;
int main(){
int n;cin >> n;
string s,t;cin>>s>>t;
string st=s+t;
rep(i,2*n){
if(i%2==0)st[i]=s[i/2];
if(i%2!=0)st[i]=t[i/2];
}
cout << st << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <cctype>
#include <fstream>
#include <ctime>
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const string button[10] = {
"", ".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"
};
int main()
{
ios_base::sync_with_stdio(0);
int n; cin >> n;
while (n-- ){
string s = ""; cin >> s;
int m = s.length();
map<int,int> p; p.clear();
string res = "";
rep (i, m ){
if (s[i] != '0' ){
p[(int)(s[i]-'0')]++;
}else{
map<int,int>::iterator it = p.begin();
if (it == p.end() ) continue;
int a = (*it).first;
int b = (*it).second; b--;
int len = button[a].length();
res += button[a][b%len];
p.clear();
}
}
cout << res << endl;
}
return 0;
}
| 0
| 47,238,795
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
bool isgusu(string s) {
int n = s.size();
string x = s.substr(0, n/2);
string y = s.substr(n/2, n/2);
return x == y;
}
int main() {
string s; cin >> s;
rep(i, s.size()) {
string ss = s.substr(0, s.size()-i-1);
int l = ss.size();
if (l % 2 != 0) continue;
if (isgusu(ss)) {
cout << l << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(){
int N;
cin >> N;
ll p = 1;
ll sum = 0;
while(true){
sum += p;
p++;
if(sum == N) break;
if(sum > N){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
cout << p << endl;
rep(i,p){
if(i==0){
vector<int> v;
int x = 1;
int y = 0;
while(y+1 <= sum){
v.push_back(y+1);
y += x;
x++;
}
cout << v.size();
rep(j,v.size()){
cout << " " << v[j];
}
cout << endl;
}else{
vector<int> v;
ll x = i * (ll)(i-1) / 2 + 1;
rep(j,i){
v.push_back(x+j);
}
int y = x + i;
int z = i + 1;
while(y+i <= sum){
v.push_back(y+i);
y += z;
z++;
}
cout << v.size();
rep(j,v.size()){
cout << " " << v[j];
}
cout << endl;
}
}
return 0;
}
| 0
| 65,019,131
|
#include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
string s;
char c;
int a,li,ls;
string accion;
getline(cin,s);
cin>>a;
while(a--)
{
cin>>accion;
if(accion=="replace")
{
cin>>li>>ls;
for(int i=li;i<=ls;i++)
cin>>s[i];
}else if(accion=="reverse")
{ cin>>li>>ls;
for(int i=0;i<=(ls-li)/2;i++)
{ c=s[li+i];
s[li+i]=s[ls-i];
s[ls-i]=c;
}
}
else
{ cin>>li>>ls;
for(int i=li;i<=ls;i++)
cout<<s[i];
cout<<endl;
}
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
string keitai(string s){
string t="";
char k1[6]=".,!? ";
for(int i=0; i<s.size(); ++i){
if(s[i]=='0') continue;
else if(s[i]=='1'){
int c1=0;
do{
++i;
++c1;
}while(s[i]=='1');
if(s[i]=='0') t += k1[(c1-1)%5];
}
else{
char c=s[i];
int c2=0;
do{
++i;
++c2;
}while(s[i]==c);
if(s[i]=='0'){
if('2'<=c && c<='6') t+='a'+((c-'2')*3)+((c2-1)%3);
else if(c=='7') t+='p'+(c2-1)%4;
else if(c=='8') t+='t'+(c2-1)%3;
else if(c=='9') t+='w'+(c2-1)%4;
}
}
}
return t;
}
int main(){
int n;
scanf(" %d", &n);
for(int i=0; i<n; ++i){
string s;
cin >> s;
cout << keitai(s) << endl;
}
return 0;
}
| 0
| 21,444,331
|
#include <iostream>
#include <string>
using namespace std;
int w, h, x, y, r;
bool a;
string answer;
int main(){
cin >> w >> h >> x >> y >> r;
if (y + r > h || y - r < 0 || x - r < 0 || x + r > w){
a = false;
}
else{
a = true;
}
if (a == false){
answer = "No";
}
else{
answer = "Yes";
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
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 rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <typename T> bool chmax(T &a, const T &b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, const T &b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 60;
const long long MOD = 1e9 + 7;
bool graph[8][8];
int dfs(int v, int N, bool visited[8]) {
bool all = 1;
rep(i, N) if(!visited[i]) all = 0;
if(all) return 1;
int ret = 0;
rep(i, N) {
if(!graph[v][i]) continue;
if(visited[i]) continue;
visited[i] = true;
ret += dfs(i, N, visited);
visited[i] = false;
}
return ret;
}
int main() {
int N, M;
cin >> N >> M;
rep(i, 8) rep(j, 8) graph[i][j] = 0;
rep(i, M) {
int a, b;
cin >> a >> b;
graph[a - 1][b - 1] = graph[b - 1][a - 1] = 1;
}
bool visited[8] = {0};
visited[0] = 1;
cout << dfs(0, N, visited) << endl;
}
| 0
| 30,280,426
|
#include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long long i = (long long)(a); i <= (long long)(n); i++)
#define irrep(i,n) for(int i = (int)(n); i > -1; i--)
#define irrep2(i,a,n) for(int i = (int)(n); i >= (int)(a); i--)
typedef long long ll;
typedef std::vector<char> v_char;
typedef std::vector<v_char > v2_char;
typedef std::vector<double> v_double;
typedef std::vector<v_double > v2_double;
typedef std::vector<int> v_int;
typedef std::vector<v_int > v2_int;
typedef std::vector<ll> v_ll;
typedef std::vector<v_ll > v2_ll;
typedef std::vector<std::string> v_string;
typedef std::vector<v_string > v2_string;
typedef std::vector<bool> v_bool;
typedef std::vector<v_bool > v2_bool;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, int> pii;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
if(a % 3 == 0 || b % 3 == 0 || (a+b) % 3 == 0) {
cout << "Possible";
} else {
cout << "Impossible";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
pair<int, int> r[n], b[n];
for (int i=0; i<n; i++) cin>>r[i].first>>r[i].second;
for (int i=0; i<n; i++) cin>>b[i].first>>b[i].second;
sort(r, r + n);
sort(b, b + n);
bool used[n];
for (int i=0; i<n; i++) used[i] = false;
int cnt = 0;
for (int i=n-1; i>=0; i--) {
bool found = false;
int min_d = 200;
int i_min_d = -1;
for (int j=0; j<n; j++) {
if (used[j]) {
continue;
}
if (r[i].first < b[j].first && r[i].second < b[j].second) {
found = true;
if (b[j].second <= min_d) {
min_d = b[j].second;
i_min_d = j;
}
}
}
if (found) {
used[i_min_d] = true;
++cnt;
}
}
cout<<cnt<<endl;
}
| 0
| 53,960,264
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
int main() {
ll N, D, A;
cin >> N >> D >> A;
vector<P> monster(N);
vector<ll>X(N), H(N);
vector<ll> damage(N, 0);
rep(i, N) {
cin >> X[i] >> H[i];
monster[i] = mp(X[i], H[i]);
}
sort(monster.begin(), monster.end());
sort(X.begin(), X.end());
ll ans = 0;
rep(i, N) {
if(damage[i] < monster[i].second) {
ans += ll((monster[i].second - damage[i] - 1) / A + 1);
ll dmg = ll((monster[i].second - damage[i] - 1) / A + 1) * A;
damage[i] += dmg;
damage[(upper_bound(all(X), 2 * D + monster[i].first)) - X.begin()] -= dmg;
}
damage[i + 1] += damage[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265358979;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
reverse(s.begin(), s.end());
string t = "";
for (ll i = 0; i < s.size(); i++){
t += s[i];
if (t == "maerd" || t == "remaerd" || t == "esare" || t == "resare"){
t = "";
}
if (t.size() > 8){
break;
}
}
YESNO(t == "");
}
| 0
| 43,298,749
|
#include <stdio.h>
int main(void)
{
int a,b;
scanf ("%d %d",&a,&b);
if (a>=-1000 && a<=1000 && b>=-1000 && b<=1000){
if (a>b){
printf ("a > b\n");
} else if(a < b){
printf ("a < b\n");
} else {
printf ("a == b\n");
}
}
return 0;
}
|
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#ifndef _USEFUL_MACROS_
#define _USEFUL_MACROS_
#define INF (99999999/3)
#define N_PRIME 1000000007
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef OUTPUT_DEBUG
#define debug(x) cout<<#x<<": "<<x<<endl
#else
#define debug(x) do{}while(false)
#endif
#endif
using namespace std;
int main(void){
int n,m;
cin >> n >> m;
vector<int> c(m);
vector<int> dp(n+1);
REP(i,m) cin >> c[i];
sort(c.begin(),c.end());
REP(i,n+1)dp[i] = INF;
dp[0] = 0;
dp[1] = 1;
REP(i,m){
FOR(j,1,n+1){
int index = j - c[i];
if( index < 0 )continue;
dp[j] = min(dp[index]+1,dp[j]);
}
}
debug(c[0]);
REP(i,n+1)
debug(dp[i]);
cout << dp[n] << endl;
return 0;
}
| 0
| 51,809,856
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int n, m, d;
int main(){
cin >> n >> m >> d;
if(n<1){
cout << 0 << endl;
}
ll c = n-d;
cerr << "c:" << c << endl;
double ans = (double)c*(m-1)*2/((double)n*n);
if(d == 0){
ans /= 2;
}
printf("%.10f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef string str;
typedef pair <int,int> pii;
typedef pair <ll,ll> pll;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
#define fbo find_by_order
#define ook order_of_key
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define watch(x) cout << (#x) << " is : " << (x) << newl
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vi dirx = {0,0,1,-1};
vi diry = {1,-1,0,0};
char to_upper (char x){
if( 97 <= int(x) && int(x) <= 122) return char(x-32);
if( 65 <= int(x) && int(x) <= 90) return x;
return -1;
}
char to_lower (char x){
if( 97 <= int(x) && int(x) <= 122) return x;
if( 65 <= int(x) && int(x) <= 90) return char(x+32);
return -1;
}
int numerize (char x){
if(48 <= int(x) && int(x) <= 57) return int(x-'0');
if(97 <= int(x) && int(x) <= 122) return int(x-96);
if(65 <= int(x) && int(x) <= 90) return int(x-64);
return -1;
}
bool isect (int l1, int r1, int l2, int r2){
pii p1 = {l1,r1};
pii p2 = {l2,r2};
if(p1>p2)swap(p1,p2);
return (p2.fi <= p1.se);
}
ll quickpow (ll num1, ll num2, ll MOD){
if(num2==0)return 1%MOD;
else if(num2==1)return num1%MOD;
else{
ll temp = quickpow (num1,num2>>1LL,MOD); ll res = ((temp%MOD) * (temp%MOD))%MOD;
if(num2&1) res = ((res%MOD)*(num1%MOD))%MOD; return res;
}
}
ll invmod (ll num, ll MOD){return quickpow (num,MOD-2,MOD);}
ll gcd (ll num1, ll num2){
if(num1 < num2) swap(num1,num2); ll num3 = num1 % num2 ;
while(num3 > 0){ num1 = num2; num2 = num3; num3 = num1 % num2;}
return num2;
}
ll lcm (ll num1 , ll num2){return (ll) (num1/__gcd(num1,num2))*num2;}
bool has[400];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
pii p = {INT_MAX,INT_MAX};
int x,n; cin >> x >> n;
for(int i = 1; i <= n; ++i){
int a; cin >> a; has[a] = true;
}
for(int i = 0; i <= 300; ++i){
if(has[i]) continue;
int ab = abs(i-x);
p = min(p,{ab,i});
}
cout << p.se << newl;
return 0;
}
| 0
| 91,282,005
|
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n / 3);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n; cin >> n;
vector<int> a(n);
bool ok = false;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] == 2) ok = true;
a[i]--;
}
if (!ok) {
cout << "-1" << endl;
return 0;
}
int button = 0;
int count = 1;
while (a[button] != 1 && count <= n) {
button = a[button];
count++;
}
if (a[button] == 1) {
cout << count << endl;
}
else {
cout << "-1" << endl;
}
}
| 0
| 21,174,561
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
for(int i=1;i<=K;i++){
if(i%2==1){
A/=2;
B+=A;
}
else{
B/=2;
A+=B;
}
}
cout << A << " " << B << endl;
}
|
#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) {
if(v.size() >= 200) {
return "Too big container";
}
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 per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++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; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const int INFI = (1 << 30) - 1;
const long long INFLL = (1LL << 62) - 1;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
const int dy8[8] = { 1, 1, 1, 0, 0, -1, -1, -1 };
const int dx8[8] = { -1, 0, 1, -1, 1, -1, 0, 1 };
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }
ld A,B,X;
bool check(ld deg) {
ld rad = deg2rad(deg);
if(rad > M_PI / 2.0 - 0.0000000001) {
return false;
}
if(B * tan(M_PI / 2 - rad) <= A) {
return (B * tan(M_PI / 2 - rad) * B / 2 * A) >= X;
}
return (A * A * B - (tan(rad) * A / 2 * A * A)) >= X;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> X;
ld ok = 0, ng = 90;
rep(i, 1000) {
ld mid = (ok + ng) / 2;
if(check(mid)) {
ok = mid;
} else {
ng = mid;
}
}
precout();
print(ok);
}
| 0
| 21,004,050
|
#define MOD 1000000007;
#define input ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#include <bits/stdc++.h>
using namespace std;
const int N = 2e1 + 5;
int main() {
ll n,k;
cin>>n>>k;
vector<pair<int,int>> vec;
for(int i=0;i<n;i++)
{
int a,b;
cin>>a>>b;
vec.push_back({a,b});
}
sort(vec.begin(),vec.end());
int ans;
for(int i=0;i<n;i++)
{
if(vec[i].second>=k)
{ans=vec[i].first;
break;}
else
k-=vec[i].second;
}
cout<<ans;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstdio>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int M, min, max;
while(1){
cin >> M >> min >> max;
if(M == 0 && min == 0 && max == 0) break;
int P[M];
REP(i, M) cin >> P[i];
int gomi = 0;
int cnt = 0;
REPS(i, min-1, max){
if(gomi <= P[i]-P[i+1]){
gomi = P[i]-P[i+1];
cnt = i+1;
}
}
cout << cnt << endl;
}
return 0;
}
| 0
| 27,151,810
|
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
typedef long long int lld;
typedef unsigned long long int llu;
#define TESTCASES() cin >> (T3X0); T353 = T3X0; while(T3X0--)
#define _input(V3C) for(auto &V3C_I7 : (V3C)) cin >> (V3C_I7)
#define mems(A77AY, V4LU) memset((A77AY), (V4LU), sizeof((A77AY)))
#define CH3K(I7, E4, S7) (((S7)<0) ? (I7)>(E4) : (I7)<(E4))
#define for4(I7,S4,E4,S7) for(auto I7=(S4); CH3K(I7,E4,S7); (I7)+=(S7))
void solveEachTest(lld T35TC453N = 1) {
lld a, b, k; cin >> a >> b >> k;
lld g = __gcd(a, b);
for4(i, g, 0, -1) {
if (g % i == 0 ) k--;
if (k == 0) {
cout << i ;
return;
}
}
cout << "\n";
return;
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0);
lld T3X0 = 0, T353 = 1;
solveEachTest(T353 - T3X0);
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;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() {
int H, W; cin >> H >> W;
vector<vc> A(H, vc(W)) ;
rep(i, H) rep(j, W) cin >> A[i][j];
vi x;
rep(i, H) {
int cnt = 0;
rep(j, W) {
if (A[i][j] == '.') cnt++;
}
if (cnt != W) {
x.push_back(i);
}
}
vi y;
rep(j, W) {
int cnt = 0;
rep(i, H) {
if (A[i][j] == '.') cnt++;
}
if (cnt != H) {
y.push_back(j);
}
}
rep(i, x.size()) {
rep(j, y.size()) {
cout << A[x[i]][y[j]];
}
cout << endl;
}
}
| 0
| 69,544,279
|
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,ans=0,P=1;
cin >> N;
vector<ll> A(N);
rep(i,N) cin >> A.at(i);
rep(i,N){
if(i==0){
ans+=A.at(i)-1;
P++;
}else if(A.at(i)==P){
P++;
}else{
if(A.at(i)%P!=0){
ans+=A.at(i)/P;
}else{
ans+=1;
A.at(i)-=P+1;
ans+=A.at(i)/P;
}
}
}
cout << ans << endl;
}
|
#include<iostream>
#include<cstdio>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
queue<int> Q;
int N;
bool PATH[101][101] = {false};
int len[101];
void BFS(int id){
Q.pop();
for (int i = 1; i <= N; i++) {
if (PATH[id][i]) {
if (len[i] > len[id] + 1) {
len[i] = len[id] + 1;
Q.push(i);
}
}
}
}
void BFS_m(){
while (!Q.empty()) {
BFS(Q.front());
}
}
int main(){
Q.push(1);
cin >> N;
for (int i = 1; i <= N; i++) {
int bb;
int n;
cin >> bb;
cin >> n;
for (int k = 0; k < n; k++) {
int s;
cin >> s;
PATH[i][s] = true;
}
}
for (int i = 1; i <= N; i++) len[i] = 2000000000;
len[1] = 0;
BFS_m();
for (int i = 1; i <= N; i++) {
if (len[i] == 2000000000) len[i] = -1;
printf("%d %d\n",i,len[i]);
}
return 0;
}
| 0
| 71,128,251
|
#include<iostream>
#include<algorithm>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
class Dice
{
public:
int lab[6];
};
int main() {
Dice dice;
int q, i, j, a, b, ai, bi;
rep(i,6) cin >> dice.lab[i];
cin >> q;
rep(i,q) {
cin >> a >> b;
rep(j,6) {
if (dice.lab[j] == a) ai = j;
if (dice.lab[j] == b) bi = j;
}
if ((ai==3&&bi==1)||(ai==1&&bi==2)||(ai==2&&bi==4)||(ai==4&&bi==3)) {
cout << dice.lab[0] << endl;
} else if ((ai==0&&bi==3)||(ai==3&&bi==5)||(ai==5&&bi==2)||(ai==2&&bi==0)) {
cout << dice.lab[1] << endl;
} else if ((ai==0&&bi==1)||(ai==1&&bi==5)||(ai==5&&bi==4)||(ai==4&&bi==0)) {
cout << dice.lab[2] << endl;
} else if ((ai==0&&bi==4)||(ai==4&&bi==5)||(ai==5&&bi==1)||(ai==1&&bi==0)) {
cout << dice.lab[3] << endl;
} else if ((ai==0&&bi==2)||(ai==2&&bi==5)||(ai==5&&bi==3)||(ai==3&&bi==0)) {
cout << dice.lab[4] << endl;
} else if ((ai==1&&bi==3)||(ai==3&&bi==4)||(ai==4&&bi==2)||(ai==2&&bi==1)) {
cout << dice.lab[5] << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long L;
#define max_(x, y) (((x) > (y)) ? (x) : (y))
#define min_(x, y) (((x) < (y)) ? (x) : (y))
#define ___ ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Mx 2000001
#define inf 1e17
const L MOD = 1e9+7;
const double pi = 2 * acos (0.0);
L a,b,a1,a2,a3,b1,b2,b3,c,c1,c2,c3,d,d1,d2,d3,d4,d5,e1,e2,e3,f,h,k,l,n,m,m1,m2,n1,n2,o,p1,p2,p3,p4,
q1,q2,q3,q4,r,s,t,x,y,z,sum,mn,flg,flg1,flg2,id1,id2,id3,lim,cost;
L A[Mx];
int main()
{
c=0;
scanf("%lld%lld",&n,&k);
for(L i=0;i<k;i++){
scanf("%lld",&d);
for(L j=0;j<d;j++){
scanf("%lld",&a);
A[a]++;
}
}
for(L i=1;i<=n;i++)if(A[i]==0)c++;
printf("%lld\n",c);
return 0;
}
| 0
| 91,320,605
|
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int N, S, cnt;
void dfs( int i, int sum, int total )
{
if( total == N && sum == S )
{
cnt++;
return;
}
if( i == 10 || total == N ) return;
dfs( i + 1, sum + i, total + 1 );
dfs( i + 1, sum, total );
}
int main()
{
while( cin >> N >> S )
{
if( N == 0 && S == 0 ) break;
cnt = 0;
dfs( 0, 0, 0 );
cout << cnt << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define AC ios::sync_with_stdio(0),cin.tie(0);
#define ll long long int
int main(){
AC
ll a,b,c;
cin>>a>>b>>c;
if(a>b*c)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
}
| 0
| 62,521,666
|
#include<iostream>
#include<math.h>
using namespace std;
int main(){
double a,b,c,d=0,e=0;
string s;
string ab = "56789";
string ac = "321";
cin>>s;
if(s[5]=='1'){cout<<"TBD"; return 0;}
if(s[5]=='0'){
for(int i=0;i<5;i++){
if(s[6]==ab[i]){cout<<"TBD"; return 0;}
}
for(int i=0;i<3;i++){
if(s[6]==ac[i]){cout<<"Heisei"; return 0;}
}
if(s[6]=='4'){
if(s[8]=='3' && s[9]=='1'){cout<<"TBD"; return 0;}
else{cout<<"Heisei"; return 0;}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9+7;
constexpr lint mod2 = 998244353;
int main() {
lint h, w, s;
scanf("%ld %ld", &h, &w);
if(h == 1 && w == 1) s = 1;
else if(h == 1) s = w-2;
else if(w == 1) s = h-2;
else s = (h-2)*(w-2);
printf("%ld", s);
return 0;
}
| 0
| 85,226,712
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0;
int a[200005],visited[200005];
signed main()
{
cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++) visited[a[i]]++;
for (int i=1;i<=200000;i++) ans=max(ans,visited[i]+visited[i-1]+visited[i+1]);
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
typedef long long ll;
typedef pair<int,int> pa;
map<ll,int>mp;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n,m;cin>>n>>m;
mp[0]=1;
ll sum=0,ans=0;
for(int i=1;i<=n;i++){
ll x;cin>>x;
sum=(sum+x)%m;
ans+=mp[sum];
mp[sum]++;
}
cout<<ans<<endl;
return 0;
}
| 0
| 30,796,062
|
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<size_t I,class H,class...T>struct TupleReaderWriter{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple_cat(tuple<H>(v),TupleReaderWriter<sizeof...(T)-1,T...>::r(i));}static void w(ostream&o,tuple<H,T...>&t,string d){TupleReaderWriter<I-1,H,T...>::w(o,t,d);o<<d<<get<I>(t);}};
template<class H,class...T>struct TupleReaderWriter<0,H,T...>{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple<H>(v);}static void w(ostream&o,tuple<H,T...>&t,string d){o<<get<0>(t);}};
template<class...T>istream&operator>>(istream&i,tuple<T...>&t){t=TupleReaderWriter<sizeof...(T),T...>::r(i);return i;}
template<class...T>ostream&operator<<(ostream&o,tuple<T...>&t){string delim=" ";TupleReaderWriter<sizeof...(T)-1,T...>::w(o,t,delim);return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(auto&x:v)i>>x;return i;}
template<class T>ostream&operator<<(ostream&o,vector<T>&v){string delim="";for(auto&x:v)o<<delim<<x,delim=" ";return o;}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using vector2d=vector<vector<T>>;
struct fixprec{int x;fixprec(int d):x(d){}};
ostream&operator<<(ostream&o,fixprec f){return o<<fixed<<setprecision(f.x);}
void R_YESNO(bool p) { cout << (p ? "YES" : "NO") << endl; }
void R_YesNo(bool p) { cout << (p ? "Yes" : "No") << endl; }
i64 divceil(i64 a, i64 b) {
return a / b + (a > 0 && a % b ? 1 : 0);
}
int main() {
int K;
cin >> K;
vector<i64> A(K);
for(i64 &x : A) cin >> x;
reverse(WHOLE(A));
i64 a = 2, b = 2;
for(i64 x : A) {
a = divceil(a, x) * x;
b = (b / x + 1) * x - 1;
if(a > b) {
cout << -1 << endl;
return 0;
}
}
cout << a << " " << b << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main()
{
int N; cin >> N;
vector<int> a(N + 9); rep(i, N) cin >> a[i];
int ans = 0;
int prev = a[0];
for (int i = 1; i < N; ++i){
if (prev == a[i]){
++ans;
a[i] = 100 + ans;
prev = a[0];
i = 0;
} else {
prev = a[i];
}
}
cout << ans << endl;
return 0;
}
| 0
| 43,830,911
|
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
vector<int> Graph[210000];
vector<int> Depth[210000];
vector<int> Deep(210000);
vector<int> Parent(210000);
vector<int> child[210000];
int root;
void BFS() {
for (int i = 0; i < (int)Deep.size(); i++) {
Deep[i] = 999999;
}
priority_queue<P, vector<P>, greater<P>> Q;
Q.push(make_pair(0,root));
Depth[0].push_back(root);
Deep[root] = 0;
while (!Q.empty()) {
P p = Q.top();
Q.pop();
for (int i = 0; i < (int)Graph[p.S].size(); i++) {
if (Deep[Graph[p.S][i]] > p.F + 1) {
Q.push(make_pair(p.F+1,Graph[p.S][i]));
Deep[Graph[p.S][i]] = p.F + 1;
Depth[p.F+1].push_back(Graph[p.S][i]);
Parent[Graph[p.S][i]] = p.S;
child[p.S].push_back(Graph[p.S][i]);
}
}
}
}
int main() {
int N,Q;
cin >> N >> Q;
int ans[N];
for (int i = 0; i < N; i++) {
ans[i] = 0;
}
for (int i = 0; i < N-1; i++) {
int a,b;
cin >> a >> b;
a--; b--;
Graph[a].push_back(b);
Graph[b].push_back(a);
}
root = 0;
BFS();
for (int i = 0; i < Q; i++) {
int p,x;
cin >> p >> x;
p--;
ans[p] += x;
}
for (int i = 0; i < N-1; i++) {
for (int j = 0; j < (int)Depth[i].size(); j++) {
for (int k = 0; k < (int)child[Depth[i][j]].size(); k++) {
ans[child[Depth[i][j]][k]] += ans[Depth[i][j]];
}
}
}
for (int i = 0; i < N; i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
map<int,int64_t> p;
void fl(int64_t n){
if(n==1){
return ;
}
int tmp = n;
while(tmp%2==0 ){
tmp /= 2;
p[2]++;
}
for(int i=3;i*i<=tmp;i++){
while(tmp % i ==0){
tmp /= i;
p[i]++;
}
}
if(tmp!=1){
p[tmp]++;
}
}
int main(){
int n;
cin>>n;
if(n<=9){
cout<<0<<endl;
return 0;
}
for(int i=1;i<=n;i++){
fl(i);
}
int s=p.size();
int p75,p3,p25,p5,p15;
p75=0;
p3=0;
p25=0;
p5=0;
p15=0;
for(auto c:p){
int sh = c.second;
if(sh>=74){
p75++;
}
if(sh>=24){
p25++;
}
if(sh>=14){
p15++;
}
if(sh>=4){
p5++;
}
if(sh>=2){
p3++;
}
}
cout<<p75+p25*(p3-1)+(p5-1)*p15+(p3-2)*p5*(p5-1)/2<<endl;
}
| 0
| 15,128,030
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string s;
cin >> s;
s='>'+s+'<';
long ans=0;
int n=s.size()-1;
vector<int>b(n,-1);
vector<int>c(n,-1);
rep(i,n){
if(s.at(i)=='>'&&s.at(i+1)=='<'){
b.at(i)=0;
c.at(i)=0;
}
}
rep(i,n-1){
if(b.at(i)>-1&&s.at(i+1)=='<'){
b.at(i+1)=b.at(i)+1;
}
}
for(int i=n-1;i>0;i--){
if(c.at(i)>-1&&s.at(i)=='>'){
c.at(i-1)=max(c.at(i)+1,c.at(i-1));
}
}
rep(i,n){
ans+=max(b.at(i),c.at(i));
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, i, j;
string S;
bool finished = false;
cin >> H >> W;
for (i = 1; i <= H; i++) {
for (j = 1; j <= W; j++) {
cin >> S;
if (S == "snuke") {
cout << (char)(64 + j) << i << endl;
finished = true;
break;
}
}
if (finished) break;
}
}
| 0
| 4,656,125
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair
#define GCD(x,y) __gcd(x,y)
#define lb lower_bound
#define bs binary_search
#define all(x) x.begin(),x.end()
#define LCM(x,y) ((x*y)/__gcd(x,y))
#define btpc __builtin_popcountll
#define spc(x) cout<<fixed<<setprecision(x)
const long long inf = 1e18;
const long long cs = 200005;
const long long mod = 1000000007;
const double PI = 2 * acos(0.0);
void solve()
{
long long t,n,m,a,b,i,j,k,x,y,cnt=1;
bool flag = false;
cin>>n;
lve v(n);
for(auto &ss:v) cin>>ss;
sort(all(v));
double ans = v[0];
for (i = 1; i < n; i++){
ans = (ans + v[i]) / 2.0;
}
cout << ans << endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int h,w,d; cin>>h>>w>>d;
vector<P> p(h*w);
rep(i,h){
rep(j,w){
int a; cin>>a;
a--;
p[a]={i,j};
}
}
vector<int> cost(h*w,0);
rep(i,d){
for(int j=i; j<h*w-d; j+=d){
cost[j+d]=cost[j]+abs(p[j+d].first-p[j].first)+abs(p[j+d].second-p[j].second);
}
}
int qqq; cin>>qqq;
rep(qqqq,qqq){
int r,l; cin>>l>>r;
l--; r--;
ll ans=0;
ans=cost[r]-cost[l];
cout<<ans<<endl;
}
return 0;
}
| 0
| 67,797,001
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end();
int main() {
string a;
int flag = 0,co=-1;
cin >> a;
if(a.at(0)!='A') flag = 1;
for(int i = 1;i<a.size();i++){
if(a.at(i)=='C') {
if(co!=-1)flag = 1;
if(i<2||i==a.size()-1)flag=1;
co = i;
}
else if(a.at(i)<'a') flag = 1;
}
if(co==-1)flag = 1;
if(flag) cout << "WA";
else cout << "AC";
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ll h, w; cin >> h >> w;
ll ans1 = 10e11, ans2 = 10e11;
for(int i = 1; i < h; i++){
ll halfh = (h-i) / 2, halfw = w / 2, h2 = h - i;
ll s1 = i * w;
ll s2 = halfh * w;
ll s3 = (h2 - halfh) * w;
ll s4 = halfw * h2;
ll s5 = (w - halfw) * h2;
ll maxs1 = max(max(s1, s2), s3), mins1 = min(min(s1, s2), s3);
ll maxs2 = max(max(s1, s4), s5), mins2 = min(min(s1, s4), s5);
ans1 = min(min(abs(maxs1 - mins1), abs(maxs2 - mins2)), ans1);
}
for(int i = 1; i < w; i++){
ll halfh = h / 2, halfw = (w-i) / 2, w2 = w - i;
ll s1 = i * h;
ll s2 = halfh * w2;
ll s3 = (h - halfh) * w2;
ll s4 = halfw * h;
ll s5 = (w2 - halfw) * h;
ll maxs1 = max(max(s1, s2), s3), mins1 = min(min(s1, s2), s3);
ll maxs2 = max(max(s1, s4), s5), mins2 = min(min(s1, s4), s5);
ans2 = min(min(abs(maxs1 - mins1), abs(maxs2 - mins2)), ans2);
}
cout << min(ans1, ans2) << endl;
}
| 0
| 71,228,600
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string str;
int cou = 0;
for(int i = 0; i < A * B; i++) {
cin >> str;
cou++;
if(str == "snuke") {
break;
}
}
int X = cou % B;
int Y = (cou - X) / B + 1;
if(X == 0) {
X = B;
Y--;
}
string alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char W = alp.at(X - 1);
cout << W << Y << endl;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>;
const ll INF = 1001001001001001001;
const double pi = acos(-1);
int main()
{
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
ll ans = 0;
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n; j++)
{
if (i + j > k || i + j > n)
{
break;
}
ll tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int l = 0; l < i; l++)
{
tmp += v[l];
que.push(v[l]);
}
for (int l = 0; l < j; l++)
{
tmp += v[n - 1 - l];
que.push(v[n - 1 - l]);
}
for (int l = 0; l < k - i - j; l++)
{
if (que.empty())
{
break;
}
int x = que.top();
if (x >= 0)
{
break;
}
que.pop();
tmp -= x;
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| 0
| 25,669,652
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int table[1001][1001] = {};
int main()
{
string a, b;
cin >> a >> b;
for (int i = 0; i < a.size() + 1; i++)
{
table[i][0] = i;
}
for (int j = 0; j < b.size() + 1; j++)
{
table[0][j] = j;
}
for (int i = 1; i < a.size() + 1; i++)
{
for (int j = 1; j < b.size() + 1; j++)
{
if (a[i - 1] == b[j - 1])
table[i][j] = min({ table[i - 1][j - 1], table[i - 1][j] + 1, table[i][j - 1] + 1 });
else
table[i][j] = min({ table[i - 1][j - 1] + 1, table[i - 1][j] + 1, table[i][j - 1] + 1 });
}
}
cout << table[a.size()][b.size()] << endl;
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using pos = pair<pair<int, int>, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
int H, W; cin >> H >> W;
vector<vector<char>> grid(H+2, vector<char>(W+2, '#'));
int cnt = 0; queue<pos> que;
for(int i=1; i<=H; i++){
string s; cin >> s;
for(int j=1; j<=W; j++){
grid[i][j] = s[j-1];
if(grid[i][j] == '#'){
pos p{{i, j}, 0};
que.push(p);
cnt++;
}
}
}
int res = 0;
while(cnt < H*W){
pos p = que.front(); que.pop();
int y = p.first.first, x = p.first.second, cost = p.second;
rep(i, 4){
int ny = y + dy[i], nx = x + dx[i];
if(grid[ny][nx] == '#')continue;
pos np = {{ny, nx}, cost+1};
que.push(np);
grid[ny][nx] = '#';
res = cost + 1;
cnt++;
}
}
cout << res << ln;
}
| 0
| 14,877,587
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll x,ll y){
if(x<y) swap(x,y);
ll r;
while(y>0){
r=x%y;
x=y;
y=r;
}
return x;
}
int main() {
int A[1010101];
int num[1010101] = {};
int N,i,j,x;
cin >> N;
int g=0;
rep(i, N) {
cin >> A[i];
g = gcd(g, A[i]);
num[A[i]]++;
}
for(i=2;i<=1000000;i++) {
x=0;
for(j=i;j<=1000000;j+=i) x+=num[j];
if(x>=2) break;
}
if(i==1000001) {
cout<<"pairwise coprime"<<endl;
return 0;
}
if(g==1) {
cout<<"setwise coprime"<<endl;
}
else {
cout<<"not coprime"<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define x first
#define y second
#define ll long long
#define lll __int128
#define ull unsigned long long
#define ulll unsigned __int128
#define pb push_back
#define eb emplace_back
#define gu getchar_unlocked()
#define pu putchar_unlocked()
#define all(x) x.begin(),x.end()
#define endl '\n'
ll Pow(ll a,ll b){
ll res=1;
while(b){
if(b&1)res=(res*a);
a=(a*a);
b>>=1;
}
return res;
}
struct pii
{
ll val;
ll cnt;
ll vv;
pii(ll _a,ll _b){
val=_a;
cnt=_b;
vv=0;
if(cnt<=30){
vv=val/(1LL<<cnt);
}
}
bool operator<(const pii &a)const{
ll p=vv-pii(val,cnt+1).vv;
ll q=a.vv-pii(a.val,a.cnt+1).vv;
if(p==q)return val<a.val;
return p<q;
}
};
int main()
{
priority_queue<pii> q;
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
ll a;
cin>>a;
q.push(pii(a,0LL));
}
while(m--){
pii x=q.top();
q.pop();
q.push(pii(x.val,x.cnt+1));
}
ll an=0;
while(!q.empty()){
pii x=q.top();
q.pop();
an+=x.vv;
}
cout<<an<<endl;
return 0;
}
| 0
| 68,162,222
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
const int MOD = 1000000007;
int m_add(int a, int b)
{
return (a + b) % MOD;
}
int m_sub(int a, int b)
{
return (a + MOD - b) % MOD;
}
int m_mul(int a, int b)
{
return (a * b) % MOD;
}
int m_pow(int x, int n)
{
if (n == 0) return 1;
ll res = m_pow((x * x) % MOD, n / 2);
if (n & 1) res = (res * x) % MOD;
return res;
}
int m_divide(int a, int b)
{
return m_mul(a, m_pow(b, MOD - 2));
}
int m_comb(int n, int r)
{
int i;
int p = 1;
for (i = 1; i <= r; i++)
{
p = m_mul(p, (n - i + 1));
p = m_divide(p, i);
}
return p;
}
int m_comb_with_rep(int n, int r)
{
return m_comb(n + r - 1, r);
}
int N;
int A[300010];
signed main()
{
cin >> N;
REP(i, N) cin >> A[i];
int ans = 0;
for (int i = 0; i < 60; i++)
{
int n0 = 0;
int n1 = 0;
for (int j = 0; j < N; j++)
{
if ((A[j] & (1LL << i)) == 0)
n0++;
else
n1++;
}
int s = m_mul(n0, n1);
int b = (1LL << i) % MOD;
int a = m_mul(b, s);
ans = m_add(ans, a);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<ll> p(A), q(B), r(C);
for (int i = 0; i < A; i++) {
cin >> p[i];
}
for (int i = 0; i < B; i++) {
cin >> q[i];
}
for (int i = 0; i < C; i++) {
cin >> r[i];
}
sort(p.begin(), p.end(), greater<int>());
sort(q.begin(), q.end(), greater<int>());
sort(r.begin(), r.end(), greater<int>());
ll P[A + 1]{}, Q[B + 1]{}, R[C + 1]{};
for (int i = 0; i < A; i++) {
P[i + 1] = P[i] + p[i];
}
for (int i = 0; i < B; i++) {
Q[i + 1] = Q[i] + q[i];
}
for (int i = 0; i < C; i++) {
R[i + 1] = R[i] + r[i];
}
ll ans = P[X] + Q[Y];
int id_p = X;
int id_q = Y;
for (int i = 1; i <= min(C, X + Y); i++) {
if (id_p == 0 && id_q == 0) {
ans = max(ans, R[min(X + Y, C)]);
break;
}
if (id_p == 0) {
id_q--;
} else if (id_q == 0) {
id_p--;
} else if (P[id_p - 1] + Q[id_q] < P[id_p] + Q[id_q - 1]) {
id_q--;
} else {
id_p--;
}
ans = max(ans, R[i] + P[id_p] + Q[id_q]);
}
cout << ans << "\n";
return 0;
}
| 0
| 40,335,848
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string str1, str2;
cin >> n;
for(int cnt = 0; cnt < n; ++cnt) {
cin >> str1 >> str2;
int dp[str1.size() + 1][str2.size() + 1];
for(int i = 0; i <= str1.size(); ++i) {
dp[i][0] = 0;
}
for(int i = 0; i <= str2.size(); ++i) {
dp[0][i] = 0;
}
for(int i = 1; i <= str1.size(); ++i) {
for(int j = 1; j <= str2.size(); ++j) {
if(str1[i - 1] == str2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
cout << dp[str1.size()][str2.size()] << endl;
}
}
|
#include<iostream>
int main()
{
int X,Y;
std::cin >> X >> Y;
if((X*Y % 2) == 0)
{
std::cout << "Even" << std::endl;
}else{
std::cout << "Odd" << std::endl;
}
}
| 0
| 56,983,618
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long d[N], c[N];
pair<int,int> co[10];
void Push(stack<int>&st, int now) {
st.push(now % 10);
if(now >= 10) st.push(now / 10);
}
pair<int,int> calculate(int num) {
int ops = 0, used = 0;
ops++;
used++;
stack<int> st;
Push(st, num + num);
while(!(st.size() == 1 && st.top() == num)) {
ops++;
if(st.size() == 2) {
int take1 = st.top();
st.pop();
int take2 = st.top();
st.pop();
Push(st, take1 + take2);
}
else {
used++;
int now = st.top();
st.pop();
Push(st, now + num);
}
}
return make_pair(ops, used);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i=0;i<10;i++) co[i]=calculate(i);
long long answer = 0;
for(int i=0;i<n;i++) {
cin >> d[i] >> c[i];
if(c[i] >= 20){
long long step = co[d[i]].second;
long long ret = co[d[i]].first;
answer += ((c[i]-20)/step)*ret;
c[i] -= ((c[i]-20)/step)*step;
}
}
vector<int> v;
for(int i=0;i<n;i++) {
for(int j=0;j<c[i];j++)v.push_back(d[i]);
}
int ind = 1;
stack<int> st;
Push(st, v[0]);
while(st.size()>=2 || ind < v.size()) {
if(st.size() >= 2) {
answer++;
int take1 = st.top();
st.pop();
int take2 = st.top();
st.pop();
Push(st, take1 + take2);
}
else if(st.size() == 1) {
answer++;
int take1 = st.top();
st.pop();
Push(st, take1 + v[ind++]);
}
}
cout << answer;
return 0;
}
|
#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;
}
| 0
| 38,193,735
|
#include<bits/stdc++.h>
using namespace std;
const long long mod=1000000000+7;
const long long INF=9e18;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<long long, long long>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define rep(i,n) for(long long i = 0; i < n; i++)
#define rep2(i,k,n) for(long long i = k; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define mkp make_pair
#define vin(v,N) for(long long i=0;i<N;i++) cin>>v.at(i)
#define lin(n) long long n;cin>>n
#define chin(x) char x;cin>>x;
#define sin(s) string s;cin>>s;
#define vlin(v,N) vector<long long>v(N);for(long long i=0;i<N;i++)cin>>v.at(i)
#define max(a,b) max((ll)a,(ll)b)
#define min(a,b) min((ll)a,(ll)b)
long long gcd(long long m, long long n){
long long a=max(m,n);
long long b=min(m,n);
long long r=a%b;
while(r!=0){
a=b; b=r; r=a%b;
}
return b;
}
long long lcd(long long m, long long n){
return m*n/gcd(m,n);
}
long long power(long long x, long long N){
long long ret=1;
for(long long i=0;i<N;i++)
ret*=x;
return ret;
}
long long repeat_squaring(long long x, long long n){
if(n==0) return 1;
else if(n%2==0){
long long t=repeat_squaring(x,n/2);
return t*t%mod;
}
else
return x*repeat_squaring(x,n-1)%mod;
}
map<long long,long long> factor(long long p){
ll p1=p;
map<long long,long long>ret;
for(long long i=2;i*i<=p1;i++){
while(p%i==0){
ret[i]++;
p/=i;
}
}
if(p!=1)
ret[p]++;
return ret;
}
bool is_prime(long long N){
for(long long i=2;i*i<=N;i++){
if(N%i==0)
return false;
}
return true;
}
void chmax(long long &a,long long b){
a=max(a,b);
}
void chmin(long long &a,long long b){
a=min(a,b);
}
struct UnionFind{
vector<long long>par;
vector<long long>s;
UnionFind(long long N):par(N),s(N){
for(long long i=0;i<N;i++){
par[i]=i;
s[i]=1;
}
}
long long root(long long i){
if(par[i]==i) return i;
par[i]=root(par[i]);
return root(par[i]);
}
long long size(long long i){
return s[root(i)];
}
bool same(long long x, long long y){
return root(x)==root(y);
}
void unite(long long x, long long y){
if(!same(x,y)){
long long rx=root(x);
long long ry=root(y);
par[rx]=par[ry];
s[ry]=s[rx]+s[ry];
}
}
};
int main(){
lin(N);lin(Q);
UnionFind T(N);
rep(i, Q){
lin(t);lin(u);lin(v);
if(t == 0) T.unite(u, v);
else{
if(T.same(u, v)) cout << 1 << endl;
else cout << 0 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll (i)=0;(i)<(ll) (n);(i)++)
int main(void){
ll n,i=0,j,p,h[1000010],k;
double c=1,kaku=0;
cin >> n >> k;
for(i=1;i<=n;i++)
{
j=i;
while(j<k)
{
c=c/2;
j=j*2;
}
kaku+=c/n;
c=1;
}
cout << fixed << setprecision(12);
cout << kaku << endl;
return 0;
}
| 0
| 57,571,430
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define ldou long double
#define fi first
#define se second
#define setpre(x) std::cout << fixed << setprecision(x)
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x)?("Yes"):("No")) << endl
#define YN(x) cout << ((x)?("YES"):("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger(){ std::cout << " [LOGGER] " << endl; }
template<typename A, typename... B>
void logger(const A& a, const B&... b){
cout << a << " , "; logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 100005;
int main(){
lint n; cin >> n;
lint V = 0, E = 0;
repn(i, n){
V += i * (n-i+1);
}
rep(i, n-1){
lint u,v; cin>>u>>v;
if(u>v) swap(u,v);
E += u * (n-v+1);
}
out(V-E);
}
|
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
#define vi vector<int>
#define sz(a) int((a).size())
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,n) for(int i=(1);i<=(n);i++)
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
const int maxn = 200005;
const int mod = 1000000007;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 2000000000000000000ll;
const ld pi = acos(-1);
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
int qpow(int b,int e){
if( !e ) return 1;
if( e & 1 ) return qpow(b,e-1) * b % mod;
int pwur = qpow(b,e>>1);
return (pwur * pwur) % mod;
}
int modinv(int x){
return qpow(x,mod-2);
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cout.setf(ios::fixed); cout.precision(0);
srand(time(NULL));
int A[4];
for (int i=0;i<4;++i){
char x; cin >> x;
A[i] = x-'0';
}
int tmp;
string ans;
for (int bit=0; bit<(1<<3); ++bit){
tmp = A[0];
ans = A[0]+'0';
for (int i=0;i<3;++i){
if (bit&(1<<i)) {
tmp += A[i+1];
ans += '+';
}else {
tmp -= A[i+1];
ans += '-';
}
ans += ('0'+A[i+1]);
}
if (tmp==7) {
cout << ans << "=7" << endl;
break;
}
}
return 0;
}
| 0
| 82,355,279
|
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define MOD 1000000007
lli a[200010];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0;lli t=0ll,sum=0ll;
cin>>n>>t;
for(int i=0;i<n;++i)
cin>>a[i];
for(int i=1;i<n;++i)
{
sum+=min(t,a[i]-a[i-1]);
}
cout<<(sum+t)<<endl;
}
|
#pragma GCC optimize ("-O2")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define all(a) (a).begin(),(a).end()
#define clz(a) __builtin_clz(a)
#define ctz(a) __builtin_ctz(a)
#define popc(a) __builtin_popcount(a)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rfor(i,a,b) for(int i=a; i>=b; i--)
#define debug(x) cerr << #x << " = " << x << endl;
#define F first
#define S second
#define endl '\n'
#define SIZE 1000005
#define deci(n) cout<<fixed<<setprecision(n)
#define ordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_order_statistics_node_update>
const ld PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll lul2 = 998244353;
const ll lul = 1000000007;
void mod(ll &x)
{
if(x>=lul) x-=lul;
if(x<0) x+=lul;
}
ll _gcd(ll a, ll b)
{
if(b == 0) return a;
return _gcd(b,a%b);
}
ll expo(ll n, ll p)
{
if(p == 0) return 1;
ll x = expo((n*n)%lul, p/2)%lul;
if(p&1) return (x*n)%lul;
return x;
}
void solve()
{
int n,l; cin>>n>>l;
int a[n];
rep(i,0,n) cin>>a[i];
int ans = -1;
rep(i,0,n-1)
{
if(a[i]+a[i+1]>=l) ans = i+1;
}
if(ans == -1) {cout<<"Impossible"; return;}
vector<int> order;
rep(i,1,n)
{
if(i == ans) break;
order.pb(i);
}
rfor(i,n-1,1)
{
if(i == ans) break;
order.pb(i);
}
order.pb(ans);
cout<<"Possible"<<endl;
for(int i:order) cout<<i<<endl;
}
int main()
{
FAST;
int t; t=1;
rep(i,1,t+1){
solve();
}
return 0;
}
| 0
| 47,534,178
|
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
void solve(){
string str; getline(cin, str);
int a = 0, b = 0, i = 0;
while(str[i] != ' ') a = a*10 + (str[i] - '0'), i++;
bool oper = (str[i+1] == '+') ? true : false;
i += 3;
while(i<str.size()) b = b*10 + (str[i] - '0'), i++;
cout<<((oper) ? a + b : a - b)<<endl;
}
int main()
{
solve();
Bye;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
int a,b;cin >> a >> b;
vector<vector<char>> grid(100,vector<char>(100));
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(j<50) grid[i][j]='.';
else grid[i][j]='#';
}
}
int needa=a-1;
int needb=b-1;
for(int i=0;i<100;i++){
if(i%2==0) continue;
for(int j=0;j<100;j++){
if(j<49){
if(needb>0&&j%2==1){
grid[i][j]='#';
needb--;
}
}
else if(j>=51&&j<=98){
if(needa>0&&j%2==1){
grid[i][j]='.';
needa--;
}
}
}
}
cout << 100 << " " << 100 << endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
cout << grid[i][j];
}
cout << endl;
}
return 0;
}
| 0
| 52,666,850
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;cin>>n>>k;
ll a = n/k;
ll ans = a*a*a;
if(k%2==0){
a = (n+k/2)/k;
ans += a*a*a;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) {os << "(" << p.first << ", " << p.second << ")"; return os;}
int main() {
int K;
cin >> K;
deque<pii> D;
D.push_front({1, 1});
int now = 1;
const int INF = 1 << 29;
vector<int> ans(K, INF);
while(!D.empty()) {
pii p = D.back(); D.pop_back();
if (ans[p.second] == INF) ans[p.second] = p.first; else continue;
now = p.first;
D.push_back({now, p.second * 10 % K});
D.push_front({now + 1, (p.second + 1) % K});
}
cout << ans[0] << endl;
return 0;
}
| 0
| 21,565,129
|
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int count_two_factor(int num) {
int count = 0;
while(num % 2 == 0) {
count++;
num /= 2;
}
return count;
}
int main() {
int n;
cin >> n;
int max_count = 0;
int max_num = 1;
repf(i, 1, n + 1) {
int current_count = count_two_factor(i);
if(current_count > max_count) {
max_count = current_count;
max_num = i;
}
}
cout << max_num << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll) (x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
#define int ll
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll MAX = 1100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[8] ={1,0,-1,0,1,-1,1,-1};
ll dy[8] ={0,1,0,-1,1,-1,-1,1};
template<class T>
inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>
inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
struct Timer{
chrono::system_clock::time_point start, end;
Timer(){ start = chrono::system_clock::now(); }
~Timer(){
end = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(end - start).count();
cerr<<"time : "<<msec<<" ms"<<endl;
}
};
void solve(){
ll h,w,n;
cin>>w>>h>>n;
ll x0=0,x1=w,y0=0,y1=h;
rep(i,n){
ll x,y,a;
cin>>x>>y>>a;
if(a==1) chmax(x0,x);
else if(a==2) chmin(x1,x);
else if(a==3) chmax(y0,y);
else chmin(y1,y);
}
cout<<max(0ll,(x1-x0))*max(0ll,(y1-y0))<<endl;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 0
| 37,713,287
|
#include <iostream>
using namespace std;
int main()
{
double d, t, s, x;
cin >> d >> t >> s;
x = d / s;
if (x > t)
{
cout << "No\n";
}
else
{
cout << "Yes\n";
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
ll N;
int f (ll A) {
ll B = N / A;
int ans = 1;
while(B > 9) {
B /= 10;
ans++;
}
return ans;
}
int main() {
cin >> N;
int ans = -1;
for (ll i = floor(sqrt(N)); i > 0; i--) {
if (N % i == 0) {
ans = f(i);
break;
}
}
cout << ans << endl;
}
| 0
| 58,722,320
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = a[0] / 2;
a[0] -= a[0] / 2 * 2;
for (int i = 1; i < n; ++i) {
if (a[i-1] == 1 && a[i] > 0) {
a[i-1]--;
a[i]--;
ans++;
}
ans += a[i] / 2;
a[i] -= a[i] / 2 * 2;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
struct io { io() { ios::sync_with_stdio(false); cin.tie(0); } };
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void)
{
ll n, m, k;
cin >> n >> m >> k;
bool r = false;
rep(i, n+1) {
rep(j, m+1) {
if(i*(m-j) + j*(n-i) == k) r = true;
}
}
r ? mes("Yes") : mes("No");
}
| 0
| 616,334
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[10][10][11]={0};
for(int i=0;i<n;i++){
int b,f,r,v;
cin>>b>>f>>r>>v;
a[b][f][r]+=v;
if(a[b][f][r]<0) a[b][f][r]=0;
}
for(int i=1;i<=4;i++){
for(int j=1;j<=3;j++){
for(int k=1;k<=10;k++){
cout<<" "<<a[i][j][k];
}
cout<<"\n";
}
if(i!=4){
for(int j=0;j<20;j++) cout<<"#";
cout<<"\n";
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
queue<long long> q;
long long k;
cin>>k;
for(int i=1;i<=9;i++) {
q.push(i);
}
long long x;
long long a;
while(!q.empty()) {
x=q.front();
q.pop();
k--;
if(k==0) {
break;
}
a=x%10;
for(int i=-1;i<2;i++) {
if(a+i>=0&&a+i<10) {
q.push((x*10)+a+i);
}
}
}
cout<<x<<endl;
}
| 0
| 17,172,454
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int R, G, B, N;
ll ans = 0;
cin >> R >> G >> B >> N;
for (int r = 0; r * R <= N; r++){
for (int g = 0; r * R + g * G <= N; g++){
if((N - (r * R + g * G)) % B == 0)ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
typedef vector<vector<int>> Graph;
int main(){
int H,W;
cin >> H >> W;
vector<string> S(H);
rep(i,H) cin >> S[i];
Graph L(H,vector<int>(W)),R(H,vector<int>(W)),U(H,vector<int>(W)),D(H,vector<int>(W));
rep(i,H){
if(S[i][0]=='.'){
L[i][0]=1;
}
for(int j=1;j<W;j++){
if(S[i][j]=='.'){
L[i][j] = L[i][j-1] + 1;
}else{
L[i][j] = 0;
}
}
if(S[i][W-1]=='.'){
R[i][W-1]=1;
}
for(int j=W-2;j>=0;j--){
if(S[i][j]=='.'){
R[i][j] = R[i][j+1] + 1;
}else{
R[i][j] = 0;
}
}
}
rep(i,W){
if(S[0][i]=='.'){
U[0][i]=1;
}
for(int j=1;j<H;j++){
if(S[j][i]=='.'){
U[j][i] = U[j-1][i] + 1;
}else{
U[j][i] = 0;
}
}
if(S[H-1][i]=='.'){
D[H-1][i]=1;
}
for(int j=H-2;j>=0;j--){
if(S[j][i]=='.'){
D[j][i] = D[j+1][i] + 1;
}else{
D[j][i] = 0;
}
}
}
int ans = 0;
rep(i,H)rep(j,W){
int tmp;
tmp = L[i][j]+R[i][j]+U[i][j]+D[i][j]-3;
ans = max(ans,tmp);
}
cout << ans << endl;
return 0;
}
| 0
| 98,686,289
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
}
else {
int F = S.size();
int D = T.size();
vector<char> ans(F);
for (int j = 0; j < F; j++) {
ans.at(j) = 'z';
}
bool ok = false;
int K = (S.size() - T.size());
for (int i = 0; i <= K; i++) {
vector<char> B(F);
for (int j = 0; j < F; j++) {
if (S.at(j) == '?') {
B.at(j) = 'a';
}
else {
B.at(j) = S.at(j);
}
}
int k = 0;
bool good = true;
for (int j = i; j < i + D; j++) {
if (S.at(j) == '?') {
B.at(j) = T.at(k);
}
else if (S.at(j) != T.at(k)) {
good = false;
break;
}
else {
B.at(j) = S.at(j);
}
k++;
}
if (good) {
ok = true;
if (ans > B) {
for (int j = 0; j < F; j++) {
ans.at(j) = B.at(j);
}
}
}
}
if (ok) {
for (int j = 0; j < F; j++) {
cout << ans.at(j);
}
cout << endl;
}
else {
cout << "UNRESTORABLE" << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define rep0(i,n) for(ll i=0;i<n;i++)
#define rrep0(i, n) for(ll i=(ll)(n);i>0;--i)
#define rrep(i, a, b) for(ll i=(ll)(a);i>=(ll)(b);--i)
#define pb(z) push_back(z)
#define ff first
#define ss second
#define caset int t;cin>>t;for(int tt=1;tt<=t;tt++)
#define sz(X) ((ll)(X).size())
#define scan(X) scanf("%s", (X))
#define ms(v,val) memset((v),(val),sizeof((v)))
#define ms0(X) memset((X), 0, sizeof((X)))
#define ms1(X) memset((X), -1, sizeof((X)))
#define m_p(a,b) make_pair(a,b)
#define get_pos(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define lcm(a,b) (a*b)/__gcd(a,b)
#define INF9 1000000010
#define INF18 4000000000000000010
#define bpll(a) __builtin_popcountll(a)
#define sqr(a) ((a)*(a))
#define nl "\n"
#define mod 1e9+7;
#define mx_el(v) *max_element(all(v));
#define mn_el(v) *min_element(all(v));
#define pcase(z,x) cout<<"Case "<<z<<": "<<x<<"\n"
const double pi = 2*acos(0) ;
#define display(v) vi :: iterator it;for(it=(v).begin();it!=(v).end();it++){cout << *it << " " ;}cout << endl;
#define taking(n,v) for(ll i=0;i<(n);i++){ll inp;cin>>inp;(v).push_back(inp);}
void start(){
#ifndef ONLINE_JUDGE
freopen("input.txt" , "r" , stdin) ;
freopen("output.txt" , "w" , stdout) ;
#endif
}
ll dp[1000005];
void solve()
{
ll n;cin>>n;
vll v;
taking(n,v);
sort(all(v));
ll ans=0;
rep0(i,n){
dp[v[i]]++;
}
for(int i=0;i<100003;i++){
ll cnt=dp[i]+dp[i+1]+dp[i+2];
ans=max(ans,cnt);
}
cout << ans << nl;
}
int main() {
solve();
return 0;
}
| 0
| 16,847,552
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
string S;
cin >> N >> S;
map<char, long long> c;
c['R'] = 0;
c['G'] = 0;
c['B'] = 0;
for (auto ch : S) {
c[ch] += 1;
}
long long remove = 0;
for (long long d = 1; d <= (N - 1) / 2; d++) {
for (long long i = 0; i < S.length() - 2 * d; i++) {
long long j, k;
j = i + d;
k = j + d;
if (S[i] != S[j] && S[j] != S[k] && S[k] != S[i]) {
remove++;
}
}
}
long long ans = c['R'] * c['G'] * c['B'] - remove;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N;
cin >> N;
vec S(N);
ll sum = 0;
REP(i,0,N) {
ll a, b;
cin >> a >> b;
S[i] = a + b;
sum -= b;
}
DESC(S);
REP(i,0,(N+1)/2) sum += S[i*2];
PR(sum);
return 0;
}
| 0
| 60,501,871
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int lose = 0;
for(int i=0; i<s.length(); i++){
if(s[i] == 'x') lose += 1;
}
if(lose < 8) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
if(Bufferhead==Buffertail){
int l=fread(buffer,1,BufferSize,stdin);
if(!l){Terminal=1;return 0;}
Buffertail=(Bufferhead=buffer)+l;
}
return *Bufferhead++;
}
template<class T>inline bool read(T &x){
x=0;char c=Getchar(),rev=0;
while(c<'0'||c>'9'){c=Getchar();rev|=c=='-';if(Terminal)return 0;}
while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
if(c=='.'){
c=Getchar();double t=0.1;
while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
}
x=rev?-x:x;
return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
char c=Getchar();
while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
while(c>=33&&c<=126) (*x++)=c,c=Getchar();
*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
if(!x){putchar('0');putchar(c);return;}
if(x<0) putchar('-'),x=-x;
int m=0,a[20];
while(x) a[m++]=x%10,x/=10;
while(m--) putchar(a[m]+'0');
putchar(c);
}
const int inf=0x3f3f3f3f;
const int N=100005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
int ans=1;
while(y){
if(y&1) ans=(ll)ans*x%mod;
x=(ll)x*x%mod;y>>=1;
}return ans;
}
int n,a[N];
bool vis[N];
vi g[N];
inline int dfs(int x){
vis[x]=1;
ll sum=0;
int mx=0,isok=1;
for(int y:g[x])
if(!vis[y]){
int t=dfs(y);
isok=0;sum+=t;gmax(mx,t);
}
if(isok) return a[x];
if(sum<a[x]||sum>a[x]*2){puts("NO");exit(0);}
if(sum-mx<sum-a[x]){puts("NO");exit(0);}
return a[x]*2-sum;
}
int main(){
#ifdef rqgao2014
freopen("input.txt","r",stdin);
#endif
read(n);
for(int i=1;i<=n;i++)
read(a[i]);
if(n==2){
puts(a[1]==a[2]?"YES":"NO");
return 0;
}
for(int i=1;i<n;i++){
int x,y;read(x,y);
g[x].pb(y);g[y].pb(x);
}
int u=0;
for(int i=1;i<=n;i++)
if(SZ(g[i])>1) u=i;
if(!dfs(u)) puts("YES"); else puts("NO");
return 0;
}
| 0
| 39,915,745
|
#include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
int length = A + B + 1, cnt = 0;
char S[50];
scanf("%s", S);
if (S[A] == '-') {
for(int i = 0; i < length; i++) {
if (S[i] >= '0' && S[i] <= '9') {
cnt++;
}
}
if (cnt == length -1) {
printf("Yes\n");
} else {
printf("No\n");
}
} else {
printf("No\n");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
ll S; cin >> S;
ll x1,x2,x3,y1,y2,y3;
if(S==1000000000000000000){
x1 = 0;
x2 = 1000000000;
x3 = 0;
y1 = 0;
y2 = 0;
y3 = 1000000000;
} else {
x1 = 0;
y1 = 0;
x2 = 1;
y2 = 1000000000;
y3 = y2 - S % y2;
x3 = (S - S % y2) / (y2) + 1;
}
cout << x1 << " " << y1 << " ";
cout << x2 << " " << y2 << " ";
cout << x3 << " " << y3 << endl;
cerr << abs(x3 * y2 - x2 * y3) << endl;
}
| 0
| 69,303,387
|
#include<bits/stdc++.h>
#define ll long long
#define ljc 998244353
using namespace std;
#define gc getchar
inline ll read(){
register ll x=0,f=1;char ch=gc();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=gc();}
while (isdigit(ch)){x=(x<<3)+(x<<1)+ch-'0';ch=gc();}
return (f==1)?x:-x;
}
vector<int> e[1010101];
int n,sg[1010101],u,v;
void dfs(int u,int faa){
sg[u]=0;
for (auto v:e[u]){
if (v==faa) continue;
dfs(v,u);
sg[u]^=sg[v]+1;
}
}
int main(){
n=read();
for (int i=1;i<n;++i){
int u=read(),v=read();
e[u].push_back(v);
e[v].push_back(u);
}
dfs(1,0);
puts(sg[1]?"Alice":"Bob");
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));
rep(i, H) {
rep(j, W) {
cin >> s[i][j];
}
}
vector<int> dy = {-1, 1, 0, 0};
vector<int> dx = {0, 0, -1, 1};
rep(i, H) {
rep(j, W) {
bool check = false;
if (s[i][j] == '.') continue;
rep(k, 4) {
if (i+dy[k] < 0 || i+dy[k] >= H || j+dx[k] < 0 || j + dx[k] >= W) continue;
if (s[i+dy[k]][j+dx[k]] == '#') {
check = true;
break;
}
}
if (!check) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
| 0
| 14,151,345
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N; cin>>N;
vector<ll> B(N);
for(int i=0; i<N; ++i){ cin>>B[i]; B[i] -= i+1; }
sort(B.begin(), B.end());
ll l = accumulate(B.begin()+N/2+(N%2), B.end(), 0LL);
ll r = accumulate(B.begin(), B.begin()+N/2, 0LL);
cout<< l-r <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m,k;
cin >> n >> m >> k;
vector<bool> a((n+1)*(m+1));
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= m; j++) {
int tmp=i*(m-j)+(n-i)*j;
a[tmp]=true;
}
}
if(a[k]) cout << "Yes" << "\n";
else cout << "No" << "\n";
return 0;
}
| 0
| 7,937,398
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int k, n;
cin >> k >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
int diff = a[0] + (k - a[n-1]);
for(int i = 1; i < n; i++) {
diff = max((a[i] - a[i-1]), diff);
}
cout << k - diff << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "Yes" : "No")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 2e5 + 10;
const int SIZ = 1e6 + 10;
const int mod = 1e9 + 7;
const int maxx = 2e9;
const int MAXX = 1e18;
const string file = "3";
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s, t;
cin >> s >> t;
int n = sz(s); s = ' ' + s;
int m = sz(t); t = ' ' + t;
int ans = maxx;
for (int i = 1; i <= n - m + 1; i++) {
int cnt = 0;
for (int j = 1; j <= m; j++) {
if (s[i + j - 1] != t[j]) {
cnt++;
}
}
ans = min(ans, cnt);
}
cout << ans << "\n";
return 0;
}
| 0
| 468,484
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.