code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <vector>
#include <cmath>
#include <limits.h>
#include <utility>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int MOD=1e9+7;
void modplus(int &a,int b){
a+=b;
a%=MOD;
}
ll eline(int a){
if(a<=0)retur... | #include<bits/stdc++.h>
using namespace std;
#define p 1000000007
#define maxn 100005
#define int long long
int h,w,a,b,fac[maxn*2+5],inv[maxn*2+5];
inline int qpow(int x,int a)
{
int ans=1;
while(a)
{
if(a&1) ans=1ll*ans*x%p;
x=1ll*x*x%p;
a>>=1;
}
return ans;
}
inline void pre(int x=maxn*2)
{
fac[0]=inv[0]... | 0 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | #include <iostream>
using namespace std;
int main(){
int n,a;
cin >> n;
int max = -1000001;
int min = 1000001;
long sum = 0;
for(int i=0;i<n;i++){
cin >> a;
sum = sum + a;
if(max<a) max = a;
if(min>a) min = a;
}
cout << min << " " << max << " " << sum << endl;
} | 0 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <string>
using namespace std;
int main(void){
string s;
cin >> s;
for(int bit=0; bit<(1<<3); bit++){
int svn = s[0]-'0';
for(int i=0; i<3; i++){
if(bit & (1<<i)) svn += s[i+1]-'0';
else svn -= s[i+1]-'0';
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
string s;
cin >> s;
int a = s[0] - '0';
int b = s[1] - '0';
int c = s[2] - '0';
int d = s[3] - '0';
if (a+b+c+d == 7) cout << a << "+" << b << "+" << c << "+" << d << "=7";
else if (a+b+c-d == 7) cout << a << "+" << b << "+" <... | 1 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
int a, b;
cin >> a >> b;
int ans;
ans = (b - 1) /(a - 1);
if((... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | /*
* @Author: hesorchen
* @Date: 2020-07-03 17:05:01
* @LastEditTime: 2020-09-04 20:28:08
* @Description: https://hesorchen.github.io/
*/
#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <vector>
#include <bitset>
#include <cstdio>
#include ... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); ... | #include<bits/stdc++.h>
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#d... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int cnt=0;
string s;
cin>>s;
int m =0;
for(int i =0 ;i<3;i++)
{
if(s[i]=='R')m++;
else
{
cnt = max(m,cnt);
m =0;
}
}
cnt = max(m,cnt);
cout<<cnt;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
char x[5];
int main() {
scanf("%s", x);
int ans = 0, cur = 0;
for (int i = 0; x[i]; i++)
if (x[i] == 'R')
ans = max(ans, ++cur);
else
cur = 0;
printf("%d\n", ans);
}
| 1 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,les... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void cmin(T &x, const T &y)
{
if(y < x) x = y;
}
template <typename T> void cmax(T &x, const T &y)
{
if(y > x) x = y;
}
template <typename T> void read(T &x)
{
x = 0; char c = getchar(); bool f = 0;
while(!isdigit(c) && c... | 1 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int h, w, n;
cin >> h >> w >> n;
... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (... | 0 |
#include <iostream>
#include <atcoder/fenwicktree>
using namespace std;
using namespace atcoder;
int main() {
int N,Q;
cin >> N >> Q;
fenwick_tree<long long int> fw(N);
for(int i=0;i<N;i++) {
int a;
cin >> a;
fw.add(i, a);
}
for(int i=0;i<Q;i++) {
int t,c,d;
... | #include <iostream>
#include <queue>
#include <set>
#include <map>
#include <vector>
#define FOR(i,n) for(unsigned i=0; i<n; i++)
using namespace std;
typedef unsigned us;
typedef pair<us, us> point;
int main () {
us V, E;
cin >> V >> E;
set<us> seen;
seen.insert(0);
map<us, vector<point> > grap... | 0 |
#include <iostream>
#define SIZE 8
void threaten(int board[][SIZE], int x, int y)
{
for (int i=0; i<SIZE; i++) {
board[i][y]++; board[x][i]++;
}
for (int i=-x; i<SIZE-x; i++) {
if (0 <= y+i && y+i < SIZE) board[x+i][y+i]++;
if (0 <= y-i && y-i < SIZE) board[x+i][y-i]++;
}
board[x][y]+=100;
}
void unthreate... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n;
cin >> n;
ll taka = 0,ao = 0;
priori... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
typedef vector<pi> vpi;
typedef vector<string> vsi;
typedef map<ll, ll> mape;
#define rep(i, a, b) for(ll i=(ll)a;i<=(ll)b;i++)
#define per(i, a, b) for(ll i=(ll)a;i>=(ll)b;i--)
#define fastio {ios_base::... | 1 |
#include<iostream>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
map< int, set<int> > Init(int);
set<int> FindFriends(map< int, set<int> >);
int main(){
int i, n, m, a, b;
set<int> friends;
map< int, set<int> > data;
while(1){
cin >> n >> m;
if(n == 0 && m == 0) break;
dat... | #include <iostream>
#include <stdlib.h>
using namespace std;
int main(int argc, char **argv)
{
int n, m, **a, s, t, c, *b;
while(1){
cin >> n;
cin >> m;
if(n == 0 && m == 0){
break;
}
c = 0;
a = (int **)calloc(n+1, sizeof(int));
b = (int *)calloc(n+1, sizeof(int));
for(int i = 0; i <= n; i++){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n,m,x,y,flg = 0;
cin >> n >> m >> x >> y;
vector<int> X(n), Y(m);
rep(i,n) cin >> X[i];
rep(i,m) cin >> Y[i];
sort(X.begin(), X.end());
sort(Y.begin()... | #include <iostream>
#include<string>
using namespace std;
class Dice{
public:
int num[6],t;//t=top
/*
dice.num[0] = ???
dice.num[1] = ???
dice.num[2] = ???
dice.num[3] = ???
dice.num[4] = ???
dice.num[5] = ???*/
void North(){
t = num[0];
num[0] = num[1];//??????1?????¨???
num[1] = num[5];//?????... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n; cin>>n;
for(int i=n; i>0; i--){
double r=sqrt(i);
if(r==(int)r) {cout<<i<<endl; return 0;}
}
} | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 0 |
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
string s, t, u; int n, a, b;
int main() {
cin >> s >> n;
for(int i = 0; i < n; i++) {
cin >> t;
if(t == "print") cin >> a >> b, cout << s.substr(a, b - a + 1) << endl;
if(t == "reverse") cin >> a >> b, reverse(s.begin() + a, s.begin... | #include <bits/stdc++.h>
#include<string>
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define len(s) s.length()
#define all(v) v.begin(),v.end()
const ll INF = LONG_MAX;
const in... | 0 |
#include<cstdio>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
int main()
{
int n,i,p,a,b,c,d,e,f,m,s;
char l[32];
pair<double,string>A[50];
while(scanf("%d",&n),n)
{
for(i=0;i<n;++i)
{
scanf("%s%d%d%d%d%d%d%d%d%d",l,&p,&a,&b,&c,&d,&e,&f,&s,&m);
A[i].second=l;
A[i].first=-(f*... | #include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
/*
cout<< ("onion">"potato") <<endl;
return 0;
*/
int h,i,j;
int y[50],z[50],n,p,a,b,c,d,e,f,s,m;
string l[50];
while(cin>>n&&n){
for(i=0;i<n... | 1 |
#include <iostream>
using namespace std;
long long sum(int size,int ary[]);
int min(int size,int ary[]);
int max(int size,int ary[]);
int main(){
int size=0;
cin >>size;
int nums[size];
for(int i=0;i<size;i++){
cin >> nums[i];
}
int a=0,b=0;
long long c=0;
a=min(size,nums);
b=max(size,nums);
c=sum(size,n... | #include <bits/stdc++.h>
#define TOP 0
#define FRONT 1
#define LEFT 2
#define RIGHT 3
#define BACK 4
#define BOTTOM 5
using namespace std;
//TOP,FRONT,LEFT,RIGHT,BACK,BOTTOM
int dice[6]={1,2,4,3,5,6};
//?\\?????¢??????
void rotN(){
swap(dice[TOP],dice[FRONT]);
swap(dice[FRONT],dice[BOTTOM]);
swap(dice[BOTTOM],d... | 0 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#define endl "\n"
using namespace std;
void solve()
{ int x,y; cin >> x >> y;
cout << x*y;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
template<typename T>
vector<vector<T>> Make2DVector(int d1, int d2, T default_value) {
return vector<vector<T>>(d1, vector<T>(d2, default_value));
}
// Vector
template<typename T> ostream& operator<<(ostream& s, const ... |
/*
Writer: SPD_9X2
https://atcoder.jp/contests/arc081/tasks/arc081_d
長方形にできる必要十分条件は、
内側にある四つ角の周り全てに関して、周りにある黒が偶数個
→そのような条件を満たす四つ角グリッドを考えると最大長方形になる
幅1の長方形に関しては全て作れるので、ans初期値はmax(H,W)
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n,m) for(int (i)=(n);(i)<(m);(i)++)
#define rrep(i,n,m) for(int (i)=(n... | 1 |
#include <cstdio>
#include <cstring>
#include <algorithm>
inline int read()
{
int data = 0, w = 1;
char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
... | #include <iostream>
#include <string>
using namespace std;
string line;
int str_len;
bool is_finish() {
for(int i=0; i<str_len-3; i++) {
if(line[i] == 't') {
if(line[i+1] == 'h') {
if(line[i+2] == 'e') { return true; }
else if(line[i+2] == 'i' && line[i+3] == 's') { return true; }
... | 0 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=n-1;i>=0;i--) {
if(i==0)cout<<a[i];
else cout<<a[i]<<' ';
}
cout<<endl;
}
| #include <cstdio>
//#include <iostream>
//#include <string>
using namespace std;
// cl /EHsc xxx.cpp
int main(int argc, char *argv[])
{
int n;
scanf("%d", &n);
int *ary = new int[n];
int v;
int t = n;
while (t)
{
scanf("%d", &v);
ary[--t] = v;
}
for (int j = 0; j < n; j++)
{
if (j == n-1)
{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long v, a, b, c, d, e;
cin >> v >> a >> b >> c >> d >> e;
long long slow = min({a, b, c, d, e});
cout << (v + slow-1)/ slow + 4;
return 0;
} | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
... | 1 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = LLONG_MAX;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// __uint128_t
const ll MOD = 1e9+7;
int main(){
ll N, K; cin >> N >> K;
vector<ll> A(N+1);
for(int i = 0; i < N; i++) cin >> A[i];
while(K--){
... | 0 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
vector<string> ans(100, "");
for(int... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int x = 1;
for (int i = 0;N > i;i++){
cin >> x;
if (x < K){
x *= 2;
}
else{
x += K;
}
}
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main () {
int N,K,A;
cin >> N >> K;
A = 1;
for (int i=0;i<N;i++) {
if ( A*2 < A + K ) A = A*2;
else A = A + K;
}
cout << A << endl;
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll... | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for(int (i)=0; (i)<(n); (i)++)
#define REP2(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1,) (__VA_ARGS__)
#define MOD 1000000007
template <class T> ostream& op... | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os << "[ ";
for(auto v:V)os << v << " "; return os << "]";
}
template<class T> ostream& operator<<(ostream &os, set<T> S){ os << "{ ";
for(auto s:S) os<<s<<" "; return os<<"}";
}
template<class L, class... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 400005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 10000000... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
// ---------------------
// repetition
#define FOR(i,a,b) for(int... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int jd(vi D, int N){
while(N > 0){
for(int x : D){
if (N%10 == x ){
return 0;
}
}
N /= 10;... | #include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#def... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i%2 == 0) {
if (a%2==1) a--;
b += a/2;
a /= 2;
}
else {
if (b%2==1) b--;
a += b/2;
b ... | // ref: https://img.atcoder.jp/abc113/editorial.pdf
// ref: https://atcoder.jp/contests/abc113/submissions/3540482
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T>
inline void print(const T& rhs)... | 0 |
#include <stdio.h>
int main() {
int a;
scanf("%d",&a);
a=a*a*a;
printf("%d\n",a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define rrep(i,m,n) for(int i = m; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
... | 0 |
#include<bits/stdc++.h>
template< typename G >
struct StronglyConnectedComponents {
using UnWeightedGraph=std::vector<std::vector<int>>;
const G &g;
UnWeightedGraph gg, rg;
std::vector< int > comp, order, used;
StronglyConnectedComponents(G &g) : g(g), gg(g.size()), rg(g.size()), comp(g.size(), -1), used(... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
uint64_t getZ() {
uint64_t v = 0; int c;
while((c = getchar_unlocked()) >= '0') v=v*10+c-'0';
return v;
}
template<int BUFSIZE>
struct an... | 1 |
# include<bits/stdc++.h>
# 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 optimize ("Ofast")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, les... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 200010;
typedef long long ll;
int vis[2][maxN];
vector<int> G[2][maxN];
queue<int> Q;
void bfs(int u, int d, int c){
while(!Q.empty()) Q.pop();
vis[d][u] = c; Q.push(u);
while(!Q.empty()){
u = Q.front(); Q.pop();
for(int i = 0; i < G[d][u].size();... | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9+7
int main(){
int n,m;
while(1){
cin>>n>>m;
if(n==0&&m==0)break;
vector<vector<int> > cost(m,vector<int>(m,INF));
vector<vector<int> > timea(m,vector<int>(m,INF));
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
a--;
b--;
cin>>cost[... | 0 |
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
using ld = long double;
const ld PI = acos(-1);
struct point {
ld x, y;
};
int main() {
int N;
cin >> N;
vector<point> coo(N);
for (auto& p : coo) cin >> p.x >> p.y;
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <cstdio>
using namespace std;
int n;
int m;
int maxcnt;
int maxidx;
int a[1000];
int cnt[1000];
int main() {
scanf("%d %d", &n, &m);
for (int i=0; i<n; i++) {
scanf("%d", &a[i]);
}
for (int i=0; i<m; i++) {
int b;
scanf("%d", &b);
for (int i=0; i<n; i++) {
... | 0 |
#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() {
ll x; cin >> x;
ll nokori = x % 11;
ll ans = (x-nokori) / 11;
ans *= 2;
if(nokori > 6){
ans += 2;
} else if(nokori > 0) {
ans... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false)... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int i,n;
string a;
cin>>a;
n=a.size();
for(i=n-1;i>=0;i--){
cout<<a[i];
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ans = "";
while(n != 0){
int t = n%(-2);
if(t == -1) t = 1;
ans.push_back('0'+t);
n = (n-t)/(-2);
}
if(ans.size() == 0) ans = "0";
reverse(ans.begin(),ans.end());
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=(a);i<=(b);++i)
#define rv(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int M = 120000;
typedef long long ll;
int n,m,k;
char grid[8][10][10]={{"aa.","..a","..a"},
{"aabc","ddbc","bcaa","bcdd"},
{"aabba","bcc.a","b..cb","a..cb","abbaa"},
{
"aabc..",... | // luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define in inline
namespace fast_io
{
char buf[1<<12],*p1=buf,*p2=buf,sr[1<<23],z[23],nc;int C=-1,Z=0,Bi=0;
in char gc() {return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<12,stdin),p1==p2)?EOF:*p1++;}
in ll read()... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
#define ABC 001
#define ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 1 |
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
void solve(ll A, ll B) { cout << max({A + B, A - B, A * B}) << endl; }
int main() {
ll A;
cin >> A;
ll B;
cin >> B;
solve(A, B);
return 0;
}
| #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int x;
cin >> x;
cout << int(pow(x, 3)) << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
set<int> nums;
int a;
whil... | #include<bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("gymnastics.in","r",stdin );
#define outF freopen("... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e15;
vector<int> tovec(ll x, int N){
vector... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <utility>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pai... | #include<iostream>
using namespace std;
int main(){
string in;
// while(cin >> in){
cin >> in;
int num[3] = {0,0,0};
int lev = 0;
int status = 3;
for(int i = 0; i < in.length(); i++){
if(in[i] == 'J'){
//cout << num[0] << " " << num[1] << " " << num[2] << endl;
if(status != 0) num[0] = n... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int n,x,t;
cin>>n>>x>>t;
int times=(n+x-1)/x;
int ans=times*t;
cout<<ans<<endl;
} | #include<iostream>
using namespace std;
char getAns(int m,int e,int j){
if(m==100||e==100||j==100)return 'A';
if((m+e)/2>=90)return 'A';
if((m+e+j)/3>=80)return 'A';
if((m+e+j)/3>=70)return 'B';
if((m+e+j)/3>=50&& (m>=80||e>=80))return 'B';
return 'C';
}
int main(){
int d;
while(cin>>d){
int pm,pe,pj;
for... | 0 |
// 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
int f(int n) {
int ret = 0;
while (n) {
re... | #include <iostream>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
#define res register int
#define ll long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define INF 1000000007
#define gc getchar()
#define MAXN 200005
#define lc pos<<1
#define rc pos<<1|1
using namespace std;
inline int read()
{
int ch=gc,f=0;
int x... | 0 |
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
float l[11];
float v1,v2;
char s;
while(1)
{
for(int i=1;i<=10;i++){
cin >> l[i] >> s;
}
cin >> v1 >> s >> v2;
if(cin.eof()) break;
float t,la;
float lsum=0;
... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
double row[10],v[2];
for(;;){
if (scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf",&row[0],&row[1],&row[2],&row[3],&row[4],&row[5],&row[6],&row[7],&row[8],&row[9],&v[0],&v[1]) == EOF){break;}
int i;
double t,dis = 0,d = 0;
for(int i=0... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> x1(n+1);
vector<int> y1(m+1);
for(int i = 0; i < n; i++) cin >> x1[i];
for(int i = 0; i < m; i++) cin >> y1[i];
string ans = "War";
for(int z = ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000000000000000;
//input
ll N,A,B,C,D,E;
//processing
ll hoge;
//dpTable
//int dp[100050];
int main(){
cin >>... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | #include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
ll x[100010];
int a[100010], nsw[100010], now[100010], vid[100010], vnum[100010], repl[100010];
bool looked[100010]={};
vector<vector<int>> v;
int main() {
int N;
cin >> N;
for(int i=0; i<N; ++i) cin >> x[i];
int... | 1 |
#include <iostream>
#include <cmath>
#include <iomanip>
#include <utility>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#define ll long long
using namespace std;
long long gcd(int x, int y){
if ( x == 0 ) return y;
return gcd(y%x, x);
}
long long lcm(int ... | #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 1000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | 1 |
#include<bits/stdc++.h>
using namespace std;
int n,mod,jc[11111],injc[11111],ans,ipw1[11111],ipw2[11111],ipw3[11111],i2,i3,ct,pw[11111];
int binpow(int a,int t)
{
int res=1,p=a;
for (int i=t;i;i>>=1)
{
if (i&1) res=1ll*res*p%mod;
p=1ll*p*p%mod;
}
return res;
}
int main()
{
scanf("%d%d",&n,&mod);
jc[0]=1;
fo... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <numeric>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <deque>
#include <cmath>
#include <complex>
#include <cassert>
#include <cstring>
#include <functional>
#include <bitset>
#include <clim... | 0 |
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<ctype.h>
#include<stack>
#include<math.h>
#include <string>
#include<algorithm>
#include<iomanip>
#define _for(i,a,b) for(int i = (a);i < (b);i++)
#define mset(x) memset(x,0,sizeof(x));
using na... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
vector<int>X(26,0);
string S;cin>>S;
for(long long i=0;i<S.size();i++){
X[(int)S[i]-97]++;
}
for(long long i=0;i<26;i++){
if(X[i]==0){
int ans=i+97;
cout<<(char)ans<<endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 100000000;
typedef pair<char, int> P;
int main() {
string S;
cin >> S;
string alpha = "abcdefghijklmnopqrstuvwxyz";
vector<P> vec(26);... | 1 |
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef vector <int> vi;
int main(void){
map <char, int> m;
vi x;
int num[] = {1,5,10,50,100,500,1000};
for (int i=0; i<7; i++)
m["IVXLCDM"[i]] = num[i];
while (true){
string roman;
cin>>roman;
if (cin.eof()) brea... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
const string ara = "IVXLCDM\0";
const int integer[8] = {1,5,10,50,100,500,1000};
int Input(int num[],string in);
void Output(int p,int num[]);
int main(void){
string in;
int num[1000];
while( cin >> in ){
for(int i = 0 ; i < 1000... | 1 |
#include<bits/stdc++.h>
//ios::sync_with_stdio(false);
//cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N=1e3+5;
const int MOD=1e9+7;
int n, a, b, c, d;
int cache[N][N], cache2[N][N];
int fact[N], invfact[N];
int pow(int a, int b, int m)
{
int ans=1;
while... | 1 |
#include "bits/stdc++.h"
#define ll long long
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef pair<ll, ll> pairs;
typedef pair<ll, pairs> tpl;
ll c[4];
double dp[301][301][301];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, a;
cin >> n;
for (ll i = 0; i < n; i++)
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return f... | 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(){
int n;
cin>>n;
deque<int>q;
rep(i,n){
int a; cin>>a;
int x=lower_bound(q.begin(),q.end(), a)-q.begin();
if(x==0)q.push_front(a);
... | // practice with Dukkha
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 100000;
int aa[N], ii[N], ft[N];
void update(int i, int n, int x) {
while (i < n) {
ft[i] = max(ft[i], x);
i |= i + 1;
}
}
int query(int i) {
int x = 0;
while (i >= 0) {
x = max(x, ft[i]);
i &= i + 1, i-... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v)... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n,cou=0;
string str;
cin >> n;
while(n>cou){
int cou_out=0,ans=0,ining=0;
while(cou_out < 3){
cin >> str;
if(str == "HIT"){
ining++;
if(ining == 4){
ans++;
ining--;
}
}
else if(str == "OUT"){
cou_... | 0 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define Graph vector<vector<int>>
int main() {
int H,W;
scanf("%d%d",&H,&W);
Graph A( H , vector<int> (W,0) );
Graph count( H , vector<int> (W,0) );
queue< pair<int,int> > que;
rep(y,H... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int min(int a, int b) { return(a < b) ? a : b; }
class Solution
{
public:
int minDistance(const string &word1, const string &word2)
{
const size_t m = word1.size() + 1;
const size_t n = word2.size() + 1;
vector<vector<int> > k(m, ... | 0 |
#include <iostream>
using namespace std;
int main( void )
{
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ( ( ( e - a ) <= ( 4 * k ) ) && ( ( d + e - a - b ) <= ( 3 * k ) ) &&
( ( d + e - a - b ) <= ( 2 * k ) ) && ( ( e - a ) <= ( k ) ) )
{
cout << "Yay!" << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
vector<int> a(5);
rep(i, 5) cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5;i ++){
for (int j = i+1; j < 5; j++){
if(abs(a.at(i)-a.at(j)) >k){
cout << ":(";
retu... | 1 |
#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(int i=0;i<int(n);i++)
#define N 200000
int main(){
vector<int>a;
in... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
int a[3][MAXN];
int f[2][MAXN];
void add(int p, int index) {
for (;p < MAXN; p += p&-p)
++f[index][p];
}
int find(int p, int index) {
int res = 0;
for (;p; p -= p&-p)
res += f[index][p];
return res;
}
int32_t main (... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int R;
int G;
cin >> R >> G ;
cout << (G - R) + G << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double R = 0;
cin >> R;//現在のレーティング
double G = 0;
cin >> G;//したいレーティング
//(R + ans) / 2 = G
//R + ans = 2*G
double ans = 0;
ans = 2*G - R;
cout << ans << endl;
}
| 1 |
#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>
#in... | #include <bits/stdc++.h>
using namespace std;
int main () {
int A, B;
cin >> A >> B;
int tasu = A + B;
int hiku = A - B;
int kake = A * B;
if (tasu >= hiku && tasu >= kake) {
cout << tasu << endl;
}
else if (hiku >= kake && hiku >= tasu) {
cout << hiku << endl;
}
else {
cout << kake <... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | 0 |
#pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define NumberOfOnes __builtin_popcount
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
int N,K; vector<int> pl,mi;
void input()
{
cin >> N >> K;
for(int i=0; i<N; ++i){
int x; cin >> x;
if(x > 0) pl.emplace_back(x);
else if(x < 0) mi.emplace_back(-x);
}
reverse(mi.begi... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
pair<int, int>,
null_type,
less_equal<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
order... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
inline void reset(int cnt[], int& state) {
REP(i, 3) cnt[i] = 0;
state = 0;
}
int main() {
int ans = 0, cnt[3], state;
char JOI[] = {'J', 'O', 'I'};
reset(cnt... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main(){
string s;
cin >> s;
int n=s.size()-2;
int ans = inf;
rep(i,n){
int x=(s[i]-'0')*100+(s[i+1]-'0')*10+(s[i+2]-'0');
ans = min(ans,abs(x-7... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
while (cin >> n) {
long long stool = 0;
int prev = 0;
for (int i = 0; i < n; ++i) {
int aux;
cin >> aux;
if (aux <= prev) {
stool +=... | #include<bits/stdc++.h>
using namespace std;
long long a[200000],l[200000];
signed main()
{
ios::sync_with_stdio(0);
long long n,i;
long long ans=0;
cin >> n;
for(i=1; i<=n; i++)
cin >> a[i];
for(i=1; i<=n; i++)
l[i]=max(a[i],l[i-1]);
for(i=1; i<=n; i++)
ans+=l[i]-a[i];
cout << ans << end... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool c=true;
for(int i=97;i<=122;i++){
c=true;
for(int j=0;s[j]!='\0';j++){
if(char(i)==s[j]){
c=false;
continue;
}
}
if(c==true){
cout<<char(i);
break;
}
}
i... | #include<stdio.h>
#include<string.h>
int main()
{
char a[20], b[20], c[20];
scanf("%s %s %s", &a, &b, &c);
int al, bl;
al = strlen(a)-1;
bl = strlen(b)-1;
if(a[al]==b[0] && b[bl]==c[0])
printf("YES");
else printf("NO");
}
| 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
//ceil(a/b) (a + (b - 1))/ b
using namespace std;
#de... | #include <iostream>
#include <string>
typedef long long ll;
std::string alphabet = "abcdefghijklmnopqrstuvwxyz";
ll N;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> N;
std::string ans = "";
while (N) {
N--;
ans = alphabet[N % 26] + ans;
... | 1 |
#include <string>
#include <iostream>
using namespace std;
int main(){
string angou;
while (getline(cin, angou)){
int a = angou.size();
for (int i = 0; i < 26; i++)
{
for (int q = 0; q < a; q++){
if (angou[q] == ' ' || angou[q] == '.') continue;
if (angou[q] == 'z') angou[q] = 'a';
else ango... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int l=s.length(),j,k;
vector<int> v(26,-1);
for(j=0;j<l;j++){
k=s[j]-'a';
if(v[k]==-1||j-v[k]>2) v[k]=j;
else{
cout<<v[k]+1<<' '<<j+1<<endl;
return 0;
}
}
cout<<"-1 -1"<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_u... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << ... | 1 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int l, i=0, a[10];
while(2 > i){
cin >> a[i];
i++;
}
if (a[0] > 8 || a[1] > 8) {
cout << ":(" << "\n";
} else {
cout << "Yay!" << "\n";
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a, b;
cin >> a >> b;
cout << (((a <= 8) && (b <= 8)) ? "Yay!" : ":(") << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
struct Node{
int key;
Node *right,*left,*parent;
};
Node *root,*NIL;
Node * tmin(Node *x){
while(x->left!=NIL)x=x->left;
return x;
}
Node * treeSuccessor(Node *x){
if(x->right!=NIL)return tmin(x->right);
Node *y=x->parent;
while(y!=NIL&&x==y->right){
x=y;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(v) v.begin(),v.end()
const int maxn = 1e5 + 100;
const ll inf = 2e18... | 0 |
#include<stdio.h>
int main(){
int n, r, t;
scanf("%d %d", &n, &r);
t = 100 * (10 - n);
if(n<10){
printf("%d\n", r+t);
}
else{
printf("%d\n", r);
}
return 0;
}
| #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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
in... | 0 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout <... | #include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b... | 0 |
#include <stdio.h>
int n,k,i,j,p,num[5040],c[4],card[10],ans;
void set(int x){
int i,j;
if (x==k) {
for (i=0; i<k; i++) {
num[p]=num[p]*10;
if (card[c[i]]>=10) {
num[p]=num[p]*10;
}
num[p]+=card[c[i]];
}
p++;
return;... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#define int long long
#define MOD7 1000000007
#define... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s;
cin>>s;
if(s.size()!=26){
map<char,int> mp;
rep(i,s.size()){
mp[s[i]]=1;
}
rep(i,26){
if(mp['a'+i]!=1){
s+=('a'+i);
break;
... | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cst... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int x = 100;
int f = n/x;
int q = n%10;
n /= 10;
int y = n%10;
if(y > f)cout << f + 1 << f + 1 << f + 1 << '\n';
else if(y == f && q > f) cout << f + 1 << f + 1 << f + 1 << '\n';
else cout << f << f << f << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (3 == (int)s.size()) {
reverse(s.begin(), s.end());
cout << s << endl;
}
else {
cout << s << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i=0; i<h; i++){
for (int j=0; j<w; j++){
if ((i<b && j<a) || (i>=b && j>=a)) cout << "1";
else cout << "0";
}
cout << "\n";
}
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#defi... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main(){
int n;
string s;
cin >> n >> s;
for(int i=0; i<2*n; i++){
if((i + (s[i] == 'W')) % 2 == 0){
s[i] = 'L';
}
else{
s[i] = 'R';
}
}
if(count(s.begin(), s.end(), 'L') != n) cout ... | #include <cstdio>
using namespace std;
#define MOD 1000000007
char s[200007];
int main(){
register int n, n2, i, ans, cnt, pre, now;
scanf("%d", &n);
n2 = n * 2;
scanf("%s", s + 1);
if (s[1] == 'W' || s[n2] == 'W') {
puts("0");
return 0;
}
ans = cnt = 1, pre = 0;
for (i = 2; i < n2; ++i) {
if (s[i - 1] !=... | 1 |
// D - Factorization
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
const int MOD = 1000000007;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll> > result;
for (ll p=2; p*p<=n; p++) {
if (n % p != 0) contin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> Pli;
ll N, M;
const int MAX = 5.0e5 + 100;
const int MOD = 1.0e9 + 7;
ll fac[MAX], finv[MAX], inv[MAX];
vector<ll> primeFactorization(ll n) {
vector<ll> ret;
ll a = 2;
while (n >= a * a) {
if (n % a == 0) {
... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define maz(a,b) a=max(a,b);
typedef long long ll;
using namespace std;
#define N 310
ll d[N][N][N],n,x;
string s;
int main(){
cin>>s>>x; n=s.size();
lol(k,x+1)lol(i,n)d[0][i][k]... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | 0 |
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//
//#include <immintrin.h>
//#include <emmintrin.h>
#include <bits/stdc++.h>
//#pragma GCC optimize("O2")
#define vi vector<int>
#define pii pair<int, int >
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define itn int
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto& i : (arr))
#define all(x)... | 0 |
//int a = s - '0'; 文字から数字
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//小文字に対応する文字コード：S... | #include <iostream>
#define SIZE 100000
using namespace std;
void copy(int *res, int *ori, int n){
for(int i=0;i<n;i++){
*(res+i) = *(ori+i);
}
}
void mult(int *res, int *a, int n){
for(int i=0;i<n;i++){
*(res+i) = *(a + *(res+i));
}
}
void pow(int *res, int *a, long long b, int n){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "... | #include<bits/stdc++.h>
using namespace std;
using Weight = long long;
using Vertex = int;
struct Edge {Vertex from, to; Weight weight;};
using Graph = std::vector<std::vector<Edge>>;
std::vector<std::vector<Vertex>> connected_component(const Graph& G) {
std::vector<std::vector<Vertex>> cc;
std::vector<bool> used... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=2005;
int n,m,q,ans;
int a[maxn][maxn],s[maxn][maxn],up[maxn][maxn],lf[maxn][maxn];
inline int read()
{
int ret=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-f;ch=getchar();}
while(ch>=48&&ch<=57){ret=ret*10+ch-48;ch=getchar();}
return ret*... | #include <bits/stdc++.h>
using namespace std;
int dp[1001][1001];
int main(){
string s1,s2; cin>>s1>>s2;
for(int i=0;i<1001;i++){
for(int j=0;j<1001;j++) dp[i][j]=INT_MAX;
}
dp[0][0]=0;
for(int i=1;i<=(int)s1.size();i++) dp[i][0]=i;
for(int i=1;i<=(int)s2.size();i++) dp[0][i]=i;
for(int i=1;i<=(int)s1.size();i... | 0 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define mod 998244353
#define inv2 499122177
#define M 1000020
using namespace std;
namespace IO{
int Top=0; char SS[20];
void write(int x){
if(!x){putchar('0');return;} if(x<0) x=-x,putchar('-');
while(... | #include<bits/stdc++.h>
#define LL long long
#define uLL unsigned long long
#define db double
using namespace std;
const int N=5e5+10,mod=998244353;
int rd()
{
int x=0,w=1;char ch=0;
while(ch<'0'||ch>'9'){if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return x*w;
};
... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespa... | #include <iostream>
#include <vector>
#include <string>
#include<algorithm>
#include<stdio.h>
#include<string>
#include<math.h>
#include<set>
using namespace std;
void itsvgg()
{
ios::sync_with_stdio(0);cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt", "w", stdout)... | 1 |
// IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long int
#define s(x) cin>>x... | #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)... | 0 |
#include <iostream>
#include <map>
#include <cctype>
using namespace std;
char getResult(map<char, string> &s){
char turn, next;
for(turn = 'a'; s[turn].size() > 0; turn = next){
next = s[turn][0];
s[turn] = s[turn].erase(0,1);
}
return toupper(turn);
}
int main(){
map<char, string> s;
for(char c ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
string a, b, c;
cin >> a >> b >> c;
if(a.back() == b.front()){
if(b.back() == c.front()) cout << "YES" << endl;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
vector<vector<int>> c(20, vector<int>(20));
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
ll x... | #include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
int main(){
int N;
cin>>N;
vector<P> Bracketfirst(0);
vector<P> Bracketsecond(0);
//A (
//B )
for(int i=0;i<N;i++){
int A=0,B=0;
string S;
cin>>S;
for(int j=0;j<(int)S.size();j++){
... | 0 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
map<int,int>t;... | #include <stdio.h>
#define MAX 200000
#define INFTY 2000000000
double cnt=0;
void bubble(int *,int,int,int);
void bubbleSort(int *,int,int);
void bubble(int *A,int left,int mid,int right){
int i,j,k;
int x1,x2;
int L[MAX],R[MAX];
x1=mid-left;
x2=right-mid;
for(i=0;i<x1;i++){
L[i]=A[left+i];
}
... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
int max_x;
cin >> max_x;
rep(i, N - 1){
int x;
cin >> x;
max_x = max(max_x, x);
}
int min_... | 1 |
/*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) fo... | #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';
... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
char map[13][13];
int d[13][13];
int dy[4]={-1,0,1,0};
int dx[4]={0,-1,0,1};
void bfs(int y,int x);
int main(){
char a[12];
string str;
while(1){
int co=0;
for(int i=0;i<12;i++){
cin>>map[i];
}
if(cin.eof())break;
for(int... | #include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define INF 1 << 30
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin())i=... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.