code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <string>
#include <bitset>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef do... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int n,m;
int main(){
while(cin >> n >> m && n>0){
vector<int> C;
int P[m+5][n+5] = {0};
for(int i=0;i<m;i++){
int c;
cin >> c;
C.push_back(c);
}
sort(C.begin(),C.end());
for(int i=0;i<m;i++){
for(in... | 0 | 87,497,049 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include <bits/stdc++.h>
using namespace std;
struct point{
double x, y;
};
const double rot = M_PI / 3.0;
void koch(int n, point a, point b){
if(n == 0) return;
point s, t, u;
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0;
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0;
t.x = (1.0 * a.x + 2.0 * b.x) / 3.0;
... | 0 | 87,690,272 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
int main() {
int N; cin >> N;
vector<int> L(2 * N, 0);
for (int i = 0; i < 2 * N; i++) cin >> L[i];
sort(L.begin(), L.end(), greater<int>());
int sum = 0;
for (int i = 0; i < 2 * N... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main(void)
{
ll n;
cin>>n;
vector<ll> a(n);
... | 0 | 10,679,707 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
static const int MAX = 10000;
static const int WHITE = 0;
static const int BLACK = 1;
int n, e;
int indeg[MAX], color[MAX];
vector<int> L[MAX];
vector<int> vec;
void bfs(int u) {
queue<int> Q;
Q.push(u);
color[u] = BLACK;
while (!Q.empty()) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin >> n;
string s="",t="", m="";
for(int i=0; i<n; i++){
cin >> x;
s+=(char)(x+'0');
}
for(int i=0; i<n; i++){
cin >> x;
t+=(char)(x+'0');
}
for(int i=1; i<=n; i++){
m+=(char)(i+'0... | 0 | 7,002,761 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int A[4];
while(cin >> A[0] >> A[1] >> A[2] >> A[3]){
vector<int> c(10, 0);
for(auto& t : A) c[t] = 1;
cout << (c[1] && c[4] && c[7] && c[9] ? "YES" : "NO") << endl;
}
} | #include <vector>
#include <iostream>
using namespace std;
using ll = long long int;
int main(){
int n; cin >> n;
int current = 0;
ll ans = 0;
for(int i=0; i<n; i++){
int a; cin >> a;
if(i == 0){
current++;
if(a > 1){
ans += a-1;
}
... | 0 | 246,844 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string result = "";
for(int i = 0; i < str.size(); i += 2) {
result += str.at(i);
}
cout << result << endl;
} | #pragma GCC optimize ("Ofast")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i,j,n) for (int i=(int)(j);i<(n);i++)
#define REP(i,n) for (int ... | 0 | 14,107,951 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, in... | 0 | 92,172,870 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
unsigned long long result = 1, border = 1000000000000000000;
cin >> n;
vector<unsigned long long> a(n);
for (auto &i: a)
{
cin >> i;
if(0 == i)
{
cout << 0 << endl;
return 0;
... | 0 | 17,116,290 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 584,608 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N;
cin >> N;
cout << N / 3 << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ... | 0 | 18,152,754 |
#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;
cin >> N;
vector<int>A(N);
vector<int>B(N);
rep(i,N){
cin >> A[i];
B[i] = A[i];
}
sort(B.begin(),B.end(),greater<>());
int max_a = B[0];
... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
vector<vector<int> > v(100000);
int dfs(int now,int p){
int ret = 0;
for(auto& to:v... | 0 | 26,012,127 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll a,b,c,n,m;
while(1)
{
cin>>n;
if(n == 0)break;
string leg[200];
for(int i=0;i<n;i++)
{
cin>>leg[i];
}
for(int i=n;i<199;i++)
{
leg[i] == "";
}
int count = 0;
bool... | #include<iostream>
using namespace std;
int main()
{
int n, d = 100000;
cin >> n;
for(; n-- ;)
{
if((d + d*5/100)%1000 == 0) d = d + d*5/100;
else
{
d = d + d*5/100 + (1000-(d + d*5/100)%1000);
}
}
cout << d << endl;;
} | 0 | 40,857,493 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1<<30... | #include <bits/stdc++.h>
using namespace std;
int main () {
string s;
cin >> s;
int a = s[0] - '0', b = s[1] - '0', c = s[2] - '0', d = s[3] - '0';
bool con = 1;
for (int i = -1; i < 2; i = i + 2)
for (int j = -1; j < 2; j = j + 2)
for (int k = -1; k < 2; k = k + 2) {
... | 0 | 97,731,811 |
# include <iostream>
using namespace std;
long long N;
long long K;
long long a[100005];
long long prefixsum[100005];
long long pprefixsum[100005];
long long tempsum;
long long ans=0;
long long totalsum;
long long psum(long long left, long long right)
{
return prefixsum[right]-prefixsum[left-1];
}
long long ppsum(... | #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);
int main(){
ll n;
cin >> n;
map<ll, ll> a;
rep(i, n){
ll an;
cin >> an;
a[an]++;
}
ll ans = 0;
for(auto i : a){
if(i.sec... | 0 | 23,810,064 |
#include <iostream>
int main(){
int A,B;
scanf("%d %d", &A, &B);
if(A > 8 || B > 8){
printf(":(");
}else{
printf("Yay!");
}
return 0;
} | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll A, B, C, K;
cin >> A >> B >> C >> K;
ll ans;
if(K % 2 == 0){
ans = A... | 0 | 20,518,843 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
map<string,boo... | #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 rSORT(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 << " = " << (... | 0 | 52,948,760 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int N; cin >> N;
map<long long, long long> mp;
mp[0] = 1;
long long sum = 0;
long long res = 0;
for(int i=0;i<N;i++){
long long a; cin >> a;
sum += a;
if(mp.count(sum)){
res ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
map<int, ll> m;
rep(i, n) m[a[i]]++;
ll sum = 0;
for (auto e : m) sum += e.second * (e.second - 1) / 2;
rep... | 0 | 34,603,339 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll a;
vector<ll> b(100010);
for (int i=0;i<n;i++) {
cin >> a;
b[a]++;
}
ll k=0;
int r=0;
for (int i=0;i<100010;i++) {
if (b[i]>1) {
if (r==1) b[i]--;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll k;
cin >> k;
if(k == 0)
{
cout << 2 << endl;
cout << "1 1" << endl;
}
else if(k == 1)
{
cout << 2 << endl;
cout << "2 0" << endl;
}
else if(k <= 50)
{
cout ... | 0 | 91,566,945 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, m;
cin >> n >> m;
n -= (n % 2 == 0);
int start = 1;
int end = n / 2;
int cnt = 0;
while (1)
{
if (start >= end - start + 1 || cnt == m) break;
cout << start << " " << end - start + 1 << endl;
start++; cnt++;
}
start = n / 2 + 1;
end ... | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long LL;
int N;
int main(){
string str;
while(getline(cin,str),str!="."){
vector<string>s(1000);
int num=0;
bool check=true;
REP(i,str.size()){
... | 0 | 56,596,596 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
using namespace std;
void solve(){
string s; cin >> s;
sort(s.begin(), s.end());
if(s == "abc") cout << "Yes\n";
else cout << "No\n";
return;
}
int main(){
solve();
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int a[MAXN]={0};
map<int,int>mm;
int vis[MAXN]={0};
int solve(int n,int maxnum){
if(vis[n])
return 0;
for(int i=n;i<=maxnum;i+=n)
vis[i]=1;
if(mm[n]... | 0 | 92,070,291 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double dist = sqrt( (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) );
printf("%.10lf\n", dist);
return 0;
} | #include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
const int infty = static_cast <int> (pow(256, sizeof(int)) / 2 - 1);
class cDisjointSet
{
vector<int> vp;
vector<int> vrank;
public:
cDisjointSet(int n);
void makeSet(int x);
void uunionn(int x, int... | 0 | 56,909,239 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n,m;
cin >> n >> m;
vector<vector<int>> vec(m);
rep(i,m) {
int k;
cin >> k;
vec[i].resize(k);
rep(j,k) {
cin >> vec[i][j];
--vec[i]... | #include <iostream>
#include <string>
using namespace std;
int main(){
long long int n,m=1;
string s;
cin>>n>>s;
for(int i=0;i<4;i++){
if(i==0){
m=((int)(s[i])-'0')*100;
}
else if(i==1){
continue;
} else if(i==2){
m=m+(((int)(s[i])-'0'... | 0 | 99,315,907 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
ll gcd(ll a, ll b){
if (b == 0){
return a;
}
return gcd(b, a%b);
}
ll lcm(ll a, ll b){
ll c = gcd(a, b);
re... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ll long long
#define ld long double
#define pr pair<int,int>
#define prr pair<pr,int>
#define mp make_pair
#define pb push_back
#define eb emplac... | 0 | 90,730,347 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int, vector<int>> pq;
REP(i, N) {
int a;
cin >> a;
p... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 77,681,271 |
#include<iostream>
using namespace std;
long long int gcd(long long int a, long long int b);
int main() {
long long int n, x;
cin >> n;
cin >> x;
cout << 3 * n - 3 * gcd(n, x);
return 0;
}
long long int gcd(long long int a, long long int b) {
long long int aa, bb,cc;
if (a > b) {
aa = a;
bb = b;
}
else {
... | # include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
ll a,b;
cin >> a >> b;
if(a==1&&b==2){
cout << 3 << endl;
}else if(a==2&&b==1){
cout << 3 << endl;
}else if(a==1&&b==3){
cout << 2 << endl;
}else if(a==3&&b==1){
co... | 0 | 44,508,786 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
cout << "---... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b,c,ans,cou;
cin>>a>>b>>c;
cou=0;
vector<vector<char>> data(a, vector<char>(b));
for(int64_t i=0;i<a;i++){
for(int64_t j=0;j<b;j++){
cin>>data.at(i).at(j);
}
}
for(int64_t i=0;i<pow(2,a);i++){
for(int64_t j=0;j<pow(2,b);j++){
int64_t... | 0 | 74,034,078 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int a,b;
cin >> a;
cin >> b;
cout << "a";
cout << " ";
if (a<b){
cout << "<";
}
else if (a>b){
cout << ">";
}
else{
cout << "==";
}
cout << " ";
cout << "b";
cout <<... | #include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
size_t N;
scanf("%zu", &N);
for (size_t i=0; i<N; ++i) {
vector<int> a(3);
for (size_t i=0; i<3; ++i)
scanf("%d", &a[i]);
sort(a.begin(), a.end());
printf("%s\n", (a[0]*a[0]... | 0 | 97,039,146 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int ncopy = N;
int f = 0;
while (0 != ncopy) {
f += ncopy % 10;
ncopy /= 10;
}
if (0 == N%f) {
cout << "Yes"<<endl;
}
else{
cout << "No" << endl;
}
return 0;
} | #include"bits/stdc++.h"
#define rep(i, N) for(int i = 0;i < N;i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
int main(void) {
int K, S; cin >> K >> S;
ll ans = 0;
rep(x, K+1)rep(y, K+1) {
int z = S - x - y;
if (0 <= z && z <= K)ans++;
}
cout << ans << endl;
return 0;
} | 0 | 26,061,632 |
#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++)
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using ll = long long;
int main() {
int x , y;
cin >> x >> y;
bool ans = tr... | #include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
#include <queue>
#define _USE_MATH_DEFINES
#include <math.h... | 0 | 32,911,845 |
#include<iostream>
#include<string>
using namespace std;
int main(void){
int m, n, h;
string s;
cin>>s;
while(s!="-"){
n=s.length();
cin>>m;
while(m--){
cin>>h;
s=s.substr(h, n-h)+s.substr(0, h);
}
cout<<s<<"\n";
cin>>s;
}
return(0);
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | 0 | 58,160,579 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).en... | #include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int n;
while(cin >> n, n){
vector<string> f(n);
for(int i = 0; i < n; i++){
cin >> f[i];
}
int cnt = 0;
bool l = false, r = false;
int pos = -1... | 0 | 86,267,861 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)n; ++i)
char an[500][501];
inline char id(int x){
if (x == 0)return 'R';
if (x == 1)return 'G';
if (x == 2)return 'B';
return 'Y';
}
int main(){
int n, m, d;
scanf("%d%d%d", &n, &m, &d);
int c = 0;
f(z,... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> p(n),a(20000),b(20000),ab(20000);
for(int i = 0;i<20000;i++)
{
a[i] = 30000*i+1;
ab[i] = 600000000;
b[i] = ab[i] - a[i];
}
for(int i =0;i<n;i++)cin >> p[i];
for(int i = 0;i<n;i++)
{
a[p[i]-1]+=i... | 0 | 76,291,788 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
int N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
vector<ll> diff;
ll a... | 0 | 39,264,515 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i = 0; i < (int)n; ++i)
int main()
{
string s;
cin >> s;
map<char, int> mp;
forn(i, s.size()) ++mp[s[i]];
bool flag = false;
for(auto item : mp) {
if(item.second == 2) {
flag = true;
continue;
}
else {
fl... | #include <iostream>
#include <vector>
#include <cctype>
#include <string>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
int main() {
string s;
getline(cin, s);
char t;
for (size_t i = 0; i < s.size(); i++)
{
if (islower(s[i])) t = toupper(s[i]);
else if (isupper(s[i]... | 0 | 56,360,209 |
#include<stdio.h>
#include<string.h>
#include<cmath>
#include<iostream>
#include<iomanip>
using namespace std;
typedef long long LL;
typedef double db;
double pp[2500001];
int main()
{
int n, m;
cin >> n;
cin >> m;
cout << n * n - m << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
int main()
{
int n; cin >> n;
map<int,int> mp;
for(int i = 2; i <= n; i++)... | 0 | 34,420,424 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
int main(){
set<char> st;
char a,b,c,d;
for (int i = 0;i < 4;i++){
char tmp;
cin >> tmp;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, l, r) for (int i = l; i <= (int)(r); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define MOD (... | 0 | 45,547,100 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
using namespace std;
using ll = long long;
using ld = long double;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);... | #include<bits/stdc++.h>
int main()
{
std::string deq;
std::cin >> deq;
bool res = true;
int cnt = 0;
auto l_itr = deq.begin(), r_itr = (deq.end() - 1);
while(l_itr - deq.begin() < r_itr - deq.begin()){
if(*l_itr == *r_itr){
l_itr++;
r_itr--;
}else if(*l_it... | 0 | 32,847,103 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n-1); i >= 0; --i)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(AL... | 0 | 37,016,101 |
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
int main(){
int k;
cin >> k;
vector<int> v(33);
v[1]=1;
v[2]=1;
v[3]=1;
v[4]=2;
v[5]=1;
v[6]=2;
v[7]=1;
v[8]=5;
v[9]=2;
v[10]=2;
v[11]=1;
v[12]=5;
... | #include <stdio.h>
int main(void) {
int n,m;
char trans[100][2];
char c;
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
scanf(" %c %c", &trans[i][0], &trans[i][1]);
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
scanf(" %c", &c);
for (int j = 0; j < n; j++) {
if (trans[j][0] == c)... | 0 | 65,095,272 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define ... | #include<stdio.h>
#include<stdlib.h>
int main()
{
int a,b,c,d,t;
scanf("%d%d%d%d",&a,&b,&c,&d);
if(abs(c-a)<=d)
{
t=1;
}
else if(abs(a-b)<=d)
{
if(abs(b-c)<=d)
t=1;
else t=0;
}
else t=0;
if(t==1)
printf("Yes");
else printf("No")... | 0 | 33,231,041 |
#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 a[100010];
int main() ... | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | 0 | 98,706,290 |
#include <bits/stdc++.h>
using namespace std;
int main() {
const int limit = 1e6 + 5;
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> v(limit), primes;
fill(v.begin(), v.end(), 1);
for (int i = 2; i <= limit; i++) {
if (!v[i... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 | 28,247,908 |
#include <bits/stdc++.h>
using namespace std;
void input(int& rnMaxNum, int& rnWinPnt)
{
cin >> rnMaxNum >> rnWinPnt;
}
double calcWinRate(int nMaxNum, int nWinPnt)
{
double nWinRate = 0;
for (int n = 1; n <= nMaxNum; n++)
{
double nOneRate = 1.0 / nMaxNum;
int nCur = n;
while (nCur < nWinPnt)
{... | #include<bits/stdc++.h>
using namespace std;
#define long long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define X first
#define Y second
#define sz size
#define ft(i , a , b) for (long i = (long)a ; i <= (long)b ; i++)
#define fd(i , a , b) for (long i = (long)a ; i >= (long)b ; i--)
#define... | 0 | 94,719,035 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <string>
using namespace std;
typedef long long ll;
int main(){
int N,K;
string S;
cin >> N >> S; cin >> K;
for(int i=1;i<=N;i++){
if(i==K) continue;
else{
if(S[i-1]!=S[K-1]) S[i-1]='*';
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
#define y1 def1
#define X first
#define Y second
#define endl '\n'
#define all(o) o.begin(), o.end()
#define IOS ios::sync_with_stdio(0), cin.tie(0)
map<in... | 0 | 31,529,190 |
#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;
using ull = unsigned long long;
int main()
{
ull N, T;
cin >> N >> T;
ull prev, ans, stop;
ans = 0;
cin >> prev;
stop = prev + T;
for (ull i = 0; i < N - 1; i++) {
ull now;
cin >> now;
if... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2000 + 5, mod = 1e9 + 7;
int fact[N], inv[N];
int add(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return (a + b) % mod;
}
ll mul(ll a, ll b){
return a * b % mod;
}
int fp(int b, int p){
if(!p) return 1;
... | 0 | 4,750,131 |
#include <iostream>
#include <queue>
using namespace std;
int main(){
bool adj[100][100]={};
int d[100]={};
int n,u,v,k;
cin >> n;
for (int i=0; i<n; i++){
cin >> u >> k;
for (int j=0; j<k; j++){
cin >> v;
adj[u-1][v-1] = true;
}
}
queue<int> q;
bool pushed[100]={};
q.push(1);
... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9+7;
main(){
int N;
cin >> N;
int sum = 0;
set<int> st;
for(int i = 1;sum < N;i++){
sum += i;
st.insert(i);
}
for(int i = 1;i*(i+1)/2 <= N;i++){
if(sum - i == N){
... | 0 | 53,917,987 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,s,e) for(int i=s;i<=e;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MAX (int)1e9 + 99
#define maxof(a,b,c) max(a,max(b,c))
#define min... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
long long int ans = 0;
long long int count = 0;
for(int i=0; i<n; i++){
if(a[i] != 0) count += a[i];
if(a[i] == 0 || i == ... | 0 | 4,224,917 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, p;
string s;
cin >> n >> p >> s;
ll ans=0;
if(p==2 || p==5) {
for(int i=0; i<n; ++i)
if((s[i]-'0')%p==0)
ans+=i+1;
} else {
map<int, int> mp;
++mp[0];
int ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int N, Q;
vector<vector<int>> G(N, vector<int>());
void dfs(int s, vector<int> &counter, vector<bool> &seen) ... | 0 | 43,706,672 |
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> pii;
int n, k;
const int N = 1e5 + 5;
ll f[N], res;
ll expo(ll a, ll b) {
if (b == 0) return 1;
if (a == 0) return 0;
ll temp = expo(a, b / 2);
temp = (temp * temp) % MOD;
... | 0 | 60,276,705 |
#include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int,int> pii;
typedef pair<i64,int> pli;
typedef pair<int,i64> pil;
typedef pair<i64,i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
template <t... | #ifdef _WIN32
#pragma warning(disable:4996)
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <unordered_map>
#include <iostream>
using namespace std;
FILE* _fin = stdin;
FILE* _fout = stdout;
#define PI 3.14159265358979323846264338327950288419716939937510... | 0 | 100,875,627 |
#include <iostream>
#include <vector>
#define eol '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> list(n+1,0);
list[0] = list[1] = 1;
for (int i = 2; i <= n; i++) {
list[i] = list[i-1] + list[i-2];
}
cout << list[n] << eol;
return... | #include <iostream>
#include <string>
using namespace std;
int main(){
int A[3][3];
int B;
bool mark[3][3]={0};
string ans="No";
int i,j,k;
for(i=0; i<3; i++){
for(j=0; j<3; j++){
cin >> A[i][j];
}
}
int N;
cin >> N;
for(k=0; k<N; k++){
cin >> ... | 0 | 59,033,062 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define mp(a,b) make_pair((a),(b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long lon... | #include "bits/stdc++.h"
#define int long long
#define range(i, a, b) for(auto i = a; i < b; i++)
#define rep(i, a) range(i, 0, a)
#define all(a) (a).begin(),(a).end()
using namespace std;
const int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
const int MOD = 1000000007;
using vi = vecto... | 0 | 91,353,815 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int d,t,n;
cin>>d>>t>>n;
if(t*n>=d)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | 0 | 35,606,257 |
#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>
#include<functional>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | 0 | 16,230,818 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
int main() {
string s, t; cin >> s >> t;
int n = s.size();
map<char, int> m1, m2;
for(int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long N, M;
cin >> N >> M;
int LM = 0, RM = N-1;
for(int i = 0; i < M; i++){
int L, R;
cin >> L >> R;
L--; R--;
if(LM < L){
LM = L;
}
... | 0 | 83,362,984 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include<bits/stdc++.h>
#define reg register
#define maxn 500001
using namespace std;
inline int read() {
reg int s = 0, t = 0; reg char ch = getchar();
while(ch > '9' || ch < '0') t |= ch == '-', ch = getchar();
while(ch >= '0' && ch <= '9') s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
return ... | 0 | 4,143,129 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
char a, b;
cin >> a >> b;
char ans = 'N';
if (a == 'H') {
ans = b;
}
else {
if (b == 'H') ans = 'D';
else ans = 'H';
}
cout << ans << endl;
} | 0 | 26,448,778 |
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | 0 | 118,383 |
#include <iostream>
using namespace std;
int main()
{
int x = -1;
int i = 1;
while (true) {
cin >> x;
if (x != 0) {
cout << "Case " << i << ": " << x << endl;
} else {
return 0;
}
i++;
}
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> p;
typedef unsigned long long i... | 0 | 6,835,238 |
#include<bits/stdc++.h>
#define Imposter ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n);i>0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pi 3.141... | 0 | 92,485,761 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define txt \
freopen("ip.txt", "r", stdin); \
freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... | 0 | 30,605,775 |
#include<iostream>
using namespace std;
int main() {
int a, b, c, d = 0; cin >> a >> b >> c;
for (int h = a; h <= b; h++) {
if (c%h == 0) {
d++;
}
}
cout << d << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 81,300,018 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
rep(i, n)cin >... | #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);
ll _gcd(ll x, ll y){
if(y == 0) return x;
return (x % y) ? _gcd(y, x % y) : y;
}
ll _lcm(ll x, ll y){
return x / _gcd(x, y) * y;
}
int main(){
ll n; cin >> n;
v... | 0 | 8,668,105 |
#include <iostream>
using namespace std;
int main(void) {
int64_t no = 999'999'999'999;
int64_t yes = 9'999'999'999'999;
while(no + 1L < yes) {
int64_t mid = (no + yes) / 2;
cout << "? " << mid << endl;
char res;
cin >> res;
if(res == 'Y') {
yes = mid;
... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
int L[100005];
int main() {
int n, a;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a);
L[a] = i;
}
for (int i = 1; i <= n; i++) {
if (i == n) {
printf("%d\n", L[i]);
}
else printf("%d ", L[i]);
}
return 0;
} | 0 | 76,735,632 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
string S; cin ... | #include<iostream>
using namespace std;
int main(){
int H,W;
while(1) {
cin >> H >> W;
if (H == 0 && W == 0) break ;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if ((i != 0) && (i != H -1) && (j != 0) && (j != W - 1)) {
cou... | 0 | 10,481,395 |
#include <iostream>
using namespace std;
int main()
{
int n, m, p, a, v, sum=0;
while (1)
{
cin>>n>>m>>p;
if (n==0 && m==0 && p==0) break;
for (int i=1; i<=n; i++)
{
cin>>a;
sum+=a;
if (i==m) v=a;
}
if (v==0) cout<<"0\n";
... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 43,951,092 |
#include "bits/stdc++.h"
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define en '\n'
#define pb push_back
#define P pair<int, int>
typedef long long ... | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define MP(x, y) make_pair(x, y)
#define PII pair<int, int>
#define SZ(x) int((x).size())
#define PB(x) push_back(x... | 0 | 91,077,155 |
#include<bits/stdc++.h>
using namespace std;
#define li long int
int main(){
string s;
cin>>s;
vector< li > v;
li i=0,k;
li l=s.length();
while(i<l){
k=0;
while (s[i]=='<' && i<l ){
++k;++i;
}
if(k>0)
v.push_back(k);
k=0;
while (s[i]=='>' && i<l){
++k;++i;
}
if(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | 0 | 7,292,519 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 5;
int a[N], val = 1;
vector <int> g[N];
int dfs(int v, int p = 0) {
int sum = 0, mx = 0;
for (int u : g[v]) if (u != p) {
int w = dfs(u, v);
mx = max(mx, w), sum += w;
}
int res = a[v] - sum;
if ... | #include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn=3E5+77;
typedef long long LL;
LL N,A,B,V[maxn];
int cv=0,idx[maxn],ans[maxn];
bool cmp(int a,int b){
return V[a]<V[b];
}
int main(){
cin>>N>>A>>B;
if(A+B>N+1 || A*B<N){
printf("-1\n");
... | 0 | 32,184,271 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, C, D;
cin >> A >> B >> C >> D;
A--;
int64_t a = A - (A / C + A / D - A / lcm(C, D));
int64_t b = B - (B / C + B / D - B / lcm(C, D));
cout << b - a << endl;
} | #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++)
constexpr ll mod = 1e9+7;
int main(){
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
ll t = 0;
rep(i, 0, N-1){
rep(j, i+1,... | 0 | 29,269,789 |
#include<stdio.h>
int main(void){
int H,W,i,I,j;
for(j=0;j<10000;j++){
scanf("%d %d",&H,&W);
if(H!=0){
for(i=0;i<H;i++){
if(i==0||i==H-1){
for(I=0;I<W;I++){
printf("#");
}
printf("\n");
}else{
for(I=0;I<W;I++){
if(I==0||I==W-1){
printf("#");
}else{
printf(".");
}
}
printf("\n");
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N; cin >> N;
vector<long long>C(N - 1), S(N - 1), F(N - 1);
for (long long i = 0; i < N - 1; i++) {
cin >> C.at(i) >> S.at(i) >> F.at(i);
}
vector<long long>ans(N, 0);
for (long long i = 0; i < N; i++) {
... | 0 | 76,842,004 |
#include<iostream>
using namespace std;
double f(double x){
return x*x;
}
int main(){
int sum = 0;
int d;
while(cin>>d){
sum = 0;
for(int i=1;d*i<600;i++){
sum += f(i*d)*d;
}
cout<<sum<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#defin... | 0 | 16,099,152 |
#include <bits/stdc++.h>
int main() {
int N, D;
std::cin >> N >> D;
std::vector<std::vector<int>> points(N, std::vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
std::cin >> points[i][j];
}
}
auto calc_dist = [&D] (const std::vector<int>& p... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool dp[10005][5005];
ll use[]={0,2,5,5,4,5,6,3,7,6};
int main(){
for(int i=0;i<10005;i++){
for(int j=0;j<5005;j++) dp[i][j]=false;
}
dp[0][0]=true;
ll n,m;
cin>>n>>m;
vector<ll> v;
for(int i=0;i<m;i++){
ll a;
cin>>a;
v.pus... | 0 | 66,723,495 |
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
int n;
cin >> n;
long *data = new long[n];
long min,max,sum=0;
for(int i=0; i<n; i++){
cin >> data[i];
if(i==0){
min=max=sum=data[0];
}else{
if(min>data[i]){
min=data[i];
}
if(max<data[i]){
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
#define AL... | 0 | 35,215,664 |
#include <iostream>
#include <numeric>
using namespace std;
int main () {
int n;
while (cin >> n, n) {
int d[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
d[i][j] = ((i == j) ? 0 : 0xffffff);
}
}
int v = 0;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 33,305,165 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(ll 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(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int d[k];
int sunuke[n];
for(int i=0; i<n; i++){
sunuke[i]=0;
}
for(int i=0; i<k; i++){
cin >> d[i];
int a;
for(int j=0; j<d[i]; j++){
cin >> a;
sunuke[a-1]++;... | 0 | 61,878,733 |
#include <bits/stdc++.h>
using namespace std;
string let = "RYGB";
int main() {
int h, w, d;
cin >> h >> w >> d;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
int x = ((i + j) % (2 * d) + (2 * d)) % (2 * d) / d;
int y = ((i - j) % (2 * d) + (2 * d)) % (2 * d) / d;
putchar(let[2... | #include <bits/stdc++.h>
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8 fixed<<setprecision(8)
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b)... | 0 | 33,668,532 |
#include<bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int a[106];
int main(){
ll k , x ;
cin >> k >> x ;
if(500*k >= x){
cout << "Yes" << endl;
}
else cout << "No" << endl... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e;
vector<int> dishes(5);
rep(i, 5) cin >> dishes[i];
int m = dishes[0] % 10;
int idx = 0;
for(int i = 1; i < 5; i++) {
if(dishes[i] % 10 < m &&... | 0 | 2,886,602 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
temp... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | 0 | 44,412,464 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include <fstream>
#include<string>
#include<sstream>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<iomanip>
#include <functional>
#include <m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=100005,INF=1<<28;
int main(){
std::ifstream in("text.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
while(1){
int N,L,R;cin>>N>>L>... | 0 | 78,857,540 |
#include<iostream>
using namespace std;
struct Card {
char suit, value;
};
void Bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i; j--) {
if (A[j].value < A[j - 1].value) {
Card t = A[j];
A[j] = A[j - 1];
A[j - 1] = t;
}
}
}
}
void Selection(Card A[], int... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int h[n];
rep(i,... | 0 | 16,520,377 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool a[10000][10000];
long long f[10000][10000];
long long sum = 0, sum3=10000000;
bool sum2 = false;
void solve(int i, int j,int mi,int mj,int h,int w) {
if (i == mi&&j == mj&&sum3>f[i][j]) {
sum3 = f[i][j];
sum2 = true;
return;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<char>> data(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> data.at(i).at(j);
}
}
vector<int> dx={-1,0,1,0};
vector<int> dy={0,1,0,-1};
bool jd = true;
for(int i=0;i<h;i... | 0 | 66,651,618 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl "\n"
int main()
{
faster;
ll n;
cin >> n;
vector<ll> a(n);
ll balance = 1000,stock = 0;
for(auto &x: a) cin >> x;
for(ll i = 0; i < n; i++){
if(i != n-1 && a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e4 + 5;
int n, x[N], y[N], d[1000];
bool flag = false;
int dis(int xa, int ya, int xb, int yb) {
return abs(xa - xb) + abs(ya - yb);
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i)... | 0 | 33,160,196 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
#include <iostream>
#include <vector>
using namespace std;
const int MAX_H = 11000;
int dp[MAX_H];
int main() {
int H,n... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i+... | 0 | 38,501,903 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<int> dp;
int rec(int n) {
int res = n;
if (n == 0) return 0;
if (dp[n] != -1) return dp[n];
for (int p = 1; p <= n; p *= 6) res = min(res, rec(n - p) + 1);
for (int p = 1; p <= n; p *= 9) res = min(res, rec(n - p) + 1);
... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn=1e5+10;
int n,l,t;
struct ant
{
int x,w,id;
} ants[maxn];
int x[maxn],w[maxn],id[maxn],ans[maxn];
bool cmpant(const ant& A,const ant& B)
{
if(A.x!=B.x) return A.... | 0 | 88,416,836 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << e... | #include <iostream>
using namespace std;
#define INIT 0
#define TRUE 1
int main() {
int x = INIT;
int y = INIT;
int tmp = INIT;
while (TRUE) {
cin >> x;
cin >> y;
if ((x == 0) && (y == 0)) {
break;
}
else {
if (x > y) {
... | 0 | 13,881,565 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 11,291,801 |
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long int
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define sz(z) (int)z.size()
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define rev(i,a,b) for(int i=a... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
using V=vector<int>;
using Vl=vector<ll>;
using VV=vector<vector<int>>;
usi... | 0 | 28,479,352 |
#include<iostream>
#include<vector>
using namespace std;
const int MAXN = 1e5;
const int INF = 1e9 - 7;
typedef long long ll;
ll dp[MAXN + 2][4];
int n;
vector<ll> a,b,c;
ll happy(ll N, ll K){
if(N == 0) return 0;
if(dp[N][K] != -1) return dp[N][K];
if(K == 3) return dp[N][K] = max(happy(N-1, 2) + b[N], happy(N-1, 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 0 | 21,078,564 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
string ans[2]={"Bob","Alice"};
int main()
{
ll n;
cin >> n ;
vector<vector<ll>> g(n);
rep(i, n-1)
{
ll a, b;
cin >> a >> b;
g[a - 1].push_back(b - 1);
g[b - 1].push_back(a - 1);
}
ll root=0;
v... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | 0 | 26,191,206 |
#include <iostream>
#include <sstream>
#include <string>
bool is_cross(double x1, double y1, double x2, double y2,
double x3, double y3, double x4, double y4)
{
if (((x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3)) *
((x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4)) > 0) {
return false;
} else {... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 0 | 34,097,060 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> t(n), a(n);
for (int i = 0; i < n; i++) {
cin >> t.at(i);
}
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
if (n == 1) {
if (t.at(0) != a.at(... | #include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
v... | 0 | 8,170,940 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include<bits/stdc++.h>
using namespace std;
#define itn int
int main(void){
int h,w,a,b;
cin >> h >> w >> a >> b;
int H[1001] = {},W[1001] = {};
for(int i = 0;i < h;i++){
for(int j = 0;j < w;j++){
if(H[i] < w-a){
if(W[j] < h-b){
cout << 0;
... | 0 | 30,183,582 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namesp... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define all(a) a.begin(),a.end()
void solve()
{
vector <int> v;
int n,i,x,sum=0,cn=0;
cin >> n;
for(i=0; i<2*n; i++)
{
cin >> x;
v.push_back(x);
}
sort(all(v));
for(i=0; i<2*n; i+=2)
... | 0 | 23,825,929 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
for (a=1; a<10; a++){
for (b=1; b<10; b++){
c=a*b;
cout << a <<"x"<< b <<"="<< c <<"\n";
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 0 | 25,299,451 |
#include<bits/stdc++.h>
const double pi=acos(-1.0);
using namespace std;
#define endl '\n'
#define sl(n) scanf("%lld",&n)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ll long long
#define ull unsigned ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
if(A>B && A !=1 && B!=1)
cout<<"Alice"<<endl;
else if(A<B && A !=1 && B!=1)
cout<<"Bob"<<endl;
else if(A==B)
cout<<"Draw"<<endl;
else if(A ==1 && B!=1)
cout<<"Alice"<<endl;
else if(A... | 0 | 95,615,266 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
string S, T;
cin >> S >> T;
vector<vector<int>> _s(30), _t(30);
REP(i, S.size()) {
_s[S[i] - 'a'].push_back(i);
_t[T[i] - 'a'].push_back(i);
}... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
typedef long long ll;
const ll mod = 1e9+7;
int main(){
int n, m; cin >> n >> m;
ll xsum = 0, ysum = 0;
... | 0 | 53,002,786 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string c, left, right;
int a,b;
while(cin >> c){
if(c == "-") break;
cin >> a;
for (int i = 0; i < a; ++i)
{
cin >> b;
c += c.substr(0, b);
c.erase... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
string ans = "";
for(int i = 0; i < s.size(); i++){... | 0 | 9,804,919 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) cout<<a[0];for... | 0 | 66,844,473 |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<int, ii> iii;
ll pwr(ll base, ll p, ll mod=MOD){
ll ans = 1;while(p){if(p&1)ans... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | 0 | 69,401,355 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.