code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#include <cstdio>
#include <algorithm>
#define maxn 200010
using namespace std;
int f[maxn],cnt[maxn];
int getf(int u){
return f[u]==u?u:f[u]=getf(f[u]);
}
void merge(int u,int v){
int f1,f2;
f1=getf(u),f2=getf(v);
if(f1!=f2)f[f2]=f1;
}
int main(){
int n,m,i,u,v,mx=0;
scanf("%d%d",&n,&m);
... | #include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#define doubled( x ) (x * x)
int digit_count(int num);
using namespace std;
int main()
{
int N; cin >> N;
vector<int> data(3);
for(int i = 0; i < N; i++)
{
for(int j = 0; j < 3; j++)
{
cin >> data[j];
}
sort(data.be... | 0 | 26,426,837 |
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int a,int b){return (int64_t)a*b/gcd(a, b);}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int a){if(a<=1)return false;for(int i=2;(int64_t)i*i<=a;i++){if(a%i==0)return fa... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
... | 0 | 80,532,782 |
#include <bits/stdc++.h>
using namespace std;
const int N = 330000;
int a[N];
vector<int> dp[N];
void insert(vector<int> &lhs, const vector<int> &rhs) {
for (int x : rhs) lhs.push_back(x);
sort(lhs.begin(), lhs.end());
reverse(lhs.begin(), lhs.end());
lhs.resize(2);
}
int main() {
ios::sync_with_stdio(0);
cin.tie... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 0 | 87,194,819 |
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <unordered_map>
#include <stdlib.h>
#include <time.h>
#include <string>
const int MAX_N = 350;
int N;
std::string S[MAX_N];
bool... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | 0 | 19,768,918 |
#include <iostream>
using namespace std;
int main (){
long long n,m=1000,s=0;
cin >> n;
int a[n];
for (int i=0;i<n;i++) cin >> a[i];
for (int i=0;i<n-1;i++) {
if (a[i]<a[i+1]) {
long long t=m/a[i];
s+=t;
m-=t*a[i];
}
if (a[i]>a[i+1]) {
m+=s*a[i];
s=0;
}
}
m+=s... | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int s,k=0;
cin>>s;
vector<int> v;
v.push_back(s);
map<int,in... | 0 | 50,936,512 |
#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);
set<ll> S;
vector<ll> A;
ll a = X;
ll ans = 0;
rp(_i, 0, mn){
if(S.find(a) != S.end()) break;
S.insert(a);
A.push_back(a);... | #include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No... | 0 | 69,381,052 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main(){
int n,m;
cin>>n>>m;
vector<pair<int,int>> dat(n);
rep(i,n){
int a,b;
cin>>a>>b;
dat[i]=make_pair(a,b);
}
sort(dat.begin(),dat.end());
ll ans=0,now=0;
... | #include <bits/stdc++.h>
#define endl '\n'
#define LL long long
#define LD long double
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define debug(x) cerr << #x << " is " << x << endl;
using namespace std;
int const MAXN = 2e6 + 9;
int main(){
... | 0 | 23,023,702 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define dbv(v) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 | 81,484,790 |
#include <stdio.h>
int main(){
int a=0,b=0,temp;
for(int i=0;i<4;i++){
scanf("%d",&temp);
a+=temp;
}
for(int i=0;i<4;i++){
scanf("%d",&temp);
b+=temp;
}
if(a>b)printf("%d\n",a);
else printf("%d\n",b);
} | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<cstdio>
#include<map>
#pragma warning(disable : 4996)
#define P pair<int,int>
using namespace std;
bool g[1000][1000]{};
int x[] = { -1,0,0,1 }, y[] = { 0,-1,1,0 };
map<int, P>j;
int a, b, c;
int meiro(int d) {
queue<P> e;
vector<vector<int... | 0 | 75,940,533 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool chk(ll a,ll b,ll k){
if(b+k>=a*b)return 0;
if(k*(b+1)>=a*b)return 0;
if(b+k+1>=2*k)return 1;
if((b+k+1)*(b+k+1)<4*a*b)return 1;
return 0;
}
void solve(){
ll a,b;cin>>a>>b;
if(a<b)swap(a,b);
ll s=1,e=a-1,ans=0;
w... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
int top = sqrt(N);
map<int, int> soinsu;
int i = 2;
bool flag = false;
if(N == 1) flag = true;
while(i<=top){
if(N % i == 0){
if(soinsu.count(i) > 0) soinsu.at(i) += 1;
else soin... | 0 | 33,306,065 |
#include <stdio.h>
int i, N, a, b, c, A, B, C;
int print(void)
{
if (C == A + B) {
printf("YES\n");
} else if (A == B + C) {
printf("YES\n");
} else if (B == C + A) {
printf("YES\n");
} else {
printf("NO\n");
}
}
int main(void)
{
scanf("%d", &N);
for (i = 0; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
struct pair_hash {
template <class T1, class T2>
... | 0 | 18,315,387 |
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
t... | #include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main() {
typedef unordered_set<string> set_t;
set_t A;
int n;
string s,t;
cin >> n;
for (int i = 0; i<n; i++){
cin >> s >> t;
if (s == "insert"){
... | 0 | 71,715,403 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a , b , c ;
cin >> a >> b >> c ;
if(a == b && b == c)
cout << "Yes\n";
else
cout << "No\n";
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 77,589,743 |
#include <iostream>
using namespace std;
int a,b;
int main()
{
cin >> a;
cin >> b;
const char* gg = ((a * b) % 2 == 0) ? "Even" : "Odd";
cout << gg;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
if(b==0){
return a;
}else{
return gcd(b,a%b);
}
}
int main(){
ll N,X; cin>>N>>X;
vector<ll> x(N);
for (ll i = 0; i < N; i++){
cin>>x[i];
x[i]=abs(X-x[i]);
}
ll ans=gcd(... | 0 | 43,415,205 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string a(int aa, int b) {
if(aa <= 8 && b <= 8) {
return "Yay!";
}
return ":(";
}
int main() {
int aa, b;
cin >> aa >> b;
cout << a(aa, b);
} | #include <bits/stdc++.h>
using namespace std;
long long n, k, a[100005] = {0}, b[100005] = {0}, t = 0;
long long memo[35] = {0};
long long solve();
int main() {
cin >> n >> k;
for(long long i = 0; i < n; ++i) cin >> a[i] >> b[i];
memo[0] = 1;
for(long long i = 1; i < 32; ++i)
memo[i] = 2 * memo[i - 1];
wh... | 0 | 59,402,485 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int a,b,c; cin>>a>>b>>c;
if(a+b>=c) cout<<"Yes"<<endl... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 96,467,055 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin>>n;
if(n==0){
break;
}
int leg[2]={0};
int cnt=0,last=0;
string s;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu"){
leg[0]=1;
}else if(s=="ru"){
leg[1]=1;
}else if(s=="ld"){
leg[0]=0;... | #include<iostream>
using namespace std;
int N, K, a[1000000];
int main()
{
while(true)
{
cin >> N >> K;
if(!N)
break;
int v = 0;
for(int i = 0; i < N; i++)
{
cin >> a[i];
if(i < K)
v += a[i];
}
int ans = v;
for(int i = K; i < N; i++)
ans = max(ans, v =... | 0 | 39,628,403 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(...) debug_func_mult(split_names(#__VA_ARGS__), __VA_ARGS__)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(...) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_L... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 0 | 38,066,218 |
#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 euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,ll b){
ll u = 1;
ll d = 1;
while(b != 0){
u *... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e14;
using Graph = vector<vector<int>>;
signed main(){
vector<vector<int>> A(3, vector<int>(3));
for( int i = 0; i < 3; i++ ){
for( int j = 0; j < 3; j++ ) cin >> A[i][j];
... | 0 | 25,146,124 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | #include <iostream>
using namespace std;
int main(void) {
int n;
string s;
while (cin >> n, n) {
int l=0, r=0, state=0;
int score=0;
for(int i=0; i<n; i++) {
cin >> s;
if (s[0] == 'l') { l = (s[1] == 'u' ? 1 : 0); }
if (s[0] == 'r') { r = (s[1] == ... | 0 | 9,434,368 |
#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>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;... | 0 | 99,969,078 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int b[26] = {};
string a;
cin >> a;
... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
#include <set>
using namespace std;
#define N 100005
#define M 20
#define mod 1000000007
int x[N],dp[N][M];
int jumpCity(int stCity,int day) {
int curCity = stCity... | 0 | 46,615,254 |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#defi... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long e[100010];
int main() ... | 0 | 33,033,526 |
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
#define int long long
const int inf = 999999999999999999;
typedef long ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 0 | 18,613,401 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
#define int_ int64_t
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define lb long double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>... | 0 | 24,951,798 |
#include <iostream>
#include <stack>
using namespace std;
int main()
{
stack<int> stk;
int car;
while (cin >> car) {
if (car) {
stk.push(car);
}
else {
cout << stk.top() << endl;
stk.pop();
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int h, w;
cin >> h >> w;
int s[h][w];
rep(i, h) rep(j, w) {
char c;
cin >> c;
s[i][j] = (c == '#');
}
int score[h][w];
rep(i, h) rep(j, w) score[i][j] = 0;
re... | 0 | 87,651,571 |
#include<iostream>
using namespace std;
int main()
{
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 4; i++)
for (int j = i + 1,t; j < 5; j++)
if (a[i] < a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
for (int i = 0; i < 5; i++)
{
if (i != 0)cout << " ";
cout << a[i... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 40,972,508 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b... | #include <functional>
#include <vector>
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
vector<vector<int> > adj(n);
for (int i = 1; i < n; i++) {
int a, b; cin >> a >> b;
a--; b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
function<bool(int, ... | 0 | 78,671,554 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll>PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll MOD = 1e4+7;
int main() {
ll x, y;
cin >> x >> y;
if ( x % y == 0 ) {
cout << -1 << endl;
return 0;
}
ll mult_num =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 22,452,076 |
#include <iostream>
using namespace std;
int main() {
int N;
string S;
string T;
cin >> N >> S;
T = S.substr(N / 2);
if (T + T == S) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include<iostream>
#include<list>
#include<vector>
#include<queue>
using namespace std;
class Vertex{
int connection;
int name;
list<Vertex*> v_list;
Vertex(int n):connection(0),name(n){}
friend class Graph;
};
class Graph{
vector<Vertex*> graph;
public:
Graph(int size){
graph.resize(size);
for(in... | 0 | 5,042,317 |
#include <iostream>
using namespace std;
int main (void) {
int r, g;
cin >> r >> g;
int ans;
ans = 2*g - r;
cout << ans << endl;
} | #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>;
const int MOD = 1000000007;
ll dp[100005][2];
int main() {
string L;
cin >> L;
int n = L.size();
dp[0][0] = 1;
rep(i, n) {
if (L[i] == '1') {
... | 0 | 56,198,410 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <iostream>
using namespace std;
int main(){
int d[6],q,a,b,tmp,j;
for(int i=0;i<6;i++){
cin >> d[i] ;
}
cin >> q ;
for(int i=0;i<q;i++){
j=0;
cin >> a >> b ;
while(1){
if(d[1]==b)break;
tmp=d[0];
d[0]=d[1];
d[1]=d[5];
d[5]=d[4];
d[4]=tmp;
if(j==4){
tmp=d[0];
d[0]=d[3];... | 0 | 44,982,033 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0; i < n; i++)
string s[10010];
int main(void)
{
int n;
cin >> n;
REP(i, n) cin >> s[i];
int cnt = 0, ca = 0, cb = 0, cab = 0,a,b;
REP(i, n) {
REP(j, s[i].length(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
#define mrep(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int main() {
int a, b, c, n;
cin >> a >> b >> c >>... | 0 | 19,458,756 |
#include<bits/stdc++.h>
#include<cstdlib>
#include<cmath>
using namespace std;
int main(){
int N; cin>>N;
int P=0;
vector<vector<int>> S(N,vector<int>(2));
for(int i=0; i<N; i++){
for(int j=0;j<2; j++){
cin>>S.at(i).at(j);
}
P+=(S.at(i).at(1)-S.at(i).at(0)+1);
}
cout<<P<<endl;
} | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<declt... | 0 | 90,822,891 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll x,y;
cin >> x >> y;
int count = 1;
for(;;){
x = x*2;
if(x>y)break;
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll> >;
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MX = 0;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define PB push_back
#define F fi... | 0 | 52,325,503 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll A,B,K;
cin >> A >> B >>K;
ll num =0;
for(int i=100;i>=0;--i){
if(A%i ==0 && B%i==0){
num++;
}
if(num == K){
cout << i << endl;
return 0;
}
}
retur... | 0 | 47,853,579 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[2001],ans,p[2001],mod=1000000007;
int main(){
ll n,k;
cin>>n>>k;
for(ll i=1;i<=n;i++)cin>>a[i];
for(ll i=1;i<=n;i++){
for(ll j=i+1;j<=n;j++){
if(a[j]<a[i]){
ans=ans+k;
ans%=mod;
}
}
for(ll j=1;j<=n;j++){
if(a[j]<a[i]){
... | #include <cstdio>
#include <climits>
#include <algorithm>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n)&&n!=0) {
long long int a[n];
for (int i=0; i<n; i++) scanf("%lld", &a[i]);
long long int dp[n];
dp[0] = a[0];
long long int res = dp[0];
for ... | 0 | 79,080,548 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push
#define lld long long int
#define ins insert
#define adv advance
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl vector<long long int >
#... | #include <bits/stdc++.h>
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define set_zero(a) memset(a,0,sizeof(a));
#define ll long long int
#define PI 2 * acos(0.0)
#define MAX 1000000000000000000
#define in(a) scanf("%d",&a);
#define out(a) printf("%d",a);
#define INF 1000000
#define M... | 0 | 47,476,801 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,m;
cin>>n>>m;
bool ac[100010]={false};
ll wa[100010]={};
for(ll i=0;i<m;i++){
ll now;string s;
cin>>now>>s;
now--;
if(s=="WA"){
if(ac[now]==false){
wa[now]++;
}
}
e... | #include <bits/stdc++.h>
using namespace std;
void solve(int n,int mn,int mx){
int t,st=0,maxx=0,ans=0;
vector<int> v;
cin >> st;
for(int i=0;i<n-1;i++){
cin >> t;
v.push_back(st-t);
st=t;
}
for(int i=mn-1;i<mx;i++){
if(maxx<v[i]){
maxx=v[i];
}... | 0 | 87,562,959 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
if(k > (n - 1) * (n - 2) / 2) {
cout << -1 << '\n';
return 0;
}
vector<pair<int,int>> ans;
for (int i = 2; i <= n; i++) {
ans.emplace_back(1, i);
}
int tot = (n - 1) * (n - 2) / 2;
for ... | 0 | 97,522,215 |
#include <iostream>
using namespace std;
#include <stdio.h>
int main()
{
int HW[10000][2], i = 0, j, l, k;
while (1){
cin >> HW[i][0] >> HW[i][1];
if (HW[i][0] == 0 && HW[i][1] == 0)break;
i++;
}
for (j = 0; j < i; j++){
for (l = 0; l < HW[j][0]; l++){
for (k = 0; k < HW[j][1]; k++){
if ((l == 0 || l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<long long> v(n), ans(n, 0);
map<long long, long long> m;
map<long long, int> p;
for (int i = 0; i < n; i++) {
cin >> v[i];
m[-v[i]]++;
if (m[-v[i]] == 1) p[v[i]] = i;
}
m[0] = 0;
lo... | 0 | 36,793,215 |
#include <iostream>
#include <vector>
using namespace std;
template <class T>
ostream& operator<<(ostream& os, vector<T> const& v) {
for (int i = 0; i < v.size() - 1; i++) os << v[i] << ' ';
if (!v.empty()) os << v.back();
return os;
}
int main(void) {
uint64_t K;
cin >> K;
constexpr uint64_t N = 50;
vect... | #include <stdio.h>
#include <string>
#include <stdlib.h>
#include<vector>
#include<iostream>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
long long int divide(long long int h,long long w){
if(h %2 == 0){
return (h/2)*w;
}
if(w %2 == 0){
return (w/2)*h;
}
long long int mi = min(h,w);
lo... | 0 | 12,527,230 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
bool debug = 0;
void solve() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
sort(t.begin(), t.end());
int cnt = 0;
for (int i ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b){
if(b == 0){
return a;
}
else{
return gcd(b,(a%b));
}
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
int main(){
int n,k;
cin>>n>>k;
ll vec[n-1];
for(int i=0;i<n;i++){
cin>>vec[i];
}
int bitb[n];
ll a=... | 0 | 77,614,728 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int X,A;
cin >> X >> A;
if(X < A) cout << "0\n";
else cout << "10\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 57,834,008 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define ALL(a) begin((a)), end((a))
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define RFOR(i, a, b) for (int(i) = (a); (i) > (b); (i)--)
#define debug(x) cout << #x << " : " << x << '\n'
const int INF = 1e9;
const LL LINF = 1e16;
int ma... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
bool compare(string a, string b) {
if (a.length() == b.length()) {
for (int i = 0; i < a.length(); i++) {
if (a[i] == b[i]) continue;
else return a[i] < b[i];
}
} else {
... | 0 | 84,892,877 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
vector<ll> fac(1000001);
vector<ll> ifac(1000001);
const ll M = pow(10,9)+7;
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % M;
x = x*... | 0 | 83,801,723 |
#include <iostream>
#include <cstdio>
#define N 3002
using namespace std;
int n,m,k,l,r,u,d,i,j,ans[N][N];
int main()
{
scanf("%d%d%d",&n,&m,&k);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
int x=i+j,y=i-j+m-1;
l=min(l,y);r=max(r,y);
u=min(u,x);d=max(d,x);
}
}
for(i=u;i<=d;i++){
for(j=l;j<=r;j++){
int x=i... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
i... | 0 | 43,138,829 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n,m;
cin >> n >> m;
vector<ll> a(n);
for(int i =0;i<n;i++)
{
cin>>a[i];
}
ll lcm = a[0]/2;
for(int i = 1;i<n;i++)
{
a[i]/=2;
ll g = __gcd(a[i],lcm);
ll p = lcm;
lcm = a[i]/g*lcm;
if(
lcm>m||
(lcm/p)%2==0||
(... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
int main(){
int a, b;
... | 0 | 661,798 |
#include <bits/stdc++.h>
using namespace std;
double pai = 3.14159265;
int main(){
cout << fixed << setprecision(8);
double a,b,C;
cin >> a >> b >> C;
C = C / 180 * pai;
double S,L,h;
S = a * b * sin(C) / 2;
double c = sqrt(pow(a,2) + pow(b,2) - 2 * a * b * cos(C));
L = a + b + c;
h = S * 2 / a;
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >>x;
int kazu=x/100;
int amari=x%100;
for(int i=0;i<=kazu;i++){
for(int j=0;j<=kazu;j++){
for(int k=0;k<=kazu;k++){
for(int m=0;m<=kazu;m++){
for(int n=0;n<=kazu;n++){
if(i+j*2+k*3+m*4+n*5==amari&&i+j... | 0 | 43,559,943 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define abdelrahman010 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
using namespace std;
const int N = 1e3 + 5;
string s;
int n , p;
ll ans;
map<int , int> mp;
int main() {
abdelrahman010
cin >> n >> p >> s;
int acc = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout ... | 0 | 99,324,614 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | #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 | 11,427,932 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll n;
cin >> n;
ll nn = 1ll<<n;
vector<ll> a(nn);
for(auto &e: a) cin >> e;
using P = pair<ll, ll>;
P z = P(-1, -1);
vector<ll> r(nn, 0);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
char ans;
int main() {
vector<int> digit(9);
for(int i = 0; i < 9; i++) {
int ok = -1;
int ng = 9;
if(i == 0) ok = 0;
while(ng - ok > 1) {
in... | 0 | 95,036,858 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll k; cin >> k;
queue<ll> que;
rep(i, 9... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 10000000000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N , K;
cin >> N >> K;
K = min(N,K);
string S;
cin >> S;
vector<int> a(4*N+2, 0);
a[0] = 0; a[1] = 0... | 0 | 4,272,176 |
#include<bits/stdc++.h>
using namespace std;
#define N 2000000
#define INFTY (1<<30)
int H, Heap[N+1];
void maxHeapify(int i){
int largest, tmp;
int l = 2 * i;
int r = 2 * i + 1;
if(l <= H && Heap[l] > Heap[i]){
largest = l;
}
else{
largest = i;
}
if(r <= H && Heap[r] > Heap[largest]){
large... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<string> s(0);
vector<int> p(0);
rep(i, n) {
string si;
cin >> si;
bool hit = false;
rep(j, s.size()) {
if (s.at(j) == si) {
p.at(j)++;
h... | 0 | 24,432,192 |
#include <cstdio>
int main() {
int ary[20],s=0,x;
while(scanf("%d", &x)==1) {
if(x) ary[s++] = x;
else printf("%d\n", ary[--s]);
}
return 0;
} | #include <cstdio>
int P[201];
int main() {
int m, nmin, nmax;
while (true) {
scanf("%d %d %d", &m, &nmin, &nmax);
if (m == 0 && nmin == 0 && nmax == 0) break;
for (int i=0;i<m;i++) scanf("%d", &P[i]);
int max_gap = -1, max_n = -1;
for (int n=nmin;n<=nmax;n++) {
const int gap = P[n-1]-P[n];... | 0 | 30,995,010 |
#include <iostream>
using namespace std;
int main (int argc, char **argv) {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
int x = a;
while (x <= b) {
if (c % x == 0) cnt++;
x++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 67,035,563 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string s;
cin >> s;
for (size_t... | #include <iostream>
#include <climits>
using namespace std;
int main() {
while(1) {
int n;
cin >> n;
if(n == 0) break;
int max = INT_MIN;
int maxBfr = INT_MIN;
int bfr = INT_MIN;
int before = INT_MIN;
int temp;
for(int i = 0; i < n; i++) {
cin >> temp;
if(maxBfr > 0) {
... | 0 | 27,015,465 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl "\n"
const int mod = 1e9+7;
inline int add(int a, int b) { int res = a + b; if(res >= mod) res -= mod; return res; }
inline int sub(int a, int b) { int res = a - b; if(res < 0) res += mod; re... | 0 | 65,619,433 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
while(true){
string s;
cin >> s;
if(s=="-")
break;
int m;
cin >> m;
for(int i=0; i<m; i++){
int h;
cin >> h;
string s1 = s.substr(0, h);
string s2 = s.substr(h);
s = s2+s1;
}
cout << s << endl;
}
return 0;
} | #include <iostream>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
int N,A[100005],L[100005];
int main()
{
L[0]=0;
cin>>N;
int i,j;
for(i=1;i<=N;i++){
cin>>A[i];
}
int len=1;
L[0]=A[1];
for(i=1;i<=N;i++){
if(L[len-1]<A[i])L[len++]=A[i];
... | 0 | 3,505,277 |
#include <iostream>
#include <stack>
using namespace std;
int main()
{
string s;
while(1){
getline(cin,s);
if(s == ".")
break;
stack<char> b;
bool flag = true;
for(int i = 0; i < s.size(); i++){
if(s[i] == '('){
b.push('(');
}else if(s[i] == '['){
b.push('[');
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 41,384,475 |
#include <bits/stdc++.h>
using namespace std;
inline int ceiling_div(int a, int b){
return (a+b-1)/b;
}
int main(){
using station= tuple<int, int, int>;
int N,atTstart,forTwait,forTtrans;
cin >> N;
vector<station> data(N);
for(int i=0; i<N-1; i++){
cin >> forTtrans >> atTstart >> forTwait;
data.at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | 0 | 5,532,364 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
using namespace std;
using ll = long long;
typedef unsigned long long ull;
typedef... | #include <iostream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define P(s) cout << s << endl
#define PC(condition, _true, _false) if (condition) _true; else _false;
#define toInt(_char) _... | 0 | 80,184,636 |
#include <iostream>
#include <string.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i < n+1; i++){
char* num = (char*)calloc(10, sizeof(char));
snprintf(num, 10,"%d", i);
int sum = 0;
while(*num != '\0'){
sum += *num - 48;
num++;
}
if(sum >= a && s... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 9,000,149 |
#include <bits/stdc++.h>
#define nl '\n'
using namespace std;
typedef long long ll;
void solve() {
int S;
cin >> S;
const int mod = 1e9 + 7;
vector<ll> dp(S + 1);
dp[0] = 1;
for (int i = 3; i <= S; i++) {
for (int j = 3; j <= i; j++)
dp[i] = (dp[i] + dp[i-j]) % mod;
}
cout << dp[S];
}
int main... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l... | 0 | 10,449,590 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll n;string s;
bool ans=false;
bool ch[100010];
void dep(bool one){
for(ll i=1;i<n;i++){
bool now=true;
if(s[i]=='x'){
now=false;
}
ll nex=i+1;
if(nex==n){
nex=0;
}
if(now==ch[i]){
ch[n... | #include <stdio.h>
#include <set>
#include <utility>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, m, ans = 0;
scanf("%lld%lld", &n, &k);
if(k == 1) {
printf("0");
return 0;
}
ll sum[n + 1], a[n];
sum[0] = 0;
set< pair<ll, ll> > s;
set< pair<ll, ll> >::iterator it;
... | 0 | 10,636,962 |
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <unordered_map>
#include <stdlib.h>
#include <time.h>
#include <string>
const int MAX_N = 350;
int N;
std::string S[MAX_N];
bool... | #include<iostream>
using namespace std;
int main()
{
int n,i,d;
string s;
cin>>n>>s;
if(n%2!=0)
cout<<"No"<<endl;
else
{
d = n/2;
bool ok = true;
for(i=0;i<d;i++)
{
if(s[i]!=s[i+d])
{
ok = false;
break;
}
}
if(ok)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
} | 0 | 25,042,691 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int h,w;
string c,d;
cin>>h>>w;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin>>c;
if(c=="snuke"){
d=64+j;
cout<<d<<i<<"\n";
}
}
}
} | #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 | 41,514,358 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, m;
cin >> h >> w >> m;
int it, jt;
set<pair<int, int>> obj;
vector<int> ci(h), cj(w);
rep(i, m) {
cin... | 0 | 59,681,948 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 1; i < s.size(); ++i)
if (s[i] == s[i-1]) --n;
cout << n << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define IN... | 0 | 80,610,683 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | #include <cstdio>
#include <iostream>
using namespace std;
const int maxn = 100+5;
int h,w;
char c[maxn][maxn];
bool fh[maxn];
bool fw[maxn];
void solve() {
for (int i = 1; i <= h; i++) {
bool flag = true;
for (int j = 1; j <= w; j++) {
if (c[i][j] == '#') {
flag = false;
break;
}
}
if (flag) fh[... | 0 | 16,208,341 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string s; cin >> s;
vector <int> counter(26, 0);
long long ans = 1;
for (auto c: s){
int ord = c - 'a';
counter.at(ord) += 1;
}
for (auto cnt: counter){
ans *= cnt + 1;
ans %= 100000000... | #include <iostream>
int main() {
char c; std::cin >> c;
switch (c)
{
case 'A':
std::cout << 'T' << std::endl;
break;
case 'C':
std::cout << 'G' << std::endl;
break;
case 'G':
std::cout << 'C' << std::endl;
break;
case 'T':
std::cout << ... | 0 | 97,301,925 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
void solve() {
int h, w, d;
cin >> h >> w >> d;
if (d % 2) {
rep(i, h) {
rep(j, w) {
cout << ((i + j) % 2 ? "R" : "Y");
}
cout << endl;
}
ret... | 0 | 33,244,189 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 15,634,385 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
const ll mk = 200055;
const ll logn = 29;
const ll mod = 1e9 + 7;
#define endl "\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define fi first
#define se second
#define pii pair<... | 0 | 100,631,045 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main(){
int N;
cin>>N;
vector<int> D(N);
for(int i=0;i<N;i++){
cin>>D.at(i);
}
if(D.at(0)!=0){
cout<<0<<endl;
}else{
map<int,int> m;
int k=0;
for(int i=0;i<... | #include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"
using namespace std;
typedef long long ll;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
const double EPS = 1e-10;
int main(){
string s... | 0 | 79,355,135 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0; i < n; i++)
string s[10010];
int main(void)
{
int n;
cin >> n;
REP(i, n) cin >> s[i];
int cnt = 0, ca = 0, cb = 0, cab = 0,a,b;
REP(i, n) {
REP(j, s[i].length(... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
templ... | 0 | 64,922,597 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | 0 | 5,258,939 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
ll LCM(ll x, l... | #include<bits/stdc++.h>
using namespace std;
int main(){
double a, b; cin >> a >> b;
int ans=0;
int dis=1;
bool flg = true;
while(true){
if(floor(dis * 0.08) == a && floor(dis*0.1) == b){
ans = dis; break;
}
if(dis > 1000){
flg = false; break;
... | 0 | 81,410,440 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n;
long a[1<<17],b[1<<17];
vector<pair<long,int> >A;
main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
A.push_back(make_pair(a[i]+b[i],i));
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
long ans=0;
for(int i=0;i... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MOD 1000000007
#define MOD9 1000000009
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define... | 0 | 20,177,449 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
const ll INF=1e9+7;
const ll N = 100001;
ll m,n,x[N],y[N],ans=0,xs=0,ys=0,xad[N],yad[N];
int main(){
cin>>n>>m;
FOR(i,0,n)cin>>x[i+1];
FOR(i,0,m)cin>>y[i+1];
xad[n]=x[n];
yad[m]=y[m];
for(ll i=n-1;... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin >>n;
vector<int> vec(n);
for(int i=0;i<n;i++) cin >> vec[i];
if(n%2 == 0){
for(int i=n-1;i>0;i -= 2){
cout << vec[i] << " ";
}
for(int i=0;i<n-1;i += 2){
cout << v... | 0 | 67,481,747 |
#include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine ... | #include <iostream>
using namespace std;
int main(){
int a,b,c,i,x;
a =0;
b =0;
c =0;
for (int n=0;n<10;n++){
cin >> i;
if (c < i)
c = i;
if (b < c){
x = b;
b = c;
c = x;
}
if (a < b){
x = a;
... | 0 | 6,219,370 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
s+='T';
int x,y;
cin >> x >> y;
int n=s.size();
int direction=0;
int count=0;
vector<int> X,Y;
Y.push_back(0);
for (int i=0; i<n; i++){
if (s[i]=='F'){
... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 85,953,069 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M; cin >> N >> M;
priority_queue<ll> pq;
for (int i = 0; i < N; ++i) {
ll a; cin >> a;
pq.push(a);
}
for (int i = 0; i < M; ++i) {
ll highest = pq.top(); pq.pop();
pq.push(highest /... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
ll a, b, c, k, ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b >> c >> k;
if (k & 1)
ans = - a + b;
else
ans = a - b;... | 0 | 1,777,042 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi... | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(int i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << en... | 0 | 37,929,505 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<string> c(h);
rep(i,h) cin>>c[i];
rep(i,h){
cout<<c[i]<<"\n";
cout<<c[i]<<"\n";
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
int main()
{
int n; scanf("%d", &n);
std::vector<int> a(n+1), b(n);
long long count = 0;
for (int i=0; i<n+1; i++) scanf("%d", &a.at(i));
for (int i=0; i<n; i++) scanf("%d", &b.at(i));
... | 0 | 40,447,758 |
#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;
queue<char>q[3];
int main()
{
fast;
ll h,w;
cin>>h>>w;
vector<string>v(h+1);
v[0]="\0";
for(ll i=1;i<=h;i++)
{
cin>>v[i];
}
for(ll i=1;i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1... | 0 | 49,134,113 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep_r(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(),x.end()
#define resize(x, n) x.resize(n)
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll INF = 10... | 0 | 99,814,962 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
S += "000";
cout << ((S.substr(0, 4) == "YAKI") ? "Yes" : "No") << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define itn int
int main(void){
string t;
cin >> t;
stack<char> s;
int sum = 0;
for(int i = 0;i < t.size();i++){
if(s.empty() || s.top() == t[i])s.push(t[i]);
else {
sum += 2;
s.pop();
}
}
cout << su... | 0 | 30,466,534 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
map<char,int>mp;
for(int i=0;i<s.size();i++){
mp[s[i]]++;
}
if(mp.size()!=2){
cout<<"No"<<endl;
return 0;
}
for(auto a:mp){
if(a.second!=2){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fac[i-1... | 0 | 100,096,741 |
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a, b, C;
cin >> a >> b >> C;
double theta;
theta = C * M_PI / 180;
double S, L, h;
S = a * b * sin(theta) / 2;
printf("%.4f\n", S);
double c;
c = sqrt(a * a + b * b - 2 * a * b * cos(theta)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define F... | 0 | 20,850,380 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
int main(){
string s[30][30];
int H,W;
cin >> H >> W;
REP(i,H){
REP(j,W){
cin >> s[i][j];
if(s[i][j]=="snuke"){
cout << (char)('A'+j) << i+1 << endl;
}
... | 0 | 35,789,433 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t a, b, x;
cin >> a >> b >> x;
const int64_t temp_1 = (a * a * b - x) * 2;
const int64_t temp_2 = a * a * a;
const double tan_theta = static_ca... | #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 pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | 0 | 41,396,419 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
#includ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typ... | 0 | 15,683,136 |
#include <stdio.h>
int main(int argc, char *argv[]) {
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define LINF (ll)1e18
#define INF (int)1e9
#define ll_1e9 (ll)1e9
using namespace std;
int main(){
ll n,m;
cin >> n >> m;
ll cnt[n+1] = {};
ll a[m],b[m];
rep(i,0,m)... | 0 | 90,516,332 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
template<class T> inline bool chmin(T &a, T b){
i... | 0 | 67,517,457 |
#include <iostream>
#include <vector>
int main()
{
int n, t;
std::cin >> n >> t;
std::vector<int> arr(n);
for (int i = 0; i < n; ++i)
{
int tmp;
std::cin >> tmp;
arr[i] = tmp;
}
int64_t sum = 0;
for (int i = 0; i < n; ++i)
{
if (i != n - 1)
{
... | #include<bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end());
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define VL vector < ll >
#defin... | 0 | 63,876,611 |
#include <stdio.h>
struct freqency {
int num;
int freq;
}f[1000];
int main(void) {
int n;
int size=0;
int max_freq=0;
int mode[1000];
int s=0;
int i,j,temp;
int flag;
while(scanf("%d",&n)!=EOF) {
flag=0;
for(i=0;i<size;i++) {
if(f[i].num==n) {
flag=1;
f[i].freq++;
}
}
i... | #include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
typedef pair<int,int> P;
int flg[1000][1000];
void ini(int x,int y){
for(int k=0;k<y;k++){for(int j=0;j<x;j++){flg[k][j]=-1;}}
}
int main()
{
int x,y,n,sum=0;
char map[1000][1001];
char ntoi[10]="123456789";
queue<P> q;
int dx[4]={0,0,-1,1}... | 0 | 29,448,883 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,h;
cin >> n >> h;
vector<pair<int,bool>> ab(2*n);
for(int i = 0; i < n; i++) {
cin >> ab[i*2].first >> ab[i*2+1].first;
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m; cin >> n >> m;
vector<bool> a(n+1);
vector<bool> b(n+1);
rep(i, m) {
int tmp_a, tmp_b;
cin >> tmp_a >> tmp_b;
if (tmp_a == 1) a[tmp_b] ... | 0 | 86,780,330 |
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b,... | #define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fals... | 0 | 80,856,966 |
#include<iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int N, A[100],minj;
int count = 0;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N-1 ; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
swap(A[i], A[m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = (int)s.size();
ll ans = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'B') {
cnt++;
} els... | 0 | 90,783,724 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.