code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, step = 5e4;
cin >> n;
int a[n], b[n];
a[0] = b[n - 1] = 1;
for (int i = 1; i < n; i++)
a[i] = a[i - 1] + step, b[n - i - 1] = a[i];
for (int i = 0; i < n; i++) {
in... | #include "bits/stdc++.h"
#include <unordered_set>
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb push_back
#define p... | 0 | 80,401,187 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define db(x) cout << "> " << #x << ": " << x << "\n";
#define ss cout << " ";
#define ct(x) cout << x;
#define nn cout << "\n";
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<climits>
#include<vector>
#define INF (1<<29)
#define all(c) (c).begin(),(c).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
vector<int>res;
bool check(int n,int mx){
for(int i=mx;i... | 0 | 91,842,049 |
#include<vector>
#include<iostream>
using namespace std;
#define df 0
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long int li;
int dfs(const vector<vector<int>>& adj,int a=0,int seen=-1){
int s=0;
for(int v:adj.at(a)){
if(v==seen)continue;
s^=dfs(adj,v,a)+1;
}
return s;
}
int main(){
if(df) printf... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
ll n;
cin >> n;
V<int> can = {1};
ll t = 1;
while (true) {
t *= 6;
if (t > n) break;
can.push_back(t);
}
... | 0 | 85,224,591 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
const int MAX_N = 2006;
int N, M;
int a[MAX_N];
int b[MAX_N];
ll dp[MAX_N][MAX_N];
void solve()
{
for(int i=1;i<=N;++i)for(int j=1;j<=M;++j){
(dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+MOD)%=MOD;
if(a[i-1]==b[j-1]) (dp[i][... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
us... | 0 | 76,429,155 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | #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,x;
cin >> a >> b >> x;
int s;
double the;
double pi;
the=0;
pi=acos(-1);
s=a*a*b;
if(2*x>=s){
the=atan(double(2*(s-x))/dou... | 0 | 69,361,479 |
#include <iostream>
#include <vector>
using namespace std;
int n;
vector<string> s;
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> n;
s.resize(n);
for(int i = 0; i < n; ++i) {
cin >> s[i];
s[i] = s[i] + s[i];
}
for(int i = 0; i < n; ++i) s.push_back(s[i]);
int ans = 0;
for(int... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int ans[100010];
vector <int> v[100010];
int main(){
int n;
while(cin>>n){
ll tmp=1;
memset(ans, -1, sizeof ans);
ans[1]=2;
for(int i=3; tmp<100010; ++i... | 0 | 34,501,080 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include<bits/stdc++.h>
using namespace std;
int minCoins(int coinList[], int n, int value) {
int coins[value+1];
if(value == 0)
return 0;
coins[0] = 0;
for (int i=1; i<=value; i++)
coins[i] = INT_MAX;
for (int i=1; i<=value; i++) {
for (int j=0; j<n; j++)
if (coinList[j] <= i)... | 0 | 24,867,528 |
#include<iostream>
using namespace std;
int dp[50];
int fibonacci(int x){
if(x==0 || x==1) return 1;
if(dp[x]!=0) return dp[x];
return dp[x]=fibonacci(x-1)+fibonacci(x-2);
}
int main(){
int n;
cin>>n;
cout<<fibonacci(n)<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
int main(int argc, char **argv)
{
long long N, Z, W;
std::cin >> N >> Z >> W;
std::vector<long long> a(N);
for(int i = 0; i < N; i++){
std::cin >> a.at(i);
}
if(N == 1){
std::cout << std::abs(a.at(0) - W)... | 0 | 30,736,247 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
int W[N];
int sum=0;
rep(i,N){
cin>>W[i];
sum+=W[i];
}
int T=0;
int m=1000000;
rep(i,N){
T+=W[i];
sum-=W[i];
m=min(m,abs(T-sum));
}... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define mod 1000000007
typedef long long ll;
using namespace std;
ll S[100100];
int main(){
ll n,m... | 0 | 87,268,513 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i,n) for (int i=0; i<(n); i++)
#define reps(i,s,n) for (int i=(s); i<(n); i++)
#define rep1(i,n) for (int i=1; i<=(n); i++)
#define repr(i,s,n) for (int i=(s)-1; i>=(n); i--)
#define print(a) cout << (a) << endl;... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
ty... | 0 | 7,169,280 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statis... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define MAXN 100005
#define mod 1000000007
int syutugenlist[MAXN];
int a[MAXN];
ll Pow(ll a, ll n) {
if (n == 0) return 1;
if (n % 2) return (a * Pow(a, n - 1)) % mod;
else {
ll k = Pow(a, n / 2);
return (k * k) % mod;
... | 0 | 41,827,017 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S, T; cin >> S >> T;
int s = S.size(), t = T.size();
int count = 0;
for(int i = 0; i <= s - t; i++) {
int cnt = 0;
for(int j = 0; j < t; j++) {
if(S.at(i + j) == T.at(j)) cnt++;
}
if(count < cnt) count =... | #include <iostream>
using namespace std;
int main()
{
string S;
getline(cin,S);
int count=0;
if(S.find("R",0)<3)
{
int count=1;
int n=S.length();
for(int i=0; i<n; i++)
{
if(S[i]=='R')
{
if( i<n)
{
... | 0 | 1,136,428 |
#include<bits/stdc++.h>
using namespace std;
vector<int> mkper(vector<int> p, int n){
vector<int> perm(n);
for (int i=0;i<n;i++){
perm[i] = i;
}
vector<int> nex(n);
int peak = n;
for (int i=0;i<n;i++){
nex[i] = perm[p[i]];
for (int j=p[i];j<peak-1;j++){
perm[j] = perm[j+1];
}
peak ... | #include <iostream>
using namespace std;
int main(void) {
int a;
int b;
cin >> a >> b;
string symbol;
if (a < b) {
symbol = " < ";
} else if (a > b) {
symbol = " > ";
} else {
symbol = " == ";
}
cout << 'a' << symbol << 'b' << endl;
} | 0 | 62,514,204 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int rate, kyu;
cin >> rate;
for(int r = 600, k = 8;k > 0;r += 200, k -= 1) {
if (rate < r) {
kyu = k;
break;
}
}
cout << kyu << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++){
cin >> W[i];
}
int sum = 0;
for (int i = 0; i < N; i++){
sum += W[i];
}
int sum2 = 0;
for (int i = 0; i < N; i++){
sum2 += W[i];
if (sum2 >= sum / 2.0){
if ... | 0 | 79,371,307 |
#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 : ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 67,982,755 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 8,156,470 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include<iostream>
using namespace std;
int main()
{
int a1,b1,c1,d1,a2,b2,c2,d2,T1,T2,T;
cin >> a1 >> b1 >> c1 >> d1;
cin >> a2 >> b2 >> c2 >> d2;
if(a1>100){
cout << "エラー" << endl;
return 0;
}
if(b1>100){
cout << "エラー" << endl;
return 0;
}
if(c1>100){
cout << "エラー" << endl;
... | 0 | 72,159,886 |
#include<iostream>
using namespace std;
int main()
{
int i, n, a[10009],max ,min;
long long int sum = 0;
cin >> n;
max = -1000001;
min = -max;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
for(i = 0; i < n; i++)
{ sum += a[i];
if (a[i] > max)max = a[i];
if (a[i] < min)min = a[i];
}
cout << min << " " << ma... | #include<bits/stdc++.h>
using namespace std;
typedef long long lol;
lol gcd(lol a,lol b);
lol lcm(lol a,lol b);
int main(){
lol n;
cin>>n;
vector<lol> t(n+10,1);
for(lol i=0;i<n;i++){
cin>>t[i];
}
lol ans=lcm(t[0],t[1]);
for(lol i=2;i<n;i++){
ans=lcm(ans,t[i]);
}
cout... | 0 | 7,895,039 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int a=0,b=0,c=0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='0'){
a++;
}
else if(s.at(i)=='1'){
b++;
}
}
c=min(a,b);
cout<<c*2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
class SegTree {
constexpr static int DEFAULT = INT_MAX;
int Combine(int l, int r) { return min(l,r); }
vector<int> seg_tree;
int n = 0;
void Build(vector<int>& A, int v, int tl, int tr) {
if (... | 0 | 12,529,864 |
#include <iostream>
using namespace std;
int main(){
int m,nmax,nmin;
while(cin>>m>>nmin>>nmax,m){
int P[m];
int M=0,ans=0;
for(int i=0;i<m;i++){
cin>>P[i];
}
for(int i=nmin-1;i<nmax;i++){
if(M<=P[i]-P[i+1]){
M=P[i]-P[i+1];
... | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <deque>
using namespace std;
int d[100005];
int K;
void solve(){
fill(d,d+K,1<<30);
d[1]=1;
deque<int>que;
que.push_front(1);
while(!que.empty()){
int v=que.front();que.pop_front();
int to=(v+1... | 0 | 41,479,567 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#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(){
string s,t;
cin >> s >> t;
vector<int> start(26,-1),goal(26,-1);
rep(i,s.size()){
int a = s[i] - 'a';
... | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(true){
int n, min, max;
cin >> n >> min >> max;
if(n == 0 && min == 0 && max == 0) break;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i]... | 0 | 36,966,568 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int h; cin >> h;
int w; cin >> w;
vector<string> a(h);
for (int i = 0; i < h; i++) {
cin >> a[i];
}
vector<bool> row(h, false);
vector<bool> col(w, false);
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == '#') {
row[i... | #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 Combinat... | 0 | 23,017,188 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t min = 0;
int n, k;
cin >> n >> k;
vector<int> monsters(n);
for (int i = 0; i < n; i++){
cin >> monsters.at(i);
}
sort(monsters.begin(), monsters.end(), std::greater<int>() );
if (n <= k){
cout << 0 << endl;
return 0;
}
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
ll N, M;
cin >> N >> M;
vector<ll> a(N);
... | 0 | 97,384,389 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for(int i = (int)(k);i < (int)(n);i++)
int K, a = 1, b = 1;
vector<map<int, int>> dp(11);
void c() {
while(K > dp[a][b]) {
K -= dp[a][b];
b++;
}
cout << b;
if(0 < b) b--;
a--;
}
int main() {
cin >> K;
vector<int> S(11);
rep(i, 0,... | #include <iostream>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int h, w, k;
int ans = 0;
cin >> h >> w >> k;
vector<string> s(h);
rep(i, h) cin >> s[i];
rep(is, 1 << h) rep(js, 1 << w){
... | 0 | 70,267,286 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | #include <bits/stdc++.h>
using namespace std;
int sumOfDigits( int x )
{
int sum = 0;
while ( x > 0 )
{
sum += x % 10;
x /= 10;
}
return sum;
}
int main(void)
{
int n,a,b;
cin >> n >> a >> b;
int ans = 0;
for ( int i = 1; i <= n; i++ )
if ( sumOfDigits(i) >= ... | 0 | 1,865,588 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double PI = atan(1.0) * 4;
const int di[4] = { -1, 0, 1, 0} ;
const int dj[4] = {0, -1, 0, 1} ;
const ll INF = (ll)2e18 + 50;
const int maximum = numeric_limits<int>::min();
const int minimum = numeric_limits<int>::max... | 0 | 93,854,516 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, A, B;
cin >> N >> A >> B;
vector<int... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define ii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all... | 0 | 51,341,444 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int n, k = 0, i = 0; cin >> n;
vector<ll> a(n), x(n-1), y(n-1);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
while (k+1 < n-1 && a[k+1] <... | #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() {
ll N, K;
cin >> N >> K;
vector<ll> H(N);
rep(i,N) cin >> H.at(i);
ll ans = 0;
sort(H.begin(), H.end(), greater<ll>());
if (N > K) {
... | 0 | 100,305,714 |
#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... | #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... | 0 | 47,856,412 |
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll combination(ll n, ll r){
if(n < r) return 0;
if(r == 0||r == n) return 1;
... | #include <iostream>
using namespace std;
int main()
{
int num;
const string kei[] = {".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
... | 0 | 18,679,845 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n);i++)
int main() {
long long N,buf;
vector<int> ans;
cin >> N;
for(long long i=1;i*i<=N;i++){
if(N%i==0){
buf = N/i;
if(to_string(buf).length()>to_string(i).length()){
... | 0 | 51,896,253 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> p(n);
rep(i, n) cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
ll ans = 0;
rep(i, n) ... | #include <iostream>
#include<algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include<map>
#include<set>
#include<sstream>
#define INF 0x3f3f3f3f
#define DOF 0x7f7f7f7f
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long ... | 0 | 35,518,421 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | 0 | 98,167,119 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
char S[205];
int main(){
scanf("%s",S);
int LEN;
for(LEN = 0; S[LEN] != '\0'; LEN++);
int ans = 0;... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n,a,b;
string str,ch,p;
char c;
cin>>str;
cin>>n;
for(int i=0;i<n;i++){
cin>>ch;
if(ch=="replace"){
cin>>a>>b>>p;
for(int j=a,k=0;j<=b;j++,k++)str[j]=p[k];
}
if(ch=="reverse"){
cin>>a>>b;
for(in... | 0 | 50,366,331 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;cin>>n;
ll u=pow(2,n);
ll a[u];
for(ll i=0;i<u;i++)cin>>a[i];
ll mm[u][2];
for(ll i=0;i<u;i++){
mm[i][0]=a[0];
mm[i][1]=0;
}
ll ma=0;
for(ll i=1;i<u;i++){
if(a[i]>=mm[i][0]){
mm[i][1]=mm[i][0];
... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int change = 'a' - 'A';
string str;
getline( cin, str );
for( int i = 0; i < str.size(); i++ )
{
if( str[i] >= 'A' && str[i] <= 'Z' )
... | 0 | 54,212,560 |
#include<bits/stdc++.h>
using namespace std;
long long n;
int main(){
ios::sync_with_stdio(false);
cin>>n;cout<<800*n-n/15*200<<endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 64,787,683 |
#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;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
int main() {
cin >> N >> K;
ll cnt = N / K;
if (K % 2 == 1) {
cout << cnt * cnt * cnt << endl;
... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), ar... | 0 | 74,006,234 |
#include <stdio.h>
#include<cmath>
using namespace std;
int main(){
double x1,x2,x3,x4,y1,y2,y3,y4;
int n;
scanf("%d",&n);
for(int i=0; i<n; i++){
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
if(abs((y2 - y1)*(x4 - x3) - (y4 - y3)*(x2 - x1) ) < 0.0000000001){
printf("YES\n");
... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<iostream>
using namespace std;
int main() {
const int n = 6;
int dice[n];
int top, front;
int p;
int dice_result[6];
const int dice_tem[4][6] = { { 3,2,6,1,5,4 },{ 2,6,3,4,1,5 },
{ 5,1,3,4,6,2 },{ 4,2,1,6,5,3 } };
for (int i = 0; i <... | 0 | 8,606,920 |
#include<bits/stdc++.h>
using namespace std;
int n,m,i,j,a,b,c,d,x=0,y=200;
int main()
{
cin>>n>>m>>a>>b;
a+=100;b+=100;
for(;i<n;i++)cin>>c,x=max(x,c+100);
for(i=0;i<m;i++)cin>>d,y=min(y,d+100);
if(min(y,b)-max(x,a)>0)cout<<"No War";
else cout<<"War";
} | #include <bits/stdc++.h>
using namespace std;
bool in_range(int a, int b, int x) {
if(a <= x && x <= b) {
return 1;
}
else {
return 0;
}
}
int main() {
int N, M;
cin >> N >> M;
int L_max = 1;
int R_min = N;
for(int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
if(L > L_max) {
... | 0 | 56,943,146 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #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) { std::cout << #a << " = " << a << "\n"; }
template<class T1, clas... | 0 | 84,317,398 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); ++i) {
if (i%2 == 0) cout << s[i];
}
cout << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<set>
int main () {
int n;
std::cin >> n;
std::vector<std::string> w(n);
std::set<std::string> ws;
for (int i = 0; i < n; i++)
{
std::cin >> w[i];
ws.insert(w[i]);
}
bool f1 = ws.size() == n ? true : false;
... | 0 | 65,470,739 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int N, ans;
cin >> N;
ans=0;
vector<int> a(N);
for (int i=0; i<N; i++) {
cin >> a[i];
}
for (int j=0; j<N; j++) {
if (a[a[j]-1]==j+1) {
ans=ans+1;
}
}
... | #include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
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; }... | 0 | 45,579,891 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
char str[256];
char f[4]={'m','c','x','i'};
int n;
for(scanf("%d\n",&n);n--;){
int c;
int ans[2]={0,0};
for(int i=0;i<2;i++){
int tmp=0;
while((c=getchar())!=' '&&c!='\n'){
if(isdigit(c)){
tmp*=10;
tmp+=c-'0';
}... | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
struct Node{
int key;
Node *prev, *next;
};
Node *nil;
void init(){
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key){
Node *x = (Node *)malloc(sizeof(Node));
x->key = key;
x->next = ... | 0 | 90,351,537 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<queue>
#include<stdio.h>
using namespace std;
typedef struct{
int x,y;
}p;
char a[1005][1005];
p acm[11];
p s,g;
int b[1005][1005];
int H,W,N;
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int bfs(p s,p g)
{
queue<p> q;
p n;
memset(b,-1... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
while(true){
string S;
cin >> S;
if( S == "0")
break;
int sum = 0;
for(auto& c : S){
sum += c - '0';
}
cout << sum << endl;
... | 0 | 85,688,516 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; 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)
#define sz(x) ((in... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int i... | 0 | 55,993,802 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
const ll mod = 1e9 + 7;
main(){
int a,b;
cin >> a >> b;
if(b==1){
cout << 0 << endl;
}else{
cout << a-b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 0 | 30,000,412 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<string> T={"dream","dreamer","erase","eraser"};
reverse(S.begin(),S.end());
for(int i=0;i<4;i++){
reverse(T.at(i).begin(),T.at(i).end());
}
bool all_cut=true;
for(int i=0;i<S.size();){
bool cut=false;
for(in... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int H, W; cin >> H >> W;
vector<string> ss(H);
for (int i = 0; i < H; ++i) cin >> ss[i];
vector<bool> br(H, true), bc(W, true);
for (int r = 0; r < H; ++r) {
... | 0 | 15,216,225 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval... | #include<iostream>
#include<vector>
using namespace std;
int main(){
long long n = 50;
long long k; cin >> k;
long long a = k / n;
long long b = k % n;
vector<long long> ans(n, a + n - 1);
for(long long i = 0; i < b; i++){
for(long long j = 0; j < n; j++){
if(i == j){
... | 0 | 63,458,389 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod = 100000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
void solve()
{
ll N;
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<ll> xa = a;
sort(xa.begin(), xa.end());
xa.erase(unique(xa.begin(), xa.end()), xa.end(... | 0 | 6,795,146 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#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 < ... | #include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define ... | 0 | 23,266,976 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | #include <bits/stdc++.h>
#define fi first
#define se second
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n;
ll a[N], p[62];
void insert(ll x) {
for(int i = 60; i >= 0; i--) {
if(x >> i & 1) {
if(!p[i]) {
p[... | 0 | 50,902,865 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int P , Q , R , S ;
cin >> P >> Q >> R ;
S = fmin(P , fmax(Q , R));
Q = fmin( Q , R);
cout << S + Q << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
int ans;
if(H%3==0 || W%3==0) ans=0;
else if(H==2 && W==2) ans=1;
else{
int pall = min(H, W);
int triH = max({H/3*W, (H-H/3)*(W/2), (H-H/3)*((W+1)/2)})-min({H/3*W, (H-H/3)*(W/2), (H-H/3)*((W+1)/2)}... | 0 | 7,498,015 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N,M;
cin >>N>>M;
vector<int>a(M),b(M),c(M);
rep(i,M){
cin>>a.at(i)>>b.at(i)>>c.at(i);
a.at(i)--;
b.at(i)--;
}
vector<vecto... | 0 | 24,795,730 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
ll n;
ll cnt = 0;
ll base = 5;
... | #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... | 0 | 22,321,481 |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return ... | #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;
map<P, ll> dis{};
int N;
vector<vector... | 0 | 34,200,809 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vecto... | #include <iostream>
#include <map>
#include <algorithm>
#include <queue>
#include <list>
#include <string>
#include <cmath>
#include <stack>
#include <cstdio>
#include <fstream>
#include <climits>
#include <set>
#include <vector>
#include <tuple>
#include <cstring>
#include <functional>
#include <utility>
#include <iom... | 0 | 51,635,812 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 100000007;
using Graph = vector<vector<int>>;
int main(){
int A,B;
cin >> A >> B;
int ans = -1;
for(int p = 1; p < 2000;++p){
int a = p*... | 0 | 62,848,749 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(b <= c || a >= d) cout ... | #include<bits/stdc++.h>
#include<tuple>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;vector<ll>v[100005];
cin>>n>>m;map<ll,ll>pos;
ll p[m+1],y[m+1];
for(int i=1;i<=m;i++){
cin>>p[i]>>y[i];
v[... | 0 | 52,683,993 |
#include<iostream>
using namespace std;
int main(){
int a;
int b;
int c;
int y = 0;
cin >> a;
cin >> b;
cin >> c;
for (int x = a; x <= b; ++x){
if (c % x == 0){
++y;
}
}
cout << y << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
cin >> str;
int y, m;
y = stoi(str.substr(0,4));
m = stoi(str.substr(5,2));
if(y < 2019){
cout << "Heisei" << endl;
}else if(y > 2019){
cout << "TBD" << endl;
}else{
if(m <= 4){
... | 0 | 53,979,559 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, D, X, s{}, A; cin >> N >> D >> X;
while (N--) cin >> A, s += (D - 1) / A + 1;
cout << s + X;} | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <boost/multiprecision/cpp_int.hpp>
#define repi(i,a,b) for(ll i=(a);i<(b)... | 0 | 28,014,825 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
string S;
cin>>S;
int a=S.size();
for(int i=a; 0<i; i--){
if(i!=a){
if(i%... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dp[1000000];
int INF = 1001001001;
int main() {
int N; cin >> N;
rep(i, N+1){
dp[i] = i;
}
for (int i = 0; i < N; i++){
int now6 = 6;
w... | 0 | 88,402,032 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using uintl = unsigned long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (i... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 32,380,685 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#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() {
string O, E;
cin >> O >> E;
if (O.size() == E.size()) {
for (int i = 0; i < O.size(); ++i) {
... | 0 | 91,117,305 |
#include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
ll a[100005],b[100005];
void solve(){
ll n,res=0;
cin>>n;
for(ll i=1;i<=n;i++)
cin>>a[i];
for(ll i=1;i<=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int,int>;
struct UnionFind{
vector<int> d;
UnionFind(int n): d(n,-1){}
int root(int x){
if(d[x] <0)return x;
return d[x] = root(d[x]);
}
int unite(int x,int y)... | 0 | 61,544,456 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
cin >> n;
vector<int> A(n);
for (int i = 1; i <= n; ++i) {
cin >> a;
A[i-1] = a - i;
}
sort(A.begin(), A.end());
int b = A[n/2];
long long res = 0;
for (int i = 0; i < n; ++i) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
long r = 0;
long g = 0;
long b = 0;
for(int i=0;i<s.length();i++){
if(s[i] == 'R')r++;
else if(s[i]=='G')g++;
else b++;
}
long tmp = r*g*b;
int maxLen = s.len... | 0 | 54,936,644 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 66,463,467 |
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int mxN = 1e5 + 5;
int color[mxN], red[mxN], green[mxN];
int main() {
int n, m, r, g, c;
cin >> n >> m >> r >> g >> c;
for(int i = 0; i < r; ++i)
cin >> red[i];
for(int i = 0; i < g; ++i)
cin >> green[i];
for(int i = 0; i < c;... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#def... | 0 | 10,120,902 |
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> llVEC;
typedef vector<P> PVEC;
typedef priority_queue<P,PVEC,greater<P> > PPQ;
typedef priority_queue<ll, llVEC, greater<ll> > llPQ;
#define rep(i,a,n) for(ll i = a... | 0 | 86,780,481 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 47,328,866 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dp[1001][1001],n,m,mod=1e9+7;
char a[1001][1001];
int call(int i,int j){
if(i>=n || j>=m || a[i][j]=='#')
return 0;
if(i==n-1 && j==m-1)
return 1;
if(dp[i][j]!=-1)
return dp[i][j];
int res=(call(i+1,j)+call(i... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 0 | 28,442,219 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) (x).begin(), (x).end()
template <typename T> using ord_set = tree <T, null_type, less <T... | #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;
int gcd(int a, int b) { return b != 0 ? gcd(... | 0 | 57,284,564 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int o = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a.size(); j++) {
if (i != j) {
if (a[i] == a[j]) {
o++;
}
}
}
}
if (o == 0) {
cout << "yes" << endl;
}
else {
cou... | #include<bits/stdc++.h>
using namespace std;
#define SCD(t) scanf("%d",&t)
#define SCLD(t) scanf("%ld",&t)
#define SCLLD(t) scanf("%lld",&t)
#define SCC(t) scanf("%c",&t)
#define SCS(t) scanf("%s",t)
#define SCF(t) scanf("%f",&t)
#define SCLF(t) scanf("%lf",&t)
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i,... | 0 | 7,257,139 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
int count = 0;
for (int i = 0; i < N-1; i++) {
for (int j = i+1; j < N; j++) {
count += d.at(i)*d.at(j);
}
}
cout << count << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | 0 | 26,764,607 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll n,k;cin>>n>>k;
cout<< (k==1? 0 :(n-k) );
} | #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;
} | 0 | 40,674,463 |
#include<bits/stdc++.h>
using namespace std;
string s;
char a[10][10];
int sum;
int ans;
int main()
{
int h,w,k;cin>>h>>w>>k;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin>>a[i][j];
if(a[i][j]=='#')
{
sum++;
}
}
}
int cnt=0;
for(int i=0;i<(1<<h);i++)
{
for(int j=0;j<(1<<w);j++)
{
... | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | 0 | 15,445,375 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
using VB = vector<bool>;
using VVB = vector<VB>;
#def... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | 0 | 89,342,571 |
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <tuple>
using namespace std;
using ii = pair < int, int >;
using ti = tuple < int, int, int>;
using lint = long long;
const int N = 105;
int a[N];
ve... | #include <bits/stdc++.h>
using namespace std;
#define add(x) accumulate(x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i=a; i<(b); i++)
#define h... | 0 | 89,942,999 |
#include <bits/stdc++.h>
#define dbg() cerr <<
#define name(x) (#x) << ": " << (x) << ' ' <<
using namespace std;
void NO() {
cout << "-1\n";
exit(0);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int> leaves(n + 1);
for (int &x : leaves) {
cin >> x;
}
if (n == 0) {
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int main()
{
map<char, int> mp;
mp['r'] = 0;
mp['p'] = 1;
mp['s'] = 2;
int n, k, val[3], ans = 0;
string s;
cin >> n >> k >> val[2] >> val[1] >> val[0] >> s;
vector<int> prev(n, 1);
for (in... | 0 | 3,322,565 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin>>N>>T;
int t[N];
for(int i=0;i<N;i++){
cin>>t[i];
}
int ans=T;
for(int i=0;i<N-1;i++){
if(t[i+1]-t[i]<T){
ans+=t[i+1]-t[i];
}
else{
ans+=T;
}
}
cout<<ans<<endl;
} | #include <stdio.h>
#include <string.h>
int main(int argc, const char * argv[]) {
char str[1000][33]={};
int strId[1000]={};
char strTmp[33]={};
int i, j, l = 0;
int mt=0;
int cm=0;
int mm=0;
char ch;
for(i=0;i<1000;i++){
scanf("%c", &ch);
if(ch==' '||ch=='\n'){
... | 0 | 67,241,246 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> arr(n, vector<int>(3));
for(int i = 0;i<n;i++){
cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = ... | #include <iostream>
#include <map>
#include <set>
using namespace std;
int main()
{
map<long long, long long> pp, p;
long long m, n, a, s = 0, ss = 0, i;
string ks;
cin >> m >> n;
while (n--)
{
cin >> a >> ks;
if (ks[0] == 'W' && p[a] == 0)
pp[a]++;
else if (k... | 0 | 53,962,390 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
vector<long long int>a(200000);
long long int n,c=-1,ans=0;
cin>>n;
for(long long int i=0;i<n;i++){
cin>>a[i];
}
sort(a.begin(),a.end(),greater<>()... | #include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; ++i) {
for (int j = 1; j < 10 ; ++j) {
cout << i;
cout << 'x';
cout << j;
cout << '=';
cout << i * j;
cout << endl;
}
}
return 0;
} | 0 | 46,975,895 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
#define f(i, l, r) for (int i = l; i <= r; i++)
#define rf(i, r, l) for (int i = r; i >= l; i--)
#define all(x) (x).begin(), (x).end()
#define sf(a) scanf("%d",&a)
#define llsf(a) scanf("%lld"... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <functional>
#include <map>
#include <queue>
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
int main(int argc, const char * argv[]) {
... | 0 | 49,275,037 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans=0;
cin >> n;
vector<long> a(n),b(n);
set<long> x;
for(long i=0;i<n;i++) {
cin >> a[i];
b[i]=a[i];
}
sort(b.begin(),b.end());
for(long i=0;i<n;i+=2) x.insert(b[i]);
for(long i=1;i<n;i+=2) if(x.count(a[i])) ans++;
cout << an... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 44,155,942 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define watch(x) cout << "["<<(#x) << " is " << (x) << "]" << endl
void watchVecI(vector<int>a){
for(int i = 0; i < a.size(); ++i){
cout << a[i] << " ";
}
cout << endl;
}
void watchVecS(vector<string>a){
for(int i = 0; i < a.size(); ++i){... | 0 | 67,731,254 |
#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 n, l;
bool comp (string x, string y) {
return x+y<y+x;
}
int main() {
cin >> n >> l;
vector<string> s(n);
rep(i,n) cin >> s.at(i);
sort(s.begin(), s.end(), ... | #include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
using namespace std;
int main() {
int n;
cin >> n;
vector<pr > Q;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
Q.push_back({ a,i });
}
sort(Q.begin(), Q.end());
for (pr p : Q) {
cout << p.second+1<<' ';
}
return 0;
} | 0 | 93,837,035 |
#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 h,w;
cin >> h >> w;
int a,b;
cin >> a >> b;
int ans[1005][1005];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(i<b && j<a){
ans[i][j] = 1;
}... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
long long int A, B, K; cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 != 0) A--;
B += A / 2;
A /= 2;
}
else {
... | 0 | 64,847,366 |
#include <iostream>
#include <cmath>
using namespace std;
int s;
void com(int c,int p[100],int a,int b){
if(c==a){
int m = 0;
for(int i=1;i<=a;i++) m += p[i];
if(b==m) s++;
}
else{
for(int i=p[c]+1;i<=min(9,b-p[c]);i++){
p[c+1] = i;
com(c+1,p,a,b);
}
}
}
int main(){
int a,b;
while(1){
cin >> a >... | #include <bits/stdc++.h>
#define int long long
#define For(i,a,b) for (int i = a; i <= (b); ++i)
#define For2(i,a,b) for (int i = a; i >= (b); --i)
#define test int _t; cin >> _t; while (_t--)
#define pii pair<int, int>
#define mpii map<int, int>
#define all(a) a.begin(), a.end()
#define pb push_back
#define fi first
#... | 0 | 42,353,678 |
#include <iostream>
#include<stdio.h>
using namespace std;
int main()
{
int x,y;
cin >> x;
cin >> y;
printf("%d %d %.5lf",x/y,x%y,(double)x/y);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
string s;
vector<string> a(0);
for(int i=0; i<H; i++)
{
cin >> s;
for(int j=0; j<W; j++)
if(s[j]!='.'){
a.push_back(s);
break;
}
}
for(int j=0; j<W; j++){
int wi=0;
for(int i=0... | 0 | 19,690,441 |
#include<iostream>
#include<vector>
using namespace std;
bool check(vector<int> u, int x)
{
for(int i=0;i<u.size();i++)
{
if(u[i]<x)
return false;
}
return true;
}
int main()
{
int n,flag=0,y,m,x,ans=INT_MAX;
cin>>n>>m>>x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
for(int i=0;i<n;i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> a(M), b(M);
for(int i=0; i<M; i++) cin >> a[i] >> b[i];
vector<int> cnt(N+1, 0);
for(int i=0; i<M; i++)
{
cnt[a[i]]++... | 0 | 78,204,746 |
#include <bits/stdc++.h>
const int N=100005,M=20;
using namespace std;
int n,L,q,ar[N],nx[M][N];
int calc(int i){
int l=i,r=n,ans=-1;
while(l<=r){
int m=(l+r)/2;
if(ar[m]-ar[i]<=L){
ans=m;
l=m+1;
}else{
r=m-1;
}
}
return ans;
}
int kth(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define maxN 200005
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
{
freopen("input.tx... | 0 | 31,269,512 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
int m... | #include <bits/stdc++.h>
using ll=long long;
using namespace std;
ll mod=10007;
ll i,j,k,l;
vector<ll> dp(200001),cnt(10000);
int main(){
int n,p;cin>>n>>p;
string s;
cin>>s;
cnt.resize(p);
for(i=0;i<200001;i++){dp[i]=0;}
for(i=0;i<p;i++){cnt[i]=0;}
cnt[0]++;
ll pow_ten=1,ans=0;
if(!... | 0 | 75,174,677 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++){
cin >> vec[i];
}
sort(vec.begin(), vec.end());
double ans = 0, tmp;
for (int i = 0; i < N; i++){
tmp = vec[i];
if(i == 0){
tmp /= pow(2, N - 1);
ans += tmp;... | 0 | 26,966,862 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 | 29,874,265 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
int prev = 0; long long ans = 0;
for (int i = 0; i < n; i++) {
int t = prev + 1;
int s = v[i] - t;
if (s > 0) {
ans += (s + t-1) ... | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | 0 | 100,304,007 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int dp[1002][1002];
int main(){
int n;cin >> n;
string x, y;
while(n--){
cin >> x >> y;
for(int i = 1;i <= x.size();i++){
for(int j = 1;j <= y.size();j++){
if(x[i-1] == y[j-1])dp[i][j] = dp[i-1][j-1] + 1;
else dp[i][j] = m... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX_N 50
int v[MAX_N];
int n;
int k;
int favour_left[MAX_N][MAX_N + 1];
int favour_right[MAX_N][MAX_N + 1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
int i;
for(i = 0; i < n; ++i){
... | 0 | 92,560,749 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int N,A,B,C,X;
while(cin>>N>>A>>B>>C>>X,N){
int c=0;
bool f=true;
rep(i,N){
int y;
cin>>y;
for(;;c++){
if(c>10000){
f=false;
break;
}
if(X==y) break;
X=(A*X+B)%C;
}
X=(A*X+B)%C;
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<iomanip>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
int N, K; cin >> N >> K;
int tmp, cnt;
long double ans=0.0, t;
... | 0 | 61,785,011 |
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> divisor(int64_t n){
vector<int64_t> div;
for(int64_t i=1;i*i<= n;++i) {
if(n%i==0) {
div.push_back(i);
if(i*i!=n) div.push_back(n/i);
}
}
sort(begin(div),end(div));
return (div);
}
int main(){
int64_t N;
cin>>N;
vector<int... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 32,128,175 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typed... | 0 | 3,011,678 |
#include<iostream>
using namespace std;
string s;
int a,n;
int main(){
cin>>n>>s>>a;
for(register int i=0;i<n;i++){
if(s[i]!=s[a-1])cout<<'*';
else cout<<s[i];
}
} | #include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
typedef long long ll;
const ll mod=1000000007;
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
int main() {
ll n;cin>>n;
ll cnta =0,cntb =0,cntba =0, out=0;
for(ll i=0;i<n;++i){
string s;cin>>s;
if(s[0]=='B'&&s[s.size()-1]=... | 0 | 99,384,243 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, M, a, b;
cin >> N >> M;
vector<bool> from1(N, false), fromN(N, false);
rep(i, M) {
cin >> a >> b;
if (a == 1) from1[b] = true;
if (b == N) fromN[a... | 0 | 56,498,257 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.