code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
std::string s;
std::string p;
cin>>s;
cin>>p;
s+=s;
int loc=s.find(p,0);
if(loc!=string::npos)
cout<<"Yes"<<endl;
... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 | 35,581,652 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | #include <bits/stdc++.h>
#include <boost/integer/common_factor_rt.hpp>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
for(int i=0;i<n;i++){
cin >> h.at(i);
}
int x=0;
int ans=0;
while(true){
while(h.at(x)==0){
x++;
i... | 0 | 5,521,553 |
#include <bits/stdc++.h>
#define pi 3.14159
#include <map>
#include <iterator>
using namespace std;
int main()
{
long long int a,n,i,k,c=0;
double b=0;
cin>>n>>k;
for(i=1;i<=n;i++)
{
a=0;
while(1)
{
if(i*pow(2,a)>=k)
break;
else
a++;
}
b+=pow(0.5,a);
}
cout<<setprecision(14)<... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) f... | 0 | 68,391,039 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<62;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <deque>
#include <map>
#define rep0(i, n) for (i = 0; i < n; i++)
#define rep(s, i, n) for (i = s; i < n; i++)
using namespace std;
#define INF 1<<30
int main(){
int h,w,m,i,wi,hi;
cin>>h>>w>>m;
vector<map<int... | 0 | 58,500,983 |
#include<bits/stdc++.h>
#define l(i,a,n)for(int i=a;i<n;i++)
#define pb push_back
#define in insert
#define mp make_pair
#define lw(v) sort(v.begin(),v.end());
#define hi(v) sort(v.begin(),v.end(),greater<long long>());
#define all(v) v.begin(),v.end()
#define filein freopen ("input.txt", "r", stdin)
#define fileout fr... | #include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }... | 0 | 55,550,040 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N,K,sum=0;
cin >> N >> K;
int data[N];
for(int i=0;i<N;i++) cin >> data[i];
sort(data,data+N,greater<int>());
for(int i=0;i<K;i++) sum += data[i];
cout << sum << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
LLi mod=1000000007;
vector<LLi> fac(1), facin(1);
void PV(vector<int> pvv) {
r... | 0 | 75,345,117 |
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h, w; cin >> h >> w;
int field[1010][1010] = {0};
queue<pair<int, int>> que;
for(int i=0; i<h; i++){
string s; cin >> s;
for(int j=0; j<w; j++)
if(s[j] == '#') que.push({i+1, j+1});
else field[i+1][j+1] = 1e9;
}
int d[] = ... | 0 | 65,389,518 |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) ... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | 0 | 53,834,081 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
vector<string> s;
for(int i=0; i<n; i++){
string a;
cin >> a;
s.push_back(a);
if(i==0) continue;
if(s[i-1][s[i-1].le... | 0 | 72,660,491 |
#include <iostream>
using namespace std;
int main(){
int a,b,c,d,i;
i=0;
cin >> a >> b >> c;
while(a<=b){
d=c%a;
if(d!=0){
}
else{
i++;
}
a++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
typed... | 0 | 49,639,056 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include <iostream>
using namespace std;
struct Card { char suit, value; };
void bubbleSort(struct Card C[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (C[j].value < C[j-1].value) {
swap(C[j], C[j-1]);
}
}
}
}
void selectio... | 0 | 39,282,325 |
#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
using namespace std;
int main(void){
string input;
while(getline(cin, input), !cin.eof()){
int a, b;
sscanf(input.c_str(), "%d %d", &a, &b);
if(a < b){
printf("a < b\n");
}
else if(a > ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;
const double pi = 3.14159265359;
con... | 0 | 70,101,074 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <cctype>
#include <cstdlib>
#include <map>
using namespace std;
#define INF (1 << 20)
#define EPS (1e-10)
#define EQ(a,b) (fabs((a)-(b)) <... | #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)... | 0 | 50,115,490 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 2e5 + 10;
int N, rnk[MAX_N], siz[MAX_N], pa[MAX_N], depth[MAX_N];
ll D[MAX_N];
map<ll, int> mp;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) scanf("%lld", &D[i]), mp[D[i]] = i;
for (int i = 1; i <= N; i++) rn... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using Graph = std::vector<std::vector<intt>>;
Graph G;
int main() {
intt N; std::cin >> N;
for (intt i = ... | 0 | 40,850,310 |
#include <iostream>
using namespace std;
#define INF (long)1e6
long dp[10][10];
int main() {
int n ;
while(1){
cin >> n ; if(!n) break;
for(int i=0;i<10;i++) for(int j=0;j<10;j++) dp[i][j]=INF;
for(int i=0;i<10;i++) dp[i][i]=0;
int V=0;
for(int i=0;i<n;i++){
int a,b,c; cin >> a >> b >> c ;
V=max(V,max... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; ++i) cin >> V[i];
long long result = 0;
for (int a = 0; a <= min(N, K); ++a) {
for (int b = 0; a + b <= min(N, K); ++b) {
... | 0 | 93,076,699 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> P;
constexpr int INF = 1e9;
constexpr int MOD = 1e9+7;
int main() {
int H,W,M;
cin >> H >> W >> M;
vi h(... | #include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int main(){
int n,id=1,nv,ch,index,syuryo=1;
scanf("%d\n",&n);
int *A = new int[100040];
bool *B = new bool[100040];
int *C = new int[100040];
string *D = new string[100040];
int st,ed;
for(int i=0;i<=100040;i++){
A[i]=0;
... | 0 | 67,813,401 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
typedef pair<int, int> P;
int n;
priority_queue<P> pq;
set<int> idxs;
long long ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
pq.push(P(p, i));
}
while (pq.size()) {
int p =... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).si... | 0 | 96,177,354 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int minX = 1000;
for (int i = 0; i < S.size() - 2; i++)
{
int X = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
minX = min(minX, abs(753 - X));
}
cout << minX << endl;
} | #include <iostream>
#include <vector>
int main()
{
using namespace std;
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
vector<vector<int>> DP(N, vector<int>(3));
for (int i = 0; i < N; i++)
{
cin >> a[i];
cin >> b[i];
cin >> c[i];
}... | 0 | 28,339,583 |
#include <iostream>
#include <vector>
using namespace std;
bool ask(int64_t n)
{
cout << "? " << n << endl
<< flush;
#if 0
int ans = 10;
string sn = to_string(n);
string sa = to_string(ans);
return (n <= ans && sn <= sa) || (n > ans && sn > sa);
#endif
string rep;
cin >> rep;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, X, M, Sum_A = 0;
cin >> N >> X >> M;
if (M > 1) {
vector<long long> A(M+1, 0);
A.at(1) = X;
for (int i = 2; i <= M; i++) {
A.at(i) = (A.at(i-1)*A.at(i-1))%M;
}
int nagasa = 0, hajime = 0;
for (int i = 1; i < M; i... | 0 | 51,696,151 |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
while(!feof(stdin)) {
int n, tmp, data[5];
for(int i=0;i<5;i++) scanf("%d", &data[i]);
if(feof(stdin)) break;
for(int i=4;i>0;i--) {
for(int j=0;j<i;j++) {
if(data[j]<data[j+1]) {
tmp=data[j+1]; data[j+1]=data[j]; data[j... | #include <iostream>
#include <stdio.h>
#define MAX 200000000
using namespace std;
int h, A[MAX];
void max_heepify(int ind){
int left = ind*2;
int right = ind*2+1;
int largest;
if (left <= h && A[left] > A[ind] ){
largest = left;
}
else{
largest = ind;
}
if(right <= h && A... | 0 | 33,037,585 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
int di[] = {-1, 0, 0, 1};
int dj[] = { 0,-1, 1, 0};
int main(){
int h,w;
cin >> h >> w;
vector<string> map(h);
rep(i,h) cin >> map[i];
queue<P> q;
rep(i,h) rep(j,w) if(map[i][j] == '#') q.emplace(i,j)... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
long int const mod = 1000000007;
string l;
cin >> l;
long int n = l.size();
long int dp[n][2];
dp[0][0] = 2;
... | 0 | 20,969,744 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).beg... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 47,123,803 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false... | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <cctype>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define maxn 5005
#define mo... | 0 | 32,999,662 |
#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(){
string s,t;
cin>>s>>t;
string u;
int i=0;
while(i<s.size()){
u+=s[i];
if(i<t.size()) u+=t[i];
i++;
}
cout<<u<<endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
bool find(string s, string p)
{
for(int i = 0; i < s.size(); ++i){
for(int j = 0; j < p.size(); ++j){
if(i+j >= s.size() || s[i+j] != p[j]) break;
if(j == p.size() - 1) return true;
}
}
retur... | 0 | 42,083,143 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
int main() {
int n; cin >> n;
int adj[n][n] = {};
for (int i = 0; i < n; i++) {
int u, k; cin >> u >> k;
for (int j = 0; j < k; j++) {
int v; cin >> v;
adj[u-1][v-1] = 1;
}
}
int d[n];
fill(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a, ll b) {
if (a > b) swap(a, b);
if (b % a == 0) {
return (b/a)*a*2-a;
}
return (b/a)*a*2+f(b%a, a);
}
int main () {
ll N, X;
cin >> N >> X;
if (X+X == N) {
cout << N/2*3 << endl;
return 0;
... | 0 | 55,292,476 |
#include <iostream>
#include <vector>
#include <deque>
#include <set>
#include <cstring>
#include <climits>
using namespace std;
#define ff(i,s,n) for(int i=s;i<n;i++)
#define fr(i,s,n) for(int i=n-1;i>=s;i--)
#define llu long long int
int main() {
int m,n,bombs;
cin>>m>>n>>bombs;
set<llu> values;
int rows[m];int ... | #include<bits/stdc++.h>
using namespace std;
int ans[100001];
int w[100001];
int x[100001];
int n,l,t,cur;
int main()
{
scanf("%d%d%d",&n,&l,&t);
for(register int i=1;i<=n;++i) scanf("%d%d",&x[i],&w[i]);
for(register int i=1;i<=n;++i)
if(w[i]==1)
{
ans[i]=(x[i]+t)%l;
... | 0 | 88,628,505 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<char> s = {'a', 'b', 'c', 'd', 'e',
'f', 'g', 'h', 'i', 'j',
'k', 'l', 'm', 'n', 'o',
'p', 'q', 'r', 's', 't',
'u', 'v', 'w', 'x', 'y'... | #include <cstdlib>
#include <climits>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <regex>
#in... | 0 | 27,498,229 |
# include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
#define SEND_HELP ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
inline void setPrecision(int n){cout.precision(n);}
#define BR cerr<<endl
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#define d... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
#define topo_SIZE 10000
vector<int> topologicalSort(vector<vector<int> > G,int n=-1){
int indeg[topo_SIZE] =... | 0 | 36,783,878 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N, M, temp;
const int max1 = (10e+5) + 1;
pair<int,int> way[max1];
int ans = 0;
int main() {
while(cin >> N >> M && N != 0) {
ans = 0;
for(int i = 0;i < max1 ; i++) way[i] = make_pair(0,0);
for(int i = 0;i < N ; i++) cin >... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, X, Y;
cin >> N;
cin >> K;
cin >> X;
cin >> Y;
int ans = 0;
if (N > K)
{
ans = K * X + (N - K) * Y;
}
else
{
ans = N * X;
}
cout << ans << endl;
return 0;
} | 0 | 91,751,411 |
#include<vector>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<bits/stdc++.h>
#include<cstring>
#include<map>
#include<cmath>
#include<set>
using namespace std;
#define ll long long int... | #pragma GCC optimize("avx2, O3")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <deque>
#include <map>
#include <fstream>
#include <utility>
#include <stack>
#include <unordered_map>
#include <unord... | 0 | 44,464,112 |
#include <bits/stdc++.h>
#define ull uint64_t
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mx5 100005
#define mx6 1000005
#define mod 1000000007
#define nfs ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main() {
nfs
... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define in4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c... | 0 | 93,616,626 |
#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 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
int main()
{
int a,b,c,d,e,k=0,s,a1,b1,c1,d1,e1,z[5];
cin>>a>>b>>c>>d>>e;
if (a%10==0)
k=k+a;
else
{
... | 0 | 92,277,300 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF=1e18;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
ll s;
cin >> s;
ll x1,y1,x2,y2,x3,y3;
ll M=1000000000;
x1=0,y1=0;
x2=M;
y2=1;
x3=... | #include <bits/stdc++.h>
using namespace std;
#ifdef SG
#include <debug.h>
#else
#define show(...)
#define debug(...)
#define deepen(...)
#define timer(...)
#endif
#define ARG4(_1,_2,_3,_4,...) _4
#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(_... | 0 | 70,317,681 |
#include <bits/stdc++.h>
using namespace std;
int val=1,n;
double k;
int main (){
cin>>n>>k;
int z=k;
while(double(k)/2>1){
val++;
k/=2;
}
if(n>=val){
cout<<pow(2,val)+z*(n-val);
}
else{
cout<<pow(2,n);
}
} | #include <iostream>
using namespace std;
typedef long long ll;
ll sma, sum, n;
bool ans = true;
int main(void){
sma = 1000000000000;
cin >> n;
for (ll i = 0; i < n; i++){
ll a, b;
cin >> a >> b;
if (a != b) ans = false;
sum += a;
if (a > b) sma = min(sma, b);
}
... | 0 | 41,300,645 |
#include<stdio.h>
int main(){
int m, f, r;
for(int i=0; ; i++){
scanf("%d %d %d", &m, &f, &r);
if(m==-1&&f==-1&&r==-1) break;
else if(m==-1||f==-1) printf("F\n");
else if (m+f>=80) printf("A\n");
else if(m+f>=65) printf("B\n");
else if(m+f>=50) printf("C\n");
else if(m+f>=30){
if(r>=50) printf("C\n")... | #include <iostream>
#include <math.h>
using namespace std;
int main(){
double x[3],y[3],xp,yp;
while (cin>>x[0]>>y[0]>>x[1]>>y[1]>>x[2]>>y[2]>>xp>>yp) {
double c[3];
c[0] = (x[1]-x[0]) * (yp-y[1]) - (y[1]-y[0]) * (xp-x[1]);
c[1] = (x[2]-x[1]) * (yp-y[2]) - (y[2]-y[1]) * (xp-x[2]);
... | 0 | 97,485,211 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int w,h,x,y,r;
cin>>w>>h>>x>>y>>r;
if(x+r<=w&&x-r>=0&&y+r<=h&&y-r>=0)
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vec... | 0 | 70,257,966 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
using TI3 = std::tuple<int, int, int>;
us... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k, s;
cin >> k >> s;
int ans=0;
for (int i=0; i<=k; i++){
for (int j=0; j<=k; j++){
if (s-i-j<=k && s-i-j>=0) ans++;
}
}
cout << ans << "\n";
} | 0 | 76,190,548 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <queue>
#include <tuple>
#include <regex>
#include <cmath>
#include <map>
#include <cstring>
template<typename T> bool chmax( T &a, const T &b ) { if ( a <= b ) { a = b; return (... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 58,549,818 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >>S;
int lo = S.size();
string ans = "AC";
if(S[0]!='A')ans = "WA";
int count = 0;
for(int i = 1; i < lo; i++){
if(isupper(S[i])){
if(i==1 || i==lo-1 || S[i]!='C') ans = "WA";
count++;
}
}
if(count!=1)ans="WA";
cout<<ans<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n,m;
cin >> n >> m;
vector<pair<ll, int>> x(n);
for(int i=0;i<n;i++) cin >> x[i].first >> x[i].second;
sort(x.begin(), x.end());
ll ans =0;
for(int i=0;i<n;i++){
if(m<=x[i].second){
ans... | 0 | 44,523,707 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); i++)
#define ll long long
using namespace std;
const int CountStop=245959;
int main() {
while (1) {
int n; cin>>n;
if (n==0) break;
vector<int> x(CountStop+1, 0);
rep(i, n) {
string S,G; cin>>S>>G;
int start=0;
start+=(in... | #include<bits/stdc++.h>
using namespace std;int l(string a,string b){int m=a.size(),n=b.size(),i=0,j,s=0,c[1001][1001]={};for(a=' '+a,b=' '+b;++i<=m;)for(j=0;++j<=n;s=s<c[i][j]?c[i][j]:s)c[i][j]=a[i]==b[j]?c[i-1][j-1]+1:c[i-1][j]>c[i][j-1]?c[i-1][j]:c[i][j-1];return s;}main(){string a,b;int n;for(cin>>n;n--;)cin>>a>>b,... | 0 | 46,108,835 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int n, K;
cin >> n >> K;
vector<pair<ll, ll>> xy(n);
vector<ll> x(n), y(n);
for(int i = 0; i < n; i++) {
cin >> xy[i].first >> xy[i].second;
x... | #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>;
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<ll, ll> > res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
whil... | 0 | 41,584,472 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, y;
cin >> n >> y;
int res1 = -1, res2 = -1, res3 = -1;
for(int i=0; i<=n; i++){
for(int j=0; i+j<=n; j++){
int k=n-i-j;
int total = 10000*i+5000*j+1000*k;
if(total==y){
res1 = i;
res2 = j;
res3 = k;
}
}
}
cout << res1 << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int n;
cin >> n;
string s;
cin >> s;
vector<ll> a(3);
rep(i,s.size()){
if(s.at(i)=='R'){
a.at(0)++;
}
if(s.at(i)=='G'){
a.at(1)++;
}
if(s.at(i)=... | 0 | 71,353,893 |
#include <iostream>
using namespace std;
int main(void){
int n=0,m=0;
while(cin>>n,n){
char change[100][2];
char s;
for(int i=0;i<n;i++){
cin >> change[i][0] >> change[i][1];
}
cin >> m;
for(int j=0;j<m;j++){
cin >> s;
for(int k... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 60,521,105 |
#include <iostream>
using namespace std;
struct point{
double x;
double y;
};
struct line{
point p1;
point p2;
};
bool parallel(line l1, line l2){
double dx1 = l1.p2.x - l1.p1.x;
double dy1 = l1.p2.y - l1.p1.y;
double dx2 = l2.p2.x - l2.p1.x;
double dy2 = l2.p2.y - l2.p1.y;
if(dy2 * dx1 == dy1 * dx2) return tr... | #include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <tuple>
#include <cassert>
#include <exception>
#include <io... | 0 | 63,224,336 |
#include <iostream>
using namespace std;
int main() {
int n,k;
int a[100001];
int max;
int sum_seq;
while(cin >> n >> k) {
if(n==0 && k==0) break;
for(int i=0;i<n;i++) cin >> a[i];
max=0;
sum_seq=0;
for(int i=0;i<k;i++) sum_seq+=a[i];
for(int i=0;i<=n-k;i++) {
if(max<sum_seq) max... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 0 | 68,982,490 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_st... | #include <iostream>
using namespace std;
#define ll long long
ll n;
int main(){
cin >> n;
ll ans = n*(n+1)*(n+2);
ans/=6;
for(int i=0;i<n-1;i++){
int a,b;
cin >> a>> b;
ll sub =0;
if(a>b){
sub = (n+1-a)*(b);
}
else{
sub = (n+1-b)*(a... | 0 | 82,849,954 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
int r; cin>>r;
cout<<pow(r,2)<<endl;
} | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | 0 | 69,906,668 |
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
int tmp;
int fx = 0;
cin >> N;
tmp = N;
int amari = 0;
while( tmp > 0){
amari = tmp % 10;
fx = fx + amari;
tmp = tmp / 10;
}
if(N... | #include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
signed main(){
int mod=1000000007;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#else
#endif
int r,c;
cin >> r >> c;
char grid[r][c];
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
cin >... | 0 | 10,566,487 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
int n;
long long a, b, l;
int main(){
scanf("%d", &n);
while(n--){
scanf("%lld%lld", &a, &b);
if(a>b)std::swap(a, b);
if(a==b)printf("%d\n", a*2-2);
else if(a+1==b)printf("%d\n",a*2-2);
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n)... | 0 | 75,184,730 |
#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>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 93,484,028 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<tuple>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(ll i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
template <class T = int>T in(){
T x;
cin >> x;
return (x);
}
signed main(){
cin.... | 0 | 18,580,667 |
#include <algorithm>
#include <iostream>
#include <vector>
int main()
{
std::string s;
std::cin >> s;
std::cout << (std::count(s.begin(), s.end(), 'x') >= 8 ? "NO" : "YES") << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> g[100005];
int DFS(int u,int root)
{
int rs=0;
for(int i=0;i<g[u].size();i++)
if(g[u][i]!=root)
rs^=DFS(g[u][i],u)+1;
return rs;
}
int main()
{
cin>>n;
int u,v;
for(int i=1;i<n;i++)
{
cin>>u>>v;
... | 0 | 59,321,158 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string normalize(string s) {
char c = 'A';
unordered_map<char, char> table;
string result = "";
for (int i=0; i<s.size(); i++) {
if (! table[s[i]]) {
table[s[i]] = c;
result.push_back(c);
c++;
} else {
result.push_back(table[s[i]]);... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int dx[4] = {-1, 1, ... | 0 | 11,035,280 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;cin>>n;
ll a[n];for(ll i=0;i<n;i++)cin>>a[i];
ll sai[n];
sai[0]=a[0];
for(ll i=1;i<n;i++)sai[i]=max(sai[i-1],a[i]);
vector<ll> v;
for(ll i=0;i<n;i++)v.push_back(sai[i]);
v.erase(unique(v.begin(),v.end()),v.end());
ll t... | #include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
struct card{char suit,value;};
void bubbl(struct card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>=i+1;j--){
if(a[j].value<a[j-1].value){
card t=a[j];a[j]=a[j-1];a[j-1]=t;
}
}
}
}
void selectio(st... | 0 | 57,945,218 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define MOD 1000000007
#define enld endl
typedef long long ll;
using namespace std;
template<typename A... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for(int i=0;i<n;i++)
#define ms(x) memset(x,0,sizeof(x))
#define ms2d(x,m... | 0 | 100,503,060 |
#include<stdio.h>
int main()
{
int a, b;
scanf("%d %d",&a,&b);
int x = 0;
for(int i = 1; i < a; i++){
x += i;
}
int y = 0;
for(int j = 1; j < b; j++){
y += j;
}
printf("%d",y+x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | 0 | 35,965,301 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i, n) for(int i=0; i<n; i++)
#define fo(i, k, n) for(int i=k; i<n; i++)
#define forr(i, a, b) for(int i=a; i<=b; i++)
#define rf(i,n) for(int i=n;i>=0;i--)
typedef unsigned long long ull;
typedef pair<int ,int> pr;
#de... | #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
#define int long long
#ifndef bhupixb
#define var(...)
#define stl(...)
#endif
#define single_test
const int maxn = 3e5 + 3;
set<pair<int,int>> st;
int freq[maxn];
inline void add(int x) {
st.erase({freq[x], x});
freq[x]++;
st.in... | 0 | 40,922,247 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#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 iINF = 1001001001;
const long long llINF = 1LL << 60;
int main()
{... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0,m=0,x=0;
cin>>n>>m;
priority_queue<int> pq;
for(int ... | 0 | 76,594,976 |
#include <bits/stdc++.h>
int main(){std::string s;std::cin>>s;std::cout<<(s.substr(0,4)=="YAKI"?"Yes":"No")<<"\n";} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 74,825,036 |
#include <cassert>
#include "limits.h"
#include <limits>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 19,537,135 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int N;
string c1[36], c2[36];
cin >> N;
for(int i=0;i<N;i++) cin >> c1[i];
for(int i=0;i<N;i++) c2[i]=c1[i];
for(int i=0;i<N;i++){
for(int j=N-1;j>i;j--){
if(c1[j][... | 0 | 47,056,300 |
#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, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
int L... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,f,n) for(int i=f; i<(n); i++)
int main()
{
int ans = 0;
int n, m;
cin >> n >> m;
int k[m];
vector<vector<int>> s(m);
vector<int> p(m);
REP(i,0,m){
cin >> k[i];
s[i].resize(k[i]);
REP(j,0,k[i]){
cin >> s[i][... | 0 | 72,479,979 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int countAB(string s){
int N = s.size();
int cnt = 0... | #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 | 40,568,240 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> A){
for(auto a : A){
if(a == 0){
cout << 0 << endl;
return;
}
}
long long ans = 1;
for (int i = 0; i < N; i++)
{
if(A[i] <= 1000000000000000000/ans) ans *= A[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<int> vodd(100001, 0), veven(100001, 0);
for (int i = 0; i < n; i++) {
in... | 0 | 31,979,536 |
#include <stdio.h>
int main (){
int a,b,i;
scanf("%d",&a);
scanf("\n%d",&b);
if(a==1 && b==2 || a==2 && b==1){
printf("3\n");
}else if (a==1 && b==3 || a==3 && b==1){
printf("2\n");
}else {
printf("1\n");
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
int mt[100][100];
int w,h;
vector<pair<int,int> > block;
void saiki(int y,int x){
rep(i,block.size())
if(y==block[i].first && x==block[i].second){
mt[y][x]=0;
return;
}
if(x-1>=0 && y-1>=0)mt[y]... | 0 | 52,946,840 |
#include<iostream>
using namespace std;
int main()
{
long long n,a=1;
cin >> n;
for (int i = (int)n; i >= 2; i--){
a *= i;
}
cout << a << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
string S;
cin >> S;
int N = S.size();
vector<string> v = {"dream", "dreamer", "erase", "eraser"};
reverse(S.begin(), S.end());
for(auto &e: v) {
reverse(e.begin(), e.end());... | 0 | 98,852,261 |
#include <bits/stdc++.h>
#define fi first
#define se second
#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;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 65;
bool ch[maxn];
long long mask[maxn];
long long a[100005], all;
void Insert(long long t){
for(int i=60;i>=0;i--){
if(ch[i]) continue;
if((t>>i)&1){
if(mask[i]==0){
mask[i] = t;
return;
... | 0 | 97,256,553 |
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<functional>
#include<set>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x>>y;
int A=0,B=0;
if(x==(-y)){
cout<<1<<endl;
return 0;
}
if(((x>0)&&(y>0))&&(x<y)){
cout<<y-x<<endl;
return 0;
}
if(((x>0)&&(y>0))&&(x>y)){
cout<<abs(y-x)+2<<endl;
return 0;
}
if((x<0)&&(y>0)){
... | 0 | 611,059 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int64_t count = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++){
cin >> vec.at(i);
}
for(int i = 0; i < N - 1; i++){
if(vec.at(i) > vec.at(i + 1)){
count += vec.at(i) - vec.at(i + 1);
... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath... | 0 | 74,920,126 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int bit2count(int a)
{
for (int i = 0; i < 31; ++i)
if (a & (1 << i))
return i;
return -1;
}
int main()
{
ll n, m;
cin >> n >> m;
vector<... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | 0 | 71,928,201 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #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,k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
map<int,int> vmp;
for(int i = 0; i < n; i+... | 0 | 39,444,665 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
int Y[109] ={};
int M[109] ={};
int D[109] ={};
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d %d %d",&Y[i],&M[i],&D[i]);
}
for(int i=0;i<n;i++){
int ans = 0;
for(int j = Y[i]+1;j< 1000 ; j++){... | #include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main()
{
unsigned n;
int i,sum=0;
char str[10];
cin>>str;
n=atoi(str);
for(i=0;i<strlen(str);i++)
{
sum+=str[i]-48;
}
if(n%sum)
{
cout<<"No";
}
else
{
cout<<"Y... | 0 | 37,334,590 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using vec_b = vector<bool>;
using vec_str = vector<string>;
#define INF (1LL << 60)
#define MOD 1000000007
#define REP(i,m,n) for(ll (i)=(m),i##_len=(n);(i)<(i##_len);++(i))
#define FORR(i,v) for(auto (i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " ... | 0 | 45,828,743 |
#include<bits/stdc++.h>
using namespace std;
#define MAX 100001
#define MOD 1000000007
#define ll long long
#define ld long double
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
vector<int> ret;
void dfs(vector<vector<int>>& adj, vector<int>& vis, int n, int ch, int par) {
vis[ch] = 1... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first... | 0 | 36,407,498 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
for (int i = A; i < 100000; i += A) {
if (i % B == C) return cout << "YES" << "\n", 0;
}
cout << "NO" << "\n";
} | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string t, h;
int n, t_len, h_len, itr, t_score, h_score;
t_score = 0;
h_score = 0;
cin >> n;
for (int i=0; i<n; ++i){
cin >> t >> h;
itr = 0;
t_len = t.length();
h_len = h.l... | 0 | 83,858,429 |
#include <iostream>
#include <string>
using namespace std;
#define max(a, b) a > b ? a : b;
int main() {
int q;
int i, j, k;
string x, y;
cin >> q;
for (i = 0; i < q; i++) {
int maxVal = 0;
cin >> x;
cin >> y;
int lenx = x.size();
int leny = y.size();
x = ' ' + x;
y = ' ' + y;
... | #include<bits/stdc++.h>
#define fi first
#define se second
typedef long long ll;
using namespace std;
class shortest_path{
public:
explicit shortest_path(int n):vertex(n),INF(0){}
shortest_path(int n,ll inf):vertex(n),INF(inf){
v2.resize(static_cast<unsigned long>(vertex));
for(int i=0;i<vertex;... | 0 | 49,041,004 |
#include <bits/stdc++.h>
using namespace std;
bool custom (vector<int> &a, vector<int> &b) {
return (a.size() < b.size());
}
int main() {
int n;
cin >> n;
vector<pair<int, int>> r(n);
vector<pair<int, int>> b(n);
vector<vector<int>> rpp(n);
vector<vector<int>> bpp(n);
for(int i=0;i<n;i++) {
cin >> r... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_elemen... | 0 | 27,348,693 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
while(N--){
int i[3],c;
int max;
cin >> i[0] >> i[1] >> i[2];
sort(i,i+3);
cout << ((i[0]*i[0]+i[1]*i[1]==i[2]*i[2])?"YES\n":"NO\n");
}} | #include<iostream>
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
int n ;
cin >> n ;
int a[n+2] ;
a[0] = 0 ;
a[n+1] = 0 ;
int sum = 0 ;
for(int i=1;i<=n;i++){
cin >> a[i] ;
sum+= abs(a[i]-a[i-1]) ;
}
... | 0 | 3,242,578 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
cout << n*n << '\n';
} | #include<queue>
#include<cctype>
#include<cstdio>
#define mp make_pair
using namespace std;
typedef pair<int,int> point;
const int maxn = 1005;
int height,width;
char maze[maxn][maxn];
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
bool visited[maxn][maxn];
int shortDistance(int sx,int sy,int ex,int ey)
{
for... | 0 | 59,036,308 |
#include<stdio.h>
int main(){
char a;
int i,c[27]={0};
while(scanf("%c",&a)!=EOF){
if(a>=65&&a<=90){
c[a-65]++;
}
if(a>=97&&a<=122){
c[a-97]++;
}
}
for(i=0;i<26;i++){
printf("%c : %d\n",i+97,c[i]);
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
int a[n], x;
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans = k;
for(int i=1;i<n-1;i++) ans = min(ans,k-(a[i+1]-a[i]));
ans = min(ans,k-(a[0]+k-a[n-1]));
cout << ans;
} | 0 | 40,727,699 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
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;
vector<int> g[105];
vector<int> d(105, -1);
int main(){
int n;
cin >> n;
rep(i,n... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tata return;
#define pb push_back
#define mp make_pair
#define in insert
#define run ios_base::sync_with_stdio(false);cin.tie(NULL);
#define yes cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define vec vector<ll>
#define setl set<ll>
#define m... | 0 | 42,249,444 |
#include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define MOD9 998244353
#define Pi acos(-1)
#define LL long long
#define ULL unsigned lo... | #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
using namespace std;
int main(){
int N,M,P;
while(cin>>N>>M>>P,N){
int a,sum=0,win;
REP(i,0,N){
cin>>a;
if(i+1==M) win=a;
sum+=a*100;
}
sum*=100-P;
sum/=100;
if(win==0) cout<<"0"<<endl;
else cout<<sum/wi... | 0 | 94,916,448 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#de... | #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(){
ll a,b,k;cin>>a>>b>>k;
if(a>=k){
a-=k;
cou... | 0 | 38,905,260 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
int ans=0;
cin >> A>>B;
N=A;
while(N<=B){
int d5=N%10;
int d4=N/10%10;
int d3=N/100%10;
int d2=N/1000%10;
int d1=N/10000;
if(d5==d1&&d4==d2){
ans++;
}
N=N+1;}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 48,908,373 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include <iostream>
#include <map>
using namespace std;
void Solution()
{
string str;
string most_Freq;
string most_Long;
int times = 0;
map<string, int> data;
most_Long = most_Freq = str;
while (cin>>str)
{
data[str]++;
if (str.size() > most_Long.size())
{
... | 0 | 4,243,968 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string word, frequent = "", longest = "";
map<string, int> mp;
while(cin >> word){
mp[word]++;
if(mp[frequent] < mp[word]){
frequent = word;
}
if(longest.size() < word.size()){
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 4,346,937 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<functional>
#include<queue>
#include<stack>
#include<math.h>
#define INF 999999
#define EPS 1.0e-6
using namespace std;
typedef long long ll;
int r[10500];
int n, q;
void init()
{
for (int i =... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 20,312,434 |
#include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#... | #include <set>
#include <string>
#include <iostream>
int main()
{
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::set<std::string> dic;
int n;
std::cin >> n;
for(int i = 0; i < n; ++i){
std::string command, str;
std::cin >> command >> str;
if(command[0] == 'i'){
... | 0 | 37,911,973 |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define ll long long
#define ld long double
#define fi first
#define se second
#define sz(x) x.size()
#define mp make_pair... | #include<bits/stdc++.h>
using namespace std;
#define f0(i,n) for(i=0;i<n;i++)
#define flast(i,n) for(i=n-1;i>=0;i--)
#define f1(i,n) for(i=1;i<=n;i++)
#define f(i,a,n) for(i=a;i<=n;i++)
#define fit(v) for(auto itr=v.begin();itr!=v.end();itr++)
#define ump(a,b) ... | 0 | 31,590,672 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,ans=1;
bool t=true;
cin >> n;
int64_t a[n];
for(int64_t i=0;i<n;i++){
cin >> a[i];
if(a[i]==0){
cout << 0 << endl;
t=false;
break;
}
}
if(t){
for(int64_t i=0;i<n;i++){
if(a[i]>1000000000000000000... | 0 | 59,686,338 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <iostream>
#include <vector>
#include <algorithm>
#define MAXVALUE 10000
#define rep(i,a) for(i=0;i<a;i++)
using namespace std;
void CountingSort(vector<int> &A, vector<int> &B, int k){
int i,j;
vector<int> C(k+1,0);
for(j=0; j<A.size(); j++) {
C[A[j]]++;
}
for(i=1; i<=k; i++) {
... | 0 | 96,967,590 |
#include <bits/stdc++.h>
using namespace std;
struct Node {
int index = -1;
int depth = -1;
int parent = -1;
vector<int> child;
};
int get_depth(Node *node, int index) {
if (node[index].parent < 0) {
return 0;
} else if (node[index].depth > 0){
return node[index].depth;
} els... | #include<stdio.h>
main(){
int n,A[100],mini,cnt=0,x;
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&A[i]);
}
for(i=0;i<n;i++){
mini = i;
for(j=i;j<n;j++){
if(A[j] < A[mini]){
mini = j;
}
}
if(mini!=i){
x = A[i];
A[i] = A[mini];
A[mini] = x;
... | 0 | 53,110,019 |
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int H,W;
cin >> H >> W;
char C[H][W];
rep(i,H)rep(j,W)cin >> C[i][j];
for(int i=0;i < H*2;i++){
for(int j=0;j<W;j++){
cout << C[i/2][j];
}
... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define ... | 0 | 81,127,597 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s,t;cin>>s>>t;
int n=s.size();
rep(i,n){
s=s.substr(1)+s[0];
if(s==t){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<end... | #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 frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 26,494,214 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | #pragma GCC optimize("Ofast", "unroll-loops")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main(void){
string S, T;
cin >> S >> T;
vector<char> s_to_t(26, ' ');
const int sz = S.length();
for (int i = 0; i < sz; ++i){
... | 0 | 69,350,593 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
vector<double> a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
double ans=0;
for(int i=1;i<n;i++)
{
a[i]=(a[i-1]+a[i])/2.0;
ans=a[i];
}... | #include <iostream>
#include <string>
#include <vector>
#include <bitset>
#include <limits>
using namespace std;
using ll = long long;
#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 ... | 0 | 47,156,362 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | #include <stdio.h>
#include <iostream>
#include <climits>
#include <map>
#include <cmath>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <vector>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <utility>
#include <queue>
using namespace std;
#define ll long long
#defin... | 0 | 86,987,600 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int L[2000][2000];
int R[2000][2000];
int U[2000][2000];
int D[2000][2000];
int main... | #include <iostream>
#include <string>
const int SURFACE_NUM = 6;
enum Direction{TOP, SOUTH, EAST, WEST, NORTH, BOTTOM};
class Dice{
public:
void roll(char op);
int top(){
return label_value[label_dir[TOP]];
}
Dice(int label_value[SURFACE_NUM]);
int getright(int top, int front);
void rese... | 0 | 26,008,638 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string s;
cin>>s;
bool ex=true;
if(s[0]!='A'){
ex=false;
}
if(isupper(s[s.size()-1])||isupper(s[1])){
ex=false;
}
if(ex){
... | 0 | 88,785,279 |
#include <bits/stdc++.h>
using namespace std;
int num[101];
int main() {
int n;
while ( cin >> n ) num[n]++;
int maxn = 0;
for ( int i = 1; i < 101; i++ ) maxn = max(maxn,num[i]);
for ( int i = 1; i < 101; i++ ) {
if ( num[i] == maxn ) cout << i << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define REP(i,a,n) for(ll i=a;i<(n);i++)
#define REP_sz(i,s) for(ll i=0;i<s.size();i++)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define pb push_back
#define sz(a) a.size()
#define V vector
#define ld long double
#define viit(a) ve... | 0 | 88,632,939 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.