code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <string>
int main(){
std::string sent;
int gyou,num=0;
std::cin >> gyou;
getline(std::cin, sent);
for(int i=0;i<gyou;++i){
num=0;
getline(std::cin, sent);
std::string bef="Hoshino",aft="Hoshina";
while(num!=-1){
num=(int)(sent.find(bef));
if(num!=-1)... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int ctoi(char c) {return c-'0';}// char to int
int gcd(ll a,ll b){return b?gcd(b,a%b):a;}//MAX
int lcm(ll a,ll b){return a*b/gcd(a,b);}//MIN
int main(){
string s;
cin >> s;
int n;
cin >> n;
for(int i=0;i<s.size();i+=n){
cout<<s.at(i);
}
cout<<end... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
int main(){
ll counte=0,countw=0;
string str;
cin>>str>>str;
vector<ll> w((ll)str.size());
vector<ll> e((ll)str.size());
for(ll i=0;i<(ll)str.size();i++){
if(i==0)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;
#define reps(i, a, b... | #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 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
//const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
//const ... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>//sort,reverse
#include<utility>//pair
#include<queue>//queue,priority_queue
#include<deque>//double_ended queue
#include<map>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;//Pでpair<-,->を表す。
typedef map<LL,LL>::iterator Itr;
LL ... | #include <bits/stdc++.h>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {c... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,l,ans=1e9; cin>>n>>l;
int S[n], sum=0;
for(int i=0; i<n; i++){
S[i] = l+i+1-1;
sum+=S[i];
}
for(int i=0; i<n; i++){
int x = abs(sum - (sum-S[i]));
ans = min(ans, x);
}
if(sum>=0)cout<<sum-ans<<endl;
else cout<<sum+ans<... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
int sum = n*(l-1) + (n*(n+1))/2;
if((l+n-1) < 0) {
sum -= l+n-1;
} else if(0 < l) {
sum -= l;
}
cout << sum << endl;
return 0;
}
| 1 |
#include<iostream>
using namespace std;
const int coin[2] = {5,500};
int main(){
int money,happy;
cin >> money;
int C[2] = {0,0};
for(int i = 1;i >= 0;i--){
C[i] = money / coin[i];
money -= coin[i]*C[i];
}
happy = C[0]*5 + C[1]*1000;
cout << happy << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int big = x/500;
int rest = x%500;
int small = rest/5;
cout << 1000*big + 5*small << endl;
} | 1 |
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
#include <set>
#include <list>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
namespace patch
{
template <typename T>
string to_string(const ... | #include <iostream>
#define N 101
using namespace std;
void swap(int *x, int *y){
int z = *x;
*x = *y;
*y = z;
}
int bubbleSort(int *A, int n){
int count = 0, flag = 1;
while(flag){
flag = 0;
for(int j=n-1;j>0;j--){
if(A[j] < A[j-1]){
swap(A[j], A[j-1]);
count++;
flag = 1;
}
}
}
... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
int a, b;
cin >> a >> b;
int ans;
ans = (b - 1) /(a - 1);
if((... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, ai;
cin >> N;
map <int,int> A;
for(int i=0;i<N;i++){
cin >> ai;
if(A.count(ai) > 0){ cout << "NO" << endl; return 0;}
else A[ai] = 1;
}
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
string s;
cin>>s;
for(i=0;i<s.length()-1;i++){
if(s[i]=='A'&&s[i+1]=='C'){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
string str;
cin>>str;
cout<<2018<<str.substr(str.find('7')+1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | 0 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 2200
using namespace std;
int a[N][N],f[N][N],l[N],r[N],b[N],id[N];
int n,m,ans;
char s[N];
int check(int x,int y){
return ((a[x][y]==a[x-1][y])&&(a[x][y-1]==a[x-1][y-1]))||((a[x][y]!=a[x-1][y])&&(a[x][y-1]!=a[x-1][y-1]));
}
bool cmp... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a;
double b;
cin >> a >> b;
int B = b * 100;
long long c = a * B / 100;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e9+7;
int main(){
ll a,b;
cin>>a>>b;
cout << a*b;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n ;
int result;
result = 1;
int k;
cin >> k;
for (int i = 0; i < n; i++)
{
if (result+k < result*2)
{
result = result + k;
}
else if (result*2 <= result+k)
{
res... | #include <bits/stdc++.h>
#define N 1005
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;
typedef long long ll;
ll ans;
int main(){
ll n, t;
cin >> n >> t;
ll arr[n];
for(int i=0; i<n; i++) cin >> arr[i];
ans = n*t;
for(int i=1; i<n; i++){
if(t-(arr[i]-arr[i-1]) > 0) ... | 0 |
#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 <cmath>
#include <map>
#include <string>
using namespace std;
int main()
{
map<char,int> roman;
roman['I'] = 1;
roman['V'] = 5;
roman['X'] = 10;
roman['L'] = 50;
roman['C'] = 100;
roman['D'] = 500;
roman['M'] = 1000;
string s;
while(cin >> s)
{
int ans = 0;
... | 0 |
#include <iostream>
#include <string>
using namespace std;
void swapD(double *a,double *b){
double tmp = *a;
*a = *b;
*b = tmp;
}
void swapString(string *a,string *b){
string tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
int n;
string str[60];
double data[60];
for(int i=0;i<60;i++){
data[i]=10000000;
}
... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename K,typename V>
using umap = unordered_map<K,V>;
template <typename V>
using uset = unordered_set<V>;
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 T &b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
using pii = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = 0;
set<int> hako;
map<int... | 1 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
typedef long long ll;
using namespace std;
ll n, m;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar(); }
while(c >= '0' && c <= '9') x = x * 10 ... | #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 < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.1415926535897932384626433832795... | 1 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#incl... | #include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
const int MAX_V=102;
int vote[MAX_V];
int main(){ _;
int n,q,m,tmp,result,resultCount;
while(cin>>n>>q,(n|q)!=0){
REP(i,MAX_V) vote[i]=0;
REP(i,n){
cin>>m;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
using Edge = pair<ll,ll>;
using Graph = ve... | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
// 二部グラフ判定
vector<ll> color;
boo... | 0 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353 //1000000007 // //100000000
#define INF 1000000000000000000
#define ll long long
//#define M_PI 3.141592653589793238463
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
//Zeller's conguence
int main()
{
int h, y, m, d;
h = 20;
y = 4;
... | #include <stdio.h>
int main(void) {
int i, j, k, m, d, ans;
int m0[13] = {0, 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335};
char w[7][25] = {
"Wednesday",
"Thursday",
"Friday",
"Saturday",
"Sunday",
"Monday",
"Tuesday"
};
while( 1 ) {
scanf("%d%d", &m, &d);
if(!m ... | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
int q = 0;
int cnt = 0;
int left ... | 0 |
#include<iostream>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
cout<<n*m<<endl;
} | #include <cstdio>
typedef long long ll;
#define rep(i,a,n) for (int i=a;i<n;i++)
ll mod;
int n;
ll powmod(ll a,ll b) {ll res=1;a%=mod; for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll ipw2[10100],ipw3[10100],fac[10100],fnv[10100];
int main() {
scanf("%d%lld",&n,&mod);
fac[0]=1;
rep(i,1,10000) fac[i]=f... | 0 |
/*
* Author: .-O_O-.
*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)... | //itp1_5-d
#include <iostream>
using namespace std;
int include3(int x){
return (! x) ? 0 : (x%10==3 || include3(x/10));
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
if(i%3==0) cout<<" "<<i;
else if(include3(i)) cout<<" "<<i;
}
cout<<endl;
return 0;
} | 0 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
const ll N = 100005;
int main(){
//入力
vector<int> v;
ll n, m, A[N]; cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> A[i];
vector<int> odds;
vector<int> ans_A;
for (int i = 0; i < m; i++) //奇数の抽出
{... | #include <cstdio>
const int N = 1000064;
int A[N], B[4];
int main() {
int m, x, *a = A, *b = B;
scanf("%*d%d",&m);
if (m == 1) {
scanf("%d",&x);
if (x == 1) puts("1\n1\n1");
else printf("%d\n2\n1 %d",x,x-1);
return 0;
}
while (m--) {
scanf("%d",&x);
*(x&1 ? b : a)++ = x;
if (b > B+2) {puts("Impossibl... | 1 |
#include <iostream>
using namespace std;
int func(int x, int y, int z){
// cout << x << " " << y << " " << z << endl;
if (x==y||y==z||z==x) return false;
if (x+y>z&&y+z>x&&z+x>y){
// cout << "ok" << endl;
return true;
}
return false;
}
int main(void){
int n,ans;
int len[200];
cin >> n;
for ... | #define DIN freopen("input.txt","r",stdin);
#define DOUT freopen("output.txt","w",stdout);
#include <bits/stdc++.h>
#include <cstdio>
#define mem(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=(a);i<=(int)(b);i++)
#define REP_(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
using namespace std;
typedef l... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
int dp[50];
rep(i,50)dp... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int tmp;
int dp[100];
cin>> tmp;
do{
fill(dp,dp+100,0);
dp[0] = 1;
for (int i = 0; i<tmp;i++)
{
for(int j = 1;j < 4;j++)
dp[i+j] += ... | 1 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define MOD 1000000007
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_l... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0; i<(n); i++)
ll d, c, ans, u;
int main(){
scanf("%lld", &d);
for(int i=1; i<=18; i++) rep(j,1<<(i-1)){
c = d; u = 1;
int a[20] = {};
rep(k,i){
a[k] = c % 10;
if(j>>k&1){
a[k] -= 10;
c += 10;
}
if(... | 0 |
#include <iostream>
#define MAX 1000
using namespace std;
class Contest {
public:
Contest() {}
Contest(int _id, int _cost, int _vote) {
id = _id;
cost = _cost;
vote = _vote;
}
bool compare_cost(int _cost) {
return cost <= _cost;
}
bool compare_vote(int _vote) {
return vote < _vote;
... | #include <iostream>
using namespace std;
int main() {
int a[1000],t[1000];int n,m;
cin >> n >> m;
for(int i = 0;i<1000;i++){
a[i]= 0;
t[i]= 0;
}
for(int i = 0;i<n;i++){
cin >> a[i];
}
for(int i = 0;i<m;i++){
int p;
cin >> p;
int o = 0;
while(a[o]>p){o++;}
t[o]++;
}
int ans = 0;
for(int i = 0;i<n;i++){
if(t[an... | 1 |
#include<bits/stdc++.h>
const int MOD = 1e9 + 7;
using namespace std;
int main(){
string K;
cin >> K;
int D;
cin >> D;
vector<vector<vector<long long>>> dp(K.size() + 1, vector<vector<long long>>(D, vector<long long>(2, 0)));
dp[0][0][1] = 1;
for(int i = 0; i < (int)K.size(); i++){
for(int j ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
string sa;
ll d,dp[10010][110];
ll dfs_dp(int pos,ll sta,bool lim)
{
if(pos==sa.size())
return sta%d==0;
if(!lim && dp[pos][sta]!=-1)
return dp[pos][sta];
ll up=lim?(sa[pos]-'0'):9,res=0;
for(int i=0;i<=up;i++)
res=(res+df... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve(std::vector<long long> H, std::vector<long long> M, long long K){
int t = (H[1] * 60 + M[1]) - (H[0] * 60 + M[0]) - K;
cout << t << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now.... | #include<stdio.h>
int main()
{
int h1, m1, h2, m2, k, ans;
scanf("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
int sum1 = (h1 * 60) + m1;
int sum2 = (h2 * 60) + m2;
if(sum1 > sum2){
ans = sum1 - sum2 - k;
}else{
ans = sum2 - sum1 - k;
}
printf("%d\n", ans);
} | 1 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T... | 0 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long Int;
int main(){
map<int,Int> table;
vector<int> ids;
int n;
bool flug;
while(cin >> n, n != 0){
flug = false;
table.clear();
ids.clear();
for(int i=1;... | #include <iostream>
int main(int argc, char const* argv[])
{
int i, n, a, b, a_score, b_score;
while (true) {
a_score = 0;
b_score = 0;
std::cin >> n;
if (n == 0) { break; }
for (i = 0; i < n; i++) {
std::cin >> a;
std::cin >> b;
if (a > b) {
a_score += (a + b);
... | 0 |
#include <stdio.h>
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define mx 1000008
#define pii pair<int,int>
#define pi acos(-1.0)
#define pb push_back
#define ss second
#define ff first
typedef long long int ll;
///adja... | #include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
vector <int> L(2*n);
for (int i=0; i<L.size(); i++)
cin >> L[i];
sort (L.begin(), L.end());
int res = 0;
for (int i=0; i<L.size(); i+=2) {
res += min (L[i], L[i+1]);
}
cout << res;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;
constexpr double EPS = 1e-4;
constexpr d... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string s;
cin>>s;
vector<int>sumW(n+1,0);
for(int i=0;i<n;i++){
if(s[i]=='W'){
sumW[i+1]=sumW[i]+1;
}
else{
sumW[i+1]=sumW[i];
}
}
vector<int>sumE(n+1,0);
for(int i=0;i<n;i++){
if(s[i]=='E'){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>data(N);
for(int i;i<N;i++){
char a;
cin >> a;
if(a=='W') data.at(i)=0;
else data.at(i)=1;
}
vector<int>r(N);
int one=0;
for(int i=1;i<N;i++){
one+=data.at(i);
}
r.at(0)=one;
for(int i=1;i<N... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int elem[n];
int cnt=0;
for(int i=0;i<n;i++){
cin>>elem[i];
}
for(int i=0;i<n-1;++i){
for(int j=0;j<n-1-i;++j){
if(elem[j]>elem[j+1]){
++cnt;
elem[j]^=elem[j+1];
elem[j+1]^=elem[j];
elem[j]^=elem[j+1];
}
}... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int bubble_sort(int n,vector<int> &vec);
int main() {
int n,count;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
count=bubble_sort(n,a);
for (int i = 0; i < n; i++) {
cout << a[i];
if (i != n - 1) { cout << " ... | 1 |
//g++ -std=c++14 test.cpp -o test.out
//問題URL
//https://atcoder.jp/contests/agc019/tasks/agc019_b
//参考：
//https://oraclesqlpuzzle.ninja-web.net/kyoupro/kyoupro-10-019-b.html
//ポイント：
//A[i]とA[j]が同じ文字の時、
//それに内包される文字列を反転させたものと
//A[i],A[j]を含んだ文字列を反転させても被るので除外する
//例えば
//文字列eabceにおいてはabc,eabceどちらを反転させても
//同じecbaeができる
#i... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
char s[200005];
int n,cnt[26];
ll ans=0;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++)cnt[s[i]-'a']++;
ans=1;
for(int i=0;i<26;i++)for(int j=i+1;j<26;j++)ans+=1ll*cnt[i]*cnt[j];
printf("%lld\n",a... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
for(int i=0; i<n; i++) arr[i]++;
for(int i=1; i<n; i++) arr[i]+=arr[i-1];
int maxsum = arr[k-1];
for(int i=k; i<n; i++) maxsum = max(maxsum,arr[i]-arr[i-k]);
cout<<maxsum/2<<".";... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
v1 a(1001, 0);
for(int i = 1; i <1001; i++){
a[i] = a[i-1... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
vi a(3);
rep(i,3){
cin >> a.at(i);
}
sort(ALL(a));
int b,ans=0;... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
vector<int> v(3);
v.at(0) = A;
v.at(1) = B;
v.at(2) = C;
sort(v.begin(), v.end());
int n = v.back();
while (K) {
n... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | 1 |
#include <stdio.h>
char zf1[1000010],zf2[1000010];
struct SZt
{
int l,r,h;
SZt(){}
SZt(int L,int R,int H)
{
l=L;
r=R;
h=H;
}
};
SZt dl[1000010];
int main()
{
// freopen("a.in","r",stdin);
// freopen("game.out","w",stdout);
int n,jg=0,he=0,ta=0,py=0;
scanf("%d%s%s",&n,zf1,zf2);
bool bt=false;
for(int i=0;... | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int n,x[1000010],p;
char s[1000010],t[1000010];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int i,j,k,l;
scanf("%d%s%s",&n,&s,&t);
for(i=n-1,j=n,k=0,l=0;i>... | 1 |
#include <iostream>
using namespace std;
class Dice{
public:
int num[6],t;//t=top
void North(){
/*
dice.num[0] = ???
dice.num[1] = ???
dice.num[2] = ???
dice.num[3] = ???
dice.num[4] = ???
dice.num[5] = ???*/
t = num[0];
num[0] = num[1];//??????1?????¨???
num[1] = num[5];//??????2?????¨???
nu... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<functional>
#include<vector>
#include<queue>
using namespace std;
#define f(i,n) for(int i=0;i<(int)n;i++)
#define MOD 1000000009
struct dice{
int up;
int down;
int east;
int west;
int north;
int south;
};
dice a, b;... | 1 |
#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=1LL<<61;
int main() {
ll h,m;
cin >> h >> m;
ll s=h*60+m;
cin >> h >> m;
ll g=h*60+m;
ll k;
cin >> k;
c... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 1 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
auto gcd = [](int mm, int nn) {
function<int(int, int)> f = [&f](int m, int n) {
if (n == 0) {
return m;
}
else {... | #include<stdio.h>
int main(void)
{
int n;
int a[3],b,c;
int i,j,temp;
b=1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
if(n==2){
if(a[0]<a[1]){
temp=a[0];
a[0]=a[1];
a[1]=temp;
}
while(b!=a[1]){
for(i=0;i<a[1];i++){
if(a[0]%b==0 && a[1]%b==0){
printf("%d\n",b);
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
// Template Headers {{{
using pii = pair<int, int>; using vpii = vector<pii>;
using vi = vector<int>; using vvi = vector<vi>;
using ll = long long; using vll = vector<long long>;
template <class T> using min_queue = priority_queue<T, vector<T>, greater<T>>;
template <class... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | 0 |
///A drunk man will find his way home, but a drunk bird may get lost forever...
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
//template <typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tr... | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <que... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli,lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pi... | #include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | 0 |
#include <stdio.h>
#include <limits.h>
#define MAX 200000
#define INF INT_MAX
typedef long long ll;
void merge(int*, int, int, int);
void mergesort(int*, int, int);
ll ans;
int n, a[MAX];
int main(){
int i;
scanf("%d" ,&n);
for(i = 0 ; i < n ; i++){
scanf("%d" ,a + i);
}
mergesort(a,0,n);
pr... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
#define MAX_N 200010
#define int long long
int bit[MAX_N], n, a[MAX_N], ma, b[MAX_N];
int sum(int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i , int x){
while(i <= n){
bit[i]... | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void) {
char list[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
while(true) {
int n,k[200];
char s[150]={};
scanf("%d", &n);
if(!n) break;
for(int i=0; i<n; i++)
scanf("%d", ... | #include <iostream>
using namespace std;
int main()
{
int n,t;
while(cin >> n, n)
{
int k[10] = {0};
while(n--)
{
cin >> t;
k[t]++;
}
for(int i=0; i<10; i++)
{
if(k[i])
{
for(int j=0; j<k[i]; j++)
{
cout << '*';
}
cout << endl;
}
else
{
cout << '-' << endl;... | 0 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int A, B, C;
cin >> A >> B >> C;
int K;
cin >> K;
int multi;
for (int i = 0; i < K; i++)
{
multi = max(A, max(B, C)) * 2;
if (A *... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.t... | // tsukasa_diary's programing contest code template
#include <bits/stdc++.h>
using namespace std;
// define
#define for_(i,a,b) for(int i=a;i<b;++i)
#define for_rev(i,a,b) for(int i=a;i>=b;--i)
#define allof(a) a.begin(),a.end()
#define minit(a,b) memset(a,b,sizeof(a))
#define size_of(a) (int)a.size()
// typedef
typede... | 0 |
#include<bits/stdc++.h>
using namespace std;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x<10) putchar(x+'0');
else
{
write(x/10);
... | #include<iostream>
#include<string>
using namespace std;
int main(){
int k;
cin>>k;
string s,S;
cin>>s;
if(s.length()<=k)
cout<<s;
else{
for(int i=0;i<k;i++){
cout<<s[i];
}
cout<<"...";
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | #include <bits/stdc++.h>
#define N 100020
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0')ch=='-'&&(f=0)||(ch=getchar());
while(ch<='9'&&ch>='0')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return f?x:-x;
}
int a[N];
vector<int> sig;
int main(int argc, ch... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.b... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n;
int h[N], e[N], ne[N], idx;
i... | 1 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const long long oo=1e15;
struct Node
{
Node *lch,*rch;
int l,r;
long long v1,v2,lz;
}*rt;
void update(Node *x)
{
x->v1=min(x->lch->v1,x->rch->v1);
x->v2=min(x->lch->v2,x->rch->v2);
}
void add(Node *x,lo... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... | 0 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#defin... | #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 ... | 0 |
//cwystc <--> 陈威宇是天才 --by cwy
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const double PI=acos(-1);
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i,a,b) for (int i=(a);i<=(b);i++)
#define per(i,a,b) for (int i=(a);i>=(b);i--)
#... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD)... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main(){
Hello
int n, m;
cin >> n >> m;
int mx = 0, mn = 1e9;
for(int i = 0, l, r; i < m; i++){
cin >> l >> r;
mx = max(mx, l);
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 0 |
#include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
long double pi = acos(-1);
const int INF = 1001001001;
// 最小公倍数を求める
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll co... | #include <iostream>
using namespace std;
int main (void){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a <= b) {
if(c < d){
cout << a + c << endl;
}else{
cout << a + d << endl;
}
}else{
if(c < d){
cout << b + c << endl;
}else{... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int findNum(vector<pair<int, long long> > comm, int num) {
for(int i=0; i<comm.size(); i++) {
if(comm[i].first == num) {
return i;
}
}
return comm.size();
}
int main() {
int n;
cin>>n;
while(n != 0) {
i... | #include<iostream>
#include<cmath>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
vector<int> divisor(int n){
vector<int>res;
for(int 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 main(void){
int p,l,n,m;... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define pb(x) push_back(x)
#define vll vector<long long>
#define pll pair<long long, long long>
#define mll map<long long, long long>
#define sz(v)... | #include <bits/stdc++.h>
int main(){
int N, T;
std::cin >> N >> T;
std::vector< std::pair< int, int > > AB(N);
for(int i=0; i<N; i++){
std::cin >> AB[i].first >> AB[i].second;
}
std::sort(AB.begin(), AB.end());
std::vector< std::vector< int > > dp(N + 1, std::vector< int >... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N;
vector<string> blue(N);
int MAX = 0;
for(int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for(int i = 0; i < M; i++){
cin >> red.at(i);
}
int count;
string S;
fo... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#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>
#i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
string res = "";
while(n != 0)
{
if(n % 2 == 0) res = "0" + res;
else
{
res = "1" + res;
n--;
}
n /= -2;
}
if(res == "") res = "0";
cout << res << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-8;
int n;
double x[102], y[102];
vector<double> v;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i ++) {
scanf("%lf %lf", &x[i], &y[i]);
}
... | #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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
vector<int>... | 0 |
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int ll
//#define endl '\n'
// use unique(x) - removec consecutive items, returns vec.begin() + number of items
// for vector: sort(all(vec)); vec.erase(unique(all(vec)), vec.end());
// use i... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h+2, vector<char>(w+2));
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> a[i][j];
}
}
int di[] = {1, 0, -1, 0};
int dj[] = {0, 1, 0, ... | #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>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pi std::pair<int, int>
#define mkp std::make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
//{{{IO
namespace IO{
template <class I> void read(I &x){
x = 0; char ch = getchar(); bool f = false;
for(... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 1000010, M = 1010;
int n, m;
int h[N], e[N], ne[N], id... | 1 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
ll n, x;
cin >> n >> x;
vector<ll> b(n);
vector<ll> l(n);
vector<ll> u(n);
vector<ll> score(n);
ll ascore = 0;
ll bsum = 0;
for(int i = 0; i < n; i++)
{
cin >> b[i] ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 1 |
/**********************************************
* author : deepak nayan
* file : e:/Solutions/atcoder/abc089_a.cpp
* time : Thu Apr 30 18:03:36 2020
* quest : A - Grouping 2
*********************************************/
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath... | #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 N;
cin >> N;
rep(i, 3) {
if (N[i] == '7') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"N... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repe(i,n) for(int i=0;i<n;i++)
#define repa(i,j,n) for(int i=j;i<n;i++)
//#define v.all() v.begin(),v.end()
#define repr(i,n) for(int i=n;i>=0;i--)
#define int long long int
#define vi vector<int>
#define vpi vector<pair<int,int>... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#include <chrono>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<int, null_type,less<int>, rb_tree_tag, tree_o... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 |
#include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
using namespace std;
typedef long long ll;
typedef pair<int, int>... | 1 |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int INF = (int)1e9;
int board[128][128];
int main()
{
int w, h;
while (scanf("%d %d", &w, &h), w){
int xs, ys;
int xg, yg;
scanf("%d %d", &xs, &ys);
scanf("%d %d", &xg, ... | #include<iostream>
#include<string>
#include<queue>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int board[100][100];
void init_board() {
int i, j;
for (i=0; i<100; i++) {
for (j=0; j<100; j++) {
board[i][j] = 0;
}
}
}
void put_block(int c, int d, i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0){
return 0;
}
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
vector<int> b(n+1);
b.at(0)=0;
for(int i=1;i<=n;i++... | #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<list>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;
string a[7] = {
"Monday",
"Tuesday",... | 0 |
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<queue>
#include<bitset>
#include<cstdlib>
#include<set>
#include<unordered_map>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define low(x) (x&(-x))
#define IL inline
#define reg register
#de... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int h, w;
cin >> h >> w;
map<int, int> cur2start;
multiset<int> values;
for (int i = 0; i < w; i++) {
cur2start[i] = i;
values.insert(0);
}
for (int i = 0; i < h; i++) {
int left, right;
cin >> l... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int main() {
ll K;
cin >> K;
cout << 50 << endl;
vector<ll> a(50);
for (int i = 0; i < 50; i++) {
a[i] = i + K / 50 - K % 50;
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
vector<vector<ll>> a(500,vector<ll>(500,0));
vector<int> isPrime(5000,true);
vector<ll> primes;
for(int i=2;i<isPrime.size();i++){
if(isPrime[i]){
primes.push_back(i);
for(int j=2;j<isPrime.siz... | 0 |
#include <iostream>
using namespace std;
bool div_ok(int n) {
if (n % 3 == 0) {
return true;
} else {
return false;
}
}
bool num_dispear(int n) {
while (n > 0) {
if (n % 10 == 3) {
return true;
}
n /= 10;
}
return false;
}
int main () {
bool loop = true;
int i = 1;
int n;
... | #include<bits/stdc++.h>
#include<sstream>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
void call(int n){
for(int i=1;i<=n;i++){
stringstream ss;
ss<<i;
char c[8];
ss>>c;
if(i%3==0||strstr(c,"3"))
cout<<" "<<i;
}
co... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
#define bit(x, y) ((x >> y) & 1)
#define sz(s) ((int) (s).size())
const int MOD = 998244353;
int dp[305][100000];
int dp2[305][100000];
int n, a[305];
int m... | #include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int main(){
int64_t N;
cin>>N;
map<int64_t,int64_t>M;
M[-1]=3;
for(int64_t i=0;i<N;i++)
M[i]=0;
int64_t ans=1;
for(int64_t i=0;i<N;i++){
int64_t a;
cin>>a;
M.at(a)++;
if(M.at(a-1)<M.at(a)){
ans=0; break;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
string s;
cin >> s;
cout << 2018;
rep(i, s.size()-4){
cout << s[i+4];
}
} | #include <iostream>
#include <string>
int main(){
char s[10];
for (int i = 0; i < 10; i++){
std::cin >> s[i];
if (i == 3){
s[i] = '8';
}
}
for (int i = 0; i < 10; i++){
std::cout << s[i];
}
std::cout << std::endl;
return 0;
} | 1 |
#include<iostream>
using namespace std;
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#define int long long int
int function2(int memo[],int turn[],int n,map<int,int> &sticks)
{
if(n<0)
{
return -1000000000;
}
if(n==0)
{
return 0;
}
if(memo[n]!=-1)
{
return memo[n];
}
else
{
map<in... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a)/__gcd((a),(b))*(b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s, n) for(int i = s; i < (int)(n); i++)
#define co(x) cout<<x<<endl
#define SQvec(i,j) vector<vector<int>> data(i, vector<int>(j))
#define mod 1000000007
typedef long long int lint;
int main() {
string S;
cin >> S;
int ans=0;
bool fin = false;
rep(i,... | #include<iostream>
#include<cstdio>
#include<cstring>
namespace ShengXianTi
{
const int N=301000,MOD=1000000007;
inline void inc(int a,int &b){b=(a+b)%MOD;}
int f[N][2][3][3];
char s[N];
int n;
void dp()
{
s[n+1]='1',f[0][1][0][0]=1;
for(int p=0;p<=n;p++)
for(int r=0;r<2;r++)
for(int k=0;k<3;k++)
... | 0 |
#include <cstdio>
#include <cstring>
#include <algorithm>
const int MOD = 998244353;
const int MAXN = 5e5 + 10;
int n, m;
namespace {
inline int add(int x) { return x >= MOD ? x - MOD : x; }
inline int sub(int x) { return x < 0 ? x + MOD : x; }
inline int mul(int x, int y) { return 1ll * x * y % MOD; }
inline ... | #include <stdio.h>
using ll = long long;
const int MX = 1000005, MM = 998244353;
ll F[MX], I[MX], IF[MX];
ll C(int x,int y){return F[x+y]*IF[x]%MM*IF[y]% MM;}
int main()
{
int N, M, i;
I[1]=F[0]=IF[0]=F[1]=IF[1]=1;
for(i = 2; i < MX; i++){
I[i] = (MM - MM/i) * I[MM%i] % MM;
F[i] = F[i-1] * i % MM;
IF[i] = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N;
cin >> N;
vector<ll> A(N);
ll s = 0;
for ( int i = 0; i < N; i++ ) {
cin >> A[i];
s += A[i];
}
ll m = 1000000, ix = 0;
for ( int i = 0; i < N; i++ ) {
ll x = abs(A[i]*N-s);
... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//Tariquzzaman Faisal
//_Faisal101_
//IUT_CSE'19
//190041101
#include<iostream>
#include<stdio.h>
#include<vector>
#include<deque>
#include<map>
#include<stack>
#in... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string A, B, C;
int cnt = 0;
cin >> A;
cin >> B;
cin >> C;
if(A[A.size() - 1] == B[0])
cnt++;
if(B[B.size() - 1] == C[0])
cnt++;
if(cnt == 2) cout << "YES" << "\n";
else cout << "NO" << "\n";
return 0;
}
| #include<iostream>
#include<string>
using namespace std;
int main(){
string a, b, c;
cin >> a >> b >> c;
if(*(--a.end()) == *(b.begin()) && *(--b.end()) == *(c.begin())){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | 1 |
//%std
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read()
{
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-')
fh = -1, jp = getchar();
while (jp >= '0' && jp <= '9')
out = out * 10 + jp - '0', jp = getchar();... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
ll a=1,b;
for(ll i=2;i*i<=n;i++){
if(n%i==0){
a=i;
}
}
b=n/a;
ll ans=0;
while(b>0){
ans++;
b/=10;
}
cout << ans << en... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll r;cin>>r;
if(r<1200)puts("ABC");
else if(r<2800)puts("ARC");
else puts("A... | #include "iostream"
#include "string"
using namespace std;
int main(){
string a;
cin>>a;
a[3]='8';
cout<<a<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 200001
#define BMAX 100002
#define INFI 2100000000
int S[MAX];
int n;
int L[BMAX], R[BMAX];
long Merge(int left, int mid, int right){
int n1 = mid-left;
int n2 = right-mid;
long cnt = 0;
for(int i=0;i<n1;i++){
L[i] = S[left+i];
}
... | #include <iostream>
#include <vector>
#include <iomanip>
int main(int argc, char const* argv[])
{
int n{};
std::cin >> n;
while (n) {
std::vector<int> table{};
for (int i = 0; i < n * n; i++) {
int d;
std::cin >> d;
table.push_back(d);
}
for (int i = 0; i < n; i++) {
auto hsum = 0;
for (int j... | 0 |
#include <iostream>
#include <cmath>
int main()
{
double R;
std::cin >> R;
std::cout << 2.0 * M_PI * R << std::endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <string>
using namespace std;
int main() {
int r;
cin >> r;
string s;
if (r < 1200) {
s = "ABC";
} else if (r < 2800) {
s = "ARC";
} else {
s = "AGC";
}
cout << s << endl;
retur... | 0 |
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
const LL mod = 1000000007;
LL N, X;
std::vector<LL>S;
std::vector<std::vector<LL>>memo;
LL dp(LL i, LL j)
{
if (j == N) return i;
if (memo[i][j] != -1) return memo[i][j];
LL res1 = dp(i... | #include<bits/stdc++.h>
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
#define ms(a,b) memset(a,b,sizeof(a));
#define mp make_pair
#define pb push_back
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const ll MAXN = 1e6+1;
usi... | 0 |
#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;
#endif
//BEGIN CUT HERE
template<typename T>
struct VoronoiMST{
int n;
using E = pair<int, T>;
using P = pair<T, int>;
vector<vector<E> > G;
VoronoiMST(vector<T> &x){
n=x.size();
G.assign(n<<1,vector<E>());
for(int i=0;i<n;i++) G[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, int>;
using E = pair<ll, pair<int, int> >;
const ll INF = 1LL << 60;
template <typename T>
struct SegmentTree {
int n;
vector<T> data;
T INITIAL_VALUE;
//使うときは、この2つを適宜変更する
static T merge(T x, T y);
void u... | 1 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a,b;cin>>a>>b;
int c[3];
c[0]=a+b;
c[1]=a-b;
c[2]=a*b;
sort(c,c+3);
cout<<c[2]<<endl;
return 0;
} | 0 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
const int N = 2e5 + 5;
typedef long long ll;
using namespace std;
int n, A, B, x[N];
ll ans;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar(); }... | #include <cstdint>
#include <utility>
#include <vector>
using namespace std;
size_t partition(uint32_t array[], size_t start, size_t end)
{
int32_t mid = array[end];
int32_t less_than = 0;
for (uint32_t i = start; i < end; i++) {
if (array[i] <= mid) {
swap(array[less_than], array[i]);
less_than... | 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>;
int main() {
double n, m;
cin >> n >> m;
vector<int> L(m), R(m);
rep(i, m) cin >> L[i] >> R[i];
int maxi = *max_element(L.begin(), L.end());
int mini = *min... | #include <bits/stdc++.h>
using namespace std;
const int N=200000+10;
const int INF=10000000;
int p1[N],p2[N];
map<pair<int,int>,int>m;
int find(int x,int *p)
{
return p[x]==x?p[x]:p[x]=find(p[x],p);
}
void cha(int x,int y,int *p)
{
int px=find(x,p);
int py=find(y,p);
if(px!=py)
{
p[px]=py;
... | 0 |
#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 <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
if (s == "SSS") {
cout << 0 << endl;
return 0;
}
int ans = 1;
if (s[0] == 'R' && s[1] == 'R') ans++;
if (s[1] == 'R' && s[2] == 'R') ans++;
cout << ans << endl;
}
| 0 |
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
#include <set>
#include <list>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
namespace patch
{
template <typename T>
string to_string(const ... | #include <iostream>
using namespace std;
void print(int *p, int n)
{
cout << p[0];
for (int i = 1; i < n; i++) cout << " " << p[i];
cout << endl;
}
int bubblesort(int *p, int n)
{
int i, v;
bool flag = true;
int count = 0;
while (flag)
{
flag = false;
for (i = n - 1; i... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
reverse (s.begin(),s.end());
cout<<s<<endl;
return 0;
}
| 0 |
#include <stdio.h>
int main() {
int i, k, v,an1,an2,suu;
int MAX_V = 10000;
int prime[MAX_V+1];
for(i = 0; i <= MAX_V; i++) {
prime[i] = 1;
}
for(i = 2; i*i <= MAX_V; i++) {
if(prime[i]) {
for(k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0;
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
vector<vector<string>>boards={
{},{},{},
{
"aab",
"c.b",
"cdd"
},
{
"abcc",
"abdd",
"eefg",
"hhfg",
},
{
"abc..",
"abc..",
"deeff",
"d.ghh",
"iigjj"
},
{
"abc...",
"abc...",
"d.eeff",
"dgh... | 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(){
string s, t;
cin >> s >> t;
cout << t + s << endl;
return 0;
}
| #include <stdio.h>
int main() {
char aa[105], bb[105];
scanf("%s %s", aa, bb);
printf("%s%s", bb, aa);
return 0;
} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.