code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <climits>
using namespace std;
#define int long long
const int INF=1e18;
const int MAX_V=2000;
int v,g[MAX_V][MAX_V],r;
void warshall(){
for(int k=0;k<v;k++)
for(int i=0;i<v;i++)
for(int j=0;j<v;j++) g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
}
signed main(){
int e;
cin>>v>>e;
... | #include <iostream>
#include <algorithm>
using namespace std;
static const int SIZE = 101;
static const long long int INF = 1e18;
long long int d[SIZE][SIZE] = { 0 };
void solve()
{
for (int i = 0; i < SIZE; ++i)
{
for (int j = 0; j < SIZE; ++j)
{
d[i][j] = INF;
}
d[i][i] = 0;
}
int V, E;
cin >> V >> ... | 1 |
// Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
//
//
void solve(){
ll a, b;
cin>>a>>b;
cout<<a*b;
}
int main(){
hs;
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
void abc_164a();
void abc_165a();
void abc_166a();
void abc_167a();
void abc_168a();
void abc_169();
int main()
{
//abc_160a();
//abc_... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef pair<ll,ll> PLL;
#define REP(x,l,u) for(ll x = l; x < u; x++)
#define RREP(x,l,u) for(ll x = l; x >= u; x--)
#define all(x) x.begin(), x.end... | #include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int64_t f(int64_t x,int64_t y){
if(y==0)
return 1;
else if(y%2==0)
return (f(x,y/2)*f(x,y/2))%mod;
else
return (f(x,y/2)*((x*f(x,y/2))%mod))%mod;
}
int64_t comb(int64_t x,int64_t y){
int64_t ans=1;
for(int64_t i=y;1<=i;i--... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int nMember, nNeedMember;
while(cin >> nMember >> nNeedMember, nMember | nNeedMember) {
vector<int> dates(100, 0); //one base
for(int i = 0; i < nMember; ++i) {
int ndate;
cin >> ndate;
for(int j ... | #include<stdio.h>
#include<algorithm>
using namespace std;
char map[15][15],moji[15];
void func(int ,int);
int main(void){
int i,j;
while(1){
for(i=0;i<12;i++){
if(scanf("%s",map[i])==EOF){
return 0;
}
}
/*for(i=0;i<=12;i++){
printf("%s",map[i]);
}
printf("\n");*/
int cnt=0;
for(i=0;i<12;i+... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <math.h>
using namespace std;
int main(void){
int N,Q;
cin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
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; } return 0; }
c... | 1 |
#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
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES"... | #include<iostream>
#include<cstring>
using namespace std;
int main()
{
char n[10];
cin>>n;
for(int i=0;i<strlen(n);i++)
{
if(n[i]=='A'&&n[i+1]=='C')
{
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 2e5 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
const int Max_N=1010;
int A[Max_N][Max_N];
int main(){
int N;
cin >> N;
rep(i,N){
rep(j,N-1){
int a;
cin >> a;
a--;
A[i][j]=a;
}
}
vector<int> op(N);
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... | #include <bits/stdc++.h>
using namespace std;
int fact(int n){
if(n == 1) return 1;
else return n * fact(n-1);
}
int main(){
int n;
cin >> n;
vector<pair<int,int>> array(n);
for(int i=0;i<n;i++) cin >> array.at(i).first >> array.at(i).second;
sort(array.begin(),array.end());
double sum ... | 0 |
#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... | #include <iostream>
using namespace std;
void call(int num) {
for (int i = 1; i <= num; i++) {
int x = i;
//3????????°?????¨???
if (x % 3 == 0) {
cout << " " << i;
}
//3???????????°?????¨???
else {
do {
if (x % 10 == 3) {
cout << " " << i;
break;
}
x/= 10;
} while (x)... | 1 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD=1e9+7;
#define MAX 1000001
long fac[MAX], finv[MAX], inv[MAX];
void fact() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; ++i){
fac[i] = fac[i - 1] * i ... | #include <iostream>
#include <algorithm>
const int MAX_N = 100;
const int INF = 999999999;
using namespace std;
int dp[MAX_N+1][MAX_N+1];
int p[MAX_N+1];
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
dp[i][i] = 0;
}
for (int i = 1; i <= n; i++) {
cin >> p[i-1] >>... | 0 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
string s,t;
cin>>s;
t = s;
vector<int> alp(26);
for(auto c:s)alp[c-'a']++;
string ans = "zzzzzzzzzzzzzzzzzzzzzzzzzzz";
auto chmin = [](auto& a,auto b){if(a>b)a=b;};
while(1){
for(int i=0;i<26;++i)if(alp[i]==0){
string tmp = s;
... | #include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = (int)s.size();
if (n < 26) {
map<char, bool> mp;
for (auto&& c : s) {
mp[c] = true;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int main() {
int n,k;
while(cin >> n >> k, n && k) {
long long INF = 1e10;
vector<vector<long long>> dist(n, vector<long long>(n, INF));
for(int ... | #include <cstdio>
#include <algorithm>
using namespace std;
#define INF (1<<27)
int cost[100][100];
int main() {
int n,k;
while(scanf("%d %d",&n,&k),n) {
fill((int*)cost,(int*)(cost+100),INF);
for(int i=0;i<k;i++) {
int a,b,c;
scanf("%d",&a);
if(a==0) {
scanf("%d %d",&a,&b);
if(cost[a-1][b-1]==IN... | 1 |
#include <stdio.h>
struct Dice
{
int n[6];
};
Dice InputDice()
{
Dice d;
for(int i = 0; i < 6; ++i)
{
scanf("%d", &d.n[i]);
}
return d;
}
Dice SetDice(int a, int b, int c, int d, int e, int f)
{
Dice dice;
dice.n[0] = a;
dice.n[1] = b;
dice.n[2] = c;
dice.n[3] = d;
dice.n[4] = e;
dice.n[5] = f;
r... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<vector>
#include<functional>
using namespace std;
typedef long long LL;
inline LL read()
{
LL kk=0,f=1;
char cc=getchar();
while(cc<'0'||cc>... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const s... | #include<iostream>
using namespace std;
int main()
{
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (((e - a) > k) ? ":(" : "Yay!") << endl;
return 0;
} | 1 |
#pragma GCC optimize ("Ofast")
#include "bits/stdc++.h"
#define PI 3.141592653589793
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
// Use for file I/O;
#define FIN string _fname = "paintbarn"; \
string _is = _fname + ".in", _os = _fname + ".out"; \
freopen(_is.c_str(), "r", stdin); ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
using ll = long long;
using namespace std;
void chmax(ll &a, ll b){ if(a < b) a = b; return; }
ll n, a[16][16], dp[1<<16];
int main(){
cin >> n;
rep(i,n) rep(j,n) cin >> a[i][j];
... | 1 |
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> CuSumWest(N,0),CuSumEast(N,0);
std::vector<int> CDNum(N,0);//i番目がリーダーだったときに向きを変えなければならない人の数 = CDNum[i]
for(int i=0;i<N;i++){
if(i != 0) {
CuSumEast[i] = CuSumEast[i - 1];
CuSum... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
int n;
cin >> n;
vector<int> a(n + 2);
rep(i, n) cin >> a[i + 1];
a[0] = 0, a[n + 1] = 0;
int res = 0;
rep(i, n + 1) res += abs(... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2010;
int n, m, a[N][N];
char s[N][N];
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i) scanf("%s", s[i]);
for (int i = 0; i < n - 1; ++i) {
for (int j = 0; j < m - 1; ++j) {
... | #include<bits/stdc++.h>
using namespace std;
const int S=(1<<20)+5;
char buf[S],*H,*T;
inline char Get()
{
if(H==T) T=(H=buf)+fread(buf,1,S,stdin);
if(H==T) return -1;return *H++;
}
inline int read()
{
int x=0;char c=Get();
while(!isdigit(c)) c=Get();
while(isdigit(c)) x=x*10+c-'0',c=Get();
ret... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string N;
cin >> N;
bool flag = false;
for (int i = 0; i < 3; i++)
{
if (N[i] == '7')
{
flag = true;
break;
}
}
if (flag)
{
puts("Yes");
}
else
{
puts("... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
us... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
cin.get();
for( int i = 0; i < n; ++i ){
string s;
getline( cin, s );
int index = 0;
while( ( index = s.find( "Hoshino", index ) ) != string::npos ){
s.replace( index, 7, "Hoshina" );
index += 7;
}
cout << ... | /*
"Won't stop until I'm phenomenal."
- Phenomenal, Eminem
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int... | 0 |
#include<iostream>
#include<sstream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int m,ni,na,i,j,k,ans,idx;
while(cin>>m>>ni>>na,m||ni||na){
int p[m];
for(i=0;i<m;i++) cin>>p[i];
sort(p,p+m);
ans=0;
idx=ni;
for(i=ni;i<=na;i++){
//cout<<p[m-i]-p[m-i-1]<<endl;
if(p[m-i]-p[m-i-1]>=ans){
ans=p[m-i]-p[m-i-1... | 0 |
#include<cstdio>
#include<map>
using namespace std;
int par1[200005],par2[200005];
int rank1[200005],rank2[200005];
typedef pair<int,int> P;
map<P,int>m;
int find(int *par,int x)
{
if(x==par[x])
return x;
else
return par[x]=find(par,par[x]);
}
void unite(int *par,int *rank,int x,int y)
{
x=f... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
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) { if (b<a) { a=b; return 1; } return 0;... | 0 |
/* 特徴 */
/* 教訓 */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main(... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int arr[4]={0,300000,200000,100000};
int x,y;
cin >> x >> y;
int ans=0;
if(x<=3) ans+=arr[x];
if(y<=3) ans+=arr[y];
if(x==1&&y==1) ans+=400000;
cout << ans << endl;
} | #include<iostream>
#include<ctype.h>
#include<queue>
#include<cstdio>
#include<algorithm>
using namespace std;
string s,ss;
queue<int> q;
bool vis[200];
int main(){
int l;cin>>l;int er=l,ans=0;
cin>>s>>ss;
if(s==ss)goto portal0;
if(s[0]!=ss[0])goto portalfail;
for(int i=0;i<l;++i)vis[s[i]-'a']=1;
for(int i=0;i<l... | 0 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
#define rep(a,n) for(ll a = 0;a < n;a++)
static const ll INF = 1e15;
static const ll mod = 1e9+7;
template<typename T>
static inline void chmi... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c;
cin>>a>>b>>c;
vector<int>v;
v.push_back(a);
v.push_back(b);
v.push_back(c);
sort(v.begin(),v.end());
cout<<v[0]+v[1];
}
| 1 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Downloa... | #include<algorithm>
#include<iostream>
#include<cstdio>
int main()
{
int a[10];
int m;
for(int i=0;i<=5;i++){
std::cin>>a[i];
}
std::sort(a,a+4);
m=std::max(a[4],a[5]);
std:: cout<<a[3]+a[2]+a[1]+m<<std::endl;
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <cstdlib>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
template <class T>
struct prop_segtree {
int n;
vector<T> data;
vector<bool>... | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
using namespace std;
template<typename OperatorMonoid>
struct SegmentTree {
using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
const H h;
const OperatorMonoid OM0;
int sz, height;
vector<OperatorMonoid... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--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 lo... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,sum,sub,mul;
cin>>a>>b;
sum=a+b;
sub=a-b;
mul=a*b;
int ans = max(sum,max(sub,mul));
if(ans==0)
cout<<0<<endl;
else
cout<<ans<<endl;
} | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
int main(void){
vector<int> w(10);
vector<int> k(10);
int sumw=0,sumk=0;
for(int i=0;i<10;i++)cin>>w[i];
for(int i=0;i<10;i++)cin>>k[i];
sort(w.begin(),w.end());... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define ... | 1 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)re... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans =0;
if(s == "RRR"){ans = 3;}
if(s == "RRS"){ans = 2;}
if(s == "RSR"){ans = 1;}
if(s == "SRR"){ans = 2;}
if(s == "RSS"){ans = 1;}
if(s == "SRS"){ans = 1;}
if(s == "SSR"){ans = 1;}
if(s == "SSS"){ans = 0;}
cout <... | #include<bits/stdc++.h>
using namespace std;
main(){
string s; cin>>s;
int cnt=0, ans=0;
for(int i=0; i<s.length(); i++){
if(s[i]=='R') cnt++;
else{
ans = max(ans, cnt);
cnt=0;
}
}
ans = max(ans,cnt);
cout<<ans;
} | 1 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef vector<int> Vi;
typedef vector<lli> Vl;
typedef pair<int, int> Pii;
typedef pair<lli, lli> Pll;
//===
const int MOD = (int)1e9 + 7;
int main()
{
int N, X;
cin >> N >> X;
vector<int> S(N);
for (int i = 0; i < N; ++i) cin >> S[i];
so... | 1 |
#include <stdio.h>
int main(){
int n, k;
scanf("%d %d", &n, &k);
char code[n + k + 1];
scanf("%s", code);
int temp = 0;
for (int i = 0; i < n + k + 1; i++){
if (i != n){
if (code[i] >= '0' && code[i] <= '9'){
temp++;
}
}
else if (code[i] == '-'){
temp++;
}
}
if (temp == n + k + 1){
puts... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
vector<string> ans(100, "");
for(int... | 0 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
using namespace std;
#define N 200002
int fdsu[N],sdsu[N];
vector<int> g[N];
bool isSorted[N];
int f(int *dsu,int x) {
if(dsu[x]==x) {
return x;
}
return dsu[x] = f(dsu,dsu... | #include<bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long int
#define ll long long
#define ld long double
#define vi vector<int>
#defi... | 0 |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
if (s.size()>k) {
string sub = s.substr(0, k);
cout << sub << "..." <<endl;
}
else{
cout << s <<endl;
}
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 |
#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;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
const static int64_t mod = 1000000007;
int N;
cin >> N;
vector<int> A_vec(N);
for (int i = 0; i < N; ++i)
cin >> A_vec.at(i);
vector<int> x_vec(N + 1, 0), y_vec(N + 1, 0), z_vec(N + 1, 0);
for (int i = 0; i < N; ++i) {
... | 1 |
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline v... | #include <bits/stdc++.h>
#define ii pair <int , int>
#define is pair <int, string>
#define ic pair <int, char>
#define ll long long
#define mx 100000
#define sf scanf
#define sf(n) scanf("%d",&n)
#define pf printf
using namespace std;
vector <int> v;
/*int intConvert(string s){
int n;
stringstream geek(s);
... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 1e9 + 7;
void solve() {
int n;
int mul[1001];
int kmax = 0;
cin >> n;
for (int i =0; i <= n; ++i)
mul[i] = 0;
for (int i = 2; i <= n; ++i) {
int j = i;
int k = 2;
while(j > 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
////////////////////////////////////////////////
int main()
{
double r;
cin >> r;
cout << 2.0 * r * 3.14159265 << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) ((x).size()))
typedef long long ll;
typedef long double ld;
ll mod = 998244353;
const ll MAX = 3000000;
ll f[MAX], inv[MAX], finv[MAX];
void init() {
inv[1] = 1;
for (int i = 2; i < MAX; i++)
inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mo... | /*
AuThOr GaRyMr
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) for(... | 1 |
#include <stdio.h>
int main() {
int A, B, pos = 0;
char S[20];
scanf("%d %d %s", &A, &B, S);
for (int i = 0; S[i] != '\0'; i++) {
(S[i] == '-') ? pos += i + 1 : pos += 0;
}
pos == A + 1 ? puts("Yes") : puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int a, b;
string s;
cin >> a >> b >> s;
if(a+b+1 != s.size() || s[a]... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int d, t, s;
cin>>d>>t>>s;
if(d<=t*s)
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
} | #include<stdio.h>
int D,T,S;
int main()
{
scanf("%d %d %d",&D,&T,&S);
if((D+S-1)/S<=T)printf("Yes");
else printf("No");
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int A,B,M;cin>>A>>B>>M;
vector<int>Q(A);for(int i=0; i<A;i++)cin>>Q[i];
vector<int>W(B);for (int i=0;i<B;i++)cin>>W[i];
vector<pair<pair<int,int>,int>>C(M);for(int i=0;i<M;i++)cin>>C[i].first.first>>C[i].first.second>>C[i].second;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
... | 0 |
#include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int r;
cin >> r;
cout << 2 * 3.141 * r << endl;
}
| 1 |
#include<stdio.h>
int main() {
int x, y, z, res;
scanf("%d%d%d", &x, &y, &z);
if(x>=y) {
if(z%x == 0) {
res = z/x;
} else {
res = z/x+1;
}
} else {
if(z%y == 0) {
res = z/y;
} else {
res = z/y+1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 |
#include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
const int INF=1e5;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int main(){
int h,w,a[1009][1009];
string s[1009];
cin >> h >> w;
memset(a, -1, sizeof(a));
for(int i=0;i<h;i++)cin >> s[i];
queue<P> q;
for(int i=0;i<h;i++){
for(i... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
#include <complex>
using... | 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using Tree = tree<T, null_t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... | 1 |
#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 <time.h>
#define int long long
#define ... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#d... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> a(n+2);
a[0] = 0;
a[n+1] = 0;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += abs(a[i] - a[i-1]);
}
s... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef vector <string> vs;
int main(void){
map <char, int> m;
int num[] = {1,5,10,50,100,500,1000};
for (int i=0; i<7; i++)
m["IVXLCDM"[i]] = num[i];
char c;
string r;
while (cin>>r){
int tmp, tmp2= m[r[0]],s=0;
i... | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
vector <int> edges[1000];
vector <int>... | #include <bits/stdc++.h>
using namespace std;
int n, m, pre[1001];
bool vis[1001];
vector<int> adj[1001];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
adj[a].push_back(b);
}
for(int i = 1; i <= n; i++){
memset(vis, 0, si... | 1 |
#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... | #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 |
#include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll,ll> P;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 1 |
#include <iostream>
#include <functional> // std::function
#include <vector> // std::vector
struct edge {
using weight_type = size_t;
size_t to;
edge(size_t to) : to(to) { }
size_t cost() { return 1; }
};
struct graph {
using edge_type = edge;
const bool is_directed;
const size_t coun... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
// cout << fixed << setprecision(10) << flush;
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
vector<vector<int>> edge(n, vector<int>());
vector<vector<int>> weight(n, vector<int>());
for(int i=0; i<n-1; i++... | 0 |
#include <cstdlib>
#include <string>
#include <iostream>
#include <sstream>
using namespace std;
int main()
{
string str[2];
for (int i = 0; i < 2; i++)
{
getline(cin, str[i]);
// cout << "Input: " << str[i] << endl;
}
str[1] += ' ';
int num = atoi(str[0].c_str());
// cout... | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<set>
#include <valarray>
#include<stack>
#include<sstream>
#include<math.h>
using namespace std;
void Solution()
{
long int a;
... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
int main(){
ll n;
cin >> n;
cout << 0 << endl;
vector<string> ans(n);
cin >> ans[0];
if(ans[0] == "Vacant"){
return 0;
}
cout << n-1 << endl;
cin >> ans[n-1];
if(ans[n-1] == "V... | 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 n;
cin >> n;
cout << n / 3 << endl;
return 0;
} | #include <stdio.h>
int main() {
long long int N;
long long int total = 0;
scanf("%lld", &N);
int i;
for( i = 1; i <= N; i++){
if(i % 3 != 0 && i % 5 != 0 ){
total = total + i;
}
}
printf("%lld\n", total);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECC... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... | 0 |
#include <iostream>
#include <string>
#include <set>
using namespace std;
int main(){
string S;
cin >> S;
set<char> characters;
for(int i=0; i<S.size(); i++){
characters.insert(S.at(i));
}
char ans,check='a';
bool flag = true;
for(auto itr=characters.begin();
itr!=characters.end(); itr++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#include <iostream>
#include <set>
int main(void){
string s;cin >> s;
vector<int> v(26,0);
for(char c:s) v[c-'a']++;
for(int i;i<26;i++){
if(!v[i]) {
char c = 'a' +i;
cout << c <<endl;
return 0;
}
}
cout << "None... | 1 |
#include <iostream>
#include <vector>
using namespace std;
void printVector(const vector<int> &A) {
for(int i = 0; i < A.size(); i++) {
cout << A[i];
if(i+1 < A.size()) cout << ' ';
}
cout << endl;
}
int main() {
int n, count = 0;
auto swap = [](int &a, int &b) {
int... | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main(int argc,char** argv) {
int n,t;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int num(int N){
int a = 0 , b = 1, c;
for(int i = 0 ; i < 9 ; i++){
a += N / b % 10;
b *= 10;
}
c = N % a;
return c;
}
int main(){
int N;
cin >> N;
if(num(N) == 0){
cout << "Yes" <<endl;
}
else if(num(N) != 0){
cout << "No" << endl;
... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v... | 1 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define pb push_back
using namespace std;
const int INF = 1e9;
typedef long long ll;
int main(){
int n,q;
cin >> n >> q;
vector <int> res;
int a[n];
int sq = sqrt(n);
int nsq = n/sq+1;
int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
template<class T1, class T2> v... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int b;
cin>>a>>b;
for(int i=0;i<a.size();i+=b){
cout<<a.at(i);
}
cout<<endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
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() {
ll a;
cin >> a;
ll ans = 999;
while(a>99){
ans = ... | 0 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
string s;
cin>>s;
bool f=true;
long long ans=0;
if(s[0]!='A'){
f=false;
}
f(i,2,s.size()-1){
if(s[i]=='C'){
ans++;
}
else if(s[i]-'a'<0){
f=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
vector<ll> enum_divisors(ll N) {
vector<ll> res;
for (ll i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
... | 0 |
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include<iterator>//集合演算(積集合,和集合,差集合など)
#include<map>//map(辞書)
#include<numer... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n;
cin >> n;
vector<vector<int>> v(n,vector<int>(n-1));
rep(... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
void darts();
void longest_dis();
void sum_of_three_integers();
void otoshidama();
int main()
{
//darts();
//longest_dis();
//sum_of_three_integers();
otoshidama();
}
void darts()
{
while (true)
{
... | #include <bits/stdc++.h>
#define ll long long
#define PI 3.14159265359
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
for (int i = 0; i < n; i++) {
double l1 = 0, r1 = PI, l2 = - PI, r2 = 0;
for (int j = 0; j < n; j++) {
if (i != j... | 0 |
#include<stdio.h>
int main(){
int tab[101][3];
int n,a,b,c,d,e,i,j,k,m,t,max,mx,cnt,cn;
for(i=0;i<101;i++){
tab[i][0]=0;
tab[i][1]=i;
tab[i][2]=0;
}
scanf("%d",&n);
m=n*(n-1)/2;
for(k=0;k<m;k++){
scanf("%d %d %d %d",&a,&b,&c,&d);
if(c>d){
tab[a][0]+=3;
}else... | #include <iostream>
#include <bits/stdc++.h>
#define mod 998244353
#define point complex<double>
#define pi acos(-1)
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
void Fastio(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
ld n, dp[305][305][305];
ld solv... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
char turn = 'a';
string a, b, c;
int i = 0, j = 0, k = 0;
cin >> a >> b >> c;
while (i <= a.size() && j <= b.size() && k <= c.size())
{
if (turn == 'a')
turn = a[i++];
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#include <cstdint>
... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#includ... | 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<complex>
#define rep(i, a, n) for(int i=a;i<n;i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define R long double
#define P ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#include <iterator>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define POF pop_front
#define POB pop_back
#define MA make_pair... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a , b;
cin>>a>>b;
int ans =0;
for(int i=a;i<=b;i++)
{
string temp = to_string(i);
string temp1 = temp;
reverse(temp1.begin() , temp1.end());
if( temp == temp1)
ans++;
}
cout<<ans;
} | 0 |
#if 0
date +%Y.%m.%d
题解先咕着。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
inline operator ll () { ll x; return scanf("%lld", &x), x; }
template<class T> inline void operator ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define uint unsigned
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline int read(){
int ... | 1 |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#define IOS ios_base::sync_with_stdio(0); cin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(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 > b) { a = b... | 0 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | #include <iostream>
#include <string>
using namespace std;
#define nullptr NULL
struct node
{
int val;
node* right;
node* left;
node(const int& v = 0) : val(v), right(nullptr), left(nullptr)
{}
};
struct Tree
{
node* root;
};
node* insert(node* root, int v)
{
if (!root)
{
root = new node(v);
return ro... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef double lld;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<double> vdl;
typedef vector<vector<lli>> mat;
typedef vector<vdl> mad;
// typedef unordered_map<lli,unordered_map<lli,lli>> graph;
typedef complex<double> cmp;
typ... | /* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define popb pop_back
#define mt make_tuple
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss se... | 1 |
#include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例：sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.... | #include <bits/stdc++.h>
using namespace std;
const long long MOD=998244353;
long long fact[200009], inv_fact[200009];
long long modpow(long long a, long long n, long long mod){
long long ret = 1;
while(n>0){
if(n&1)ret = ret * a % mod;
a = a * a % mod;
n >>= 1;
}
return ret;
}
long long modinv(l... | 0 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
while( n-- > 0 ){
int out = 0, score = 0, base = 0;
string event;
while( out < 3 ){
cin >> event;
if( event == "OUT" ) out++;
else if( event == "HIT" ){
score +=... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0;i<n;i++){
int p = 0;
int oc = 0;
int rui[4] = {1,0,0,0};
while(1){
string s;
getline(cin,s);
if(s=="OUT") oc++;
else if(s=="HIT"){
if(rui[3]==1) p++;
for(int j=3;j>0;j--)... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
int mi = sum;
for (int i = 0; i < n; ++i) mi = min(mi, abs(sum - n * a[i]));
for (int i = 0; i < n; ++i)... | #include<cstdio>
#include<vector>
using namespace std;
int insSort(vector<int> &arr, int g) {
int v, cnt;
cnt = 0;
for(int i=g; i<arr.size(); ++i) {
int j;
v = arr[i];
for(j=i-g; j>=0 && arr[j]>v; j-=g) {
arr[j+g] = arr[j];
++cnt;
}
arr[j+g] = v;
}
return cnt;
}
int main() {
int n, tmp, m, cnt;... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:16777216")
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memory.h>
#include <cstd... | #include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
ll N;
ll a[200001];
ll ans = 0;
ll temparr[200001];
void mergesort(ll left, ll right){
if(right - left <= 1)
return;
ll mid = (left + right+1) / 2;
mergesort(left, mid);
mergesort(mid,right);
ll id1 = left;
ll id2 = mid;
... | 0 |
#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++)
... | #include<iostream>
#include<vector>
using namespace std;
const int MOD=1000000007;
void add(long long &a,long long b){a+=b;if(a>=MOD)a-=MOD;}
int H,W,K;
long long solve(){
--K;
vector<vector<long long> > dp(H+1,vector<long long>(W,0));
dp[0][0]=1;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
... | 0 |
#include <stdio.h>
#include <string.h>
int main(){
long long num;
scanf("%lld", &num);
char str[100] ={0};
int i = 0;
num--;
while(num >= 0){
str[i] = num%26 + 'a';
num /= 26;
i++;
num--;
}
int len = strlen(str);
for(int j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
using ll = long long;
using V = vector<int>;
char s[1000000];
ll t[3][1000001];
int main() {
int n, q;
scanf("%d%s%d", &n, s, &q);
V D, C;
rep(i, n) {
rep(j, 3) t[j][i+1] =... | 0 |
#include<bits/stdc++.h>
#define pb push_back
#define sf scanf
#define pf printf
#define FAST ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
using namespace std;
#define ll long long
const int N=2e5+9;
void slv()
{
int n;
cin>> n;
int a[n+3],b[n+3];
for(int i=0;i<n;i++) cin >> a[i... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int N;
cin >> N;
vector <int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans = 0;
bool stop = false;
while (!stop) {
for (int i = 0; i < N; i++) {
if (A[i]%2==0) {
A[i] = A[i]/2;
} else {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FIN ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<string> vs;
const int INF = 1000000000;
int main() {FIN
int t = 0;
char e;
vs nm = {"A", "B", "C"}... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
string a, b, c;
cin >> a;
cin >> b;
cin >> c;
int ... | 0 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
using int64 = uint64_t;
using namespace std;
vector<int64> prime_factor(int64 n) {
vector<int64> primes;
for (int6... | #include <iostream>
#include <cmath>
int main()
{
int64_t n;
std::cin >> n;
for (int64_t a = std::floor(std::sqrt(n)); a >= 1; --a)
{
if (n % a == 0)
{
const int64_t b = n / a;
std::cout << static_cast<int>(std::floor(std::log10(b) + 1)) << std::endl;
... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FILL0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | 1 |
#include <bits/stdc++.h>
#include <set>
#include <numeric>
#define rep(i,n) for (int i=0; i < (n); ++i)
#define all(a) a.begin(), a.end()
using ll = long long;
using namespace std;
// ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int minimam(int a,int b,int c, int d);
int main() {
int a,b,c,d; cin >> a ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r;cin>>r;
string ans;
if (r >= 2800) ans = "AGC";
else if (r >= 1200) ans = "ARC";
else ans = "ABC";
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N;
cin >> N;
for (int i = N; i < 1000; i++) {
string s = to_string(i);
if (s[0] == s[1] &... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#define N 1000006
using namespace std;
int n, ans;
char s[N], t[N];
int main(){
scanf("%d%s%s", &n, s + 1, t + 1);
if(strcmp(s + 1, t + 1) == 0){
puts("0");
return 0;
}
int pos = n;
queue < int > Q;
for(int i = n... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n;
long long int m;
while (cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
long long int b;
vector<long long int> ss;
ss.push_back(0);
for (int i = 0; i < n; i++) {
cin >> b;
if ... | 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() {
ll x, y;
cin >> x >> y;
ll absdif = abs(abs(x) - abs(y)), ans = 1e10;
if (x <= y) ans = min(ans, y - x); // 0,0
if (-1 * x <= y) ans = m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;} //13以下対応
bool is_prime(int64_t a){if(a<=1)return false;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll h,w;
cin >> h >> w;
vector<string> s(h);
for(auto &i:s)cin >> i;
vector<vector<ll>> dis(h,vector<ll>(w,1e9));
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
if(s[i][j]=='#')dis[i][j]=0;
}
}
for(int i = 0;i<h;i++)
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n%k==0) {
printf("0\n");
} else {
printf("1\n");
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using vl = vector<ll>;
int main() {
ll n;
cin >> n;
vl x(n);
rep(i, n) cin >> x[i];
ll l, q;
cin >> l >> q;
vector<vl> r(20, vl(n));
rep(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, v;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
char d;
char ds[] = "NESW";
while(cin >> n, n) {
int rx = 10, ry = 10, cnt = 0;
int graph[21][21];
memset(graph, 0, sizeof(graph));
f... | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;cin>>n;
string a,b,c;cin>>a>>b>>c;
int acc = 0;
for (int i=0;i<n;i++){
vector<char> letters;
letters.push_back(a[i]);
letters.push_back(b[i]);
letters.push_back(c[i]);
... | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, ... | 1 |
#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;
typedef long long ll;
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}//MAX
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
//MIN
main() {
int n;
cin >> n;
cout << 180*(n-2)<<endl;
}
| 1 |
#include<cstdio>
const int inf=1<<29;
int N,M;
int G[15][15],g[1<<15],f[1<<13][15];
void cmax(int&a,int b){b>a?a=b:1;}
int main(){
scanf("%d%d",&N,&M);
while(M--){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
--a,--b;
G[a][b]=G[b][a]=c;
}
for(int S=1;S<1<<N;S++){
int i=N;while(!(S>>i&1))i--;
g[S]=g[S-(1<<i)];
... | #include <iostream>
#include <utility>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
Edge(ll t, ll w) : to(t), weight(w) { }
};
using Graph = vector<vector<Edge>>;
int main() {
// 頂点数と辺数
ll n, m; cin >> n;
m = n - 1;
// グラフ入力受取 (ここでは重み付き無向グラフを想定)
Graph G(n);... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 0 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo... | 1 |
#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 <bits/stdc++.h>
using namespace std;
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;constexpr const char nl='\n',sp=' ';
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// freopen("err.txt", "w", stderr);
ios::sync_with_stdio(0... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin>>N;
if(N==1){
cout<<"Hello World";
}
if(N==2){
cin>>A>>B;
cout<<A+B;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x; cin >> x;
ll ans = 0;
ll quo = x / 11;
ll mod = x % 11;
if (mod == 0) {
ans = quo * 2;
}
else if (1 <= mod && mod <= 6) {
ans = quo * 2 + 1;
}
else { // 6 < mod <= 11
ans = quo * 2 + 2;
}
cout << ans << endl;
ret... | 0 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
static const int sentinel = 1000000000;
long int ninvention = 0;
int merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1], R[n2 + 1];
for (int i = 0; i < n1; i++)
... | #include <iostream>
#include <math.h>
using namespace std;
int main(){
int in;
cin >> in;
int out = static_cast<int>(pow(static_cast<double>(in), 3.0));
cout << out << endl;
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.