code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5, mod = 1e9 + 7;
int tr[8][2], f[maxn + 10][8], n;
char s[maxn + 10];
int main() {
tr[0][0] = 1; tr[0][1] = 2;
tr[1][0] = 3; tr[1][1] = 4;
tr[2][0] = 5; tr[2][1] = 6;
tr[3][0] = 1; tr[3][1] = 1;
tr[4][0] = 1; tr[4][1] = 2;
tr[5][0] = 7; tr[5][1] = ... | #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 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
string str;... | # include <iostream>
# include <deque>
using namespace std;
string X;
deque<char> dchar;
int main()
{
cin>>X;
for (int i=0; i<X.size(); i++)
{
dchar.push_back(X[i]);
if (dchar.size()>=2 && dchar[dchar.size()-2]=='S' && dchar[dchar.size()-1]=='T')
{
dchar.pop_back();
... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(void){
int N, x, ans=0;
std::cin >> N >> x;
std::vector<int> a(N);
for (int i=0; i<N; ++i){
std::cin >> a.at(i);
}
std::sort(a.begin(), a.end());
for (int i: a) {
x -= i;
if (x < 0){
br... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<ll,ll>;
#define For(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) ((ll)x.size())
#define MOD (ll)(998244353)
#define INF (9e18)
#define EPS (1e-6)
#ifdef LOCAL_TEST
#define deb... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().coun... | //hail to jwalaji
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
int main(){
//ios::sync_with_stdio(false);
//cin.tie(NULL);
//lli t;
//cin>>t;
//while(t--){
lli n;
cin>>n;
vector<lli> arr(n),store(n);
for(lli i=0;i<n;i++){
cin>>arr[i];
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
ll N; cin >> N;
ll ans = 0;
for(ll i = 1; i <= N; i++){
if( i%3 == 0 || i%5 == 0){
} else {
ans += i;
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; ++i)
{
cin >> a >> b;
v.push_back({a, b});
}
vector<vector<ll>> dp(n, vector<ll>(n, -1));
function<ll(int... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using vvi = std::vector<std::vector<int>>;
void solve()
{
using namespace std;
constexpr int inf = (1 << 23);
int n;
cin >> n;
vector<int> d(n + 1);
for (int i = 0; i < n; ++i)
{
cin >> d[i];
... | 1 |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
//C++11
#if __cplusplus == 201103L
#include <tuple>
#endif
using na... | #include <iostream>
#include <string>
using namespace std;
int k = 0, sum = 0, a[1000000];
string s;
int main() {
cin >> s;
for(int i = 0; i < s.size(); i++){
sum++;
if(s[i] != s[i + 1]){
for(int j = i - sum + 1; j <= i; j++){
a[j] = sum;
sum--;
}
sum = 0;
}
}
for(int i = 0; i < s.size(... | 1 |
/**
DufauX-XuafuD
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
int64_t modpow(int64_t x, int64_t n) {
const int MOD = 998244353;
x = x%MOD;
if(n==0) return 1; //再帰の終了条件
else if(n%2==1) {
return (x*modpow(x, n-1))%MOD; //nが奇数ならnを1ずらす
}
else return modpow((x*x)%MOD, n/2)%MOD; //nが偶数ならnが半分になる
}
int ma... | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gpu_hash_map<int,... | 0 |
#include <bits/stdc++.h>
#define lid id << 1
#define rid id << 1 | 1
using namespace std;
const int MAXN = 2e5 + 5;
const int INF = 1e9;
int h, w, a[MAXN], L[MAXN], R[MAXN], ans[MAXN];
template <class T>
void read(T &x, T f = 1, char ch = getchar()) {
x = 0;
while (ch < '0' || ch > '9') f = (ch == '-' ? -1 :... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
long long l[n];
for (int i = 0; i < n; ++i) cin >> l[i];
sort(l, l + n);
int cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (l[i] == l[j]) continue;
for (int k = j +... | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
vo... | // J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
string s;
cin >> s;
for (int i... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n, k;
cin >> n >> k;
k--;
cout << n - k << endl;
} | #include <iostream>
#include <numeric>
#include <math.h>
#include <algorithm>
#include <float.h>
#include <limits>
#include <vector>
#include <string.h>
#include <iomanip>
#define rep(i,a,n) for(ll int (i) = (a);(i) < (n);(i)++)
#define urep(i,a,n) for(ll int (i) = (a);(i) > (n);(i)--)
#define MOD 1000000007
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... |
// D - Make Them Even
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
struct Cell {
int y;
int x;
int c;
};
struct Move {
int y1;
int x1;
int y2;
int x2;
};
int field[500][500];
Cell cells[5... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int hour;
int min;
int t1, t2, t3;
t3 = h2 * 60 + m2;
t2 = t3 ... | #include<cstdio>
#include<iostream>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
char sep[2] = {' ', '\n'};
int main() {
int i, j, k;
int n;
int a[110];
cin >> n;
rep(i, n) cin >> a[n - i - 1];
rep(i, n) cout << a[i] << sep[(i == n - 1)];
co... | 0 |
#include <iostream>
#include <math.h>
using namespace std;
int insertionSort(int, int, int);
void shellSort(int* , int);
int cnt = 0;
int main(void)
{
int A[1000000], N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
shellSort(A, N);
}
int insertionSort(int A[], int n, int g)
{
int v, j, cnt = 0;
for (... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(fa... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstring>
#include<cmath>
#include <numeric>
#include<queue>
#include<climits>
#include<cstdio>
#include<map>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#def... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a, b, c;
cin >> a >> b >> c;
if (a.at(a.size() - 1) == b.at(0) && b.at(b.size() - 1) == c.at(0))
{
puts("YES");
}
else
{
puts("NO");
}
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string S;
cin >> S;
bool ans = true;
//1
if (S[0]!='A') ans = false;
//2
int Ccnt = 0;
for (int i = 2; i <= S.length()-2; i++) {
if (S[i]=='C') Ccnt++;
}
if (Ccnt!=1) ans = false;
//3
int CpCnt = 0;
for (int i =... | 0 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
int k, n;
int main() {
DAU
cin >> k >> n;
for (int i = n - k + 1; i < n + k; ++i)
cout << i << ' ';
PLEC
}
| #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
voi... | 0 |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(){
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
if (x1 == x2){
cout << setprecision(12) << fabs(y1 - y2) << endl;
}
else if (y1 == y2){
cout << setprecision(12) << fabs(x1 - x2) << endl;
}
else {
cout << setprec... | #include <iostream>
#include <math.h>
#include <cstdio>
using namespace std;
int main(){
double x1, y1, x2, y2;
double ans;
cin >> x1 >> y1 >> x2 >> y2;
ans = pow((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1), 0.5);
printf("%.8f\n", ans);
return 0;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) n... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; cin>> n;
vector<ll> a(100000);
set<ll> memo;
for(int i=0; i<n; i++){
cin >> a[i];
if(memo.count(a[i])){
memo.erase(a[i]);
}else{
memo.insert(a[i]);
}
}... | 0 |
#include <iostream>
using namespace std;
int main(void){
int n;
cin>>n;
while(n--){
int out = 0;
int first=0,second=0,third=0,score=0;
while(out < 3){
string s;
cin>>s;
if(s == "HIT"){
score += third;
third = second;
second = first;
first = 1;
}
else if(s == "HOMERUN"){
sco... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin>>n;
string event;
getline(cin,event,'\n');
int i=0,out,b,score;
while(n>0){
out = 0;
b = 0;
score=0;
while(out<3){
getline(cin,event,'\n');
if(event=="HIT"){
b*=2;
b+=1;
if(b>8){
b-=8;
score+... | 1 |
#include<iostream>
#include <stdio.h>
#include<string>
using namespace std;
int main(){
int n;
string line;
scanf("%d ",&n);
for(int x=0;x<n;x++){
getline(cin,line);
while (line.find("Hoshino") != string::npos) {
line.replace(line.find("Hoshino"), 7, "Hoshina");
}
cout << line << endl;
}
return 0... | #include <iostream>
#include <algorithm>
#include <stdio.h>
static const int MAX = 200000;
using namespace std;
int bubbleSort(int a[], int n){
int sw = 0;
bool flag = 1;
for(int i = 0; flag; i++){
flag = 0;
for(int j = n -1; j >= i + 1; j--){
if(a[j] < a[j-1]){
swap(a[j], a[j-1]);
... | 0 |
#include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main() {
int R;
double ans;
cin >> R;
ans = R * PI * 2;
cout << ans << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <functional>
template<typename T> struct segment_tree {
private :
int N;
std::vector<T> value;
public :
const std::function<T(T, T)> op;
const T id;
segment_tree(const std::vector<T>& a, const std::function<T(T, T)>& f, const T& t) : op(f), id(t) {
int n = a.size(... | #include <bits/stdc++.h>
#include <atcoder/all>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pa... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//const int INF = 2e9;
//const ll INF = 9e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
if (N==1){
cout << M << "\n";
return 0;
}
vector<int> div;
for (int i=1;i*i<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long n, l;
cin >> n >> l;
long long n_sum = n*l + n*(n-1)/2;
long long min_delta = 1e12;
long long minv;
for(long long i = 0; i < n; i++){
long long sum = n_sum - (l+i);
if(min_delta > abs(n_sum - sum... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int min = INT32_MAX;
int flavor = 0;
for (int i = 1; i <= n; ++i) {
if (abs(i + l - 1) < abs(min)) {
min = i + l - 1;
}
flavor += i + l - 1;
}
flavor -= min;
cout << f... | 1 |
#include <iostream>
#include <string>
using namespace std;
int const NMAX = 1e5;
int v[1 + NMAX];
int main() {
int n, pos = 1, p = 1e9, ans = 1e9;
string bigG;
cin >> n;
if(n <= 100 * (n / 100) + 10 * (n / 100) + 1 * (n / 100)){
cout << 100 * (n / 100) + 10 * (n / 100) + 1 * (n / 100);
}else{
cout... | #include <iostream>
using namespace std;
int main(){
int n; cin >>n;
for(int i = n; i < 1000; i++){
if(i % 111 == 0){
cout << i << endl;
return 0;
}
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";... | #include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstdio>
using names... | 0 |
//g++ -std=c++14 test.cpp -o test.out
//問題URL:
//https://atcoder.jp/contests/arc100/tasks/arc100_b
//参考：
// https://drken1215.hatenablog.com/entry/2018/08/28/193000
// ポイント：理想の状況がどういう時かを考える
// Max-minが最小になるのはどういう時？
// →PQSTどれ2つをとっても、差ができるだけ小さくなっているはず
// （あえて大きくしてもいいが、それだとMax-minが大きくなってしまう危険をはらんでいる上に、
// Max-minをもっと小さ... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <limits>
#include <set>
#include <map>
#include <functional>
#include <inttypes.h>
#include <limits.h>
#include <stdint.h>
#include <s... | 1 |
#include<bits/stdc++.h>
#define Bye return 0
#define ll long long
using namespace std;
void solve(){
int n; cin>>n;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
int next = a[0];
int cont = 1;
for (int i=1; i<n; i++){
if(a[i]<=next){
next = a[i];
cont++;
... | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i] *= -1;
}
vector<int> seq(N, 1 << 30);
for (int i = 0; i < N; ++i) {
*lower_bound(seq.begin(), seq.end(), A[i] + 1) = A[i];
}
cout... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int A[100],N;
cin >> N;
for (int i=0;i<N;i++) {
cin >> A[i];
}
int count = 0;
int flag = 1;
while(flag) {
flag = 0;
for (int i=N-1;i>0;i--) {
if (A[i] < A[i-1]) {
count++;
int tmp = A[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int t[N];
for (int i=0; i<N; i++)
cin >> t[i];
long ans = 0, start = t[0], prev = t[0];
for (int i=1; i<N; i++) {
if (t[i]>prev+T) {
ans += prev+T-start;
start = t[i];
}
prev = t[i];
}
ans +=... | 0 |
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x); i<=(y); i++)
#define ll long long
#define ld long double
#define inf 1000000000
#define N 100005
int n,s; ll a[N],b[N],ans;
int main(){
scanf("%d%d",&n,&s);
rep (i,1,n) scanf("%d%d",&a[i],&b[i]);
int l=1,r=n; ans=0;
while (l<=r){
if (s<=a[l]){ ans+=a[r]-s... | #include<iostream>
#include<string>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
string a_tmp, b_tmp;
string ch = to_string(i);
for (int j = 0; j < ch.size(); j++) {
a_tmp.push_back(char(ch[j]));
b_tmp.push_back(char(ch[ch.size() - j-1]));
}
... | 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1... | #include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
int N; cin >> N;
vi A(N);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int left = l;
int right = l + n - 1;
int eat = 0;
if (left >= 0) {
eat = left;
} else if (right <= 0) {
eat = right;
} else {
eat = 0;
}
int ans = ((left + right) * n / 2... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s1, s2;
void solve() {
int dp[s1.size() + 1][s2.size() + 1];
for (int i = 0; i <= s1.size(); i++) {
dp[i][0] = i;
}
for (int i = 0; i <= s2.size(); i++) {
dp[0][i] = i;
}
for (int i = 1; i <= s1.size(); i++) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000005;
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;
}
int n;
char s[maxn], t[maxn];
int ans, l, ... | 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 a,b,c,d,e,k;
cin>>a>>b>>c>>d>>e>>k;
bool dis=true;
if(e-a>k){
dis=false;
}
if(dis){
cout<<"Yay!"<<endl;
}
else{
cout<<":("<<endl;
}
} | #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 n=5;
vector<int> v(n);
rep(i,n) cin>>v[i];
int d; cin>>d;
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
if(v[j]-v[i]>d){cout << ":(" << endl; return 0;}
}
}
cout << "Yay!" <... | 1 |
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std:... | #include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
const int num = S.size();
string T;
for (int64_t tmp = 0; tmp < (1 << 3); tmp++) {
bitset<3> b(tmp);
int sum = S.at(0)-'0';
T = "";
for (int i = 0; i < 3; i++) {
if(b.test(0)){
sum += S.at(i+1)-... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll n, a, b, res;
int main() {
cin >> n;
vector<ll> s(n);
REP(i, n) {
cin >> a >> b;
s[i] = a + b;
res -= b;
}
sort(s.rbegin(), s.rend());
REP(i, n) res += s[i++];
cout << res << '\n';
return... | //g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>... | 1 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, m;
while(1){
scanf("%d%d", &n, &m);
if(n == 0 && m == 0)return 0;
int res = 0, tmp;
vector<int> points, points2;
for(int i = 0;i < n;i++){
scanf("%d", &tmp);
if(tmp < m)points.push_back(tmp... | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> outp;
int icn;
int icd;
int g;
vector<int> ice;
for(g = 0;;g++){
vector<int> ice(10,0);
cin >> icn;
if(icn == 0){
break;
}else{
for(int a = 0;a< icn;a++){
cin >> icd;
ice[icd] += 1;
... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for(int i=0;i<n;++i)
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", std... | 0 |
#include<iostream>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<cstdlib>
#include<typeinfo>
#include<sstream>
#include<list>
#include<set>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#de... | #include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1<<30;
int N,M;
int main(){
while(scanf("%d%d", &N,&M) && N||M){
vector<int>a,v;
a.push_back(0);
for(int i=0;i<N;i++){
int x;scanf("%d", &x);
a.push_back(x);
}
for(int i... | 1 |
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll =... | #define NguyenDangQuan the_author
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define mset(x, i) memset(x,i,sizeof(x))
#define elif else if
#define heap priority_queue
#define fi first
#define se second
#define pb push_back
#define ld long double
#define ll long long
#define ull unsigned long long
#defin... | 1 |
//Author: Fuadul Hasan(fuadul202@gmail.com)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
int a,b;
cin>>a>>b;
cout<<max(a+(a-1),max(b+(b-1),a+b))<<endl;
return 0;
} | #include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | 0 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <iostream>
using namespace std;
int main(void){
int n,x,t;
int ans;
cin >> n >> x >> t;
ans = t * ((n+x-1)/x);
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
// statics
using namespace std;
using int64 = long long;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
// init/input
#define int int64
#define INIT ios::sync_with_stdio(false);cin.tie(0);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int K;
string S;
cin>>K>>S;
int a=S.size();
if(a<=K){
cout<<S<<endl;
}
else{
for(int i=0;i<K;i++){
cout<<S.at(i);
}
cout<<"..."<<endl;
}
} | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int n;
while(cin >> n,n){
vector<int> key(n);
rep(i,n) cin >> key[i];
int x = 0;
string str;
cin >> str;
while(key.size() < str.size()){
if(x==key.size()) x = 0;
key.push_back(key[x])... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#defi... | 1 |
#include<bits/stdc++.h>
#define mp make_pair
#define endl "\n"
#define v vector
#define b begin()
#define e end()
using namespace std;
typedef long long ll;
typedef long l;
typedef long long unsigned ull;
int main(){
/*int t;
while(t--){
}*/
ll n;
cin>>n;
ll m = n/500;
ll q = m*1000;
... | #include <bits/stdc++.h>
#define all(c) c.begin(), c.end()
#define isz(c) (int)c.size();
using namespace std;
using ll = long long;
using vi = vector<int>;
int main(void)
{
int a, b;
cin >> a >> b;
b--;
a--;
cout << (a + b - 1) / a << endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
int main()
{
int K;
std::string S;
std::cin >> K;
std::cin >> S;
if (S.length() <= K) std::cout << S << std::endl;
else std::cout << S.substr(0, K) << "..." << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n)
{
i=m+n;
j=m-n;
k=m*n;
cout<<max(i,max(j,k))<<endl;
}
return 0;
} | 0 |
/** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
Copyright */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e5+5;
bool flg;
vector<ll> adj[N],col(N);
void dfs(ll node,ll clr){
if(col[node]!=0){
if(col[node]!=clr)flg=0;
return;
}
col[node]=clr;
for(auto &v:adj[node])dfs(v,-clr);
}
int main(){
ios_base:: sync_wit... | #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) <... | 1 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
//#include <unistd.h>
//#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(int n, string s) {
vector<int> w(n, 0), e(n, 0);
if(s[0] == 'W') {
w[0] = 1;
} else {
e[0] = 1;
}
for(int i=1;i<n;i++) {
if(s[i] == 'W') {
w[i] = w[i-1] + 1;
e[i] = e[i-1];
} else {
e[i] = e[i-1] + 1... | 1 |
#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 mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) i... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
typedef vector<int> ivec;
template<class T> inline bool chmax(T& a, T b) { if (a < ... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e10
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
unordered_map<char, string>cards;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | 0 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
bool solve(int x,int y,int c);
int ux[2][8]={{0,1,2,3,0,1,2,3},
{0,1,0,1,0,1,0,1}};
int uy[2][8]={{0,0,0,0,1,1,1,1},
{0,0,1,1,2,2,3,3}};
int dx[4]={0,1,0,-1};
int dy[4]={-1,0,1,0};
int w,h,n;
int b[105][105];
in... | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
string S[2002];
int P[2002][2002], A[2002][2002], B[2002][2002];
int main() {
if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
ios_base::sync_with_stdio(... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int dp[3010][3010];
int main(){
int n, time; scanf("%d %d", &n, &time);
vector<P> a(n);
for(int i = 0; i < n; i++) scanf("%d %d", &a[i].first, &a[i].second);
sort(a.begin(), a.end());
for(int i = 0; i < n; i++){
for(... | #include<bits/stdc++.h>
using namespace std;
const int N=102;
int gi() {
int x=0,o=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
}
int n,m,x,y,ans=0,sx[N][N],sy[N][N];
short f[N][N][N... | 0 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#define lc now<<1
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using pll = pair<ll, ll>;
int main(){
ll n, d;
cin >> n >> d;
vector<ll> a(n);
for(auto& i : a) cin >> i;
auto cost = [&](ll x, ll y){
return a[x] + a[y] + abs(x - y) * d;
};
vector<ll> l(n), r(n);
l[0] = 0;
... | 1 |
#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... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
vector<long long> divisor(long long n){//nの約数列挙
vector<long long> res;
for(long long i = 1; i * i <= n; i++){
if(n % i == 0){
res.push_back(i);
if(i != n / i) res.push_back(n / i);
... | 1 |
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision:... | #include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef struct {
int h;
int w;
int D;
} RECTANGLE;
RECTANGLE rectangle[30000];
bool cmp(const RECTANGLE& A, const RECTANGLE& B)
{
if (A.D == B.D){
return (A.h < B.h);
}
return (A.D < B.D);
}
int main()
{
int i, n;
for (int w = 2, i = 0; w <= 15... | #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 "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"
struct rect {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
int n = s.size();
if(s == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 << endl;
return 0;
}
if(n != 26) {
for(char a = 'a'; a <= 'z'; a++) {
if(count(s.begin(), s.end(), a) == 0) {
cout << s << a << en... | #include<stdio.h>
#define DAY 3
int main(void) {
int i;
int rain_cnt=0;
char weather[1000];
scanf("%s", weather);
if (weather[0] == 'R')rain_cnt++;
for (i = 1; i < DAY; i++) {
if (weather[i - 1] == 'R'&&weather[i]=='R')rain_cnt++;
if (weather[i - 1] == 'S' && weather[i] == 'R')rain_cnt = 1;
}
printf("%d", r... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | #include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
const ll mod = 1000 * 1000 * 1000 + 7;
ll Pow(ll x, ll n) {
ll result = 1;
while (n > 0) {
if (n % 2) ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp ma... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
if(s=="SUN") cout<<"7";
if(s=="MON") cout<<"6";
if(s=="TUE") cout<<"5";
if(s=="WED") cout<<"4";
if(s=="THU") cout<<"3";
if(s=="FRI") cout<<"2";
if(s=="SAT") cout<<"1";
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include "bits/stdc++.h"
using namespace std;
// Inserted snippets: io, root
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if ... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdlib>
using namespace std;
#define ALL(c) c.begin(),c.end()
#define RALL(c) c.rbegin(),c.rend()
#define REP(i,x,y) for(int... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, id[4001], p, s;
bool a[4001], f;
long long int t, u, b[4001];
while(1){
cin >> n;
if(n == 0){
break;
}
fill(a, a+4001, false);
fill(b, b+4001, 0);
p = 0;
for(int i = 0; i < n; i++){
cin >> s >> t >> u;
b[... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0;i<3;i++){
if(n%10==7){
cout << "Yes" << endl;
return 0;
}
n /= 10;
}
cout << "No" << endl;
} | 1 |
#include <bits/stdc++.h> // ver2.2.7
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,i) upper_bound(ALL(a),i)-lower_bound(ALL(a),i)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(5);
for (int i=0; i<5; i++) {
cin >> V[i];
}
int k;
cin >> k;
if (V[4]-V[0]>k) {
cout << ":(" << endl;
}
else {
cout << "Yay!" << endl;
}
}
| #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a<=k)cout << "Yay!" << endl;
else cout << ":(" << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=0;i<(n);i++)
typedef long long ll;
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res = res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#include <deque>
#define pb push_back
#define make ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
int n; cin>>n;
deque<int> d;
rep(i,n){
int a; cin>>a;
int p = lower_bound(d.begin(),d.end(),a) - d.begin();
if(p==0) d.push_front(a);
else d[p-1] = a;
}
cout << d... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int A, B, C;
int K;
cin >> A >> B >> C >> K;
int maxNum = max({ A, max({ B, C }) });
if (A == maxNum) {
for (int i = 0; i < K; i++) {
A = 2 * A;
}
}
else if (B == maxNum) {
for (int i = 0; i < K; i++) {
B = 2 * B;
}
}
... | 0 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
using namespace std;
using pii = pair<int,int... | #include<iostream>
#include<string>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
if (a.back() == b[0] && b.back() == c[0]) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
| 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N, L;
cin >> N >> L;
vector<int> as(N);
long long sum = 0;
for(int i = 0; i < N; i++) {
as[i] = L + i;
sum += as[i];
}
if(as[0] * as[N - 1] <= 0){
cout << sum << endl;
return 0;
}
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int>V;
for (int i = 0; i < N; i++) V.push_back(L + i);
sort(V.begin(), V.end());
int ans = 0;
auto result = find(V.begin(), V.end(), 0);
if (result != V.end()) {
for (int i = 0; i <... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int H, W;
bool check(int i, int j, int dx, int dy, vector<vector<int>> &field) {
int x = i + dx;
int y = j + dy;
return (x >= 0 && x < H && y >= 0 && y < W && (field[x][y] == -1));
}
int main() {
cin >> H >> W;
vector<vecto... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
int shiro=0;
cin>>h>>w;
vector<vector<char>> data(h+2, vector<char>(w+2));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>data.at(i+1).at(j+1);
if(data.at(i+1).at(j+1)!='#'){
shiro++;
}
}
}
for(i... | 1 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
int main() {
int n, m, d;
scanf("%d", &n);
scanf("%d", &m);
scanf("%d... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << c << " " << a << " " << b << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 1 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d; cin >> a >> b >> c >> d;
int e = a+b-c-d;
if(e>0)cout << "Left" << endl;
else if(e<0)cout << "Right" << endl;
else cout << "Balanced" << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
int w[4];
int main() {
for (int i = 0; i < 4; i++) {
cin >> w[i];
... | 1 |
#include<bits/stdc++.h>
using namespace std;
template<typename T>bool chkmax(T &a,T b){
if(a<b){a=b;return 1;}
else return 0;
}
template<typename T>T read(){
T x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
for(;isdigit(c);c=getchar())x=(x<<3)+(x<<1)+(c^48);
return x*f;
}
const int maxn=1<... | #include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 15;
int n, m;
int f[maxn][1 << maxn];
int edge[maxn][maxn];
int g[1 << maxn];
inline void up(int & x,int y) {
if(x < y) {
x = y;
}
}
int main() {
std::ios::sync_with_stdio(f... | 1 |
#include <bits/stdc++.h>
#define rep(i, ns, ne) for (int i = ns; i < ne; ++i)
using namespace std;
int main() {
long long n, x, a, b, tmp, ans = 0;
cin >> n >> x >> a;
rep(i, 0, n) {
if (i < n - 1) {
cin >> b;
} else {
b = 0;
}
if (a + b > x) {
tmp = a + b - x;
b = b - tm... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 |
#include<bits/stdc++.h>
using namespace std;
const long long maxn=1e7+5;
const long long inf=0x3f3f3f3f;
const long long mod=1e9+7;
long long n,m,a[maxn],b[maxn],cx[maxn],cy[maxn],px[maxn],py[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",s... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << ... | 0 |
#include <iostream>
#include <string>
using namespace std;
const int MOD = 1000000007;
int solve(const string& s){
const int N = s.size()/2;
long long res = 1;
int numS = 0, sumS = 0, inc = 0;
for(auto& c : s){
if(c == 'B'){
if(inc%2 == 0){
++inc;
+... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
ty... | #include<iostream>
#include<cmath>
#define int long long
using namespace std;
int32_t main()
{
double a,b;
cin>>a>>b;
double res=a*b;
cout<<res<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void)
{
string s;
cin >> s;
if (stoi(s) < 111)
cout << "111" << endl;
else if (s[0] == s[1] && s[1] == s[2])
cout << s << endl;
e... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans;
for(int i = n; i <= 999; i++){
if(i/100 == (i/10)%10 && i/100 == i %10){
ans = i;
break;
}
}
cout ... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int maxn=(1e5)+10;
const int mod=(1e9)... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
template<class T>
vector<pair<T, T>> PrimeFactorization(T n) {
vector<pair<T, T>> f;
for (T i = 2; i * i <= n; i++) {
T cnt = 0;
... | 1 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forenska(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define ... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<string>
using namespace std;
string str;
int main(void){
cin >> str;
int jc=0,oc=0,ic=0,res=0;
for(int i=0;i<str.size();i++){
if(str[i]=='J'){
if(oc>0 || ic>0)jc=0;
oc=0,ic=0;
jc... | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
int main(){
ll A,B;
cin>>A>>B;
if(A==1 && B==1){cout<<1000000<<endl;}
else{cout<<max((ll)0,100000*(4-A))+max((ll)0,100000*(4-B))<<endl;}
} | 0 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<list>
#include<queue>
#include<string.h>
#include<functional>
#include<stack>
#include<deque>
#include<string>
#include<limits.h>
#include<map>
#include<set>
#include<unordered_map>
#include<cmath>
#include<unordered_set>
#define int long... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
class Dice {
int num[6];
public:
void set(int n, int s) {
num[s] = n;
}
void move(char c) {
if (c == 'E') {
swap(num[0], num[3]);
swap(num[3], num[5]);
swap(num[5], num[2]);
}
else if (c == 'N') {
swap(num[0], num[1]);
swap(num[1],... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int a, b, c;
while (cin >> a >> b >> c) {
if ((a|b|c) == 0)
break;
int N;
cin >> N;
vector<int> aa(N), bb(N), cc(N), r(N);
for (int i = 0; i < N; ++i) {
cin >> aa[i] >> bb[i] >> cc[i] >> r[i];
--aa[i];
... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
const ll M = 1e9 + 7;
int main(void){
int n, m; bool ok = true;
scanf("%d %d", &n, &m);
vi as(n), bs(m), cs(n * m, 0); vector<bool> seen(n *... | 1 |
#include <iostream>
using namespace std;
int main(){
int A;
int B;
cin>>A>>B;
int holes=1;
int ans=0;
while(holes<B){
holes--;
holes+=A;
ans++;
}
cout<<ans;
} | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
I... | 1 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define lowbit(x) (x)&(-x)
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define per(i,a,b) for (int i=a;i>=b;i--)
#define maxd 9982... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int e;
while(cin >> e, e){
int ans = 1 << 30;
for(int z = 0; z * z * z <= e; z++){
int y = floor(sqrt(e - z*z*z));
ans = min(ans, e - y*y - z*z*z + y + z);
}
cout << ans << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#define INF 10000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
using namespace std;
typ... | 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>;
const int MAX = 100000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
//setp... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ll;
int main()
{
int... | 0 |
#include <iostream>
#include <memory>
#include <cmath>
constexpr int max_size()
{
return static_cast<int>(1e+6);
}
int insert(int* a, const int i, const int gear)
{
if (i < gear) {
return 0;
}
if (a[i - gear] <= a[i]) {
return 0;
}
std::swap(a[i - gear], a[i]);
return 1 +... | #include "bits/stdc++.h"
using namespace std;
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); i++ )
#define REP( i, n ) FOR( i, 0, n )
#define ALL( x ) (x).begin(), (x).end()
void shellSort( vector<int>& a );
void insertSort( vector<int>& a, int h );
void printArray( vector<int>& a );
int main() {
int n; ci... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N,A,B;
int i;
long long sum = 0;
scanf("%lld %lld %lld", &N, &A, &B);
long long X[N];
for(i=0;i<N;i++){
scanf("%lld",&X[i]);
}
for(i=1;i<N;i++){
long long dis = X[i] - X[i-1];
if(B > dis ... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int n;
int D1,D2;
int get(int x,int y){return x*(n*2)+y;}
struct data{
int to,nxt;
};
struct Graph{
data mp[20000200];
int head[500500],cnt;
void link(int x,int y)
{
mp[++cnt].to=y;
mp[cnt].nxt=head[x];
head[x]=cnt;
}
int f... | #include<bits/stdc++.h>
int n,d1,d2,color[606][606],N;
void paint(int d){
int b=0;
while(!(d&3))d>>=2,++b;
if(d&1){
for(int i=0;i<N;++i)
for(int j=0;j<N;++j)
if(((i>>b)+(j>>b))&1)color[i][j]=1;
}else{
for(int i=0;i<N;++i)
for(int j=0;j<N;++j)
if((i>>b)&1)c... | 1 |
#include<bits/stdc++.h>
using namespace std;
struct node
{
int num,fa,ls,rs;
node(int _num,int _fa)
{
num=_num;
fa=_fa;
ls=rs=-1;
}
};
typedef vector<node> Tree;
Tree T;
void insert(int t,int n)
{
if(T[0].num==INT_MAX)
T[0].num=n;
else if(T[t].num>n)
if(T[t].ls==-1)
{
T[t].ls=T.size();
T.p... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 1 |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(s) ((int) ((s).size()))
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#ifdef _WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long long... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
char s[N],t[N];
int n,ans,l=1,r,last,q[N];
int main(){
scanf("%d%s%s",&n,s+1,t+1),last=n;
for(int i=n;i;){
while(last&&(i<last||s[last]!=t[i])) --last;
if(!last) {puts("-1");return 0;}
while(l<=r&&q[l]-r+l-1>=i) ++l;
q[++r]=last;
if(i!=last) an... | 1 |
#include<iostream>
#include<string>
int main() {
std::string s;
std::cin >> s;
if (s == "RRR") std::cout << 3 << std::endl;
if (s == "RRS") std::cout << 2 << std::endl;
if (s == "RSR") std::cout << 1 << std::endl;
if (s == "SRR") std::cout << 2 << std::endl;
if (s == "RSS") std::cout << 1 << std::endl;
if (s... | /*
LINES :
* rainy days
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// #define OJ
#define pb push_back
#define F first
#define S s... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.