code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
using namespace std;
int main() {
int A, B, C, D, E, F;
cin >> A >> B >> C >> D >> E >> F;
int sum = 0;
if (A <= B && A <= C && A <= D) sum += B + C + D;
else if (B <= A && B <= C && B <= D) sum += A + C + D;
else if (C <= A && C <= B && C <= D) sum += A + B + D;
else sum += A + B... | //
// main.cpp
// testing
//
// Created by 伊藤大騎 on 2019/01/07.
// Copyright © 2019 HamamatsuJOHOKU. All rights reserved.
//
/*
科目選択 (Selecting Subjects)
JOI 君は物理，化学，生物，地学，歴史，地理の 6 科目のテストを受けた． それぞれのテストは 100 点満点で採点された．
JOI 君は物理，化学，生物，地学の 4 科目から 3 科目を選択し，歴史，地理の 2 科目から 1 科目を選択する．
テストの合計点が最も高くなるように科目を選ぶとき， JOI 君の選... | 1 |
// J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n, k;
cin >> n >> k;
vecto... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int K, X; cin >> K >> X;
int now = X-K+1;
while(now <= X+K-1){
cout << now << endl;
now++;
}
return 0;
} | 0 |
#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;
ll solve() {
ll N;
cin >> N;
vector<double> X(N), Y(N);
for ( int i = 0; i < N; i++ ) {
cin >> X[i] >> Y[i];
}
vector<int> c(N);
int M = 3e5;
double pi = acos(0) * 2;
for ( int k = 0; k < M; k++ ) {
... | 1 |
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, ll B, ll C, ll D) {
cout << min(A,B) + min(C,D) << endl;
}
int main() {
ll A;
cin... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#in... | 0 |
#include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
in... | 0 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int dp[1001][1001]={};
for(int i=0;i<=a.length();i++)dp[i][0]=i;
for(int j=0;j<=b.length();j++)dp[0][j]=j;
for(int i=0;i<a.length();i++)
{
for(int j=0;j<b.length();j++)
{
dp[i+1][j+1]=min(dp[i... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
int n;cin>>n;
int ans =0;
int i = 0;
while(i*i... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,x;
cin>>a>>b;
c=max(a+b,a-b);
x=max(c,a*b);
cout<<x<<endl;
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#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 fore(i, a) for (auto &i:a)
#define ll long long
#define pll vector<pair<ll, ll>>
#define mod 1000000007
#defin... | 0 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[M... | #include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
ll N;
cin >> N;
ll... | 1 |
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include<chrono>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define all(t) t.begin(), t.end()
#define inrange(i, a, b) (((i)>= min((a), (b))) && ((i) <= max((a), (b))))
typedef vector<ll> vi;
#define fi first
#define se second
#define show(x) cout << #x << " is " << x ... | 1 |
#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 2020;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % mod;
return ans;
}
... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctim... | 1 |
#include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 998244353;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | 1 |
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
int N;
cin >> N;
N *= 2;
int L[N];
for (int i = 0; i < N; i++) cin >> L[i];
int count = 0;
priority_queue<int> Que;
for (int i = 0; i < N; i++){
Que.push(L[i]);
}
while(!Que.empty()){
Que.po... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
vector<int> l(2*n);
int sum =0;
rep(i,2*n){
cin >> l[i];
}
rep(i,2*n){
rep(j,2*n-i-1){
int temp;
if(l[j]>l[j+1]){
temp =l[j];
l[j] = l[j+1];
l[j+1]... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define MAX 100001
#define MOD 1000000007
#define ll long long
#define ld long double
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
int main() {
fast;
ll n;
cin >> n;
vector<ll> v(n);
ll sum = 0;
for(ll i=0;i<n;i++) {
cin >> v[i];
... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// 1個置くと3増えて全体でN*Q
// クオリティQは3の倍数になる必要がある(N != 0 mod 3)
using block = vector<string>;
// Quality 1
block b3 = {
"a..",
"a..",
".aa"
};
// Quality 3
block b4 = {
"aacd",
"bbcd",
"cdaa",
"cdbb"
};... | #include <cstdio>
const char pat3[3][4]={"a..",
"a..",
".aa"};
const char pat4[4][5]={"aacd",
"bbcd",
"cdaa",
"cdbb"};
const char pat5[5][6]={"..def",
"..def",
"aaggh",
"bbj.h",
"ccjii"};
const char pat6[6][7]={"aacd..",
"bbcd.."... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string a;
cin >> a;
reverse(a.begin(),a.end());
cout << a << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
bool ok = false;
rep(i, s.size() - 1) {
if(s[i] == 'A' && s[i + 1] == 'C') ok = true;
... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,j,n) for(int i = j; i < n; i++)
int main(){
while(1){
vector< vector<int> > map (21, vector<int>(21,0));
vector< vector<int> > map2 (21, vector<int>(21,... | #include <stdio.h>
typedef struct _Gem{
int x;
int y;
bool hit;
} Gem;
static void
pick_gem(Gem* g, int n, int x, int y)
{
for (int i = 0; i < n; i++) {
if (!g[i].hit && g[i].x == x && g[i].y == y) {
g[i].hit = true;
return;
}
}
}
static bool
check_gem(Gem* g, int n)
{
for (int i = 0; i < n; i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
map<long long int,long long int>m;
map<long long int,long long int>::iterator it,it1;
main()
{
long long int n,i,j,k,cnt=0,ans=1;
cin>>n;
int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(i=n-1;i>0;i--)
{
if(a[i]... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 1 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<cmath>
#include<stack>
#include<algorithm>
#define rg register
#define ll long long
#define LDB long double
#define ull unsigned long long
#define view(i,x) for(rg int i=hd[x];i!=-1;i=e[i].nt)
#define go(i,x,a) for(rg int i=a;i<x;i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
int n, m, a[333];
int main(void) {
scanf("%d%d", &n, &m);
if(m == 1) {
if(n == 1) {
printf("1\n1\n1\n");
} else {
printf("%d\n2\n1 %d\n", n, n - 1);
}
return 0;
}
int cnt = 0;
for(int i = 1; i <= m; i++) {
scanf("%d", &a[i]);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> v1;
typedef vector<v1> v2;
typedef vector<v2> v3;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
const ll INF = 1ll << 50;
const ll mod = 1000000007;
ll n;
int main(){
cin >> n;
cout << n... | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll n;
cin >> n;... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));
int memo = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> s.at(i).at(j);
if (s.at(i).at(j) == '.') {
memo++;
}
}
}
vect... | #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=1001001001;
int dy[4]={-1,0,1,0};
int dx[4]={0,-1,0,1};
int main(){
int h,w;
cin>>h>>w;
int ans=0;
vector<string>s(h);
rep(i,h)cin>>s[i];
rep(i,... | 1 |
#include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
//#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define re... | #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<vector<char>>;
using vbo=ve... | 0 |
#include <bits/stdc++.h>
using namespace std;
class tsort {
public:
int V;
vector<vector<int>> G;
vector<int> deg, res;
tsort(int node_size) : V(node_size), G(V), deg(V, 0) {}
void add(int from, int to) {
G.at(from).push_back(to);
deg.at(to)++;
}
bool solve() {
queue<int> que;
for(int i =... | //ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF=1e+9;
const int MOD=1e+9+7;
//REPマクロ
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
// ... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(i=(j);(i)<(k);++i)
#define... | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
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 PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >... | 0 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n;
string s, t;
int main(void){
cin >> n >> s >> t;
lli ans = 2*n;
rep(i, n){
if(s.substr(i, n-i) == t.substr(0, n-i)){
ans = min(ans, n+i);
}
}
cout << ans << endl;
return 0;
}
| #include<iostream>
using namespace std;
int main() {
int D, T, S;
cin >> D >> T >> S;
int A = S * T;
if (A >= D) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
int main() {
intt N; std::cin >> N;
std::map<std::string, int> MAP;
std::vector<std::string> s(N);
for (auto& r : s) {
std::cin >> r;
++MA... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
ll n;
cin >> n;
string s;
map<string, int> mps;
for(in... | 1 |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
//#include <bits/stdc++.h>
template<typename T> bool chmax(T &a,T b){
if(a<b){
a=b;
return true;
}
return false;
}
template<ty... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define abdelrahman010 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
int n , m , a , b , pref1 , pref2;
int main() {
abdelrahman010
cin >> n >> m;
for(int i ... | 1 |
////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - imnasim3.1415@gmail.com
#include<bits/stdc++.h>
using namespace std;
#define... | #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sst... | 0 |
#include <iostream>
using namespace std;
int main(){
int t;
while(cin>>t && t > 0){
int p1 = 0, p2 = 0;
while(t > 0){
int a = 0, b = 0;
cin >> a >> b;
if(a < 0 || a > 9 || a < 0 || a > 9){
continue;
}
if(a > b){
p1 += a + b;
}
else if(a < b){
... | #include<cstdio>
#include<queue>
using namespace std;
int main()
{
int ap, bp, turnnum, acard, bcard;
ap = bp = 0;
queue<int>adeck, bdeck;
while (1)
{
scanf("%d", &turnnum);
if (turnnum == 0)break;
for (int i = 0; i < turnnum; i++)
{
scanf("%d %d", &acard, &bcard);
adeck.push(acard);
bdeck.push... | 1 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull... | #include <bits/stdc++.h>
using namespace std;
int solve () {
int n;
cin >> n;
vector<long long> a(n);
for (auto &e : a) cin >> e;
string s;
cin >> s;
vector<long long> b;
for (int i = n; i--> 0;) {
long long e = a[i];
for (const auto &c : b) e = min(e, e^c);
if (e > 0) {
if (s[i] == '1') return 1;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define double long double
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x, c) for (auto&& x : (c))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) (... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for (int i=0; i < int(n); i++)
// 素集合データ構造
struct UnionFind
{
// par[i]：データiが属する木の親の番号。i == par[i]のとき、データiは木の根ノードである
vector<int> par;
// sizes[i]：根ノードiの木に含まれるデータの数。iが根ノードでない場合は無意味な値となる
vector<int> sizes;
UnionF... | 0 |
#include<iostream>
using namespace std;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
cout << ((A<B ? A : B) + (C<D ? C : D)) << endl;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a[5],b[5];
int ans=0;
cin>>a[0]>>a[1]>>b[0]>>b[1];
sort(a,a+2);
sort(b,b+2);
ans=a[0]+b[0];
cout<<ans<<"\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int X, Y;
cin >> X >> Y;
int... | #include <iostream>
using namespace std;
int main()
{
string S,T;
cin>>S>>T;
string r=T+S;
cout<<r;
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=1005;
int h,w,A,B;
int a[N][N];
int main()
{
scanf("%d%d%d%d",&h,&w,&A,&B);
for(int i=1;i<=B;i++)
for(int j=1;j<=A;j++)
a[i][j]=1;
for(int i=B+1;i<=h;i++)
for(int j=A+1;j<=w;j++)
a[i][j]=1;
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
const int Inf = 10000 * 100000 + 100;
int main(){
int V,E,R;
cin >> V >> E >> R;
vector<int> s(E),t(E),d(E);
vector<vector<int> > edge(V);
for(int i = 0; i < E; i++){
cin >> s[i] >> t[i] ... | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
double dp[301][301][301];
double sushi(int n, int x, int y, int z){
if(x==0 && y==0 && z==0){
return 0;
}
if(x<0 || y<0 || z<0){
return 0;
}
if(dp[x][y][z] > -0.9){
return dp[x][y][z];
}
double res = n + x*sushi(n, x-1, y, z) + y*sushi... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
#define UB upper_bound
#define LB lower_... | 1 |
# include <iostream>
using namespace std;
int N;
int K;
int A[100005];
int maximum=0;
int factor;
int gcd (int a, int b)
{
if (b==0)
{
return a;
}
else
{
return gcd(b, a%b);
}
}
int main()
{
cin>>N;
cin>>K;
for (int i=1; i<=N; i++)
{
cin>>A[i];
... | #include <iostream>
#include <map>
#include <cmath>
using namespace std;
#define L 998244353
int main(int argc, char* argv[]) {
long long N;
cin >> N;
long long d[N];
for (int i = 0; i < N; ++i)
cin >> d[i];
if (d[0] != 0) {
cout << "0" << endl;
return 0;
}
map<long long, long long> m;
... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
int main... | // #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
using namespace std;
typedef ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vv... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 0 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 100
void searchIndex(int mat[][N], int n, int obj, int *row, int *col);
void changeGroup(int group[], int n, int g_old, int g_new);
int main(void)
{
int n;
cin >> n;
int group[N];
for (int i = 0; i < n; i++) group[i] = i;... | #include <iostream>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long signed int ll;
constexpr ll NIL = -20000000000;
int n,z[100][100];
set <int> t;
int main() {
cin >> n;
for(int i = 0;i < n;i++) {
for... | 1 |
#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(){
string s;
cin >> s;
if(s == "SUN") cout << 7 << endl;
if(s == "MON") cout << 6 << endl;
if(s == "TUE") cout << 5 << endl;
if(s == "WED") cout << 4 << endl;
if(s... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int R;
cin >> R;
double c = 2*R*3.14159;
cout << c;
}
| 0 |
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define sz(x) ((int)... |
#include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
using T = typename InputIterator::value_type;
T *p = new T();
const auto sum = std::accumulate(first, last, *p);
delet... | 1 |
// Author : Mohamed Sameh
#include <bits/stdc++.h>
typedef long long ll ;
#define pb push_back
#define f first
#define s second
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SZ(a) (int)a.size()
#define Flush fflush(stdout);
using namespace std ;
const int N = 16;
const ll MN = -1e9*N;
int... | #include<iostream>
#include<vector>
#include<cmath>
#include<cassert>
#include<bitset>
using namespace::std;
#define int long long int
int dp[1<<16],ar[20][20];
main(){
ios_base::sync_with_stdio(0);
int n;
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>ar[i][j];
for(int j=1;j<(1<<n);j++){
int t=j;... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
// 型シノニム
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
// 定数
constexpr ll INF = 1e16;
constexpr ll INM = 114514;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-12;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll ... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int po[63];
int f(int x)
{
for(int i=62;i>=0;i--)
{
if(po[i] & x)
{
return i;
}
}
return -1;
}
vector <int> basis(vector <int> v)
{
if(v.size()==1) return v;
sort(v.begin(),v.end());
reve... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
bool check(int a,int b,int c)
{
if((a+b)>c && (c+b)>a && (a+c)>b)
return true;
return false;
}
int main()
{
// freopen("input01.txt", "r", stdin);
// freopen("output01.txt", "w", stdout);
int n;
... | 1 |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
ll counterb=0,counterw=0;
void dfs(ll x,ll y,ll H, ll W,vector<vector<bool>> &field,vector<vector<bool>> &check){
check[x][y]=1;
if(field[x][y]==1){counterb++;}
if(field[x][y]=... | #include <bits/stdc++.h>
using namespace std;
int dy[4] = {-1,0,1,0};
int dx[4] = {0,1,0,-1};
char board[401][401];
int h,w;
int visited[401][401];
long long int arr[160005][2];
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin... | 1 |
#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;
ll mod=998244353;
const int SIZE=2010000;
ll fac[SIZE], finv[SIZE], inv[SIZE], sum[260000];
void COMinit(ll m){
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2; i<SIZE; ++i){
fac[i]=(fac[i-1]*i)%m;
... | #include <cstdio>
#include <algorithm>
#define mod 998244353
#define maxn 200010
#define LL long long
using namespace std;
LL fact[maxn],inv[maxn],ans,t[maxn],p;
int n,m,k,nm;
LL quick_pow(LL a,LL b){//a^b
LL ans=1;
while(b){
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans%mod;
}
void init(){
int i;
sc... | 0 |
#include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
int n,m;
int map[501][501];
main(){
fill((int*)map, (int*)(map+sizeof(map)/sizeof(*map)), 0);
scanf("%d%d", &n, &m);
if(n==0 && m == 0) return 0;
int a,b;
while(m--){
scanf("%d%d", &a, &b);
map[a][b] = 1;
map[b][a] = ... | #include<iostream>
#include<queue>
using namespace std;
#define MAX 500
#define rep(i, n) for ( int i = 0; i < n; i++)
bool G[MAX][MAX];
int n, m;
int bfs(){
queue<int> q;
int d[MAX];
rep(i, n) d[i] = (1<<21);
q.push(0);
d[0] = 0;
int u;
while(!q.empty()){
u = q.front(); q.pop();
rep(v, n){
... | 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_s... | //Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#defin... | 0 |
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
struct side{
int n;
int m;
int l;
};
side sides[100000];
void mergesort(int l,int r){
if(l==r)return;
side temp;
if(l==r-1){
if(sides[l].l>sides[r].l){
temp=sides[l];
sides[l]=sides[r];
... | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
... | 1 |
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;
int getint()
{
char ch=getchar();
int f=1,x=0;
while(!isdigit(ch)){if(ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)){x=x*10+ch-'0'; ch=getchar();}
return f*x;
}
const int N=16;
int n,m;
int map[N][... | #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 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include<bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
#include<chrono>
using namespace std;
using namespace std::chrono;
// using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi firs... | 1 |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100005;
struct sj{
int a,l,r;ll x;
inline sj(){}
inline sj(int a,int l,int r,ll x):a(a),l(l),r(r),x(x){}
inline bool operator<(const sj &t)const{return x>t.x;}
}d[N];
inline void cmax(ll &a,ll b){if(a<b)a=b;}
inline ll Y(int i,ll k){
ll... | 1 |
#include <iostream>
#include <stack>
using namespace std;
long long N;
void input()
{
cin >> N;
}
void solve()
{
long long num = 0;
long long t26[13]; long long n26 = 1;
for (int i = 0; i < 13; ++i) { t26[i] = n26; n26 *= 26; }
long long tborder[13]; tborder[0] = 0;
for (int i = 1; i < 13; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
long long N,a;
int Z=26; //26^nで次のアルファベットの桁に移る
string ans ="";
cin >> N ;
while(N>0){
N--;
a=N%Z;
N/=Z;
ans+='a'+a; //aから割ったあまりの分文字コードを移動する
}
reverse(ans.be... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
int ans = 0;
for(int i=l; i<l+n; ++i){
if(l+n-1 < 0 && i == l+n-1) continue;
if(l > 0 && i == l) continue;
ans += i;
}
cout << ans << endl;
} | // Author : Harshdeep Sharma , IIT Indore
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
// #define MOD 998244353
#define ll long long
const double PI = atan(1.0) * 4;
// const ll INF = (int)1e9 ;
const int di[4] = { -1, 0, 1, 0} ;
const int dj[4] = {0, -1, 0, 1} ;
const ll INF = (ll)2e18 + 5... | 1 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N >> M;
vector<v... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cctype>
#include<string.h>
#include <stdlib.h>
#define PI 3.1415926
void swap(int* x, int* y) {
int a = *x;
int b = *y;
*x = b;
*y = a;
}
int factorial(int n);
int sum(int n, int*);
int ave(int n, int*);
int min(int n, int*), min(int n, int m);
int ma... | 0 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typed... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,a,i,k,x;
cin >> n;
k=0;x=n;
for(i=0;i<n;i++)
{
cin >> a;
if(a<=x)
{
k++;
x=a;
}
}
cout << k << endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N,K;
cin>>N>>K;
int ans=0;
if(N%K!=0){
ans=1;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K;
cin >> N >> K;
if(N < K){
cout << 1 << endl;
return 0;
}
if(N%K == 0){
cout << 0 << endl;
return 0;
}
cout << N%K+1 - N%K << endl;
}
| 1 |
// God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | #include<bits/stdc++.h>
typedef long long ll;
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#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... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define rep(i,a,b) for (rg int i=(a);i<=(b);i++)
#define per(i,a,b) for (rg int i=(b);i>=(a);i--)
#define pb push_back
#define lowbit(x) (x&(-x))
#define replow(i,a,b) for(rg int i = (a);i<=(b);i+=lowbit(i))
#define perlow(i,a,b) for(rg int i = (b);i>=(a)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
int x = tx-sx, y = ty-sy;
rep(i,x) cout << 'R';
rep(i,y) cout << 'U';
... | 0 |
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#define DEBUG 0
#if DEBUG
#define DLOG(...) fprintf(stderr, __VA_ARGS__)
#else
#define DLOG(...)
#endif
void debug(auto f) {
#if DEBUG
f();
#endif
}
ll mPrime = int(1e9) + 7;
ll bN, bX;
vector<ll> bS;
vector<ll> facts;
... | #include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<functional>
#include<set>
#include<map>
using namespace std;
#define rep(i,l,r) for(register int i=(l);i<=(r);++i)
#define repdo(i,l,r) for(register int i=(l);i>=(r);--i)
#define il inline
typedef double db;
typedef long ... | 1 |
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int n, i, j, k, c, x;
char s[1001], r[1001], t[8] = "Hoshino";
cin >> n;
cin.ignore(1024, '\n');
for (i = 0; i < n; i++)
{
cin.getline(s, sizeof(s));
c = 0;
for (j = 0; j < strlen(s); j++)
{
r[c] = s[j];
c++;
if (s[j] == 'H'... | #include <iostream>
#include <cstring>
#include <string>
using namespace std;
int main(){
string s;
int n;
int c_pos;
cin>>n;
cin.ignore();
while(n--){
getline(cin,s);
while((c_pos=s.find("Hoshino"))!=string::npos){
s.replace(c_pos,7,"Hoshina");
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, X, T;
cin >> N >> X >> T;
int minute = 0;
while(N > 0){
minute += T;
N -= X;
}
cout << minute << endl;
} | #include <bits/stdc++.h>
using i16 = std::int16_t;
using i32 = std::int32_t;
using i64 = std::int64_t;
using usize = std::size_t;
template<typename T>
using Vector = std::vector<T>;
using String = std::string;
template<typename T>
using UniquePointer = std::unique_ptr<T>;
using namespace std;
#define rep(i, max) for(... | 1 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (x<<1)
#define rc (x<<1|1)
#define gc getchar()//(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pi pair<int,int>
#define pb push_back
#define IT iterator
#define SZ(a) ((int)a.size())
#define all(a) a.be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; retur... | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
using namespace std;
typedef long long ll;
ty... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
vector<int> v(q);
rep(i, q) cin >> v[i];
vector<int> dsum(n+1, 0);
rep(i, n) dsum[... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
vector<int> to[600];//[]の中の人がどこに行けるか
bool res[600] = {};
void bfs()
{
queue<int> q;
for(int i=0;i<to[1].size();++i){
q.push(to[1][i]);
}
for(int i=0;i<2;++i)
{
int size = q.size();
for(int i=0;i<size;++i)
{
... | #include <iostream>
#include <vector>
#include <set>
#include <cstring> // require memset
//#include <fstream> // require freopen
using namespace std;
const int N = 501;
bool t[N][N];
int main()
{
// cut here before submit
// freopen ("testcase.party", "r", stdin );
int n, m;
while (cin >> n >> m && n && m ){
... | 1 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #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) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<int> k(n);
string s;
for(int i=0;i<n;++i)
cin>>k[i];
cin>>s;
int key=0;
for(int i=0;i!=s.size();++i){
for(int j=0;j<k[key];++j){
if(s[i]=='a')
s[i]='Z';
else if(s[i]=='A')
s[i]='z';
else
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n,p;//~50
int stone,player[50]={};
int winner;
int i;
scanf("%d%d",&n,&p);
while(1){
for(i=0;i<50;i++){
player[i]=0;
}
stone=p;
for(i=0;;i++){
if(stone==0){
stone=player[i%n];
player[i%n]=0;
}
else{
stone-=1;
p... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
int k;
vector<int> ab{0, 0};
cin >> ab[0] >> ab[1] >> k;
int i = 0;
while (k--) {
if (ab[i] & 1) {
ab[i]--;
}
ab[i] >>= 1;
a... | #include <bits/stdc++.h>
using namespace std;
char s[100];
int main(){
int a, b, k;
scanf("%d%d%d", &a, &b, &k);
for(int i=0;i<k;i++){
if(i%2 == 0){
if(a%2 != 0) a--;
b += a/2;
a/=2;
}
else{
if(b%2 != 0) b--;
a += b/2;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int n,m,a[110];
int main()
{
scanf("%d%d",&n,&m);
if (m==1)
{
if (n==1)
{
printf("1\n1\n1\n");
}
else
{
printf("%d\n2\n1 %d\n",n,n-1);
}
return 0;
}
int t1=0,t2=0;
for (int i=1;i<=m;i++)
{
scanf("%d",&a[i]);
if (a[i]&1)
{
if (!t1)
{
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
const int MAXN = 1e5 + 10;
int N, M;
int A[MAXN];
int cnt;
int main() {
register int i, j = 0, k = 0;
scanf("%d%d", &N, &M);
for(i = 1; i <= M; ++i)
scanf("%d", A + i),
A[i] & 1 ? (++cnt, !j ? j ... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
const double eps=1e-10;
const int dy[]={-1,-1,0,1,1, 1, ... | #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 m, n_min, n_max;
while(cin >> m >> n_min >> n_max, m||n_min||n_max){
vector<int> P(m);
for(int i = 0; i < m; i++){
cin >> P[i];
}
int diff = 0, ... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int i = 0;
char a[20];
scanf("%s", a);
while (1) {
i++;
if (a[i] == '\0') break;
}
i--;
while (i != -1) {
printf("%c", a[i]);
i--;
}
printf("\n");
return (0);
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | 0 |
#include <iostream>
#include <stdlib.h>
#define inf 99999
using namespace std;
bool check(int *label, int n)
{
for(int i = 1; i <= n; i++){
if(label[i] == 0){
return true;
}
}
return false;
}
void dij(int **a, int n, int s, int t)
{
int *label, current=s, num=1, next, *cost, min;
cost = (int *)calloc... | #include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
//snukeさんのコードをほぼ写した
int N;
vector<int> G[100010];
vector<int> dist;
void dfs(int v, int d=0, int p=-1) {
dist[v] = d;
for (int u : G... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#... | 1 |
/*
_ _ _ _ _ _ _ _ _ _ _ _ _ __ _ __ __
| _ _| | | | | | | | | | _ | | | | | | __ | | \ / |
| |_ _ | |__| | | | | | | |_| | | |__| | | |__| | | |\ \_/ /| |
|_ _ | | __ | | | | | | _ < | __ | | __ | | | \ / | |
_ _| | | | | | | |__| | | |_| | | | | | | | | | | ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
ll dp[200][100001];
int S[200];
int main() {
int N, X;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
sort(S, S + N);
for (int i = 0; i <= X; i++) {
dp[0][i] = i % S[0];
}
for (... | 0 |
#include <cstdio>
#include <iostream>
#include <vector>
#define mod 1000000007
#define MN 1050000
std::vector<int> v[MN];
int n, a[MN];
int b[MN], c[MN];
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
b[i] = b[i - 1] ^ a[i];
c[i] = c[i - 1] + (b[i] == 0 ? 1 : 0);
v[b[i]].p... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
using namespace std;
const int INF = 1e8;
//0:up, 1:right, 2:down, 3:left
vector<pair<int, int>> direction(4);
//距離を計算する
int f( vector<pair<int, int>> vec){
sort(vec.begin(), vec.end());
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main() {
int n;
cin>>n;
priority_queue<int> que;
int ala=0,a,k=0,t,s;
for(int i=0;i<n;i++){
cin>>a;
que.push(a);
ala^=a;
}
for(int i=59;i>=0;i--){
if(que.empty())break;
if(ala&(1LL<<i)){
w... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | 1 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
int main() {
string s;
int w;
cin >> s >> w;
string ans = "";
for(int i = 0; ; ++i) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int w;
cin >> S >> w;
for(int i=0;i<S.size();i++){
if(i%w==0){
cout << S.at(i);
}
}
cout << endl;
return 0;
}
| 1 |
// Author: 23forever
#include <bits/stdc++.h>
//#define debug
const int MAXN = 40;
const int N = 5 + 7 + 5;
const int P = 1e9 + 7;
using namespace std;
inline void read(int &x) {
x = 0; char c = getchar();
while (!isdigit(c)) c = getchar();
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c ^ 48);
c = get... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n,s,x[100009],p[100009],ans[100009];
void call(int l,int r)
{
if(l==r)
{
ans[l]=fabs(x[l]);
return;
}
if(x[l]>0)
{
call(l,r-1);
ans[r]=ans[r-1]+x[r]-x[r-1];
return;
}
if(x[r]<0)
... | 0 |
// LOVED IT
#include<bits/stdc++.h>
using namespace std;
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define ll int
#define bits_count __builtin_popcountll
#define endl '\n'
#define double long double
#define ld double
#define FOR(i,a,n) for (ll i=(a);i<=(n);++i)
#defin... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
int n,k=0;
long long sum=0;
scanf("%d",&n);
int num[100005];
for(int i=0;i<n;i++)
{
scanf("%d",&num[i]);
if(num[i]<0)
{
num[i]=-num[i];
... | #include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ... | #include <iostream>
int main(){
int A, B;
std::cin >> A >> B;
if (A <= 8 && B <= 8) {
std::cout << "Yay!" << std::endl;
}
else {
std::cout << ":(" << std::endl;
}
} | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int a[10],ans=0;
for(int iii=1;iii<=2;iii++){
ans=0;
for(int i=0;i<10;i++){
scanf("%d",&a[i]);
}
sort(a,a+10);
ans+=a[7]+a[8]+a[9];
if(iii==1)printf("%d ",ans);
else printf("%d\n",ans);
}
return 0;
} | #include<iostream>
#include<cstdio>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a[10], b[10];
for(int i=0; i<10; i++){
cin >> a[i];
}
for(int i=0; i<10; i++){
cin >> b[i];
}
sort(a,a+10);
sort(b,b+10);
... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
namespace wohaocaia
{
inline void check_max(int a,int &b){if(a>b)b=a;}
const int N=105;
int s[N][N],f[N][N][N][N];
int n,m,sx,sy;
int tl,tr,tu,td;
int got(){for(char c=getchar();;c=getchar())if(c=='o' || c=='.' || c=='E')return c;}
int min(int a,int b){return... | #include<bits/stdc++.h>
using namespace std;
int H, W, rlen, clen, psum[102][102];
char G[102][102];
int calc(int r1, int c1, int r2, int c2) {
int ret = psum[r2][c2];
if(r1) ret -= psum[r1 - 1][c2];
if(c1) ret -= psum[r2][c1 - 1];
if(r1 && c1) ret += psum[r1 - 1][c1 - 1];
return ret;
}
int re, c... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll r;
ci... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> bool chmax(T& a, T b){ if (a < b) { a = b; r... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b)... | 1 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
u... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n;
cin >> n;
string s;
cin >> s;
unordered_map<pair<string, string>, int64_t,
boost:... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1000000007;
int n;
string str;
int a[200005], xd[200005];
long long p[200005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
p[0] = 1;
for (int i = 1; i <= n; i++)
{
p[i] = (p... | #include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
signed main(){
vector<int> v;
int t=3;
while(v.size()<1000){
bool f=1;
for(int i=2;i*i<=t;i++)if(t%i==0)f=0;
if(... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll =... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
templ... | 0 |
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
char school(int m, int e, int j)
{
if( m == 100 || e == 100 || j == 100 )
return 'A';
if( (m+e)>=180 || (m+e+j)>=240)
return 'A';
if( (m+e+j)>=210 || ( (m+e+j)>=150 && (m>=80||e>=80) ) )
return 'B';
else
return '... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
string s;
cin >> s;
vector<long long> b;
int ans ... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | 1 |
#include <iostream>
using namespace std;
const int MAX_N = 100005;
int n, A[MAX_N], B[MAX_N], C[MAX_N], pos[3 * MAX_N], rev[3 * MAX_N];
void wypisz() {
cout << "----------------------\n";
for(int i = 1; i <= n; i++) cout << A[i] << " ";
cout << endl;
for(int i = 1; i <= n; i++) cout << B[i] << " ";
... | #include<bits/stdc++.h>
#define no {puts("No");return 0;}
#define yes {puts("Yes");return 0;}
#define nc() getchar()
using namespace std;
const int N=300010;
/*inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}*/
inline int read... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 1;
map... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#define maxn 1000005
#define mod 998244353
using namespace std;
int n,m,fac[maxn],inv[maxn],ans;
int add(int a,int b){a+=b;return a>=mod?a-mod:a;}
int mul(int a,int b){return 1ll*a*b%mod;}
int ksm(int a,int b)
{
int s=1;
for(;b;b>>=1,a=mul(a,a))
if(... | 0 |
#include <iostream>
using namespace std;
int main(){
while(1){
int n, nums[10] = {0};
cin >> n;
if(!n) break;
for(int i = 0;i < n;i++){
int k;
cin >> k;
nums[k]++;
}
for(int i = 0;i < 10;i++){
if(nums[i] == 0) cout <<... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
using namespace std;
#define INF 10000001
int main()
{
int a, n;
int maxi, mini;
int i;
long long sum = 0ll;
mini = INF;
maxi = -10000001;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d"... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n;i++)
using pii = pair<int,int>;
using piii = pair<pii,int>;
using ll = long long;
#define int ll
signed main(){
int v,e; cin>>v>>e;
vector<piii>edge;
rep(i,e){
int a,b,c; cin>>a>>b>>c;
edge.push_back(piii(pii(a,b)... | #include<bits/stdc++.h>
using namespace std;
#define inf 1e12+1
typedef long long int ll;
typedef pair<ll,ll> mypair;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll v,e;
cin>>v>>e;
vector<vector<mypair> > g(v);
vector<vector<ll> > dp(v,vector<ll>(v,inf) );
ll s,t,d;
rep(i,e){
cin>>s>>t>>d,g[s].pus... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 1 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define PB push_back
#define PII pair <long long , long long>
#define FAST ios::sync_with_stdio(false);cin.tie(0);
const int maxn = 2e3 + 30;
string a[maxn];
int vertex[maxn][maxn] , er[maxn][maxn] , ed[maxn][maxn];
i... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(void) {
ll N; cin >> N;
string S; cin >> S;
ll r=0,g=0,b=0;
for(int i=0; i<N; i++) {
if(S[i]=='R') r++;
if(S[i]=='G') g++;
if(S[i]==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
//#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.