code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
static const int INF = 1<<30;
static const int SIZE = 100000+10;
int main(){
int n;
cin>>n;
vector<int> dp(SIZE,INF);
dp[0] = 0;
for(int i=1; i<=n; i++){
for(int six=1; six<=i; six *= 6){
if(i-six < 0) continue;
dp[i] = mi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#d... | 0 | 14,148,497 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
int A, B, C;
cin >> A >> B >> C;
if(A==B) cout << C << endl;
else if(B==C) cout << A ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) ... | 0 | 28,222,294 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,counter,subcounter;
string strn,strm;
cin >> n;
subcounter = 0;
vector<string> vecn(0);
vector<string> vecm(0);
for (int i = 0; i < n; i++) {
cin >> strn;
vecn.push_back(strn);
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> strm;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string s, t; cin >> s >> t;
for (int i=0; i<n; ++i) {
if (s.substr(i, n-i)==t.substr(0, n-i)) {
cout << n+i;
return 0;
}
}
cout << 2*n;
return 0;
} | 0 | 96,988,635 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1000100
int n,dat[2*(MAX_N)-1];
void init(int n_){
n=1;
while(n<n_)n*=2;
for(int i=0;i<2*n-1;i++)dat[i]=0;
}
void update(int k,int a){
k+=n-1;
dat[k]=a;
while(k>0){
k=(k-1)/2;
dat[k]=max(dat[k*2+1],dat[k*2+2]);
}
}
int query(int a,int b,in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
struct card {
int num;
char suit;
};
bool operator==(const card &lhs, const card &rhs) {
return lhs.num == rhs.num && lhs.suit == rhs.suit;
}
vector<card> bubbleSort(vector<card> c) {
int n = c... | 0 | 43,070,762 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int l,r;
cin >> l >> r;
int g = r - l;
l %= 2019;
r %= 2019;
int ans = 2... | #include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <functional>
#include <string>
#include <utility>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ALL(a) (a).begin(),... | 0 | 40,501,141 |
#include<stdio.h>
int A[2000000];
int B[2000000];
void Counting_Sort(int k){
int i,j;
int C[10001];
for(i=0;i<10001;i++)C[i]=0;
for(j=0;j<k;j++)C[A[j]]++;
for(i=1;i<10001;i++)C[i]+=C[i-1];
for(j=k-1;j>=0;j--){
C[A[j]]--;
B[C[A[j]]]=A[j];
}
}
int main(){
int n,i;
scanf("%d",&n);
for(i=0;i<n... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>
#define pb push_back
#define eb emplace_back
#d... | 0 | 45,797,642 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << endl;
return;
}
template <typename First, typename... Rest>
void c... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <cstring>
using namespace std;
typedef lo... | 0 | 100,622,666 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, X, Y;
cin >> A >> B >> C >> D;
X = A + B;
Y = C + D;
if (X > Y) {
cout << "Left" << endl;
}
if (X == Y) {
cout << "Balanced" << endl;
}
if (X < Y) {
cout << "Right" << endl;
}
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll l,r;
scanf(" %lld %lld",&l,&r);
vector<int> modulos(2019,0);
for(int i = l, j = 0; i <= r && j <= 10000;++i,++j)
++modulos[i%(2019ll)];
int ans = 10000;
for(int i = 0; i < modulos.size();++i){
for(in... | 0 | 22,587,076 |
#include<bits/stdc++.h>
using namespace std;
#define deb(x) cout <<"\n"<< (#x) << " = " << (x) << "\n"
const long long INF = 1e18;
const long long mod=1e9+7 ;
void inputoutput()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout)... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int n,k;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v.at(i);
int ans = 0;
for(int l = 0; l <= k;l++){
... | 0 | 50,332,171 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9+7;
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
}
vector<int> num(100100);
for(int i=0; i<100100; i++){
num.at(i) = 0;
}
for(int i=0; i<n; i++){
num.at(a.at(i))++;
}
int diff=0;
int even=0;
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<pair<ll,ll>> t(n);
ll tmp = -1;
for(i = 0;i < n;++i){
cin >> t.at(i).first;
t.at(i).first != tmp... | 0 | 29,032,494 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
bool no=true;
if((abs(b-a)<=d&&abs(c-b)<=d)||(abs(c-a)<=d))
{
no=false;
}
if(no){
cout<<"No\n";
}
else{
cout<<"Yes";
}
} | #include <bits/stdc++.h>
using namespace std;
long long f(long long k){
return (k*(k-1))/2;
}
int main(){
long long n;
long long now=0;
cin>>n;
vector<long long> p(n,0);
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
a[i]--;
p[a[i]]++;
}
for(int i=0;i<n;i++){
now+=f(p[i]);
}
for(int... | 0 | 34,579,253 |
#include<bits/stdc++.h>
#define rep(i,x) for(int i=0; i<x; i++)
typedef long long ll;
using namespace std;
int main(){
int h1,m1,h2,m2, k;
cin >> h1>>m1>> h2>>m2>>k;
int cost = (h2*60+m2) - (h1*60+m1);
int ans = max(0, cost-k);
cout << ans <<endl;
} | #include<iostream>
#include<vector>
#include<string>
#include <queue>
#include<map>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include<set>
using namespace std;
#define _USE_MATH_DEFINES
# define M_PI 3.14159265358979323846
# define MOD 1000000007
#define ll long long int
#define pii pair<ll,... | 0 | 99,099,484 |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
string s[N];
int cnt [N][28];
int main ()
{
int n;
cin >> n;
for (int i = 0 ;i < n ; i++) {
cin >> s[i];
for (int j = 0; j < (int)s[i].size(); j++)
{
cnt[i][s[i][j]-'a']++;
}
}
for (int j = 'a'-'a'; j <= 'z'-'a'; j++) {
int minn = 1e9;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 0 | 18,529,949 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 0 | 34,173,264 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n;
vector<int> vec[100005];
int visited[100005];
long long int ans[100005][2];
void dfs(int u){
visited[u] = 1;
long long int pro1 = 1, pro2 = 1;
for(int v:vec[u]){
if(!visited[v]){
dfs(v);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i + 1 < n; i++) {
int a, b;
cin >> a >> b;
a--; b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> grundy(n);
fu... | 0 | 18,171,512 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
typedef long long ll;
int main(){
int x;
cin >> x;
cout << 10 - x/200 << endl;
return 0;
} | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | 0 | 83,979,468 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define PI 3.141592653589793
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<int,int>
#define poly vector<int>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(in... | 0 | 53,021,112 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
string n, s, ans = "No";
cin >> n >> s;
if(n == s.substr(0,n.size()))ans = "Yes";
cout << ans << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
t... | 0 | 65,485,109 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | #include<iostream>
#include<stdio.h>
using namespace std;
int main() {
int n;
scanf("%d\n", &n);
int T[250];
for (int i = 1; i < n + 1; i++) {
int m;
scanf("%d", &m);
T[i] = m;
}
for (int i = 1; i < n + 1; i++) {
printf("node %d: key = %d, ", i, T[i]);
if (i != 1) {
printf("parent key = %d, ", T[i / ... | 0 | 33,481,563 |
#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 a, b;
cin >> a >> b;
int cnt = 0;
for (int i = a; i <= b; i++)
{
int j1, j2, j3, j4;
j1 = i / 10000;
j2 = (i - j1 * 10000) / 1000;
j3 = (i % 100) / 10;
j4 = ... | #include <cstdio>
int main(){
char d[3],key[3],val[3],table[256];
int n,m,i;
scanf("%d",&n);
while(n>0){
for(i=0;i<256;i++) table[i]=i;
for(i=0;i<n;i++){
scanf("%s %s",key,val);
table[key[0]]=val[0];
};
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%s",d);
printf("%c",tabl... | 0 | 19,167,480 |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int n;
cin >> n;
vector<int>w(n);
int all(0);
rep(i, n) {
cin >> w[i];
a... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | 0 | 10,289,725 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
long double q,h,s,d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
q *= 4;
h *= 2;
d /= 2;
ll ans = 0;
if(min({q,h,d,s}) == d){
an... | using namespace std;
#include <bits/stdc++.h>
#define frr(i, r, l) for(int i = r; i >= l; --i)
#define fr(i, l, r) for(int i = l; i < r; ++i)
#define forit(it, type, var) for(type::iterator it = var.begin(); it != var.end(); it++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define MEMS(a,b) memset(a,b,sizeof(a... | 0 | 47,367,673 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N; cin >> N;
if(N % 2){
cout << "First" << "\n"; return 0;
}
set<int> S[100010];
int D[100010] = {};
for(int i = 0; i < N-1; i++){
int a, b; cin >> a >> b;
a--; b--;
S[a].insert(b); S[b]... | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
using namespace std;
int main(){
int n;
cin >> n;
long res = 1;
for(int i = 1; i <= n; i++)res *= i;
cout << res << endl;
} | 0 | 71,703,802 |
#include <bits/stdc++.h>
using namespace std;
int h1,m1,h2,m2,m;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>h1>>m1>>h2>>m2>>m;
int ans = (h2-h1)*60 + (m2-m1);
cout<<max(0,ans-m)<<endl;
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
vector<vector<int> > graph;
int n;
cin >> n;
graph.resize(n);
for(int i=0;i<n;i++){
graph[i].resize(n);
for(int j=0;j<n;j++){
graph[i][j]=0;
}
}
for(int i=0;i<n;i++){
int idx,times;
cin >> idx >> times;
for(... | 0 | 38,822,666 |
#include <iostream>
using namespace std;
int main()
{
int n, x, sum = 0, tmp;
cin >> n;
int arr[100000]{};
for(int i = 0; i < n; i++)
{
cin >> x;
arr[x-1]++;
if( arr[x-1] > 1 )
sum++;
}
tmp = sum/2;
tmp *= 2;
if( sum - tmp == 1 )
sum++;
cout << n - sum;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string card;
string cardBefore,cardBehind;
int h[100] = {},m = 0, len = 0;
while( cin >> card >> m){
if( card == "-" ) break;
len = card.length();
for( int i = 0; i < m; i++ ){
cin >> h[i];
... | 0 | 45,461,457 |
#include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
long long MOD = 1000000007;
int main(){
long long N;
string S;
cin >> N >> S;
long long cnt[26] = {0};
rep(i, N){
cnt[ S[i]-'a' ]++;
}
long long ans = 1;
rep(i, 26)
ans = ( ans*(cnt[i]+1) )%MOD;
cout << (ans-1+MO... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
ll b_num[55], p_num[55];
void solve()
{
ll n, x;
cin >> n >> x;
b_num[0] = 1;
p_nu... | 0 | 43,025,420 |
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | 0 | 24,149,202 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fr(i,n) for(unsigned i=0;i<(n);++i)
#define Fr(i,n) for(int i=1;i<=(n);++i)
#define ifr(i,n) for(int i=(n)-1;i>=0;--i)
#define iFr(i,n) for(int i=(n);i>0;--i)
template<class T> void chmin(T&x,T y){if(x>y)x=y;}
template<class T> void chmax(T&x,T y)... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int f,n,m;
cin>>n;
m=n/2;
f=n%2;
string a,s,t;
cin>>a;
s=a.substr(0,m);
t=a.substr(m,n-m);
if(f==0)
{
if(s==t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else
cout<<... | 0 | 26,154,311 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int a,b;
string s;
cin >> a >> b >> s;
string t = "0123456789";
bool flag = 1;
for(int i = 0; i < s.size(); i++){
if(i ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n; cin >> n;
int c = sqrt(n);
long long a = 0;
for(int i=c; i>0; i--){
if(n%i==0){
a = i;
break;
}
}
long long b = n/a;
cout << a + b -2 << endl;
} | 0 | 87,446,232 |
#include <bits/stdc++.h>
#define A_MAX 1000000
#define A_MAX_HALF 500000
using namespace std;
int min_factor[A_MAX + 1];
int q[A_MAX + 1];
int a[A_MAX + 1];
int main() {
vector<int> primes;
primes.reserve(A_MAX_HALF);
for (int i = 2; i <= A_MAX_HALF; ++i) {
if (!min_factor[i]) {
min_fact... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ... | 0 | 71,800,247 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, ss=0, fin=0;
cin >> A >> B >> C;
set<int> S;
for (int i=1; i<=100000; i++) {
if (A*i%B==C) {
fin=1;
break;
}
}
if (fin==1) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
#define lcm(x, y) ((x) * (y) / __gcd((x), (y)))
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define debug(x) cout << #x << " : " << x << endl
#define part cout << "----------------------------------\n";
#includ... | 0 | 17,974,716 |
#include <iostream>
#include <cstdio>
#include <cstring>
#define MOD 1000000007
using namespace std;
const int MAXN = 100005;
int n,a[MAXN],b[MAXN],limit[MAXN],sure[MAXN];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d",a+i);
if(a[i]>a[i-1])limit[i]=1,sure[i]=a[i];
else li... | #include <iostream>
using namespace std;
struct Card{char suit,value;};
void show_array(struct Card a[],int n){
for(int i=0;i<n;i++){
if(i>0) cout << " ";
cout << a[i].suit << a[i].value;
}
cout << endl;
}
void BubbleSort(struct Card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if... | 0 | 24,745,317 |
#include <iostream>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;
const int kNil = -1;
const int kMaxV = 110;
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_t... | #include<iostream>
#include<vector>
#include<cmath>
#include<string>
#include<map>
#include<list>
using namespace std;
vector<int> split(string s,char c){
vector<int> v;string tmp;
for(int i=0;i<s.size();i++){
if(s[i]==c){
v.push_back(stoi(tmp));
tmp ="";
}
else tmp += s[i];
}
if(tmp!="")v.push_back(sto... | 0 | 57,153,990 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <vector>
#include <cmath>
#include <cstdint>
#include <string>
using namespace std;
int main() {
string line;
getline(cin, line);
for (int i = 0; i < line.size(); ++i) {
char c = line[i];
if (isupper(c)) {
c = to... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | 0 | 47,011,432 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef struct dice {
int a[6];
void change(char ch) {
if(ch == 'E') {
int temp = a[0];
a[0] = a[3];
a[3] = a[5];
a[5] = a[2];
a[2] = temp;
}
if(ch == 'N') {
... | 0 | 44,231,424 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
for (int i=0; i<1e6; i++) {
if ((int)(i*0.08) == a && (int)(i*0.1) ... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>
#include <cassert>
#include <i... | 0 | 8,973,373 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b ;
scanf("%d\n",&a);
scanf("%d",&b);
cout << a*a-b << endl;
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int a[512345];
int b[212345];
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
cin>>b[i];
}
int left =212345,right=left+1;
for(int i=0;i<N;i++){
if(i%2==(N-1)%2){
a[left--]=b[i];
}
... | 0 | 13,199,490 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() ... | #include <fstream>
#include <vector>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define ll long long
#define pii pair<int,int>
#define add(... | 0 | 50,655,296 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<deque>
#include<map>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL MAX=2000010;
const LL MOD=1000000007;
typedef map<LL,LL>::iterator Itr;
int main()
{
LL n,d,a;
cin... | #include<iostream>
#include<queue>
using namespace std;
int main(){
int k;
cin>>k;
queue<unsigned long long> que;
for(long long i=1;i<10;++i) que.push(i);
for(long long i=0;i<k-1;++i){
long long x=que.front();
que.pop();
if(x%10!=0) que.push(10*x+x%10-1);
que.push(10*... | 0 | 91,697,730 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int x,y; cin>>x>>y;
cout << x + y/2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vi=vector<int>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> ll... | 0 | 71,165,832 |
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
const int N=222222;
int a[N],b[N];
int main() {
int n;
scanf("%d",&n);
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MAX = 10000000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % ... | 0 | 58,022,149 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
signed main(){
int q;
cin>>q;
while( q-- ){
int a, b;
cin>>a>>b;
if( a > b ) swap( a, b );
double x = sqrt( (double)a * b - 1 );
int l = x;
int r = ( (double)a * b - 1 ) / l;
int ans = l * 2;... | #include<iostream>
#include<vector>
using namespace std;
#define ll long long
int main(){
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for(ll i=0; i<N; ++i) cin >> A[i];
vector<bool> tmp(K, false);
vector<vector<bool>> dp_L(N, tmp), dp_R(N, tmp);
dp_L[0][0] = dp_R[0][0] = true;
for(ll i=0; i<N-1; ++i){
... | 0 | 49,107,799 |
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define vii vector < pii >
#define mp make_pair
#define db long double
#define pb push_back
#define all(s)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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;}
... | 0 | 7,160,947 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
int main()
{
int N, M, R;
cin >> N >>... | #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(){
int n;... | 0 | 75,897,538 |
#include <bits/stdc++.h>
typedef unsigned long long int ull;
typedef long double ldb;
typedef long long int ll;
#define MOD1 1000000007
#define MOD2 998244353
#define PI 3.1415926535897932384626433832795
#define FILL(a, value) memset(a, value, sizeof(a))
#define BOOST ios_base::sync_with_st... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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; }
i... | 0 | 95,215,100 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef double lld;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<double> vdl;
typedef vector<vector<lli>> mat;
typedef vector<vdl> mad;
typedef complex<double> cmp;
typedef vector<cmp> vcl;
const lli e5 = 1 << 20;
const lli mod = ... | 0 | 72,851,427 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <iostream>
using namespace std;
int SolvedPuzzle[100];
int main()
{
cin >> SolvedPuzzle[0] >> SolvedPuzzle[1] >> SolvedPuzzle[2] >> SolvedPuzzle[3] >> SolvedPuzzle[4];
for(int x=0; x<4; x++)
{
for(int y=0; y<4; y++)
{
if(SolvedPuzzle[y]<SolvedPuzzle[y+1])
{
... | 0 | 75,400,299 |
#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
int main()
{
int n,sum=0,k,a;
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>a;
if(a>=k)
sum++;
}
cout<<sum;
nl;
return 0;
} | #include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
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, co... | 0 | 98,366,316 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<string> strings(n);
for (int i = 0; i < n; i++) {
string s; cin >> s;
sort(s.begin(), s.end());
strings[i] = s;
}
sort(strings.begin(), strings.end());
long long ans = 0;
long long curr = 0;
for (int i = 1; i < n; i++) {
... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 0 | 55,292,561 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
const ll INF = 1LL<<60;
int MAX_V = 210;
vector<vector<ll>> d(MAX_V, vector<ll>(MAX_V, INF));
void warshall_floyd() {
for(int k = 0; k < MAX_V; ++k)
... | 0 | 35,768,429 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i=0;i<(n);i++)
int main() {
string S;
cin>>S;
vector<long long> left_count(S.size()+1,0);
vector<long long> right_count(S.size()+1,0);
long long count =0;
rep(i,S.size()){
if (S[i]=='<'){
count++;
... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define forn(i,n) for(int i=0;i<n;i++)
#define fre(i,a,b) for(int i = a; i < b; i++)
#define sf(n) scanf("%lld", &n)
#define sff(a,b) scanf("%lld %lld", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define pfn(n) printf("%d\n", n)
#define pf... | 0 | 75,728,402 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
string s;
int size;
cin >> s;
size = s.size();
for ( int ii = 0; ii < size; ii++ ) {
if ( s[ii] == 'B' ) {
if ( ii == 0 ) {
s.erase(ii, 1);
ii--;
} else {
... | 0 | 68,382,411 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
ll n;
cin>>n;
ll ans=0;
rep(1,i,n)ans+=i;
cout<<ans;
} | #include <iostream>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int f(string s){
int n=s.size();
int ret = 0;
int t=1;
for(int i=0;i<n;i++){
if(s[i]>='0' && s[i]<='9'){
t = s[i]-'0';
}
if(s[i]=='m'){
ret += t*1000;
... | 0 | 96,067,741 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { ce... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
while (N--) {
string s;
vector<string> v;
v.push_back(".,!? ");
v.push_back("abc");
v.push_back("def");
v.push_back("ghi");
v.push_back("jkl");
v.push_back("mno");
... | 0 | 83,338,546 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <map>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9+5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n,k;
cin>>n>>k;
vector<int>h(n),dp(n,INF);
for(int i=0; i<n; i++)cin>>h[i];
dp[0]=0;
for(int i=0; i<n; i++){
for(int step=1; step... | 0 | 63,081,791 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int r, g;
r=0,g=0;
cin >> r >> g;
cout << r*r-g <<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;
};
c... | 0 | 36,353,111 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string l="qazwsxedcrfvtgb";
string r="yhnujmikolp";
while(1){
string s;
cin >> s;
if(s[0]=='#') break;
int str = 0;
for(int i=0; i<(int)l.size(); i++){
if(s[0]==l[i]) str=1;
}
int ans = 0;
for(int i=0; i<(int)s.size(); ... | #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... | 0 | 44,451,838 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int INF = 100000000;
int main(void) {
map<char, int> key;
key['q'] = 0;
key['w'] = 0;
key['e'] = 0;
key['r'] = 0;
key['t'] = 0;
key['a'] = 0;
key['s'] = 0;
key['d'] = 0;
key['f'] = 0;
key['g'] = 0;
key['z'] = 0;
key['x'] = 0;
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1<<29;
int main(){
int H; int N;
cin >> H >> N;
int A[N]; int B[N];
for(int i=0;i<N;i++) cin >> A[i] >> B[i];
int DP[H+1];
DP[0]=0;
for(int i=1;i<=H;i++){
int minA=INF;
for(int j=0;j<N;j++){
if(i>A[j]){
minA=min(minA,DP[i... | 0 | 30,425,123 |
#include<cstdio>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
const int N=100005;
int n,a[N],m,v,p; long long sum[N];
inline bool cmp(CI x,CI y)
{
return x>y;
}
int main()
{
RI i; for (scanf("%d%d%d%d",&n,&m,&v,&p),i=1;i<=n;++i) scanf("%d",&a[i]);
for (sort(a+1,a+n+1,cmp),i=... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#def... | 0 | 64,928,921 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 23,001,291 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
#define ll long long
#define ar array
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[2]==s[3] && s[4]==s[5]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl... | #include<bits/stdc++.h>
using namespace std;
int dx[2] = {0,1};
int dy[2] = {1,0};
int area[17][17]={0};
int x,y;
int xg,yg;
int ans=0;
int saiki(int a,int b){
for(int i=0;i<2;i++){
if(a+dx[i] > x || b+dy[i] > y || area[a+dx[i]][b+dy[i]] == -1);
else if(area[a+dx[i]][b+dy[i]] == 2){
ans++;
}
els... | 0 | 25,047,939 |
#include "bits/stdc++.h"
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(i... | #include <cstdio>
#include <set>
int main()
{
char Command[8];
int Value;
std::multiset<int> S;
while(1){
std::scanf("%s", Command);
if(Command[0] == 'i'){
std::scanf("%d", &Value);
S.insert(Value);
}else
if(Command[1] == 'x'){
std::set... | 0 | 45,293,472 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
if (a <= 8 && a >= 0 && b <= 8 && b >= 0)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
vector<vector<int>> to(200005);
vector<ll> ans;
void dfs(int v,int p = -1){
for(int u : to.at(v)){
if(u == p)continue;
ans.at(u) += ans.at(v);
dfs(u,... | 0 | 18,182,656 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
ll paw( ll x, ll n ){
if( n == 0 ) return 1;
ll t = pow(x,n/2);
if( n%2 == 0 ){
return t*t;
}else{
return t*t*x;
}
}
int main() {
ll n,p;cin >> n >> p;
ll even = 0;
ll odd = 0;
... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | 0 | 34,717,392 |
#include<bits/stdc++.h>
using namespace std;
#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(v) (v).begin(),(v).end()
#define INF 2e9
typedef long long ll;
int main()
{
int n;
cin>>n;
vector<int> a(n);
int cnt=1,ans=0;
REP(i,n){
cin>>a[i];
if(i!=0){
... | #include <stdio.h>
#include <iostream>
using namespace::std;
struct Card{
char suit;
char value;
};
void checkStable(Card A1[], Card A2[], int N){
int stable_flg = 1;
for (int i = 0; i < N; i++) {
if (A1[i].suit != A2[i].suit) {
stable_flg = 0;
}
}
if (stable_flg) {
... | 0 | 18,864,286 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
string s;
cin>>n >>s >>k;
char e=s[k-1];
for(int i=0;i<n;i++){
if(s[i]==e){
cout<<e;
}else{
cout<<'*';
}
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | 0 | 14,281,584 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define range(i,l,h) for(int i=l;i<h;i++)
#define endl '\n'
#define I INT_MAX
#define L INT_MIN
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vi vector<int>... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int LOGN=20;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<ll> x(n);
for(int i=0;i<n;i++) cin>>x[i];
ll l; int q;
cin>>l>>q;
vector<vector<int>> dp(LOGN,vector<int>(n,0));
for(int ... | 0 | 42,408,759 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
--k;
char ch = s[k];
rep(i,n){
... | #include <bits/stdc++.h>
using namespace std;
int N;
int routedCount = 0;
int a, b;
vector<int> P;
vector<int> Q;
void calc(vector<bool> passed, vector<int> route, int passedCount) {
if (passedCount == N) {
routedCount++;
bool isA = true, isB = true;
for (int i = 0; i < N; i++) {
... | 0 | 98,041,242 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
string S; cin >> S;
ll K; cin >> K;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;... | 0 | 91,788,799 |
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair <int, int> pii;
#define pb push_back
#define f first
#define s second
#define sz(x) (int)x.size()
const int mx = 1000 * 100 + 5;
int a[mx], w[mx];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
... | 0 | 99,002,802 |
#include <bits/stdc++.h>
using namespace std ;
int main(){
int A,B;
cin >> A >> B;
long int An=A,Bn=B;
while(1){
if(A<B)swap(A,B);
if(!B)break;
A%=B;
}
if(A==1){
long int Ans = An*Bn;
cout << Ans << endl;
}else{
long int Ans = An*(Bn/A);
... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<char> >v(n,vector<char>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>v[i][j];
}
}
bool no=false;
for(int i=0;i<n;i++)
{
for(in... | 0 | 63,168,378 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
typedef long long lint;
const int N=2e5+5;
int n,val[N];
lint sum;
namespace utils{
template <class T> inline void apn(T &x,const T y){x>y?x=y:0;}
template <class T> inline void apx(T &x,const T y){x<y?x=y:0;}
template <class T> inline T cab... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
ll n,T[200001],A[200001],D[200001][2],ans=1,mod=1e9+7;
cin>>n;
rep(i,n) cin>>T[i];
rep(i,n) cin>>A[i];
if(T[n-1]!=A[0]) ans=0;
int t,a;
rep(i,n) if(T[i]==A[0]){
t=i;
... | 0 | 28,708,522 |
#include<stdio.h>
int i = 0, result;
int train[100];
int outtrain[100];
void push(int k){
train[i] = k;
i++;
}
void pop(int train[]){
int a, check = 0;
for(a = i - 1; a >= 0; a--){
if(train[a] != 0){
result = train[a];
train[a] = 0;
check += 1;
}
if(check != 0)break;
}
}
int main(){
int k, cnt = 0;... | #include<cstdio>
#include<vector>
using namespace std;
const int lim = 24*60*60;
inline int t(int h, int m, int s){
return h*60*60 + m*60 + s;
}
int main(){
int n;
while(scanf("%d",&n)){
if(n==0)break;
vector<int> x(lim+1,0);
for(int i=0;i<n;i++){
int h1,m1,s1, h2,m2,s2;
scanf("%d:%d:%d %d... | 0 | 9,949,298 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
int main(){
int a;
cin >> a;
cout << "Christmas";
rep(i, 25-a) cout << " Eve";
cout <<en... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (ll)(n) - 1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define INF (1LL << 62)
#define ... | 0 | 77,224,081 |
#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 ... | #include <bits/stdc++.h>
using namespace std ;
#define N 100010
int n , L , m ;
int a[ N ] , to[ N ] ;
int num , block , belong[ N ] ;
int nxt[ N ] , val[ N ] ;
int find( int x ) {
int l = x + 1 , r = n , ans = 0 ;
while( l <= r ) {
int mid = ( l + r ) >> 1 ;
if( a[ mid ] - a[ x ] <= L ) l = m... | 0 | 84,473,504 |
#include<iostream>
#include<queue>
#include<string>
using namespace std;
int main()
{
priority_queue<int>qu;
string p = "";
int x;
while (p != "end")
{
cin >> p;
if (p == "insert")
{
cin >> x;
qu.push(x);
}
if (p == "extract")
{
cout << qu.top() << endl;
qu.pop();
}
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 61,422,958 |
#include<stdio.h>
int p[201];
int gap = -1;
int ans = -1;
int main(){
int m, n_min, n_max;
for(;;){
scanf("%d %d %d\n",&m, &n_min, &n_max);
if(m == 0 && n_max == 0 && n_min == 0) break;
for(int i=1; i<=m; i++){
scanf("%d\n",&p[i]);
}
for(int border = n_min; bo... | #include<bits/stdc++.h>
#define HEAP priority_queue
#define rep(i,n) for(int i=0;i<(n);i++)
#define per(i,n) for(int i=(n)-1;i>=0;i--)
#define forn(i,l,r) for(int i=(l);i<=(r);i++)
#define nrof(i,r,l) for(int i=(r);i>=(l);i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y sec... | 0 | 59,888,132 |
#include <iostream>
using namespace std;
int main(){
int n, a, b, c, x;
while(cin>>n>>a>>b>>c>>x,n||a||b||c||x){
int cnt = 0;
for(int i = 0; i < n; i++){
int y;
cin >> y;
if(x == y && i == 0) continue;
while(true){
cnt++;
if(cnt > 10000) break;
x = (a*x+b)%c;
if(x == y) break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a[10010];
int n, m;
cin >> n >> m;
for(int i = 0; i < m; i++)
cin >> a[i];
int s = 0;
for(int i = 0; i < m; i++)
s += a[i];
if(s > n)
cout << "-1"... | 0 | 48,337,824 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n)-1;i>=(j);i--)
using ll=long long;
using namespace std;
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; re... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int K,N,A[100001],MAX=0,cnt=0,sum=0,B[100],T[100001],Ah[100001],Th[100001],M[100001];
cin >> N;
for(int i=0;i<N;i++){
cin >> T[i];
}
for(int i=0;i<N;i++)
cin >> A[i];
Th[0] = 1;
M[0] = T[0];
for(int i=0;i<... | 0 | 42,775,832 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int const MAX = 200010;
int cnt[MAX];
int main() {
int n, k;
cin >> n >> k;
rep(i, n) {
int a;
cin >> a;
cnt[a]++;
}
sort(cnt, cnt + n + 1, greater<int>());
i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
string s;
cin>>s;
ll cnt=0;
ll sum=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='W')
{
cnt++;
sum+=i;
}
}
for(int i=0;i<cnt;i++)
{
sum-=i;
}
c... | 0 | 56,528,454 |
#include<iostream>
#include<cmath>
using namespace std;
int main ()
{
int a, b;
cin >> a >> b;
cout << "a";
if(a > b)
cout << " > ";
else if(a < b)
cout << " < ";
else
cout << " == ";
cout << "b" << endl;
return 0;
} | #include <iostream>
int main()
{
int n;
while(1){
std::cin >> n;
if(n == 0){
break;
}
int score[n];
int sum = 0;
int max = 0;
int min = 1000;
for(int i = 0; i < n; i++){
std::cin >> score[i];
if(max < score[i]){
... | 0 | 9,849,972 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> oprt(10*N,N);
oprt.at(0) = 0;
for(int i=0; i<=N; i++){
oprt.at(i+1) = min(oprt.at(i+1), oprt.at(i)+1);
for(int j=6; i+j<=N; j*=6){
oprt.at(i+j) = min(oprt.at(i+j), oprt.at(i)+1);
for(int k=9... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin>>n>>m;
vector<string>v;
for(int i=0;i<n;i++){
string s;cin>>s;
bool t=false;
for(auto u:s){
if(u=='#'){
t=true;
}
}
if(t)v.push_back(s);
}
set<int>ind;
for(int j=0;j<m;j++){
bool t=false;
for(int ... | 0 | 69,902,796 |
#include <iostream>
using namespace std;
#define FS0 fs[v[0]]
#define FS1 fs[v[1]]
void rollv(int v[], int h[]) {
int t = v[0];
v[0] = v[1];
v[1] = v[2];
v[2] = v[3];
v[3] = t;
h[0] = v[1];
h[2] = v[3];
}
void rollh(int v[], int h[]) {
int t = h[0];
h[0] = h[1];
h[1] = h[2];
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 | 2,818,698 |
#include <cstdio>
#include <string.h>
using namespace std;
int main (void)
{
int ta=0, ha=0, i, n;
char t[101], h[101];
scanf("%d", &n);
for (i=0; i<n; i++){
scanf("%s %s", t, h);
if (strcmp(t, h) < 0)
ha += 3;
else if (strcmp(t, h) > 0)
ta += 3;
else{
ta++;
ha++;
}
}
printf("%d %d\n", ta, h... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
vector<int> to[100010];
const int INF=INT_MAX;
int main(){
int n,m;
cin>>n>>m;
vector<int> past(n);
rep(i,m){
int a,b;
cin>>a>>b;
a--;b--;
to[a].push_b... | 0 | 78,017,661 |
#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x)... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 26,584,858 |
#include<cstdio>
int main(){int N,K;scanf("%d%d",&N,&K);printf("%d\n",N-K+1);} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define int long long
#define sz(x) (int)x.size()
pair < int , int > a[1000 * 100 + 5];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, ans = 0;
cin >> n;
for(int i = 0; i... | 0 | 66,714,464 |
#include <cstdio>
#include <cstring>
int main(){
char ss[301];
int h,w,i,j;
while(true){
scanf("%d %d",&h,&w);
if((h==0)&&(w==0)) break;
strcpy(ss,"#");
for(i=0;i<w-2;i++) strcat(ss,".");
strcat(ss,"#\n");
for(i=0;i<w;i++) printf("#");
printf("\n");
for(i=0;i<h-2;i++) printf(ss);
for(i=0;i<w;i++... | #include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define ret return
#define rep(q, i, n) for(int q=i; q<n; q++)
#define forn(i, n) for(int i=0; i<n; i++)
#define mems(a,x) memset(a,x,sizeof(a))
#define ll long long
#define pb push_back
#define em emplace_back
#define mp ma... | 0 | 3,062,798 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | #include<iostream>
using namespace std;
int main(){
int mon,cnt;
while(1){
cin >> mon;
if(mon==0)break;
cnt=0;
mon=1000-mon;
while(1){
if(mon<5)break;
if(mon>=500){mon-=500;cnt++;}
else if(mon>=100 && mon<500){mon-=100;cnt++;}
else if(mon>=50 && mon<100){mon-=50;cnt++;}
... | 0 | 42,106,539 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long inner = 0;
for (int i = 0; i < k; i++) {
inner += a[i];
}
long long outer = 0;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> students, pos;
for (int i = 0; i < N; i++) {
int... | 0 | 9,985,015 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
using matrix = vector<vector<uint>>;
template <typename T>
us... | 0 | 29,287,795 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
ll n,m;
cin >> n >> m;
if(n==1 && m==1){
cout << 1 << endl;
}
else if(n==1 || m==1){
ll a = max(n,m);
cout << a-2 << endl;
}else{
cout << (n-2)*(m-2) << 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 vec... | 0 | 72,877,141 |
#include <cstdio>
int main()
{
long long x, y;
scanf("%lld%lld", &x, &y);
if (x % y == 0)
{
puts("-1");
return 0;
}
printf("%lld\n", x * (y - 1));
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
#define int long long
#define f(i,a,b) for(i=a;... | 0 | 58,847,116 |
#include<iostream>
#include <vector>
#include <cstdio>
#include<algorithm>
#include <utility>
#include<string>
using namespace std;
string str[10000] = { "" };
char ch[10000];
int input();
int main() {
int a,most=0;
a = input();
string longest;
int m[10000] = { 0 }, l;
for (int i = 0; i <= a + 1; i++) {
for (in... | #include <bits/stdc++.h>
#define INF 100000007
#define rep(i, N) for(ll i = 0; i < N; i++)
#define rep2(i, j, k) for(ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = inx(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) rep(i, ... | 0 | 98,499,061 |
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int>... | #include <iostream>
using namespace std;
int main()
{
int n, m, p;
while (cin >> n >> m >> p, n || m || p) {
int sum, w_num, x;
sum = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
sum += x * 100;
if (i == m) {
w_num = x;
i... | 0 | 10,169,904 |
#include<stdio.h>
int main()
{
long long int a,b,k;
scanf("%lld %lld %lld",&a,&b,&k);
if(a>k){
a=a-k;
}
else{
k=k-a;
a=0;
if(k>b){
b=0;
}
else{
b=b-k;
}
}
printf("%lld %lld\n",a,b);
return 0;
} | #include<bits/stdc++.h>
#include<cmath>
#define M 1000000007
#define ll long long
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define loop(n) for(ll i=0;i<n;i++)
#define loop1(n) for(ll i=1;i<=n;i++)
#define looprev(n) for(ll i=n-1;i>=0;i--)
#define fast... | 0 | 84,575,807 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m,x,y,z,fa[N],sum[N];
int Read()
{
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return f*x;
}
int Get(int x)
{
if(fa[x]==x) return x;
int f=fa[x];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<char>s(n);
ll cnt_r=0,cnt_g=0,cnt_b=0;
for(ll i=0;i<n;i++){
cin >> s[i];
if(s[i]=='R') cnt_r++;
if(s[i]=='G') cnt_g++;
if(s[i]=='B') cnt_b++;
... | 0 | 13,998,486 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long n, a, b;
cin >> n >> a >> b ;
cout << n / (a + b) * a + min(a, n % (a + b)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const int INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(int m,int n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (... | 0 | 65,887,313 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 111;
for (int i = 1; i < 10; i++) {
if (N <= ans * i) {
cout << ans * i << endl;
break;
}
else if (i == 9) {
cout << 1111 << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 25,232,264 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, a1, b, m = 0;
cin >> k >> n;
for(int i = 0;i < n;i++) {
if(i == 0) {
cin >> a1;
b = a1;
} else {
int a;
cin >> a;
if(a - b > m) m = a - b;
b = a;
if(i == n - 1 && a1 + k - a > m) m = a1 + k - a;
... | #include<bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sq(x) (x)*(x)
#define PI acos(-1.0)
#define all(x) x.begin(),x.end()
#define nl '\n'
typedef long long int ll;
typedef unsigned long long int llu;
int main()
{
int n,sz,ok=0;
... | 0 | 52,874,810 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long a[n];
for(int i=0;i<n;i++)cin >> a[i];
long sum[n];
sum[0] = a[0];
for(int i=1;i<n;i++)sum[i] = sum[i-1] + a[i];
set<long>s;
map<long,int>m;
for(int i=0;i<n;i++){
s.insert(sum[i]);
m[su... | 0 | 30,903,324 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.