code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v),end()
#define pb push_back
typedef long long ll;
typedef pair<int,int> P;
template<typename A,typename B> inline void chmin(A &a,B b){if(a>b) a=b;}
template<typename A,typename B> inline void chmax(A &a,B... | #ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P>... | 0 | 8,528,727 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define G() Cr=getchar()
int Xr;char Cr;
inline int rd(){
Xr=0,G();
while(Cr<'0'||Cr>'9')G();
while(Cr>='0'&&Cr<='9')Xr=(Xr<<3)+(Xr<<1)+Cr-'0',G();
return Xr;
}
#define MAX_N 100002
int n,va[MAX_N];
int L,q,l,r,ans;
in... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rp(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
int main(){
ll n; int x, m; cin>>n>>x>>m;
int mn = min(n, (ll)m);
vector<int> P;
ll sum_p = 0;
vector<int> X(m, -1);
rp(i, 0, mn){
if(X[x] > -1){
int pre_len = X[x];
int cyc_len = P.si... | 0 | 61,974,813 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
const int64_t MOD = 1000000007;
int main() {
int N; string S;
cin >> N >> S;
int64_t ans = 0;
map<char, int> mp;
for(auto &t : S) {
int64_t tmp = 1;
for(char c = 'a'; c <= 'z'; ++c) {
... | 0 | 11,968,629 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
scanf("%lld%lld%lld", &n, &a, &b);
long long full = n / (a + b);
long long res = full * a + min(a, n - full * (a + b));
printf("%lld\n", res);
} | #include <iostream>
#include <cstdio>
#include <utility>
using namespace std;
class Dice{
int T,S,E,W,N,D;
public:
Dice(int T, int S, int E,
int W, int N, int D)
: T(T), S(S), E(E),
W(W), N(N), D(D) {}
int get_top(){ return T; }
int get_south(){ return S; }
int get_east() { return E; }
void ... | 0 | 60,710,059 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
int amari = X%100;
int shou = X/100;
if(X>=100 && amari<=shou*5){cout << 1 << endl;}
else{cout << 0 << endl;}
} | #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;
int main() {
int a, b;
cin >> a >> b;
int h = 100, w = 100;
vector<vector<char>> s(101, vector<char>(101));
rep(i, h / 2) {
rep(j, w) s[i][j]... | 0 | 51,831,219 |
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n,m;
cin >> n >> m;
priority_queue<int> q;
rep (i, n) {
int a;
c... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
int main() {
int n , a;
cin >> n >> a;
if (n % 500 - a <= 0)
cout << "Yes" << "\n";
else
cout << "No" << "\n";
} | 0 | 85,830,331 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <vector>
using namespace std;
const double interest = 0.05;
int weeklyAdd(int debt) {
debt = debt * (1 + interest);
if (debt % 1000 != 0)
debt = (debt / 1000 + 1) * 1000;
return debt;
}
int main(int argc, cha... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);... | 0 | 46,830,957 |
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define ll long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const ll MOD=1e9+7;
void solve(){
string s;
cin >> s;
cout << s.substr(0,5);
cout << ' ';
cout <<... | #include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define ll long long
#define mod 1000000007
#define C 0.5772156649
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define pil pair<int,ll>
#define pii pair<int,int>
#define ull unsigned long long
#d... | 0 | 38,815,149 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <iostream>
using namespace std;
int main(){
int n;
int result = 0;
while(cin >> n){
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
for(int k=0; k<10; k++){
for(int l=0; l<10; l++){
if(i+j+k+l == n){
... | 0 | 17,540,647 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
int n;
cin >> n;
vector<int> a(n);
int i;
rep(i,n) cin >> a[i];
ll ans = 0;
ll sums = 0;
rep(i,n)
{
if(a[i] == 0)
{
ans += sums/2;
sums... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | 0 | 9,083,408 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin>>S>>T;
int U=0;
for(int X=0;X<3;X++){
if(S[X]==T[X]){
U++;
}
}
cout<<U<<endl;
} | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;cin>>n;
vector<ll> vect;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
if(i*i!=n){
vect.push_back(i);
vect.push_back(n/i);
}
else{
vect.push_back(i);
}
}
}... | 0 | 63,006,850 |
#include <stdio.h>
int main() {
int kids;
long int sum = 0;
scanf("%d", &kids);
for (int i = 1; i <= kids; i++) {
sum += i;
}
printf("%ld", sum);
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans=0;
cin >> N >> K;
vector<int> A(N);
for(int i=1;i<=N;i++) {
cin >> A[i];
if(A[i]>=K) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 76,196,438 |
#include <iostream>
using namespace std;
int main(){
string s;
cin>>s;
cout<<(s.substr(0,4)=="YAKI"?"Yes\n":"No\n");
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>
using namespace std;
#define FOR(i,... | 0 | 52,958,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, std::vector<long long> A)
{
sort(A.begin(), A.end());
if (A[0] == 0)
{
cout << 0 << endl;
return;
}
ll ans = 1;
for (ll i = 0; i < N; i++)
{
if (ans > (ll)1e18 / A[i])
... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(x, arr) for (auto& x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end... | 0 | 97,913,202 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N,u,c,ans;
cin>>N>>c;
if(N+c==15){
cout<<'+'<<endl;
}
else if(N*c==15){
cout<<'*'<<endl;
}
else{
cout<<"x"<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int lhs = c%b;
int temp = a%b;
for(int i=0;i<=b-1;i++)
{
if( (i*temp)%b == lhs )
{
cout<<"YES";
return 0;
}
}
cout<<"NO";
} | 0 | 87,248,495 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int a,b,c;cin>>a>>b>>c;
if(a==b&&b==c)cout<<"Yes";
else cout<<"No";
} | #include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | 0 | 96,534,100 |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A){rep(i,A.size()){cout << A[i] << " ";}cout << "\n";}
int main(){
int n;
cin >> n;
vector<int> d(n);
rep(i,n)cin >> d[i];
int ans = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,... | 0 | 49,583,560 |
#include<stdio.h>
#include<string.h>
int main(){
int h,m,n,i,j,k,len;
char work;
char s[200];
while(1){
scanf("%s",s);
len=strlen(s);
if(s[0]=='-')break;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&h);
for(j=0;j<h;j++){
work=s[0];
for(k=0;k<len-1;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>;
ll x = 1e9 + 7;
int main() {
int k;
cin >> k;
vector<ll> x(k+5);
int i = 1, j = 1;
while (j <= k) {
if (j < 10) {
x[j] = j;
j++;
}
else {
i... | 0 | 25,910,898 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<long long> s(5);
cin >> s[0] >> s[1] >> s[2] >> s[3] >> s[4];
long long minv = 10000;
do{
long long order_time = 0;
long long come_time = 0;
for(long long i = 0; i... | 0 | 56,977,213 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,H;
cin >> N >> H;
if (500*N >= H)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define INF 1e9
int main(void){
int n;
cin >> n;
int unwanted;
vector<int> c(n + 1);
cin >> c[0] >> c[1];
for(int i = 2; i <= n; i++){ cin >> unwanted >> c[i]; }
vector<vector<int> > dp(n, vector<int>(n + 1, INF));
for(int i... | 0 | 12,612,436 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define pb push_back
#define ff first
#define ss second
#define INF int(3e9)
#define BIG_INF ll(9e18)
#define SIZE 100001
#defin... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
int N;
cin >> N;
int A[N];
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A,A+N);
int ans = 0;
int num = -1;
for(int i=0;i<N;i++){
if(num != A[i]){
ans++;
... | 0 | 75,011,201 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> done(n, 0);
for (int i=0; i<n; i++) {
cin >> a[i];
}
int acount = 0;
int now = 1;
while(true) {
if (done[now-1] == 1) {
cout << -1 << endl;
return 0;
}
don... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int tmp;
cin >> N;
vector<int> c(N-1);
vector<int> s(N-1);
vector<int> f(N-1);
vector<int> curtime(N-1);
for(int i=0;i<(N-1);i++) {
cin >> c[i] >> s[i] >> f[i];
curtime[i] = s[i];
}
for(int i=0;... | 0 | 60,465,660 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
us... | 0 | 77,692,214 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 100000000;
double d = sqrt(N) + 1;
for (long i = 1; i < d ; i++) {
long a = i;
if (N % a != 0){
continue;
}
long b = N / a;
string s_a = to_string(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
... | 0 | 81,429,305 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int N;
vector<int> v;
int main (){
cin >> N;
for(int i=0;i<N;i++){
int x;
cin >> x;
v.push_back(x);
}
int ans=0;
int cnt=0;
for(int i=0;i<N-1;i++){
if(v[i] >= v[i+1]) {
cnt++;
ans = max(ans,cnt);
} else cnt = 0;
}
cou... | 0 | 96,882,121 |
#include<iostream>
#include<string>
using namespace std;
string a;
int c;
int saiki(int,int);
int main(){
int ans;
while(1){
c=0;
a.clear();
getline(cin,a);
if(a==".")break;
ans=saiki(0,0);
if(ans==-1)cout << "no" << endl;
else cout << "yes" << endl;
}
return 0;
}
int saiki(int I,int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
int dx4[4] = {1,0,-1,0}, dy4[4] = {0,1,0,-1};
int main()
{
int n... | 0 | 87,033,120 |
#include<bits/stdc++.h>
using namespace std;
#define INF -2147483647
#define mod 1000000007
signed main(){
int a,c;
string b;
cin>>a>>b>>c;
for(int i=0;i<a;i++){
if(b[c-1]!=b[i]) cout<<"*";
else cout<<b[i];
}
cout<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
std::vector<int> a[3000];
int main() {
int n ;
cin >> n ;
int cnt = 0 ;
while ( ((cnt) * (cnt - 1 ) / 2) < n )
cnt++;
if ( ((cnt) * (cnt - 1 ) / 2) > n) {
cout << "No";
return 0 ;
}
int pnt = 1 ;
for (int i = 0; i < cnt; ++i)
{
for (int ... | 0 | 96,942,373 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
retur... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;
... | 0 | 65,513,266 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x first
#define y second
typedef pair <ll,ll> pii;
int N;
long double PI = acos(-1);
pii displace[105];
bool upperHalf(pii a){
if (a.y > 0) return true;
return a.x > 0 && a.y == 0;
}
bool cmp(pii a, pii b){
if (upperHalf(a) && !uppe... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
#define int long long
using namespace std;
void solve(){
int n,m;
cin>>n>>m;
vector<string> v(n);
for(int i=0; i<n; i++){
cin>>v[i];
}
sort(v.begin(),v.end());
for(int i=0; i<n; i++){
cout<<v[... | 0 | 73,511,591 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#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 INF 10000... | 0 | 69,778,677 |
#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... | #include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int ma[1 << 18][2];
int main()
{
int n;
cin >> n;
vector<int> a(1 << n);
for (i... | 0 | 50,742,521 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 14,971,367 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
int w,h,n,i,j;
cin >> w >> h >> n;
int x,y,a,x_1,y_1,x_2,y_2;
x_1 = y_1 = 0;
x_2 = w; y_2 = h;
for(i=0; i<n; i++){
cin >> x >> y >> a;
if(a == 1)
x_1 = max(x,x_1);
else if(a == 2)
x_2 = min(x,x_2... | #include <bits/stdc++.h>
#define REP(i,a) for(long i=0;i<(a);++i)
#define RREP(i,a) for(long i=(a);i>=0;--i)
#define SORT(a) std::sort((a).begin(), (a).end())
typedef std::vector<long> VL;
int N, K;
VL a;
int main() {
std::cin >> N >> K;
a.resize(N);
REP(i, N) std::cin >> a[i];
SORT(a);
int sum = 0;... | 0 | 77,924,289 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int counter[26] = {};
char ch;
while(cin>>ch){
ch=tolower(ch);
if(isalpha(ch)){
int num = ch -'a';
counter[num]++;
}
}
for(int i=0;i<26;i++){
printf("%c : %d\n", i+... | 0 | 57,307,901 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str, op, p;
int q, a, b;
cin >> str >> q;
for(int i=0;i<q;i++){
cin >> op >> a >> b;
if(op == "print"){
cout << str.substr(a,b-a+1) << endl;
}
if(op == "reverse"){
p = str.substr(a,b-a+1);
reverse(p.b... | #include<bits/stdc++.h>
using namespace std;
int zd(int x,int y)
{
if (x%y==0) return y;
return zd(y,x%y);
}
int main()
{
int n,k,x,y,max1=-1,z;
scanf("%d%d%d",&n,&k,&x);
z=x;
max1=x;
for (int i=2;i<=n;i++)
{
scanf("%d",&y);
z=zd(y,z);
max1=max(max1,y);
}
if (k%z==0&&k<=max1) printf("POSSIBLE");
else p... | 0 | 63,857,893 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int remainder;
bool vqrno=false;
while(n!=0){
remainder=n%10;
if(remainder==7){
vqrno=true;
break;
}
else
... | 0 | 68,074,336 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = 753;
int ans = 9999;
int sa=0;
for(int i=0; i<S.size()-2; i++){
char iti = S.at(i); char ni= S.at(i+1); char san= S.at(i+2);
string s3;
s3 += iti;
s3 += ni;
s3 += san;
int X = stoi(s3);
if(X>n)... | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 0 | 89,129,163 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
#include<iomanip>
#include<numeric>
#define rep(i,n) for(int i=0;i<n;++i)
#define mod 1000000007
using namespace std;
int main(){
int n; cin>>n;
vector<int> num(n);
long long sum=0;
rep(i,n){
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <map>
#include <iomanip>
#include <stdio.h>
#include <bitset>
typedef long long LL;
constexpr long long INFLL = 1e18;
using namespace std;
int main()
{
int n;
int k;
cin >> n >> k;
vector<int> a(n +... | 0 | 30,339,971 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin >> n >> m;
int tryt=pow(2,m);
cout << tryt*(n*100+m*1800) << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | 0 | 31,301,185 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ... | #include<bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
ll root (ll x) {
if (r[x] < 0) return x;
return r[x] = root(r[x])... | 0 | 97,912,365 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define F first
#define S second
ll n;
void solve(){
cin >> n;
if(n%2 == 1){
cout << "0\n";
}
else{
ll ans = 0;
for(ll i = 10; i <= n; i *= 5){
ans += n/i;
}
cout << ans << '\n';
... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <functional>
#include <queue>
using namespace std;
long long N, c1, c2, c3, cnt;
string S;
int main() {
cin >> N >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') c1++;
if (S[i] == 'G') c2++;
... | 0 | 1,909,419 |
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
using ll = long long;
int MOD = 1e9 + 7;
using namespace std;
struct UnionFind
{
vector<int> par;
UnionFind(int N... | #include <bits/stdc++.h>
#define bug1(x) cout<<#x<<" = "<<x<<endl
#define bug2(x,y) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<endl
#define bug3(x,y,z) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<endl
#define bug4(x,y,z,m) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<" "<<#m<<" = "<<m<<endl
using... | 0 | 8,334,233 |
#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(register int i=a,bbb=b;i<=bbb;++i)
#define repd(i,a,b) for(register in... | #include <iostream>
#include <vector>
#define FOR(var, start, end) for(var = start; var < end; ++var)
#define WHILE(var, end) while(var != end)
#define SHOW_ALL(a, b, c) cout << a << endl; \
cout << b << endl; \
cout << c << endl;
using namespace st... | 0 | 31,056,218 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main()
{
ll n,h,w;
cin >> n >> h >> w;
ll ans = 0;
for(ll i = 0;i < n;i++)
{
ll a,b;
cin >> a >> b;
if(a >= h && b >= w)
{
ans++;
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
using namespace std;
typedef long long ll;
typedef pair<int,i... | 0 | 63,387,545 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REP(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
c... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 0 | 88,306,126 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) ... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | 0 | 4,487,167 |
#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() {
char X, Y;
cin >> X >> Y;
if (X - Y > 0) cout << ">" << endl;
else if (X - Y == 0) cout << "=" << endl;
else cout << "<" << endl;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int h, w;
cin >> h >> w;
int row = 0, col = 0;
vector<string> grid(h);... | 0 | 5,214,262 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int p, q, r;
cin >> p >> q >> r;
vector<int> ans(3);
ans.at(0) = p;
ans.at(1) = q;
ans.at(2) = r;
sort(ans.begin(), ans.end());
cout << ans.at(0) + ans.at(1) << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 52,280,958 |
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
int N;
cin >> N;
vector<int> A(N);
rep(0, i, N)
{
int a... | 0 | 19,798,753 |
#include<iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int n, a[5010], sum[5010], res;
while (true) {
cin >> n;
if (n == 0) break;
rep (i, n) cin >> a[i];
sum[0] = 0;
rep (i, n) sum[i + 1] = a[i] + sum[i];
res = -1000000000;
rep (i, n) rep... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
... | 0 | 51,927,742 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, k;
cin >> a >> b >> k;
if (a >= k){
cout << a-k << endl;
cout << b << endl;
}
else if (a+b >= k){
cout <<... | 0 | 72,027,925 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
if(x%y!=0) cout<<x;
else cout<<"-1";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | 0 | 7,795,572 |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | #include<bits/stdc++.h>
#define pb push_back
#define sf scanf
#define pf printf
using namespace std;
#define ll long long
const int N=1e6+9;
const ll mod=1e9+7;
const ll inf=2e10;
int prime[N],vis[N];
void seive()
{
for(int i=1;i<N;i++) prime[i]=i;
for(int i=2;i<N;i+=2) prime[i]=2;
for(int i=3;i*i<N;i+=2) {... | 0 | 6,037,612 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
typedef long long int ll;
typedef long double ld;
const ll N = 2e5+9;
const ll mod =163577857;
#define x first
#define y second
#define pb push_back
#define mp make_pa... | 0 | 36,608,581 |
#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;
using ll = long long;
using _TYPE = int;
typedef tree< _TYPE, null_type, less< _TYPE >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define IO ios_ba... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include<vector>
#include<iomanip>
#include<map>
#include <queue>
#include<cmath>
#include<cstdio>
#include<iomanip>
#include<set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n) for... | 0 | 12,746,532 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
int main(){
ll n;
cin >> n;
vector<ll> f(n, 0);
REP(i, n){
ll ai;
cin >> ai;
f.at(--ai)++;
}
sort(f.begin(), f.end());
v... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
int a;
vector<int> v(N+10, 0);
for(int i=0; i<N; ++i){
cin >> a;
v[a] += 1;
}
sort(v.begin... | 0 | 48,587,723 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 INF 10000... | 0 | 13,169,292 |
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx,popcnt")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const int maxn = 1<<17, mod = 1e9 + 7, i2 = (mod+1)/2;
ll solve(vector<int> a) {
ll sm = 0, t;
sort... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) (int)x.size()
#define en '\n'
#define sp ' '
#define input(vec) for(auto &a: vec)cin >> a;
#define output(vec) for(auto &a: vec)cout << a << sp;cout << en;
int main(){
ios_base::sync_with_stdio(... | 0 | 20,537,549 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
int N; cin >> N;
string S; cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | 0 | 6,778,144 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = k;
for (int i = 1; i < n; i++) {
ans *= (k - 1);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include<sstream>
#include<string>
#include<vector>
#include <cmath>
#include <limits>
#include <queue>
#include<algorithm>
#include<cstring>
#include <cstdlib>
#include <cstdio>
#include <set>
#include <iomanip>
#include <map>
#include <stack>
#include <memory>
#include <numeric>
#include <type_tra... | 0 | 54,279,515 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int i = 0;i < 1000;i++){
string t = "";
if(i < 10)t += '0';
i... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) s... | 0 | 9,233,860 |
#include <bits/stdc++.h>
#define rep(i,l,r) for (int i=l,i##end=r;i<=i##end;++i)
#define per(i,r,l) for (int i=r,i##end=l;i>=i##end;--i)
#define ll long long
using namespace std;
int main(){
int n; cin>>n; ll s1=0,s2=0;
rep(i,1,n){
int d; ll c; scanf("%d%lld",&d,&c);
s1+=c,s2+=d*c;
}
cou... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <cassert>
#include <atc... | 0 | 92,469,971 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int r,d,x2000;cin>>r>>d>>x2000;
vector<ll>x(10);
rep(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> p(51), b(51);
ll f(ll n, ll x) {
if (n == 0) return (x <= 0) ? 0 : 1;
if (x <= 1 + b[n-1]) return f(n-1, x-1);
else return p[n-1] + 1 + f(n-1, x-2-b[n-1]);
}
int main() {
ll n, x; cin >> n >> x;
p[0] = b[0] = 1;
for (int i = 0; i < 50;... | 0 | 16,623,479 |
#include <iostream>
using namespace std;
int main()
{
long long n, k;
cin >> n >> k;
long long ans = (n / k) * (n / k) * (n / k);
if (k % 2 == 0) {
long long t = n / (k / 2) - n / k;
ans += t * t * t;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int n, k;
cin >> n >> k;
vector<int> int_seq(n);
rep(i, n){cin >> int_seq.at(i);}
rep(i, n){int_seq[i]--;}
vector<int> cumulative_sum(n+1);
for (int i = 0; i < (n); ... | 0 | 1,686,162 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 305;
int n, K, h[maxn];
ll dp[maxn][maxn][maxn];
ll INF = 1e18;
void amin(ll& a, ll b) {
a = min(a,b);
}
ll f(int i, int j, int k) {
if (i == n+1) return h[j];
ll& res = dp[i][j][k];
if (res >= 0) return res;
res = ... | #include <bits/stdc++.h>
using namespace std;
int n,a[200005];
bool check(int m)
{
vector<pair<int,int> > v;
for (int i=2;i<=n;i++)
{
if (a[i]<=a[i-1])
{
while (!v.empty() && v.back().first>a[i])
v.pop_back();
int tmp=a[i];
while (!v.empty() && v.back().first==tmp && v.back().second==m)
{
v.po... | 0 | 6,727,410 |
#include<stdio.h>
int main(){int i,j=1;while(j<=9){for(i=1;i<10;i++){printf("%dx%d=%d\n",j,i,i*j);}j++;}return 0;} | #pragma target("avx")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define rep(i,b,e) for(ll i=b; i<e; i++)
#define... | 0 | 83,893,241 |
#include <iostream>
#include <vector>
using namespace std;
void atcoder_beginner_contest999()
{
string n;
cin >> n;
for (int i = 0; i < n.size(); ++i)
{
if (n[i] == '1') n[i] = '9';
else if (n[i] == '9') n[i] = '1';
}
cout << n << "\n";
}
void programming_education()
{
int n;
cin >> n;
if (n =... | #include <bits/stdc++.h>
using namespace std;
vector<int> g[200005];
int sum[200005];
void dfs(int u, int p){
for(int i=0;i<g[u].size();i++){
int v = g[u][i];
if(v == p) continue;
sum[v] += sum[u];
dfs(v, u);
}
}
int main(){
int n, q;
scanf("%d%d", &n, &q);
for(int i=... | 0 | 64,102,128 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,k;
cin... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;... | 0 | 97,057,788 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
long long n;
int main(){
cin >> n;
long long sum = 0;
for(long long i = 1; i <= sqrt(n) + 100; i++){
if(n % i == 0){
long long num = n / i - 1;
if(num <= i) break;
su... | #include <iostream>
using namespace std;
int main(){
string s;
cin>>s;
int a=0,b=0,c=0;
for(int i=0;i<s.length();i++){
if(s[i]=='a'){
a++;
}else if(s[i]=='b'){
b++;
}else{
c++;
}
}
if(a==1&b==1&c==1){
cout<<"Yes";
}e... | 0 | 38,404,443 |
#include<iostream>
using namespace std;
#define P 10007
int main(){
int w,n;
cin>>w>>n;
int a[n];
int dp[w+1];
dp[0]=0;
for(int i=1;i<=w;i++)dp[i]=P;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
for(int j=0;j+a[i]<=w;j++){
dp[j+a[i]]=min(dp[j]+1,dp[j+a[i]]);
}
}
cout<<dp[w]<<en... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | 0 | 46,035,937 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | 0 | 9,789,710 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
void test_cases()
{
string s;
cin>>s;
for(ll i=0;i<s.size();i++)
{
if(s[i]==',')s[i]=' ';
}
cout<<s;
}
int main()
{
fast;
ll t;
t=1;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define PI 3.1415926535897932384626433832795028841971
#define INF 1000000000.0
#define EPS 1e-10
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<double,double> P;
typedef pair<double,P> PQ;
int dp[50... | 0 | 22,921,559 |
#include<bits/stdc++.h>
using namespace std;
int main() {
double a,b,x;
cin >> a >> b >> x;
double answer;
const double PI = 3.14159265358979323846;
if (x == a * a * b) {
answer = 0;
} else {
if(a * a * b / 2.0 <= x) {
answer = atan(2 * (a * a * b - x) / (a * a * a)) * 1... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | 0 | 97,407,298 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
int a[n];
rep(i,0,n){
cin>>a[i];
}
int b[n];
if(n%2==0){
rep(i,0,n/2){
b[n/2+i]=a[2*i];
}
rep(i,0,n/2){
... | 0 | 54,691,078 |
#include <algorithm>
#include <iostream>
#include <cstdio>
int main()
{
int a = 0, b = 0;
std::cin >> a >> b;
std::cout << a / b << " " << a % b << " ";
printf("%.5f", (double)a / b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> pos(N);
vector<pair<ll, ll>> checks(M);
for (int i = 0; i < N; i++)
cin >> pos[i].first >> pos[i].second;
for (int i = 0; i < M; i++)
cin >> checks[i].fi... | 0 | 36,541,363 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main () {
int N;
cin >> N;
vector<LL>A(N);
vector<LL>a(N);
vector<LL>b(N);
LL sum = 0;
for (int i = 0; i < N; i ++) cin >> a[i];
for (int i = 0; i < N; i ++) cin >> b[i];
for (int i = 0; i < N; i ++) {
A[i] = b[i] - a[i];
s... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | 0 | 65,285,499 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include<iostream>
using namespace std;
double cross(double x1, double y1, double x2, double y2){
return (x1 * y2) - (y1 * x2);
}
int main(){
double x[3], y[3], px, py;
while(cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> px >> py){
double ret[3];
for(int i = 0; i < 3; ++i ){
int n =( i+1 ) % 3;
re... | 0 | 95,697,035 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
#include <complex>
#define repi(i,x,n) for(int i = x; i < n; i++)
#define rep(i,n) repi(i,0,n)
#define int lo... | 0 | 45,614,594 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)),t.end())
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
typedef long long ll;
using namespace std;
const ll mod=1000000007,mod9=1000000009;
template <class T>inline T lcm(T a,T b){... | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using namespace chrono;
using ll = long long;
using ii = pair<int, int>;
constexpr int MN = 200002;
int N, A[MN];
time_point<high_resolution_clock> start;
void fast_incorrect() {
int ans = 0;
map<int, int> M;
for (int i = 1; i < ... | 0 | 79,997,249 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(_) cerr << #_ << ": " << (_) << '\n'
#define _GLIBCXX_DEBUG
#else
#define debug(_) 0
#endif
vector<long long> as(1, 1);
vector<long long> ps(1, 1);
long long solve(long long level, long long x){
if (level == 0) {
return x;
} else ... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
int main() {
int N;
cin >> N;
i64 S = 0;
vector<i64> s(N);
for(int i = 0; i < N; i++) {
cin >> s[i];
S += s[i];
if(i) s[i] ... | 0 | 17,748,837 |
#include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll res = 0, mx = 0;
for (int i = 0; i < N; i++) {
ll A;
cin >> A;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | 0 | 38,357,433 |
#include<iostream>
int main(){int A,B;std::cin>>A>>B;puts(A%3*B%3*(A+B)%3?"Impossible":"Possible");} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 17,258,150 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
const int MAX = (int)1e6;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cstdio>
#include<cmath>
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 ALL(x) x.begin(),x.end()
#define debug(output) cout<<#output<<"= "<<output<<endl
using lint... | 0 | 3,806,238 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void){
int Max, Num = 0, In;
while (true){
vector<int> Dat;
Max = -100000;
cin >> Num;
if (Num == 0)break;
Dat.push_back(-100000);
for (int i = 0; i < Num; i++){
cin >> In;
Dat.push_back(In);
}
for (int i = 1; ... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " "
using ll = long long;
using ld = long double;
... | 0 | 16,807,539 |
#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... | #include<iostream>
#include<string>
using namespace std;
void print(string cards[40],int size){
cout<<cards[0];
for(int i=1;i<size;i++){
cout<<" "<<cards[i];
}
cout<<endl;
}
bool check(string collect[40],string cards[40],int size){
for(int i=0;i<size;i++){
if(collect[i]!=cards[i]) return false;
}
... | 0 | 90,396,315 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int x_1, y_1, x_2, y_2;
cin >> x_1 >> y_1 >> x_2 >> y_2;
int dx = x_2 - x_1;
int dy = y_2 - y_1;
int x = x_2, y = y_2;
rep(i, 2){
int _dx = -dy;
... | #include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
using namespace std;
int main(){
int x, y, a, b, c; cin >> x >> y >> a >> b >> c;
long long int p[a];
for( int i = 0; i < a; i++ ){
cin >> p[i];
}
long long int q[b];
for( int i = 0; i < b; i++ ){
cin >> q[i];
}
long long i... | 0 | 58,929,620 |
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast_io
ll a,b,i,j;
string s;
bool ok;
cin>>a>>b>>s;
if(s[a]!='-')
ok=0;
else
ok=1;
if(ok)
for(i=0; s[i]; ... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
int n; cin >> n;
map<char,int> mp;
string s; cin >> s;
for(char c : s) mp[c]++;
for(int i = 1; i < n; ++i){
string t; cin >> t;
map<char,int> tmp;
for(int j = 0; j < t.size(); ++j){
... | 0 | 71,551,973 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int> >
#define pii pair<int,int>
#define piii ... | 0 | 52,590,473 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <queue>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<... | 0 | 6,846,567 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#incl... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
vector<vector<int>> ans(H, vector<int>(W));
rep(i, H) {
re... | 0 | 27,977,081 |
#include <iostream>
using namespace std;
int main()
{
int N, P;
cin >> N >> P;
cout << (N-P)+1 << endl;
return 0;
} | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#define INF 10000000
using namespace std;
struct data{
int x,y;
};
int H,W,N;
int ans[1001][1001];
char field[1001][1001];
int cou,sx,sy;
void bfs(data start,int num){
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
data g;
for(int i=0;i<H;i++... | 0 | 40,295,816 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | #include<stdio.h>
#include<algorithm>
#include<iostream>
#include<map>
#include<vector>
#define ll long long
#define pii pair<int,int>
#define MP make_pair
using namespace std;
ll n;
map<ll,int>rev;
struct node{ll d,siz,val;int id;}a[100005];
bool cmp(node x,node y){return x.d>y.d;}
int back[100005];
vector<pii>ans;
in... | 0 | 85,428,888 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,ans=0;
string S;
cin >> N >> S;
for(int i=0; i<N; i++) {
if(S[i] != S[i+1]) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 35,801,468 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (... | #include <iostream>
#include <string>
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <math.h>
#include <stdio.h>
#include <climits>
#include <cfloat>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <cctype>
using namespace std;
i... | 0 | 4,779,689 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main() {
ll h, w;
cin >> h >> w;
if (h==1 || w==1) cout << 1 << endl;
else {
if (h%2==1 && w%2==1) cout << h*w/2 + 1 << endl;
else cout << h*w/2 << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 0 | 59,460,960 |
#include <iostream>
#include <queue>
using namespace std;
const int MAX_N = 100;
int A[MAX_N+1][MAX_N+1];
int D[MAX_N+1];
int N;
void solve() {
int d;
queue<int> Q;
Q.push(1);
D[1] = d = 0;
while (!Q.empty()) {
int c = Q.front(); Q.pop();
for (int i = 1; i <= N; i++) {
if (A[c][i] == 1 && D[i] =... | #include <bits/stdc++.h>
#define PB emplace_back
using namespace std;
const int N = 1e5+100;
int n;
vector<int> v[N];
bool ok = 1, dp[N][3];
void dfs(int x, int px = -1) {
for(int u: v[x]) {
if(u != px) dfs(u, x);
}
int zero=0, one=0;
for(int u: v[x]) {
if(u != px) {
if(dp[u]... | 0 | 86,771,351 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,ar[113],i,ans,Max = 0;
cin>>n>>k;
for(i=1;i<=k;i++)
{
ar[i] = 1;
}
ans = n - k;
ar[k] = ar[k] + ans;
if(k==1)
{
cout<<"0"<<endl;
}
else
{
for(i=1; i<k; i++)
{
if(... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | 0 | 72,584,726 |
#include <iostream>
#include <string>
#define N 8000
using namespace std;
bool dp_x[2*N+1][8000] = {false};
bool dp_y[2*N+1][8000] = {false};
int main(){
string S;
int x, y;
cin >> S;
cin >> x >> y;
int cnt_F = 0;
int cnt_T = 0;
int cnt_x = 0;
int cnt_y = 0;
bool first_F = true;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int main()
{
string L; cin >> L;
int len = L.size();
vector<int> x3(len);
x3[0] = 1;
for (int i = 1; i < x3.size(); i++) {
x3[i] = (ll)x3[i-1] * 3 % MOD;
}
ll ans_eq = 1, ans_lt = 0;
for (i... | 0 | 44,195,413 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,int> pdi;
typedef pair<double,double> pdd;
typedef pair<double,ll> pdl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vec... | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=300010;
int ans=0,tot=0,sum[maxn],a[maxn],f[maxn],g[1<<26],n,l,r;
char s[maxn];
void read(int &k){
k=0; int f=1; char c=getchar();
while (c<'0'||c>'9')c=='-'&&(f=-1),c=getchar();
while ('0'<=c&&c<='9')k=k*10+c-'0',c=g... | 0 | 9,609,046 |
#include <iostream>
using namespace std;
bool tst (int n, const string &s, const string &t, int pos) {
for (int i = 0; i + pos < n; i++) {
if (s[i + pos] != t[i]) return false;
}
return true;
}
int main () {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
if (tst(n, s, t, i))... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = unsigned long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b)... | 0 | 49,632,876 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.