code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LL i = 0; i < (n); i++)
#define FOR(in) for(LL i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define uniq(v) v.erase(unique(v.begin(), v.end()), v.end());
#define exit(); return 0;
#define no "NO"
#define yes "YES"
#define con continue;
LL concate(LL a, LL b)
{
ostringstream os;
os <<a <<b;
istringstream is(os.str());
LL c;
is>> c;
return c;
}
LL check(char c)
{
return c=='a' || c=='e' || c=='i' || c=='o' || c=='u';
}
LL mod = 1e9+7;
int main()
{
LL q,t;
LL a=0,b=0,c=0,d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,r=0,u=0,w=0,x=0,y=0,z=0;
LL aa[1000];
LL flag=0, flag1=0, co=0, co1=0, co2=0, co3=0, x1=0, x2=0, y1=0, y2=0, z1=0, z2=0;
LL ma=0, mi=100000000;
LL mid=0, temp=0, stop=0, start=0;
double pi= 3.141592653589793;
double d1=0.0, d2, d3, d4;
VLL v,v1,v2,v3,v4,v5,v6,v7,v8,v9,v10;
VS vs, vs1, vs2, vs3, vs4;
VP vp, vp1,vp2;
char ch, ch1, ch2[1001];
string str, str1, str2, str3, str4, str5;
pair<LL, LL> pa;
list<LL> li, li1;
map<LL, LL> mp, mp1;
set<LL> st;
map<LL ,LL> :: iterator imll;
VLL :: iterator ivll;
set<LL> :: iterator isll;
VP :: iterator ivp;
cin>>str>>str1;
a = str.size()+str1.size();
for(i=0; i<a; i++)
{
if(i==0)
{
cout<<str[0];
str.erase(str.begin());
con
}
if(i%2!=0)
{
cout<<str1[0];
str1.erase(str1.begin());
}
else
{
cout<<str[0];
str.erase(str.begin());
}
}
cout<<endl;
exit()
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
#define PL pair<ll,ll>
#define ALL(v) (v).begin(), (v).end()
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main(){
ll N;
cin >> N;
VL a(N);
rep(i, 0, N) cin >> a[i];
ll L = -1, R = 1e18;
while(R - L > 1){
VL tmp(a);
ll M = L + (R - L)/2;
ll c = 0;
auto itr = max_element(ALL(tmp));
while(*itr >= N){
ll d = (ll)(*itr/N);
c += d;
*itr -= d * (N + 1);
rep(t, 0, tmp.size()) tmp[t] += d;
itr = max_element(ALL(tmp));
}
if(c <= M) R = M;
else L = M;
}
cout << R << endl;
return 0;
}
| 0
| 78,262,262
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
#include<memory>
#include<array>
using namespace std;
int main()
{
array<int,5> a;
for ( auto i = 0; i < 5; ++i )
cin >> a[i];
sort( a.begin(), a.end(), []( int x, int y ){ return x > y; } );
for ( auto i = 0; i < 5; ++i )
{
if ( i ) cout << " ";
cout << a[i];
}
cout << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
set<lint> lun;
void lunmake(string x,int depth,int last){
if(depth>0){
for(int i=max(last-1,0);i<=min(last+1,9);i++){
lun.insert(stoll(x+str(i)));
lunmake(x+str(i),depth-1,i);
}
}
}
int main(){
int n;cin>>n;
for(int i=1;i<10;i++){
lun.insert(i);
lunmake(str(i),10,i);
}
for(auto x:lun){
n--;
if(n==0)cout<<x<<endl;
}
}
| 0
| 75,561,036
|
#include <iostream>
#include <map>
using namespace std;
int main(){
int n,m;
string dic[100000];
string words[100000];
map<string, string> mp;
while(true){
cin >> n;
if(n==0){
return 0;
}
string result = "";
for(int i=0;i<n;i++){
cin >> dic[i];
cin >> mp[dic[i]];
}
cin >> m;
for(int k=0;k<m;k++){
cin >> words[k];
for(int j=0;j<n;j++){
if(words[k]==dic[j]){
words[k]=mp[dic[j]];
break;
}
}
result = result + words[k];
}
cout << result << "\n";
}
return 0;
}
|
#include <unordered_set>
#include <cstdio>
#include <string>
int main() {
std::unordered_set< std::string > dict;
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
char cmd[7] = {0};
char word[13] = {0};
scanf("%s %s", cmd, word);
if (cmd[0] == 'i') {
dict.insert(word);
} else {
std::unordered_set < std::string >::const_iterator got = dict.find(word);
if (got == dict.end()) {
printf("no\n");
} else {
printf("yes\n");
}
}
}
}
| 0
| 42,877,859
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
cout << (n < 1200 ? "ABC" : "ARC") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define EPS 1e-9
#define PI acos(-1)
using namespace std;
typedef long long ll;
const int maxn = 1e5+100;
const int mod = 1e9+7;
int a[maxn];
int vis[maxn];
ll f1[maxn],f2[maxn];
ll quick(ll x,ll n)
{
ll ans=1;
while(n)
{
if(n%2==1)
{
ans=(ans*x)%mod;
}
n/=2;
x=x*x%mod;
}
return ans;
}
void init()
{
f1[1] = 1,f2[1] = 1,f1[0] = 1,f2[0] = 1;
for(int i=2; i<=100005; i++)
{
f1[i]=(f1[i-1]*i)%mod;
ll num =quick(i,mod-2);
f2[i]=(f2[i-1]*num)%mod;
}
}
ll C(ll n,ll m)
{
return f1[n]*f2[n-m]%mod*f2[m]%mod;
}
int main()
{
init();
int n;
cin>>n;
int tmp;
for(int i = 1; i <= n+1; i++)
{
cin>>a[i];
if(vis[a[i]])
{
tmp = i-vis[a[i]];
}
else vis[a[i]] = i;
}
cout<<n<<endl;
for(int i = 2; i <= n+1; i++)
{
ll div = 0;
ll ans = C(n+1,i);
if(n-tmp>=i-1)
div = C(n-tmp,i-1);
cout<<(ans-div+mod)%mod<<"\n";
}
}
| 0
| 21,424,378
|
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <unordered_map>
const int MAX_N = 5050;
long long N, K;
long long a[MAX_N];
bool can_make[MAX_N][MAX_N];
bool check(const int id) {
if (K <= a[id]) {
return true;
}
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= K; j++) {
can_make[i][j] = false;
}
}
can_make[0][0] = true;
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= K; j++) {
if (can_make[i-1][j]) {
can_make[i][j] = true;
}
if (i != id && j + a[i] <= K && can_make[i-1][j]) {
can_make[i][j + a[i]] = true;
}
}
}
for (int k = K - a[id]; k < K; k++) {
if (can_make[N][k]) {
return true;
}
}
return false;
}
int main(int argc, char **argv) {
std::cin >> N >> K;
for (int i = 1; i <= N; i++) {
std::cin >> a[i];
}
std::sort(a + 1, a + 1 + N);
if (!check(N)) {
std::cout << N << std::endl;
return 0;
} else if (check(1)) {
std::cout << 0 << std::endl;
return 0;
}
int lb = 1;
int ub = N;
while (lb + 1 < ub) {
int mid = (lb + ub) / 2;
if (check(mid)) {
ub = mid;
} else {
lb = mid;
}
}
std::cout << lb << std::endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORL(i,a,b) for(LL i=(a);i<(b);++i)
#define REPL(i,n) FORL(i,0,n)
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
const double EPS = 1e-10;
const double PI = acos(-1.0);
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k, const Iterator last)
{
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1)
{
if (*--itr1 < *itr2)
{
Iterator j = k;
while (!(*itr1 < *j)) ++j;
iter_swap(itr1,j);
++itr1;
++j;
itr2 = k;
rotate(itr1,j,last);
while (last != j)
{
++j;
++itr2;
}
rotate(k,itr2,last);
return true;
}
}
rotate(first,k,last);
return false;
}
inline double get_time_sec(void){
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count())/1000000000;
}
template<typename T>
T gcd(T a, T b) {
if(a > b) swap(a, b);
if(a == 0) return b;
else return gcd(b%a, a);
}
template<typename T>
map<T, T> prime_list(T n) {
map<T, T> ret;
for(T i = 2; i*i <= n; i++) {
if(n % i == 0) {
ret[i] = 0;
while(n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if(n != 1) ret[n]++;
return ret;
}
#define MOD 1000000007
LL mypow(LL a, LL n) {
if(n == 1) return a % MOD;
if(n % 2 == 1) return (a * mypow(a, n-1)) % MOD;
LL t = mypow(a, n/2);
return (t * t) % MOD;
}
int main(void) {
int n;
cin >> n;
map<int, int> a;
REP(i, n) {
int tmp;
cin >> tmp;
if(a.count(tmp)) a[tmp]++;
else a[tmp] = 1;
}
auto cmp = [](PII x, PII y) {
return x.first < y.first;
};
priority_queue<PII, VPII, decltype(cmp)> pq{cmp};
for(auto x : a) {
pq.push(x);
}
LL l1 = 0, l2 = 0;
while(!pq.empty()) {
PII p = pq.top();
pq.pop();
if(p.second > 1) {
if(l1 == 0) {
l1 = p.first;
if(p.second > 3) {
l2 = p.first;
break;
}
}
else {
l2 = p.first;
break;
}
}
}
cout << l1 * l2 << endl;
}
| 0
| 87,690,446
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
int main() {
int N,H,W;
cin >> N >> H >> W;
int ans = 0;
rep(i,N) {
int a,b;
cin >> a >> b;
if(a >= H && b >= W) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define F(i,n) for(ll i=0;i<n;i++)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repp(i,a,b) for(ll i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define f first
#define s second
#define pll pair<ll,ll>
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define pii 3.14159265358979323
#define mod 1000000007
void solve()
{
ll n,a,b;
cin>>n>>a>>b;
vll p(n);
F(i,n)
{
cin>>p[i];
}
sort(ALL(p));
ll a1=0,a2=0,a3=0;
for(int i=0;i<n;i++)
{
if(p[i]<=a) a1++;
else if(p[i]>a && p[i]<=b) a2++;
else a3++;
}
cout<<min({a1,a2,a3});
}
signed main(){
fast;
ll t=1;
while(t--)
{
solve();
}
return 0;
}
| 0
| 24,168,028
|
#include<iostream>
using namespace std;
int main(){
bool tf=true;
int tedad[3]={1,1,1};
char str[4];
cin>>str;
for(int i=0;i<3;i++){
if(str[i]=='a'){
if(tedad[0]==1){
tedad[0]=0;
}
else{
tf=false;
break;
}
}
if(str[i]=='b'){
if(tedad[1]==1){
tedad[1]=0;
}
else{
tf=false;
break;
}
}
if(str[i]=='c'){
if(tedad[2]==1){
tedad[2]=0;
}
else{
tf=false;
break;
}
}
}
if(tf==false){
cout<<"No";
}
else{
cout<<"Yes";
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N, ans=0; cin>>N;
vector<ll> Z(N,0);
for(int i=0; i<N; i++){
ll A; cin>>A;
Z[i]=A;
}
for(int i=0; i<N-1; i++){
if(Z[i]<=Z[i+1]){
ans+=Z[i];
Z[i+1]-=Z[i];
Z[i]=0;
}
else if(Z[i]>Z[i+1]){
ans+=Z[i]/2;
if(Z[i]%2==1){
Z[i]=1;
if(Z[i+1]>=1){
ans++;
Z[i]=0;
Z[i+1]--;
}
}
else Z[i]=0;
}
}
ans+=Z[N-1]/2;
cout<<ans<<endl;
}
| 0
| 8,757,615
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> A(N);
long long ans = 0;
for(int i=0; i<N; i++) cin>>A[i];
for(int left = 0; left < N; ){
int right = left;
long long sum = 0;
while(A[right] != 0 && right < N){
sum += A[right];
right++;
}
ans += sum /= 2;
left = right+1;
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <limits>
#include <iomanip>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N+1);
for(int i=1;i<=N;i++){
cin >> a[i];
}
bool frg = false;
int num;
int cnt;
for(int i=0;i<=N;i++){
if(i==0){
num=1;
}
else{
num = a[num];
cnt++;
if(num==2){
frg = true;
break;
}
}
}
if(frg){
cout << cnt << endl;
}
else{
cout << -1 << endl;
}
}
| 0
| 9,343,370
|
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
string s;
cin>>s;
rep(i,s.size()){
if((i+1)%2!=0) cout<<s[i];
}
cout<<endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
int main(){
int N;
cin >> N;
vector<string> S(N);
for(int i = 0; i < N; i++) cin >> S[i];
int M;
cin >> M;
vector<string> T(M);
for(int i = 0; i < M; i++) cin >> T[i];
map<string, int> S1;
map<string, int> T1;
for(string s: S) S1[s]++;
for(string t: T) T1[t]++;
int max_n = 0;
for(auto p : S1){
max_n = max(max_n, p.se - T1[p.fi]);
}
cout << max_n << endl;
}
| 0
| 7,565,153
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
for(int i=0;i<n/2;i++) swap(s[i],s[n-i-1]);
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR(i,j,k) for(int i=j;i<=k;i++)
#define read freopen("in.txt", "r", stdin)
#define write freopen("out.txt", "w", stdout)
#define pf printf
#define sf(n) scanf("%d", &n)
#define sff(a,b) scanf("%d %d", &a, &b)
#define PB push_back
#define F first
#define S second
#define MP make_pair
typedef long long ll;
typedef pair<int,int> pii;
const int M = 998244353 ;
const int MAX = (2e5) + 10;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll x;
int n, ara[MAX];
int main() {
ios::sync_with_stdio(false);
cin >> n; n *= 2;
FOR(i,0,n-1) {
cin >> ara[i];
}
sort(ara, ara + n);
for(int i = 0; i < n; i += 2) {
x += ara[i];
}
cout << x << endl;
return 0;
}
| 0
| 36,706,383
|
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Int = long long;
const int MOD = 1000000007;
const ll INF = numeric_limits<ll>::max();
const int inf = 1e8;
typedef pair<int,int> P;
typedef std::priority_queue<int> IntPrioQueue;
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue;
int main(){
cin.tie( 0 ); ios::sync_with_stdio( false );
string s;
cin >> s;
int cnt;
if(s[0]=='R' && s[1]=='R' && s[2]=='R') cnt = 3;
else if((s[0]=='R' && s[1]=='R' ) || (s[1]=='R' && s[2]=='R')) cnt = 2;
else if(s[0]=='R' || s[1]=='R' || s[2]=='R') cnt = 1;
else cnt = 0;
cout << cnt <<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll H,W,D,Q;
cin >> H >> W >> D;
vector<vector<ll>> A(H,vector<ll>(W));
map<ll,Pll> mp;
rep(i,H){
rep(j,W){
cin >> A[i][j];
mp[A[i][j]] = Pll(i,j);
}
}
cin >> Q;
vector<ll> dp(H*W+10);
rep(i,H*W){
if(i<D)continue;
dp[i+1] = dp[i+1-D] + abs(mp[i+1].first - mp[i+1-D].first) + abs(mp[i+1].second - mp[i+1-D].second);
}
ll L,R;
vector<ll> v;
rep(i,Q){
cin >> L >> R;
v.push_back(dp[R]-dp[L]);
}
rep(i,Q){
cout << v[i] << endl;
}
}
| 0
| 70,666,482
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
string s;
cin>>s;
int len=s.size();
int cnt=0;
bool flag=true;;
if(s[0]!='A'){
flag=false;
}
for(int i=1;i<len;i++){
if(isupper(s[i])){
if(i==1||i==len-1||s[i]!='C'){
flag=false;
}
cnt++;
}
}
if(cnt!=1||!flag)cout<<"WA"<<endl;
else cout<<"AC"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
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 vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
struct edge {
ll to, cost;
};
ll oddsolve(ll n) {
return (n + 1) / 2 % 2;
}
ll judge(ll n) {
if(n % 2 == 1) {
return oddsolve(n);
} else {
return oddsolve(n + 1) ^ (n + 1);
}
}
int main() {
ll A, B; cin >> A >> B;
cout << (judge(B) ^ judge(A - 1)) << endl;
}
| 0
| 21,931,046
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<int,int> p;
const int INF = 1e9;
int main() {
int n; cin >> n; cout << n * n << endl;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for(int i=0;i<n;i++)
#define ms(x) memset(x,0,sizeof(x))
#define ms2d(x,m,n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define uniq(vec) vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())))
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pi pair<int,int>
#define tc(t) int t;cin>>t;while(t--)
#define bits(n) __builtin_popcount(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int> >
#define ins insert
#define ALL(v) v.begin(),v.end()
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numeric_limits<x>::min()
#define Inf INFINITY
#define minv(v) *min_element(v.begin(),v.end())
#define maxv(v) *max_element(v.begin(),v.end())
#define fi first
#define se second
#define PI acos(-1)
#define sz(a) (int)a.size();
#define IOS ios::sync_with_stdio(false);
using namespace std;
int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a);}
typedef tree<pair<int, int>,null_type,less<pair<int, int>>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1,-1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const long long MOD = 1000000007;
double sq(double x) {return x*x;}
template<typename T>inline T Bigmod(T base, T power, T MOD){
T ret=1;
while(power)
{
if(power & 1)ret=(ret*base)%MOD;
base=(base*base)%MOD;
power>>=1;
}
return ret;
}
bool sortinrev(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.first > b.first);
}
signed main()
{
IOS
int n,a,b;
while(cin>>n>>a>>b){
int w=a+b;
int ans=(n/w)*a;
ans+= min((n%w),a);
cout << ans << endl;
}
return 0;
}
| 0
| 91,435,367
|
#include<iostream>
#include<algorithm>
#include<set>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define mp make_pair
using namespace std;
typedef pair<int, int> P;
set<P>s; multiset<P>ms;
int h, w, n, ans[20];
signed main() {
cin >> h >> w >> n;
while (n--) {
int x, y; cin >> x >> y;
for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++) if (1 < x + i && x + i < h && 1 < y + j && y + j < w) {
s.insert(mp(x + i, y + j));
ms.insert(mp(x + i, y + j));
}
}
ans[0] = (h - 2) * (w - 2);
for (P p1 : s) {
ans[0]--; ans[ms.count(p1)]++;
}
for0(i, 10)cout << ans[i] << endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
int main() {
ll a, b; cin >> a >> b;
b++;
vector<ll> aa(40,0);
vector<ll> ab(40,0);
ll c = 1LL;
rep(i,40){
ll da = a / (c*2LL);
ll ma = a % (c*2LL);
aa[i] = c * da + max(0LL,ma-c);
ll db = b / (c*2LL);
ll mb = b % (c*2LL);
ab[i] = c * db + max(0LL,mb-c);
c *= 2LL;
}
ll p = 1LL;
ll ans = 0LL;
rep(i,40){
if ((ab[i] - aa[i]) % 2 == 1) ans += p;
p *= 2LL;
}
cout << ans << endl;
}
| 0
| 71,381,425
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace std;
bool prime_(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b){
if(a<b){
swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd_(b,a%b);
}
}
long long lcm_(long long x, long long y){
return (x/gcd_(x,y))*y;
}
int main(){
string s;
cin>>s;
int w;
cin>>w;
int n = s.size();
string ans = "";
for(int i=0;i*w<n;i++){
ans += s[i*w];
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
long long modpow(long long a,long long n){
long long res = 1;
long long mod = n + 2;
while(n > 0){
if(n&1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long inverse(long long x,long long modding){
return modpow(x,modding-2);
}
ll calc(int x,int y){
ll bunbo = 1;
ll bunbotemp = x;
while(bunbotemp>0){
bunbo *= bunbotemp;
bunbotemp--;
bunbo %= MOD;
}
ll bunsi = 1;
ll bunsitemp=x+y;
bunbotemp = x;
while(bunbotemp>0){
bunsi*= bunsitemp;
bunsi %= MOD;
bunsitemp--, bunbotemp--;
}
return bunsi * inverse(bunbo, MOD) % MOD;
}
int main() {
int X, Y;
cin >> X >> Y;
if((X+Y)%3!=0){
puts("0");
return 0;
}
int n = (2 * Y - X) / 3, m = Y - 2 * n;
if(n<0||m<0){
puts("0");
return 0;
}
ll ans = calc(n, m);
if (ans <= 0) ans += MOD;
cout << ans << endl;
}
| 0
| 66,213,904
|
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0)
return 1;
else
return ((n%M)*(fact(n-1)%M))%M;
}
int div(int n)
{ int c=0;
for(int i=1;i<sqrt(n);i++)
{
if(n%i==0)
{
c++;
}
}
c=c*2;
if(pow(sqrt(n),2)==(sqrt(n)*sqrt(n)))
c++;
return c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int k;
cin>>k;
string str;
cin>>str;
int l=str.length();
if(l<=k)
cout<<str;
else
{
for(int i=0;i<k;i++)
{
cout<<str[i];
}
cout<<"...";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push
#define lld long long int
#define ins insert
#define adv advance
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl vector<long long int >
#define vpll vector< pair<lld ,lld> >
#define vvl vector<vector<lld> >
#define pll pair <lld,lld>
lld p1=1e9 + 7,p2=998244353;
void judge(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void fastio(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
long long int modp(lld a,lld p,lld n)
{
lld d[100];
lld i,j,k,l;
if(n==0) return 1;
for(i=0;n>=1;i++)
{
d[i]=n%2;
n/=2;
}
l=i;
long long int e=1;
if(d[0]==1) e*=(a%p);
for(i=1;i<l;i++)
{
a*=a;
a=a%p;
if(d[i]==1)
{
e*=a;
e=e%p;
}
}
return e%p;
}
lld modInverse(lld n, lld p)
{
return modp(n, p, p-2);
}
lld l,r,mid,ans=0;
lld n,i,j,k,g,m;
lld x,y,n1,n2,h,z,c;
lld aa=1;
lld ss=1;
void solve()
{
cin>>n;
vector<lld> v1,v2,v3;
cin>>x>>y>>z;
v1.pb(x);
v2.pb(y);
v3.pb(z);
for(i=1;i<n;i++)
{
cin>>x>>y>>z;
v1.pb(max(v2[i-1],v3[i-1])+x);
v2.pb(max(v1[i-1],v3[i-1])+y);
v3.pb(max(v2[i-1],v1[i-1])+z);
}
cout<<max(v1[n-1] , max(v2[n-1], v3[n-1]));
}
int main()
{
fastio();
lld t=1;
for(int i=0;i<t;i++)
{
solve();
cout<<"\n";
}
return 0;
}
| 0
| 76,603,266
|
#include <iostream>
#include <vector>
#include <algorithm>
int main(){
int N;
std::vector<int> v;
std::cin >> N;
for(int i = 0 ; i < N ; i++){
int temp;
std::cin >> temp;
v.push_back(temp);
}
std::sort(v.begin(), v.end());
double resa = 0;
double ave = v[0];
for(int i = 0 ; i < (int)v.size() - 1 ; i++){
ave = (ave + v[i+1]) / 2.0;
}
std::cout << ave << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
#define f first
#define s second
#define pb push_back
#define inf 1e17
#define ninf -1*1e17
#define mod 1000000007
#define N 500005
#define Ns 5005
string s;
ll n,m,o,x,y,z,d,k,l,r;
unsigned long long power(unsigned long long x, int y, int p)
{
unsigned long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
unsigned long long modInverse(unsigned long long n, int p)
{
return power(n, p - 2, p);
}
ll ncr(ll n,ll r){
if(n<r)
return 0;
if(n==r)
return 1;
ll ans=1;
for(ll i=n;i>n-r;i--){
ans=(ans*i)%mod;
}
for(ll i=2;i<=r;i++){
ans=(ans*modInverse(i,mod))%mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t=1;
while(t--){
ll ans=0;
cin>>n;
for(int r=1;r<n;r++){
int total=n-2*r;
if(total<0){
break;
}
ans=(ans+ncr(total-1,r-1))%mod;
}
cout<<ans<<"\n";
}
return 0;
}
| 0
| 29,369,182
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
int dp[101][100001];
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
dp[0][0] = 1;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= k; j++){
dp[i - 1][j] += dp[i - 1][j - 1];
}
for(int j = 0; j <= k; j++){
dp[i][j] = dp[i - 1][j];
if(j - a[i] - 1 >= 0) dp[i][j] -= dp[i - 1][j - a[i] - 1];
dp[i][j] %= MOD;
}
}
cout << dp[n][k];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int nm = 1e5;
int n, m, p[nm], r[nm], a[nm], ans = 0;
vector<int> g[nm];
int root(int v) {
if (r[v] == v)
return v;
return root(r[v]);
}
void unite(int x, int y) {
int rx = root(x), ry = root(y);
if (rx == ry)
return;
if (a[ry] > a[rx])
swap(rx, ry);
r[ry] = rx;
a[rx] += a[ry] + 1;
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
r[i] = i;
cin >> p[i];
p[i]--;
}
for (int i = 0, x, y; i < m; i++) {
cin >> x >> y;
unite(x - 1, y - 1);
}
for (int i = 0; i < n; i++)
if (root(p[i]) == root(i))
ans++;
cout << ans << endl;
}
| 0
| 20,978,119
|
#include<iostream>
using namespace std;
int main(void)
{
int l, r;
for(int i = 0; i < 81; i++)
{
l = i/9+1;
r = i%9+1;
cout << l << 'x' << r << '=' << l*r << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(t, x) t ipt; cin >> ipt; x.push_back(ipt);
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout << "no" << endl;
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
const static ll MOD = 1e9 + 7;
ll n, cnt, ans, tmp, sum, minimum, maximum, a, b, c, d, k, m, h, w, q, x, y;
string s, t;
int main() {
cin >> a >> b;
MSG(a * b - a - b + 1)
}
| 0
| 74,355,199
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi {
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
ll n;
cin >> n;
auto a = prime_factorize(n);
ll ans = 0;
for(auto b : a){
ll buf = 0;
while(b.second > 0){
if(buf + 1 <= b.second){
buf++;
b.second -= buf;
} else {
b.second = 0;
}
}
ans += buf;
}
cout << ans << endl;
return 0;
}
int getDigit(int n) {
int i = 1;
while(1) {
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n) {
int s = 0;
while(n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for(auto itr = str.begin();itr != str.end() ; itr++) {
if(97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for(auto itr = str.begin();itr != str.end() ; itr++) {
if(65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi() {
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k) {
Resize(n,k);
ll ret;
if(memo[n][k] != 0) {
ret = memo[n][k];
} else if(n == k || k == 0) {
memo[n][k] = 1;
ret = 1;
} else {
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k) {
if(n_num <= n || k_num <= k) {
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr) {
itr->resize(k_num);
}
}
}
long long Combi::nPk_modp(long long n, long long k, long long p) {
ll ans = 1;
for(long long i = k; i <= n; i++) {
ans = (ans * i) % p;
}
return ans;
};
vector<pair<long long,long long>> prime_factorize(long long p) {
vector<pair<long long,long long>> ret;
for(long long x = 2; x * x <= p; ++x) {
if(p % x != 0) continue;
long long num = 0;
while(p % x == 0) {
num++;
p /= x;
}
ret.push_back(make_pair(x,num));
}
if(p != 1) ret.push_back(make_pair(p, 1));
return ret;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int h, w, k;
cin >> h >> w >> k;
vector<vector<char>> c(h,vector<char>(w));
for(int i=0; i<h; i++) for(int j=0; j<w; j++) cin>>c[i][j];
int ans=0;
for(int i=0; i<(1<<h); i++){
for(int j=0; j<(1<<w); j++){
int cnt=0;
for(int k=0; k<h; k++){
for(int l=0; l<w; l++){
if(!(i&(1<<k))&&!(j&(1<<l))&&c[k][l]=='#'){
cnt++;
}
}
}
if(cnt==k) ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 38,725,605
|
#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;
int main() {
int N;
ll M;
cin >> N >> M;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
map<ll,int> mp;
ll R[N+1];
R[0] = 0;
mp[0]++;
ll ans = 0;
for (int i = 0; i < N; i++) {
R[i+1] = R[i] + A[i];
R[i+1] %= M;
ans += mp[R[i+1]];
mp[R[i+1]]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
ll n, y;
cin >> n >> y;
y /= 1000;
if (n > y)
{
cout << "-1 -1 -1";
return;
}
set<ll> hash;
queue<tuple<ll, ll, ll>> que;
if (n <= y / 10) que.emplace(y / 10, 0, y - (y / 10) * 10);
else if (n <= y / 5) que.emplace(0, y / 5, y - ((y / 5) * 5));
else que.emplace(0, 0, y);
while(!que.empty())
{
ll x, y, z;
tie(x, y, z) = que.front();
que.pop();
ll hv = (x << 40LL) + (y << 20LL) + z;
if (hash.find(hv) != hash.end()) continue;
hash.insert(hv);
if (x + y + z < n) continue;
if (x + y + z == n)
{
cout << x << " " << y << " " << z;
return;
}
if (z >= 5)
{
que.emplace(x, y + 1, z - 5);
}
if (z >= 10)
{
que.emplace(x + 1, y, z - 10);
}
if (y >= 2)
{
que.emplace(x + 1, y - 2, z);
}
}
cout << "-1 -1 -1";
}
int main()
{
fastio;
solve();
return 0;
}
| 0
| 78,983,209
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
vector<int>bitSearch(int bit,int n){
vector<int>S;
rep(i,n)if(bit&(1<<i))S.push_back(i);
return S;
}
int main(){
double a,b;cin>>a>>b;
cout<<a/b;
}
|
#include <iostream>
using namespace std;
#include <cstdio>
#include <cmath>
class Dice{
public:
int face[6], facetmp[6];
Dice(void){
for (int i = 0; i < 6; i++){
face[i] = 0;
facetmp[i] = 0;
}
}
void move(char ch){
for (int i = 0; i < 6; i++) {
facetmp[i] = face[i];
}
if (ch == 'E') {
facetmp[0] = face[3];
facetmp[2] = face[0];
facetmp[3] = face[5];
facetmp[5] = face[2];
}
else if (ch == 'W') {
facetmp[0] = face[2];
facetmp[2] = face[5];
facetmp[3] = face[0];
facetmp[5] = face[3];
}
else if (ch == 'N') {
facetmp[0] = face[1];
facetmp[1] = face[5];
facetmp[4] = face[0];
facetmp[5] = face[4];
}
else if (ch == 'S') {
facetmp[0] = face[4];
facetmp[1] = face[0];
facetmp[4] = face[5];
facetmp[5] = face[1];
}
else if (ch == 'Z'){
facetmp[1] = face[3];
facetmp[2] = face[1];
facetmp[3] = face[4];
facetmp[4] = face[2];
}
for (int i = 0; i < 6; i++){
face[i] = facetmp[i];
}
}
void print(){
cout << face[0] << endl;
}
};
int main() {
Dice d1;
int num[6], q, f1, f2;
string order = "";
for (int i = 0; i < 6; i++){
cin >> num[i];
d1.face[i] = num[i];
}
cin >> q;
for (int i = 0; i < q; i++){
cin >> f1 >> f2;
for (int j = 0; j <= 3; j++){
for (int k = 0; k <= 3; k++){
for (int n = 0; n <= 3; n++){
order.clear();
order.append(j,'E');
order.append(k,'S');
order.append(n,'Z');
for (int l = 0; l < 6; l++){
d1.face[l] = num[l];
}
for (int m = 0; m < order.size(); m++){
d1.move(order[m]);
}
if (d1.face[0] == f1 && d1.face[1] == f2){
cout << d1.face[2] << "\n";
j = 3;
k = 3;
n = 3;
}
}
}
}
}
return 0;
}
| 0
| 91,458,220
|
#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+10;
const ll MOD = 998244353;
const ll LINF = 1e18;
ll dp[11][200005];
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n,x,m; cin>>n>>x>>m;
ll sum=x, pre=x, cycle_sum=0;
vll v;
vll cnt(m);
rep(i,n-1){
ll a=(pre*pre)%m;
if(cnt[a]==2){
ll len=v.size();
sum+=(n-1-i)/len*cycle_sum;
ll rem=(n-1-i)%len;
rep(j,rem){
sum+=v[j];
}
break;
}else if(cnt[a]==1){
cnt[a]++;
v.push_back(a);
cycle_sum+=a;
sum+=a;
}else{
cnt[a]++;
sum+=a;
}
pre=a;
}
cout<<sum<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
short int n , a , b , c , d ;
while( cin >> n ){
int num =0 ;
for( a=0 ; a<10 ; a++ )
for( b=0 ; b<10 ; b++ )
for( c=0 ; c<10 ; c++ )
for( d=0 ; d<10 ; d++ )
if( a+b+c+d == n )
num ++ ;
cout << num << endl;
}
}
| 0
| 79,198,385
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int K, A, B; cin >> K >> A >> B;
if(A >= B-2 || A >= K) cout << K+1 << endl;
else {
int a = A;
K -= A-1;
a -= A;
K--;
a += B;
K--;
cout << a+(K/2)*(B-A)+(K%2) << endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define iREP(i,Itr) for(auto (i)=(Itr).begin();(i)!=(Itr).end();(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;
bool hurui[1000010];
int dp[1000010];
bool isPrime(int n){
if(n==1)return false;
if(n==2)return true;
for(int i=2;i<sqrt(n)+1;i++){
if((n%i)==0)return false;
}
return true;
}
int main(){
REP(i,1000010)hurui[i]=true;
hurui[0]=hurui[1]=false;
for(int i=2;i<=1000005;i++){
if(hurui[i]){
if(isPrime(i)){
for(int j=i+i;j<=1000005;j+=i)hurui[j]=false;
}
}
}
REP(i,1000005)dp[i+1]=dp[i]+(hurui[i+1]?1:0);
int t;
while(cin>>t){
cout<<dp[t]<<endl;
}
return 0;
}
| 0
| 36,954,406
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
ll X;
cin >> X;
ll U = X / 100;
ll H = X % 100;
ll cnt[200];
fillnum(cnt,LINF);
cnt[0] = 0;
for (int i = 0; i <= H; i++) {
for (int j = 1; j < 6; j++) {
cnt[i+j] = min(cnt[i+j],cnt[i]+1);
}
}
SANKOU(cnt[H] <= U,1,0);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
int n;
cin >> n;
string s;
cout << 0 << endl;;
cin >> s;
flush(cout);
if (s == "Vacant"){
cout << 0 << endl;
return 0;
}
string sex = s;
int left = 0, right = n;
while(true){
int mid = (right+left) / 2;
cout << mid << endl;;
cin >> s;
flush(cout);
if (s == "Vacant"){
cout << mid << endl;
return 0;
}
if (mid % 2 != 0){
if (sex != s) left = mid;
else right = mid;
}else{
if (sex == s) left = mid;
else right = mid;
}
}
return 0;
}
| 0
| 57,335,666
|
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<bitset>
using namespace std;
typedef bitset<60000> bi;
bool get(vector<int> v, int t) {
bi x;
x[30000] = 1;
for (int i = 0; i < v.size(); i++)x = (x << v[i]) | (x >> v[i]);
return x[30000 + t];
}
int main() {
string s;
cin >> s;
s.push_back('T');
int x, y;
scanf("%d%d", &x, &y);
vector<int> v1, v2;
int mode = -1;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'T') {
if (mode == -1)mode = 1;
else if (mode == 0)v1.push_back(cnt), mode = 1;
else v2.push_back(cnt), mode = 0;
cnt = 0;
} else {
if (mode == -1)x--;
else cnt++;
}
}
if (get(v1, x) && get(v2, y))printf("Yes\n");
else printf("No\n");
}
|
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i = (m);i < (n);i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1;} return 0;}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int main() {
int h, w, d;
cin >> h >> w >> d;
vector<vector<int>> a(h,vector<int>(w));
typedef pair<int, int> P;
map<int, P> m;
rep(i,h) rep(j,w) {
cin >> a[i][j];
m[a[i][j]] = P(i,j);
}
vector<int> sum(h*w+1);
repf(i,1,h*w+1) {
int pre = i-d;
if (pre > 0) {
int hp = abs(m[i].first-m[pre].first) + abs(m[i].second-m[pre].second);
sum[i] = sum[pre] + hp;
}
}
int q; cin >> q;
vector<int> l(q), r(q);
rep(i,q) cin >> l[i] >> r[i];
rep(i,q) {
if (l[i]-d > 0) {
cout << sum[r[i]] - sum[l[i]] << endl;
} else {
cout << sum[r[i]] << endl;
}
}
return 0;
}
| 0
| 29,528,572
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;
sc(n);
int a[n];
GET(a);
int l;
sc(l);
const int pot = 18;
int wh[n+1][pot];
FOR(i,0,pot){
wh[n-1][i] = n;
wh[n][i] = n;
}
int it = n-1;
int q;
sc(q);
for(int i = n-2; i >= 0; --i){
while(a[it]-a[i] > l){
--it;
}
wh[i][0] = it;
FOR(x,1,pot){
wh[i][x] = wh[wh[i][x-1]][x-1];
}
}
int f,s;
while(q--){
sc(f,s);
--f,--s;
if(f > s) swap(f,s);
int ans = 0;
int cpot = pot-1;
int cr = f;
while(cr < s){
while(cpot && wh[cr][cpot] > s){
--cpot;
}
cr = wh[cr][cpot];
ans += 1 << cpot;
}
cout << ans << '\n';
}
}
|
#include <iostream>
int main () {
std::string a, b, c;
std::cin >> a >> b >> c;
if(a.substr(a.size()-1, 1) == b.substr(0, 1) && b.substr(b.size()-1, 1) == c.substr(0, 1)) {
std::cout << "YES" << std::endl;
}else {
std::cout << "NO" << std::endl;
}
}
| 0
| 38,587,619
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const int MX = 100;
const int INF = INT_MAX / 2;
vector<vector<vector<int>>> dp;
void solve(const int A, const int B, const int C) {
queue<tuple<int, int, int, int>> que;
dp[A][B][C] = 0;
que.push(make_tuple(0, A, B, C));
const vector<tuple<int, int, int>> diffs = {
make_tuple(2, 0, 0),
make_tuple(0, 2, 0),
make_tuple(0, 0, 2),
make_tuple(1, 1, 0),
make_tuple(1, 0, 1),
make_tuple(0, 1, 1),
};
while (!que.empty()) {
auto elem = que.front();
que.pop();
int cur_steps, cur_a, cur_b, cur_c;
tie(cur_steps, cur_a, cur_b, cur_c) = elem;
for (auto &diff : diffs) {
int diff_a, diff_b, diff_c;
tie(diff_a, diff_b, diff_c) = diff;
int next_steps = cur_steps + 1;
int next_a = cur_a + diff_a;
int next_b = cur_b + diff_b;
int next_c = cur_c + diff_c;
if (next_a >= MX || next_b >= MX || next_c >= MX) {
continue;
}
if (next_steps < dp[next_a][next_b][next_c]) {
dp[next_a][next_b][next_c] = next_steps;
que.push(make_tuple(next_steps, next_a, next_b, next_c));
}
}
}
}
int main(void) {
int A, B, C;
cin >> A >> B >> C;
dp.resize(MX);
for (int i = 0; i < MX; i++) {
dp[i].resize(MX);
for (int j = 0; j < MX; j++) {
dp[i][j].resize(MX, INF);
}
}
solve(A, B, C);
int ans = INF;
for (int i = max({A, B, C}); i < MX; i++) {
chmin(ans, dp[i][i][i]);
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include<vector>
#include<iomanip>
#include<map>
#include <queue>
#include<cmath>
#include<cstdio>
#include<iomanip>
#include<set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define MOD 1000000007
ll gcd(ll a, ll b) {
ll tmp;
if ( b > a) {
tmp = a;
a = b;
b = tmp;
}
while (a % b !=0) {
tmp = b;
b = a % b;
a = tmp;
}
return b;
}
const int MAX = 2000;
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;
}
void sosuu(ll n, vector<ll> &v){
vector<ll> num(n, 0);
FOR(i, 1, sqrt(n)){
if(num[i]==0){
FOR(j, 0, n/i){
num[i+(j*i)] = 1;
}
}
}
REP(i, n){
if(num[i]==0) v.push_back(i+1);
}
}
ll GetDigit(ll num){
ll digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
int main(void){
ll n;
cin>>n;
vector<ll> a(n);
vector<ll> b(n);
vector<ll> sub(n);
ll suma = 0;
ll sumb = 0;
REP(i, n){
cin>>a[i];
suma += a[i];
}
REP(i, n){
cin>>b[i];
sumb += b[i];
sub[i] = a[i]-b[i];
}
ll count = 0;
if(suma < sumb){
cout<<"-1"<<endl;
return 0;
}
sort(sub.begin(), sub.end());
ll i = 0;
ll j = n-1;
while(sub[i]<0){
if(abs(sub[i]) > sub[j]){
sub[i] += sub[j];
count++;
j--;
}else{
sub[j] += sub[i];
count++;
i++;
}
}
if(sub[0]>=0) cout<<"0"<<endl;
else cout<<count+1<<endl;
return 0;
}
| 0
| 4,472,783
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int main() {
cout << fixed << setprecision(10);
int a,b;
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
}else if(a==1){
cout << "Alice" << endl;
}else if(b==1){
cout << "Bob" << endl;
}else if(a>b){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
using namespace std;
void addWordCount(const vector<string>& cards, map<string, int>& wordCount);
void subWordCount(const vector<string>& cards, map<string, int>& wordCount);
int getMaxValue(const map<string, int>& wordCount);
int main() {
int numOfBlueCard = 0;
cin >> numOfBlueCard;
vector<string> blueCards;
for (int i = 0; i < numOfBlueCard; ++i) {
string blueCard;
cin >> blueCard;
blueCards.push_back(blueCard);
}
int numOfRedCard = 0;
cin >> numOfRedCard;
vector<string> redCards;
for (int i = 0; i < numOfRedCard; ++i) {
string redCard;
cin >> redCard;
redCards.push_back(redCard);
}
map<string, int> wordCount;
addWordCount(blueCards, wordCount);
subWordCount(redCards, wordCount);
cout << getMaxValue(wordCount) << endl;
}
void addWordCount(const vector<string>& cards, map<string, int>& wordCount) {
for (string card : cards) {
++wordCount[card];
}
}
void subWordCount(const vector<string>& cards, map<string, int>& wordCount) {
for (string card : cards) {
--wordCount[card];
}
}
int getMaxValue(const map<string, int>& wordCount) {
int maxValue = 0;
for (auto word : wordCount) {
if (word.second > maxValue) maxValue = word.second;
}
return maxValue;
}
| 0
| 78,931,015
|
#include <iostream>
#include <string>
using namespace std;
bool is_right(char c) {
static char right[] = "yuiophjklnm";
for (int i=0; right[i]; i++) {
if (c == right[i]) {
return true;
}
}
return false;
}
int main() {
bool was_right;
string input;
while (true) {
int count = 0;
cin >> input;
if (input == "#") {
break;
}
for (int i=0; i<(int)input.length(); i++) {
if (is_right(input[i])) {
if (i>0 && !was_right) {
count++;
}
was_right = true;
}
else {
if (i>0 && was_right) {
count++;
}
was_right = false;
}
}
cout << count << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
cin>>n;
int a[n];
int count = 0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
int minj = i;
for(int j=i;j<n;j++){
if(a[j]<a[minj]){
minj = j;
}
}
if(a[i]!=a[minj]){
int tmp = a[i];
a[i]=a[minj];
a[minj]=tmp;
count++;
}
}
cout<<a[0];
for(int i = 1;i<n;i++){
cout<<' '<<a[i];
}
cout<<endl;
cout<<count<<endl;
}
| 0
| 30,484,944
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = (ll)4e18;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(all(a));
sort(all(b));
sort(all(c));
vector<ll> sum;
rep(i, x) {
rep(j, y) {
sum.push_back(a[i] + b[j]);
}
}
sort(rall(sum));
vector<ll> res;
rep(i, z) {
rep(j, min(k, (int)sum.size())) {
res.push_back(c[i] + sum[j]);
}
}
sort(rall(res));
rep(i, k) cout << res[i] << endl;
return 0;
}
|
#include<iostream>
#include<queue>
#include<cmath>
using namespace std;
class vec {
public:
double x;
double y;
vec(double nx, double ny) :x{nx}, y{ny} {}
};
class segment {
public:
vec start;
vec end;
segment(vec start, vec end) :start{start}, end{end} {}
};
vec operator+(vec v1, vec v2) {
return vec(v1.x+v2.x, v1.y+v2.y);
}
vec operator-(vec v1, vec v2) {
return vec(v1.x-v2.x, v1.y-v2.y);
}
vec operator*(double a, vec v) {
return vec(a*v.x, a*v.y);
}
vec operator*(vec v, double a) {
return a*v;
}
vec rot90ccw(vec v) {
return vec(-1.*v.y, v.x);
}
void split_and_add(segment& s, queue<segment>& dest)
{
vec mid1 = (2./3)*(s.start) + (1./3)*(s.end);
vec mid2 = (1./3)*s.start + (2./3)*s.end;
vec triangle_top = rot90ccw((mid2-mid1)*0.5*sqrt(3.)) + 0.5*(mid1 + mid2);
dest.push(segment(s.start, mid1));
dest.push(segment(mid1, triangle_top));
dest.push(segment(triangle_top, mid2));
dest.push(segment(mid2, s.end));
}
int main()
{
int n; cin >> n;
queue<segment> q;
q.push(segment(vec(0,0), vec(100,0)));
for (int i = 0; i < n; ++i) {
queue<segment> q2;
while (!q.empty()) {
segment &s = q.front();
split_and_add(s, q2);
q.pop();
}
q = move(q2);
}
cout << fixed;
cout << q.front().start.x << " " << q.front().start.y << endl;
while (!q.empty()) {
segment &s = q.front();
cout << s.end.x << " " << s.end.y << endl;
q.pop();
}
}
| 0
| 33,475,617
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
string text="abcdefghijklmnopqrstuvwxyz";
const int maxn=1e6+7;
ll bin_pow(ll a,ll b,ll m)
{
ll res=1;
a%=m;
while(b>0)
{
if(b&1)
res=res*a%m;
b>>=1;
a=a*a%m;
}
return res;
}
bool miller_rabin(ll d,ll n)
{
ll a=2+rand()%(n-4);
ll x=bin_pow(a,d,n);
if(x==1 || x==n-1)
return true;
while(d!=n-1)
{
x=(x*x)%n;
d*=2;
if(x==1)
return false;
if(x==n-1)
return true;
}
return false;
}
bool prime(ll n,ll k)
{
if(n==1 || n==4)
return false;
if(n<=3)
return true;
ll d=n-1;
while(d%2==0)
d/=2;
for(int i=0; i<k; i++)
{
if(!miller_rabin(d,n))
return false;
}
return true;
}
int n;
string s;
ll ans = 0;
void solve(ll x,ll y)
{
if(x==n+1)
{
ans += y;
return;
}
ll cur = 0;
for(ll i=x; i<=n; i++)
{
cur = (10*cur) + (s[i]-'0');
solve(i+1,y+cur);
}
}
bool cmp(const pair<int,int>& x,const pair<int,int>& y){return x.second>y.second;}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
int cnt[n+2]={0};
int a[n+2];
set<int>s;
for(int i=0;i<n;i++){
cin>>a[i];
s.insert(a[i]);
cnt[a[i]]++;
}
vector<pair<int,int> >v;
for(auto x: s){
v.push_back({x,cnt[x]});
}
sort(v.begin(),v.end(),cmp);
ll sum=0;
for(int i=k;i<v.size();i++)sum+=v[i].second;
cout<<sum<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0;i<(n);i++)
#define rep2(i,n) for(long long i=1;i<=(n);i++)
#define rep3(i,i0,n) for(long long i=i0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
vector<ll> ans(100);
vector<vector<ll>> t(100);
void renew(ll key,ll parent){
rep(i,t[key].size()){
if(t[key][i] != parent){
ans[t[key][i]] += ans[key];
renew(t[key][i],key);
}
}
}
int main() {
ll N,Q;
cin >> N >> Q;
ans.resize(N);
t.resize(N);
ll a,b;
rep(i,N-1){
cin >>a>>b;
a--;
b--;
t[b].pb(a);
t[a].pb(b);
}
ll p,x;
rep(i,Q){
cin >> p >>x;
p--;
ans[p] += x;
}
renew(0,-1);
rep(i,N){
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
| 0
| 4,482,360
|
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
void solve(){
int M; cin >> M;
ll sumc = 0;
ll sumd = 0;
REP(i,M){
ll d, c;cin >> d >> c;
sumc += c;
sumd += d*c;
}
ll ans = sumc-1 + (sumd-1)/9;
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
vector<int>bitSearch(int bit,int n){
vector<int>S;
rep(i,n)if(bit&(1<<i))S.push_back(i);
return S;
}
int gcd(int a,int b){
if(a%b==0)return b;
else return gcd(b,a%b);
}
int main(){
int n,k;cin>>n>>k;
ll res;
if(k%2==1){
res = pow(n/k,3);
cout<<res<<endl;
}
else {
int l = k/2;
ll cnt1 = 0;
while(l<=n){
cnt1++;
l += k;
}
ll cnt2 = n/k;
res = pow(cnt1,3)+pow(cnt2,3);
cout<<res<<endl;
}
}
| 0
| 30,705,612
|
#include <iostream>
using namespace std;
int main() {
int a[100][100] = {{0}};
int n;
cin >> n;
int u, k, v;
for ( int i = 0; i < n; i++ ) {
cin >> u >> k;
for ( int j = 0; j < k; j++ ) {
cin >> v;
a[u - 1][v - 1] = 1;
}
}
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < n; j++ ) {
cout << a[i][j];
if ( j != n - 1 ) cout << " ";
}
cout << endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <iomanip>
using namespace std;
#define int long long
int gcd(int a,int b){
return b ? gcd(b, a % b) : a;
}
int lcm(int a,int b){
return b / gcd(a,b) * a;
}
signed main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> a(n),b(n);
for(int i = 0;i < n;i ++) cin >> a.at(i) >> b.at(i);
int ans = 0;
for(int i = n-1;i >= 0;i --){
int c = a.at(i) + ans;
if(c % b.at(i) == 0) continue;
else ans += (b.at(i) - c % b.at(i));
}
cout << ans << endl;
}
| 0
| 18,229,264
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n, a;
cin >> n;
vector<int> bin(100010);
for(int i = 0; i < n; ++i)
{
cin >> a;
bin[max(0, a - 1)]++;
bin[a + 2]--;
}
for(int i = 0; i < 100005; ++i)
{
bin[i + 1] += bin[i];
}
cout << *max_element(ALL(bin));
}
int main()
{
fastio;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
cin >> A >> B >> M;
vector<int>a(A);
vector<int>b(B);
int X = 100001;
int Y = 100001;
for(int i = 0; i < A; i++) {
cin >> a[i];
X = min(X,a[i]);
}
for(int i = 0; i < B; i++) {
cin >> b[i];
Y = min(Y,b[i]);
}
int ans = X+Y;
for(int i = 0; i < M; i++) {
int x,y,c;
cin >> x >> y >> c;
ans = min(ans,a[x-1]+b[y-1]-c);
}
cout << ans << endl;
}
| 0
| 65,686,823
|
#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++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int gcd(int a, int b){
if (a%b==0){
return (b);
}
else{
return (gcd(b,a%b));
}
}
int lcm(int a, int b){
return a*b/gcd(a,b);
}
int main() {
int N,M; cin >> N >> M;
vector<int> A(N);
REP(i,N){
cin >> A[i];
}
int a = A[0];
int p = 0;
while (a%2 == 0){
a/=2;
p++;
}
int evens = pow(2,p);
REP(i,N){
if(A[i]%evens!=0 || A[i]%(evens*2)==0){
cout << 0 << endl;
return 0;
}
}
ll L = A[0];
REP(i,N-1){
L = lcm(L,A[i+1]);
}
L/=2;
ll ans = M/L;
if(ans%2 == 0){
cout << ans/2 << endl;
}else{
cout << ans/2+1 << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using ipair = pair<int, int>;
ll INF = 1e16+7;
bool operator>(const ipair a,const ipair b){return a.first > b.first;}
int MOD = 1e9+7;
ostringstream sout;
string zero_padding(int num){
sout << setfill('0') << setw(6) << num;
string ret = sout.str();
return ret;
}
int main(){
int N, M;
cin >> N >> M;
map<int, vector<ipair> > mp;
rep(i, M){
int p, y;
cin >> p >> y;
mp[p].push_back(make_pair(y, i));
}
vector<ipair> ans(M);
for(pair<int, vector<ipair>> p: mp){
int pref = p.first;
vector<ipair> cities = p.second;
sort(cities.begin(), cities.end());
rep(city_order, cities.size()){
int original_idx = cities[city_order].second;
ans[original_idx] = make_pair(pref, city_order+1);
}
}
rep(i, M){
printf("%06d%06d\n", ans[i].first, ans[i].second);
}
return 0;
}
| 0
| 54,944,023
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
rep(i, n-1){
for(int j = i + 1; j < n; j++) {
int w = abs(a[i] - a[j]);
ans = max(ans, w);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int time_max = 86410;
int imos[time_max];
int time_split(char Tens_Place,char One_Place){
int return_num;
string s = {Tens_Place, One_Place};
stringstream ss;
ss << s;
ss >> return_num;
return return_num;
}
int main() {
while(1) {
int n;
cin >> n;
if(n==0){
break;
}
for(int i=0; i<time_max; i++){
imos[i] = 0;
}
for (int i = 0; i < n; i++) {
string start, goal;
cin >> start >> goal;
int h, m, s;
h = time_split(start[0], start[1]);
m = time_split(start[3], start[4]);
s = time_split(start[6], start[7]);
imos[h * 60 * 60 + m * 60 + s]++;
h = time_split(goal[0], goal[1]);
m = time_split(goal[3], goal[4]);
s = time_split(goal[6], goal[7]);
imos[h * 60 * 60 + m * 60 + s]--;
}
for (int i = 1; i < time_max; i++) {
imos[i] += imos[i - 1];
}
int ans = 0;
for (int i = 0; i < time_max; i++) {
ans = max(ans, imos[i]);
}
cout << ans << endl;
}
return 0;
}
| 0
| 78,709,659
|
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
long ans = (100 * (n - m) + 1900 * m) * (1 << m);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, long long K, std::vector<long long> A){
ll ans = 0;
ll right = 0;
while(true){
if(right == 0) right += K;
else right += K - 1;
ans ++;
if(right >= N) break;
}
cout << ans << endl;
return;
}
int main(){
long long N;
scanf("%lld",&N);
long long K;
scanf("%lld",&K);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, K, std::move(A));
return 0;
}
| 0
| 36,489,646
|
#include<bits/stdc++.h>
using namespace std;
string rever(string s) {
string t(s.rbegin(), s.rend());
return t;
}
int main() {
string s, t, a, b, x, y;
cin >> s;
int n = s.size();
t = rever(s);
a = s.substr(0, (n-1)/2);
b = rever(a);
x = s.substr((n+1)/2);
y = rever(x);
if (s==t && a==b && x==y) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<int,int> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
int main() {
int N;cin >> N;
vector<int> retu(N);
for(int i = 0;i<N;i++) cin >> retu.at(i);
for(int i = 0;i<N-1;i++){
if(retu.at(i) != retu.at(i+1)) break;
if(i == N-2){
cout << N/2 << endl;
return 0;
}
}
map<int,int> odd;
map<int,int> even;
for(int i = 0;i<N;i++){
if(i % 2 == 0){
even[retu.at(i)]++;
}
else{
odd[retu.at(i)]++;
}
}
P maxiO = P(0,0),maxiE = P(0,0);
for(auto P : odd){
if(maxiO.second < P.second){
maxiO.first = P.first;
maxiO.second = P.second;
}
}
for(auto Q : even){
if(maxiE.second < Q.second){
maxiE.first = Q.first;
maxiE.second = Q.second;
}
}
if(maxiO.first != maxiE.first){
cout << N/2 - maxiO.second + N/2 - maxiE.second << endl;
return 0;
}
int maxi2O = 0,maxi2E = 0;
int ans = 0;
for(auto P : odd){
if(maxiO.second >= P.second && P.first != maxiO.first){
maxi2O = max(maxi2O,P.second);
}
}
ans = N/2 - maxi2O + N/2 - maxiE.second;
for(auto Q : even){
if(maxiE.second >= Q.second && Q.first != maxiE.first){
maxi2E = max(maxi2E,Q.second);
}
}
ans = min(ans,N/2 - maxiO.second + N/2 - maxi2E);
cout << ans << endl;
}
| 0
| 23,270,868
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sidha(i,a,b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
#define mod 1000000007
int solve(int n){
int dp[n+1];
dp[0]=0;
dp[1]=1;
for(int i=2;i<n+1;i++){
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
return dp[n];
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m;cin>>n>>m;
vector<int> arr(n+1,true);
for(int i=0;i<m;i++){
int a;cin>>a;
arr[a]=false;
}
vector<ll> dp(n+1);
dp[0]=1;
for(int i=0;i<n;i++){
for(int j=i+1;j<=min(n,i+2);j++){
if(arr[j]){
dp[j]+=dp[i];
dp[j]%=mod;
}
}
}
cout<<dp[n]<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> m,f,r;
int m1,f1,r1;
do{
cin>>m1>>f1>>r1;
m.push_back(m1);
f.push_back(f1);
r.push_back(r1);
}while (m1!=-1 || f1!=-1 || r1!=-1);
int i;
for (i=0;i<m.size()-1;i++){
char c;
if (m[i]==-1 || f[i]==-1){
c='F';
}else if (m[i]+f[i]>=80){
c='A';
}else if (m[i]+f[i]>=65){
c='B';
}else if (m[i]+f[i]>=50){
c='C';
}else if (m[i]+f[i]>=30){
if (r[i]>=50){
c='C';
}else{
c='D';
}
}else{
c='F';
}
cout<<c<<endl;
}
return 0;
}
| 0
| 75,623,963
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
string s =to_string(n);
if(count(s.begin(),s.end(),'7')>0){
cout<<"Yes\n";
}
else{
cout<<"No\n";
}
return 0;
}
|
# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <math.h>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi acos(-1.0)
# define MAXN 100005
# define eps 1e-5
# define MAXM 500001
# define MOD 1000000007
# define INF 1000000000
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
typedef long long LL;
typedef unsigned long long ULL;
int _MAX(int a, int b){return a>b?a:b;}
int _MIN(int a, int b){return a>b?b:a;}
int main ()
{
int n;
scanf("%d",&n);
LL l=0, r=n, mid;
while (l<r) {
mid=(l+r)>>1;
if (mid*(mid-1)/2+mid>=n) r=mid;
else l=mid+1;
}
printf("%d\n",r);
n-=r;
for (int i=r-1; i>=1&&n; --i) {
if (n<=i) {printf("%d\n",n); break;}
else {printf("%d\n",i); n-=i;}
}
return 0;
}
| 0
| 39,660,917
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int m; cin >> m;
vector<ll> D(m), C(m);
ll ans = 0;
ll cur = 0;
rep(i, m) {
cin >> D[i] >> C[i];
ll sum = D[i]*C[i];
ll carry = sum/9-(sum%9==0);
ll rem = (sum%9==0 ? 9 : sum%9);
ans += C[i]-(i==0)+carry;
cur += rem;
if(cur > 9) {
ans++;
cur -= 9;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';
using ll = long long int;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
int main(){
int n,k;
cin >> n >> k;
cout << (k==1 ? 0 : n-k) << endl;
}
| 0
| 83,714,787
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
#define PL pair<ll,ll>
#define ALL(v) (v).begin(), (v).end()
int main(){
ll N; cin>>N;
VL A(N);
ll ans=0;
rep(i,0,N)cin>>A[i];
rep(i,0,N){
rep(j,0,N){
if(i==j)continue;
ans=max(abs(A[i]-A[j]),ans);
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define umap unordered_map
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define MN(a,b,c) min(a,min(b,c))
#define pr pair<ll,ll>
#define F first
#define S second
#define mP make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define f1(i,x,y) for(int i=x;i<=y;i++)
#define f2(i,x,y) for(int i=x;i>=y;i--)
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;cin>>n;
ll ans=0;
f1(i,1,n)
{
ll k=n/i;
ll term=(k*((k+1)*i))/2;
ans+=term;
}
cout<<ans;
}
| 0
| 56,187,598
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using ll=long long;
using namespace std;
int main(){
ll a;
double b;
cin>>a>>b;
ll ib=100*b+0.5;
a*=ib;
a/=100;
cout<<a<<endl;
}
|
#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;
ll N;
string S;
bool dp1[10], dp2[100], dp3[1000];
signed main(){
cin >> N >> S;
REP(i, N){
ll n = S[i] - '0';
REP(j, 100) dp3[j * 10 + n] |= dp2[j];
REP(j, 10) dp2[j * 10 + n] |= dp1[j];
dp1[n] = true;
}
ll ans = 0;
REP(i, 1000) ans += (dp3[i] == true);
PRINT(ans);
return 0;
}
| 0
| 34,432,510
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <string>
#include <utility>
#include <map>
#include <queue>
#include <list>
#include <functional>
#include <numeric>
#include <stack>
#include <tuple>
using namespace std;
int dx[4] = { -1,0,1,0 };
int dy[4] = { 0,1,0,-1 };
const int INF = 100000000;
const long long LINF = 1000000000000000000;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-6;
using pii = std::pair<int, int>;
using pLL = std::pair<long long, long long>;
using ll = long long;
#define SORT(v) std::sort(v.begin(), v.end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
priority_queue<int> que;
string s;
int a;
cin >> s;
while (s != "end") {
if (s == "insert") {
cin >> a;
que.push(a);
}
else if(s == "extract"){
cout << que.top() << endl;
if (!que.empty()) {
que.pop();
}
}
cin >> s;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int,int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main(){
int n;
string s;
cin>>n>>s;
ll r=0,g=0,b=0;
rep(i,n){
if(s[i]=='R')r++;
else if(s[i]=='G')g++;
else b++;
}
ll del = 0;
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
if(j+(j-i)>=n)continue;
if(s[i]==s[j])continue;
if(s[j]==s[j+j-i])continue;
if(s[i]==s[j+j-i])continue;
del++;
}
}
cout << r*g*b - del << endl;
return 0;
}
| 0
| 52,864,291
|
#include <bits/stdc++.h>
using namespace std;
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 all(a) (a).begin(), (a).end()
int main()
{
int r;
cin >> r;
cout << ((r < 1200) ? "ABC" : (r < 2800) ? "ARC" : "AGC") << '\n';
return 0;
}
|
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define ll long long
using namespace std;
template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int lcm(int a, int b)
{
return a * b / gcd(a, b);
}
int main()
{
int n, k;
cin >> n >> k;
vector<int> al(n);
rep(i, n) {
cin >> al[i];
}
int min = *min_element(al.begin(), al.end());
int count = 0;
int minc = 0;
rep(i, n) {
if (min != al[i])
{
count++;
}
}
int ans = count / (k - 1);
if (count % (k - 1) != 0) {
ans++;
}
cout << ans << endl;
system("pause");
}
| 0
| 32,535,363
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
int main(){
ll N, H, W;
cin >> N >> H >> W;
int cnt=0;
for(int i=0; i<N; i++){
ll A, B;
cin >> A >> B;
if(A>=H && B>=W) cnt++;
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string s; cin >> s;
int left = 0;
int pointer = 0;
for (int i = 0; i < n; i++) {
if (0 < pointer) {
if (s[i] == '(') {
pointer++;
}
else {
pointer--;
}
}
else {
if (s[i] == '(') {
pointer++;
}
else {
left++;
}
}
}
string ans = "";
while (left--) {
ans += "(";
}
ans += s;
while (pointer--) {
ans += ")";
}
cout << ans << endl;
return 0;
}
| 0
| 48,517,471
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int w,h,n; cin>>w>>h>>n;
vector<vector<int>> v(w,vector<int>(h));
rep(i,n){
int x,y,a; cin>>x>>y>>a;
if(a==1){
for(int i=0; i<x; i++){
for(int j=0; j<h; j++){
v[i][j]=1;
}
}
}
if(a==2){
for(int i=x; i<w; i++){
for(int j=0; j<h; j++){
v[i][j]=1;
}
}
}
if(a==3){
for(int i=0; i<w; i++){
for(int j=0; j<y; j++){
v[i][j]=1;
}
}
}
if(a==4){
for(int i=0; i<w; i++){
for(int j=y; j<h; j++){
v[i][j]=1;
}
}
}
}
int cnt=0;
for(int i=0; i<w; i++){
for(int j=0; j<h; j++){
if(v[i][j]==0) cnt++;
}
}
cout<<cnt<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
string A,B;
cin >> A >> B;
if(A.size() > B.size()){
cout << "GREATER";
}
else if(A.size() < B.size()){
cout << "LESS";
}
else{
rep(i,A.size()){
if(A[i] > B[i]){
cout << "GREATER";
return 0;
}
else if(A[i] < B[i]){
cout << "LESS";
return 0;
}
}
cout << "EQUAL";
}
}
| 0
| 67,815,976
|
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (int i = (int)n; i >= 0; i--)
#define FORD1(i, n) for (int i = (int)n; i >= 1; i--)
#define FORS(i, n) for(; i < (int)(n); i++)
#define debug(X) { cout << #X << " = " << (X) << endl; }
#define printArr(A,n) { cout << #A << " = "; FOR(i,n) cout << A[i] << ' '; cout << endl; }
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n;cin >> n;
map<int, int> cnt;
int in;
FOR(i, n){
cin >> in;
cnt[in]++;
}
vi temp;
for(pii tem:cnt)temp.pb(tem.second);
sort(temp.begin(), temp.end(), greater<int>());
vector<int> pre(n+1);
FORD0(i, temp.size() -1){
pre[i] = pre[i+1] + temp[i];
}
int tot = n;
int loc = 0;
int ans = n;
FOR1(i, n){
while(ans != (loc * ans + pre[loc])/i){
ans = (loc*ans + pre[loc])/i;
}
if(i > temp.size()){
cout << 0 <<endl;
continue;
}
while(loc < temp.size() && ans < temp[loc]){
loc++;
while(ans != (loc* ans + pre[loc])/i){
ans = (loc*ans + pre[loc])/i;
}
}
cout << ans <<endl;
}
}
|
#include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define minimize(a,b) (a>(b)?a=(b),1:0)
#define maximize(a,b) (a<(b)?a=(b),1:0)
#define ceil(a,b) (((a)+(b)-1)/(b))
#define yn(i) ((i)?"Yes":"No")
#define chmin(a,b) (a>(b)?a=(b),1:0)
#define abs(n) max((n),-(n))
#define dist(a,b) max((a)-(b),(b)-(a))
#define chmax(a,b) (a<(b)?a=(b),1:0)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define MOD 1000000000
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
template< template<class ...> class Ctn,class T>
std::ostream& operator<<(std::ostream& os,const Ctn<T>& v){
auto itr=v.begin();
while(itr!=v.end()){
if(itr!=v.begin())cout << " ";
cout << *(itr++);
}
return os;
}
string key="keyence";
void add(char m,string s,set<string> st){
int n=s.size();
rep(i,n){
if(s[i]!=m) continue;
string t;
repa(j,i,n){
t.push_back(s[j]);
st.insert(t);
}
}
}
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
int main(){
int n; li k; cin >>n >>k;
map<int,li> mp;
rep(i,n){
li a,b; cin >>a >>b;
mp[a]+=b;
}
li s=0;
auto itr=mp.begin();
while(s<k){
s+=itr->second;
itr++;
}
itr--;
print(itr->first);
}
| 0
| 81,845,395
|
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
struct UnionFind {
private:
vector<int> uf;
size_t sz;
public:
UnionFind(size_t Size) {
uf.assign(Size, -1);
sz = Size;
}
int find(int x) { return (uf[x] < 0) ? x : uf[x] = find(uf[x]); }
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return -uf[find(x)]; }
int size() { return sz; }
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y) { return; }
--sz;
if (uf[y] < uf[x]) { swap(x, y); }
uf[x] += uf[y];
uf[y] = x;
}
};
int main() {
int N, Q;
cin >> N >> Q;
UnionFind uf(N);
vector<int> ans;
for (int i = 0; i < Q; ++i) {
int t, u, v;
cin >> t >> u >> v;
if (t) { ans.emplace_back(uf.same(u, v)); }
else { uf.unite(u, v); }
}
for (auto v : ans) { cout << v << "\n"; }
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>
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int main(){
std::vector<int> a(5);
int last=0, buf=10;
for(int i=0; i<5; i++){
std::cin >> a[i];
if(a[i]%10<buf && a[i]%10!=0){
buf = a[i]%10;
last = i;
}
}
int ans = 0;
for(int i=0; i<5; i++){
if(i==last){
ans += a[i];
}else{
if(a[i]%10){
ans += a[i] + 10 - a[i]%10;
}else{
ans += a[i];
}
}
}
std::cout << ans << "\n";
return 0;
}
| 0
| 59,319,587
|
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>
typedef long long ll;
#define mop 1000000007
using namespace std;
int main() {
long double ans = 0;
ll n;
cin >> n;
static const ll MAX = 201;
ll t[MAX] = {};
ll v[MAX] = {};
for (ll i=1;i<=n;i++){
cin >> t[i];
}
for (ll i=1;i<=n;i++){
cin >> v[i];
}
ll tsum[MAX] = {};
ll tmp = 0;
for (ll i=1;i<=n;i++){
tmp += t[i];
tsum[i] = tmp;
}
ll vnow = 0;
ll lim1, lim2;
lim1 = mop;
lim2 = 0;
ll tidx = 1;
for (ll i=0;i<tsum[n];i++){
if(i == tsum[tidx-1]){
lim2 = v[tidx];
tidx++;
}
ll tmp = 0;
lim1 = mop;
for (ll j=tidx-1;j<=n;j++){
tmp = tsum[j] - i + v[j+1];
if(lim1 > tmp){
lim1 = tmp;
}
}
if(lim1 - vnow >= 2){
if(lim2 - vnow >= 1){
ans += vnow + 0.5;
vnow++;
}else{
ans += vnow;
}
}else if(lim1 - vnow == 1){
if(lim2 - vnow >= 1){
ans += vnow + 0.25;
}else{
ans += vnow;
}
}else{
ans += vnow - 0.5;
vnow--;
}
}
cout << fixed;
cout << setprecision(5);
cout << ans << endl;
}
|
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
int pointT = 0, pointH = 0;
string taro, hanako;
cin >> n;
for( int i = 0; i < n; i++ )
{
cin >> taro >> hanako;
int count = 0;
if( taro.size() > hanako.size() )
for( int j = 0; j < hanako.size(); j++ )
{
if( taro[j] > hanako[j] )
{
pointT += 3;
break;
}
else if( taro[j] == hanako[j] )
{
count++;
if( count == hanako.size() )
pointT += 3;
}
else
{
pointH += 3;
break;
}
}
else if( taro.size() < hanako.size() )
for( int j = 0; j < taro.size(); j++ )
{
if( taro[j] > hanako[j] )
{
pointT += 3;
break;
}
else if( taro[j] == hanako[j] )
{
count++;
if( count == taro.size() )
pointH += 3;
}
else
{
pointH += 3;
break;
}
}
else
for( int j = 0; j < hanako.size(); j++ )
{
if( taro[j] > hanako[j] )
{
pointT += 3;
break;
}
else if( taro[j] == hanako[j] )
{
count++;
if( count == hanako.size() )
{
pointT += 1;
pointH += 1;
}
}
else
{
pointH += 3;
break;
}
}
}
cout << pointT << " " << pointH << endl;
return 0;
}
| 0
| 89,321,519
|
#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 mod = 1e9+7;
vector<int> a[30];
void solve() {
int n; string s; cin >> n >> s;
for (int i = 0; i < n; ++i) {
a[s[i]-'a'].push_back(i);
}
long long ans = 0;
for (int i = 0; i < n; ++i) {
int skip = s[i]-'a';
long long cur = 1;
for (int j = 0; j < 26; ++j) {
if (j == skip) continue;
if (a[j].empty()) continue;
int x = a[j].size()-(lower_bound(a[j].begin(), a[j].end(), i)-a[j].begin());
if (!x) continue;
(cur *= x+1) %= mod;
}
(ans += cur) %= mod;
}
printf("%lld", ans);
}
int main() {
init();
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
#define u64 uint64_t
#define ll long long
#define endl "\n"
#define pi acos(-1)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int main()
{
fast
ll n,m,x,y,i,j,k,p,f=0,tc,cnt=0,sum=0,pro=1,mi=1e18,ma=-1e18;
string str;
char ch;
double db;
deque<ll>dq;
map<ll,ll>mp;
set<ll>st;
vector<ll>vt;
ll h1,h2,m1,m2,h;
cin>>h1>>m1>>h2>>m2>>x;
ll t1=h1*60+m1;
ll t2=h2*60+m2;
if(t1<=t2)
cout<<t2-t1-x<<endl;
else
{
n=t2;
n+=(24*60-t1);
cout<<n-x<<endl;
}
return 0;
}
| 0
| 4,149,682
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t;
ll a,b=0,c=0,d=0,e=0;
cin>>a>>b>>c;
if(a%b!=0){
d=(a/b)+1;
}
else{d=(a/b);}
cout<<c*d<<endl;
}
|
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fil(a,b) memset((a),(b),sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef pair<ll,ll> PA;
typedef vector<int> poly;
inline ll read(){
ll x=0,f=1;char c=getchar();
while ((c<'0'||c>'9')&&(c!='-')) c=getchar();
if (c=='-') f=-1,c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
int main(){
ll n=read(),ans=0;
for (ll l=1,r=1;l<=n;l=++r){
r=n/(n/l);
ll k=n/l;
if (n%k==0){
ll x=n/k-1;
if (x==0) continue;
if (n%x==n/x) ans+=x;
}
}
printf("%lld\n",ans);
}
| 0
| 14,265,884
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
int n;
cin>>n;
vector<int>cnt(n+1),cnt1(n+1);
for(int i=0;i<n;i++){
int a;
cin>>a;
cnt[a]++;
}
for(int i=1;i<=n;i++)cnt1[cnt[i]]++;
vector<int>pref(n+1),prefx(n+1);
prefx[0] = cnt1[0];
for(int i=1;i<=n;i++)pref[i]=pref[i-1]+cnt1[i]*i;
for(int i=1;i<=n;i++)prefx[i]=prefx[i-1]+cnt1[i];
vector<int>f(n+1,0);
for(int i=1;i<=n;i++){
f[i] = (pref[i]+i*(prefx[n]-prefx[i]))/i;
}
vector<int>ans(n+1);
for(int i=1;i<=n;i++){
ans[f[i]] = max(ans[f[i]],i);
}
for(int i=n-1;i>0;i--)ans[i] = max(ans[i],ans[i+1]);
for(int i=1;i<=n;i++)cout<<ans[i]<<'\n';
}
|
#include <iostream>
#include <cstdio>
#include <math.h>
#include <algorithm>
using namespace std;
const int MAX_N=200000;
int N;
int A[MAX_N],AC[MAX_N],S[MAX_N];
int main(){
cin >> N;
for(int i=0;i<N;i++){
cin >> A[i];
AC[i]=A[i];
}
sort(AC,AC+N,greater<int>());
for(int j=0;j<N;j++){
if(AC[0]==A[j]){
int An=AC[1];
printf("%d\n",An);
}else{
int An=AC[0];
printf("%d\n",An);
}
}
}
| 0
| 37,145,735
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
ll l,r;
int ans = 0;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=0;i<k;i++){
l += i;
}
for(int i=n;i>n-k;i--){
r += i;
}
for(int i=k;i<=n+1;i++){
int add = (r-l+1)%mod;
ans = (ans+add)%mod;
l += i;
r += n-i;
}
printf("%d\n",ans);
}
|
#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
const int N=1e5+10;
int n,k,res,dp[N];
int qmi(int a,int b){
int res=1;
while(b){if(b&1LL) res=res*a%mod; a=a*a%mod; b>>=1LL;}
return res;
}
signed main(){
cin>>n>>k;
for(int i=k;i>=1;i--){
dp[i]=qmi(k/i,n);
for(int j=i*2;j<=k;j+=i) dp[i]=((dp[i]-dp[j])%mod+mod)%mod;
res=(res+i*dp[i]%mod)%mod;
}
cout<<res;
return 0;
}
| 0
| 97,971,836
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i = 0;i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
cout << abs(A.back() - A.front()) << endl;
}
|
#include "bits/stdc++.h"
#include <set>
using namespace std;
#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 rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x)
{
std::cout << x << " ";
}
template <typename T>
void println(T x)
{
std::cout << x << "\n";
}
signed main(void) {
int n;
cin >> n;
map<int, int>a;
rep(i, n) {
int tmp;
cin >> tmp;
a[tmp]++;
}
vector<int>b;
for (auto itr = a.rbegin(); itr != a.rend(); ++itr) {
if (b.size()>= 2)break;
int key = itr->first;
int value = itr->second;
if (value >= 2) {
b.pb(key);
}
if (value >= 4) {
if (b.size() < 2)b.pb(key);
}
}
if (b.size() < 2) {
print(0);
}
else {
print(b[0] * b[1]);
}
}
| 0
| 51,398,248
|
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typedef long long ll;
using namespace std;
int main(){
ll n,m;
cin>>n>>m;
vector<pair<ll,ll>> a(n);
for(int i=0;i<n;i++){
cin>>a[i].first>>a[i].second;
}
sort(a.begin(),a.end());
ll ans=0;
for(int i=0;i<n;i++){
if(m==0){
break;
}
ans+=(min(m,a[i].second)*a[i].first);
m-=min(m,a[i].second);
}
cout<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,m;
cin>>n>>m;
char fi1[n][n];
char fi2[m][m];
rep(i,n){
rep(j,n){
cin>>fi1[i][j];
}
}
rep(i,m){
rep(j,m){
cin>>fi2[i][j];
}
}
for(int i=0;i<=n-m;i++){
for(int j=0;j<=n-m;j++){
bool ok=true;
rep(k,m){
rep(l,m){
if(fi1[i+k][j+l]!=fi2[k][l]) ok=false;
}
}
if(ok){
cout<<"Yes"<<endl;
return 0;
}
}
}
cout<<"No"<<endl;
}
| 0
| 79,868,743
|
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
const double PI=3.14159265358979323846;
const in MOD = 1000000007;
const in INF=1e18+7;
const int inf=1e9+7;
using P=pair<int,int>;
vector<int> dx={0,1,-1,0};
vector<int> dy={1,0,0,-1};
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout << fixed << setprecision(10);
int n,q;
cin>>n>>q;
int x,y,z;
dsu uf(n);
rep(i,q){
cin>>x>>y>>z;
if(x) cout<<uf.same(y,z)<<endl;
else uf.merge(y,z);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const ll MAX = 1e18;
int main() {
ios_base::sync_with_stdio(false);
int n; cin >> n;
ll ans = 1;
while(n--) {
ll x; cin >> x;
if(!x) { ans = 0; break; }
if(MAX/ans < x) ans = -1;
if(ans != -1) ans *= x;
}
cout << (ans>MAX?-1:ans) << endl;
return 0;
}
| 0
| 98,301,579
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<ld> vld;
typedef pair<ll, ll> pll;
int main()
{
ll t, i, j, k, ans, n, m, sum = 0, x;
t = 1;
while (t--)
{
cin >> n >> m;
string s;
vll wa(n + 1), ac(n + 1);
ll c1 = 0, c2 = 0;
rep(p, 0, m)
{
cin >> x >> s;
if (s == "WA")
wa[x]++;
else
{
if (ac[x] == 0)
{
c1++;
c2 += wa[x];
ac[x] = 1;
}
}
}
cout << c1 << " " << c2;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }
template<class T> void operator>> (istream& ist, vector<T>& vs) { for(auto& e: vs) cin >> e; }
typedef long long ll;
int const inf = 1<<29;
int main() {
int M, N[2];
for(; cin >> M >> N[0] >> N[1] && M;) {
vector<int> vs(M); cin >> vs;
int maxgap = 0;
int maxnum = -1;
REP(num, N[0], N[1] + 1) {
if(maxgap <= vs[num - 1] - vs[num]) {
maxgap = vs[num - 1] - vs[num];
maxnum = num;
}
}
cout << maxnum << endl;
}
return 0;
}
| 0
| 25,336,759
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
vector<string> S(10010);
cin >> N; int ans = 0;
int A = 0, B = 0, BA = 0;
for(int i=0; i<N; i++){
cin >> S[i]; int l = S[i].length();
for(int j=0; j<l-1; j++){
if(S[i][j] == 'A' && S[i][j+1] == 'B') ans++;
}
if(S[i][0] == 'B' && S[i][l-1] == 'A'){
BA++;
} else if (S[i][0] == 'B'){
B++;
} else if (S[i][l-1] == 'A'){
A++;
}
}
if(BA >= 1){
ans += BA-1;
if(A>0){ans++; A--;}
if(B>0){ans++; B--;}
}
ans += min(A,B);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
vector<ll> enum_divisors(ll n){
vector<ll> res;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
res.push_back(i);
if(i!=n/i) res.push_back(n/i);
}
}
sort(res.begin(), res.end());
return res;
}
int cnt_digits(ll X){
int cnt=0;
while(X>0){
X/=10;
cnt++;
}
return cnt;
}
int main(){
ll n;
cin>>n;
auto ed=enum_divisors(n);
int ans=INF;
for(auto a : ed){
ll b=n/a;
int tmp=max(cnt_digits(a),cnt_digits(b));
ans=min(ans,tmp);
}
cout<<ans<<endl;
}
| 0
| 52,950,379
|
#include<iostream>
#include <string>
#include <iomanip>
using namespace std;
int main()
{
double L;
cin >> L;
double x = L / 3;
cout << fixed << setprecision(20) << x * x * x << endl;
}
|
/*http:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
while (cin>>n && n>0){
vector<int> s;
for (int i=0;i<n;i++){
int tmp;
cin>>tmp;
s.push_back(tmp);
}
sort(s.begin(),s.end());
cout<<accumulate(++s.begin(),--s.end(),0)/(n-2)<<endl;
}
return 0;
}
| 0
| 54,675,169
|
#include<iostream>
int n,i;main(){std::cin>>n;while((i*i+i)/2<n)i++;while(i){if(n-i>=0)std::cout<<i<<'\n',n-=i;i--;}}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
int C;
if (i % 2 == 0){
if (A % 2 == 1){
A--;
}
A = A/2;
B += A;
}
else {
if (B % 2 == 1){
B--;
}
B = B/2;
A += B;
}
}
cout << A << ' ' << B << endl;
}
| 0
| 55,257,965
|
#define _USE_MATH_DEFINES
#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()
const long long MOD = 1e9 + 7;
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;
}
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
rep(i, 1000) {
string l;
if(i < 10)
l += "00";
else if(i < 100)
l += "0";
l += to_string(i);
int f = 0;
for(auto j : S) {
if(l[f] == j) f++;
if(f == 3) {
ans++;
break;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int64_t solve(int64_t H, int64_t W){
const int64_t S= H* W;
int64_t slice= min(H, W);
int64_t ans= slice;
for(int Wcut= W/3; Wcut<= W/3+ 1; Wcut++){
if(Wcut==0){ continue; }
else{
vector<int64_t> cross;
cross.emplace_back(H* Wcut);
int64_t Wremain= W- Wcut;
cross.emplace_back( (H/2)* Wremain);
cross.emplace_back(((H+1)/2)* Wremain);
int64_t Smax= *max_element(cross.begin(), cross.end());
int64_t Smin= *min_element(cross.begin(), cross.end());
ans= min(ans, Smax- Smin);
}
}
for(int Hcut= H/3; Hcut<= H/3+ 1; Hcut++){
if(Hcut==0){ continue; }
else{
vector<int64_t> cross;
cross.emplace_back(Hcut* W);
int64_t Hremain= H- Hcut;
cross.emplace_back(Hremain* ( W/2));
cross.emplace_back(Hremain* ((W+1)/2));
int64_t Smax= *max_element(cross.begin(), cross.end());
int64_t Smin= *min_element(cross.begin(), cross.end());
ans= min(ans, Smax- Smin);
}
}
return ans;
}
int main(){
int64_t H,W;
cin >> H >> W;
int64_t ans= (H==2 && W==2 ) ? 1
:(H%3==0 || W%3==0) ? 0
: solve(H, W);
cout << ans << endl;
}
| 0
| 24,527,665
|
#include<bits/stdc++.h>
using namespace std;
int main(){
char s,t;
cin>>s>>t;
if(s>t){
cout<<">"<<endl;
}
else if(s<t){
cout<<"<"<<endl;
}
else{
cout<<"="<<endl;
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
vector<ll> v;
void dfs(ll val, int len){
v.push_back(val);
if(len == 10) return;
int i = val%10;
for(int j = -1; j <= 1; j++){
if(i+j < 0 || i+j > 9) continue;
dfs(val*10+i+j, len+1);
}
}
int main(){
int k;
cin >> k;
for(int i = 1; i <= 9; i++) dfs(i, 1);
sort(v.begin(), v.end());
v.erase(unique(v.begin(),v.end()),v.end());
cout << v[k-1] << endl;
return 0;
}
| 0
| 3,672,302
|
#include <iostream>
using namespace std;
class Dice {
public:
int face[6];
int getRightFace(int up, int front);
};
int Dice::getRightFace(int up, int front)
{
if ((up == face[1] && front == face[2]) ||
(up == face[2] && front == face[4]) ||
(up == face[3] && front == face[1]) ||
(up == face[4] && front == face[3])) {
return face[0];
}
if ((up == face[0] && front == face[3]) ||
(up == face[2] && front == face[0]) ||
(up == face[3] && front == face[5]) ||
(up == face[5] && front == face[2])) {
return face[1];
}
if ((up == face[0] && front == face[1]) ||
(up == face[1] && front == face[5]) ||
(up == face[4] && front == face[0]) ||
(up == face[5] && front == face[4])) {
return face[2];
}
if ((up == face[0] && front == face[4]) ||
(up == face[1] && front == face[0]) ||
(up == face[4] && front == face[5]) ||
(up == face[5] && front == face[1])) {
return face[3];
}
if ((up == face[0] && front == face[2]) ||
(up == face[2] && front == face[5]) ||
(up == face[3] && front == face[0]) ||
(up == face[5] && front == face[3])) {
return face[4];
}
return face[5];
}
int main()
{
Dice dice;
for (int i = 0; i < 6; i++) {
cin >> dice.face[i];
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int up, front;
cin >> up >> front;
cout << dice.getRightFace(up, front) << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define ggr getchar();getchar();return 0;
#define prique priority_queue
constexpr auto mod = 1000000007;
#define inf 1e15
#define key 1e9
using namespace std;
typedef pair<int, int>P;
template<class T> inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template<class T> inline void chmin(T& a, T b) {
a = std::min(a, b);
}
const int MAX = 2330000;
int 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 COMB(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;
}
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)cnt++;
}
if (cnt != 1)return false;
else return n != 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= (i % mod); res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
class UnionFind {
protected:
int* par, * rank, * size;
public:
UnionFind(unsigned int size) {
par = new int[size];
rank = new int[size];
this->size = new int[size];
rep(i, size) {
par[i] = i;
rank[i] = 0;
this->size[i] = 1;
}
}
int find(int n) {
if (par[n] == n)return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m)return;
if (rank[n] < rank[m]) {
par[n] = m;
size[m] += size[n];
}
else {
par[m] = n;
size[n] += size[m];
if (rank[n] == rank[m])rank[n]++;
}
}
bool same(int n, int m) {
return find(n) == find(m);
}
int getsize(int n) {
return size[find(n)];
}
};
int dight(int n) {
int ans = 1;
while (n >= 10) {
n /= 10;
ans++;
}
return ans;
}
int dight_sum(int n) {
int sum = 0;
rep(i, 20)sum += (n % (int)pow(10, i + 1)) / (pow(10, i));
return sum;
}
int dight_min(int n) {
int ans = 9;
while (n >= 10) {
ans = min(ans, n % 10);
n /= 10;
}
ans = min(ans, n);
return ans;
}
int dight_max(int n) {
int ans = 0;
while (n >= 10) {
ans = max(ans, n % 10);
n /= 10;
}
ans = max(ans, n);
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int f(int l, int x) {
if (l == 1 && x == 1)return 1;
if (x == 1)return 0;
if (x <= pow(2, l) - 2)return f(l - 1, x - 1);
if (x == pow(2, l) - 1)return f(l - 1, x - 2) + 1;
if (x != pow(2, l + 1) - 3)return f(l - 1, pow(2, l) - 3) + f(l - 1, x - pow(2, l) + 1) + 1;
return f(l - 1, pow(2, l) - 3) * 2 + 1;
}
signed main() {
int n, x;
cin >> n >> x;
n++;
cout << f(n, x) << endl;
ggr
}
| 0
| 94,608,511
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, K;
cin >> A >> B >> K;
if(K <= A){
cout << (A - K) << ' ' << B << endl;
}else if (K <= A + B){
cout << 0 << ' ' << (A + B - K) << endl;
}else{
cout << 0 << ' ' << 0 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Point=pair<int, int>;
void solve() {
int h,w,n;
cin >> h >> w >> n;
set<Point> st;
for (int _ = 0; _ < n; _++) {
int x,y;
cin >> x >> y;
st.insert({x,y});
}
set<Point> trk;
vector<ll> cnt(10, 0);
for (auto& p: st) {
int x,y;
tie(x,y) = p;
for (int u = x-2; u <= x; u++) {
for (int v = y-2; v <= y; v++) {
if (u <= 0 || v <= 0) continue;
if (u+2 > h || v+2 > w) continue;
if (trk.find({u,v}) != trk.end()) continue;
int sum = 0;
for (int i = u; i < u+3; i++) {
for (int j = v; j < v+3; j++) {
if (st.find({i,j}) != st.end()) sum++;
}
}
cnt[sum]++;
trk.insert({u,v});
}
}
}
ll sum = 0;
for (int i = 1; i < 10; i++) {
sum += cnt[i];
}
cnt[0] = 1ll*(h-2)*(w-2) - sum;
for (auto& x: cnt) {
cout << x << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| 0
| 36,354,450
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> ar(n);
for(int i=0;i<n;++i)
{
cin>>ar[i];
}
vector<int> dp(n+1,0);
dp[1]=0;
dp[2]=abs(ar[1]-ar[0]);
for(int i=3;i<=n;++i)
{
dp[i]=min(dp[i-1]+abs(ar[i-1]-ar[i-2]),dp[i-2]+abs(ar[i-1]-ar[i-3]));
}
cout<<dp[n]<<'\n';
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main(){
int n;
cin >> n;
string s;
cin >> s;
vector<int> r(n+1);
vector<int> g(n+1);
vector<int> b(n+1);
for(int i=n-1; i>=0; i--){
r[i]=r[i+1];
g[i]=g[i+1];
b[i]=b[i+1];
if(s[i]=='R'){
r[i]++;
} else if(s[i]=='G'){
g[i]++;
} else {
b[i]++;
}
}
ll ans=0;
rep(i, n){
for(int j=i+1; j<n; j++){
if((s[i]=='R'&&s[j]=='G')||(s[i]=='G'&&s[j]=='R')){
ans+=b[j+1];
if(2*j-i<n && s[2*j-i]=='B'){
ans--;
}
} else if((s[i]=='G'&&s[j]=='B')||(s[i]=='B'&&s[j]=='G')){
ans+=r[j+1];
if(2*j-i<n && s[2*j-i]=='R'){
ans--;
}
} else if((s[i]=='B'&&s[j]=='R')||(s[i]=='R'&&s[j]=='B')){
ans+=g[j+1];
if(2*j-i<n && s[2*j-i]=='G'){
ans--;
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 61,479,201
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int N, X;
cin >> N >> X;
long long int max_length=1;
int n=0;
vector<long long int> max_p_num(N+1, 0);
max_p_num[0] = 1;
while(n<N) {
max_length *= 2;
max_length += 3;
max_p_num[n+1] = max_p_num[n]*2+1;
n++;
}
long long int s=1, e=max_length;
long long int cur=(s+e)/2;
long long int ans=0;
long long int curN=N-1;
if(cur==X) {
ans = max_p_num[curN]+1;
}
while(cur!=X) {
if(cur<X) {
if(curN>=0) {
ans += max_p_num[curN]+1;
} else {
ans += 1;
break;
}
s = cur+1;
if(e!=X) {
e--;
} else {
ans += max_p_num[curN];
break;
}
cur = (s+e)/2;
if(cur==X) {
if(curN>0) {
ans += max_p_num[curN-1]+1;
} else if(curN==0) {
ans += 1;
}
}
} else if(cur>X) {
e = cur-1;
if(s!=X) {
s++;
} else {
break;
}
cur = (s+e)/2;
if(cur==X) {
if(curN>0) {
ans += max_p_num[curN-1]+1;
} else if(curN==0) {
ans += 1;
}
}
}
curN--;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
void ans(bool b) {
cout << (b ? "Possible" : "Impossible") << endl;
exit(0);
}
int main() {
int64_t N;
cin >> N;
vector<int64_t> a(N);
for (int64_t& A : a) {
cin >> A;
}
int64_t one_num = count(a.begin(), a.end(), 1);
if (one_num == 1) {
int64_t two_num = count(a.begin(), a.end(), 2);
ans(two_num == N - 1);
} else if (one_num >= 2) {
ans(N == 2);
}
int64_t max_value = *max_element(a.begin(), a.end());
int64_t max_num = count(a.begin(), a.end(), max_value);
if (max_num == 1) {
ans(false);
}
int64_t min_value;
if (max_value % 2 == 0) {
min_value = max_value / 2;
int64_t min_num = count(a.begin(), a.end(), min_value);
if (min_num != 1) {
ans(false);
}
} else {
min_value = max_value / 2 + 1;
int64_t min_num = count(a.begin(), a.end(), min_value);
if (min_num != 2) {
ans(false);
}
}
int64_t ng_num = count_if(a.begin(), a.end(), [min_value](int64_t v) { return v < min_value; });
if (ng_num > 0) {
ans(false);
}
for (int64_t i = min_value + 1; i <= max_value; i++) {
int64_t num = count(a.begin(), a.end(), i);
if (num <= 1) {
ans(false);
}
}
ans(true);
}
| 0
| 62,222,852
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,d,a;
cin >> n >> d >> a;
vector<pair<ll,ll>> mon(n);
for(int i = 0;i < n;i++){
int pos,hp;
cin >> pos >> hp;
mon[i] = make_pair(pos,hp);
}
sort(mon.begin(),mon.end());
vector<ll> posmemo(n);
for(int i = 0;i < n;i++)posmemo[i] = mon[i].first;
vector<ll> range(n);
for(int i = 0;i < n;i++){
range[i] = upper_bound(posmemo.begin(),posmemo.end(),posmemo[i] + 2 * d) - posmemo.begin() - 1;
}
ll res = 0;
vector<ll> ruiseki(n);
vector<ll> now(n);
for(int i = 0;i < n;i++)ruiseki[i] = 0,now[i] = 0;
for(int i = 0;i < n;i++){
if(i >= 1)now[i] = now[i - 1] + ruiseki[i];
if(now[i] < mon[i].second){
ll add = 0;
add = (mon[i].second - now[i]) / a;
if((mon[i].second - now[i]) % a != 0)add++;
now[i] += add * a;
ruiseki[i] += add * a;
if(range[i] < n - 1)ruiseki[range[i] + 1] -= add * a;
res += add;
}
}
cout << res << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
unsigned X, Y, Z, K;
scanf("%u %u %u %u", &X, &Y, &Z, &K);
ull A[X];
for(int i = 0; i < X; ++i){
scanf("%llu", A + i);
}
ull B[Y];
for(int i = 0; i < Y; ++i){
scanf("%llu", B + i);
}
ull C[Z];
for(int i = 0; i < Z; ++i){
scanf("%llu", C + i);
}
if(X > K){
nth_element(A, A + K - 1, A + X, greater<ull>());
X = K;
}
if(Y > K){
nth_element(B, B + K - 1, B + Y, greater<ull>());
Y = K;
}
if(Z > K){
nth_element(C, C + K - 1, C + Z, greater<ull>());
Z = K;
}
ull ab[X*Y];
for (size_t i = 0; i < X; i++){
for (size_t j = 0; j < Y; j++){
ab[i*Y + j] = A[i] + B[j];
}
}
if(X*Y > K){
nth_element(ab, ab + K - 1, ab + X*Y, greater<ull>());
}
unsigned product = min(X*Y, K);
ull answer[product*Z];
for (size_t i = 0; i < Z; i++){
for (size_t j = 0; j < product; j++){
answer[i*product + j] = C[i] + ab[j];
}
}
partial_sort(answer, answer + K, answer + product*Z, greater<ull>());
for (size_t i = 0; i < K; i++){
printf("%llu\n", answer[i]);
}
return 0;
}
| 0
| 59,594,176
|
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) {
return max(max(a, b), c);
}
int Min(int(a), int(b), int(c)) {
return min(min(a, b), c);
}
int main() {
ll an = 0;
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) {
cin >> a.at(i);
}
rep(i, N - 1) {
if (a.at(i) == a.at(i + 1)) {
a.at(i + 1) = -1;
an++;
}
}
cout << an << endl;
}
|
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
SINT64 N; cin >> N;
vector<SINT64> adata(N);
vector<SINT64> bdata(N);
vector<SINT64> ma(N);
vector<SINT64> ok(N);
rep(i,0,N) {
cin >> adata[i];
}
rep(i,0,N) {
cin >> bdata[i];
}
rep(i,0,N) {
ma[i] = MIN(adata[i],bdata[i]);
}
ok[0] = 1;
ok[N-1] = 1;
if (adata[0] > bdata[0]) {
put(0);
return 0;
}
if (adata[N-1] < bdata[N-1]) {
put(0);
return 0;
}
rep(i,1,N) {
if (adata[i] > adata[i-1]) {
ok[i] = 1;
if (ma[i] < adata[i]) {
put(0);
return 0;
}
}
}
rep(i,0,N-1) {
if (bdata[i] > bdata[i+1]) {
ok[i] = 1;
if (ma[i] < bdata[i]) {
put(0);
return 0;
}
}
}
SINT64 ans = 1;
rep(i,0,N) {
if (ok[i] == 0) {
ans *= ma[i];
ans %= MOD;
}
}
put(ans);
return 0;
}
| 0
| 14,697,118
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main(void)
{
char s[30][30][9];
int h, w,i,j;
scanf("%d %d", &h, &w);
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
scanf("%s", s[i][j]);
}
}
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
if (strcmp(s[i][j], "snuke") == 0) {
printf("%c%d\n", 'A' + j, i + 1);
}
}
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int min(int a,int b){
return a<b?a:b;
}
int main(void){
int a,b;
int ans = 0;
cin >> a >> b;
if(a > b){
int tmp = a;
a = b;
b = tmp;
}
for(int i=1;i<=b;i++){
ans = ans * 10 + a;
}
cout << ans ;
}
| 0
| 99,274,490
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<<#x<<" = "<<(x)<<"\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int,int>;
using P = pair<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int,vector<int>,greater<int>>;
using V = vector<int>;
using ll = long long;
using edge = struct { int to; int cost; };
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main() {
IOS;
int n,h; cin >> n >> h;
int mxa = 0;
int a[n],b[n];
REP(i,n) {
cin >> a[i] >> b[i];
chmax(mxa, a[i]);
}
vector<int> arrb;
REP(i,n) {
if (mxa < b[i]) arrb.push_back(b[i]);
}
sort(ALL(arrb));
int ans = 0;
while(h > 0) {
if (!arrb.empty()) {
int v = arrb.back();
arrb.pop_back();
h-=v;
ans++;
} else {
ans += h/mxa;
if (h%mxa) ans++;
h = 0;
}
}
COUT(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class unionfind {
vector<int> par;
public:
unionfind(int n) {
for (int i = 0; i < n; i++) {
par.push_back(i);
}
}
int find(int n) {
if (n == par.at(n)) return n;
return par.at(n) = find(par.at(n));
}
void merge(int m, int n) {
m = find(m); n = find(n);
par.at(m) = n;
}
};
int main() {
int n, m;
cin >> n >> m;
vector<int> p(n), x(m), y(m);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
p.at(i)--;
}
for (int i = 0; i < m; i++) {
cin >> x.at(i) >> y.at(i);
x.at(i)--;
y.at(i)--;
}
unionfind t(n);
for (int i = 0; i < m; i++) {
t.merge(x.at(i), y.at(i));
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (t.find(i) == t.find(p.at(i))) {
ans++;
}
}
cout << ans << endl;
}
| 0
| 8,004,911
|
#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;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
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 n;cin >> n;
vector<string> s(n);
rep(i,n) cin >> s[i];
vi AB(n),A(n),B(n);
rep(i,n){
int num=(int)s[i].size();
s[i]+='#';
rep(j,num){
if(s[i][j]=='A'&&s[i][j+1]=='B'){
AB[i]++;
j++;
}
else if(j==num-1&&s[i][j]=='A'){
A[i]++;
}
else if(j==0&&s[i][j]=='B'){
B[i]++;
}
}
}
int ans=0;
int BA=0,AA=0,BB=0;
rep(i,n){
ans+=AB[i];
if(A[i]&&B[i]) BA++;
else if(A[i]) AA++;
else if(B[i]) BB++;
}
if(BA>0){
ans+=BA-1+(AA>0)+(BB>0);
if(AA>0) AA--;
if(BB>0) BB--;
ans+=min(AA,BB);
}
else{
ans+=min(AA,BB);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int n;
pair<int,int> ps[100005];
bool cmp(const pair<int,int>&a,const pair<int,int>&b)
{
return a.first > b.first;
}
int main()
{
set<int> ss;
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%d",&ps[i].first);
ps[i].second = i+1;
}
sort(ps,ps+n,cmp);
ss.insert(ps[0].second);
int l,r;
long long ans = 0;
for(int i=1;i<n;++i)
{
auto pos = ss.upper_bound(ps[i].second);
if(pos!=ss.end()){
auto pos2 = pos;++pos2;
if(pos2==ss.end()) r=n+1;
else r = *pos2;
if(pos!=ss.begin()){
pos2 = pos;--pos2;
l = *pos2;
}else l=0;
ans += 1LL*(ps[i].second-l)*(r-*pos)*ps[i].first;
}
auto pos3 = pos;
if(pos!=ss.begin()){
--pos;
auto pos2 = pos;
if(pos2==ss.begin()) l = 0;
else {
--pos2;l=*pos2;
}
if(pos3==ss.end()) r= n+1;
else {
r = *pos3;
}
ans += 1LL*(*pos-l)*(r-ps[i].second)*ps[i].first;
}
ss.insert(ps[i].second);
}
printf("%lld\n",ans);
return 0;
}
| 0
| 65,344,423
|
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define for_(i,a,b) for(int i=a;i<b;++i)
#define ALL(a) a.begin(),a.end()
#define INIT(a,b) memset(a,b,sizeof(a))
using lint = long long int;
int main() {
int N, Q;
cin >> N >> Q;
dsu uf(N);
for_(i,0,Q) {
int t, u, v;
cin >> t >> u >> v;
if (t == 0) uf.merge(u, v);
else puts(uf.same(u, v) ? "1" : "0");
}
}
|
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
string ans = "No";
for(int i = 0; 4 * i <= n; i++) {
for(int j = 0; 7 * j <= n; j++) {
if(4 * i + 7 * j == n) {
ans = "Yes";
break;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 65,723,277
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long H,W;
cin>>H>>W;
long ans=1234567890;
for(long i=0;i<H;i++){
long h1= i;
long h2 = (H-i)/2;
long h3 = H-h1-h2;
long s1 = h1*W;
long s2 = h2*W;
long s3 = h3*W;
long m=min(s1,min(s2,s3));
long M=max(s1,max(s2,s3));
ans = min(ans,M-m);
}
for(long i=0;i<W;i++){
long w1= i;
long w2 = (H-i)/2;
long w3 = H-w1-w2;
long s1 = w1*H;
long s2 = w2*H;
long s3 = w3*H;
long m=min(s1,min(s2,s3));
long M=max(s1,max(s2,s3));
ans = min(ans,M-m);
}
for(long i=0;i<H;i++){
long h1= i;
long h2=H-i;
long h3=H-i;
long w1=W;
long w2= W/2;
long w3= W-w2;
long s1=h1*w1;
long s2=h2*w2;
long s3=h3*w3;
long m=min(s1,min(s2,s3));
long M=max(s1,max(s2,s3));
ans = min(ans,M-m);
}
for(long i=0;i<W;i++){
long w1= i;
long w2=W-i;
long w3=W-i;
long h1=H;
long h2= H/2;
long h3= H-h2;
long s1=h1*w1;
long s2=h2*w2;
long s3=h3*w3;
long m=min(s1,min(s2,s3));
long M=max(s1,max(s2,s3));
ans = min(ans,M-m);
}
cout<<ans<<endl;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define capi(x) int x;cin>>x
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using vi = vector<int>;
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b){if(b<a){a=b;return 1;}return 0;}
class FloydWarshall {
public:
const int size;
vector<vector<int>> distance;
FloydWarshall(const vector<vector<int>>& dist) :
size(dist.size()),
distance(dist) {
for (int k = 0; k < size; ++k) {
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
if (distance[i][j] <= distance[i][k] + distance[k][j]) continue;
distance[i][j] = distance[i][k] + distance[k][j];
}
}
}
}
};
signed main() {
int n, m, r;
cin >> n >> m >> r;
vi vr;
rep(i, r) {
capi(x); --x;
vr.push_back(x);
}
vector<vector<int>> vc(n, vector(n, 1ll << 40));
rep(i, m) {
int a, b, c;
cin >> a >> b >> c;
--a; --b;
vc[a][b] = c;
vc[b][a] = c;
}
rep(i, n) {
vc[i][i] = 0;
}
FloydWarshall fw(vc);
sort(all(vr));
int ans = 1ll << 40;
do {
int res = 0;
rep(i, r - 1) {
res += fw.distance[vr[i]][vr[i + 1]];
}
chmin(ans, res);
} while(next_permutation(all(vr)));
cout << ans;
return 0;
}
| 0
| 87,409,904
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int> a, pair<int, int> b) {
return (a.second < b.second);
}
const int MAX = 200005;
const long long MOD = 1000000007;
const long long MODMOD = 998244353;
const double PI = acos(-1);
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
struct UnionFind {
vector<int> p;
vector<int> s;
void init(int n) {
p.resize(n, -1);
s.resize(n, 1);
}
int find(int n) {
if(p[n] == -1) return n;
else return find(p[n]);
}
int size(int n) {
return s[find(n)];
}
void unite(int n, int m) {
int pn = find(n);
int pm = find(m);
if(pn == pm) return;
if(s[pn] > s[pm]) {
s[pn] = s[pn] + s[pm];
p[pm]= pn;
} else {
s[pm] = s[pm] + s[pn];
p[pn] = pm;
}
}
};
long long gcd(long long a, long long b) {
if(a % b == 0) return b;
else return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int front = 0;
int back = n-1;
cout << front << endl;
string str_front;
cin >> str_front;
if(str_front == "Vacant") return 0;
cout << back << endl;
string str_back;
cin >> str_back;
if(str_back == "Vacant") return 0;
rep(i, 18) {
int mid, dist;
mid = (front + (back - front + 1) / 2) % n;
dist = mid - front;
cout << mid << endl;
string s;
cin >> s;
if(s == "Vacant") break;
else if(dist % 2 == 0) {
if(s == str_front) front = mid;
else back = mid;
}
else {
if(s == str_front) back = mid;
else {
front = mid;
str_front = s;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
int a[n+1];
int b[n+1];
int cnt = 0;
rep(i, n)
{
cin >> a[i];
}
rep(i , n)
{
if(a[a[i]] == i)
cnt++;
}
cout << cnt / 2 << endl;
return (0);
}
| 0
| 8,760,294
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
class Card {
public:
uint8_t suit;
int32_t num;
Card() {
suit = 'S';
num = 1;
}
Card(string str) {
suit = str[0];
num = str[1] - 48;
}
};
bool operator< (const Card &c1, const Card &c2) {
return c1.num < c2.num;
} ;
ostream& operator<< (ostream& os, const Card& c) {
os << c.suit << c.num;
return os;
}
template<typename T>
vector<T> bubble_sort(vector<T> v) {
for (uint32_t i = 0; i < v.size(); i++) {
for (uint32_t j = v.size() - 1; j > i; j--) {
if (v[j] < v[j - 1]) {
swap(v[j], v[j - 1]);
}
}
}
return v;
}
template<typename T>
vector<T> insertion_sort(vector<T> v) {
for (uint32_t i = 0; i < v.size(); i++) {
uint32_t mini = i;
for (uint32_t j = i; j < v.size(); j++) {
if (v[j] < v[mini]) {
mini = j;
}
}
if (i != mini) {
swap(v[i], v[mini]);
}
}
return v;
}
template<typename T>
void print(vector<T> v) {
for (uint32_t i = 0; i < v.size() - 1; i++) {
cout << v[i] << " ";
}
cout << v[v.size() - 1] << endl;
}
bool is_stable(vector<Card> v1, vector<Card> v2) {
for (int32_t i = 1; i <= 9; i++) {
uint32_t j = 0, k = 0;
while (1) {
while (v1[j].num != i && j < v1.size()) j++;
while (v2[k].num != i && k < v2.size()) k++;
if (j >= v1.size() || k >= v2.size()) break;
if (v1[j].suit != v2[k].suit) return false;
j++;
k++;
}
}
return true;
}
int main() {
int32_t N;
cin >> N;
vector<Card> A(N);
for (int32_t i = 0; i < N; i++) {
string temp;
cin >> temp;
A[i] = Card(temp);
}
vector<Card> B = bubble_sort(A);
print(B);
cout << (is_stable(A, B) ? "Stable" : "Not stable") << endl;
vector<Card> C = insertion_sort(A);
print(C);
cout << (is_stable(A, C) ? "Stable" : "Not stable") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string s; cin >> s;
for(int bit=0; bit<(1<<3); bit++){
string str = "";
str += s[0];
int cnt = s[0] - '0';
if(bit & (1<<0)){
cnt += s[1] - '0';
str += "+";
}else{
cnt -= s[1] - '0';
str += "-";
}
str += s[1];
if(bit & (1<<1)){
cnt += s[2] - '0';
str += "+";
}else{
cnt -= s[2] - '0';
str += "-";
}
str += s[2];
if(bit & (1<<2)){
cnt += s[3] - '0';
str += "+";
}else{
cnt -= s[3] - '0';
str += "-";
}
str += s[3];
if(cnt == 7){
str += "=7";
cout << str << endl;
break;
}
}
}
| 0
| 89,239,820
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<ll> vll;
typedef pair<int, ll> P;
#define mp(x, y) make_pair(x, y)
typedef queue<int> qi;
typedef queue<string> qs;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define repp(i, a, b) for(int i = (a); i <= (b); i++)
#define repm(i, n) for(int i=n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll INF = 1e10;
int V, E;
vector<vector<ll>> dist(110, vector<ll>(110, INF));
int main() {
cin >> V >> E;
rep(v, V) dist[v][v] = 0;
rep(i, E) {
int s, t; ll d; cin >> s >> t >> d;
dist[s][t] = d;
}
rep(k, V) {
rep(i, V) {
rep(j, V) {
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
bool flag = false;
rep(v, V) if (dist[v][v] < 0) flag = true;
if (flag) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
rep(i, V) {
rep(j, V) {
if (dist[i][j] >= INF / 2) cout << "INF";
else cout << dist[i][j];
if (j != V - 1) cout << " ";
}
cout << endl;
}
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<unordered_map>
using namespace std;
int main() {
int N;
cin >> N;
long long res = 0;
int former = -1;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i == 0) {
former = a;
}
else {
if (former > a) {
res += former - a;
}
else if (a > former) {
former = a;
}
}
}
cout << res << endl;
return 0;
}
| 0
| 76,001,494
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
char c[2][3];
rep(i, 2) rep(j, 3) cin >> c[i][j];
if (c[0][0] == c[1][2] && c[0][1] == c[1][1] && c[0][2] == c[1][0])
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;
int main(void) {
ll N;
cin >> N;
ll a[MAX], b[MAX], c[MAX], d[MAX];
ll i, j;
ll sa=0, sb=0;
for(i=0; i<N; i++) cin >> a[i];
for(i=0; i<N; i++) cin >> b[i];
for(i=0; i<N; i++) {
c[i]=a[i]-b[i];
d[i]=c[i];
}
sort(c, c+N);
sort(d, d+N);
ll l=0, r=N-1;
while(l<r && d[l]<0 && d[r]>0) {
if(d[l]+d[r]==0) {
d[l]=d[r]=0;
l++; r--;
}else if(d[l]+d[r]>0) {
d[r]+=d[l];
d[l]=0;
l++;
}else {
d[l]+=d[r];
d[r]=0;
r--;
}
}
ll ans=0;
for(i=0; i<N; i++) {
if(d[i]<0) {
pt(-1);
return 0;
}
if(c[i]!=d[i]) ans++;
}
pt(ans);
}
| 0
| 67,480,702
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
ll s;
cin >> s;
ll x1, y1, x2, y2;
x1 = 1000000000LL;
y1 = 1LL;
y2 = (s+x1-1)/x1;
x2 = (x1-s%x1)%x1;
cout << "0 0" << ' ' << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<queue>
#define _USE_MATH_DEFINES
#include<math.h>
#include<cmath>
#include<ctime>
#include<map>
#include<typeinfo>
#define R(i, n) for(int i = 0;i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SL(a) scanf("%lld", &a)
#define SL2(a, b) scanf("%lld%lld", &a, &b)
#define SL3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define SA(i, n, a) R(i, n) scanf("%d", &a[i])
#define SAL(i, n, a) R(i, n) scanf("%lld", &a[i])
#define SC(a) scanf("%c", &a)
#define P(a) printf("%d", a)
#define PL(a) printf("%lld", a)
#define PY printf("YES")
#define PN printf("NO")
#define Py printf("Yes")
#define Pn printf("No")
using namespace std;
using ll = long long;
using PR = pair<int, int>;
const ll MOD = 1e+9 + 7;
const int INF = 1e+9;
const double PI = acos(-1);
int N;
int main(){
S(N);
map<int, int> m;
R(i, N) {
int a;
S(a);
if (m.find(a) == m.end()) m.emplace(a, 1);
else m[a]++;
}
int ans = 0;
for (auto itr = m.begin(); itr != m.end(); itr++) {
if (itr->first > itr->second) ans += itr->second;
else if (itr->second > itr->first) ans += itr->second - itr->first;
}
P(ans);
}
| 0
| 47,750,579
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
map<ll, ll> cnt;
rep(i, 3){
ll a, b;
cin >> a >> b;
cnt[a]++, cnt[b]++;
}
vi ans(5, 0);
for(auto &num: cnt) ans[num.second]++;
(ans[1] == 2 && ans[2] == 2) ? YES() : NO();
}
|
#include <iostream>
#include "algorithm"
using namespace std;
int main() {
int n;
cin >> n;
int R[n];
int i = 0;
int c = 0;
int temp, min;
for (int i = 0; i < n; i++){
cin >> R[i];
}
for (int i = 0; i<n; i++){
min = i;
for (int j = i; j<n; j++){
if (R[j] < R[min]){
min = j;
}
}
if (R[i] != R[min]){
temp = R[i];
R[i] = R[min];
R[min] = temp;
c++;
}
}
for(int j=0; j<n; j++){
cout << R[j];
if (j<n-1){
cout << " ";
}
}
cout << endl << c << endl;
}
| 0
| 4,688,332
|
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
long long int gcd(long long int bdda,long long int chota)
{
if(chota==0)
return bdda;
return gcd(chota,bdda%chota);
}
void solve()
{
long long int n,k;
cin>>k>>n;
long long int a[n];
for(long long int i=0;i<n;i++)cin>>a[i];
long long int curr=0,val=INT_MIN;
for(long long int i=0;i<n-1;i++)
{
curr=a[i+1]-a[i];
val=max(val,curr);
}
curr=k-a[n-1]+a[0];
val=max(val,curr);
cout<<k-val;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
switch (s[0])
{
case 'A':
putchar('T');
break;
case 'C':
putchar('G');
break;
case 'G':
putchar('C');
break;
case 'T':
putchar('A');
break;
}
return 0;
}
| 0
| 2,920,048
|
#ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define dbgmint(n,arr) rep(i,n){cerr<<arr[i].x<<" ";}cerr<<endl;
#define dbgarrmint(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j].x<<" ";}cerr<<endl;}
#else
#define dbg(...)
#define dbgmap(...)
#define dbgarr(...)
#define dbgdp(...)
#define dbgmint(...)
#define dbgarrmint(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a,b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,v.size())i>>v[j];return i;}
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
int len=v.size();
for(int i=0; i<len; ++i) {
s<<v[i];
if(i<len-1) s<<" ";
}
return s;
}
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
int len=vv.size();
for(int i=0; i<len; ++i) {
s<<vv[i]<<endl;
}
return s;
}
struct Sieve {
ll n;
vector<ll> f, primes;
Sieve(ll n = 1) : n(n), f(n+1) {
}
void add(ll i){
if(f[i]) return;
primes.push_back(i);
f[i] = i;
for(long long j = i; j <= n; j += i) {
if(!f[j]) f[j] = i;
}
}
bool isPrime(ll x) { return f[x] == x; }
vector<ll> factorList(ll x) {
vector<ll> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<pair<ll, ll>> factor(ll x) {
vector<ll> fl = factorList(x);
if(fl.size() == 0) return {};
vector<pair<ll, ll>> res(1, pair<ll, ll>(fl[0], 0));
for(ll p : fl) {
if(res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
int solve(){
ll n;
cin>>n;
Vec a(n);
cin>>a;
map<ll,ll>mp;
rep(i,n){
mp[a[i]]++;
}
Sieve sieve(1e6);
ll ans = 0;
Each(x, mp){
if(x.se==1){
if(sieve.f[x.fi]==0)ans++;
}
sieve.add(x.fi);
}
out(ans);
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N,K; cin>>N>>K;
vi A(N);
rep(i,0,N) cin>>A[i];
vector<vector<bool>> dp(N+1,vector<bool>(K+1)),cp(N+1,vector<bool>(K+1));
dp[0][0]=1;
rep(i,0,N){
REP(j,0,K){
if(dp[i][j]){
dp[i+1][j]=1;
dp[i+1][min(j+A[i],K)]=1;
}
}
}
cp[N][0]=1;
rep(i,0,N){
int k=N-i;
REP(j,0,K){
if(cp[k][j]){
cp[k-1][j]=1;
cp[k-1][min(j+A[k-1],K)]=1;
}
}
}
int ans=0;
rep(i,0,N){
int sum=0;
int memo=K-1;
rep(j,0,K){
if(dp[i][j]){
for(memo;0<=memo;memo--){
if(cp[i+1][memo]&&memo+j<K){
sum=max(sum,memo+j);
break;
}
}
}
}
if(sum+A[i]<K) ans++;
}
cout<<ans<<endl;
}
| 0
| 76,832,138
|
#include<stdio.h>
#include<string.h>
#define N 100000000
char c[14];
int x[N];
int n;
int a(void);
int b(char);
void insert(void);
int find(void);
int main(){
char str[7];
int i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%s",str,c);
if(str[0]=='i'){
insert();
}
else if(str[0]=='f'){
if(find())printf("yes\n");
else printf("no\n");
}
}
return 0;
}
int a(void){
int x=0,i,k=1;
for(i=0;i<strlen(c);i++){
x+=k*(b(c[i]));
k*=5;
}
return x;
}
int b(char c){
if(c=='A'){
return 1;
}
else if(c=='C'){
return 2;
}
else if(c=='G'){
return 3;
}
else return 4;
}
void insert(){
x[a()]=1;
}
int find(){
int key =a();
if(x[key]){
return 1;
}
else return 0;
}
|
#include <cstring>
#include <cassert>
#include <utility>
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <functional>
#include <tuple>
#include <climits>
#include <limits>
#include <deque>
#include <list>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <complex>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#define init ios::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL);
#define setpr(x) cout << setprecision((x))
#define PI atan(1)*4
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define mk(a , b) { min((a) , (b)) , max((a) , (b)) }
#define flush cout.flush()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define endc "\n"
#define MOD 1000000007
#define meme(x) memset((x), 0, sizeof((x)))
#define memo(x) memset((x),-1, sizeof((x)))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
ll egcd(ll a, ll b, ll &x, ll &y){
if (a == 0LL){
x = 0LL;
y = 1LL;
return b;
}
ll xx, yy;
ll val = egcd(b % a, a, xx, yy);
x = yy - (b / a) * xx;
y = xx;
return val;
}
ll gcd(ll a, ll b){
while(true){
if(a>b)
swap(a,b);
if (a == 0)
return b;
ll p = b % a , q = a;
a = p;
b = q;
}
}
ll powerMod(ll x,ll y){
ll res = 1;
x %= MOD;
while(y > 0){
if(y & 1)res = (res*x)%MOD;
y = y >> 1;
x = (x * x)%MOD;
}
return res%MOD;
}
vector< vector<ll> > adj, dp;
ll dfs(int node, int p, int prev){
if(dp[node][prev] > -1){
return dp[node][prev];
}
if(prev){
ll ans = 1LL;
for(auto i : adj[node]){
if(i == p)
continue;
ans *= dfs(i, node, 0);
ans %= MOD;
}
return dp[node][prev] = ans;
} else {
ll ans = 1LL, ans1 = 1LL;
for(auto i : adj[node]){
if(i == p)
continue;
ans *= dfs(i, node, 0);
ans1 *= dfs(i, node, 1);
ans %= MOD;
ans1 %= MOD;
}
return dp[node][prev] = (ans + ans1) % MOD;
}
}
void solve(){
int n,i,j,k,l,p;
cin >> n;
adj.resize(n + 1);
dp.resize(n + 1, vector<ll>(2, -1LL));
for(i = 0; i < n - 1; i++){
cin >> j >> k;
adj[j].pb(k);
adj[k].pb(j);
}
cout << dfs(1,0,0) << endc;
}
int32_t main(){
init;
int t = 1;
while(t--){
solve();
}
return 0;
}
| 0
| 35,388,498
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,c,k;
cin >> n >> c >> k;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a[i];
sort(a.begin(),a.end());
ll ans=1;
int f=0;
for(int i = 1; i < n; i++) {
if(a[i]>a[f]+k){
f=i;
ans++;
}
else{
if(i-f==c){
f=i;
ans++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<stdio.h>
#include<string.h>
using namespace std;
#define M 1046527
#define L 14
#define NIL (-1)
char h[M][L],s[L],com[9];
int getchar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
return 0;
}
long long getkey(char str[]){
long long sum=0,p=1,i;
for(int i=0;i<strlen(str);i++){
sum+=p*(getchar(str[i]));
p*=5;
}
return sum;
}
int h1(int key){ return key%M; }
int h2(int key){ return 1+(key%(M-1)); }
int Find(char str[]){
long long key,i,o;
key = getkey(str);
for(i=0;;i++){
o=(h1(key)+i*h2(key))%M;
if(strcmp(h[o],str)==0) return 1;
else if(strlen(h[o])==0) return 0;
}
return 0;
}
int minsert(char str[]){
long long key,i,o;
key=getkey(str);
for(i=0;;i++){
o=(h1(key)+i*h2(key))%M;
if(strcmp(h[o],str)==0) return 1;
else if(strlen(h[o])==0){
strcpy(h[o],str);
return 0;
}
}
}
int main(){
int n;
for(int i=0;i<M;i++) h[i][0]='\0';
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s %s",com,s);
if(com[0]=='i'){
minsert(s);
}
else{
if(Find(s)){
printf("yes\n");
}
else{
printf("no\n");
}
}
}
return 0;
}
| 0
| 12,084,194
|
#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
const int INF=1000000001;
const double PI=3.141592653589;
const ll LMAX=1000000000000001;
ll gcd(ll a,ll b){if(a<b)swap(a,b);while((a%b)!=0){a=b;b=a%b;}return b;}
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
int main(){
int h,w; cin>>h>>w;
ll ans=LMAX;
ll S=(ll)h*(ll)w;
for(int i=1;i<w;i++){
ll s1=(ll)i*(ll)h;
ll s2=(ll)(w-i)*(ll)(h/2);
ll s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
s2=(ll)(w-i)/2*(ll)h;
s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
}
for(int i=1;i<h;i++){
ll s1=(ll)i*(ll)w;
ll s2=(ll)(h-i)*(ll)(w/2);
ll s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
s2=(ll)(h-i)/2*(ll)w;
s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n, k;
cin >> n >> k;
vi cnt;
cnt.pb(k);
while (k>1) {
k = (k + 1) / 2;
cnt.pb(k);
}
double ans = 0;
int t = 0, r = 1;
rep1r(i, n) {
while (i < cnt[t]) {
++t;
r *= 2;
}
ans += 1.0 / r;
}
printf("%.10f\n", ans/n);
return 0;
}
| 0
| 92,933,841
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> cnt(10, 0);
for (int i = 0; i < 4; i++) {
int N; cin >> N;
cnt.at(N)++;
}
if (cnt.at(1) > 0 && cnt.at(9) > 0 && cnt.at(7) > 0 && cnt.at(4) > 0) {
cout << "YES" << endl;
}
else cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>using arr=vector<vector<T>>;
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int n;
arr<int> G;
vector<bool> seen;
arr<ll> dp;
void dfs(int s, int p){
seen[s] = true;
if(p != -1 && G[s].size()==1){
dp[s][0] = 1;
dp[s][1] = 1;
}else{
for(int i: G[s]){
if(seen[i]) continue;
dfs(i, s);
}
ll white = 1, black = 1;
for(int i: G[s]){
if(i==p) continue;
white *= (dp[i][0] + dp[i][1]);
white %= MOD;
black *= (dp[i][1]);
black %= MOD;
}
dp[s][0] = black;
dp[s][1] = white;
}
}
int main()
{
cin >> n;
G.resize(n);
rep(i, n-1){
int x, y; cin >> x >> y;
x--; y--;
G[x].push_back(y);
G[y].push_back(x);
}
dp.assign(n, vector<ll>(2, 1));
seen.assign(n, false);
dfs(0, -1);
pr((dp[0][0] + dp[0][1])%MOD);
return 0;}
| 0
| 5,784,131
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int ans=1;
map<int,int> mp;
int arr[n+1];
int mod=998244353;
for(int i=1;i<=n;i++)
{
cin>>arr[i];
}
if(arr[1]!=0)
{
cout<<0<<endl;
return 0;
}
arr[0]=0;
sort(arr,arr+n+1);
mp[0]=1;
for(int i=2;i<=n;i++)
{
ans*=mp[arr[i]-1];
ans%=mod;
mp[arr[i]]++;
}
cout<<ans<<endl;
return 0;
}
|
#define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
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 += "}\n";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}\n";
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)) + ")";
}
template <typename A, typename B, typename C, typename D, typename E>
string to_string(tuple<A, B, C, D, E> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + "," + to_string(get<4>(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...);
}
#ifdef LOCAL
#define debug(...) cerr << "\n[" << #__VA_ARGS__ << "]:\n", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using llong = long long;
using PII = pair<int, int>;
llong gcd(llong a, llong b) {
return b == 0 ? a : gcd(b, a % b);
}
llong lcm(llong a, llong b) {
return a * b / gcd(a, b);
}
int main() {
IOS;
int n; cin >> n;
vector<int> a(n);
int cnt = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == cnt) {
cnt++;
}
}
if (cnt == 1) cout << -1;
else cout << n - (cnt - 1);
}
| 0
| 39,824,120
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>a(n);
int b=0;
for(int i=0;i<n;i++){
cin>>a.at(i);
b=max(b,a.at(i));
}
int c=0;
int d=0;
for(int i=0;i<n;i++){
if(a.at(i)==b){
c++;
}
else{
d=max(d,a.at(i));
}
}
for(int i=0;i<n;i++){
if(c!=1){
cout<<b<<endl;
}
else if(c==1&&a.at(i)==b){
cout<<d<<endl;
}
else if(c==1&&a.at(i)!=b){
cout<<b<<endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int n,m,v,p,u,ans;
long long g,a[200005],sy,d,s[200005];
int main()
{
scanf("%d%d%d%d",&n,&m,&v,&p);
for (int i=1;i<=n;i++)
scanf("%lld",&a[i]);
sort(a+1,a+n+1);
g=a[n-p+1];
for (int i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
ans=p;
for (int i=1;i<=n-p;i++)
{
if (g>a[i]+m)
continue;
sy=(long long)m*(long long)(v-1);
d=(long long)m*(long long)(n-1);
d-=s[n-p+1]-s[i-1]-(long long)(n-p-i+2)*a[i];
if (sy<=d)
ans++;
}
printf("%d\n",ans);
return 0;
}
| 0
| 19,794,659
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n, r;
cin >> n >> r;
cout << r + 100 * (10 - min(n, 10));
}
int main()
{
fastio;
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define db long double
#define ull unsigned long long int
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define MOD 1000000007
#define MAXN 200005
using namespace std;
ll mod=998244353;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=0){
if(exponent&1) ans=(1LL*ans*base)%mod;
base=(1LL*base*base)%mod;
exponent>>=1;
}
return ans%mod;
}
const ll M=3000006;
ll f[M],inv[M];
void compute(){
f[0]=1;
rep(i,1,M-1){
f[i]=(1LL*i*f[i-1])%mod;
}
inv[M-1]=expo(f[M-1],mod-2,mod);
for(ll i=M-2;i>=0;i--){
inv[i]=(1LL*(i+1)*inv[i+1])%mod;
}
}
ll C(ll n,ll r){
return (1LL*((1LL*f[n]*inv[r])%mod)*inv[n-r])%mod;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tests=1;
while(tests--)
{
ll i,j,k,n;
cin>>n;
ll ans=0;
rep(i,1,sqrt(n))
{
j=i;
ll cur=0;
while(i*j<n)
{
j++;
cur+=2;
}
cur--;
ans+=max(0LL,cur);
}
cout<<ans;
}
return 0;
}
| 0
| 25,647,146
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int res = INT_MAX;
for (int i = 0; i + 2 < (int)S.size(); i++)
{
int x = stoi(S.substr(i, 3));
res = min(res, abs(x - 753));
}
cout << res << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define vl vector<ll>
#define pb push_back
using namespace std;
int main()
{
ll t,tp,mx=0,c=0,n,i,j,k;
cin >> n;
vl v(n+1,0);
for(i=1;i<=n;i++)
cin >> v[i];
set<ll> s;
s.insert(1);c=0;
i=1;
while(true)
{
c++;
if(v[i]==2)
break;
i=v[i];
if(s.count(i))
{
c=-1;
break;
}
else
{
s.insert(i);
}
}
cout << c ;
return 0;
}
| 0
| 48,569,364
|
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
int w,h,x,y,r;
w=h=x=y=r=0;
cin >> w;
cin >> h;
cin >> x;
cin >> y;
cin >> r;
if ((x-r >= 0) && (y-r >= 0) && (x+r <= w) &&(y+r <= h)) {
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[201],s=0;
cin>>n;
for(int i=1;i<=2*n;i++) cin>>a[i];
sort(a+1,a+2*n+1);
for(int i=1;i<2*n;i+=2) s+=a[i];
cout<<s<<endl;
}
| 0
| 84,032,785
|
#include <cstdio>
#define loop_input(fmt,...) while(~scanf(fmt,__VA_ARGS__))
int main() {
int a, b;
loop_input("%d%d", &a, &b) {
if (a == 0 && b == 0) break;
if (a > b) a ^= b ^= a ^= b;
printf("%d %d\n", a, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e13;
const int MAX = 510000;
bool graph[nmax][nmax];
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;
}
}
ll 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;
}
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
struct SegmentTree
{
private:
ll n;
vector<ll> node;
public:
SegmentTree(vector<ll> v)
{
ll sz = v.size();
n = 1;
while (n < sz)
{
n *= 2;
}
node.resize(2 * n - 1, INF);
for (ll i = 0; i < sz; i++)
{
node[i + n - 1] = v[i];
}
for (ll i = n - 2; i >= 0; i--)
{
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(ll x, ll val)
{
x += (n - 1);
node[x] = val;
while (x > 0)
{
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
ll find(ll a, ll b, ll k = 0, ll l = 0, ll r = -1)
{
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
ll vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
void warshall_floyd(ll n)
{
for (size_t i = 0; i < n; i++)
{
for (size_t j = 0; j < n; j++)
{
for (size_t k = 0; k < n; k++)
{
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind
{
public:
vector<ll> Parent;
UnionFind(ll N)
{
Parent = vector<ll>(N, -1);
}
ll find(ll A)
{
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A)
{
return -Parent[find(A)];
}
bool Union(ll A, ll B)
{
A = find(A);
B = find(B);
if (A == B)
{
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
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);
return a / g * b;
}
ll mulMod(ll a, ll b)
{
return (((a % MOD) * (b % MOD)) % MOD);
}
ll powMod(ll a, ll p)
{
if (p == 0)
{
return 1;
}
else if (p % 2 == 0)
{
ll half = powMod(a, p / 2);
return mulMod(half, half);
}
else
{
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b)
{
return (a + b - 1) / b;
}
vector<ll> tsort(Graph G)
{
ll N = G.size();
vector<ll> in(N);
for (auto &&edges : G)
{
for (auto &&edge : edges)
{
in[edge]++;
}
}
queue<int> que;
for (int i = 0; i < N; i++)
{
if (in[i] == 0)
{
que.push(i);
}
}
int cnt = 0;
vector<ll> ans;
while (!que.empty())
{
int v = que.front();
que.pop();
ans.push_back(v);
for (auto &&next : G[v])
{
in[next]--;
if (in[next] == 0)
{
que.push(next);
}
}
}
return ans;
}
void solve(long long A, long long B){
ll a = 0,b= 0;
for (int i = 0; i < A%4; i++)
{
a ^= A-i-1;
}
for (int i = 0; i < (B+1)%4; i++)
{
b ^= B-i;
}
ll ans = a^b;
cout <<ans << endl;
}
int main(){
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
solve(A, B);
return 0;
}
| 0
| 24,615,118
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<int>> vv;
typedef pair<int, int> P;
string S, T;
int sn, tn;
vector<string> w;
void input() {
cin >> S >> T;
}
void solve(int i) {
string s = "";
rep(j, i) {
if (S[j] == '?') s += 'a';
else s += S[j];
}
for (int j = i; j < i + tn; j++) {
if (S[j] == '?') {
s += T[j - i];
} else if (S[j] == T[j - i]) {
s += S[j];
} else {
return;
}
}
for (int j = i + tn; j < sn; j++) {
if (S[j] == '?') s += 'a';
else s += S[j];
}
w.push_back(s);
}
int main() {
input();
sn = S.size();
tn = T.size();
if (sn < tn) {
cout << "UNRESTORABLE" << endl;
return 0;
}
rep(i, sn - tn + 1) solve(i);
if (w.empty()) {
cout << "UNRESTORABLE" << endl;
return 0;
}
sort(w.begin(), w.end());
string ans = w[0];
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
vector<vector<int>> v(4,vector<int>(4));
vector<vector<bool>> bin(4,vector<bool>(4,false));
for(int i=1; i<=3; i++)
for(int j=1; j<=3; j++)
cin >> v[i][j];
int n; cin >> n;
for(int i=1; i<=n; i++){
int b;
cin >> b;
for(int j=1; j<=3; j++)
for(int k=1; k<=3; k++)
if(v[j][k]==b)
bin[j][k]=true;
}
bool ans = false;
for(int i=1; i<=3; i++){
bool bingo = true;
for(int j=1; j<=3; j++){
if(bin[i][j] == false) bingo = false;
}
if(bingo==true) ans = true;
}
for(int i=1; i<=3; i++){
bool bingo = true;
for(int j=1; j<=3; j++){
if(bin[j][i] == false) bingo = false;
}
if(bingo==true) ans = true;
}
if(bin[1][1]&&bin[2][2]&&bin[3][3]) ans = true;
if(bin[1][3]&&bin[2][2]&&bin[3][1]) ans = true;
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 56,656,165
|
#include "bits/stdc++.h"
using namespace std;
int main()
{
vector<int> a;
for (int i = 0; i < 3;i++)
{
int t;
cin >> t;
a.push_back(t);
}
vector<int>b;
b = a;
sort(a.begin(),a.end());
if (b == a && (a[0] != a[1] && a[1] != a[2]))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
int main()
{
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
}
| 0
| 16,314,180
|
#include <iostream>
using namespace std;
int main(){
int min,max,n,i;
int *data;
long sum;
cin>>n;
data= new int[n];
for (i=0;i<n;i++)cin>>data[i];
min=data[0];max=data[0];sum=data[0];
for (i=1;i<n;i++){
sum+=data[i];
if (min>data[i])min=data[i];
else if (max<data[i])max=data[i];
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define nn cout << "\n";
ll dp[100000],ht[100000];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t,a,b,i,j,c,d,e,f,n,k,m,w;
memset(dp,0,sizeof(dp));
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a;
ht[i]=a;
}
dp[n]=0;dp[n+1]=10000000;ht[n+1]=10000000;
for(i=n-1;i>=1;i--)
{
dp[i]=min((dp[i+1]+abs(ht[i]-ht[i+1])),(dp[i+2]+abs(ht[i]-ht[i+2])));
}
cout<<dp[1];
return 0;
}
| 0
| 90,620,486
|
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(4);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main(){
ll w,h;
cin>>w>>h;
V<P> d;
for(int i=0;i<h+w;i++){
ll a;cin>>a;
d.emplace_back(a,(w<=i));
}
sort(all(d));
h++;w++;
ll ans=0;
for(int i=0;i<d.size();i++){
if(d[i].se){
ans+=w*d[i].fi;
h--;
}else{
ans+=h*d[i].fi;
w--;
}
}
cout<<ans<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[]={"SUN","MON","TUE","WED","THU","FRI","SAT"};
int main() {
int a,b,c;
while(cin>>a>>b>>c){
map<int,int>m;
m[a]++;
m[b]++;
m[c]++;
map<int,int>::iterator it;
for(it=m.begin();it!=m.end();it++){
if((it->second) == 1)cout<<(it->first)<<endl;
}
}
return 0;
}
| 0
| 52,023,044
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll calc(ll a){
if(a == -1) return 0;
if(a == 0) return 0;
if(a == 1) return 1;
if(a%2==0){
if((a / 2) % 2 == 0) return a^0;
else return a^1;
}else{
if(((a-1)/2) %2== 0) return a^(a-1)^0;
else return a^(a-1)^1;
}
}
int main(){
ll a, b;
cin >> a >> b;
a = calc(a - 1);
b = calc(b);
ll ans = a^b;
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
string s;
cin >> s;
int a=s[0]-'0',b=s[1]-'0',c=s[2]-'0',d=s[3]-'0';
int ans=0;
for(int i=0;i<(1<<3);i++){
int sum=a;
if((1<<2)&i)sum+=b;
else sum-=b;
if((1<<1)&i)sum+=c;
else sum-=c;
if((1<<0)&i)sum+=d;
else sum-=d;
if(sum==7){
ans=i;
break;
}
}
string exp="";
exp+=a+'0';
if((1<<2)&ans)exp+="+";
else exp+="-";
exp+=b+'0';
if((1<<1)&ans)exp+="+";
else exp+="-";
exp+=c+'0';
if((1<<0)&ans)exp+="+";
else exp+="-";
exp+=d+'0';
exp+="=7";
cout << exp << endl;
return 0;
}
| 0
| 88,276,666
|
#include <bits/stdc++.h>
using namespace std;
#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 ITER(it, a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
typedef long long LL;
typedef pair<int, int> PII;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = (LL)INF * INF;
const int MAX = 1 << 18;
int a[MAX], b[MAX];
int main()
{
int n;
cin >> n;
LL s = 0;
int mn = INF;
FOR(i, 0, n)
{
cin >> a[i] >> b[i];
s += b[i];
if(a[i] > b[i])
mn = min(mn, b[i]);
}
cout << (mn == INF ? 0 : s - mn) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout << fixed << setprecision(x)
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 gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int sumDight(int x) {
int sum = 0;
while (x > 0) {
sum += (x % 10);
x /= 10;
}
return sum;
}
int divideReverse(int x) {
int reverse = 0;
int r;
while (x > 0) {
r = x % 10;
reverse = reverse * 10 + r;
x /= 10;
}
return reverse;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, k;
vector<int> l(101);
cin >> n >> k;
rep(i, n) cin >> l[i];
sort(ALL(l));
reverse(ALL(l));
int sum = 0;
rep(i, k)sum += l[i];
cout << sum << endl;
}
| 0
| 38,386,414
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100005;
int n,id[N];
LL d[N],size[N];
vector <int> e[N];
map <LL,int> Map,My;
int depth[N];
void dfs(int x,int d){
depth[x]=d;
for (auto y : e[x])
dfs(y,d+1);
}
bool check(int x,LL v){
if (v!=d[x])
return 0;
for (auto y : e[x])
if (!check(y,v-size[y]+(n-size[y])))
return 0;
return 1;
}
bool check(){
dfs(1,0);
LL v=0;
for (int i=1;i<=n;i++)
v+=depth[i];
return check(1,v);
}
int main(){
scanf("%d",&n);
My.clear();
for (int i=1;i<=n;i++)
scanf("%lld",&d[i]),My[d[i]]=i;
sort(d+1,d+n+1);
for (int i=1;i<=n;i++)
e[i].clear();
Map.clear();
for (int i=1;i<=n;i++)
Map[d[i]]=i,size[i]=1;
for (int i=n;i>1;i--){
LL tmp=d[i]-n+size[i]*2;
int fa=Map[tmp];
if (!fa)
return puts("-1"),0;
e[fa].push_back(i);
size[fa]+=size[i];
}
if (!check())
return puts("-1"),0;
for (int i=1;i<=n;i++)
for (auto j : e[i])
printf("%d %d\n",My[d[i]],My[d[j]]);
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<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
int get_digits(int num) {
int ans = 0;
while(num) {
num /= 10;
ans++;
}
return ans;
}
#define INF 100
int main(void) {
int64_t num;
cin >> num;
int num_2 = sqrt(0.5 + num);
for(int val = num_2; val >= 1; val--) {
if(num%val) continue;
int val2 = num/val;
cout << max(get_digits(val), get_digits(val2)) << endl;
return 0;
}
return 0;
}
| 0
| 79,618,506
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.