code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
int n, a[330], dp[300*303], d2[300*303], ans = 1, sum;
int expo(int b, int e) {
if(e == 0) return 1;
if(e & 1) return 1ll * b * expo(1LL * b * b % MOD, e >> 1) % MOD;
return expo(1LL * b * b % MOD, e >> 1);
}
int inv_mod(int x) { retur... | #include<bits/stdc++.h>
using namespace std;
#define MOD 998244353
template<typename ty1,typename ty2>
inline int add(ty1 x, ty2 y) {
if(y>=MOD)y%=MOD;
if(x>=MOD)x%=MOD;
x += y; return x < MOD ? x : x - MOD;
}
template<typename ty1,typename ty2>
inline void addto(ty1 &x, ty2 y) {
if(y>=MOD)y%=MOD;
if(x>... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d) << endl;
return 0;
} | #include<stdio.h>
int main()
{
long long int a,ans;
long double b,s;
scanf("%lld %Lf",&a,&b);
s=a*b;
ans=s;
printf("%lld",ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> p(n+1);
cin >> p[0] >> p[1];
for(int i = 0; i < n-2; i++){
int a, b; cin >> a >> b;
p[i+2] = b;
}
{
int a, b; cin >> a >> b;
p[n] = b;
}
int dp[101][... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
//using Graph = vector<vector<int>>;
typedef long long ll;
using Graph = vector<vector<pair<ll,ll>>>;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1... | #include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <string>
using namespace std;
void solve()
{
int n, k;
while (cin >> n >> k, n || k)
{
vector<string> card(n);
for (int i = 0; i < n; ++i)
{
cin >> card[i];
}
set<string> S;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,m;
while(scanf("%d%d",&n,&m),n,m){
int yasai[1024]={0};
for(int i = 0;i < n; i++){
scanf("%d",&yasai[i]);
}
sort(yasai,yasai+n);
for(int i = n;i >= 0; i-=m){
yasai[i] = 0;... | 0 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
string result;
vector<int> a;
vector<int>::reverse_iterator begin,end;
cin >> n;
for (int c = 0; c < n; c++) {
int t;
cin >> t;
a.push_back(t);
}
begin = a.rbegin();
... | #include<iostream>
using namespace std;
int main()
{
int n,j,i,s;
cin>>n;
int * a=new int[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;(n/2)>i;i++)
{
s=a[i];
a[i]=a[n-1-i];
a[n-1-i]=s;
}
for(i=0;i<n;i++){
cout<<a[i];
if(i!=n-1)
cout<<" ";
}
cout<<endl;
delete[] a;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
#define M 2100000
using namespace std;
int main(void)
{
int i,j,n,k,m,a[3001],b[3001],cost[3001],time[3001],kk,pp,bre;
int p,q,r;
int kin[101][101],zi[101][101];
int flg[10001],leng[10001],min;
int kaku,skin,szi;
while(1) {
scanf("%d... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(string x){cerr<<x;return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll x,y;
cin >> x >> y;
ll ans = 999999999999;
if (y - x >= 0) {
ans = min(ans,y-x);
}
if ((-y) - x >= 0) {
ans = min(ans,(-y)-x+1);
}
if (y - (-x) >= 0) {
ans = min... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll a,b,m,ans;
cin>>a>>b>>m... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
... | 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(){
int n;
cin >> n;
string s,sf,sl;
vector <int> m(n,0);
cout << 0 << endl;
cin >> s;
if(s=="Vacant"){
exit(0);
}
else{
/*i... | #include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=210, Mod=1e9+7;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();... | 0 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
void solve() {
int N, M;
cin >> N >> M;
vector<vector<int>> to(N+1);
vector<vector<int>> from(N+1);
vector<bool> visited(N+1);
vector<int> pare... | #include <cmath>
#include <cstdio>
#include <vector>
#include <iterator>
#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <stdio.h>
#include <functional>
#include <chrono>
using namespace std;
#define rep(i,s,n) for(ll i=... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdint>
using namespace std;
static void inputArray(int A[], int num) {
for (int i = 0; i < num; i++) {
cin >> A[i];
}
}
static vector<int> L(100000 + 1);
static vector<int> R(100000 + 1);
static uint64_t inversions = 0;
static inline v... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_ba... | #include<iostream>
#include<queue>
#include<utility>
#include<vector>
using namespace std;
int V,E,R,S[500010],T[500010],D[500010];
int C[100010];
int const inf=10000*100000+100;
typedef pair<int,int>P;
priority_queue<P,vector<P>,greater<P> > Q;
struct list{
int d,t;
};
vector<list> edges[500010];
int main(){
c... | 0 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
#define MOD2 998244353
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.size()
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k,0);
rep(i,k) cin >> d[i];
while(1){
bool flag = false;
rep(i,k){
string s = to_string(n);
rep(j,s.size()) {
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define per(i,n) for(int i=(n)-1; i>=0; i--)
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
const int MOD = 1000000007;
int main(){
int H,W,A... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <functional>
#include <utility... | 0 |
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> c >> b;
if ((a >= b && b >= c) || (a <= b && b <= c)) cout << "Yes\n";
else cout << "No\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin... | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int mx = 100005;
int dtime = 0;
int n, m, par[mx], low[mx], start[mx];
vector<int> adj[mx], child[mx];
bool vis[mx];
set<int> art;
void dfs(int n, int p = -1) {
//printf("DFS %d from %d\n", n, p);
vis[n] = true;
par[n] = p;
child[p].pb(... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<string, string> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1... | 0 |
#include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void readin(T &x) {
x = 0;
T fh = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') fh = -1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);
x *= fh;
}
inline void d_read(... | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
const i... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef pair<int, in... | 1 |
#include <bits/stdc++.h>
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)
//typedef pair<ll, ll> P;
typedef pair<double, double> P;
const ll INF = 10e17;
#defin... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <fun... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#define all(c) (c).begin(),(c).end()
using namespace std;
int mergecount(vector<int> &a) {
int count=0,n=a.size();
if (n>1){
vector<int>b(a.begin(),a.begin()+n/2);
vector<int>c(a.begin()+n/2,a.end());
count+=mergecount(b);
count+=mergecount(c... | #include <iostream>
#include <iomanip>
#include <math.h>
#include <fstream>
#include <string>
#include <time.h>
#include <ctime>
#include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <cstdlib>
using namespace std;
void tr... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i... | 0 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
u... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll mod = 1000000007;
ll fact[200010];
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200010;
int n, ans;
int read()
{
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar(... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<string> S;
int black = 0;
int white = 0;
int INF = 1001001001;
int main() {
int H, W;
cin >> H >> W;
for(int i = 0; i < H; ++i) {
string s;
cin >> s;
S.push_back(s);
}
for(int i = 0; i < H; ++i) {
for(int j = 0; j < W; +... | #include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
vector<int> query;
for(int i=0;i<q;++i){
int k;
cin >> k;
query.push_back(k);
}
vector<int> cumsum_c(n+1, 0), cumsum_m(n+... | 0 |
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int data[100];
int main(){
int n;
scanf("%d",&n);
for(int i = 0; i < n * (n - 1) / 2; i++){
int b[4];
for(int k=0;k<4;k++) scanf("%d",&b[k]);
if(b[2]>b[3]) data[b[0]-1]+=3;
if(b[2]<b[3]) data[b[1]-1]+=3;
if(... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | 1 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[309][309][309],A[309],S[309][309][309];
ll mod = 998244353;
void admod(ll &x, ll y){
x = (x +y) % mod;
}
main(){
string s;
ll k;
cin >> s >> k;
ll n = s.size();
if(k > n) k = n;
vector<ll> A;
ll o = 0;
for(ll i ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void){
int a, b, h = 100, w = 100;
string s[100];
char wht = '.', blk = '#';
cin >> a >> b;
if(a > b){
int t = a;
a = b;
b = t;
wht = '#';
blk = '.';
}
for(int i=0;i<... | 0 |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#inc... | #include <bits/stdc++.h>
using namespace std;
int n,x,y,z,mx,ji;
const long long mod=1e9+7;
long long ans,dp[45][1000010];
int main()
{
scanf("%d%d%d%d",&n,&x,&y,&z);
ans=1;
for(int i=1;i<=n;++i)
ans=ans*10%mod;
mx=(1<<(x+y+z))-1;
ji=(1<<(x+y+z-1));
ji|=(1<<(y+z-1));
ji|=(1<<(z-1));
dp[0][0]=1;
for(int i=1;i... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | #include <bits/stdc++.h>
const int MOD=1000*1000*1000+7,N=300005;
using namespace std;
typedef long long ll;
ll f[N];
ll h,w,a,b;
ll P(ll a,ll b){
ll ans=1;
while(b){
if(b%2)ans=(ans*a)%MOD;
a=(a*a)%MOD;
b/=2;
}
return ans;
}
ll WAYS(ll n,ll k){
ll cnt=f[n];
cnt=(cnt*P(f[... | 0 |
#include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
ll int n;
cin>>n;
int a=pow(n,2);
int b=pow(n,3... | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) {... | 1 |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i=(a); i<=(b); i++)
using namespace std;
const int maxn = 100005;
int a[maxn], n;
inline int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}
int solve() {
int flag1 = 0, cnt1 = 0, cnt0 = 0;
rep (i, 1, n)
if (a[i] & 1) {
flag1 |= (a[i] == 1);
cnt1++;... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
void addWordCount(const vector<string>& cards, map<string, int>& wordCount);
void subWordCount(const vector<string>& cards, map<string, int>& wordCount);
int getMaxValue(const map<string, int>& wordCount... | 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); ... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int f(int);
int integral(int);
int main(void) {
int a, b;
while(cin >> a >> b) {
cout << integral(a) << endl;
cout << integral(b) << endl;
}
return 0;
}
int integral(int d){
int n = 600 / d;
int sum = 0;
for (int i = 1; i < n; ... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
vector<char> init(){
vector<char> data;
for(int c='a'; c<='z'; ++c) data.push_back(c);
for(int c='A'; c<='Z'; ++c) data.push_back(c);
return data;
}
char solve(const char& c, int& x, const vector<char>& data){
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 60);
typedef pair<ll,ll> pii;
struct RUQ{
ll size;
ll *tree;
vi history;
RUQ(... | 0 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long h,w,n;
cin>>h>>w>>n;
if(h>w){
cout<<ceil((double)n/h)<<endl;
}else{
cout<<ceil((double)n/w)<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
string s;
int dx = x2 - x1;
int dy = y2 - y1;
for(int i=0; i<dy; ++i) s += 'U';
for(int i=0; i<dx; ++i) s += 'R';
for(int i=0; i<dy; ++i) s += 'D';
for(int i=0; i<dx+1; ++i) s += 'L';
for(int ... | 0 |
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
using namespace std;
int main(){
/*??£???????????????????????????
int a[2];
cin >> a[1] >> a[2];
cout << "[+] " << a[1] + a[2] << endl;
cout << "[-] " << a[1] - a[2] << e... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;
us... | 0 |
#include "bits/stdc++.h"
using namespace std;
set<int>S;
bool f(int n) {
while (n >0) {
int num = n % 10;
n /= 10;
if (S.count(num) == 1) {
return false;
}
}
return true;
}
int main() {
int N, K;
cin >> N >> K;
for (int i = 0;i<K;++i) {
int num;
cin >> num;
S.insert(num);
}
while (true) {
i... | #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>
#... | 1 |
#include <iostream>
using namespace std;
int main()
{
int m, d;
while (1){
cin >> m >> d;
if (m == 0){
break;
}
if (m == 2){
d += 31;
}
if (m == 3){
d += 60;
}
if (m == 4){
d += 91;
}
if (m == 5){
d += 121;
}
if (m == 6){
d += 152;... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,... | 0 |
#include <iostream>
#include <cstring>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
using namespace std;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
string fld[12];
void dfs(int x,int y){
fld[x][y]='0';
rep(i,4){
int sx=x+dx[i],sy=y+dy[i];
if(sx>=0&&sx<12&&sy>=0&&sy<12)if(fld[sx][sy]=='1')d... | #define _CRT_SECURE_NO_WARNINGS
#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
using namespace std;
queue<int> q;
list<int> l;
int *map = new int[12 * 12 * 20];
static int count;
void loop(int i){
map[i] = 0;
if (i / 12 > 0) ... | 1 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
const ll INF = 1e18;
int main() {
int N, ans = 0;
cin >> N;
vector<int> A(N);
map<int, int> mp;
rep(i, N) {
cin >> A[i];
mp[A[i]]++;
}
sort(A.begin(), A.end());
for... | #include <bits/stdc++.h>
// #define int long long
#define Matrix vector<vector<int> >
// #define Matrix vector<vector<int> >
#define double long double
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define td(v) v.begin(),v.end()
#define tdr(v) v.rbegin(),v.rend()
#define endl "\n"
#defi... | 0 |
//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)... | #include <iostream>
#include <vector>
//#include <string>
//#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;... | 0 |
#include <iostream>
#include <string>
typedef long long ll;
std::string alphabet = "abcdefghijklmnopqrstuvwxyz";
ll N;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> N;
std::string ans = "";
while (N) {
N--;
ans = alphabet[N % 26] + ans;
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
bool g(ll a,ll b){
return a>b;
}
int main(){
string S;
cin>>S;
set<char> s;
if(S.length()<26){
for(ll i=0;i<S.length();++i){
s.insert(S[i]);
}
cout<<S;
for(ll i=0;i... | 0 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string>
using namespace std;
int main() {
double x1, y1, x2, y2, num, ans = 0, dou = 1, xx;
cin >> x1 >> y1 >> x2 >> y2;
num = (x2 - x1)*(x2 - x1) + (y2 - y1)*(y2 - y1);
while (dou < num) {
dou *= 10;
}
xx = dou;
for (int i = 0; i < 100; i++) ... | #include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
using namespace std;
int main() {
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%.7f \n", sqrt(pow((x2-x1), (double)2) + pow((y2-y1), (double)2)));
} | 1 |
#include <cstdio>
int n, sum, p[3];
bool f;
int main(){
while(scanf("%d", &n) != EOF){
if(n == 0) break;
for(int i = 0; i < n; i++){
f = false;
scanf("%d %d %d", &p[0], &p[1], &p[2]);
sum = p[0] + p[1] + p[2];
for(int j = 0; j < 3; j++)
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string str;
cin >> n;
for(int i=0;i<n;i++){
int out = 0;
int a[4] = {};
while(out != 3){
cin >> str;
if(str == "OUT") out++;
else if(str == "HOMERUN"){
a[3] += a[0]+a[1]+a[2]+1;
a[0] = a[1... | 0 |
#include<iostream>
using namespace std;
int main(){
int n = 1;
while(1){
cin >> n;
if (n == 0){
break;
}
int apoint = 0;int bpoint = 0;
int i = 1;
for(i = 1;i <= n;i++){
int a = 0;int b = 0;
cin >> a >> b;
if(a == b){
apoint = apoint + a;
bpoint = bpoint + b;
}
else if(a > b){
apoint = apoint + a + b;
}
else{
bpoint ... |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX ... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
int n, m;
int main() {
int i, d;
cin >> n >> m;
for(i=1, d=m; d>0; i++, d-=2) printf("%d %d\n", i, i+d);
for(i=m+2, d=m-1; d>0; i++, d-=2) printf("%d %d\n", i, i+d);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define FORW(a, b, c) for(int a = b; a >= c; --a)
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int)a.size())
#define int long long
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
const in... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using tiii = tuple<int,int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <deque>
using namespace std;
int main() {
//input
long n; cin >> n;
vector<int> v(n + 1);
for(int i = 1; i < n + 1; i++) cin >> v[i];
vector<int> e(100001,0)... | 0 |
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
void caesar(string &s, int n) {
int i;
char c;
for (i = 0; c = s[i]; i++) {
if (c >= 'a' && c <= 'z')
s[i] = 'a' + (c - 'a' + n) % 26;
}
}
int main() {
int n;
string s;
while (getline(cin, s)) {
for (n = 0; n < 26... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, q;
while (scanf("%d %d", &n, &q) && n){
int a[128] = {0};
for (int i = 0; i < n; i++){
int m;
scanf("%d", &m);
for (int j = 0; j < m; j++){
int x;
... | 0 |
#include<bits/stdc++.h>
//今日も20分で解けなかったので、他の方のプログラムで勉強させていただきました。
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int num_max,num_min;
for(int i = 0; i < M; i++){
if(i ==0 ){
cin >> num_max >> num_min;
}else{
int a,b;
cin >> a >> b;
if(num_max < a){num_max = a;}
if... | //include
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
//using
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
usin... | 1 |
#include <iostream>
using namespace std;
bool cell[12][12];
void search(int i, int j){
if(i<0 || i>11 || j<0 || j>11) return;
if(cell[i][j]) cell[i][j] = false;
else return;
search(i+1, j);
search(i-1, j);
search(i, j+1);
search(i, j-1);
}
int main(){
while(1){
int ans = 0;
//ÇÝÝ
bool flag = fals... | #include <cstdio>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int par[16][16];
int rank[16][16];
char map[16][16];
int cnt;
void init();
void unite(int y1, int x1, int y2, int x2);
int find(int y, int x);
int main()
{
while (scanf("%s", &map[1][1]) != EOF){
for (int i = 2; i <= 12; i++) scan... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll 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 = vect... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
ll x;
cin >> n >> x;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
sort(a.begin(),a.end());
ll i=0;
while(x-a.at(i)>=0){
x-=a.... | 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<ll, int> pli;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
rep(i, n - 1){
if(s.substr(i, 2) == "AC"){
cout << "Yes" << endl;
retur... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll ... | #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-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using vi = vector<int>;
using pii = pair<int, int>;
#define fir first
#define sec second
template<class T> inline bool chmin(T &a, T b) {
i... | 0 |
#include <cstdio>
#include <cstring>
#include <vector>
int main()
{
char str[1001], buff[1001], command[100];
int q, a, b;
scanf("%s", str);
scanf("%d", &q);
for(int i = 0; i < q; i++){
scanf("%s", command);
if(strcmp(command, "print") == 0){
scanf("%d", &a);
... | #include<iostream>
#include<string>
#include<sstream>
using namespace std;
int main()
{
string original;
int n;
getline(cin, original);
cin >> n;
//cout << original << endl;
//cout << n << endl;
while (n--) {
string order;
cin >> order;
int a, b;
cin >> a >> b;
if (order == "print") {
cout << origi... | 1 |
#include <bits/stdc++.h>
using namespace std;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
int main() {
int N,M;
cin >> N >> M;
vector<int> p(M);
vector<string> S(M);
for(int i=0;i<M;i++) {
cin >> p.at(i) >> S... | #include<iostream>
#include<vector>
using namespace std;
vector<int> v[10000], rev[10000], order, group(10000, 0);
vector<bool> vis(10000);
void dfs(int x){
vis[x] = true;
for(int j : v[x]){
if(!vis[j]) dfs(j);
}
order.push_back(x);
}
void rdfs(int x, int k){
group[x] = k;
vis[x] = tr... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
templa... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | 1 |
#include<bits/stdc++.h>
#define no {puts("No");return 0;}
#define yes {puts("Yes");return 0;}
#define nc() getchar()
using namespace std;
const int N=300010;
/*inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}*/
inline int read... | #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... | 0 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.s... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
#define INF 1e15
int main()
{
string s;cin>>s;
ll hash[1000]={0};
for(int i=0;i<s.length();i++)
hash[s[i]-'0']++;
ll count=0;
ll n=s.length();
for(int i=0;i<1000;i++)
count+=(hash[i]*(hash[i]-1))/2;
ll res=(((n*(n-1))/2))-count+1;
cout<<res<<endl;;
} | 1 |
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
#define N 500005
#define ll long long
ll n;
double a[N];
ll cnt2[N],cnt5[N],ten[N];
ll sum[5005][5005],ans;
ll len1,len2;
int main(){
scanf("%lld",&n);
for(ll i=1;i<=n;i++){
scanf("%lf",a+i);
ten[i]=9;
ll JZY=llround(a[i]*1000000000);
// ... | #include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<int,int>P;
map<P,int>mp;
int main(){
int n;
cin>>n;
while(n--){
ld s;
cin>>s;
ll k=ll(s*1000000000.0+0.5);
ll cnt2=0,cnt5=0;
while(k%2==0){
k/=2,cnt... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
string str;
while(cin>>str){
if(str.length()!=2)
reverse(str.begin... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;cin>>s;
if(s.size()==2)cout<<s;
else rep(i, 3)cout<<s[2-i];
return 0;
} | 1 |
#include<iostream>
using namespace std;
const int MAX = 50;
int main()
{
while (true)
{
int n, p;
cin >> n >> p;
if (!n && !p)
break;
int pOfCan[MAX] = { 0 };
int pOfBowl = p;
int winIdx = -1;
int idx = 0;
while (true)
{
if (idx > n - 1)
idx = 0;
if (pOfBowl > 0)
{
pOfCan[idx]... | #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_W=20;
const int DIRECTIONS=4;//0:up/1:right/2:down/3:left
const int MAX_DEPTH=10;
const int INF=1<<27;
struct tpl{
int ary[MAX_W][MAX_W];
int depth;
int last... | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
int p;
bool check(int x) {
cout << x << endl;
string s; cin >> s;
if (s == "Vacant"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((i... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int dig=60;
#define N 233
inline ll read(){
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
i... | #include <iostream>
using namespace std;
int main(){
int n,p,i,m,a=0,I;
int box[100]={};
while(1){
cin>>n>>p;
a=0;
if(n==0&&p==0) break;
else{
while(1){
for(i=0;i<n;i++){
m=i;
if(p>0){
box[m]+=1;
p-=1;
}
else if(p==0){
for(I=0;I<n;I++){
if(box[I]==0) a+... | 0 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int vis[10],ans[10],vis1[10];
int a[100],b[100],k=0;
char mp[10][10];
struct note
{
int x,y;
} l[1000];
int check(int x,int y)
{
for(int i=0; i<k; i++)
{
if(l[i].x==x||l[i].y==y||abs(x-l[i].x)==abs(y-l[i].y))
r... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48... | 0 |
#include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
using cost_t=int;
struct Edge {
int from, to;
cost_t cost;
Edge(int from, int to, cost_t cost) : from(from), to(to), cost(cost) {}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
vector<int> articulatio... | #include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T f=0,x=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
namespace run{
int s[1009][1009];
char c[1009][1009];
char c4[10][10]={
{'a','a','b','c'},
{'d','d... | 0 |
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
double d(double x, double y, double a, ll b) {
return sqrt((x - a) * (x - a) + (y - b) * (y - b));
}
ll fact(ll n) {
if(n == 0) return 1;
ret... | #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)... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int a,b,c,N;
while(cin >> a >> b >> c && a){
cin >> N;
vector< vector<int> > v(N,vector<int>(4));
vector<int> chk(a+b+c,2);
rep(i,N){
rep(j,4){
cin >> v[i][j];
if(j!... | #include <iostream>
#include <string>
using namespace std;
int main(){
int a;
int b;
int c;
int h;
int n;
while(cin >>a>>b>>c){
if(a==0&&b==0&&c==0){break;}
cin >>n;
int d[n];
int e[n];
int f[n];
int g[n];
int i[a+b+c];
h=0;
while(h<n){
cin >>d[h];
cin >>e[h];
cin >>f[h];
cin >>g[h];
h=h+1;}
h=0;
while(h<a+b+c){
i[h]=2... | 1 |
#include <iostream>
using namespace std;
int main() {
// 一年の秒数
double score;
double leate;
cin >> score >> leate;
// 以下のコメント/* */を消して追記する
cout << leate * 2 - score << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin >> k >> n;
int a[n];
int d=0,e;
for(int i=0;i<n;i++){
cin >> a[i];
if(d<a[i]){
d=a[i];
e=i;
}
}
cout << max(a[e]- 1 -(k-a[e]),0);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9 * 2;
int main() {
int a[3];
rep(i, 3) cin >> a[i];
int k;
cin >> k;
sort(a, a + 3, greater<int>());
ll out = a[0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 1 |
#include <bits/stdc++.h>
#include<math.h>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main () {
int k, x ;
cin >> k >> x ;
int t = x + (k - 1) ;
int p = x - (k... | // 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 ... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<tuple>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define sc... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a%b ==0){
cout<<(a/b)*c<<endl;}
else{
cout<<((a/b)+1)*c<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
int n;
int a[maxn], prep[maxn], sufp[maxn];
ll ans = 1e18;
ll pre[maxn], suf[maxn];
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
int cur = 1;
pre[1] = a[1];
for(int i = 2; i <= n; ++i) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define ff first
#define INF LLONG_MAX
#define ss second
#define range(x) (x).begin(), (x).end()
#define vll vector<ll>
#define vstr vector<string>
#define vvll vector<vector<ll>>
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include... | 1 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int main(){
char str[20];
scanf("%s",str);
reverse(str,str + strlen(str));
printf("%s\n",str);
return 0;
} | #include<iostream>
#include<cstring>
using namespace std;
void reverseChar(char* str);
char str[50],rstr[50];
int i;
int main()
{
cin>>str;
reverseChar(str);
cout<<str << endl;
return 0;
}
void reverseChar(char* str)
{
for(i=0;i<strlen(str)/2;i++)
{
char temp= str[i];
str[i]... | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
bool f(const vector<int>& v1, const vector<int>& v2) {
int c1 = accumulate(v1.begin... | #include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
int sum = 1, cnt = 0;
while(sum < b) {
sum += a-1;
... | 0 |
#ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var)\
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#endif
using namespace std;
template <typename Iter>
Iter part... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
using PL = pair<ll, ll> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int modpow(ll a, ll n){
... | 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(void){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
int ans = 1001001001;
rep(i,n) {
int cnt = 0;
while(a[i] % 2 == 0) {
a[i] /= 2;
... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353;//786433;//998244353;
const double Pi = acos(-1);
void ... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
typedef vector<int> vi;
typedef long long lint;
typedef unsigned int uint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
typedef unsigned long long ulint;
#define endl '\n'
#define fst first
#define sed second
#define pb push_back
#... | 1 |
//Author: AnandRaj anand873
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll; ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
int read(){
int i;
scanf("%lld",&i);
return i;
}
using vi=vector<int>;
#define PB push_back
#define ALL(x) x.begin(),x.end()
int gcd(int a,int b){
return b?... | 1 |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) ... | #include <iostream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
static const int MAX = 100000;
vector<int> graph[MAX];
vector<bool> discovered(MAX, false);
vector<int> prenum(MAX, 0), parent(MAX, 0), lowest(MAX, 0);
int V, E;
int t = 0;
void dfs(int vertex, int prev)
{
prenum[v... | 0 |
#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
string s;
int n,ans[nmax];
bool check(){
for(int i=2;i<n;i++){
if((ans[i-1]==0)){
if((s[i-1]=='o'))
ans[i]=ans[i-2];
else
ans[i]=1-ans[i-2];
}
else{
if(s[i-1]=='o')
ans[i]=1-ans[i-2];
else
ans[i]=ans[i-2];
}
}
i... | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main(){
int X, Y;
cin >> X >> Y;
int ans = 0;
if(X == 1 && Y == 1) ans += 400000;
if(X == 1) ans += 300000;
... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
using namespace std;
using ll = long long;
int main() {
ll x;
cin >> x;
ll ans = (x/1... | #include<iostream>
using namespace std;
int main()
{
int a,sum,e,f;
cin>>a;
e=a*a;
f=e*a;
sum=a+e+f;
cout<<sum<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, x[N], y[N], ansd = INT_MAX;
char d[N];
void solvelr()
{
vector<int> a[N], b[N];
for (int i = 0; i < n; ++i)
{
if (d[i] == 'L')
a[y[i]].push_back(x[i]);
else if (d[i] == 'R')
b[y[i]].push_back(x[i]);
}
for (int i = 0; i < N; ++i)... | #include <iostream>
#include <string>
using namespace std;
void shake(int D[], char c) {
int tmp;
switch (c) {
case 'S':
tmp = D[0];
D[0] = D[4];
D[4] = D[5];
D[5] = D[1];
D[1] = tmp;
break;
case 'E':
tmp = D[0];
D[0] = D[3];
D[3] = D[5];
D[5] = D... | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<string.h>
#include<math.h>
#include<utility>
#include<algorithm>
#include<functional>
using namespace std;
int n,q;
int a=0;
int c=0;
int s[10000]={};
int t[10000]={};
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>s[i];
}
cin... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N,a,c=1,A[100002]={};A[0]=3;
cin>>N;
for(int i=0;i<N;i++){
scanf("%d",&a);
c*=(A[a]-A[a+1]++);
c%=1000000007;
}
cout<<c<<endl;
} | 0 |
#include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
int in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}
int in() {return in(gcu());}
bool scan(int &n){int c=gcu();return c==EOF?fa... | #include <iostream>
#define MAXN 1000001;
using namespace std;
int m,e,sum1,sum2,x,y,z,minn;
int main(){
while(1){
cin >>e;
if(e==0)break;
x=y=z=0;
minn=MAXN;
while(1){
sum1=z*z*z;
if(e<sum1)break;
y=0;
while(1){
sum2=sum1+y*y;
if(e<sum2)break;
if(y+z+(e-sum2)<minn)minn=y+z+(e-sum2);
... | 1 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct edge{ int u,v,cost; };
vector<edge> edges;
int uf_par[10000];
int uf_rank[10000];
void uf_init(int uf_n){
for(int i = 0;i < uf_n;i++){
uf_par[i] = i;
uf_rank[i] = 0;
}
}
int uf_find(int uf_x){
if(uf_par[uf_x] == uf_x) ret... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | 0 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string s;
cin >> s;
s[3] = '8';
cout... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
cout << S.substr(0, S.size() - string("FESTIVAL").size()) << endl;
}
| 0 |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
const int MAXN=100005;
int n,m;
int co[MAXN];
bool vis[MAXN];
vector<int> E[MAXN];
bool dfs(int u){
bool tag=1;
vis[u]=1;
for(int i=0;i<(int)E[u].si... | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
using namespace std;
typedef long long ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> in... | #include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
typedef uint64_t ull;
typedef int64_t sll;
static const ull MOD = 1000000007LL;
int n;
int k;
int q;
ull a[200019];
ull umin (ull a, ull b) {
return (a < b) ? a : b;
}
ull umax (ull a, ull b) {
return (a > b) ? a... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n;i>=0;i--)
#define INF 100000005
#define MAX 100001
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
//__gcd(a,b), __b... | #include <iostream>
#include <string>
using namespace std;
int countup_days(int m, int d) // m月d日が、1月1日から何日目か返す
{
int sum = 0;
const int month[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,};
for (int i=1; i<m; i++) {
sum += month[i];
}
return sum + d -1;
}
string what... | 0 |
#include <climits>
#include <iostream>
#include <iterator>
#include <algorithm>
#include <vector>
typedef std::vector<int> TList;
long long int c;
void merge(TList& A, int left, int mid, int right)
{
int n1 = mid - left;
int n2 = right - mid;
TList L(A.begin() + left, A.begin() + left + n1);
L.push_back(INT_M... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
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 << 3) + (x << 1) + (ch ^ 48); ch... | #include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 100010
int a[5][MAXN],n,tg[5],to[MAXN];
int Abs(int x)
{
return x>=0?x:-x;
}
int main()
{
scanf("%d",&n);
for(int i=0;i<3;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(int i=1;i<=n;i++)
{
to[i]=a[1][i]/3+1;
if(!((a[0][i]-a[1][... | 0 |
#include <iostream>
#include <vector>
using namespace std;
#define SENTINEL 2000000000
long long merge(vector<int>& array, int left, int mid, int right) {
long long cnt = 0; // 転倒数を数える
// 分割した配列LとRを生成
int n1 = mid - left; // Lの大きさ
int n2 = right - mid; // Rの大きさ
vector<int> L(... | #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... | 1 |
#include "bits/stdc++.h"
#define rep(i,a,n) for(int i = a;i < n;i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int main(){
int n,memo;
priority_queue<int,vector<int>,greater<int> > que;
cin >> n;
int a[n];
rep(i,0,n){
cin >> a[i];
}
sort(a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
using ll = long long;
ll gcd(ll a, ll b){
//cout << "a : " << a << "b : " << b << endl;
if(b == 0)
return a;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
ll g = gcd(a, b);
return a / g * b;
}
... | 1 |
#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
using namespace std;
string convert(string str) {
int idx = 0;
for (;;) {
idx = str.find("Hoshino", idx);
if (idx == string::npos) break;
str.replace(idx, 7, "Hoshina");
idx += 7;
}
return str;
... | #include <stdio.h>
#include <string.h>
int main()
{
int n;
char *p;
char str[1000];
scanf("%d\n",&n);
while(n--){
gets(str);
for(p;p=strstr(str,"Hoshino");)p[6]='a';
puts(str);
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(){
long long n,ans = 1;
map<int,long long> prime;
cin >> n;
for(int num = n;2 <= num;num--){
int buf = num;
for(int i = 2;i * i<= n;i++){
int count = 0;
while(buf % i == 0)buf /= i,count... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n;
char s[maxn];
typedef long long ll;
const ll mod = 1e9 + 7;
ll fac(int x) { ll ret = 1; for(int i = 1; i <= x; ++i) ret = ret * i % mod; return ret;}
ll f(int i, int j)
{
if(i == 0) return j == 0;
if(s[i] == 'B')
{
if(j & 1)
return ... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.