code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#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,b;
cin>>a>>b;
if(a<9 && b<9){
cout<<"Yay!"<<"\n";
}
else{
cout<<":("<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin>>a>>b;
cout<<b<<a;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll N;
string s;
int main(){
cin>>N>>s;bool y=false;vector<ll>a(N);
for(ll I=0;I<2;I++){
for(ll J=0;J<2;J++){
a[0]=I;a[1]=J;
for(ll i=1;i<N-1;i++)
if((a[i]==1 && s[i]=='o')||(a[i]==0 && s[i]=='x')){
a[i+1]=1-a[i-1];
}else
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1E5;
bool isSheep[MAXN];
bool o[MAXN];
bool options[2] = {true, false};
bool isValid(int n)
{
bool firstSheep = isSheep[0];
for (int i = 1; i < n; i++)
{
if (isSheep[i] && o[i] || !isSheep[i] && !o[i])
{
isSheep... | 1 |
#include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define ss s.size()
#define sot(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define ii pair<int, int>
#define... | #include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
int main() {
long long int X;
cin >> X;
if (X % 11 == 0) cout << X / 11 * 2 << endl;
else if (X % 11 <= 6) cout << X / 11 * 2 + 1 << endl;
else cout << X / 11 * 2 + 2 << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <cmath>
#include <climits>
#include <cstdint>
#include <cstring>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - ... | #include <bits/stdc++.h>
using namespace std;
// これだとWAになる・・・
int main() {
int N, M;
cin >> N >> M;
map<int, int> waCountMap;
map<int, bool> acMap;
int p;
string s;
for (int i = 0; i < M; i++) {
cin >> p >> s;
if (acMap.find(p) == acMap.end()) {
if (s == "AC") {
... | 1 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
type... | #include<iostream>
#include<vector>
#include<algorithm>
const int INF = 1<<25;
using namespace std;
int main()
{
int n,m,i,j;
int cost[101][101],time[101][101];
for(;;)
{
cin >> n >> m ;
if(n==0 && m==0)
break;
for(i=0;i<m+1;i++)
{
for(j=0;j<m+1;j++)
{
if(i!=j)
cost[i][j]=time[i][j... | 0 |
int main() {
int a;
__builtin_scanf("%d", &a);
__builtin_printf("%d\n", static_cast<int>(__builtin_pow(a, 3)));
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int input;
cin >> input;
cout << input*input*input << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define eq equ... | #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, R;
cin >> N >> R;
if (N >= 10) cout << R << endl;
else cout << R + 100 * (10 - N) << endl;
} | 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdlib>
#include<cctype>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n... | #include <bits/stdc++.h>
using namespace std;
pair<int, int> nxt[256][256];
int main()
{
int h, w;
vector<pair<int, pair<int, int> > > v;
for (int i = 1; i <= 150; i++){
for (int j = i + 1; j <= 150; j++){
v.push_back(make_pair(i * i + j * j, make_pair(i, j)));
}
}
... | 1 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
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; (i)... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mo 1000000007
int i,j,k,m,n,x,y,z,S,Ans,ans,dp[41][1<<17];
inline ll Pow(ll x,ll d) {
ll ans = 1, y = x;
for (; d; y = y * y % mo, d >>= 1)d & 1 ? ans = ans * y % mo : 0;
return ans;
}
int main() {
cin >> n >> x >> y >> z;
S ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<ll> A(n);
rep(i,n) cin >> A[i];
sort(A.begin(),A.end());
rep(i,n-1){
if(A[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<string> s(N);
int g=0;
int ans=0;
string tans;
for(int i=0;i<N;i++){
cin>>s.at(i);
}
int M;
cin>>M;
vector<string> t(M);
for(int i=0;i<M;i++){
cin>>t.at(i);
}
for(int i=0;i<N;i++){
tans=s.at(i);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
void Fast()
{
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
}
inline int D()
{
int t;
scanf("%d",&t);
return t;
}
inline ll llD()
{
ll t;
scanf("%lld",&t);
return t;
}
... | 1 |
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
long long streaks = 0;
long long max_streaks = 0;
for (auto s : S) {
if (s == 'R') {
++streaks;
}
else {
max_streaks = max(streaks, max_streaks);
streaks = 0;
}
}
max_streaks = max(s... | #include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
if ((s[0] == 'R') && (s[1] == 'R') && (s[2] == 'R')) {
cout << "3";
}
else if (((s[0] == 'R') && (s[1] == 'R')) || ((s[1] == 'R') && (s[2] == 'R'))) {
cout << "2";
}
else if (s[0] == 'R' || s[1] == 'R... | 1 |
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int Solve(int N, int K) {
if (N % K == 0)
return 0;
else
return 1;
}
};
int main() {
int n, k;
cin >> n >> k;
Solution s;
cout << s.Solve(n, k) << endl;
return 0;
}
| #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define rep(n) for( int i = 0 ; i < n ; i++ )
#define REP(n) for( int i = 1 ; i <= n ; i++ )
#define repll(n) fo... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << end... | #include"bits/stdc++.h"
#include<cassert>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
const int mod = 1000000007;
const int inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int>PP;
int n;
int board[1005][1005];
void paint4(int ni, int nj) {
board[ni][nj] = 1;
board[ni][n... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 305;
ld dp[N][N][N];
bool mark[N][N][N];
int n;
ld solve(int t1, int t2, int t3) {
int t0 = n - (t1 + t2 + t3);
if (t0 == n)
return 0;
ld &ans = dp[t1][t2][t3];
if (mark[t1][t2][t3])
return ans;
mark[t... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n,q,count=0; cin>>n;
long long S[10001],T[501];
for(int i=0;i<n;i++) cin>>S[i];
cin>>q; bool x =false;
for(int j=0;j<q;j++) cin>>T[j];
for(int j=0;j<q;j++){
x=false;
for(int i=0;i<n;i++){
if(S... | 0 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
//#define INF (1e9+1)
#define INF (1LL<<59)
#define int ll
signed main(){
int v,e;
cin>>v>>e;
int d[101][101]... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n... | 1 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
class dice{
public:
int top, bottom, right, left, front, back;
void North();
void East();
void South();... | #include<iostream>
#include<cstdio>
using namespace std;
int main() {
int siz[6], damy;
char mozi[2];
for (int abc = 0; abc < 6; abc++) {
cin >> siz[abc];
}
fgets(mozi,2,stdin);
while(true){
fgets(mozi,2,stdin);
if (mozi[0] == '\n') {
cout << siz[0] << endl;
break;
}
switch (mozi[0]) {
case 'S':... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
int main () {
int a,b,n,i;
char c;
string str,s,f,g;
cin >> str;
cin >> n;
for(i=1;i<=n;i++){
cin >> s >>a >> b;
if(s[2]=='i'){cout << str.substr(a,b-a+1) << endl;}
else if(s[2]=='v'){
f=str.substr(a,b-a+1... | /***
Muhammad Imdad-Ul-Haque Rakib(Attari)
CSE'19
Chittagong,Bangladesh
***/
#include<bits/stdc++.h>
/**Definitions**/
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb pu... | 0 |
#include<stdio.h>
int main()
{
int D,T,S;
scanf("%d%d%d",&D,&T,&S);
if((T*S) >= D)printf("Yes");
else printf("No");
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
if(N%K!=0){
cout<<1<<endl;
}
else{
cout<<0<<endl;
}
} | 0 |
#include<iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include<map>
#include<cstring>
#include<iomanip>
#include <string>
#include <vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long unsigned llu;
typedef long double ld;
#define ll long long
#define PI 3... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int kai(int a) {
int n = 0;
while (1) {
if (a % 2 == 0) {
a = a / 2;
n++;
}
else break;
}
return n;
}
int main() {
int N;
cin >> N;
vector<int> A(N);
int count = 100000;
for (int i = 0; i < N; i++) {
cin ... | 1 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,m;
for(;;){
scanf("%d%d",&n,&m);
if(n==0&&m==0)break;
vector<int> ns(n+1);
for(int i=0;i<n;i++){
scanf("%d",&ns[i]);
}
ns[n]=0;
vector<int> ntwos;
... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N,Q;
while( cin >> N >> Q, N||Q ){
vector<int> date(100, 0);
for(int i = 0; i < N; i++){
int m;
cin >> m;
for(int j = 0; j < m; j++){
int a;
cin >> a;
... | 0 |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#de... | #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 n, m;
cin >> n >> m;
int all_path[2];
all_path[0] = 1;
all_path[1] = n;
rep(i, m){
int l, r;
cin >> l >> r;
if(all... | 0 |
#include <iostream>
#include <string>
using namespace std;
class DICE {
public:
int top;
int bottom;
int right;
int left;
int front;
int back;
void South();
void North();
void East();
void West();
};
void DICE::South() {
int kari = front;
front = top;
top = back;
back = bottom;
bottom = kari;
}
void ... | #include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
for(int i = 0; i < s.size()-1; i++){
if(s[i]=='A'&&s[i+1]=='C'){
cout << "Yes" << endl;
exit(0);
}
if(s[i]=='a'&&s[i+1]=='c'){
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional... | #include <bits/stdc++.h>
using namespace std;
const int N = 610;
int n, col[N][N], cnt[3];
vector<pair<int,int>> diff;
void dfs(int x, int y, int c) {
if (x >= 0 && x < 2*n && y >= 0 && y < 2*n && col[x][y] == 0) {
col[x][y] = c;
cnt[c]++;
for (auto d : diff) dfs(x+d.first, y+d.second, 3-... | 1 |
#include <cstdio>
#include <string>
using namespace std;
int main(void)
{
int n;
scanf("%d", &n);
while(n-- > 0){
int base[3] = {0};
int score = 0;
char s[10];
int out = 0;
while(out < 3){
scanf("%s", s);
string str = s;
if(str == "HIT"){
if(base[2] == 1) score++;
base[2] = base[1];
... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string str;
int n;
int E=0,out=0,score=0,base=0;
cin >> n ;
for(;;)
{
if(E==n)
break;
cin >> str ;
if(str=="OUT")
{
out++;
}
else if(str=="HIT")
{
base++;
if(base==4)
{
score++;
base--;
}
}
else
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long best = 0;
long long curr = 0;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
long long mul = n / i;
long long digs_i = floor(log10(i) + 1);
long long digs_mul = floor(log10(mul) + 1);
... | #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 - 1; i >= 0; i--)
const ll INF = 1000000000;
//const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
int k;
cin>>k;
cout<<a[0]+a[1]+(a[2]<<k);
}
| #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LO... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
#define ll long long
char a[N];
int main(){
int n,q,k;
scanf("%d\n",&n);
scanf("%s",a);
scanf("%d",&q);
while(q--){
scanf("%d",&k);
ll nowd=0,nowm=0,cnt=0;
ll sum=0;
for(int i=0;i<n;i++){
if(i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string str;
int num,rest=0,result=0;
cin>>str;
for(long int i=str.size()-1;i>=0;i--){
num=str[i]-'0'+rest;
if(num<(10-num) || (num==5 && str[i-1]<'5')){
rest=0;
result+=num;
}
else{
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),p... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
int people[100005][4];
int sum[100005];
int main(){
int N;
scanf("%d", &... | 1 |
#include<iostream>
using namespace std;
int member[1000];
bool cp[1000][1000];
int main(){
int n,q;
while(cin>>n>>q,n){
for(int i=0;i<1000;i++)member[i]=0;
for(int i=0;i<1000;i++)
for(int j=0;j<1000;j++)cp[i][j]=0;
for(int i=0;i<n;i++){
int num;
cin>>num;
int tmp;
for(int j... | #include<iostream>
using namespace std;
int dy[4]={-1,0,1,0};
int dx[4]={0,1,0,-1};
int t[200][200],vd[200][200];
int W,H,sx,sy,gx,gy,n,key;
bool inField(int y,int x){
if(y<0||y>=H)return false;
if(x<0||x>=W)return false;
return true;
}
bool solve(int y,int x){
if(y==gy&&x==gx)return true;
for(int i=0;i<4;i... | 0 |
#include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
typedef long double ld;
// loop
//#define For(i, l, r, x) for (int i = l; i < r; i+=x)
//#define ForE(i, l, r, x) for (int i = l; i <= r; i+=x)
//#define Ford(i, r, l) for (int i = r; i > l; i--)
//#define FordE(i, r, l) for (... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
string S[100];
int main()
{
int A, B;
cin >> A >> B;
f... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for ... | #include<iostream>
#include<set>
using namespace std;
int main() {
int n;
while(cin>>n && n!=0) {
set<pair<int, int> > mySet;
for(int i=0; i<n; i++) {
int x, y;
cin>>x>>y;
mySet.insert(make_pair(x, y));
}
int m;
cin>>m;
int nowX = 10, nowY = 10;
string dir;
int mo... | 0 |
#include<stdio.h>
#include<string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
#define NIL -1
#define N 500001
//struct Node{
// int val;
// Node *p, *l, *r;
//};
struct Node {
int val;
Node *p, *l, *r;
Node(int v)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int name1,name2,name3;
cin >>name1>>name2;
name3=name2*2-name1;
cout<<name3<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
// Thousand "Hello World"
int R, G;
cin >> R >> G;
if (R + ((G - R) * 2) / 2 == G){
cout <<R + ((G - R) * 2) << endl;
}
else{
cout << (R - G) * -1 << endl;
}
}
| 1 |
#include<iostream>
using namespace std;
#define MAX 100
static const int dx[4] = {1, 0, -1, 0};
static const int dy[4] = {0, -1, 0, 1};
int w, h, sx, sy, gx, gy, G[MAX+2][MAX+2];
bool dfs( int x, int y, int color ){
if ( color == 0 || G[x][y] != color ) return false;
if ( x == gx && y == gy ) return true;
G[x][y] = ... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T b) {
if(a >= b) return false;
a = b;
... | 0 |
// abc141_f
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(... | #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 main() {
register int i, j = 0, k = 0;
scanf("%d%d", &N, &M);
for(i = 1; i <= M; ++i)
scanf("%d", A + i);
if(M == 1) {
if(A[1] == 1) return ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int p, q, r;
cin >> p >> q >> r;
int ans = min(p+q, min(q+r, r+p));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#include <unordered_map>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_... | #include<iostream>
#include<cstdio>
using namespace std;
int x,y;
int main()
{
scanf("%d%d",&x,&y);
int ans=0;
if(x==1) ans+=30;
else if(x==2) ans+=20;
else if(x==3) ans+=10;
if(y==1) ans+=30;
else if(y==2) ans+=20;
else if(y==3) ans+=10;
if(x==1&&y==1) ans+=40;
ans*=10000;
printf("%d",ans);
return 0;
} | 0 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int l = s.length();
if(l==3)
reverse(s.begin(),s.end());
cout<<s<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string t;
cin>>t;
reverse(t.begin(),t.end());
t+='0';
ll ch[1000010][2];
for(ll i=0;i<1000010;i++){
for(ll j=0;j<2;j++){
ch[i][j]=INF;
}
}
ch[0][0]=0;
for(ll i=0;i<t.size();i++){
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
long n,m,p[1001];
while(cin>>n>>m,n||m){
for(int i=1;i<=n;++i) cin>>p[i];
p[0]=0;
vector<long> s(0);
for(int i=0;i<=n;++i){
for(int j=0;j<=n;++j) s.push_back(p[i]+p[j]);
}
sort(s.begin(),s.end(... |
//Nayeem Shahriar Joy ,Applied Physics And Electronic Engineering , University of Rajshahi.
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int m, d, w;
int days[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string weekName[7] = {"... | 0 |
#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;
cin >> n;
vector<ll> a(n);
map<ll, int> nums;
rep(i, n) {
cin >> a[i];
nums[a[i]]++;
}
sort(a.rbegin(), a.rend());
int ans = 0, i = 0;... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> static void ge... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
/* Input */
int K;
string S;
cin >> K;
cin >> S;
/* Main Logic */
if ((int)S.size() <= K) {
cout << S << endl;
return 0;
} else {
cout << S.substr(... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int M = 1000000007;
int mod(int a){
return (a%M + M)%M;
}
int mul(int a, int b){
return mod(mod(a) * mod(b));
}
int add(int a, int b){
return mod(mod(a) + mod(b));
}
int sub(int a, int b){
return mod(mod(a) - mod(b));
}
main(){
int n; cin>>n;
i... | #include <bits/stdc++.h>
#define nl '\n'
using namespace std;
typedef long long ll;
void solve() {
int N;
cin >> N;
int A[N];
for (int& i: A) cin >> i;
ll ans = 0;
const int mod = 1e9 + 7;
int suff[N] = {0};
suff[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
suff[i] = (A[i] + suff[i + ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, A, B;
cin >> N >> A >> B;
vector<int> X(N);
for ( int i = 0; i < N; i++ ) cin >> X.at(i);
long long ans = 0;
for ( int i = 0; i < N-1; i++ ) {
int dist = X.at(i+1) - X.at(i);
long long walk_cost = (long lon... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> in... | 1 |
#include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> ... | #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 dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int H, W;
cin >> H >> W;
vector<string> Graph(H);
rep(i,H) cin >> Graph.at(i);
... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(ll i = 0;i < n;++i)
const ll mod = 1000000007;
const int INF = 1001001001;
int main(){
int n,k;
cin >> n >> k;
vector<int> x(n);
rep(i,n) cin >> x[i];
int ans = INF;
rep(i,n-k+1) {
ans = min(ans... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647
// MAX O(n) 10^18
int main() {
int N, L;
cin >> N >> L;
int orderL = L;
int orderR = L + N - 1;
int eat... | 0 |
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
#define rep(i,n) for(int i=0;i<(n);++i)
int main() {
int N, M; cin >> N >> M;
int in[N];
vvi edge(N, vi());
rep(i, N) in[i] = 0;
rep(i, N-1+M) {
int a, b; cin >> a >> b;
--a;... | #include<bits/stdc++.h>
using namespace std;
int main(){
int k,x;
cin >> k >> x;
k--;
for (int i = x - k; i < x+k;i++){
cout << i << " " << flush;
}
cout << x + k << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans =0;
if(s == "RRR"){ans = 3;}
if(s == "RRS"){ans = 2;}
if(s == "RSR"){ans = 1;}
if(s == "SRR"){ans = 2;}
if(s == "RSS"){ans = 1;}
if(s == "SRS"){ans = 1;}
if(s == "SSR"){ans = 1;}
if(s == "SSS"){ans = 0;}
cout <... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
string s;
cin>>s;
map<char,int> m;
for(char c : s)
{
m[c]++;
}
for(char c='a';c<(char)('a'+26);c=(char)(c+1))
{
if(m[c]==0)
{
cout... | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
static const int NIL = -1;
struct Vertex {
vector<int> link;
int parent = NIL;
int ord;
int lowlink;
bool is_visit = false;
};
class ArticulationPoint {
private:
int n;
vector<Vertex> graph;
int timer = 1;
publ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#... | 1 |
//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... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<int> s(M);
vector<int> c(M);
int ans=0;
if(M == 0 && N==1){
cout << "0" << endl;
return 0;
}
for(int i=0; i<M; i++){
cin >> s.at(i) >> c.at(i);
if(N>1 && s.at(i) =... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// Sum of digits in base 10 is a multiple of D
ll generate(ll depth, ll sum, bool tight, ll D, const string& digits, vector<vector<vector<ll>>>& memo) {
if (d... | /// IN THE NAME OF METAL
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define sz(x) (ll) x.size()
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MX = 500;
int h, w;
int grid[MX][MX];
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
bool valid(int x, int y) {
return (x >= 0 && x < h && y >= 0 && y < w);
}
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> h >>... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
//for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else co... | 1 |
#include<algorithm>
#include<cstdio>
#define s(A,B) std::sort(A,B);
int main(){
int W[10],K[10],p;
for(int i=0;i<20;i++)
scanf("%d",&p),(i<10)?W[i]=p:K[i-10]=p;
s(W,W+10);
s(K,K+10);
int Wp=W[7]+W[8]+W[9],Kp=K[7]+K[8]+K[9];
printf("%d %d\n",Wp,Kp);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
rep(i, n) cin >> x[i] >> y[i];
vector... | 0 |
#include <bits/stdc++.h>
#include <set>
#include <numeric>
#define rep(i,n) for (int i=0; i < (n); ++i)
#define all(a) a.begin(), a.end()
using ll = long long;
using namespace std;
// ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// const double PI = acos(-1);
// int gcd(int x, int y) { return (x % y)? gcd(y... | #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;
bool flg = true;
rep(i, s.size()){
if(i % 2 == 0 && s[i] == 'h' && s[i+1] == 'i') continue;
else if(i % 2 == 1) continue;
else{... | 1 |
#include<iostream>
#include<vector>
int main(void){
int n;
std::cin >> n;
std::vector<int> a(n+1), b(n+1);
a[0] = 0;
for(int i = 1; i <= n; i++){
std::cin >> a[i];
}
for(int i = n; i > 0; i--){
int cnt = 0;
for(int j = i; j <= n; j += i){
if(b[j] == 1) c... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(true){
int n; cin>>n;
if(!n) break;
int a[10]={};
for(int i=0;i<n;++i){
int c;
cin>>c;
++a[c];
}
for(int i=0;i<10;++i){
for(int j=0;j<a[i];++j) cout<<"*";
if(!a[i]) cout<<"-";
cout<<"\n";
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000, mod = 998244353, inv2 = (mod + 1) / 2;
int n, m, s, w, d, w2, ans;
int fac[maxn + 10], ifac[maxn + 10], inv[maxn + 10];
inline int add(int x, int y) {
x += y; return x < mod ? x : x - mod;
}
inline int dec(int x, int y) {
x -= y; return x < 0 ? ... | #include<bits/stdc++.h>
#define rg register
#define il inline
#define int long long
using namespace std;
typedef long long ll;
const int mod=1e9+7,O=200010;
il int gi(){
rg int o=0,fl=1;char ch=getchar();
while(!isdigit(ch)&&ch!='-')ch=getchar();
if(ch=='-')fl=-1,ch=getchar();
while(isdigit(ch))o=o*10+ch-'0',ch=get... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dob double
int main(){
string arr[14] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
string a;
cin>>a;
int ans = 0;
bool ok = false;
for (int i = 0; i<14; i++){
if (ok){
ans++;
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#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 tr... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
#define chmax(x, y) do { x = max(x, y); } while(0)
#define chmin(x, y) do { x = min(x, y); } while(0)
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#def... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<ty... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(... | #include<iostream>
#include<vector>
using namespace std;
#define INF 1980000001
int main(){
int V, E;
cin >> V >> E;
vector<vector<int> > A(V, vector<int>(V, INF));
for (int i = 0; i < V; i++) {
A[i][i] = 0;
}
for (int i = 0; i < E; i++) {
int s, t, d;
cin >> s >> t >> d;... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll S;
ll N = 1;
cin >> S;
while (S/(ll)pow(10,N)) {
//cout << pow(10,N) << endl;
//cout << S/pow(10,N) << endl;
//cout << N << endl;
N++;
}
//cout << N << endl;
ll ans = 1000;
... | #include <bits/stdc++.h>
#define LL long long
#define pb push_back
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='9';x=getchar())a=(a<<3)+(a<<1)+... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main()
{
int k,n;
double sum=0;
cin>>n>>k;
vector<double> p(n+1); //累積和
for(int i=1;i<=n;i++){
double a;
cin>>a;
a=(a+1)/2;
sum+=a;
p[i]=sum;
}
... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int N = (int)1e5 + 50, INF = (int)1e9;
int n, m;
map<int, vector<int> > G[N];
set<int> rem[N];
int dis[N];
deque<P> que;
void dfs(int v, int color, int d) {
// printf("in %d , color: %d\n", v, color);
rem[v].erase(color);
if(d ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
static const int MAX = 100000;
int n, num;
vector<int> V[MAX];
int prenum[MAX], lowest[MAX], parent[MAX];
bool B[MAX];
void dfs(int cur, int pre) { //dfs??¨?????????prenum, lowest, parent????¨????
prenum[cur] = lowest[cur] = ... | 0 |
#include <stdio.h>
#include <string.h>
#define HIT 1
#define HR 2
#define OUT 3
int main(void){
int outCnt, pt;
int runner; // use bits
char event[8];
int eventID;
int n;
bool endInning;
scanf("%d", &n);
for (int i=0; i<n; i++){
endInning = false;
outCnt = runn... | #include <iostream>
#include <string>
using namespace std;
int main() {
int point = 0, hits = 0, out = 0;
int n; cin >> n;
int i = 0;
while (i < n) {
string s; cin >> s;
if (s == "HIT") {
hits++;
if (hits == 4) {
point++;
hits--;
}
}
if (s == "OUT") {
out++;
if (out == 3) {
hi... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) ((v).begin(),(v).end())
#define COUT(x) cout<... | const int isDebugMode = 0;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0,... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m,v,p,i;
cin >> n >> m >> v >> p;
vector<long long> a(n);
for(i=0;i<n;i++){
cin >> a.at(i);
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
long long s;
s=n-1;
while(a.at(s)+m<a.at(p-1)){
s--;
}
s++;
lon... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll n, m, x, y;
cin >>... | 0 |
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int data[100];
int main(){
int n;
scanf("%d",&n);
for(int i = 0; i < n * (n - 1) / 2; i++){
int b[4];
for(int k=0;k<4;k++) scanf("%d",&b[k]);
if(b[2]>b[3]) data[b[0]-1]+=3;
if(b[2]<b[3]) data[b[1]-1]+=3;
if(... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
bool Cmp(pii a,pii b){
if(a.first>b.first){
return true;
}else{
return false;
}
}
int main(){
int n;
cin>>n;
vector<pii>team;
for(int j=0;j<n;j++) team.push_back(pii(0,j));
for(int i=0;i<(n*(n-1))/2;i++){
int ta,tb,sa,... | 1 |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
#include <sstream>
//#include <unordered_map>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORD(i, a, b) for(int i = (a-1); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
typedef long long int ll;
using namespace std;
... | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
void solve();
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
int dp[10000000+1][2];
void solve() {
string S; cin... | 1 |
#include <stdio.h>
#define mod 1000000007
typedef long long ll;
ll mul(ll a, ll b) {
return (a * b) % mod;
}
ll rev(ll a) {
ll ans = 1, b = mod - 2;
while(b) {
if(b & 1) ans = mul(ans, a);
a = mul(a, a), b >>= 1;
}
return ans;
}
ll sum(ll a) {
return a * (a + 1) / 2;
}
int main(void) {
ll i, j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
const int MAX = 510000;
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... | 1 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
#include<set>
#include<deque>
#include<iomanip>
#include<tuple>
#include<stack>
#define _USE_MATH_DEFINES
#include<math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define erep(n) for (ll i = 0; i <= n; ++i)
#define erep2(i,... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n, m;
cin >> n >> m;
int x[n+1], y[m+1];
cin >> x[0] >> y[0];
for(int i=0; i<n; i++) cin >> x[i+1];
for(int i=0; i<m; i++) cin >> y[i+1];
s... | #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... | 0 |
#include <stdio.h>
int main()
{
long long int n;
scanf ("%lld",&n);
char out[100]={0};
int i=0;
n--;
while(n>=0){
out[i]= n%26 +'a';
n/=26;
i++;
n--;
}
for(int j=i-1; j>=0; j--){
printf("%c",out[j]);
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define eq equ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
int X = max({A, B, C});
int Y = 1;
rep(i, K) Y *= 2;
cout << A + B + C + X * (Y - 1) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, sum=0;
vector<int> v1(3);
for(int i=0;i<3;i++)
{
cin>>v1[i];
}
cin>>k;
sort(v1.begin(),v1.end());
for(int i=1;i<=k;i++){
v1[2]=v1[2]*2;}
for(int i=0;i<3;i++)
{
sum+=v1[i];
}
cout<<sum<<"\n";
return 0;
}
| 1 |
//### In The Name Of GOD ###
//%% Remember; (((He))) is The (((Accepter))) %%
// GOD IS GREATER ...
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef long double ld ;
//#define int ll
#define pb push_back
#define bp pop_back
#define pf push_front
#define fp pop_front
#define X first
#de... | #include <bits/stdc++.h>
using namespace std;
signed main () {
int n, m, a;
cin >> n >> m;
map < int, int > pref;
int cur = 0;
++pref[cur];
int64_t ans = 0;
for (int i = 0; i < n; ++i) {
cin >> a;
(cur += a) %= m;
ans += pref[cur];
++pref[cur];
}
cout <<... | 0 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | #include <bits/stdc++.h>
using namespace std;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREP... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <algorithm>
#define rep(i, a, b) for (int i = (a), _ = (b); i <= _; ++ i)
#define per(i, a, b) for (int i = (a), _ = (b); i >= _; -- i)
#define For(i, a, b) for (int i = (a), _ = (b); i < _; ++ i)
#define ri rd<int>
usin... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x)
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define sz(x) int((x).size())
#define all... | 0 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
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) <... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<ll>>;
ll N,M;
int main(){
cin>>N>>M;
Graph G(N);
for(int i=0;i<M;i++){
ll u,v;cin>>u>>v;u--;v--;
G[u].push_back(v);
G[v].push_back(u);
}vector<ll>dist(N,-1);
ll a=0;ll b=0;ll c=0;
for(int i=0;i<N;i++){
if(... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int A, B, C, N;
int X[300];
int I[1000], J[1000], K[1000], L[1000];
int main()
{
while (true){
scanf("%d%d%d", &A, &B, &C);
if (A == 0 && B == 0 && C == 0)return 0;
scanf("%d", &N);
for (int i = 0; i < A + B + C; i++)X[i] = 2;
for (int i = 0; i < N; i+... | #include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin>>n,n!=0){
int sa=0,sb=0,a,b;
for(int i=0;i<n;i++){
cin>>a>>b;
if(a==b){
sa+=a;
sb+=b;
} else if(a>b){
sa+=a+b;
} else {
sb+=a+b;
}
}
cout<<sa<<" "<<sb<<end... | 0 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<tuple<int, int, int>>stx(N);
for (int n = 0;n<N;++n) {
cin >> get<1>(stx[n]) >> get<2>(stx[n]) >> get<0>(stx[n]);
}
sort(stx.begin(), stx.end());
set<pair<int, int>> d;
for (int i = 0, x; i < Q; ++i) {
cin >> x;
d... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef ... | 1 |
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
int n, minNum = 1010101, ans = 0;
cin >> n;
rep(i, n)
{
i... | #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()
void solve() {
int n;
cin >> n;
set<int> s;
for (int i = 0; i < n; i++) {
int t; cin >> t;
if (s.count(t)) s.erase(t);
else s.inser... | 0 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int N;
cin>>N;
int ans=1;
while(ans*ans<=N)ans+=1;
ans-=1;
cout<<ans*ans<<endl;
return 0;
} | #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 ll = unsigned long long int;
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
do {
double t... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,j,ans;
string s;
cin>>n>>s;
vector<vector<int>> z(2,vector<int>(n+1));
for(i=1;i<=n;i++){
for(j=0;j<2;j++) z.at(j).at(i)+=z.at(j).at(i-1);
if(s.at(i-1)=='E') z.at(0).at(i)++;
else if(s.at(i-1)=='W') z.at(1).at(i)++;
}
ans=n;
fo... | #include <iostream>
#include <string>
#include <cmath>
#include <set>
#include <utility>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.00001;
int main() {
int n;
cin >> n;
long long *a = new long ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin>>n>>m;
vector<pair<int,string>>v(m);
vec... | 1 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
double sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
int xx = x[i] - x[j... | 0 |
#include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
typedef long long ll;
... | #include <iostream> // cout, endl, cin
#include <cmath> //sqrt pow
#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> // in... | 1 |
#include <iostream>
#include <cstdlib>
using namespace std;
void print(int a, int b, char str[]);
void rev(int a, int b, char str[]);
void rep(int a, int b, char str[], char repstr[]);
int main()
{
char str[1000];
int orderlen;
cin >> str;
cin >> orderlen;
cin.clear();
cin.ignore();
for(int i=0; i<orderlen; i+... | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod=1e9+7;
signed main(){
string s;
cin>>s;
int n;
cin>>n;
for(int i=0;i<n;i++){
string t;
cin>>t;
int a,b;
cin>>a>>b;
if(t=="reverse")reverse(s.begin()+a,s.begin()+b+1);
if(t=="replace"){
string p;
ci... | 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>
using namespace std;
// #define int ll
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using si = set<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define dotc() int tcs; if (cin >> tcs) rep(tc, tcs)
#define sz... | 1 |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cassert>
#define ll long long
using namespace std;
inline ll read(){
ll re=0,flag=1;char ch=getchar();
while(ch>'9'||ch<'0'){
if(ch=='-') flag=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') re=(re<<1)+(re<<3)+ch-'0',... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
int sum1[105][105],sum2[105][105];
int f[2][105][105][105];
char s[105];
int main(){
int n,i,j,k,o,p,l,m;
int tx,ty;
scanf("%d %d",&n,&m);
for(i=1;i<=n... | 0 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int, int>;
/* 大文字を小文字に変換 */
char tolower(char c) {return (c + 0x20);}
/* 小文字を大文字に変換 */
char toupr(char c) {return (c - 0x20);}
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
... | #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 <bits/stdc++.h>
#define F(i, a, b) for (ll i = a; i <= b; i ++)
#define G(i, a, b) for (ll i = a; i >= b; i --)
#define out4(x, y, z, w) { if (debug) printf(#x" = "),W(x),printf(" "#y" = "),W(y),printf(" "#z" = "),W(z),printf(" "#w" = "),W(w),putc('\n'); }
#define out3(x, y, z) { if (debug) printf(#x" = "), W... | #include <bits/stdc++.h>
using namespace std;
inline int gi()
{
char c = getchar();
while(c < '0' || c > '9') c = getchar();
int sum = 0;
while('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
return sum;
}
typedef long long ll;
const int maxn = 100005;
int n, s, x[maxn];
ll ans, p[maxn];
int mai... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n, q;
cin >> n >> q;
... | 1 |
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typedef... | #include<cstdio>
int sima(int x,int y);
char SIMA[14][14];
int main ()
{
while(scanf("%s",SIMA[1]+1)!=EOF){
int i,j,ans=0;
for(i=2;i<13;i++){
scanf("%s",SIMA[i]+1);
}
for(i=1;i<13;i++){
for(j=1;j<13;j++){
if(SIMA[j][i]=='1'){
... | 1 |
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<time.h>
#include<sstream>
#define MINN -1e8
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ... | #include <stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <queue>
#include <set>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
long long int MOD = 1e9 + 7;
int main(){
// read problem
long long int N;
std::string Stmp;... | 1 |
#include <iostream>
using namespace std;
int main() {
long long N, A, B;
cin>>N>>A>>B;
long long arr[N];
for (int i=0; i<N; i++){
cin>>arr[i];
}
long long sum=0;
for (int i=0; i<N-1; i++){
if (A*(arr[i+1]-arr[i])>B){
sum += B;
}
else sum += A*(arr[i+1]-arr[i]);
}
cout << sum << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (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 false;... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <numeric>
#define ll long long
#define wolfe ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define elif else if
using namespace std;
int main () {
wolfe;
int n;
cin >> n;
int sum = 0;
while(n>=500) {
... | #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(){
ll n;
vector <ll> a(5);
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
vector <ll> z(6,0);
z[0]=n;
rep(i,4){
a[i+1]=min(a[i],a[i+1]);
... | 0 |
#include<iostream>
#include<map>
#include<string>
#include<algorithm>
using namespace std;
int main(){
map<string,int>s;
map<string,int>t;
int n,m;
cin>>n;
string str;
for(int i=0;i<n;i++){
cin>>str;
s[str]++;
}
cin>>m;
for(int i=0;i<m;i++){
cin>>str;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
const int dx = tx - sx, dy = ty - sy;
// print string(how many, what)
cout << string(dy, 'U') << string(dx,... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.