code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
using namespace std;
int main(){
int sx, sy, tx,ty;
cin >> sx >> sy >> tx >> ty;
for(int i = 0; i<(ty- sy); i++){
cout << 'U';
}
for(int i = 0; i<(tx- sx); i++){
cout << 'R';
}
for(int i = 0; i<(ty- sy); i++){
cout << 'D';
}
for(int i = 0; i<(tx- sx); i++){
cout << 'L';
}
int... | #include <bits/stdc++.h>
using namespace std;
int mi=(-1000000);
int main() {
int k,x; cin >> k >> x;
if(x-k+1<mi) {
for(int i=mi;i<mi+k;i++) cout << i;
cout << endl;
return 0;
}
for(int i=x-k+1;i<x+k;i++) cout << i << ' ';
cout << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define ll long long
#define read1(x) ... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int swap_count = 0; // number of swaps
void insertion_sort(vector<int> &sort_vec, int n, int interval) {
for (int i = interval; i < n; ++i) {
int pivot = sort_vec[i];
int j = i - interval;
while (j >= 0 && sort_vec[j] > pi... | 0 |
#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 st... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) r... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if( abs(A-B) < 2 ){
cout << "Yay!" << endl;
}
else{
cout << ":(" << endl;
}
}
| #include <stdio.h>
int main () {
int N, K, A = 1;
scanf("%d %d", &N, &K);
for (int i = 1; i <= N; i++) {
if (A * 2 < A + K) {
A *= 2;
}
else {
A += K;
}
}
printf("%d", A);
} | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
string tmp_s;
rep(i, s.length()) {... | #include <stdio.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
int main(void) {
int ans = 0, n, min = 101;
rep(i, 4) {
scanf("%d", &n);
ans += n;
if(n < min) min = n;
}
ans -= min;
min = 101;
rep(i, 2) {
scanf("%d", &n);
ans += n;
if(n < min) min = n;
}
ans -= min;
printf("%d... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll nature(ll a){//絶対値を返す
if(a>=0){return(a);}
else{return(-1*a);}
}
int main(){
long long N,count=0,count0=0;
cin>>N;
long long ans=0,m=10000000007;
vector<long long> vec(N);
for(int i=0;i<N;i++){
cin>>vec.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int64_t Z=0,MIN=167167167167617,A=1;
for(int i=0;i<N;i++){
int64_t a;
cin>>a;
if(a<0){
A*=-1;
a*=-1;
}
Z+=a;
MIN=min(MIN,a);
}
cout<<Z-MIN+A*MIN<<endl;
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
policy_set;
#define trav(a, x... | #include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 1000100
#define DEBUG_OUT true
#define ALL(x) (... | 1 |
#include<cstdio>
int main(){
int a[] = {0,0,31,60,91,121,152,182,213,244,274,305,335,366};
int m, d;
char day[7][10] = {"Monday", "Tuesday", "Wednesday", "Thursday","Friday","Saturday","Sunday"};
scanf("%d %d", &m, &d);
while(m || d){
printf("%s\n", day[(a[m] + d + 2) % 7]);
scanf("%d %d", &m, &d);
}
} | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-6;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <map>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
while(cin >> n && n) {
vector<pair<double,string... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
const int sqrtN = 512;
const ll inf = (1LL<<31)-1;
int n, q;
cin >> n >> q;
int bucket_sz = (n+sqrtN-1)/sqrtN;
vector<ll> a(n, inf);
vector<ll> bucketUp(bucket_sz, 0);
vector<bool> bucketFlag(bucket_sz, false);
auto pu... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int m... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include<iostream>
using namespace std;
#define NMAX 20
int main(){
int M,N,l;
int x[NMAX],y[NMAX];
char d;
bool ok[21][21];
while(1){
cin>>N;
if(N==0) break;
for(int i=0;i<N;i++){
cin>>x[i]>>y[i];
}
cin>>M;
int nx=10,ny=10;
for(int i=0;i<21;i++){
for(int j=0;j<21;j++){
ok[i][j]=fa... | 0 |
# include <bits/stdc++.h>
using namespace std;
namespace Base{
# define mr make_pair
typedef long long ll;
typedef double db;
const int inf = 0x3f3f3f3f, INF = 0x7fffffff;
const ll infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll;
template<typename T> void read(T &x){
x = 0; int fh = 1; double num... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
int H, W;
vector<string> grids;
vector<vector<bool>> visited;
Pii link_size(int i, int j) {
visited[i][j] = true;
bool color = grids[i][j] == '#';
Pii ret = Pii(0, 0);
if (color) ret.first++;
else ret.... | 0 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string... | #include <bits/stdc++.h>
using namespace std;
const int RLEN=1<<18|1;
inline char nc() {
static char ibuf[RLEN],*ib,*ob;
(ib==ob) && (ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob) ? -1 : *ib++;
}
inline int rd() {
char ch=nc(); int i=0,f=1;
while(!isdigit(ch)) {if(ch=='-')f=-1; ch=nc();}
while(isdigit(... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#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++)
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstrea... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
cout << 100 << " " << 100 << endl;
vector< vector<int> > grad(100, vector<int>(100));
for(int i=0; i<50; i+=2) {
f... | 1 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N, K;
scanf("%d %d", &N, &K);
int l[50];
for (int i = 0; i < N; i++) {
scanf("%d", &l[i]);
}
sort(l, l + N, greater<int>());
int ans = 0;
for (int i = 0; i < K; i++) {
ans += l[i];
}
printf... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define mod2 998244353
#define pii pair<ll,ll>
#define pb push_back
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vec... | #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;
vector<bool> found(26, false);
rep(i, s.size()) found[s[i] - 'a'] = true;
int a = -1;
rep(i, 26) if (found[i] == false) {
a = i;
... | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#define maxn 200005
using namespace std;
int n,k,l;
int father1[maxn];
int father2[maxn];
map<pair<int,int>,int>mp;
int find1(int x)
{
if(father1[x]!=x)
father1[x]=find1(father1[x]);
return father1[x];
}
int find2(int x)
{
if(fathe... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<char> b(m);
for (int i = 0; i < m; i++)
{
cin >> a[i] >> b[i];
if (n != 1)
{
if (a[i] == 1)
{
if (b[... | 0 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long n,now=0;
cin>>n;
string s,t;
cin>>s>>t;
while(1){
if(s.substr(now,n-now)==t.substr(0,n-now)){
break;
}
now++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define rand rund
#define pb push_back
#define eb emplace_back
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef unsigned long long int ull;
int MOD=1000000007;... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
long long k;
cin >> k;
vector<long long> a(50, 49);
long long x = (k + 50) / 50, y = (k % 50);
for(int i = 0; i < 50; i++){
a[i] += x;
if(i >= y) a[i] -= y + 1;
}
cout << 50 << ... | 1 |
#include<bits/stdc++.h>
using namespace std;
char getClass(int m, int e, int j) {
if (m == 100 || e == 100 || j == 100 || (m + e) / 2 >= 90
|| (m + e + j) / 3 >= 80)
return 'A';
if ((m + e + j) / 3 >= 70 || (m + e + j) / 3 >= 50 && m >= 80 || e >= 80)
return 'B';
return 'C';
}
int main() {
int n, pm, pe, pj;... | #include <stdio.h>
int dividing(int math, int english, int japanese)
{
if (math == 100 || english == 100 || japanese == 100) {
printf("A\n");
}else if (math + english >= 180) {
printf("A\n");
}else if (math + english + japanese >= 240) {
printf("A\n");
} else if (math + english + japanese >= 210) {
printf(... | 1 |
/**
* ???????????? I
?¬?????±??????????????????????????????????????????¢??????????????\??¬????????§????????????????????°????????????????????????????????????
????????????????????¢??????????????¨????????? 1 ?????? 6 ????????????????????????????????????????????????
??\?????¨??????????????????????????¢????????????... | #include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main(){
int n,m;
string S;
int dice[6];
for(int i=0;i<6;i++){
cin>>dice[i];
}
cin>>S;
for(int i=0;i<S.size();i++){
if(S[i]=='N'){
m=dice[0];
dice[0]=dice[1];
... | 1 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include "iostream"
using namespace std;
int main(){
int x,y,price=0;
cin>>x>>y;
for (int i=1; i<=3; i++) {
if (x==i) {
price+=(4-i)*100000;
}
if (y==i) {
price+=(4-i)*100000;
}
}
if (x==1&&y==1) {
cout<<"1000000"<<endl;
} else {
... | 1 |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | #include <iostream>
#include <string>
using namespace std;
int main() {
int k;
string s;
cin >> k>>s;
auto out = s;
if(s.size()>k) out = s.substr(0,k) + "...";
cout << out << endl;
return 0;
} | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
using i64=long long;
template <typename T>
struct BinaryIndexedTree {
size_t n;
vector<T> tree;
BinaryIndexedTree(size_t n, T e=0): n(n) {
tree = vector<T>(n+1, e);
}
void add(size_t i, T w) {
... | #include <iostream>
#include <vector>
#define SENTINEL 1000000001
using namespace std;
long long cnt = 0;
void merge(vector<int> &A, int left, int mid, int right)
{
int n1 = mid - left;
int n2 = right - mid;
vector<int> L(n1 + 1), R(n2 + 1);
for (int i = 0; i < n1; i++)
{
L[i] = A[left + i];
}
for (int i =... | 1 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) FOR(i,0,(n))
typedef pair<int,int> P;
class CGridRepainting2 {
... | #include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int main() {
char buf[1<<10];
size_t q;
scanf("%s %zu", buf, &q);
string str(buf);
for (size_t i=0; i<q; ++i) {
size_t a, b;
scanf("%s %zu %zu", buf, &a, &b);
string instr(buf);
if (inst... | 0 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
cout << (E - A > K ? ":(" : "Yay!");
} | //----------------------Shanu Garg here---------------------
//-------------Search on youtube : Shanu Garg---------------
//-Studying at National Institute of Technology Delhi(NITD)-
//---------------------From Delhi, India--------------------
#include<bits/stdc++.h>
using namespace std;
#define f(i,n) for(auto i=0;i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
scanf("%d", &N);
int maximum;
scanf("%d", &maximum);
long long ans = 0;
for(int i = 1; i < N; i++)
{
int person;
scanf("%d", &person);
if(person >= maximum)
maximum = person;
else
ans += maximum - person;
}
printf("%l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x;
cin>>x;
ll a[x];
ll ans = 0;
ll maxT = 0;
for(int i=0;i<x;i++) {
cin>>a[i];
if(i == 0) {
maxT = a[0];
}
if(i > 0) {
if(a[i] < a[i-1]) {
an... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
if (s.size()>k) {
string sub = s.substr(0, k);
cout << sub << "..." <<endl;
}
else{
cout << s <<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int a,b;
cin >> a >> b;
if(a>8||b>8){
cout << ":(";
}else{
cout << "Yay!";
}
} | 0 |
#include<bits/stdc++.h>
#define N 200005
using namespace std;
int n,a[4][N],f[N],g[N],w[N];
void biu()
{
puts("No");
exit(0);
}
void add(int x)
{
for (int i=x;i<=n;i+=i&-i)
w[i]++;
}
int qry(int x)
{
int ans=0;
for (int i=x;i;i-=i&-i)
ans+=w[i];
return ans;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=3;i... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 |
//#include "atcoder/all"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
typedef unsigned long long ULLONG;
typedef long long LLONG;
sta... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// -----------... | 1 |
//----------------------Shanu Garg here---------------------
//-------------Search on youtube : Shanu Garg---------------
//-Studying at National Institute of Technology Delhi(NITD)-
//---------------------From Delhi, India--------------------
#include<bits/stdc++.h>
using namespace std;
#define f(i,n) for(auto i=0;i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
//int型vectorを出力
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define maxn 100010
using namespace std;
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
string s;
cin >> n >> s;
vector<ll> c(n + 1, 0);
for (ll i = 0; i < n; i++)
{
c[i + 1] = c[i];
if (s[i] == 'W')
{
c[i + 1]++;
}
}
ll ans = n;
for (ll i = 1; i < n + 1; i++)
{
ans = mi... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int a[... | #include <iostream>
#include <vector>
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);
}
}
return res;
}
int ma... | 1 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#d... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | 0 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
class Dice{
private:
int label[6];
public:
void initialize(int number[]);
void command(char houkou);
int getResult();
};
//ラベルに数字を代入
void Dice::initialize(int number[])
{
for(int i = 0; i < 6; i++){
label[i] = number[i];
}
}
//命... | //by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod=1e9+7;
ll qpow(ll x, ll k)... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 305;
ld dp[N][N][2];
int n, t[4];
void table() {
for (int t3 = 0; t3 <= t[3]; t3++){
int pr1 = t3 % 2, pr2 = (pr1 + 1) % 2;
for (int t2 = 0; t2 <= n; t2++)
for (int t1 = 0; t1 <= n; t1++) {
int t0 =... | /*------------------RandomStuff------------------*/
// Author: CNH_Tourist
// Date: 30/08/2020
// Time: 15:26:22
/*-----------------------------------------------*/
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unrolled-loops")
using namesp... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); ... | // 2016-12-03
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int m, min, max, n;
int p[200];
while (cin >> m >> min >> max, m) {
for (int i = 0; i < m; i++) {
cin >> p[i];
}
n = min - 1;
for (int i = min; i < max; i++) {
if (p[i] - p[i + 1] >= p[n] - p[n + 1]) {
n = i;
}... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 300000
int n, pm, pe, pj;
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
while(n-- > 0) {
scanf("%d %d %d", &pm, &pe, &pj);
if(max(pm, max(pe, pj)) == 100 || pm + pe >= 180 || pm + pe + pj >= 240)
puts("A")... |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cassert>
using namespace std;
bool solve(){
int n;
cin>> n;
if(!n) return false;
vecto... | 0 |
#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MN 21001
#define int long long
using namespace std;
int read_p,read_ca;
inline int read(){
read_p=0;read_ca=getchar();
while(read_ca<'0'||read_ca>'9') read_ca=getchar();
while(read_ca>='0'&&read_ca<='9') read_p=read_p*10+read_ca... | #include <iostream>
#include <string>
using namespace std;
int getvalue(char c){
if(c == 'I'){
return 1;
}else if(c == 'V'){
return 5;
}else if(c == 'X'){
return 10;
}else if(c == 'L'){
return 50;
}else if(c == 'C'){
return 100;
}else if(c == 'D'){
return 500;
}else if(c == 'M'){
return 1... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
i... | #include<stdio.h>
int main()
{
int i,j,n;
const int N=10001;
bool p[N];
for(i=2;i<N;++i)p[i]=true;
for(i=2;i<=N/2;++i)if(p[i])for(j=2*i;j<N;j+=i)p[j]=false;
while(scanf("%d",&n),n){for(i=n;;--i)if(p[i]&&p[i-2])break;printf("%d %d\n",i-2,i);}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> v(n);
for (size_t i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
v[l-1]++;
v[r]--;
}
int ans = 0, num = 0;
for (size_t i = 0; i < n; i+... | #include<bits/stdc++.h>
using namespace std ;
int main() {
int N , M ;
cin >> N >> M ;
int max_L = 0 ;
int min_R = 5+ 10e5 ;
for(int i = 0 ; i < M ; i++ ){
int L , R ;
cin >> L >> R ;
max_L = max(max_L , L);
min_R = min(min_R , R);
}
min_R++ ;
if(min_R > max_L){
cout << mi... | 1 |
#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(j, m) for (int j = 0; j <= (int)(m); j++)
int main()
{
int d;
ll g;
vector<ll> p, c;
cin >> d >> g;
p.resize(d);
c.resize(d);
rep(i, d)
... | 0 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
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 int MOD=1e9+7;
template<typename T> bool chmax(T &a,const T b... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 1 |
#include <bits/stdc++.h>
using namespace std;
static const int INF = 99999;
int main(){
int n,array[100][100];
cin>>n;
for(int i=0; i<n; i++){
fill(array[i],array[i]+n,INF);
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
int tmp;
cin>>tmp;
if(tmp!=-1) array[i][j]=tmp;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<double>; using vvd = vector<vd>;
#define REP(i,n) for(au... | 1 |
#include<bits/stdc++.h>
#define MN 600
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
pair<int,int> q[MN+5];
int n,d,D,s[MN+5][MN+5],vis[MN+5][MN+5],num[4],top... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
string f, e;
cout << 0 << endl;
cin >> f;
if( f == "Vacant" ) return 0;
cout << N - 1 << endl;
cin >> e;
if( e == "Vacant" ) return 0;
int l = 0;
int r = N - 1;
while( r - l > 1 ) {
int m = (l + r) / 2;
string now;
cout << m... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 10005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef do... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
st... | 0 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll modpow(ll x, ll n){
ll res = 1;
ll mul = x;
while(n){
if(n % 2) res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
struct Comb... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 998244353LL
#define llMAX 9223372036854775807LL
#define llMIN -9223372036854775808LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n,x,y,K_... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | # include <bits/stdc++.h>
using namespace std ;
bool is_war ( const vector <int >& x , const vector <int >& y ) {
for ( int Z = -100; Z <= 100; ++ Z ) {
bool is_ok = true ;
for ( int i = 0; i < x . size (); ++ i ) {
if ( x [ i ] >= Z ) is_ok = false ;
}
for ( int i = 0; i < y . size (); ++ i ) {
if ( y [ i ] < Z ) is_o... | 1 |
#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1e9+7;
int main() {
int n;
cin >> n;
vector<int64_t>arr(n);
for(auto & i : arr)
cin >> i;
vector<int64_t>sufsum;
sufsum.push_back(0);
for(int i = n-1; i > 0; --i){
auto a = sufsum.back();
a+=arr[i];
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1e9+7;
int main(){
ll n;
scanf("%lld",&n);
ll a[n+1];
ll sum=0;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
sum=(sum+a[i])%mod;
}
ll ans=0;
for(int i=1;i<n;i++){
sum=(sum+mod-a[i])%mod;
ans=(ans+a[i]*sum)%mo... | 1 |
#include <iostream>
#include <string>
using namespace std;
class BNode{
public:
int value;
BNode *right,*left;
};
class BTree{
BNode *root;
void Inorder(BNode *cur){
if(cur){
Inorder(cur->left);
cout << " " << cur->value;
Inorder(cur->right);
}
}
void Preorder(BNode *cur){
if(cur){
cout << " "... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, g;
cin >> r;
cin >> g;
cout << g - r + g << endl;
} | #include <iostream>
#include<set>
#include<vector>
#include<string>
#include<iterator>
#include<iomanip>
#include<cmath>
#include<map>
#include<string.h>
#include<algorithm>
using namespace std;
void ll(){
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(0);
}
int main() {
ll();
int x, y,ave=0;
cin... | 1 |
//
// Created by Koki Igarashi on 7/28/20.
//
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<pii, Int> ppi;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | 1 |
#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <string.h>
using namespace std;
static const int INF = 1e9;
static const int SIZE = 10001;
typedef pair<int, int> P;
struct edge
{
int to;
int cost;
};
bool isUsed[SIZE];
vector<edge> G[SIZE];
void solve()
{
int V, E;
cin >> V ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include<stdio.h>
#include <map>
using namespace std;
int uni[100100];
int oya(int a){
if (uni[a]<0){
return a;
}
else{
uni[a]=oya(uni[a]);
return oya(uni[a]);
}
}
bool ren(int a,int b){
a=oya(a);
b=oya(b);
if(a==b){
return false;
... | 1 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespac... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
bool check(long long a,long long b,long long c){
return true;
}
int main(){
string str;
cin >> str;
if(str.size()%2!=0){
cout << "No" << endl;
return 0... | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int n, k, m;
set<int> t;
void ck(int* b) {
int s = 0;
for (int i = 0; i < k; i++) {
if (b[i] > 9)
s = s * 100 + b[i];
else
s = s * 10 + b[i];
}
if (t.find(s) == t.end()) {
t.insert(s);
m++;
}... | #include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#defin... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979
#define EPS 1e-8
#define mod 998244353
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
const ll INF=1e15;
const int N=2e5+50;
long lo... | #include<bits/stdc++.h>
using namespace std;
vector<int>e[1500001];
int dp[1500001];
int vis[1500001];
int dfs(int u)
{
if(vis[u]==1){printf("-1");exit(0);}
if(dp[u]) return dp[u];
vis[u]=1;
int ans=1;
for(int i=0;i<e[u].size();i++)
{
//printf("%d::%d %d\n",u,e[u][i],dfs(e[u][i])+1);
ans=max(ans,dfs(e[u][i])+... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
double n;
cin>>n;
vector<v... | //算数的な問題
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int f(int n){
if (n == 0) return 1;
else return n * f(n - 1);
}
int main(void){
int N;
cin >> N;
... | 1 |
#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 ... | // This template belongs to Juan Carlo Vieri
/* ____ __
/ _/ | | __ __
__| |__ | | /_/ | |
|__ __| | | __ ____ | | __ ___ _ ___
| | | | | | / _/ | |/ / / _ \ | |/ _/
| | | | | | | |_ | \ | __/ | /
|__| |__| |__| \___\ |__|\__\ ... | 0 |
#include <iostream>
using namespace std;
int main()
{
string w;
cin >> w;
int c = 0;
if (w == "RRR")
{
c = 3;
}
else if (w== "RRS" || w == "SRR")
{
c= 2;
}
else if (w == "SRS" || w == "RSR" || w == "SSR" || w == "RSS")
{
c = 1;
}
cout << c <<... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin>>s;
int ans = 0;
int ma = INT_MIN;
for(int i=0;i<s.size();i++) {
if(s[i] == 'R') {
ans++;
}
else {
ma = max(ma, ans);
ans = 0;
}
}
... | 1 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | 0 |
#include<bits/stdc++.h>
//g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
set<ll> S;
map<ll, ll> M;
rep(i, N) {
set<ll>::iterator it = S.lower_... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
using namespace std;
#define int long long
#define ll lo... | 1 |
#include<bits/stdc++.h>
#define mems(a,x) memset(a,x,sizeof(a))
#define first fi
#define second se
using namespace std;
typedef long long ll;
const int mod=1e9+7,N=105;
const double eps=1e-8,pi=3.1415926535898;
ll inv(ll x){return x==1?x:(mod-mod/x)*inv(mod%x)%mod;}
ll inv(ll x,ll mod){return x==1?x:(mod-mod/x)*inv(mod... | #include<iostream>
#include<complex>
#include<math.h>
#include<algorithm>
using namespace std;
int n,i,j;
double x[100],y[100],a[101],Ans[100];
complex<double>z[100];
int main()
{
cin >> n;
for(i=0;i<n;i++){
cin >> x[i] >> y[i];
z[i]=complex<double>(x[i],y[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j+... | 1 |
#include <stdio.h>
int main(){
long long n, sum = 0;
scanf("%lld", &n);
for(long long i = 1 ; i <= n ; i++){
if(i%3 != 0 && i%5 != 0){
sum+=i;
}
}
printf("%lld\n", sum);
return 0;
} | #define rep(i,n) for (int i=0;i<n;i++)
#include <vector>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
string s;
cin >> s;
int co=0;
rep(i,3){
if(s.at(i)=='R') co++;
}
if(co==3)
cout << 3 << endl;
else if(co==2 && s.at(1)!='S')
cout << 2 << endl;
else i... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=5e18;
int main() {
ll a;
cin >> a;
if(a<1200) cout << "ABC" << endl;
else if(a<2800) cout << "ARC" << endl;
e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
// i桁目まで見て j枚多く払う時(0 or 1)
ll dp[1000100][2];
int main() {
string s;
cin >> s;
s = '0' + s;
int n = (int)s.size();
memset(dp, 0, sizeof(dp));
dp[0][1] = 1;
for (int i = 1; i < n; i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
int main(){
ll h, w, k;
cin >> h >> w >> k;
ll dp[110][10] = {};
dp... | #include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
#define bit(n, k) ((n) >> (k) & 1)
const int MOD = (int)1e9 + 7;
template<class T> void add(T &a, T b) { (a += (b % MOD + MOD) % MOD) %= MOD; }
int main() {
int h, w; cin >> h >> w;
int K; cin >> K; K--;
vect... | 1 |
#include <iostream>
#include <string>
using namespace std;
char decode(char c, int n) {
if ('a' <= c && c <= 'z') {
if (c - 'a' >= n)
return c-n;
else
return decode('Z', n-(c-'a'+1));
}
if ('A' <= c && c <= 'Z') {
if (c - 'A' >= n)
return c-n;
else
return decode('z', n-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
ll N, x[100500], M, K, a[100050];
ll dp[100050][70];
ll ans_delta[100050];
int f(int index, ll time) {
//cout << index << " " << time << endl;
if(time == 0... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define rep(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | #include <iostream>
#include <cstring>
using namespace std;
const char i = 'I', v = 'V', x = 'X', l = 'L', c = 'C', d = 'D', m = 'M';
int number(char s)
{
switch (s) {
case i: return 1;
case v: return 5;
case x: return 10;
case l: return 50;
case c: return 100;
case d: return 500;
... | 0 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll Mod = 1e9 + 7;
ll fact[200100];
long long fastpower(long long a,long long b)
{
if(b==0)
return 1;
if(b==1)
return a;
long long res = fastpower(a,b/2)%Mod;
res = (res %Mod * res % Mod )%Mod;... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define r... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
typedef long long ll;
const int INF = 1e9+1;
const int MOD = 2e9 + 9;
const ll LINF = 1e18;
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d);
retu... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, input;
cin >> n;
int mn = n, cnt = 0;
for(int i = 0; i < n; i++){
cin >> input;
if(input < mn)
mn = input;
if(mn >= input)
cnt++;
}
cout << cnt;
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define f(x) x*x
using namespace std;
int ans;
int main(){
int ma,n;
while(cin>>n){
for(int i=n;i<600;i+=n){
ans += (f(i) * n);
}
cout<<ans<<endl;
ans=0;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int n,r;
scanf("%d%d",&n,&r);
int ans;
if(n<10)
{
ans=r+(10-n)*100;
}
else ans=r;
printf("%d",ans);
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if((b - 1) % (a - 1) == 0){
cout << (b - 1) / (a - 1) << endl;
} else{
cout << (b - 1) / (a - 1) + 1 << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main(){
int A,B,i,sum=1,count=0;
cin >> A >> B;
for(i=0;i==... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef vector<int> Vi;
typedef vector<lli> Vl;
typedef pair<int, int> Pii;
typedef pair<lli, lli> Pll;
//===
const int MOD = (int)1e9 + 7;
int main()
{
int N, X;
cin >> N >> X;
vector<int> S(N);
for (int i = 0; i < N; ++i) cin >> S[i];
so... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k; cin >> n >> k;
vector<double> v(n);
vector<double> expected(n);
for(int i = 0; i < n; ++i)
{
cin >> v[i];
expected[i] = ((v[i]*(v[i]+1.0))/2.0)/v[i];
if(i)
expected[i] += expected[i-1];
}
double maxi = expected[k-1];
double to... | 0 |
#include <iostream>
using namespace std;
bool check(string S){
if(S[0]!='A') return false;
int C=0;
for (int i = 2 ; i < S.length()-1; i++) {
if(S[i]=='C'){
C++;
}
}
if(C!=1) return false;
int upper=0;
for (int i = 0; i < S.length(); i++) {
if(S[i]>='A'&&S[i]<='Z'){
upper++;
}... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_accepted(void) {
string s;
cin >> s;
bool judge_a = false, judge_b = false, judge_c = false;
int cnt_c = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
if (s[i] == 'A') judge_a = true;
else ... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n, m; cin >> n >> m;
ll res = 1;
for (ll i = 1; i*i <= m; i++) {
if (m%i == 0) {
if (i*n <= m) res = max(res, i);
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
//if(B<=A) cout<<0<<endl;
if(B==1) cout<<0<<endl;
else if(A==B) cout<<1<<endl;
else if((B-A)%(A-1)==0) cout<<(B-1)/(A-1)<<endl;
else cout<<1+(B-1)/(A-1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
int a,b,ans,pl;
cin >> a >> b;
pl=1;
for(ans=0;pl<b;ans++){
pl += a-1;
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int N,M;
int FS[310][310];
vector<int>K;
int main(){
cin>>N>>M;
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
cin>>FS[i][j];
}
}
for(int i=1;i<=M;i++){
K.push_back(i);
}
int eachmaxcnt=0;
int maxcnt=300;
int C[310];
int temp=0;
//ゲ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 2010;
bool board[maxn][maxn];
int n, m;
int len[2][maxn][maxn];
void init(bool asd)
{
//cout << asd << " : " << endl;
for(int i = 1; i <= m; i ++)
len[asd][1][i] = ... | 0 |
#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int res = 100000;
for (int i = 0; i + 2 < S.size(); ++i) {
int val = (S[i]-'0')*100 + (S[i+1]-'0')*10 + (S[i+2]-'0');
res = min(res, abs(val - 753));
}
cout << res << endl;
} | 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
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int n, m, a[200001];
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t; cin >> t;
if(t < 1200)cout << "ABC" << endl;
else if(t < 2800)cout << "ARC" << endl;
else... | 0 |
/*
g++ --std=c++17 A.cpp
*/
#include <iostream>
#include <iomanip> //! for setprecision(20)
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <limits.h>
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1000000007;
int main(){
int H,W;cin >> H >> W;
vector<string> S(H);
int cnt=0;
for(int i=0;i<H;i++){
cin >> S[i];
for(int j=0;j<W;j++){
if(S[i][j]=='#'){
cnt ++;
}
}
}
vector<vector<bool>> P(H,vecto... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
int sum = 0;
vector<int> vec_1(4); vector<int> vec_2(2);
for (int i = 0; i < 4; i++) cin >> vec_1[i];
for (int i = 0; i < 2; i++) cin >> vec_2[i];
sort(vec_1.begin(), vec_1.end(), greater<int>());
s... | #include<stdio.h>
int main(void)
{
int n,x,cnt[10],i,j;
while(1){
for(i=0;i<10;i++){
cnt[i]=0;
}
scanf("%d",&n);
if(n<1)break;
for(i=0;i<n;i++){
scanf("%d",&x);
cnt[x]++;
}
for(i=0;i<10;i++){
if(cnt[i]>0){
for(j=0;j<cnt[i];j++){
printf("*");
}
printf("\n");
}
else{
... | 0 |
#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... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <math.h> // sqrt
#include <map> // map
#inc... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | 0 |
#include <bits/stdc++.h>
using namespace std;
#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 fi first
#define se second
#define mp make_pair
#define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
template <class... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200 + 10, M = 100000 + 10;
const int mod = 1e9 + 7;
void add(ll &x,ll y){
x += y;
if(x>=mod) x -= mod;
}
ll qpow(ll n,ll k){
ll res = 1;
while(k){
if(k&1) res = res * n % mod;
n = n * n % mod;
k >>=... | 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 ... | #include <iostream>
#include <algorithm>
using namespace std;
static const int N = 100;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
int main(void){
int n,p[N+1],m[N+1][N+1];
cin>>n;
loop(i,1,n+1){
cin>>p[i-1]>>p[i];
}
loop(i,1,n+2)m[i][i] = 0;
loop(l,2,n... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double rate;
int pfm,hrate;
cin>>rate>>hrate;
cout<<hrate*2-rate<<endl;
} | #include<iostream>
using namespace std;
int main(){
int a,i,j,k;
int s=0;
while(cin>>a){
for(i=a;i<600;i+=a){
s+=i*i*a;
}
cout<<s<<endl;
s=0;
}
return 0;
} | 0 |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
const int INF=11;
int w,h;
int field[22][22];
int sx,sy;
int gx,gy;
int ans=INF;
int hx[4]={1,-1,0,0,},hy[4]={0,0,1,-1,};
void dfs(int field2[22][22],int x,int y,int mx,int my... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int n,y;
int i,j,flg=0;
scanf("%d %d",&n,&y);
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
if(n-(i+j)<0) {
break;
}
if(i+j+n-(i+j)==n&&y==i*10000+j*5000+(n-(i+j))*1000){
flg=1;
break;
}
}
if(flg==1) break;
}
if(flg==... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <queue>
#include <functional>
#define N 101
#define INF 200000000
using namespace std;
int main(void){
int a,b,c,d;
int n,m;
while(cin>>n>>m,n||m){
int dp[m+1][m+1];
int dp1[m+1][m+1];
for(int i=1;i<=m;i++){
for(int j=1;j<=... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
bool cmp(pair<double, string> p, pair<double, string> q)
{
return (p.first > q.first) || (p.first == q.first && p.second < q.second);
}
int main()
{
int n;
while (cin >> n) {
if (!n... | 0 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i,n) for(int i=... | #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;
} | 1 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <numeric>
#include <iomanip>
#define ll long long
#define pi 3.14159265358979323846
using namespace std;
using p = pair<ll, ll>;
ll dx[4] = {-1, 0, 1, 0};
ll dy[4] = ... | 1 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
int a,b,c;
cin>>a>>b>>c;
while(a!=b){
if(a==c){
cout<<"Yes"<<endl;
return 0;
}
if(a<b) a++;
else a--;
}
cout<<"No"<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1e9+7
using namespace std;
typedef long long ll;
const double pi=acos(-1);
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int n;
string s;
cin >> n >> s;
ll ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
const int INF = 100000000;
typedef long long ll;
int W,H;
int sy, sx, gy, gx;
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
bool movable(vector<vector<char>> &c, ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string c(ll n);
int main() {
ll n;
cin >> n;
cout << c(n);
}
string c(ll n) {
// n >= 1
string ans = "";
while(n) {
n--;
ans += (char)('a' + (n % 26));
n/=26;
}
reverse(ans.begin(), ans.end());
return ans;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline ... | 0 |
#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 <iostream>
#include <cstdio>
#define int long long
using namespace std;
const int mod=1000000007;
int f[42][1<<18],n,x,y,z,i,j,k,lim,tmp;
signed main()
{
cin>>n>>x>>y>>z;
tmp=(1<<(x+y+z-1));
tmp|=(1<<(y+z-1));
tmp|=(1<<(z-1));
lim=(1<<(x+y+z))-1;
f[0][0]=1;
for(i=1;i<=n;i++){
for(j=0;j<=lim;j++){
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
int n;
cin >> n;
vector<tuple<ll, ll, ll>> vec;
rep(i, n){
ll a, b;
cin >> a >> b;
vec.push_back(make_tuple(a+b, ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e18+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=40... | 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
long long F(long long A){
long long ta = A;
long long fa = 0;
for(int i = 0; i <= 10; i++){
if(ta <= 0) break;
ta /= 10;
fa++;
}
return fa;
}
int main(... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
//cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
// https://github.com/atcoder/live_library
// cppdbg: test.exeのterminalに標準入力を打てる
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include<cstdint>
#include<limits>
#include<cstdbool>
#include<cmath>
#include<iostream>
#include<vector>
#include<array>
#include<list>
#include<string>
#include<sstream>
#include<algorithm>
int main(){
int n,h,w;
std::cin>>n>>h>>w;
std::cout<<1+(n-h)+(n-w)+(n-h)*(n-w);
}
| 0 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
using namespace std;
#define REP(i,n) for(int i=0; i... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
while(getline(cin,s)){t=s;
for(int i=0;i<26;i++){
s=t;
for(int j=0;j<s.size();j++){
if(s[j]>='a'&&s[j]<='z')for(int k=0;k<i;k++){
s[j]++;
if(s[j]>'z')s[j]-=26;
}
}
if((s.find("the")!=s.npos||s.find("this")!=s.npos||s.find("tha... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.