code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
#define INF 0x3f
int main(){
string set = "aeiou";
string c ;
cin >> c;
for(int i = 0;i < set.size() ;i++){
if(c.at(0) == set.at(i)){
cout << "vowel" << endl;
return 0;
}
}
cout << "consonant" << endl;
... | #include <iostream>
int main() {
std::string c, res;
std::cin >> c;
if (c=="a" || c=="i" || c=="u" || c=="e" || c=="o" ) {
res = "vowel";
} else {
res = "consonant";
}
std::cout << res << std::endl;
} | 1 | 29,555,712 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
signed main(){
while(1){... | #include<cstdio>
using namespace std;
int n;
char f[10];
bool left, right, now;
int main() {
while (1) {
scanf("%d", &n);
if (n == 0) break;
int counter = 0;
left = right = now = false;
for (int i = 0; i < n; i++) {
scanf("%s", f);
if (f[0] == 'r') {
if (f[1] == 'u') {
... | 1 | 67,559,466 |
#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+1);
rep(i,n+1) cin >> a[i];
int l = a[n];
ll r[n];
r[n]=a[n];
for(int i=n-1; i>=0; i--) {
l = (l+1)/2;
l += a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define ALL(name) name.begin(),name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
# define DBG(fmt, ... | 1 | 14,685,597 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A;
cin>>N>>A;
if(N<500 && N<=A){
cout<<"Yes"<<endl;
}
else if(N<500 && N>A){
cout<<"No"<<endl;
}
else if(N>500 && N%500<=A){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a=500;
int N,A;
cin >>N >> A;
if(N>=0 && N<=10000){
int ichien;
ichien= N % a;
if(A>=ichien){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
else{
cout <<"Please 1<=N<=10000"<<endl;
}
} | 1 | 81,427,742 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) return a;
return gcd(b, a % b);
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> h(N);
for(int i = 0; i ... | #include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int h[N];
for(int i=0; i<N; i++) cin >> h[i];
int x, count, sum=0, zeros=0;
while(zeros<N){
count = 0;
x = 0;
zeros=0;
for(int i=0; i<N; i++){
if(x==0 && h[i]>0) count++;
x = h[i];
if(h[i]>0) h[i]--;
... | 1 | 59,228,725 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n;
vector<int> vec[100005];
int visited[100005];
int ans[100005][2];
void dfs(int u){
visited[u] = 1;
long long int pro1 = 1, pro2 = 1;
for(int v:vec[u]){
if(!visited[v]){
dfs(v);
long lon... | #include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define endl '\n'
#define pii pair<ll int, ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define repi(i, n) for(ll i=0; i<n; i++)
... | 1 | 65,906,524 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
for(int i=0; i<n; i++){
if(i==3){
cout << s[i] << " ";
continue;
}
cout << s[i];
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
void solve(std::string s){
s.insert(4, " ");
cout << s << endl;
}
int main(){
std::string s;
std::cin >> s;
solve(s);
return 0;
} | 1 | 68,844,134 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int main() {
int X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<ll> red(A), green(B), none(C);
rep(i, A) cin >> red[i]... | #include <bits/stdc++.h>
using namespace std;
#define clr(i, j) memset(i, j, sizeof(i))
#define pb push_back
#define PI acos(-1)
#define MOD ((int)1e9+7)
typedef long long ll;
const int N=2e5+100;
ll visited[100005];
#define lop(i,n) for(int i=0;i<n;++i)
int dx[4] = {1 , 0 , 0 , -1} ;
int dy[4] = {... | 1 | 33,297,522 |
#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() {
map<char,char>... | #include<bits/stdc++.h>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdlib.h>
#include<string>
#define mp make_pair
#define ss second
#define ff first
#define pb push_back
#define io ios_base::sync_with_stdio;cin.tie(0);cout.tie(0)
#define READ freopen("input... | 1 | 85,731,095 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<string>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
vector<... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 1 | 79,456,628 |
#include <iostream>
using namespace std;
string a[8]={"hao","hao","xue","xi","tian","tian","xiang","shang"};
int main() {
ios::sync_with_stdio(false);
for(int i=1;i<10;i++)
for(int j=1;j<10;j++)
cout<<i<<"x"<<j<<"="<<i*j<<endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a,b,c;
for(int i=1;i<10;i++){
for(int j=1;j<10;j++){
cout<<i<<"x"<<j<<"="<<i*j<<'\n';
}
}
return 0;
} | 1 | 96,630,705 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while(1) {
string s = to_string(n);
if (s[0]==s[1] && s[1]==s[2]) {
cout << n << endl;
return 0;
}
n++;
}
} | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N;
cin >> N;
int num = (N + 111 - 1) / 111;
cout << num * 111 << endl;
} | 1 | 61,876,159 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
priority_queue<int, vector<int>, greater<int>> train;
priority_queue<int, vector<int>, greater<int>> bus;
vector<int> tmp(4);
for (int i = 0; i < 4; i++)
cin >> tmp.at(i);
for (int i = 0; i < 4; i++)
{
if (i < 2)
train.p... | 1 | 69,639,038 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
bool pairCompare(const P& p1, const P& p2)
{
if(p1.second == p2.second) return p1.first < p2.first;
return p1.second < p2.second;
}
void step(vector<P>& d, vector< vec... | #include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> color(10005,0),indeg(10005,0);
vector<vector<int>> G(10005,vector<int>(0));
list<int> ans;
void bfs(int s){
queue<int> Q;
Q.push(s);
color[s]=1;
while(!Q.empty()){
int u=Q.front();
Q.pop();
ans.push_back(u);
... | 1 | 52,085,853 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
template<typename T>
long long modpow(const T n,const T p,const T mod);
template<typename T>
long long modinv(const T n,const T mod);
template<typename T>
bool chmax(T &a,const T &b);
template<typename T>
bool chmin(T &a,const T &b);
long long inf=10000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb ... | 1 | 9,533,173 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int ... | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
cout << (char)(++c);
} | 1 | 100,274,696 |
#include<stdio.h>
int main()
{
long long int h,n,i,j,sum=0;
scanf("%lld%lld",&h,&n);
int a[n+10];
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
sum+=a[i];
}
(sum-h)>=0?printf("Yes"):printf("No");
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
ll t ;
int n ;
cin>>t>>n ;
vector<int> v(n) ;
ll sum=0 ;
rep(i,n){
cin>>v[i] ;
sum+=v[i] ;
}
if(sum>=t)
{
cout<<"Yes" ;
}
else
cout<<"No" ;
}
i... | 1 | 81,934,847 |
#include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
void s... | #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... | 1 | 10,845,553 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for(int i=int(a);i<int(b);i++)
#define pb emplace_back
#define all(x) (x).begin(),(x).end()
ll mod=1e9+7;
ll mod2=998244353;
const int INF=1e9;
signed main() {
ll... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,... | 1 | 79,606,206 |
#include <iostream>
#include <stdio.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main()
{
int x,y,z;
scanf("%d",&x);
scanf("%d",&y);
if(x%y==0){
printf("-1");
}
else{
rep(i,y){
if((x*i)%y==0){
;
}else{
z=x*i;
break;
}
}
print... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define all(a) (a).begin(), (a).end()
temp... | 1 | 81,446,408 |
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
int solve(int a, int b)
{
if (... | #include <string>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
ll get_path_len(ll x, ll y){
if(x < y){swap(x, y);}
ll ret = (x / y) * 2 * y;
if(x%y == 0){
ret -= y;
}
else{
ret += get_path_len(y, x%y);
}
return ret;... | 1 | 23,737,504 |
#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>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n); +... | #include <iostream>
#include <cmath>
using namespace std;
typedef pair<double, double> P;
double helon(P p1, P p2, P p3)
{
double a = sqrt((p1.first - p2.first) * (p1.first - p2.first) + (p1.second - p2.second) * (p1.second - p2.second));
double b = sqrt((p2.first - p3.first) * (p2.first - p3.first) + (p2.second - p3... | 1 | 30,267,358 |
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A=0, T=0, R=0, N = 0, K = 1;
int X, Y;
cin >> X >> Y;
if(Y%2==1){
cout << "No" << endl;
return 0;
}
for(int i = 0; i <= X; i++){
if(i*2+(X-i)*4==Y){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | 1 | 48,269,458 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool ... | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
int main(void){
string a;
string b;
cin >> a >> b;
if(a.size() > b.size()){
cout << "GREATER" << endl;
}else if(a.size() < b.size()){
cout << "LESS" << endl;
}else{
for(int i = 0;i < a.size();i++){... | 1 | 78,928,389 |
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
signed main()
{
int K,N;
cin>>N>>K;
vector<int> memo[100000];
for(int i=0;i<N;i++)
{
int t,d;
cin>>t>>d;
t--;
memo[t].emplace_back(d);
}
vector<ll> q1,q2;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin>>N>>K;
vector<pair<int,int64_t>> p(N);
for(int i=0;i<N;i++){
int a;
int64_t b;
cin>>a>>b;
p[i]=make_pair(a,b);
}
sort(p.begin(),p.end());
reverse(p.begin(),p.end());
vector<int64_t> q;
vector<int64_t> r;
for(int ... | 1 | 45,267,836 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
if ((S[0] == S[1] && S[1] == S[2]) || (S[1] == S[2] && S[2] == S[3]))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]==s[1]&&s[1]==s[2]||s[1]==s[2]&&s[2]==s[3])cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 37,901,477 |
#include <stdio.h>
#include <iostream>
using namespace std;
int R;
int main (){
cin>>R;
if (R<1200){
cout<< "ABC";
}else if (R<2800){
cout<< "ARC";
}else{
cout<<"AGC";
}
} | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
i... | 1 | 49,524,268 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
int c,cd,x;
cin>>c>>cd>>x;
if(c>x){
cout<<"NO";
}
else if(c==x){
cout<<"YES";
}
else if(c<x){
if(c+cd>=x){
cout<<"YES";
}
else{cout<<"NO";}
}
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, x;
cin >> a >> b >> x;
int tmp = 0;
bool flag = false;
tmp += a;
if (tmp != x)
{
for (size_t i = 0; i <= b; i++)
{
tmp++;
if (tmp == x)
flag = true;
}
cout << (flag ? "YES" : "NO") << endl;
}
el... | 1 | 92,094,394 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<ll,ll> pll;
const ll mod = 1e9 + 7;
const ld PI = 3.1415926535897932384626;
const ld eps ... | #include<bits/stdc++.h>
#include <cstdio>
#include <algorithm>
#define maxn 200010
using namespace std;
int f[maxn],cnt[maxn];
int getf(int u){
return f[u]==u?u:f[u]=getf(f[u]);
}
void merge(int u,int v){
int f1,f2;
f1=getf(u),f2=getf(v);
if(f1!=f2)f[f2]=f1;
}
int main(){
int n,m,i,u,v,mx=0;
scanf("%d%d",&n,&m);
... | 1 | 29,811,179 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
int ab=0, bxa=0, bxx=0, xxa=0;
rep(i,n) {
string s;
cin >> s;
for(int j=0; j<s.size()-1; j++) {
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream... | 1 | 44,261,819 |
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii... | #include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<iomanip>
#include<math.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
#define INF 1000000000000000LL
int main(){
ll N; cin >> N;
ll a[N+1];
ll node = 0;
rep(i, N+1){
... | 1 | 91,553,192 |
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
struct UnionFind{
vector<int> par;
UnionFind(int N) : par(N){
r(i,N)par[i]=i;
}
int root(int x){
if(par[x]==x) return x;
return par[x]=root(par[x]);
}
void unite(int x,int y){
int rx=r... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | 1 | 91,209,789 |
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <vector>
#include <tuple>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <bitset>
#include <numeric>
#include <stack>
#include <cmath>
#include <queue>
#include <functional... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n = 0, a = 0, b = 0; cin >> n >> a >> b;
int x = abs (a-b);
if (x >= 1) x-=1;
else x = 0;
if (x%2 == 0) cout << "Borys" << endl;
else cout << "Alice" << endl;
return 0;
} | 1 | 99,235,413 |
#include<iostream>
using namespace std;
int main(){
bool ac[100001]={};
int pc[100001]={};
int n,m;
cin>>n>>m;
int a=0,pe=0;
while(m--){
int p;
char s[9];
cin>>p>>s;
if(s[0]=='A'){
a+=!ac[p];
ac[p]=true;
}else{
pc[p]+=!ac[p];
}
}
int p=0;
for(int i=1;i<=n;i++)... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N,M;
cin >> N>> M;
vector<bool>B(N + 1);
vector<int>C(N + 1);
int ans = 0;
int pena = 0;
for (int n = 0;n<M;++n) {
int p;
string s;
cin >> p >> s;
if ("AC" == s && false == B[p]) {
ans++;
pena+=C[p];
B[p] = true;
}
else if ("WA"... | 1 | 74,164,728 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vec... | 1 | 14,377,857 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include<bits/stdc++.h>
using namespace std;
namespace io{
const int l=1<<20;
char buf[l],*s,*t,c;
inline void gc(){
if(s==t){
t=(s=buf)+fread(buf,1,l,stdin);
c=s==t?EOF:*s++;
}else c=*s++;
}
template<class IT>inline void gi(IT &x){
x=0;gc();while(c<'0... | 1 | 66,099,414 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | #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 FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).... | 1 | 56,050,865 |
#include <iostream>
using namespace std;
int main (void){
string n;
cin >> n;
if (n[1] == n[2] && (n[0] == n[1] || n[2] == n[3])){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int N1 = (N/1)%10;
int N2 = (N/10)%10;
int N3 = (N/100)%10;
int N4 = (N/1000)%10;
if (N1 == N2 && N1 == N3) {
cout << "Yes" << endl;
}
else if (N2 == N3 && N2 == N4) {
cout << "Yes" << endl;
}
else {
cout << "N... | 1 | 49,034,422 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
int num;
cin >> num;
for(int r = 0; r < num; r++) {
int a, b, c;
cin >> a >> b >> c;
if(a > b){ a ^= b; b ^= a; a ^= b;}
if(a > c){ a ^= c; c ^= a; a ^= c;}
if(b > c){ b ^= c; c ^= b; b ^= c;}... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int num_problems;
cin >> num_problems;
int edges[3];
for (int i = 0; i < num_problems; ++i) {
cin >> edges[0] >> edges[1] >> edges[2];
sort(edges, edges + 3);
cout <<
(edges[0] * e... | 1 | 96,862,143 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;cin>>n>>k;
int cpy = n - 2;
cpy*=(cpy + 1);
cpy/=2;
if(k > cpy){
cout<<-1<<endl;
} else{
vector<int> edges[n+1];
int cnt = cpy;
int y = 0;
for(int... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
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;... | 1 | 72,199,521 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
vector<vector<int>> g;
int visit_cnt;
vector<int> parent;
void bfs(int s) {
queue<int> que;
set<int> visited;
que.push(s);
visited.insert(s);
visit_cnt = 1;
while (!que.empty()) {
int u = ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | 1 | 1,154,455 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 29;
int main() {
string s;
cin >> s;
int n = s.size();
int smallCnt = 0;
bool ok1 = s[0] =='A';
bool ok2 = false, ok3 = false;
rep(i, n) {
if (i >= ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int num=0;
if(S[0]=='A'){
num++;
}
int num_1=0;
int size=S.size();
for(int i=2;i<size-1;i++){
if(S[i]=='C'){
num_1++;
}
}
if(num_1==1){
num++;
}
int num_2=0;
for(int i=0;i<size;i++){
if(isuppe... | 1 | 51,067,461 |
#include <iostream>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if (a>=b) cout << "No";
else if (b>=c) cout << "No";
else if (a>=c) cout << "No";
else cout << "Yes";
cout << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a,d,c;
cin>>a>>d>>c;
if(a<d && d<c){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 55,890,574 |
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
const LL inf = 112345678901234567;
LL get_max(std::vector<LL>v)
{
LL res = 0;
rep(i, v.size()) res = std::max(res, v[i]);
return res;
}
LL get_min(std::vector<LL>v)
{
LL res = inf;
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
ll hi = 1e18, lo = -1;
while (lo + 1 < hi) {
ll mi = (lo + hi) / 2, s = 0;
rep(i, N) {
... | 1 | 94,546,790 |
#include <iostream>
#include <string.h>
using namespace std;
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getchar(char ch){
if(ch=='A')return 1;
else if (ch=='C')return 2;
else if (ch=='G')return 3;
else if (ch=='T')return 4;
else return 0;
}
long long getkey(char str[]){
lo... | #include <cstring>
#include <string>
#include <memory>
#include <iostream>
constexpr int max_size()
{
return 1000003;
}
constexpr int null_val()
{
return -1;
}
class dictionary {
public:
dictionary()
: _data()
{
for (int i = 0; i < max_size(); ++i) {
_data[i] = null_val();
... | 1 | 42,190,671 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using T = tuple<ll,ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll H,W,N;
cin >> W >> H >> N;
vector<ve... | #include <bits/stdc++.h>
using namespace std;
struct point {
int x;
int y;
int a;
};
int main() {
int W, H, N;
cin >> W >> H >> N;
vector<point> points(N);
for (int i = 0; i < N; i++) {
cin >> points[i].x >> points[i].y >> points[i].a;
}
vector<vector<bool>> field(W + 1, vect... | 1 | 98,773,342 |
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random... | #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 vld vector<ld>
#define vvi vector<vector<int>>
#define vvl ... | 1 | 60,300,307 |
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
typedef std::bitset<6> bit;
int main(){
int N,M,ans=0;
cin>>N>>M;
vector<int> H(N),Hmax(N);
for(int i=0;i<N;i++){
cin>>H.at(i);
Hmax.at(i)=0;
}
int a,b;
for(int i=0;i<M;i++){
cin>>a>>b;
Hmax.at(a-1)=max(Hmax.at(a-1),H.at(b-1)... | #include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> h(n, 0);
rep(i, n)cin >> h[i];
vector<queue<int>> dict(n);
vector<int> a(m, 0), b(m, 0);
re... | 1 | 19,665,065 |
#include<stdio.h>
int main (){
int A, B;
A=1;
A=2;
A=3;
B=1;
B=2;
B=3;
scanf ("%d",&A);
getchar ();
scanf ("%d",&B);
if (A==1 && B==2){
printf ("3\n");
}else if (A==2 && B==1){
printf ("3\n");
}else if (A==1 && B==3){
printf ("2\n");
}else if (A==3 && B==1){
printf ("2\n");
}else if (A==2... | #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... | 1 | 27,928,743 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
long long sum=0;
vector<long long>A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
A.at(i)=A.at(i)-(i+1);
}
sort(A.begin(),A.end());
long long b=0;
if(N%2==1){
if(N==1){
b=A.at(0);
}
else{
b=A.at(N/2);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 1 | 23,354,087 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
char alphabet[26] = { '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','z' };
int n_alphabet[26] = { 0 };
string s;
while (true) {
getline(cin, s);
if (s.empty())break;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
vector<int> occ(128, 0);
int ch = -1;
while ((ch = getchar()) != EOF) {
++occ[tolower(ch)];
}
for (int i = 'a'; i <= 'z'; ++i) {
fprintf(stdout, "%c : %d\n", i, occ[i]);
}
return 0;
} | 1 | 82,429,549 |
#include<bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 100005
#define LOG_MAX 20
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define chk(a) cerr << endl << #a << " : " << a << endl
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define ALL(name) name.begin(),name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
# define DBG(fmt, ... | 1 | 987,323 |
#include <cstdio>
int main() {
int n, m, d;
scanf("%d%d%d", &n, &m, &d);
if (d % 2 == 1) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
putchar("RG"[(i + j) & 1]);
}
puts("");
}
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w, d;
scanf("%d%d%d", &h, &w, &d);
for (int i = 0; i < h; i ++) {
for (int j = 0; j < w; j ++) {
int x = (i + j) / d % 2... | 1 | 85,459,489 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int N;
cin >> N;
vector< pair<int64_t,int> > p(N);
for(int i=0; i<N; i++) {
cin >> p[i].first;
p[i].second = i;
}
p.emplace_back(0, 0);
sort(p.rbegin(), p.rend());
vector<int6... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
using P = std::pair<ll, int>;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(2e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
v... | 1 | 30,033,856 |
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
vector<vector<int>> dista;
int recur(vector<int>& r, vector<bool>& flag, int d=0, int lastIndex=-1){
int minDista = INT_MAX;
bool endflag = true;
for(int i=0;i<flag.size();++i){
if(flag[i]){
flag[i]=false;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,P>
#define T tuple<int,int,int>
#define pr(x) cout << x << endl;
using namespace s... | 1 | 62,793,786 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
# define ll long long int
const int md = 1e9+7;
int main() {
ll d,t,s;
cin>>d>>t>>s;
double x = d*1.0/s;
t= t*1.0;
if(x<=t) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <iostream>
#include <bits/stdc++.h>
int main(){
using namespace std;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int mod = 1e9 + 7;
int cas = 1;
while(cas--){
int64_t d, t ,s;
cin >> d >> t >> s;
if(t*s >= d){
cout << "Yes\n";
}
else cout << "No\n";
}
return 0;
} | 1 | 14,112,118 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n;
cin>>n;
int64_t x=1;
bool a=false;
bool b=false;
vector<int64_t>vec(n);
for(int i=0;i<n;i++){
cin>>vec.at(i);
if(vec.at(i)==0){
a=true;
break;
}
}
for(int i=0;i<n;i++){
if(vec.at(i)<=1000000000000000000/x){... | 1 | 45,510,509 |
#include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define pf pus... | #include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int i=0,n,dp[45]={0};
cin>>n;
dp[0]=1;
dp[1]=1;
while(dp[n]<=0)
{
dp[i+2]=dp[i]+dp[i+1];
i++;
}
cout<<dp[n]<<endl;
return 0;
} | 1 | 69,557,984 |
#include <iostream>
#include <algorithm>
int main()
{
int a[5];
for (int i = 0; i < 5; ++i) std::cin >> a[i];
std::sort(a, a + 5, std::greater<int>());
std::cout << a[0];
for (int i = 1; i < 5; ++i) std::cout << " " << a[i];
std::cout << std::endl;
} | #include <iostream>
using namespace std;
int main(){
int num[5], i, j, a;
for(i = 0; i < 5; i++){
cin >> num[i];
}
for(j = 4; j >= 0; j--){
for(i = 0; i < j; i++){
if(num[i] < num[i+1]){
a = num[i];
num[i] = num[i+1];
num[i+1] = a;
}
}
}
for(i = 0; i < 4; i++){
cout << num[i] << ' ';
}
... | 1 | 9,861,427 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
#define INF 1e9
#define PI 3.141592653589793238
typedef long long ll;
int main() {
int a[3][3], n, b, flag=0;
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
cin>>a[i][j];
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define ALL(x) begin(x),end(x)
#define ll long long
#define ld long double
int main(){
vector<vector<ll>> a(3,vector<ll>(3));
rep(i,3)rep(j,3) cin >> a.at(i).at(j);
ll n; cin >> n;
vector<ll> b(n); rep(i,n) cin >>... | 1 | 74,774,846 |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | #include<bits/stdc++.h>
using namespace std;
static const int INF=1e9;
static const int MOD=1000000007;
typedef long long ll;
typedef pair<int,int> P;
int main(){
double n,m,d; cin >> n >> m >> d;
double ans;
if(d==0){
ans=(m-1)/n;
cout << setprecision(10) << ans << endl;
}else{
... | 1 | 51,671,845 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main()
{
ll n; cin >> n;
ll s = (int)sqrt(n);
ll t;
while(1){
if(!(n%s)) { t = n/s; break;}
s--;
}
ll ans = s + t - 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 1 | 62,129,021 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,m,a,b,c,d,sum=0,array[100000+10],r;
string str,ptr;
char ch;
cin>>r;
m=r*r;
cout<<m<<endl;
} | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
int a;
cin >> a;
cout << a*a;
cout << endl;
} | 1 | 57,531,990 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int arr[100];
int M = 1000000007;
int dp[101][100001] = {};
int pre[100001] = {};
int main(void)
{
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
}
for (int i = n - 1; i >= 0; i--)
{
for (int j =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
const int MAX_N = 1e5 + 5;
const int MAX_L = 20;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
t... | 1 | 33,305,082 |
#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++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
int main() {
int n,k,x,y,ans;
cin >> n >> k >> x >> y;
ans = min(k,n)*x+max(0,n-k)*y;
cout << ans << ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 1 | 67,233,521 |
#include <cstdio>
using namespace std;
int main(){
int num[4][3][10]{};
int n, b, f, r, v;
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d %d %d %d", &b, &f, &r, &v);
num[b - 1][f - 1][r - 1] += v;
}
for(int i = 0; i < 4; ++i){
for(int j = 0; j < 3; ++j){
... | #include <iostream>
using namespace std;
int main(void) {
int houseList[3][10][4] = {};
int a, b, f, r, v, i;
cin >> a;
for( i = 0; i < a; i++ ) {
cin >> b >> f >> r >> v;
houseList[f - 1][r - 1][b - 1] += v;
}
int s, t, u;
for(s = 0; s < 4; s++ ) {
for(t = 0; t < 3; ... | 1 | 52,936,955 |
#include<bits/stdc++.h>
using namespace std;
int main (void){
int n,d,ans = 0;
int R,G,B;
cin >> R >> G >> B >> n;
for(int i = 0;i <= n/R;i++){
for(int j = 0;j <= n/G;j++){
d = R*i + G*j;
if((n-d) % B == 0 && n >= d){
ans++;
}
}
}
cout << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout<< (x) << " "
int main(){
int r,g,b,n;cin>>r>>g>>b>>n;
int rmax=n/r,gmax=n/g;
ll ans = 0;
for(int i=0;i<... | 1 | 53,051,675 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#de... | 1 | 44,873,800 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(long long i=0;i<(long long)(n);i++)
#define N 200000
int main() {
lon... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define popb pop_back
#define del erase
#define sz size
#define ins insert
#define FOR(a,b,c) for(int a = b; a < c; a++)
#define FORS(a,b,c) for(int a = b; a <= c; a++)
#define FORN(a,b) for(int a = 0; a < b; a++)
#def... | 1 | 77,192,222 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long long ll;
typedef long double ld;
int main(){
int t=1;
while(t--){
string s;
cin>>s;
for(int i=0;i<s.length();i++){
if(s[i]==','){
cout<<" ";
}
else{
... | #include <iostream>
#include <string>
int main()
{
std::string haiku;
std::cin >> haiku;
haiku.replace(5, 1, " ");
haiku.replace(13, 1, " ");
std::cout << haiku;
return 0;
} | 1 | 66,815,433 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PL = pair<ll,ll>;
int n, a, b, c;
vector<int> l;
int nin = 1e6;
void dfs(int depth, int cost, int al, int bl, int cl) {
if(depth == n) {
if(al == 0 || bl == 0 || cl == 0)return ;
if(cl > bl)swap(bl, cl);
if(bl > al)... | 1 | 28,654,456 |
#include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
const int INF = 100100100;
int main() {
int N, M, a, b, c, d;
cin >> N >> M;
vector<pint> starts(N);
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;cin>>n>>m;pair<int,int> st[n],ch[m];
for(int i=0;i<n;i++){cin>>st[i].first>>st[i].second;}
for(int i=0;i<m;i++){cin>>ch[i].first>>ch[i].second;}
for(int i=0;i<n;i++)
{
long long pos,mn=1e12;
for(int j=0;j<m;j++)
... | 1 | 86,858,876 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int main... | 1 | 6,075,882 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 1 | 13,584,304 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = ve... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<cmath>
#include<deque>
#include<map>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define ... | 1 | 56,331,240 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | #include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<int,int>&a,const pair<int,int>&b)
{
return (a.second<b.seco... | 1 | 75,834,170 |
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
using namespace std ;
using bigint = long long int ;
using vi = vector<int> ;
using vll = vector<bigint> ;
vll v ;
void lunlunNumbergenerator( bigint N ){
if( N > ... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
void dfs(vector<llong> &A, vector<llong> &an... | 1 | 80,302,322 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using namespace std;
typedef long long ll;
using ld = long double;
typedef pair<int,int> P;
typedef vector<int> vi;
int main(){
ll n,m,d;
cin >> n >> m >> d;
if(n<=2*d){
cout << (ld)2*(n-d)*(m-... | 1 | 60,360,883 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>vec(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
}
if(N%2==1||N==0){
cout << 0 <<endl;
}
else{
sort(vec.begin(),vec.end());
if(vec.at(N/2-1)==vec.at(N/2)){
co... | #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>;
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 ... | 1 | 35,445,680 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 200100;
const ll MOD = 1e9 + 7;
int N;
int arr[MAXN];
ll fac[MAXN];
ll finv[MAXN];
ll cpow (ll b, int e)
{
if (e == 0) return 1;
ll v = cpow (b, e / 2);
v = (v * v) % MOD;
if (e % 2) v = (v * b) % MOD;
return v;
}
l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(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) ... | 1 | 37,055,825 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb... | #include <iostream>
#include <climits>
#include <vector>
#include <algorithm>
using namespace std;
#define check abs(vec[i] - vec[i + 1])
int main() {
int n, num_abs; vector<int> vec;
while (1) {
cin >> n; if (n == 0) break;
num_abs = INT_MAX; vec.resize(n);
for (int i = 0; i < n; i++) cin >> vec[i];
sort(vec... | 1 | 9,623,644 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t N, L;
cin >> N >> L;
vector<int64_t> a(N);
for (int64_t& A : a) {
cin >> A;
}
for (int64_t i = 0; i < N - 1; i++) {
if (a[i] + a[i + 1] < L) {
continue;
}
cout << "Possible" << endl;
... | 1 | 49,843,673 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1001001001
void solve(ll N, ll M, ll X, vector<ll> C, vector<vector<ll> > A){
int ans = INF;
for (int i = 0; i < (1<<N); i++)
{
int cost = 0;
vector<int> d(M, 0);
for(int j = 0; j < N; j++){
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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 ... | 1 | 67,295,262 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
using namespace std;
#define REP... | #include<bits/stdc++.h>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(void){
int h,w,k;
cin >> h >> w >> k;
char c[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> c[i][j];
}
}
int ans = 0;
int black_num = 0;
... | 1 | 83,809,931 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef lon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
int T[2100];
int V[2100];
#define TIME 200*100+100000
int A[2100][TIME];
int main(){
ll N;
cin >> N;
T[0] = 0;
REP(i,N){
ll t;
cin >> t;
T[... | 1 | 77,162,603 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.141592653589793238462... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
int N;
cin >> N;
int P[N];
REP(i,N) cin >> P[i];
int mi = N+1;
int ans = 0;
REP(i,N){
if(P[i] <= mi){
... | 1 | 24,584,517 |
#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, k;
cin >> n >> k;
vector<int> p(n), c(n);
rep(i, n) {
cin >> p.at(i);
p.at(i)--;
}
rep(i, n) cin >> c.at(i);
ll ans = -1e18 - 1;
rep(si... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 1 | 24,759,752 |
#include <cstdio>
int main() {
int a[120];
int n;
scanf("%d", &n);
for (int i=0; i<n; i++) {
scanf("%d", &a[i]);
}
int count = 0;
for (int i=0; i<n; i++) {
int minj = i;
for (int j=i; j<n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (a[i] != a[minj]) {
int tmp = a[... | #include <iostream>
#include <stdio.h>
#define MIN_N 1
#define MAX_N 100
#define MIN_A 0
#define MAX_A 100
using namespace std;
int selection_sort(int a[], int n) {
int minj, swapped = 0;
for(int i=0; i<n; i++) {
minj = i;
for(int j=i; j<n; j++) {
if (a[j] < a[minj]) {
... | 1 | 33,690,493 |
#include <iostream>
#include <vector>
#include <cmath>
typedef unsigned long long ll;
using namespace std;
int main(void) {
int N; cin >> N;
ll L[90];
L[0] = 2;
L[1] = 1;
for(int i = 2; i <= N; i++) L[i] = L[i-2] + L[i-1];
cout << L[N] << endl;
return 0;
} | #include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
ll n;
cin >> n;
ll l0 = 2;
ll l1 = 1;
ll ans;
if(n==1){
cout << 1 << endl;
return 0;
}
for(int i=2; i<=n; ++i){
an... | 1 | 35,183,011 |
#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 n;
cin>>n;
vector<int>a(n),b(n);
ll cnt1=0,cnt2=0,cnt3=0;
rep(i,n)cin>>a[i];
rep(i,n)cin>>b[i];
rep(i,n){
cnt1+=a[i];
cnt2+=b[i];
if(a[i]<b[i])... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
for(i = 0;i < n;++i){
cin >> a.at(i);
}
for(i = 0;i < n;++i){
... | 1 | 100,589,001 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int M = 0;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
M = max(M, abs(a[i]-a[j]));
}
}
... | 1 | 62,019,005 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Mod = 1000000007;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<pair<int,int>> P1(100001);
vector<pair<int,int>> P2(100001);
for (int i = 0; i < 100001; i++) {
P1[i].first = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n;
cin>>n;
vector<int> V(n);
rep(i,n) cin>>V[i];
map<int,int> cnt[2];
rep(i,n) cnt[i... | 1 | 74,633,590 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
vector<P> ans;
ll N;
cin >> N;
vector<ll> v(N);
for(int i=0;i<N;i++) cin >> v[i];
sort(v.begin(),v.end());
for(int i=1;i<N-1;i++){
if(v[i] > 0){
ans.push_back({v[0],v[i]... | 1 | 59,157,392 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) f... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#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,... | 1 | 93,450,150 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)(3e5 + 5);
const int MOD = (int)(1e9 + 7);
const int INF = (int)(1e9 + 11);
int main() {
ios_ba... | #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... | 1 | 100,116,399 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main () {
int n;
cin >> n;
vector<int> min_count(26, 100);
for(int i=0;i<n;++i){
string S;
cin >> S;
vector<int> count(26, 0);
for(auto c: S){
count[c - 'a'] ++;
}
for (int j=0;j<26;++j){
min_cou... | 1 | 36,440,430 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
string T = S.substr(2, S.size()-3);
int count = 0;
rep(i, T.size()) if( T[i] == 'C' ) count++;
int o = 0;
rep(i, S.size()) if( S[i] < 'a' || S[i] > 'z' ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int c=0;
int l=0;
for(int i=1;i<s.size();i++){
if(s.at(i)>='a')
l++;
if(i>1&&i<s.size()-1&&s.at(i)=='C')
c++;
}
cout<<(s.at(0)=='A'&&c==1&&l==s.size()-2?"AC":"WA")<<endl;
} | 1 | 40,437,771 |
#include <iostream>
#include <vector>
#include <cstring>
#include <utility>
#include <queue>
using namespace std;
int main()
{
int n, u, k, v, dis[110];
bool vis[110];
memset(dis, -1, sizeof(dis));
memset(vis, false, sizeof(vis));
vector<int> adj[110];
queue<pair<int, int>> que;
cin>>n;
... | #ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var) \
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#endif
using namespace std;
struct Solver {
explicit Solver(... | 1 | 4,525,330 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
const int MOD = 1e9 + 7;
signed main(){
int n; cin >> n;
string s; cin >> s;
int left = 0,ans = 1;
for(int i = 0; i < n*2; i++){
if(i%2 == 0 && s[i] == 'W' || i%2 == 1 && s[i] == 'B'){
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
string S;
cin >> S;
vector<int> T(2 * N);
for(int i = 0; i < 2 * N; i++){
T[i] = (S[i] == 'B' ? 1 : 0);
if(i %... | 1 | 38,803,417 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
#define MOD (ll)(1e9+7)
#define INF INT32_MAX
#define INFL INT64_MAX
using namespace std;
void solve() {
int n,l;
cin >> n >> l;
string s[n];
for(int i=0; i<n; i++) cin >> s[i];
sort(s,s+n);
for(int i=0; i<n; i++) cout << s[i];
cout << endl;
}
int ... | 1 | 38,320,556 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.