code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
typedef std::pair<LL, LL> P;
struct edge { LL to, cost; };
LL n, k;
LL d[112];
std::vector<edge>G[112];
void dijkstra(LL s)
{
std::priority_queue<P, std::vector<P>, std::greater<P>>que;
std::fill(d, d + n + 1, INF);
d[s] = 0;
que.push(P(0, s));
while (!que.empty())
{
P p = que.top(); que.pop();
LL v = p.second;
if (d[v] < p.first) { continue; }
rep(i, G[v].size())
{
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost)
{
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main()
{
while (true)
{
n = k = 0;
memset(d, 0, sizeof(d));
rep(i, 112) { G[i].clear(); }
in >> n >> k;
if (n == 0 && k == 0) { break; }
rep(loop, k)
{
LL flag;
in >> flag;
if (flag == 0)
{
LL a, b;
in >> a >> b;
dijkstra(a);
out << (d[b] == INF ? -1 : d[b]) << std::endl;
}
else
{
LL c, d, e;
in >> c >> d >> e;
G[c].push_back({ d,e });
G[d].push_back({ c,e });
}
}
}
return 0;
} | #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]==INF)
printf("-1\n");
else
printf("%d\n",cost[a-1][b-1]);
}else {
scanf("%d %d %d",&a,&b,&c);
if(cost[a-1][b-1]>c) {
cost[a-1][b-1]=cost[b-1][a-1]=c;
for(int k=0;k<n;k++) {
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);
}
}
}
}
}
}
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
int X[100], Y[100];
int inin;
for (int i = 0; i < n; ++i)
{
cin >> X[i];
}
for (int i = 0; i < m; ++i)
{
cin >> Y[i];
}
sort(X, X+n);
sort(Y, Y+m);
bool ok = 0;
for (int i = x+1; i <= y; ++i)
{
if (i > X[n-1] && i <= Y[0])
{
ok = 1;
}
}
cout << (ok?"No War":"War") << endl;
return 0;
} | /*
* Dice1.cpp
*
* Created on: 2014/08/08
* Author: WanWan1985
*/
#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 <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
// for util
#define ALL(a) (a).begin(), (b).end()
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define PB push_back
#define MP make_pair
#define CL clear
#define EXIT (0)
#define PINT pair<int, int>
typedef unsigned int u_int;
typedef long long ll;
enum E_DiceArrayIndex {
eTOP = (0),
eSOUTH,
eEAST
// eWEST,
// eNORTH,
// eDOWN
};
enum E_DiceLavel {
eOne = (0),
eTwo,
eThree,
eFour,
eFive,
eSix,
eDiceLavelNum
};
// Diceใฏใฉใน
class Dice {
vector<int> m_vecDiceNum;
vector<pair<E_DiceLavel, E_DiceLavel>> m_vecDiceState;
public:
// ๅๆ็ถๆ
่จญๅฎ
void init(const vector<int>& a_vecInputData) {
REP(i, a_vecInputData.size()) {
m_vecDiceNum.PB(a_vecInputData.at(i));
}
m_vecDiceState.PB(make_pair(eOne, eSix)); // TOP
m_vecDiceState.PB(make_pair(eTwo, eFive)); // SOUTH
m_vecDiceState.PB(make_pair(eThree, eFour)); // EAST
}
// ็งปๅๅพใฎDice้
็ฝฎๆดๆฐ
void upDateDicePosition(const char& a_chrCommand) {
if ('S' == a_chrCommand) {
pair<E_DiceLavel, E_DiceLavel> Top = m_vecDiceState[eTOP];
pair<E_DiceLavel, E_DiceLavel> South = m_vecDiceState[eSOUTH];
m_vecDiceState[eSOUTH] = Top;
m_vecDiceState[eTOP] = make_pair(South.second, South.first);
} else if ('N' == a_chrCommand) {
pair<E_DiceLavel, E_DiceLavel> Top = m_vecDiceState[eTOP];
pair<E_DiceLavel, E_DiceLavel> South = m_vecDiceState[eSOUTH];
m_vecDiceState[eSOUTH] = make_pair(Top.second, Top.first);
m_vecDiceState[eTOP] = South;
} else if ('W' == a_chrCommand) {
pair<E_DiceLavel, E_DiceLavel> Top = m_vecDiceState[eTOP];
pair<E_DiceLavel, E_DiceLavel> East = m_vecDiceState[eEAST];
m_vecDiceState[eTOP] = East;
m_vecDiceState[eEAST] = make_pair(Top.second, Top.first);
} else if ('E' == a_chrCommand) {
pair<E_DiceLavel, E_DiceLavel> Top = m_vecDiceState[eTOP];
pair<E_DiceLavel, E_DiceLavel> East = m_vecDiceState[eEAST];
m_vecDiceState[eTOP] = make_pair(East.second, East.first);
m_vecDiceState[eEAST] = Top;
}
}
// ใตใคใณใญไธ้ขใฎๆฐๅญใๅๅพใใ
int GetTopSurfaceNum() {
pair<E_DiceLavel, E_DiceLavel> Top = m_vecDiceState[eTOP];
return m_vecDiceNum[Top.first];
}
};
int main(void) {
int i, j, k, l, m, n;
cin >> i >> j >> k >> l >> m >> n;
vector<int> vecDiceNum;
vecDiceNum.PB(i);
vecDiceNum.PB(j);
vecDiceNum.PB(k);
vecDiceNum.PB(l);
vecDiceNum.PB(m);
vecDiceNum.PB(n);
string strCommand;
cin >> strCommand;
Dice Dice1;
Dice1.init(vecDiceNum);
REP(i, strCommand.size()) {
const char chrCommand = strCommand.at(i);
Dice1.upDateDicePosition(chrCommand);
}
cout << Dice1.GetTopSurfaceNum() << endl;
return EXIT;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair <int, int>;
#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 each(i, mp) for (auto &i : mp)
const int INF = 1001001001;
int main()
{
int a;
cin >> a;
ll ans = 0;
rep(i, 3) ans += pow(a, i + 1);
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e;
cin>>a;
cout<<a+a*a+a*a*a;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define rap(p, a, b) for (ll p = a; p <= b; p++)
#define per(p, a, b) for (ll p = a; p >= b; p--)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll, ll> pll;
int main()
{
ll t, i, j, k, ans, n;
//cin>>t;
t = 1;
while (t--)
{
int a,b,c;
cin>>a>>b>>c;
set<ll> s;
s.insert(a);s.insert(b);s.insert(c);
if(s.sz==2)cout<<"Yes";
else cout<<"No";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
//freopen("input.txt","r",stdin);
#endif
int a,b,c;
cin>>a>>b>>c;
if(a==b && b==c)
{
cout<<"No"<<endl;
}
else if((a==b && b!=c) || (a==c && c!=b) || (b==c && c!=a))
{
cout<<"Yes"<<endl;
}
else
cout<<"No"<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
//#include <math.h>
using namespace std;
//#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846
typedef long long ll;
//typedef pair<int,int> P;
//typedef pair<int,P> PP;
//-----------------------------------------------------------------------------
const double EPS=1e-8;
const double INF=1e12;
typedef complex<double> P;
namespace std {
bool operator<(const P &a,const P &b) {
return real(a)!=real(b)?real(a)<real(b):imag(a)<imag(b);
}
}
double cross(const P &a,const P &b) {
return imag(conj(a)*b);
}
double dot(const P &a,const P &b) {
return real(conj(a)*b);
}
int ccw(P a,P b,P c) {
b-=a;c-=a;
if(cross(b,c)>0) return +1;
if(cross(b,c)<0) return -1;
if(dot(b,c)<0) return +2;
if(norm(b)<norm(c)) return -2;
return 0;
}
vector<P> convex(vector<P> ps) {
int n=(int)ps.size(),k=0;
sort(ALL(ps));
vector<P> ch(2*n);
for(int i=0;i<n;ch[k++]=ps[i++]) {
while(k>=2&&ccw(ch[k-2],ch[k-1],ps[i])<=0) --k;
}
for(int i=n-2,t=k+1;i>=0;ch[k++]=ps[i--]) {
while(k>=t&&ccw(ch[k-2],ch[k-1],ps[i])<=0) --k;
}
ch.resize(k-1);
return ch;
}
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
vector<P> ps;
map<P,int> idx;
REP(i,n) {
double x,y;cin>>x>>y;
ps.pb(P(x,y));
idx[P(x,y)]=i;
}
vector<double> ans(n,0.0);
vector<P> res=convex(ps);
int sz=(int)res.size();
if(sz==2) {
for(auto p:res) ans[idx[p]]=0.5;
}
else {
REP(i,sz) {
P prv=res[(i-1+sz)%sz],crt=res[i],nxt=res[(i+1)%sz];
double result=arg((crt-nxt)/(prv-crt));
if(result<0) result+=2*PI;
ans[idx[crt]]=result/(2*PI);
}
}
REP(i,n) printf("%.12f\n",ans[i]);
return 0;
}
| #include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
int x,y,z,n,m,road[200005],rail[200005],connect[200005];
pair<pair<int,int>,int> total[200005];
int root (int ind) {
if (road[ind] == ind) return ind; else
return road[ind] = root(road[ind]);
}
void onion(int l, int r) {
if (root(l) != root(r)) road[root(l)] = root(r);
}
int root2(int ind) {
if (rail[ind] == ind) return ind; else
return rail[ind] = root2(rail[ind]);
}
void onion2(int l, int r) {
if (root2(l) != root2(r)) rail[root2(l)] = root2(r);
}
int main() {
cin >> x >> y >> z;
for (int i = 0; i <= x; i++) {
rail[i] = i;
road[i] = i;
}
for (int i = 0; i < y; i++) {
cin >> n >> m;
onion(n,m);
}
for (int i = 0; i < z; i++) {
cin >> n >> m;
onion2(n,m);
}
for (int i = 1; i <= x; i++) {
total[i] = make_pair(make_pair(root(i),root2(i)),i);
}
sort(total+1,total+1+x);
total[x+1].f.f = total[x+1].f.s = -31415;
stack<int> st; while (!st.empty()) st.pop();
int a1 = 0,a2 = 0,b1 = 0,b2 = 0;
for (int i = 1; i <= x+1; i++) {
a1 = total[i].f.f, a2 = total[i].f.s;
if (!(st.empty() || (a1 == b1 && a2 == b2))) {
int tmp = st.size();
while (!st.empty()) {
connect[st.top()] += tmp-1;
st.pop();
}
}
b1 = a1, b2 = a2;
st.push(total[i].second);
}
for (int i = 1; i <= x; i++) {
cout << connect[i]+1 << " ";
}
} | 0 |
#include <iostream>
#include <string>
#include <map>
int main(){
std::string s;
std::cin >> s;
std::map<std::string, int> day = {
{"SUN", 0},
{"MON", 1},
{"TUE", 2},
{"WED", 3},
{"THU", 4},
{"FRI", 5},
{"SAT", 6}
};
std::cout << 7 - day[s] << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int N, K, X;
string S;
cin >> S;
if(S == "SUN") cout << 7 << endl;
if(S == "MON") cout << 6 << endl;
if(S == "TUE") cout << 5 << endl;
if(S == "WED") cout << 4 << endl;
if(S == "THU") cout << 3 << endl;
if(S == "FRI") cout << 2 << endl;
if(S == "SAT") cout << 1 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define N 300100
const int mod=1e9+7;
int a[8][2],f[N][8];
char s[N];
int main()
{
a[0][0]=1; a[0][1]=2;
a[1][0]=3; a[1][1]=4;
a[2][0]=5; a[2][1]=6;
a[3][0]=a[3][1]=1;
a[4][0]=1; a[4][1]=2;
a[5][0]=7; a[5][1]=2;
a[6][0]=a[6][1]=6;
a[7][0]=a[7][1]=5;
scanf("%s",s);
int n=strlen(s);
f[n][2]=f[n][6]=1;
for (int i=n-1;i>=0;i--)
for (int j=0;j<8;j++)
{
if (s[i]!='1') (f[i][j]+=f[i+1][a[j][0]])%=mod;
if (s[i]!='0') (f[i][j]+=f[i+1][a[j][1]])%=mod;
}
printf("%d\n",f[0][0]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000
int main(){
int N;
cin>>N;
string S;
cin>>S;
for(int i=0;i<4;i++){
string ans;
if(i==0)ans="SS";
if(i==1)ans="WW";
if(i==2)ans="SW";
if(i==3)ans="WS";
for(int j=1;j<N+1;j++){
char c = S[j%N];
if(ans.back()=='W'){
if(c=='o')c='x';
else c='o';
}
if(c=='o'){
ans += ans[ans.size()-2];
}
else{
if(ans[ans.size()-2]=='W')ans+='S';
else ans+='W';
}
}
if(ans[0]==ans[N]&&ans[1]==ans[N+1]){
cout<<ans.substr(0,N)<<endl;
return 0;
}
}
cout<<-1<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
//#define _GLIBCXX_DEBUG
int prime(int N) {
if(N<2) return 0;
if(N == 2) return 1;
if(N%2 == 0) return 0;
int sq = (int)(sqrt(N))+1;
for(int i=3; i<sq; i+=2) {
if(N%i == 0) return 0;
}
return 1;
}
signed main() {
int N, M; cin >> N >> M;
if(prime(M) == 1 && N >= 2) {
cout << 1 << endl;
return 0;
}
for(int i=N; i<=M; i++) {
if(M%i == 0) {
cout << M/i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,X; cin >> K >> X;
int N = X+K-1;
int M = X-K+1;
for(int i=M; i<=N; i++) {
cout << i << " ";
}
return 0;
} | 0 |
#include<cstdio>
using namespace std;
long long a[201];
char s[202];
int main(){
int t;
scanf("%d",&t);
for(int tt=1;tt<=t;tt++){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
scanf("%s",s+1);
for(int i=n;i;i--){
if(a[i]==0)continue;
int u=60;
while(!(a[i]>>u&1))u--;
for(int j=i-1;j;j--)
if(a[j]>>u&1)a[j]^=a[i];
}
int ans=0;
for(int i=1;i<=n;i++)
if(s[i]=='1'&&a[i])
ans=1;
printf("%d\n",ans);
}
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <bitset>
using ll = long long;
using namespace std;
// xorใฎๆใๅบใๆณ O(N^2)
// matใซๅบๅบใใกใๅ
ฅใ
// Tใฏbitsetใฏ็ก็(minใใชใใจใใใชใใใ)
template <typename T>
int gauss_jordan(vector<T> &mat) {
vector<T> bases;
for (auto e:mat) {
for (auto &b:bases) {
e = min(e, e^b);
}
if (e)
bases.push_back(e);
}
mat.swap(bases);
return (int)mat.size();
}
int main() {
int T;
cin >> T;
while (T--) {
int n; cin >> n;
ll a[n]; for (auto &ai:a) cin >> ai;
string s; cin >> s;
bool ans = false;
vector<ll> bases;
for (int i=n-1; i>=0; i--) {
bool now = s[(size_t)i] - '0';
if (now) {
for (auto &bi:bases) {
a[i] = min(a[i], a[i]^bi);
}
if (a[i]) {
ans = true;
break;
}
} else {
bases.push_back(a[i]);
gauss_jordan(bases);
}
}
cout << ans << '\n';
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
cout << (expr ? "Yes" : "No") << "\n";
}
constexpr int MAX = 200001;
lint fact[MAX], finv[MAX], inv[MAX];
void cominit() {
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX){
fact[i] = fact[i-1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
lint power(lint x, lint n, lint mod) {
lint ret = 1;
while(n > 0) {
if(n & 1) (ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
lint ncr(lint n, lint r, lint mod) {
if(n < 0 || r < 0 || n-r < 0) return 0;
return fact[n]*finv[r]%mod*finv[n-r]%mod;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lint N, M;
cin >> N >> M;
cominit();
vector<lint> fact;
for(lint i=2; i*i<=M; i++) {
if(M%i != 0) continue;
lint ex = 0;
while(M%i == 0) {
M /= i;
ex++;
}
fact.push_back(ex);
}
if(M > 1) fact.push_back(1);
lint ans = 1;
REP(i, fact.size()) ans = ans * ncr(N-1+fact[i], fact[i], MOD) % MOD;
cout << ans << endl;
} | #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()
#define rall(x) x.rbegin(), x.rend()
#define mst(x,v) memset(x, v, sizeof(x))
#define sz(x) (ll)x.size()
string to_string(string s) {return s;}
string to_string(char c) {string s = string(1, c);return s;}
template <typename A, typename B> string to_string(pair<A,B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A> string to_string(vector<A> v) { string s = "("; int first = 1; for (A a : v) { if (!first) { s += ", "; } first = 0; s += to_string(a); } s += ")"; return s; }
template <typename A> string to_string(set<A> v) { string s = "("; int first = 1; for (A a : v) { if (!first) { s += ", "; } first = 0; s += to_string(a); } s += ")"; return s; }
void debug_out() {cerr << endl;}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
void in() {}
template <typename A> void in(A & x) { cin >> x; }
template <typename A, typename B> void in(pair<A,B> & x) { in(x.first); in(x.second); }
template <typename A> void in(vector<A> & x) { REP(i,0,(ll)x.size()) in(x[i]); }
template <typename Head, typename... Tail> void in(Head & H, Tail & ... T) {in(H); in(T...); }
#ifndef ONLINE_JUDGE
#define debug(...) do { cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__); } while (false)
#else
#define debug(...) do { } while (false)
#endif
const ll inf = (ll)1e18 + 5;
const ll mod = 1e9+7;
ll nax = 1005;
VLL p(nax*nax, 1);
VLL P;
void init() {
p[0] = 0;
p[1] = 0;
for (ll x = 2; x < nax*nax; x++) {
if (p[x] == 0) {
continue;
}
P.push_back(x);
for (ll f = x; x * f < nax * nax; f++) {
p[x*f] = 0;
}
}
}
map<ll,ll> pf(ll x) {
map<ll,ll> f;
REP(i,0,sz(P)) {
if (P[i] * P[i] > x) break;
while (x % P[i] == 0) {
f[P[i]]++;
x /= P[i];
}
}
if (x > 1) f[x]++;
return f;
}
VLL F(100500, -1);
VLL INVF(100500, -1);
ll pow(ll a, ll b) {
if (b == 0) return 1;
ll h = pow(a, b/2);
ll ans = b % 2 ? h * h % mod * a : h * h;
ans %= mod;
return ans;
}
ll f(ll x) {
if (F[x] != -1) return F[x];
if (x == 0) return 1;
F[x] = f(x-1) * x % mod;
return F[x];
}
ll invf(ll x) {
if (INVF[x] != -1) return INVF[x];
INVF[x] = pow(f(x), mod-2);
return INVF[x];
}
ll ncr(ll n, ll r) {
// n! / r! / (n-r)!
ll ans = f(n);
ans *= invf(r);
ans %= mod;
ans *= invf(n-r);
ans %= mod;
return ans;
}
void solve() {
ll n, m;
in(n, m);
map<ll,ll> factors = pf(m);
REP(i,0,n) f(i); // ease on the recursion
ll ans = 1;
for (PLL a : factors) {
ans *= ncr(a.second + n - 1, a.second) % mod;
ans %= mod;
}
cout << ans << endl;
}
signed main() {
init();
ll t = 1;
REP(i,0,t) solve();
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
if(n==1){
cout << "Hello World" << "\n";
return 0;
}
else{
int a,b;
cin >> a >> b;
cout << a+b << "\n";
return 0;
}
} | #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
ll gcd(ll x,ll y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
int main(){
ll A,B,C,D,i,ans = 1;scanf("%lld%lld",&A,&B);
C = gcd(A,B);D = C;
for(i=2;i*i<=C;i++){
if(D%i==0){
ans++;
while(D%i==0) D /= i;
}
}
if(D != 1) ans++;
printf("%lld\n",ans);
} | 0 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//ๅ
ฅๅ็ณป
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//ๅบๅ็ณป
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//ใใใใฐ็ณป
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
int main(){
string s;
cin>>s;
int left,right,dec=0,n=s.length();
for(int i=0;i<(int)s.length()-1;i++){
if(s[i]=='S'&&s[i+1]=='T'){
s.erase(s.begin()+i);
s.erase(s.begin()+i);
dec+=2;
i-=2;
}
}
out(n-dec);
} | #include <iostream>
using namespace std;
int main() {
long d;
while(cin >> d) {
long count = 0;
for(int i=0; i<600; i+=d) {
count += d*i*i;
}
cout << count << endl;
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(void){
int n,i,j,ans=0;
cin >>n;
int l[200];
int max,tmp;
while(cin>>j){
l[i] = j;
i++;
}
cout<<endl;
for(i=0;i<2*n-1;++i){
max=i;
for(j=i+1;j<2*n;++j){
if(l[max]<l[j]){
max=j;
}
}
tmp=l[max];
l[max]=l[i];
l[i]=tmp;
}
for(i=1;i<2*n;i=i+2){
ans+=l[i];
}
cout<<ans;
}
| #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int getResult(vector<int> &L, const int size){
sort(L.begin(), L.end());
int sum = 0;
for(int i = 0; i < size; i += 2){
sum += L[i];
}
return sum;
}
int main(){
int N;
cin >> N;
const int N2 = N * 2;
vector<int> L(N2);
for(int i = 0; i < N2; i++){
cin >> L[i];
}
int result = getResult(L, N2);
cout << result;
return 0;
} | 1 |
#include <iostream>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<(int)(n); i++)
signed main() {
int n;
cin >> n;
int s[n];
rep(i,n) {
char c;
cin >> c;
if(c == 'R') s[i] = 0;
if(c == 'G') s[i] = 1;
if(c == 'B') s[i] = 2;
}
int r[3][n+1];
rep(i,3) rep(j,n+1) r[i][j] = 0;
rep(i,3) rep(j,n) if(i == s[j]) r[i][j]++;
rep(i,3) rep(j,n) r[i][n-1-j] = r[i][n-1-j] + r[i][n-j];
int w = 0;
rep(i,n) rep(j0,n-i-1) {
int j = j0 + i + 1;
if(s[i] != s[j]) {
int k = 3 - s[i] - s[j], l = 2 * j - i;
w += r[k][j+1];
if(l < n && k == s[l]) w -= 1;
}
}
cout << w << endl;
return 0;
} | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cctype>
#include<string.h>
#include <stdlib.h>
#define PI 3.1415926
void swap(int* x, int* y) {
int a = *x;
int b = *y;
*x = b;
*y = a;
}
int factorial(int n);
int sum(int n, int*);
int ave(int n, int*);
int min(int n, int*), min(int n, int m);
int max(int n, int*), max(int n, int m);
int main() {
int N, X[200] = { 0 }, a, b, c, d, Y[200];
scanf("%d", &N);
for (int i = 1; i <= N*(N - 1) / 2; i++) {
scanf("%d %d %d %d", &a, &b, &c, &d);
if (c == d) {
X[a]++;
X[b]++;
}
else if (c < d) {
X[b] += 3;
}
else {
X[a] += 3;
}
}
int p = 1;
for (int i = 1; i <= N; i++) {
p = 1;
//printf("%d\n", X[i]);
for (int j = 1; j <= N; j++) {
if (X[i] < X[j]) {
p++;
}
}
printf("%d\n", p);
}
return 0;
}
int factorial(int n) {
if (n > 0) {
return n * factorial(n - 1);
}
else {
return 1;
}
}
int sum(int n, int *all) {
int total = 0;
for (int i = 0; i < n; ++i) {
total += all[i];
}
return total;
}
int ave(int n, int *all) {
int total = 0;
for (int i = 0; i<n; ++i) {
total += all[i];
}
return total / n;
}
int min(int n, int *all) {
int min = all[0];
for (int i = 1; i < n; ++i) {
if (all[0] > all[i]) {
min = all[i];
}
}
return min;
}
int max(int n, int *all) {
int max = all[0];
for (int i = 1; i<n; ++i) {
if (all[0]<all[i]) {
max = all[i];
}
}
return max;
}
int max(int n, int m) {
if (n >= m) {
return n;
}
else {
return m;
}
}
int min(int n, int m) {
if (n >= m) {
return m;
}
else {
return n;
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
long long dp[2][3003];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector<string>vst;
set<long long>st,nt,tt; map<long long,long long>mp,nq,qr; string str,ttr,ntr;
scanf("%lld %lld",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%lld %lld",&a,&b); vct.push_back(make_pair(a,b));
}
sort(vct.begin(),vct.end());
long long idx,cap;
for(idx=n-1;idx>=0;idx--)
{
for(cap=1;cap<=k;cap++)
{
fr=idx%2; sc=(idx+1)%2; a=vct[idx].first; b=vct[idx].second;
p=0; q=0;
if(idx==n-1 || cap-a<=0){ p=b; }
else{ p=b+dp[sc][cap-a]; }
if(idx!=n-1){ q=dp[sc][cap]; }
dp[fr][cap]=max(p,q);
}
}
printf("%lld\n",dp[0][k]);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, t;
cin >> n >> t;
vector<P> v(n);
rep(i, 0, n) cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
vector<vector<int>> dp(n + 1, vector<int>(3001, 0));
int ans = 0;
rep(i, 0, n) {
rep(j, 0, t) {
chmax(dp[i + 1][j], dp[i][j]);
if (j + v[i].first < t)
chmax(dp[i + 1][j + v[i].first], dp[i][j] + v[i].second);
}
int now = dp[i][t - 1] + v[i].second;
chmax(ans, now);
}
cout << ans << endl;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <queue>
#include <set>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define uint unsigned int
#define ull unsigned ll
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define speedhack() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define do(x) for(int i = 1; i <= x; i++){ solve(); }
#define sz(x) (int)x.size()
#define pii pair < int, int >
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const ll MAXN = 1e18;
const ll SIZE = 5e5 + 10; //are u sure?
const ll mod = 1e9+7;
ll Lpref[SIZE], Rpref[SIZE];
ll Lsuff[SIZE], Rsuff[SIZE];
ll L[SIZE], R[SIZE];
ll mR = MAXN, mL = -MAXN;
void solve(){
int N; cin >> N;
for(int i = 0; i < N; i++){
cin >> L[i] >> R[i];
mR = min(mR, R[i]);
mL = max(mL, L[i]);
}
Lpref[0] = -MAXN;
Rpref[0] = MAXN;
for(int i = 0; i < N; i++){
Lpref[i + 1] = max(Lpref[i], L[i]);
Rpref[i + 1] = min(Rpref[i], R[i]);
}
Lsuff[N - 1] = L[N - 1];
Rsuff[N - 1] = R[N - 1];
for(int i = N - 1; i > 0; i--){
Lsuff[i - 1] = max(Lsuff[i], L[i]);
Rsuff[i - 1] = min(Rsuff[i], R[i]);
}
ll ans = 0;
for(int i = 0; i < N; i++){
ll cur = (R[i] - L[i] + 1) + max(0LL, min(Rpref[i], Rsuff[i + 1]) - max(Lpref[i], Lsuff[i + 1]) + 1);
ans = max(ans, cur);
}
vector<pair<ll, ll>> vec;
for(int i = 0; i < N; i++){
vec.push_back(mp(L[i], R[i]));
}
sort(all(vec));
for(int i = N - 1; i > 0; i--){
vec[i - 1].second = min(vec[i - 1].second, vec[i].second);
}
for(int i = 0; i + 1 < N; i++){
ll cur = max(0LL, mR - vec[i].first + 1) + max(0LL, vec[i + 1].second - mL + 1);
ans = max(ans, cur);
}
cout << ans << endl;
}
int main(){
speedhack()
// int it; cin >> it;
int it = 1;
do(it);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
int main() {
ll M;
cin >> M;
ll n = 0, s = 0;
rep(i, M) {
ll d, c;
cin >> d >> c;
n += c;
s += d * c;
}
ll ans = n - 1 + (s - 1) / 9;
cout << ans << endl;
} | 0 |
#include <iostream>
using namespace std;
//const double PI = acos(-1);
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9+7;
#define REP(i,n) for (int i = 0; i < (n); i++)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
ll n,a,b,c,d;
ll dp[1010][1010];
ll K[1010];
ll cc[1010][1010];
ll inv[1010];
ll mul(ll _a, ll _b) {
if (_b == 0) return 1LL;
if (_b == 1) return _a;
ll ans = mul(_a, _b/2);
ans *= ans;
ans %= MOD;
if (_b&1) ans *= _a;
return ans % MOD;
}
ll C(ll _n, ll _k) {
if (cc[_n][_k] != 0LL) return cc[_n][_k];
if (_n == _k) return cc[_n][_k] = 1;
return cc[_n][_k] = (K[_n] * ((inv[_k] * inv[_n-_k]) % MOD)) % MOD;
}
ll get(ll groups, ll mem, ll from) {
ll ans = 1;
REP(i,groups) {
ans *= C(from, mem);
ans %= MOD;
from -= mem;
}
return (ans * inv[groups]) % MOD;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> a >> b >> c >> d;
dp[0][0] = 1;
K[1] = 1;
inv[1] = 1;
for (ll i = 2; i <= n; i++) {
K[i] = K[i-1]*i;
K[i] %= MOD;
inv[i] = mul(K[i], MOD-2);
}
for (ll i = 1; i <= b; i++) {
if (i < a) {
dp[i][0] += dp[i-1][0];
dp[i][0] %= MOD;
continue;
}
REP(j,n+1) {
dp[i][j] += dp[i-1][j];
dp[i][j] %= MOD;
ll k = c;
while (k <= d && j + k * i <= n) {
dp[i][j+k*i] += dp[i-1][j] * get(k, i, n-j);
dp[i][j+k*i] %= MOD;
k++;
}
}
}
cout << dp[b][n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 (ll)(1E9+5)
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=(ll)1E12;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll * pos,ll val){*pos=max(*pos,val);}//Max(&dp[i][j],dp[i-1][j]);
void Min(ll * pos,ll val){*pos=min(*pos,val);}
void Add(ll * pos,ll val){*pos=mod(*pos+val);}
const long double EPS=1E-8;
////////////////////////////////////////
#define N 100004
ll kai[N];
ll kai2[N];
ll po(ll i,ll p){
if(p==0)return 1;
else if(p==1)return mod(i);
else if(p%2==0)return mod(po(mod(mod(i)*mod(i)),p/2));
else return mod(mod(i)*mod(po(i,p-1)));
}
void calc(){
kai[0]=1;
kai2[0]=1;
for(int i=1;i<N;i++){
kai[i]=mod(kai[i-1]*i);
kai2[i]=mod(po(kai[i],i_5));
}
}
ll comb(ll n,ll k){
if(n==0){
if(k==0)return 1;
else return 0;
}
else if(n<k)return 0;
else return mod(mod(mod(kai[n])*mod(kai2[n-k]))*mod(kai2[k]));
}
//#include <time.h>
int main(){
// clock_t start = clock(); // ในใฟใผใๆ้
calc();
ll n,a,b,c,d;cin>>n>>a>>b>>c>>d;
ll dp[n+5][n+5];
memset(dp,0,sizeof(dp));
dp[a][0]=1;
rep(k,a,b){
rep(j,0,n){
for(ll p=0;j+p*k<=n&&p<=d;p++){
ll add=comb(n-j,p*k);
add=mod(add*dp[k][j]);
add=mod(add*kai[p*k]);
add=mod(add*kai2[p]);
ll w=(ll)po(kai2[k],p);
add=mod(add*w);
Add(&dp[k+1][j+p*k],add);
if(p==0)p=c-1;
}
}
}
/*rep(i,0,b+1){
rep(j,0,n){
cout<<dp[i][j]<<" ";
}cout<<endl;
}*/
cout<<mod(dp[b+1][n])<<endl;
//clock_t end = clock(); // ็ตไบๆ้
// std::cout << "duration = " << (double)(end - start) / CLOCKS_PER_SEC << "sec.\n";
return 0;
}
| 1 |
#include <iostream>
#include <map>
using namespace std;
struct UF{
int par[200000];
int rank[200000];
void init(int n){
for(int i=0;i<n;i++){
par[i]=i;
rank[i]=0;
}
}
int find(int x){
if(par[x]==x)return x;
return par[x]=find(par[x]);
}
void unite(int x, int y){
x=find(x);
y=find(y);
if(x!=y){
if(rank[x]<rank[y]){
par[x]=y;
}else{
par[y]=x;
if(rank[x]==rank[y])rank[x]++;
}
}
}
bool same(int x, int y){
return par[x]==par[y];
}
};
int main(void){
int n,k,l;
map<pair<int, int>, int> u;
cin>>n>>k>>l;
UF a,b;
a.init(n);
b.init(n);
for(int i=0;i<k;i++){
int p,q;
cin>>p>>q;
a.unite(p, q);
}
for(int i=0;i<l;i++){
int p,q;
cin>>p>>q;
b.unite(p, q);
}
for(int i=1;i<=n;i++){
u[pair<int,int>(a.find(i),b.find(i))]++;
}
for(int i=1;i<=n;i++){
cout<<u[pair<int,int>(a.find(i),b.find(i))];
if(i<n)cout<<" ";
else cout<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb push_back
#define nl cout<<"\n"
#define F first
#define S second
#define all(x) x.begin(),x.end()
template<class C> void min_self( C &a, C b ){ a = min(a,b); }
template<class C> void max_self( C &a, C b ){ a = max(a,b); }
const ll MOD = 1000000007;
ll mod( ll n, ll m=MOD ){ n%=m,n+=m,n%=m;return n; }
const int MAXN = 2e5+5;
const int LOGN = 21;
const ll INF = 1e14;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
template<class T1, class T2, class T3> void add( T1 &x, T2 y, T3 m = MOD )
{
x += y;
if( x >= m )
x -= m;
}
template<class T1, class T2, class T3> void sub( T1 &x, T2 y, T3 m = MOD )
{
x -= y;
if( x < 0 )
x += m;
}
vector<int>roads[MAXN], rails[MAXN];
vector<bool>vis(MAXN), vis2(MAXN);
int road_comp[MAXN], road_size[MAXN];
int rail_comp[MAXN], rail_size[MAXN], cc;
void roads_dfs( int node )
{
vis[node] = 1;
road_comp[node] = cc;
road_size[cc]++;
for( int next : roads[node] )
{
if( !vis[next] )
{
roads_dfs(next);
}
}
}
void rails_dfs( int node )
{
vis2[node] = 1;
rail_comp[node] = cc;
rail_size[cc]++;
for( int next : rails[node] )
{
if( !vis2[next] )
{
rails_dfs(next);
}
}
}
int main()
{
fastio();
int n,k,l;
cin>>n>>k>>l;
for(int i=0;i<k;i++)
{
int u,v;
cin>>u>>v;
u--,v--;
roads[u].pb(v);
roads[v].pb(u);
}
for(int i=0;i<l;i++)
{
int u,v;
cin>>u>>v;
u--,v--;
rails[u].pb(v);
rails[v].pb(u);
}
cc = 0;
for(int i=0;i<n;i++)
{
if( !vis[i] )
{
roads_dfs(i);
cc++;
}
}
cc = 0;
for(int i=0;i<n;i++)
{
if( !vis2[i] )
{
rails_dfs(i);
cc++;
}
}
vector<int>order;
for(int i=0;i<n;i++)
order.pb(i);
auto cmp = [&]( int i, int j ) -> bool
{
if( road_comp[i] != road_comp[j] )
return road_comp[i] < road_comp[j];
return rail_comp[i] < rail_comp[j];
};
sort(all(order), cmp);
vector<int>ans(n);
for(int i=0;i<n;)
{
int a = road_comp[order[i]], b = rail_comp[order[i]];
int j = i;
while( j < n && road_comp[order[j]] == a && rail_comp[order[j]] == b ) j++;
for(int k=i;k<j;k++)
ans[order[k]] = j-i;
i = j;
}
for(int i=0;i<n;i++)
cout<<ans[i]<<" ";
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int M = 1000000007;
int mod(int a){
return (a%M + M)%M;
}
int mul(int a, int b){
return mod(mod(a) * mod(b));
}
int add(int a, int b){
return mod(mod(a) + mod(b));
}
int sub(int a, int b){
return mod(mod(a) - mod(b));
}
main(){
int n; cin>>n;
int a[n];
for(auto &it : a) cin>>it;
int sum=0, sum1=0;
for(int i=0; i<n; i++){
sum = add(sum,a[i]);
//sum1 = add(sum1,mul(a[i],a[i]));
}
int ans=0;
for(int i=0; i<n; i++){
sum = sub(sum,a[i]);
ans = add(ans,mul(sum,a[i]));
}
cout<<ans;
} | #include <iostream>
using namespace std;
#define MOD 1000000007
int main(int argc, const char * argv[]) {
int N;
cin>>N;
int *A=new int[N];
long long s=0,s2=0;
for(int i=0;i<N;++i){
cin>>A[i];
s+=A[i];
s%=MOD;
s2+=(long long)A[i]*A[i];
s2%=MOD;
}
s*=s;
s%=MOD;
s-=s2;
s%=MOD;
if(s<0){
s+=MOD;
}
if(s%2==0){
cout<<(s/2)<<endl;
}else{
cout<<((s+MOD)/2)<<endl;
}
delete[] A;
return 0;
}
| 1 |
// โโโโโโโโ( โขฬชโ)โโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโ ]โโโโโโโโโโโโโโโโโ โโ
// โโโ
โโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโ
// [โโโโโโโโโโโโโโโโโโโ].โโโโโโโโโโโโโโ
// โฅโโฒโโฒโโฒโโฒโโฒโโฒโโค...โโโโโโโโโโโโ
//PointBlank's code (โโ _โ )
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
ll power(ll x, ll y);
#define repp(I, A, B) for(int I = A; I <= B; I++)
#define rep(I, A, B) for(int I = A; I < B; I++)
#define rrep(I, B, A) for(int I = B; I >= A; I--)
#define pb emplace_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define LB lower_bound
#define UB upper_bound
#define MP make_pair
#define quickio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(this) cerr<<"> "<<#this<<" : "<<this<<"\n"
#define bitcount(n) __builtin_popcountll(n)
#define in_edges(M) repp(I, 1, M){int A, B; cin >> A >> B; v[A].pb(B), v[B].pb(A);}
#define in_dedges(M) repp(I, 1, M){int A, B; cin >> A >> B; v[A].pb(B);}
#define in_wedges(M) repp(I, 1, M){int A, B, C; cin >> A >> B >> C; v[A].pb(B, C), v[B].pb(A, C);}
#define in_dwedges(M) repp(I, 1, M){int A, B, C; cin >> A >> B >> C; v[A].pb(B, C);}
#define endl "\n"
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 18;
const int inf = 2e9;
const int N = 2e5 + 5;
int a[N], b[N];
int A[N], B[N];
int main() //PointBlank's code ยฏ\_(ใ)_/ยฏ
{
quickio
int n;
cin >> n;
repp(i, 1, n) cin >> a[i];
repp(i, 1, n) cin >> b[i];
repp(i, 1, n) A[a[i]]++, B[b[i]]++;
repp(i, 1, n) if(A[i] + B[i] > n){
cout << "No\n";
return 0;
}
cout << "Yes\n";
rep(i, 1, N) A[i] += A[i - 1], B[i] += B[i - 1];
int mx = 0;
repp(i, 1, N) mx = max(mx, A[i] - B[i - 1]);
repp(i, 1, n) cout << b[(i - mx + n - 1) % n + 1] << " ";
}
ll power(ll x, ll y){
ll res = 1; x %= MOD;
while(y > 0){if(y & 1) res = (res*x) % MOD; y = y>>1, x = (x*x) % MOD;}
return res;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
vector<ll >v;
vector<ll >vp;
ll i,j,k;
ll a,b;
for(i=0; i<n; i++)
{
cin>>a;
v.push_back(a);
}
for(i=0; i<n; i++)
{
cin>>a;
vp.push_back(a);
}
reverse(vp.begin(),vp.end());
ll f=0;
ll l=0,r=n-1;
for(i=0; i<n; i++)
{
if(v[i]==vp[i])
{
if(v[l]!=vp[i]&&v[i]!=vp[l])
{
// cout<<l<<" f "<<i<<endl;
swap(vp[l],vp[i]);
l++;
}
else if(v[r]!=vp[i]&&v[i]!=vp[r] )
{
// cout<<l<<" s "<<endl;
f=0;
swap(vp[r],vp[i]);
r--;
}
else
{
f=1;
break;
}
}
}
if(f)
{
cout<<"No"<<endl;
}
else
{
cout<< "Yes"<<endl;
for(ll i=0; i<n; i++)
{
cout<<vp[i]<<" ";
}
cout<<endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int n = 1000000000;
for (int i = 0; i < N; i++){
int A;
cin >> A;
int a = 0;
while ( A % 2 == 0){
a++;
A /= 2;
}
if(n > a)
n = a;
}
cout << n << endl;
}
| #include<bits/stdc++.h>
//cervello|Phoenix
using namespace std;
#define ll long long int
#define eb emplace_back
#define mk make_pair
#define all(x) x.begin(),x.end()
#define mod 1000000007
vector<bool> prime(1000001,1);
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
for(int i=2;i*i<=1000000;i++)
if(prime[i])
for(int j=i*2;j<=1000000;j+=i)
prime[j]=0;
int n; cin>>n;
vector<int> ans; int p=11;
while(ans.size()<n){
if(prime[p]&&(p%5==1))
ans.eb(p);
p++;
}
for(auto i:ans)
cout<<i<<" ";
cout<<"\n";
return 0;
} | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <string>
#include <vector>
#include <limits.h>
#include <stack>
#include <queue>
#define maxn 1e9
#define pi acos(-1)
#define LL long long
using namespace std;
double aabs(double x)
{
if(x<0)return -x;
return x;
}
int gcd(int a,int b)
{
if(a%b==0)return b;
return gcd(b,a%b);
}
struct card{char suit,value;};
void bubble(struct card A[],int N)///ๅๆณกๆๅบ๏ผ
{
for(int i=0;i<N;i++)
for(int j=N-1;j>=i+1;j--)
if(A[j].value<A[j-1].value)
{
card t=A[j];
A[j]=A[j-1];
A[j-1]=t;
}
}
void selection(struct card A[],int N)///้ๆฉๆๅบ๏ผ
{
for(int i=0;i<N;i++)
{
int minj=i;
for(int j=i;j<N;j++)
{
if(A[j].value<A[minj].value)minj=j;
}
card t=A[i];
A[i]=A[minj];
A[minj]=t;
}
}
LL cnt;
int l;
int a[1000000];
int n;
vector<int>G;
void insertionSort(int A[],int n,int g)///ๆๅฎไบ้ด้g็ๆๅ
ฅๆๅบ
{
for(int i=g;i<n;i++)
{
int v=A[i];
int j=i-g;
while (j>=0&&A[j]>v) {
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int A[],int n)///ๅธๅฐๆๅบ๏ผ
{
for(int h=1;;)//็ๆๆฐๅG={1,4,13,40,121,364,1093,.....}
{
if(h>n)break;
G.push_back(h);
h=3*h+1;
}
for(int i=G.size()-1;i>=0;i--)///ๆ้ๅบๆๅฎG[i]=g;
{
insertionSort(A, n, G[i]);
}
}
bool isStable(struct card c1[],struct card c2[],int N)///ๅคๆญ็จณๅฎ๏ผ
{
for(int i=0;i<N;i++)
{
if(c1[i].suit!=c2[i].suit)return false;
}
return true;
}
int main()
{
card c1[107],c2[107];
int n;
char ch;
cin>>n;
for(int i=0;i<n;i++)scanf("%d",&a[i]);
cnt=0;
shellSort(a, n);
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;i--)
{
printf("%d",G[i]);
if(i)printf(" ");
}
printf("\n");
printf("%lld\n",cnt);
for(int i=0;i<n;i++)printf("%d\n",a[i]);
return 0;
}
| #include<iostream>
#include<stdio.h>
#include<vector> // ๅฏๅค้ท้
ๅ
using namespace std;
static const int MAX = 1000000;
void printLine(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
printf("%d", A[i]);
}
printf("\n");
}
int insertionSort(int A[], int N, int g) {
int cnt = 0;
for (int i = g; i < N;i++) {
int seq = A[i];
int j = i - g;
while(j >= 0 && A[j] > seq) {
A[j + g] = A[j];
j = j - g;
cnt++;
}
A[j + g] = seq;
}
return cnt;
}
int shellSort(int A[], int N) {
// ๅฏๅค้ท้
ๅใงshell sortใฎๅน
ใ็ๆ
// ใใฎๆฎต้ใงใฏๆ้ [1, 3, 9...]
vector<int> vec;
vec.push_back(1); // append
for (int i = 1;;) {
i = i * 3;
if (i > N) {
break;
}
vec.push_back(i); // append
}
// ๅน
ใชในใใฎใตใคใบ
int s = vec.size();
printf("%d\n", s);
int cnt = 0;
// ้้ ใซ่ฉไพก
for (int i = s - 1;i >= 0;i--) {
if (i < s - 1) {
printf(" ");
}
printf("%d", vec[i]);
cnt += insertionSort(A, N, vec[i]);
}
printf("\n");
return cnt;
}
int main() {
int N;
scanf("%d", &N);
int A[MAX];
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
//insertionSort(A, N, 1);
int cnt = shellSort(A, N);
printf("%d\n", cnt);
for (int i = 0; i < N; i++) {
printf("%d\n", A[i]);
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
//0=48,A=65,a=97
int main() {
int n;cin >> n;
string s,t;cin >> s >>t;
string m;
for(int i = 0; i < n; i++) {
bool x=true;
string y;
for(int j = i; j < n; j++) {
if(s[j]==t[j-i]) y += s[j];
else{
x=false;
break;
}
}
if(x){
m=y;
break;
}
}
cout << 2*n-m.size() << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
string s, t;
cin >> N >> s >> t;
int ans = 2*N;
rep(i,N) {
if (s.substr(i,N-i) == t.substr(0,N-i) ){ ans = N+i; break;}
}
cout << ans << endl;
return 0;
} | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T> void printvec(const vector<T>& v) {
for (auto x : v) { cout << x << " "; }
cout << endl;
}
template<class T> void printtree(const vector< vector<T> >& tree) {
for (long long i = 0; i < tree.size(); ++i) {
cout << i + 1 << ": "; printvec(tree[i]);
}
}
template<class T, class U> void printmap(const map<T, U>& mp) {
for (auto x : mp) { cout << x.first << "=>" << x.second << endl; }
}
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; }
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;
const ll INF = 1e9;
const ll MOD = 1000000007; // 1e9 + 7
class UnionFind {
public:
UnionFind(ll n) : par(n, -1), rnk(n, 0), cnt(n, 1), _size(n) {}
bool same(ll x, ll y) {
return root(x) == root(y);
}
void unite(ll x, ll y) {
x = root(x); y = root(y);
if (x == y) return;
--_size;
if (rnk[x] < rnk[y]) { swap(x, y); }
par[y] = x;
cnt[x] += cnt[y];
if (rnk[x] == rnk[y]) { ++rnk[x]; }
}
ll root(ll x) {
if (par[x] < 0) {
return x;
} else {
return par[x] = root(par[x]);
}
}
ll count(ll x) {
return cnt[root(x)];
}
ll size() {
return _size;
}
private:
vector<ll> par;
vector<ll> rnk;
vector<ll> cnt; // The number of vertices in each connected components.
ll _size; // The number of connected components. Decreases by unite.
};
// int main(int argc, char** argv) {
// ll N, M;
// cin >> N >> M;
// UnionFind tree(N);
// rep(i, M) {
// ll p, a, b;
// cin >> p >> a >> b;
// if (p == 0) { // Connect
// tree.unite(a, b);
// } else { // Judge
// if (tree.same(a, b)) {
// cout << "Yes" << endl;
// cout << "size: " << tree.size() << endl;
// cout << "count(" << a << "): " << tree.count(a) << endl;
// cout << "count(" << b << "): " << tree.count(b) << endl;
// } else {
// cout << "No" << endl;
// cout << "size: " << tree.size() << endl;
// cout << "count(" << a << "): " << tree.count(a) << endl;
// cout << "count(" << b << "): " << tree.count(b) << endl;
// }
// }
// }
// }
int main(int argc, char** argv) {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
//cout << setprecision(10) << fixed;
ll n;
cin >> n;
vector<P> xs; // pair of <x, id>
vector<P> ys; // pair of <y, id>
rep(i, n) {
ll x, y;
cin >> x >> y;
xs.emplace_back(x, i);
ys.emplace_back(y, i);
}
sort(all(xs));
sort(all(ys));
vector<triple> edges; // <cost, from, to>
rep(i, n-1) {
auto& from = xs[i];
auto& to = xs[i+1];
edges.emplace_back(abs(from.first - to.first), from.second, to.second);
}
rep(i, n-1) {
auto& from = ys[i];
auto& to = ys[i+1];
edges.emplace_back(abs(from.first - to.first), from.second, to.second);
}
sort(all(edges));
ll ans = 0;
UnionFind uf(n);
for (auto& edge : edges) {
ll cost, from, to;
tie(cost, from, to) = edge;
if (uf.same(from, to)) { // already connected
// Do nothing
} else {
uf.unite(from, to);
ans += cost;
}
}
cout << ans << endl;
}
| #include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vb = vector<bool>;
using qi = queue<int>;
using P = pair<int, int>;
using graph = vector<vector<edge>>;
// using graph = vector<vector<int>>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define REP(i,n) for(int i=0;i<n;i++)
#define delim(i, n) cout << (i == n-1 ? "\n" : " ")
#define print1(v) cout << fixed << setprecision(10) << v << "\n"
#define print2(v1, v2) cout << fixed << setprecision(10) << v1 << " " << v2 << "\n"
#define printvi(v, n) REP(iiii, n) { cout << v[iiii]; delim(iiii, n); }
#define printvii(v, h, w) REP(iiiii, h) { printvi(v[iiiii], w); }
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; }
const int inf = 1LL << 60;
// const int inf = 100000000;
const int mod = 1000000007;
const int maxn = 1e5;
int n;
vi x(maxn);
vi y(maxn);
vb used(maxn);
graph G(maxn);
vi dx = {-1, 0, 0, 1};
vi dy = {0, -1, 1, 0};
// O(|E|log|V|)
int prim() {
int s = 0;
used.assign(n, false);
priority_queue<P, vector<P>, greater<P>> pq;
pq.emplace(0, s);
int ret = 0;
while (!pq.empty()) {
P p = pq.top();
pq.pop();
int v = p.second;
if (used[v]) continue;
used[v] = true;
ret += p.first;
for (auto &e : G[v]) pq.emplace(e.cost, e.to);
}
return ret;
}
signed main () {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
REP(i, n) {
cin >> x[i] >> y[i];
}
vi idx(n);
vi idy(n);
REP(i, n) {
idx[i] = i;
idy[i] = i;
}
sort(idx.begin(), idx.end(), [&](int i, int j) { return x[i] < x[j]; });
sort(idy.begin(), idy.end(), [&](int i, int j) { return y[i] < y[j]; });
REP(i, n-1) {
edge e;
int s = idx[i];
e.to = idx[i+1];
e.cost = x[e.to] - x[s];
G[s].push_back(e);
swap(e.to, s);
G[s].push_back(e);
}
REP(i, n-1) {
edge e;
int s = idy[i];
e.to = idy[i+1];
e.cost = y[e.to] - y[s];
G[s].push_back(e);
swap(e.to, s);
G[s].push_back(e);
}
int ret = prim();
print1(ret);
} | 1 |
#include<cstdio>
using ull = unsigned long long;
const static int MOD = 1000000007;
const static int MAX_H = 100;
const static int MAX_W = 8;
ull dp[MAX_H+1][MAX_W], fibonacci[8] = {1, 1, 2, 3, 5, 8, 13, 21};
int main(){
unsigned H, W, K;
scanf("%u %u %u", &H, &W, &K);
if(W == 1){
printf("1\n");
return 0;
}
K--;
dp[0][0] = 1;
for (size_t i = 1; i <= H; i++){
dp[i][0] = (dp[i-1][0]*fibonacci[W-1] + dp[i-1][1]*fibonacci[W-2]) %MOD;
for (size_t j = 1; j < W-1; j++){
dp[i][j] = (dp[i-1][j-1]*fibonacci[j-1]*fibonacci[W - j - 1] + dp[i-1][j]*fibonacci[j]*fibonacci[W - j - 1] + dp[i-1][j+1]*fibonacci[j]*fibonacci[W - j - 2]) %MOD;
}
dp[i][W-1] = (dp[i-1][W-1]*fibonacci[W-1] + dp[i-1][W-2]*fibonacci[W-2]) %MOD;
}
printf("%llu\n", dp[H][K]);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(){
int h,w,k;
cin >> h >> w >> k;
//ๅๅฆ็,0~w-2ใฎ่พบใใใฃใใจใ,ใใใใใ้ฃใๅใฃใ่พบใ้ธใใงใใชใๅ ดๅใฎๆฐ.
map<int,int> mp;
ll sum = 0;
for(int i = 0;i < (1 << w-1);i++){
vector<int> now;
for(int j = 0;j < w-1;j++){
if((i >> j) & 1)now.push_back(j);
}
bool flag = true;
for(int j = 0;j < (int)now.size() - 1;j++){
if(now[j+1] == now[j] + 1)flag = false;
}
if(!flag)continue;
for(int j = 0;j < now.size();j++)mp[now[j]]++;
sum++;
}
vector<vector<vector<ll>>> dp(h+1,vector<vector<ll>>(w,vector<ll>(w,0)));
for(int i = 0;i < w;i++)dp[0][i][i] = 1;
for(int i = 0;i < h;i++){//ไป่ฆใฆใใ้ซใ.
for(int j = 0;j < w;j++){
for(int k = 0;k < w;k++){
//dp[i][j][k]:=้ซใiใซใใใฆj->kใจใชใๅ ดๅใฎๆฐ.
//j-ใๅใใ.
if(k-1 >= 0){
dp[i+1][j][k-1] += dp[i][j][k] * mp[k-1];
dp[i+1][j][k-1] %= MOD;
}
if(k+1 <= w-1){
dp[i+1][j][k+1] += dp[i][j][k] * mp[k];
dp[i+1][j][k+1] %= MOD;
}
dp[i+1][j][k] += dp[i][j][k] * (sum - mp[k-1] - mp[k]);
dp[i+1][j][k] %= MOD;
}
}
}
cout << dp[h][0][k-1] << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
list<char> A;
list<char> B;
list<char> C;
string S_A,S_B,S_C;
cin >> S_A >> S_B >> S_C;
for(int i=0;i<S_A.size();i++) A.push_back(S_A[i]);
for(int i=0;i<S_B.size();i++) B.push_back(S_B[i]);
for(int i=0;i<S_C.size();i++) C.push_back(S_C[i]);
char t = A.front();
A.pop_front();
while(1){
if(t == 'a'){
if(A.size() == 0){
cout << 'A' << endl;
return 0;
}
t = A.front();
A.pop_front();
}
else if(t == 'b'){
if(B.size() == 0){
cout << 'B' << endl;
return 0;
}
t = B.front();
B.pop_front();
}
else{
if(C.size() == 0){
cout << 'C' << endl;
return 0;
}
t = C.front();
C.pop_front();
}
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c) cout<<"No";
else if(a!=b&&a!=c&&b!=c) cout<<"No";
else cout<<"Yes";
return 0;
} | 0 |
#include<iostream>
int main()
{
int x, S;
std::cin >> x;
S = x * x * x;
std::cout << S << std::endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using namespace std;
ll n, k;
const ll mod = 1000000007;
int main(){
int x;
cin >> x;
out(x/3);
}
| 0 |
#include<iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (B == 1) {
}
else {
for (int i = 1; i < 100; i++) {
if (i * A - i + 1 >= B) {
ans = i;
break;
}
}
}
cout << ans << endl;
return 0;
} | #include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int main(){
int day,mon[]={31,29,31,30,31,30,31,31,30,31,30,31},now,ans;
for(;;){
ans=0;
cin>>now>>day;
if(now==0)break;
for(int i=0;i<now-1;i++){
ans+=mon[i];
}
ans+=day;
ans=ans%7;
if(ans==1)printf("Thursday\n");
if(ans==2)printf("Friday\n");
if(ans==3)printf("Saturday\n");
if(ans==4)printf("Sunday\n");
if(ans==5)printf("Monday\n");
if(ans==6)printf("Tuesday\n");
if(ans==0)printf("Wednesday\n");
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
const long long mod = 1e9+7;
//////////////////////////////////
int main() {
string s; cin >> s;
if (s.size()%2 == 1) {
cout << "No" << endl;
return 0;
}
for(int i=0; i<s.size(); i+=2) {
if (s[i] == 'h' && s[i+1] == 'i') continue;
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
}
// EOF | #include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
int a,b,c,d,e,f,g,h,i,s;
a = n/100000000;
b = n/10000000-10*a;
c = n/1000000-100*a-10*b;
d = n/100000-1000*a-100*b-10*c;
e = n/10000-10000*a-1000*b-100*c-10*d;
f = n/1000-100000*a-10000*b-1000*c-100*d-10*e;
g = n/100-1000000*a-100000*b-10000*c-1000*d-100*e-10*f;
h = n/10-10000000*a-1000000*b-100000*c-10000*d-1000*e-100*f-10*g;
i = n-100000000*a-10000000*b-1000000*c-100000*d-10000*e-1000*f-100*g-10*h;
s = a+b+c+d+e+f+g+h+i;
if (n/s == (n+s-1)/s) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0 |
#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> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
ll gcd (ll x, ll y){
ll r = x % y ;
if(r == 0) return y ;
return gcd(y, r) ;
}
bool isprime(ll x){
ll s = sqrt((double) x) ;
for(ll i = 2; i <= s ; i++){
if(x % i == 0) return false ;
}
return true ;
}
int main (){
ll a, b ;
cin >> a >> b ;
ll k = gcd(a, b) ;
ll s = sqrt((double)k) ;
vector<ll> y ;
for(ll i = 1; i <= s; i++){
if(k % i == 0){
y.push_back(i) ;
if(i != k/i){
y.push_back(k/i) ;
}
}
}
sort(y.begin(), y.end()) ;
ll num = y.size() ;
ll ans = 0 ;
rep(i, num){
if(isprime(y[i])) ans++ ;
}
cout << ans << endl ;
} | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<ll, ll> > res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0; // ๆๆฐ
// ๅฒใใ้ใๅฒใ็ถใใ
while (N % a == 0) {
++ex;
N /= a;
}
// ใใฎ็ตๆใ push
res.push_back({a, ex});
}
// ๆๅพใซๆฎใฃใๆฐใซใคใใฆ
if (N != 1) res.push_back({N, 1});
return res;
}
// using namespace atcoder;
void Main()
{
ll A, B;
cin >> A >> B;
ll gcd = GCD(A, B);
auto primes = prime_factorize(gcd);
put(primes.size() + 1);
}
signed main(){ Main();return 0;} | 1 |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<int,int>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=1e18;
const int mod=1e9+7;
const int M=100009;
inline int bigmod(int B,int P){int R=1;while(P>0){if(P&1){R=(R*B)%mod;}P>>=1;B=(B*B)%mod;}return R;}
inline int ad(int x,int y){int ret=(x%mod+y%mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int sub(int x,int y){int ret=((x%mod)-(y%mod)+mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int gun(int x,int y){int ret=((x%mod)*(y%mod))%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
int n,m,v,p;
vector<pi>vec;
int a[M+3];
bool vis[M+3];
bool chk(int idx)
{
int big=p-1;
int use=v-1;
int mn=min(big,use);
big-=mn;
use-=mn;
vector<pi>yo;
if(vis[idx])return true;
int mx=vec[idx].fi+m;
int sum=use*m;
//cout<<sum<<" ### "<<endl;
for(int i=p-1;i<n;i++)
{
if(i==idx)continue;
int val=vec[i].fi;
int gap=mx-val;
if(gap<0)
{
//cout<<i<<" "<<mx<<" "<<val<<endl;
}
if(gap<0)return false;
int can=min(gap,m);
sum-=can;
}
if(sum<=0)return true;
else return false;
}
main()
{
fast
cin>>n>>m>>v>>p;
f(i,1,n)
{
int x;
cin>>x;
a[i]=x;
vec.pb(mp(x,i));
}
sort(vec.rbegin(),vec.rend());
int last;
for(int i=0;i<p;i++)
{
vis[i]=true;
last=vec[i].fi;
}
for(int i=p;i<n;i++)
{
if(vec[i].fi==last)
{
vis[i]=true;
}
else break;
}
// cout<<chk(3)<<"#"<<endl;
int lo=0,hi=n-1;
while(hi-lo>=2)
{
int mid=(lo+hi)>>1;
if(chk(mid))lo=mid;
else hi=mid-1;
}
int ses=-1;
for(int i=lo;i<=hi;i++)
{
if(chk(i))ses=i;
}
if(ses==-1)
{
cout<<"0"<<endl;
return 0;
}
ses=ses+1;
cout<<ses<<endl;
return 0;
}
| #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#define LL long long
using namespace std;
const int MAX=1e5+3;
LL a[MAX];
LL add[MAX];
inline bool myru(LL x,LL y){return x>y;}
LL rin()
{
LL s=0;
char c=getchar();
bool bj=0;
for(;(c>'9'||c<'0')&&c!='-';c=getchar());
if(c=='-')bj=1,c=getchar();
for(;c>='0'&&c<='9';c=getchar())s=(s<<1)+(s<<3)+(c^'0');
if(bj)return -s;
return s;
}
int main()
{
//ไปฅไธ่งๅๆๅ
ๅๅคๅฎ๏ผไผๅ
ๆปก่ถณ้ ๅ็่งๅ
//1.ๅฆๆไปๅคงๅฐๅฐๆๅบๅa[p]-a[i]>m ๅa[i]็ปๅฏนๆ ๆณๅ
ฅ้
//2.ๅฆๆไปpๅฐi-1่ฟไบๆฐไธ้ๆถ่ฝๅๅคvไธช้็ฅจ๏ผๅa[i]ๅฏไปฅๅ
ฅ้
//3. โj=i-1 To p a[i]+m-a[j] >= (v-n+(i-p))*m ,ๅa[i]ๅฏไปฅๅ
ฅ้
int i,j;
LL n,m,v,p;
n=rin();m=rin();v=rin(),p=rin();
for(i=1;i<=n;i++)a[i]=rin();sort(a+1,a+n+1,myru);
add[0]=0;for(i=1;i<=n;i++)add[i]=add[i-1]+a[i];
int ans=p;
for(i=p+1;i<=n&&a[i]==a[p];i++)ans++;
for(;i<=n;i++)
{
if(a[p]-a[i]>m)continue;
if(n-(i-p)>=v){ans++;continue;}
LL sum=a[i]+m;
sum*=(i-p);
sum-=add[i-1]-add[p-1];
if(sum>=m*(v-(n-(i-p))))ans++;
}
printf("%d",ans);
return 0;
}
| 1 |
/*
* @Author: wxyww
* @Date: 2020-05-21 15:53:33
* @Last Modified time: 2020-05-21 16:09:36
*/
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<ctime>
#include<cmath>
using namespace std;
typedef long long ll;
const int N = 200010;
#define int ll
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 * 10 + c - '0'; c = getchar();
}
return x * f;
}
int n;
ll tmp[N];
void mul(int *a,int *b) {
for(int i = 1;i <= n;++i) {
tmp[i] = a[b[i]];
}
for(int i = 1;i <= n;++i) a[i] = tmp[i];
}
int a[N],p[N];
void qm(ll y) {
int ret[N];
for(int i = 1;i <= n;++i) ret[i] = i;
for(;y;y >>= 1,mul(p,p))
if(y & 1) mul(ret,p);
for(int i = 1;i <= n;++i) p[i] = ret[i];
}
signed main() {
n = read();
for(int i = 1;i <= n;++i) {
a[i] = read();p[i] = i;
}
int m = read();ll K = read();
for(int i = n;i >= 1;--i) a[i] -= a[i - 1];
for(int i = 1;i <= m;++i) {
int x = read();
swap(p[x],p[x + 1]);
}
qm(K);
for(int i = 1;i <= n;++i) tmp[i] = a[p[i]];
// for(int i = 1;i <= n;++i) printf("%d ",tmp[i]);
// puts("");
for(int i = 1;i <= n;++i) {
printf("%lld.0\n",tmp[i] += tmp[i - 1]);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
struct rectangle{
int h, w;
bool operator<(const rectangle &a)const{
if(w*w + h*h == a.w*a.w + a.h*a.h)
return h < a.h;
return w*w + h*h < a.w*a.w + a.h*a.h;
}
};
int main(){
vector<rectangle> ans;
for(int i = 1; i <= 150; i++) {
for(int j = i + 1; j <= 150; j++) {
rectangle r;
r.h = i, r.w = j;
ans.push_back(r);
}
}
sort(ans.begin(), ans.end());
for(int i = 0; i < 20; i++) {
//cout << ans[i].h << " " << ans[i].w << endl;
}
int h, w;
while(cin >> h >> w, h){
rectangle r;
r.h = h, r.w = w;
for(int i = 0; i < ans.size(); i++){
if(r < ans[i]){
cout << ans[i].h << " " << ans[i].w << endl;
break;
}
}
}
return 0;
} | 0 |
#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) for(int i = a; i < b; i++)
// #define endl '\n'
using ll = long long;
using db = long double;
using ii = pair<int, int>;
const int N = 1e5+5, LG = 17, MOD = 1e9+7;
const int SQ = 320;
const long double EPS = 1e-7;
int a[N];
int F[N<<1], iF[N<<1];
int n;
int fast(int b, int e){
int res = 1;
for(;e;b=1ll*b*b%MOD,e>>=1)
if(e&1)res = 1ll * res * b % MOD;
return res;
}
void init(){
F[0] = iF[0] = 1;
f(i,1,N<<1){
F[i] = 1ll * i * F[i-1] % MOD;
iF[i] = fast(F[i], MOD - 2);
}
}
int get(int x1, int y1, int x2, int y2){
int cntX = x2 - x1;
int cntY = y2 - y1;
return 1ll *F[cntX+cntY] * iF[cntX] % MOD * iF[cntY] % MOD;
}
int32_t main(){
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif // ONLINE_JUDGE
init();
int H,W,A,B;
cin>>H>>W>>A>>B;
int ans = 0;
f(i,1,H-A+1){
int x = get(1,1,i,B+1);
if(i>1)x-=get(1,1,i-1,B+1);
if(x<0)x+=MOD;
ans += 1ll * x *get(i,B+1,H,W) % MOD;
if(ans>=MOD)ans-=MOD;
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//cout << fixed << setprecision(10);//
//ๆๅฐๅ
ฌๅๆฐ//
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
//้ๅ
mod(mใๆณใจใใaใฎ้ๅ
)//
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
//Cmonp//
ll fac[MAX], finv[MAX], inv[MAX];
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// ไบ้
ไฟๆฐ่จ็ฎ
ll COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//nใๅคง
ll com(ll n,ll m){
if(n<=0 || m<=0 || n==m){
return 1;
}
if(n<m){
return 0;
}
ll k=1;
for(ll i=1;i<=m;i++){
k*=(n-i+1);
k%=MOD;
k*=modinv(i,MOD);
k%=MOD;
}
return k;
}
////////////////////////////////////////////////////////////////////
int main() {
ll n,m,k;
cin>>n>>m>>k;
ll ml=com(n*m-2,k-2);
ll ans=0;
for(int i=1;i<=n-1;i++){
ans+=i*m*m*(n-i);
ans%=MOD;
}
for(int i=1;i<=m-1;i++){
ans+=i*n*n*(m-i);
ans%=MOD;
}
ans*=ml;
ans%=MOD;
cout<<ans<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a[5];
char ans[5];
string b;
cin>>b;
for(int i=0;i<4;i++){
a[i]=b[i]-'0';
ans[i]='+';
}
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
int sum=0;
for(int k=0;k<4;k++){
if(k==i && k!=0 || k==j && k!=0){
sum-=a[k];
}
else{
sum+=a[k];
}
}
if(sum==7){
ans[i]='-';
ans[j]='-';
cout<<a[0]<<ans[1]<<a[1]<<ans[2]<<a[2]<<ans[3]<<a[3]<<"="<<"7"<<endl;
return(0);
}
}
}
return(0);
} | #include <iostream>
using namespace std;
int main() {
int abcd;
cin >> abcd;
int num[4] = {abcd / 1000, (abcd / 100) % 10, (abcd / 10) % 10, abcd % 10};
int sum;
bool match = false;
for (int bit = 0; bit < (1 << 3); bit++) {
sum = num[0];
for (int i = 0; i < 3; i++) {
if (bit & (1 << i)) sum -= num[i + 1];
else
sum += num[i + 1];
}
if (sum == 7) {
match = true;
cout << num[0];
for (int j = 0; j < 3; j++) {
if (bit & (1 << j)) cout << "-" << num[j + 1];
else
cout << "+" << num[j + 1];
}
cout << "=7" << endl;
break;
}
if (match) break;
}
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cassert>
#define MOD 998244353
#define ll long long
using namespace std;
inline int read(){
int re=0,flag=1;char ch=getchar();
while(!isdigit(ch)){
if(ch=='-') flag=-1;
ch=getchar();
}
while(isdigit(ch)) re=(re<<1)+(re<<3)+ch-'0',ch=getchar();
return re*flag;
}
ll n,m,f[1000010],finv[1000010];
ll qpow(ll a,ll b){
ll re=1;
while(b){
if(b&1) re=re*a%MOD;
a=a*a%MOD;b>>=1;
}
return re;
}
void init(){
ll i,len=n+m;
f[0]=f[1]=finv[0]=finv[1]=1;
for(i=2;i<=len;i++) f[i]=f[i-1]*i%MOD;
finv[len]=qpow(f[len],MOD-2);
for(i=len;i>2;i--) finv[i-1]=finv[i]*i%MOD;
}
ll C(ll y,ll x){
// cout<<"C "<<x<<' '<<y<<' '<<f[x]<<' '<<finv[y]<<' '<<finv[x-y]<<'\n';
return f[x]*finv[y]%MOD*finv[x-y]%MOD;
}
int main(){
n=read();m=read();int i;ll ans=0;
if(n<m) swap(n,m);
init();
for(i=1;i<=m;i++) (ans+=C(i,2*i)*C(n-i,n+m-2*i)%MOD)%=MOD;
ans=ans*qpow(2*C(n,n+m)%MOD,MOD-2)%MOD;
// cout<<ans<<'\n';
ans=(ans+n+MOD)%MOD;
cout<<ans;
}
| #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define eprintf(...) 42
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
clock_t startTime;
double getCurrentTime() {
return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const ll MOD = 998244353;
ll add(ll x, ll y) {
x += y;
if (x >= MOD) return x - MOD;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0) return x + MOD;
return x;
}
ll mult(ll x, ll y) {
return (x * y) % MOD;
}
ll bin_pow(ll x, ll p) {
if (p == 0) return 1;
if (p & 1) return mult(x, bin_pow(x, p - 1));
return bin_pow(mult(x, x), p / 2);
}
ll rev(ll x) {
return bin_pow(x, MOD - 2);
}
const int N = (int)1e6 + 77;
ll f[N], rf[N];
ll getC(int n, int k) {
if (k < 0 || k > n) return 0;
return mult(f[n], mult(rf[k], rf[n - k]));
}
int main()
{
startTime = clock();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
f[0] = 1;
for (int i = 1; i < N; i++)
f[i] = mult(f[i - 1], i);
rf[N - 1] = rev(f[N - 1]);
for (int i = N - 1; i > 0; i--)
rf[i - 1] = mult(rf[i], i);
int n, m;
scanf("%d%d", &n, &m);
ll ans = 0;
for (int k = 1; k <= min(n, m); k++)
ans = add(ans, mult(getC(2 * k, k), getC(n + m - 2 * k, n - k)));
ans = mult(ans, rev(mult(2, getC(n + m, m))));
ans = add(ans, max(n, m));
printf("%lld\n", ans);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
int p[n];
rep(i,n) cin >> p[i];
int min = 1e9;
int ans = 0;
for(int i = 0; i < n; i++){
if(p[i] <= min){
min = p[i];
ans++;
}
}
cout << ans << endl;
} | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N,i,j,k,ans=0;
cin>>N;
vector<int> L(N);
for (i=0;i<N;i++) cin>>L[i];
for (i=0;i<N-2;i++) {
for (j=i+1;j<N-1;j++) {
if (L[i]==L[j]) continue;
for (k=j+1;k<N;k++) {
if (L[i]==L[k] || L[j]==L[k]) continue;
if (L[i] < L[j]+L[k] && L[j] < L[i]+L[k] && L[k] < L[j]+L[i]) ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int n;
vector<ll>v;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(int i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
i++;
v.push_back(a[i]);
}
}
if(v.size()<2)
cout<<0<<endl;
else
{
ll x=v.size();
cout<<(v[x-1]*v[x-2])<<endl;
}
}
| #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.0);
int main(void)
{
ll n,m,x,y; cin>>n>>m>>x>>y;
vector<ll> a(n),b(m);
rep(i,n) cin>>a[i];
rep(i,m) cin>>b[i];
sort(all(a));
sort(all(b));
bool can=false;
for(int i=x+1;i<=y;i++){
if(a[n-1]<i && i<=b[0]) can=true;
else continue;
}
cout<<(can?"No War":"War")<<endl;
return 0;
} | 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 <iterator>
#include <math.h>
#include <list>
using namespace std;
int main(void){
long x;
cin >> x;
long neko = x / 11;
long amari = x % 11;
cout << neko*2 + ((amari == 0) ? 0 :((amari > 6)? 2 : 1 ))<< endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
string S; cin>>S;
vector<int> word(S.size());
set<int> ch;
rep(i,S.size())
{
word.at(i)=S.at(i)-'a';
ch.insert(S.at(i)-'a');
}
if(S.size()<26)
{
rep(i,26)
{
if(!(ch.count(i)))
{
cout<<S<<(char)(i+'a')<<endl;
return 0;
}
}
}
if(S=="zyxwvutsrqponmlkjihgfedcba") {cout<<-1<<endl; return 0;}
set<int> list;
int last;
char p=S.at(25);
for(int i=25;i>=0;i--)
{
if(S.at(i-1)-'a'>S.at(i)-'a')
{
list.insert(S.at(i)-'a');
S.pop_back();
continue;
}
list.insert(S.at(i)-'a');
S.pop_back();
last=S.at(i-1)-'a';
list.insert(S.at(i-1)-'a');
S.pop_back();
break;
}
for(int i=last+1;i<26;i++)
{
if(list.count(i))
{
cout<<S<<(char)(i+'a')<<endl;
return 0;
}
}
/*
rep(i,26)
{
if(i==0) {continue;}
if(S.at(i)>S.at(i-1)) {}
*/
/*
next_permutation(word.begin(),word.end());
string ans="";
bool judge=false;
for(int i=25;i>=0;i--)
{
if(word.at(i)!=i) {judge=true;}
if(judge) {ans+=(char)(word.at(i)+'a');}
}
reverse(ans.begin(),ans.end());
cout<<ans<<endl;
*/
return 0;
}
| 0 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
#include<set>
using namespace std;
long long n,d,a[200005],r[200005],l[200005];
int main()
{
cin>>n>>d;
long long ret=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
ret+=a[i];
}
ret+=(n-1)*d;
//cout<<ret<<endl;
r[0]=a[0];
for(int i=1;i<n;i++)
r[i]=min(a[i],r[i-1]+d);
l[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
l[i]=min(a[i],l[i+1]+d);
for(int i=1;i<n-1;i++)
ret+=min(l[i],r[i]);
cout<<ret;
return 0;
} | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int s, n, i, j, k, ans, ct;
cin >> s >> n;
vector<int> a(n);
for (i = 0; i < n; i++) cin >> a[i];
sort(a.rbegin(), a.rend());
vector<bool> v(s);
ans = 0;
ct = a[0];
for (i = 0; i < s; i += 2) {
if (ct > 0) {
v[i] = true;
ct--;
}
}
for (i = s - 1; i >= 0; i--) {
if (!v[i] && (ct > 0)) {
v[i] = true;
ct--;
}
}
ans = 0;
for (i = 1; i < s; i++) {
if (v[i] && (v[i - 1])) ans++;
}
cout << ans << "\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true; } return false; }
template<typename H> bool chmax(H& v1, const H v2) { if (v1 < v2) { v1 = v2; return true; } return false; }
template<typename H> void read(H& head) { cin >> head; }
template<typename H, typename ...T> void read(H& head, T& ...tail) { cin >> head; read(tail...); }
template<typename H> void write(H head) { cout << head << '\n'; }
template<typename H, typename ...T> void write(H head, T ...tail) { cout << head << " "; write(tail...); }
template<typename ...T> void die(T ...tok) { write(tok...); exit(0); }
const ll mod = 998244353;
int cnt[100005], t[100005];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n; read(n);
int mx = 0;
rep(i, 0, n) {
read(t[i]);
chmax(mx, t[i]);
cnt[t[i]]++;
}
if (t[0] != 0 || cnt[0] != 1)
die(0);
ll ans = 1;
rep(i, 1, mx + 1) {
rep(j, 0, cnt[i])
ans = ans * cnt[i - 1] % mod;
}
die(ans);
}
| #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 first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#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--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=998244353;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
ll mod_pow(ll x,ll n,ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N; cin>>N;
ll ans=1;
ll tmp_max=0;
vector<ll> num(N,0);
rep(i,N){
ll tmp; cin>>tmp;
chmax(tmp_max,tmp);
if(i==0){
if(tmp!=0){
cout<<0<<endl;
return 0;
}
else num[tmp]++;
}
else{
if(tmp==0){
cout<<0<<endl;
return 0;
}
else{
num[tmp]++;
}
}
}
rep1(i,tmp_max){
if(num[i]==0){
cout<<0<<endl;
return 0;
}
else{
ans*=mod_pow(num[i-1],num[i],MOD);
ans%=MOD;
}
}
cout<<ans<<endl;
}
| 1 |
#include<iostream>
using namespace std;
int main()
{ int n;
cin >> n;
int x[n];
for(int i=0;i<n;i++){
cin >> x[i];
}
for(int j=n-1;j>=0;j--){
if(j!=n-1) cout << " " ;
cout << x[j];
}
cout<<endl;
} | /*
* @Author: hesorchen
* @Date: 2020-07-03 17:05:01
* @LastEditTime: 2020-09-04 19:45:56
* @Description: https://hesorchen.github.io/
*/
#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <vector>
#include <bitset>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define endl '\n'
#define PI acos(-1)
#define PB push_back
#define ll long long
#define INF 0x3f3f3f3f
#define mod 1000000007
#define pll pair<ll, ll>
#define lowbit(abcd) (abcd & (-abcd))
#define max(a, b) ((a > b) ? (a) : (b))
#define min(a, b) ((a < b) ? (a) : (b))
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define FRE \
{ \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout); \
}
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 << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
//head==============================================================================
long long a[100010];
int main()
{
long long n;
scanf("%lld", &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
int s = 0;
for (int i = 1; i <= n; i++)
{
if (a[i] < 0)
s++;
if (a[i] == 0)
{
s = 0;
break;
}
}
long long ans = 0;
if (s % 2 == 0)
{
for (int i = 1; i <= n; i++)
ans += abs(a[i]);
}
else
{
// int minn = INF;
// for (int i = 1; i <= n; i++)
// {
// if (a[i] < 0 && abs(a[i]) < minn)
// minn = abs(a[i]);
// }
// for (int i = 1; i <= n; i++)
// {
// ans += abs(a[i]);
// }
// ans -= 2 * minn;
for (int i = 1; i <= n; i++)
a[i] = abs(a[i]);
sort(a + 1, a + 1 + n);
for (int i = 2; i <= n; i++)
ans += a[i];
ans -= a[1];
}
printf("%lld\n", ans);
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string N;
cin >> N;
int ja = 0;
for (int i = 0; i < N.size(); i++) {
if (N[i] == '7') {
cout << "Yes" << endl;
ja += 7;
break;
}
}
if (ja < 7) {
cout << "No" << endl;
}
} | #include <stdio.h>
int main (){
int numberS, a, b, c;
scanf("%d", &numberS);
a = numberS%10;
b = numberS/100;
c = numberS%100/10;
if(a==7 || b==7 || c==7){
printf("Yes");
}
else{
printf("No");
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define light ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pb push_back
#define all(c) c.begin(),c.end()
#define PI 3.14159265358979323846
const ll MAX = 1e4+10;
const ll INF = 1e18;
const ll MOD = 1e9+7;
vector<int> digits;
int d,n;
int dp[MAX][110][2];
ll digitdp(int pos,int sum,int flag)
{
if(pos==n)
{
if(sum==0)
return 1;
return 0;
}
if(dp[pos][sum][flag]!=-1)
return dp[pos][sum][flag];
int limit = (flag==1)?digits[pos]:9;
ll tot = 0;
for(int i=0;i<=limit;i++)
{
if(digits[pos]==i)
tot=(tot+digitdp(pos+1,(sum+i)%d,flag))%MOD;
else
tot=(tot+digitdp(pos+1,(sum+i)%d,0))%MOD;
}
return dp[pos][sum][flag] = tot;
}
int main()
{
memset(dp,-1,sizeof(dp));
int i,j,l;
string k;
cin >> k >> d;
l = k.length();
for(i=0;i<l;i++)
digits.pb(k[i]-'0');
n = digits.size();
ll ans = (digitdp(0,0,1)-1+MOD)%MOD;
cout << ans;
} | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
const int M=2000000;
ll n,a[M],b[M];
int main(){
cin>>n;
ll g=0,cnt=0,res=0;
for(int i=0;i<n;i++){
int x;
cin>>x;
g^=x;
if(g==0){
cnt++;
if(i==n-1){
for(auto j:a) (res+=j)%=mod;
(res+=1)%=mod;
}
ll t=a[g]+1;
(a[g]+=t)%=mod;
}
else{
ll t=(a[g]*cnt-b[g]+1+mod)%mod;
(a[g]+=t)%=mod;
(b[g]+=t*cnt)%=mod;
if(i==n-1) res=t;
}
}
cout<<res<<endl;
} | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int friends[500];
int n,m;
pair<int, int> student[10000];
int result[100];
int I = 0;
for (int i = 0;; i++)
{
cin >> n;
cin >> m;
if (m == 0 && n == 0)
{
break;
}
for (int a = 0; a < 500; a++)
{
friends[a] = 0;
student[a].first = 0;
student[a].second = 0;
}
for (int a = 0; a < m; a++)
{
cin >> student[a].first >> student[a].second;
student[a].first--;
student[a].second--;
}
sort(student, student + m);
friends[0] = 1;
for (int a = 0; a < m; a++)
{
if (student[a].first == 0)
{
for (int b = 0; b < m; b++)
{
if (student[b].first == student[a].second)
{
friends[student[b].second] = 1;
}
if (student[b].second == student[a].second)
{
friends[student[b].first] = 1;
}
}
friends[student[a].second] = 1;
}
}
result[i] = -1;
for (int a = 0; a < n; a++)
{
if (friends[a] == 1)
{
result[i]++;
}
}
I++;
}
for (int a = 0; a < I;a++)
{
cout << result[a] << endl;
}
return 0;
} | // https://atcoder.jp/contests/abc134/tasks/abc134_d
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
bitset<200001> bs;
FOR(i, 1, N + 1) {
int t;
cin >> t;
if (t) {
bs.set(i);
}
}
bitset<200001> ans;
int cnt = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = i * 2; j <= N; j += i) {
sum += ans[j];
}
if (sum % 2 != bs[i]) {
ans.set(i);
cnt++;
}
}
cout << cnt << "\n";
for (int i = 1; i <= N; i++) {
if (ans[i]) {
cout << i << (--cnt ? " " : "\n");
}
}
return 0;
}
| 0 |
#include <stdio.h>
#define MAX 10000
int main(void){
int list[MAX]={0}, q;
// determine primes
for (int i=2; i<MAX; i++){
if (list[i]==-1) continue;
list[i]=1;
for (int j=2*i; j<MAX; j+=i){
list[j] = -1;
}
}
while (scanf("%d",&q),q){
for (int i=q; i>=5; i--){
if (list[i]==1 && list[i-2]==1){
printf("%d %d\n",i-2, i);
break;
}
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <vector>
constexpr bool divisible(const std::size_t n, const std::size_t m)
{
return (0 == n % m);
}
std::vector<std::size_t> prime_table = {2};
bool prime(const std::size_t n)
{
const std::size_t found_last_prime = prime_table.back();
if(found_last_prime < n)
{
std::list<std::size_t> undefined_table;
for(std::size_t i = found_last_prime + 1; i <= n; ++i)
{
undefined_table.push_back(i);
}
const std::size_t sn = std::sqrt(n);
for(std::size_t p = 0; !undefined_table.empty() && p < prime_table.size(); ++p)
{
for(auto u = undefined_table.begin(); u != undefined_table.end();)
{
if(divisible(*u, prime_table.at(p)))
{
u = undefined_table.erase(u);
}
else
{
++u;
}
}
if(!undefined_table.empty() && found_last_prime <= prime_table.at(p))
{
prime_table.push_back(undefined_table.front());
undefined_table.pop_front();
if(sn < prime_table.back())
{
break;
}
}
}
prime_table.insert(prime_table.end(), undefined_table.begin(), undefined_table.end());
}
return std::binary_search(prime_table.begin(), prime_table.end(), n);
}
std::pair<std::size_t, std::size_t> find_twin_prime(const std::size_t limit, const bool next_skip = false)
{
return prime(limit) ?
prime(limit - 2) ?
std::make_pair(limit - 2, limit) :
find_twin_prime(limit - (next_skip ? 3 : 1), true) :
find_twin_prime(limit - (next_skip ? 2 : 1), false);
}
int main()
{
std::size_t n;
while(std::cin >> n, n != 0)
{
const auto&& t = find_twin_prime(n);
std::cout << t.first << " " << t.second << std::endl;
}
} | 1 |
#include <stdio.h>
int main(){
char s[10];
scanf("%s",&s);
getchar();
s[3]='8';
printf("%s",&s);
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
string date;
cin >> date;
date.replace(0, 4, "2018");
cout << date;
} | 1 |
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 1 << 30
#define LLINF LLONG_MAX/3
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define BIT(i,j) ((i)>>(j))&1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique((o).begin(),(o).end()), (o).end())
#define SQ(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef pair<ll,ll> Pll;
typedef pair<int, int> Pii;
typedef pair<double, double> Pdd;
typedef complex<double> dcomplex;
template<typename T> inline void priv(vector<T>a){REP(i,a.size()){cerr<<a[i]<<((i==a.size()-1)?"\n":" ");}}
ll gcd(ll a,ll b){int c=max(a,b);int d=min(a,b);return c==0||d==0?c:gcd(c%d,d);}
ll lcm(ll a,ll b){return a==0||b==0?0:a*b/gcd(a,b);}
ll fact(ll a){ll b=1;FOR(i,1,a)b*=i;return b;}
ll power(ll x,ll n){ll a=1;REP(i,n)a*=x;return a;}
int n,x,y;
int main()
{
while(1)
{
scanf("%d",&n);
if(n==0) return 0;
int A = 0;
int B = 0;
REP(i,n)
{
scanf("%d %d",&x,&y);
if(x>y) A+=(x+y);
else if(x<y) B+=(x+y);
else
{
A+=x;
B+=y;
}
}
printf("%d %d\n",A,B);
}
} |
#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 << " " << pointY << endl;
pointX = pointY = count = 0;
cin >> n;
}
} while (n != 0);
return 0;
} | 1 |
#include <bits/stdc++.h>
#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)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define show(x) cout << #x << " = " << (x) << endl
#define show2(x,y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define show3(x,y,z) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl
#define showv(v) rep(i,v.size()) printf("%d%c", v[i], i==v.size()-1?'\n':' ')
#define showv2(v) rep(j,v.size()) showv(v[j])
#define showt(t,n) rep(i,n) printf("%d%c", t[i], i==n-1?'\n':' ')
#define showt2(t,r,c) rep(j,r) showt(t[j],c)
#define showvp(p) rep(i,p.size()) printf("%d %d\n", p[i].first, p[i].second)
#define printv(v) rep(i,v.size()) printf("%d\n", v[i])
#define printt(t,n) rep(i,n) printf("%d\n", t[i])
#define incl(v,x) (find(all(v),x)!=v.end())
#define incls(s,c) (s.find(c)!=string::npos)
#define lb(a,x) distance((a).begin(),lower_bound(all(a),(x)))
#define ub(a,x) distance((a).begin(),upper_bound(all(a),(x)))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define bit(n,k) ((n>>k)&1) // nใฎk bit็ฎ
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define uni(x) x.erase(unique(all(x)),x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using vp = vector<P>;
using vt = vector<T>;
const int mod = 1000000007;
const double EPS = 1e-9;
//const long double EPS = 1e-14;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62)-1;
#define dame { puts("No"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
inline int in() { int x; cin >> x; return x;}
inline ll lin() { ll x; cin >> x; return x;}
inline char chin() { char x; cin >> x; return x;}
inline string stin() { string x; cin >> x; return x;}
inline double din() { double x; cin >> x; return x;}
//template<class T = int> inline T in() { T x; cin >> x; return (x);}
template<typename T>inline ll suma(const vector<T>& a) { ll res(0); for (auto&& x : a) res += x; return res;}
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; }
char itoa(int n) { return n + '0';}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const int dx[4] = {1, 0,-1, 0};
const int dy[4] = {0, 1, 0,-1};
int main () {
int A, B, M;
cin >> A >> B >> M;
vi a(A), b(B);
rep(i,A) cin >> a[i];
rep(i,B) cin >> b[i];
int ans = *min_element(all(a));
ans += *min_element(all(b));
rep(i,M) {
int x, y, c;
cin >> x >> y >> c;
x--, y--;
chmin(ans, a[x]+b[y]-c);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SETI;
const int mxN = 2e5;
const ld pi = 4.0 * atanl(1.0);
const int iinf = 1e9 + 10;
const int inf = 1e18 + iinf + 10;
const int mod = 1000000007;
const ld prec = .000001;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(c) c.begin(), c.end()
#define rall(c) c.end(), c.begin()
int A, B, M, x, y, c, a[mxN], b[mxN];
void fast() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); }
int main() {
fast();
cin >> A >> B >> M;
int mnA = mxN, mnB = mxN;
for (int i = 0; i < A; ++i) {
cin >> a[i];
mnA = min(a[i], mnA);
}
for (int i = 0; i < B; ++i) {
cin >> b[i];
mnB = min(b[i], mnB);
}
int mn = mxN;
for (int i = 0; i < M; ++i) {
cin >> x >> y >> c;
mn = min((a[x - 1] + b[y - 1]) - c, mn);
}
if (mnB + mnA < mn)
cout << mnB + mnA;
else
cout << mn;
return 0;
}
| 1 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
int n, m;
cin >> n >> m;
if(n == 0)
return 0;
vector<vector<int> > edges(n);
for(int i=0; i<m; ++i){
int a, b;
cin >> a >> b;
edges[a-1].push_back(b-1);
edges[b-1].push_back(a-1);
}
vector<bool> check(n, false);
check[0] = true;
for(int i=0; i<2; ++i){
vector<bool> next = check;
for(int j=0; j<n; ++j){
if(check[j]){
for(unsigned k=0; k<edges[j].size(); ++k)
next[edges[j][k]] = true;
}
}
check = next;
}
int ret = -1;
for(int i=0; i<n; ++i){
if(check[i])
++ ret;
}
cout << ret << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MOD 1000000007
#define INF 1000000000
int main(){
int N,M;
cin>>N>>M;
Graph G(N);
vector<int> count(N,0);
for(int i=0;i<N+M-1;i++){
int A,B;
cin>>A>>B;
A--,B--;
G.at(A).push_back(B);
count.at(B)++;
}
int root;
for(int i=0;i<N;i++){
if(count.at(i)==0){
root=i;
}
}
vector<int> parent(N,-1);
stack<int> s;
s.push(root);
while(!s.empty()){
int v=s.top();
s.pop();
for(auto nv:G.at(v)){
if(count.at(nv)>1){
count.at(nv)--;
}else{
parent.at(nv)=v;
s.push(nv);
}
}
}
for(int i=0;i<N;i++){
cout<<parent.at(i)+1<<endl;
}
}
| 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a, b, c;
cin >> a;
if(a == 1){
cout << "Hello World\n";
return 0;
}
if(a == 2){
cin >> b >> c;
cout << b + c << "\n";
return 0;
}
}
| #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <cctype>
using namespace std;
int main() {
string st;
int stlen;
while (cin >> st) {
stlen = st.size();
for (int i = stlen - 1; i >= 0; i--) {
cout << st[i];
}
putchar('\n');
}
return 0;
} | 0 |
/********************************************************************************
Code by a weak man named CYJian, and he hopes the code can get more points.
Algorithm:
********************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//{{{ FAST IO AND SOME FUNCTIONS
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", stdin), freopen(s"out", "w", stdout)
template<typename T>
inline void read(T &x) {
char ch, t = 0; x = 0;
while(!isdigit(ch = ge)) t |= ch == '-';
while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = ge;
x = t ? -x : x;
}
inline int read_int() { int x; return read(x), x; }
inline ll read_ll() { ll x; return read(x), x; }
template<typename T> inline void chkmin(T&a, T b) { a = a < b ? a : b; }
template<typename T> inline void chkmax(T&a, T b) { a = a > b ? a : b; }
//}}}
const int MAXN = 1000010;
int n;
char S[MAXN];
char T[MAXN];
struct Node {
int p, h;
Node() {}
Node(int p, int h):p(p), h(h) {}
};
queue<Node>q;
int main() {
#ifdef LOCAL
FILE("");
#endif
scanf("%d%s%s", &n, S + 1, T + 1);
int pT = n, pS = n, res = 0, Add = 0, las = -1;
while(pT) {
while(pS && S[pS] != T[pT]) --pS;
if(!pS) return puts("-1"), 0;
while(!q.empty() && q.front().p - Add > pT) chkmax(res, q.front().h + Add), q.pop();
if(las != pS && pS < pT) ++Add, q.push(Node(pS + Add, 1 - Add)), las = pS;
--pT, pS -= pT < pS;
} while(!q.empty()) chkmax(res, q.front().h + Add), q.pop();
cout << res << endl;
return 0;
} | #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) ((int)a.size())
#define FI first
#define SE second
#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 FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define yes cout<<"Yes"<<endl
#define YES cout<<"YES"<<endl
#define no cout<<"No"<<endl
#define NO cout<<"NO"<<endl
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
string s;
cin>>s;
string back_s=s.substr(n,n);
reverse(ALL(back_s));
map<pair<string,string>,ll> m;
REP(bit,(1<<n)){
string b="",r="";
REP(i,n){
if((bit>>i)&1)
b+=back_s[i];
else
r+=back_s[i];
}
if(b>r)
swap(b,r);
m[make_pair(b,r)] += 1;
}
ll ans=0;
REP(bit,(1<<n)){
string b="",r="";
REP(i,n){
if((bit>>i)&1)
b+=s[i];
else
r+=s[i];
}
if(b>r)
swap(b,r);
if(b==r)
ans+=m[make_pair(b,r)];
else
ans+=m[make_pair(b,r)]/2;
}
cout<<ans<<endl;
}
| 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 300;
int mat[2][1 + 2 * nmax][1 + 2 * nmax];
std::vector<std::pair<int,int>> mv[2];
int lim;
bool valid(int x, int y) {
return 0 <= x && x < lim && 0 <= y && y < lim;
}
void dfs(int x, int y, int color, int p) {
if(mat[p][x][y] == 0) {
mat[p][x][y] = color;
for(int h = 0; h < mv[p].size(); h++) {
int newx = x + mv[p][h].first;
int newy = y + mv[p][h].second;
if(valid(newx, newy))
dfs(newx, newy, 3 - color, p);
}
}
}
int frec[3][3];
int main() {
int n, d1, d2;
std::cin >> n;
std::cin >> d1 >> d2;
lim = 2 * n;
for(int i = -lim; i <= lim; i++)
for(int j = -lim; j <= lim; j++) {
if(i * i + j * j == d1)
mv[0].push_back({i, j});
if(i * i + j * j == d2)
mv[1].push_back({i, j});
}
for(int i = 0; i < lim; i++)
for(int j = 0; j < lim; j++) {
dfs(i, j, 1, 0);
dfs(i, j, 1, 1);
frec[mat[0][i][j]][mat[1][i][j]]++;
}
for(int h = 1; h <= 2; h++)
for(int h2 = 1; h2 <= 2; h2++)
if(n * n <= frec[h][h2]) {
int lft = n * n;
for(int i = 0; i < lim; i++)
for(int j = 0; j < lim; j++)
if(0 < lft && mat[0][i][j] == h && mat[1][i][j] == h2) {
std::cout << i << " " << j << '\n';
lft--;
}
return 0;
}
return 0;
}
| #pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include <bits/stdc++.h>
#define int ll
//#define double long double
#define endl '\n'
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define mp make_pair
#define pb emplace_back
#define dbg(x) cerr << #x << " : " << x << endl
#define PI 3.1415926535
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair <int, int>;
using pld = pair <ld, ld>;
/*
const ll MAX_MEM = 3e6;
char MEM[MAX_MEM];
ll MEM_POS = 0;
void* operator new(size_t x)
{
auto ret = MEM + MEM_POS;
MEM_POS += x;
assert(MEM_POS < MAX_MEM);
return ret;
}
void operator delete(void*)
{}
*/
template <class T>
istream& operator>> (istream &in, vector <T> &a)
{
for (auto &i : a)
in >> i;
return in;
}
template <class T>
ostream& operator<< (ostream &out, vector <T> a)
{
for (auto &i : a)
out << i << ' ';
return out;
}
template <class T, class U>
istream& operator>> (istream &in, pair <T, U> &p)
{
in >> p.first >> p.second;
return in;
}
template <class T, class U>
ostream& operator<< (ostream &out, pair <T, U> p)
{
out << p.first << " " << p.second << " ";
return out;
}
inline void Start()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
//freopen("lol.in", "r", stdin);
//freopen("lol.out", "w", stdout);
}
vector <int> bpow(vector <int> a, int n, int k)
{
vector <int> p(n);
iota(all(p), 0);
for (int i = 0; i < a.size(); ++i)
swap(p[a[i]], p[a[i] - 1]);
vector <int> res(n);
iota(all(res), 0);
while (k)
{
if (k & 1)
{
vector <int> r = res;
for (int i = 0; i < n; ++i)
res[i] = r[p[i]];
}
vector <int> r = p;
for (int i = 0; i < n; ++i)
p[i] = r[r[i]];
k >>= 1;
}
return res;
}
signed main()
{
Start();
int n;
cin >> n;
vector <int> x(n);
cin >> x;
vector <int> d(n - 1);
for (int i = 1; i < n; ++i)
d[i - 1] = x[i] - x[i - 1];
int m, k;
cin >> m >> k;
vector <int> a(m);
cin >> a;
for (auto &i : a)
--i;
a = bpow(a, n - 1, k);
auto t = d;
for (int i = 0; i < n - 1; ++i)
d[i] = t[a[i]];
d.pb(0);
int sum = 0;
for (int i = 0; i < n; ++i)
{
cout << x[0] + sum << endl;
sum += d[i];
}
return 0;
}
| 0 |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N, M, D;
while (true)
{
scanf("%d", &N);
scanf("%d", &M);
if (N == 0 && M == 0) { break; }
vector<int> C; C.push_back(0);
for (int i = 0; i < N; i++)
{
scanf("%d", &D);
if (D <= M)
{
C.push_back(D);
}
}
vector<int> r1, r;
for (int i = 0; i < C.size(); i++)
{
for (int j = i; j < C.size(); j++)
{
if (C[i] + C[j] <= M)
{
r1.push_back(C[i] + C[j]);
}
}
}
sort(r1.begin(), r1.end());
r.push_back(r1[0]);
for (int i = 0; i < r1.size(); i++)
{
if (r1[i - 1] != r1[i])
{
r.push_back(r1[i]);
}
}
int ret = 0;
for (int i = 0; i < r.size(); i++)
{
int ptr = upper_bound(r.begin(), r.end(), M - r[i]) - r.begin() - 1;
if (ptr >= 0)
{
ret = max(ret, r[i] + r[ptr]);
}
}
printf("%d\n", ret);
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <iomanip>
#include <cassert>
using namespace std;
typedef long long ll;
int main(){
int N, M;
cin >> N >> M;
vector<int> pos(N,0);
int favs[N][M];
for(int i = 0 ; i <N; i++){
for(int j = 0; j <M; j++){
cin >> favs[i][j];
favs[i][j]--;
}
}
vector<bool> used(M,false);
int ans = N;
for(int j = 0 ; j < M; j++){
vector<int> cnt(M,0);
int target = 0;
int m=0;
for(int i = 0 ; i <N; i++){
int f = favs[i][pos[i]];
cnt[f]++;
if(cnt[f]>m){
m=cnt[f];
target = f;
}
}
// delete target
//cout << m << " " << target << endl;
used[target]=true;
ans = min(m,ans);
if(j!=M-1){
for(int i = 0 ; i <N; i++){
while(used[favs[i][pos[i]]]==true) pos[i]++;
}
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------------------------------
void MAIN() {
int n;
cin >> n;
int ans = 0;
map<pair<int, int>, int> m;
for (int i = 0; i < n; i++) {
double _; cin >> _;
int t = llround(_ * 1e9);
int ct = 0, cf = 0;
while (t % 2 == 0) {
t /= 2;
ct++;
}
while (t % 5 == 0) {
t /= 5;
cf++;
}
for (auto &j : m) {
if (j.fi.fi + ct >= 18 && j.fi.sc + cf >= 18) {
ans += j.sc;
}
}
m[ii(ct, cf)]++;
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int64_t res = 0;
vector table(20, vector(20, 0));
for (int i = 0; i < N; i++) {
string s;
cin >> s;
auto pos = s.find(".");
if (pos == string::npos) {
s += string(9, '0');
} else {
s.erase(s.begin() + pos);
s += string(9 - ((int)s.size() - pos), '0');
}
int64_t x = static_cast<int64_t>(stoll(s));
pair<int, int> a = make_pair(0, 0);
while (x % 2 == 0) {
x /= 2;
a.first++;
}
while (x % 5 == 0) {
x /= 5;
a.second++;
}
a.first = min(a.first, 18);
a.second = min(a.second, 18);
for (int j = 18 - a.first; j < 20; j++) {
for (int k = 18 - a.second; k < 20; k++) {
res += table[j][k];
}
}
table[a.first][a.second]++;
}
cout << res << '\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int k = 55555;
int a[55555]={};
int main(){
int n;
cin >> n;
for(int i=2;i<=k;i++){
for(int j=i;j<=k;j+=i) a[j]++;
}
for(int i=2;i<=k;i++){
if(a[i]==1){
if(i%5==2&&n>0){
cout << i << ' ';
n--;
}
}
}
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
vector<bool> IsPrime;
void sieve(size_t max){
IsPrime.assign(max + 1, true);
IsPrime[0] = false;
IsPrime[1] = false;
for(int i = 2; i*i <= max; i++){
if(IsPrime[i])for(int j = 2; i*j <= max; j++) IsPrime[i*j] = false;
}
}
int main(){
sieve(55555);
int cnt;
vector<int> ans;
for(int i = 1; i<= 55555; i++){
if(i%5 == 1 && IsPrime[i] == true)ans.push_back(i);
}
int N; cin >> N;
rep(i, N) cout << ans[i] << " ";
cout << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
int n,m;
ll d[105][105];
bool v[105][105];
int main() {
cin>>n>>m;
for (int i=0;i<n;i++) for (int j=0;j<n;j++) {
if (i==j) {
d[i][j]=0;
v[i][j]=1;
}
else d[i][j]=INF;
}
for (int i=0;i<m;i++) {
int s,t,l; cin>>s>>t>>l;
d[s][t]=l;
v[s][t]=1;
}
for (int k=0;k<n;k++)
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
if (v[i][k] && v[k][j]) {
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
v[i][j]=1;
}
for (int i=0;i<n;i++)
if (d[i][i]<0) {
cout<<"NEGATIVE CYCLE"<<'\n';
return 0;
}
for (int i=0;i<n;i++) for (int j=0;j<n;j++) {
if (d[i][j]==INF) cout<<"INF";
else cout<<d[i][j];
cout<<" \n"[j+1==n];
}
}
| #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#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 repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout<<(x)<<"\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll,vector<ll>,greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
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;
}
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
int main(){
ll n,q;
cin>>n>>q;
vector<pair<ll,pll>> p(n);
rep(i,n){
ll s,t,x;
cin>>s>>t>>x;
p[i].F=x;
p[i].S=mp(s-x,t-x);
}
sort(all(p));
set<ll> d;
map<ll,ll> pp;
rep(i,q){
ll dd;
cin>>dd;
d.insert(dd);
pp[dd]=INF;
}
rep(i,n){
auto itr=d.upper_bound(p[i].S.S);
auto itre=d.lower_bound(p[i].S.F);
while(itr!=itre&&*itre<p[i].S.S){
pp[*itre]=p[i].F;
ll g=*itre;
itre++;
d.erase(g);
}
}
for(auto hh:pp){
if(hh.S==INF)COUT(-1);
else COUT(hh.S);
}
}
| 0 |
#include<iostream>
#include<string>
using namespace std;
int Roman_to_Arabia(char c){
if (c == 'I')return 1;
else if (c == 'V')return 5;
else if (c == 'X')return 10;
else if (c == 'L')return 50;
else if (c == 'C')return 100;
else if (c == 'D')return 500;
else if (c == 'M')return 1000;
else return 0;
}
int main(){
string roman;
int num;
while (cin >> roman){
num = 0;
for (int i = 0; i < roman.size(); ++i){
if (Roman_to_Arabia(roman[i]) < Roman_to_Arabia(roman[i + 1]))
num -= Roman_to_Arabia(roman[i]);
else
num += Roman_to_Arabia(roman[i]);
}
cout << num << endl;
}
return 0;
} | #include<stdio.h>
void spin_w(int x[]){
int sai1[6],i;
for(i=0;i<6;i++){
sai1[i]=x[i];
}
sai1[0]=x[2];
sai1[2]=x[5];
sai1[3]=x[0];
sai1[5]=x[3];
for(i=0;i<6;i++){
x[i]=sai1[i];
}
}
void spin_s(int x[]){
int sai1[6],i;
for(i=0;i<6;i++){
sai1[i]=x[i];
}
sai1[0]=x[4];
sai1[1]=x[0];
sai1[4]=x[5];
sai1[5]=x[1];
for(i=0;i<6;i++){
x[i]=sai1[i];
}
}
int main(){
int i,a=0,j,sai1[6];
char dic[101];
for(i=0;i<6;i++){
scanf("%d",&sai1[i]);
}
scanf("%s",dic);
for(i=0;i<=100;i++){
if(dic[i]=='\0')break;
if(dic[i]=='W'){
spin_w(sai1);
}else if(dic[i]=='E'){
for(j=0;j<3;j++){
spin_w(sai1);
}
}else if(dic[i]=='S'){
spin_s(sai1);
}else if(dic[i]=='N'){
for(j=0;j<3;j++){
spin_s(sai1);
}
}
}
printf("%d\n",sai1[0]);
return 0;
} | 0 |
//#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
string N; cin >> N;
int L = N.size();
reverse(N.begin(), N.end());
vector<int> a(L + 2);
for (int i = 0; i < L; i++) {
a[i] = N[i] - '0';
//printf("a[%d]=%d ", i, a[i]);
}
vector<int> dp(L + 1);
for (int i = 0; i <= L; i++) {
if (a[i] < 5) dp[i] = a[i];
else if (a[i] == 5) {
dp[i] = 5;
if (a[i + 1] >= 5) a[i + 1]++;
}
else {
dp[i] = 10 - a[i];
a[i + 1]++;
//a[i + 1] %= 10;
}
}
/*
cout << endl << 0;
for (int i = L - 1; i >= 0; i--) {
cout << N[i];
}
cout << endl;
*/
ll ans = 0;
for (int i = L; i >= 0; i--) {
//cout << dp[i];
ans += dp[i];
}
//cout << endl;
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li dp[2][1001000];
int main() {
string s;
cin >> s;
dp[0][0] = 0;
dp[1][0] = 1;
rep(i, sz(s)) {
li num = s[i] - '0';
dp[0][i + 1] = min(dp[0][i] + num, dp[1][i] + 10 - num);
dp[1][i + 1] = min(dp[1][i] + 9 - num, dp[0][i] + num + 1);
}
cout << dp[0][sz(s)] << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1.0)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
int main() {
int n;
cin >> n;
cout << (n-2)*180 << endl;
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
int n;
int main() {
read(n);
print(180 * (n - 2));
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
vector <ll> a(n+1), dp[3];
for (int i=0; i<=2; i++) {
dp[i].resize(n+1);
for (int j=1; j<=n; j++) {
dp[i][j] = -1e18;
}
}
for (int i=1; i<=n; i++) {
cin >> a[i];
}
for (int i=1; i<=n; i++) {
for (int j=0; j<=2; j++) {
if (i-j-2 < 1) continue;
for (int k=0; k<=2-j; k++) {
dp[j+k][i] = max(dp[j+k][i], dp[k][i-j-2]+a[i]);
}
}
if (i <= 3) {
dp[max(0, i-2)][i] = a[i];
}
}
ll ans;
if ((n&1)) {
ans = max(max(max(dp[1][n], dp[2][n]), max(dp[0][n-1], dp[1][n-1])), dp[0][n-2]);
} else {
ans = max(dp[1][n], max(dp[0][n], dp[0][n-1]));
}
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
#define el '\n'
typedef long long ll;
const int MAXN = 2e5+2;
int N, A[MAXN];
ll odd[MAXN], dp[MAXN];
int main(){
cin.tie(0);
cin.sync_with_stdio(0);
cin >> N;
for(int i = 1;i<=N;i++) cin >> A[i];
odd[1] = A[1];
for(int i = 2;i<=N;i++){
if(i%2){
odd[i] = odd[i-2]+A[i];
}
}
dp[1] = 0;
for(int i = 2;i<=N;i++){
if(i%2){
dp[i] = max(dp[i-2]+A[i], dp[i-1]);
}else{
dp[i] = max(dp[i-2]+A[i], odd[i-1]);
}
}
cout << dp[N] << el;
} | 1 |
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cstdlib>
using namespace std;
vector<string> split(const string &str, char delim){
vector<string> res;
size_t current = 0, found;
while((found = str.find_first_of(delim, current)) != string::npos){
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
int main()
{
string s;
while(cin >> s)
{
vector<string> _s = split(s,',');
int *values = new int[11];
double *v = new double[2];
for(int i=0;i<11;i++)
{
if(i == 0)
{
values[i] = 0;
}
else
{
values[i] = std::atoi(_s[i-1].c_str()) + values[i-1];
}
}
for(int i=0;i<2;i++)
{
v[i] = std::atoi(_s[i+10].c_str());
}
double temp = v[0] / (v[0]+v[1]);
temp *= values[10];
bool flag = true;
for(int i=0;i<10;i++)
{
if(values[i] <= temp && temp <= values[i+1] && flag)
{
cout << i+1 << endl;
flag = false;
}
}
}
return 0;
} | #include<iostream>
using namespace std;
int main(void){
int l[10];
char c;
double ls, x1, t, v1, v2;
while(1){
ls = 0;
for(int i = 0; i < 10; i++){
cin >> l[i] >> c;
ls += l[i];
}
cin >> v1 >> c >> v2;
if(cin.eof())break;
x1 = t = 0.0;
for(int i = 0; i < 10; i++){
x1 += l[i];
t = x1 / v1;
if(x1 + t * v2 >=ls){
cout << ++i << endl;
break;
}
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int k;
string s, t = "...";
cin >> k >> s;
if(s.size() <= k)
cout << s << '\n';
else {
for (int i = 0; i < k; ++i) {
cout << s[i];
}
cout << t;
}
} | //้ซ็ฅ่ฝ็ณปVtuberใฎ้ซไบ่
ไนใงใใ
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& x: vec) { is >> x; }
return is;
}
int main() {
ll ans = 0;
ll tmp;
//int n; cin >> n;
vector<string> s(3);
cin >> s[0] >> s[1] >> s[2];
int who = 0;
while(1){
if(s[who].size()==0){
cout << (char)('A' + who) << endl;
break;
}
else{
int next = s[who][0] - 'a';
s[who] = s[who].substr(1);
who = next;
}
}
//cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n); (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
#define yes pf("Yes")
#define no pf("No")
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; }
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a,ll b){
if(a < b)swap(a, b);
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
ll factorial(ll n){
ll ans = 1;
rep1(i, n){
ans *= i;
ans %= mod;
}
return ans;
}
ll power(ll a, ll b){
ll ans = 1;
a %= mod;
while(b) {
if(b & 1LL) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
//modใฎๅคใฎ็ขบ่ชใใใใใจ
int main(){
ll n,ans = 0;
cin >> n;
vector<ll> s(n);
rep0(i, n){
ll a,b;
cin >> a >> b;
ans -= b;
s[i] = a + b;
}
sort(all(s),greater<>());
rep0(i, (n + 1) / 2)ans += s[i * 2];
pf(ans);
return 0;
}
| # include <bits/stdc++.h>
using namespace std;
int main(){
int N,x,y;
int ans=0;
cin>>N;
int A[N];//่จผ่จใฎๆฐ
vector<pair<int,int>>T[N];
//่จผ่จใๅ
ฅๅ
for(int i=0;i<N;i++){
cin>>A[i];
for(int j=0;j<A[i];j++){
cin>>x>>y;
x--;
T[i].push_back({x,y});
}
}
//bitๅ
จๆข็ดข
for(int i=0;i<(1<<N);i++){
int cnt=0;//ๆญฃ็ด่
ใฎๆฐ
for(int j=0;j<N;j++){
if(i & (1<<j)){
cnt++;
}
}
int flag=1;
for(int j=0;j<N;j++){
if(i & (1<<j)){
//jใๆญฃ็ด่
ใจใใฆ่จผ่จใ็็พใใชใใใใงใใฏใ็็พใใใflag=0ใงbreak;
for(int k=0;k<A[j];k++){
if(i & 1<<(T[j].at(k).first)){
if(T[j].at(k).second==1){
continue;
}
else{
flag=0;
break;
}
}
else{
if(T[j].at(k).second==0){
continue;
}
else{
flag=0;
break;
}
}
}
}
}
if(flag){
ans=max(ans,cnt);
}
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define ll long long
using namespace std;
template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
std::string substrBack(std::string str, size_t pos, size_t len) {
const size_t strLen = str.length();
return str.substr(strLen - pos, len);
}
int main()
{
int n;
cin >> n;
vector<ll> al(n);
vector<ll> bl(n);
vector<ll> cl(n);
rep(i, n) {
cin >> al[i];
}
rep(i, n) {
cin >> bl[i];
}
rep(i, n) {
cin >> cl[i];
}
sort(al.begin(), al.end());
sort(bl.begin(), bl.end());
sort(cl.begin(), cl.end());
ll ans = 0;
/*rep(i, n) {
auto lb = upper_bound(bl.begin(), bl.end(), al[i]);
ll lbStart = lb - bl.begin();
ll tmp = 0;
for (int j = lbStart; j < cl.size(); j++)
{
auto cb = upper_bound(cl.begin(), cl.end(), bl[j]);
tmp += cl.size() - (cb - cl.begin());
}
ans += tmp;
}*/
rep(i, n) {
auto la = lower_bound(al.begin(), al.end(), bl[i]) - al.begin();
auto lc = cl.size() - (upper_bound(cl.begin(), cl.end(), bl[i]) - cl.begin());
ans += la * lc;
}
cout << ans << endl;
//cout << fixed << setprecision(10) << ans << endl;
system("pause");
}
| #include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<map>
#include<iterator>
#include<cstdlib>
#include<cmath>
using namespace std;
#define MAX 100000
#define SENTINEL 2000000000
int A[MAX],n;
int partition(int p,int r)
{
int x,i,j,t;
x = A[r];
i = p-1;
for(j=p;j<r;j++)
{
if(A[j]<=x)
{
i++;
t = A[i];A[i] = A[j];A[j] = t;
}
}
t = A[i+1];A[i+1] = A[r];A[r] = t;
return i+1;
}
int main()
{
int i,q;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&A[i]);
q = partition(0,n-1);
for(i=0;i<n;i++)
{
if(i) printf(" ");
if(i==q)printf("[");
printf("%d",A[i]);
if(i==q)printf("]");
}
printf("\n");
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using ll= long long;
using namespace std;
int main(){
int N,A;
cin>>N;
vector<vector<pair<int,int>>> data;
data.resize(N);
rep(i,N){
cin>>A;
data[i].resize(A);
rep(j,A){
cin>>data[i][j].first>>data[i][j].second;
data[i][j].first--;
}
}
int ans=0;
for (int bit=0;bit<(1<<N);bit++){
int cnt=0;
bool ok=true;
rep(i,N){
if(!(bit & (1<<i))){
continue;
}
for (auto xy:data[i]){
int x=xy.first;
int y=xy.second;
if((bit & (1 << x))&&y==0){
ok=false;
}
else if(!(bit & (1 << x))&&y==1){
ok=false;
}
}
}
if(ok==true){
rep(i,N){
if(bit&(1<<i)){
cnt++;
}
}
ans=max(ans,cnt);
}
}
cout<<ans<<endl;
}
| //{{{
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
#endif
// clang-format off
void _print() { cerr << "]\033[0m\n"; }
template <typename T> void __print(T x) { cerr << x; }
template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#ifdef LOCAL
#define debug(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m["; _print(x)
#define debug_arr(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m" << (x) << "\033[0m\n"
#else
#define debug(x...)
#define debug_arr(x...)
#endif
// clang-format on
//}}}
const int N = 20;
const int mod = 1e9 + 7;
int n;
int a[N];
vector<pii> words[N];
bool is_h(int status, int idx) { return (status & (1 << idx)) > 0; }
bool check(int status)
{
for (int i = 0; i < n; i++)
{
// check ith person
bool is_honest = is_h(status, i);
if (is_honest == false) continue;
for (int j = 0; j < a[i]; j++)
{
int p = words[i][j].first;
int val = words[i][j].second;
bool is_p_h = is_h(status, p);
if (is_p_h != val) return false;
}
}
return true;
}
int main()
{
#ifdef LOCAL
freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
while (cin >> n)
{
for (int i = 0; i < n; ++i)
{
words[i].clear();
cin >> a[i];
for (int j = 0; j < a[i]; ++j)
{
int x, y;
cin >> x >> y;
x--;
words[i].push_back({x, y});
}
}
int ans = -1;
int lim = 1 << n;
for (int st = 0; st < lim; st++)
{
// if (__builtin_popcount(st) <= ans) continue;
// check
if (check(st))
{
ans = max(ans, __builtin_popcount(st));
}
}
// int v = __builtin_popcount(ans);
cout << ans << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r,g;
double p;
cin >> r >> g;
//g = (r + p) / 2
p = 2 * g - r;
cout << p << endl;
}
| #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int x, y;
cin >> x;
y = x * x * x;
cout << y << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long double dx,dy,RR,avdist,prt;
cin >>N;
int arrive[N];
vector<vector<long double>> b(N, vector<long double>(2));
vector<vector<long double>> dist(N, vector<long double>(N,0));
for(int i=0;i<N;i++){
arrive[i]=i;
cin >> b.at(i).at(0) >> b.at(i).at(1);
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
dx=b.at(i).at(0)-b.at(j).at(0);
dy=b.at(i).at(1)-b.at(j).at(1);
RR=pow(pow(dx,2)+pow(dy,2),0.5);
dist.at(i).at(j)= RR;
//cout << RR << endl;
}
}
avdist=0;
prt=0;
do{
for(int k=0;k<N-1;k++){
avdist+=dist.at(arrive[k]).at(arrive[k+1]);
}
prt+=1;
}while(next_permutation(arrive, arrive + N));
cout << fixed << setprecision(10) << avdist/prt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n , f[10] , v[10] , x[10] , y[10];
double sol;
double calc (int a , int b){
if (a == 0)
return 0;
return sqrt((x[a] - x[b]) * (x[a] - x[b]) + (y[a] - y[b]) * (y[a] - y[b]));
}
void back(int pas , double sum){
int i;
if (pas == n + 1){
sol += sum;
return;
}
for (i = 1 ; i <= n ; i++){
if (!f[i]){
f[i] = 1;
v[pas] = i;
back(pas + 1 , sum + calc(v[pas - 1] , v[pas]));
f[i] = 0;
}
}
}
int main()
{
//FILE *fin = fopen ("a.in","r");
int i;
cin >> n;
for (i = 1 ; i <= n ; i++){
cin >> x[i] >> y[i];
}
back(1 , 0.0);
for (i = 1 ; i <= n ; i++)
sol /= i;
cout << setprecision(8) << fixed << sol;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
bool flag = true;
cin >> s;
int len = s.size();
int count_c = 0;
int i_c = -1;
if(s[0] != 'A') flag = false;
for(int i=2;i<=len-2;i++){
if(s[i] == 'C') {
count_c++;
i_c = i;
}
}
if(count_c != 1) flag = false;
for(int i=1;i<len;i++){
if((int)s[i] >= 97 && (int)s[i] <= 121){
}
else{
if(i != i_c) flag = false;
}
}
if(flag){
cout << "AC" << endl;
}
else{
cout << "WA" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector < char >
# define vs vector < string >
# define vb vector < bool >
# define vd vector < D >
# define vll vector < ll >
# define vull vector < ull >
# define vld vector < ld >
# define PQ priority_queue
# define vvi vector < vector < int > >
# define vvb vector < vector < bool > >
# define vvc vector < vector < char > >
# define vvs vector < vs >
# define vvll vector < vector < ll > >
# define vvd vector < vector < D > >
# define vvld vector < vector < ld > >
# define all(v) (v).begin() , (v).end()
# define allrev(v) (v).rbegin() , (v).rend()
# define allcomp(v) v.begin() , v.end() , comp
# define allrevcomp(v) v.rbegin() , v.rend() , comp
# define pii pair < int , int >
# define pll pair < ll , ll >
# define pld pair < ld , ld >
# define pDD pair < D , D >
# define vpld vector < pld >
# define vpii vector < pii >
# define vpll vector < pll >
# define vpDD vector < pDD >
# define vvpii vector < vector < pii > >
# define F first
# define S second
# define mp make_pair
# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
# define pp(n) printf("%.10Lf",n);
# define line cout<<"\n";
# define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0);
# define fr(a,b) for(int i = a; i < b; i++)
# define rep(i,a,b) for(int i = a; i < b; i++)
string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = { -1 , 0 , 1 , 0 } ;
const int dy[] = { 0 , 1 , 0 , -1 } ;
const ld pie = 3.1415926535897932384626 ;
const ll mod = 1e9 + 7 ;
void solve(){
vector<string> cards(3);
fr(0,3) cin >> cards[i];
int turn = 0;
while(true){
if(cards[turn].empty()){
cout << char(('A'+turn)) ;
break;
}int next = cards[turn][0] - 'a';
cards[turn].erase(0,1);
turn =next;
}
line
return;
}
int main(){
fast
int t=1;
//cin >> t;
while(t--){
solve();
}
R 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>
#define MEMS(x) memset(x,-1,sizeof(x))
#define MEM(x) memset(x,0,sizeof(x))
#define less Less
#define EPS 1e-4
#define arg ARG
#define cpdd const pdd
#define rank Rank
#define KK 500
#define MXN 200005
vector<int> v[200005];
int color[200005];
int dfs(int x,int col){
color[x]=col;
int ans=1;
for(auto it:v[x]){
if(color[it]==-1){
ans &= dfs(it,col^1);
}
else{
if(color[it]==col){
ans=0;
}
}
}
return ans;
}
int main(){
int n,m;
scanf("%d %d",&n,&m);
MEMS(color);
for(int i=0;i<m;i++){
int x,y;
scanf("%d %d",&x,&y);
v[x].pb(y);
v[y].pb(x);
}
LL a=0,b=0,c=0;
for(int i = 1;i<=n;i++){
if(color[i]==-1){
if(v[i].empty())c++;
else if(dfs(i,0))b++;
else a++;
}
}
//printf("?%d %d\n",a,b);
printf("%lld\n",a*(a+b)*2-a*a+b*b*2+c*n*2-c*c);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int D, G;
cin >> D >> G;
vector<int> P(D), C(D);
rep(i, D) cin >> P[i] >> C[i];
int res = INF;
for(int bit = 0; bit < (1 << D); bit++) {
int score = 0;
int num = 0;
for(int i = 0; i < D; i++) {
if(bit & (1 << i)) {
score += C[i];
score += 100 * (i + 1) * P[i];
num += P[i];
}
}
vector<int> list;
for(int i = D - 1; i >= 0; i--) {
if(!(bit & (1 << i))) {
for(int j = 0; j < P[i]; j++)
list.pb(100 * (i + 1));
}
}
for(auto x : list) {
if(score >= G)
break;
score += x;
num++;
}
if(score >= G) {
res = min(res, num);
}
}
cout << res << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
vector<int>A(100000,0);
for (int i = 0; i < n; i=i+2) {
A.at(v.at(i)-1)++;
}
vector<int>a(100000,0);
for (int i = 0; i < 100000; i++) {
a.at(i) = A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int F = -1;
int S = -1;
for (int i = 0; i < 100000; i++) {
if (A.at(0) == a.at(i)){
F = i+1;
}
else if (A.at(1) == a.at(i)){
S = i+1;
}
}
vector<int>B(100000,0);
for (int i = 1; i < n; i=i+2) {
B.at(v.at(i)-1)++;
}
vector<int>b(100000,0);
for (int i = 0; i < 100000; i++) {
b.at(i) = B.at(i);
}
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
int f = -1;
int s = -1;
for (int i = 0; i < 100000; i++) {
if (B.at(0) == b.at(i)){
f = i+1;
}
else if (B.at(1) == b.at(i)){
s = i+1;
}
}
if (F == f){
if (A.at(0)-A.at(1) > B.at(0)-B.at(1)){
cout << n - A.at(0) - B.at(1) << endl;
}
else {
cout << n - A.at(1) - B.at(0) << endl;
}
}
else {
cout << n - A.at(0) - B.at(0) << endl;
}
}
| /*
* a.cc:
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
/* constant */
const int MAX_N = 100;
/* typedef */
/* global variables */
int as[MAX_N];
/* subroutines */
/* main */
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> as[i];
for (int i = 0; i < n; i++) {
if (i) putchar(' ');
printf("%d", as[n - 1 - i]);
}
putchar('\n');
return 0;
} | 0 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int h, w;
while (scanf("%d%d", &h, &w) != EOF && h && w) {
int S = h*h+w*w;
bool finished = false;
for (int i=h+1; i<=150; i++) {
int W = S - i*i;
for (int j=i+1; j<150; j++) {
if (j * j == W) {
finished = true;
printf("%d %d\n", i, j);
goto END;
}
}
}
while (!finished) {
S++;
for (int i=1; i<=150; i++) {
for (int j=i+1; j<150; j++) {
if (S == i*i+j*j) {
printf("%d %d\n", i, j);
goto END;
} else if (S < i*i+j*j) {
break;
}
}
}
}
END: continue;
}
} | #include <bits/stdc++.h>
using namespace std;
int mp[101][101];
int w, h;
int gx, gy;
int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
bool dfs(int y, int x, int c)
{
if (y < 1 || y > h || x < 1 || x > w || mp[y][x] != c) return false;
if (y == gy && x == gx) return true;
mp[y][x] = 0;
bool res = false;
for (int i = 0; i < 4; ++i) res = res || dfs(y + dy[i], x + dx[i], c);
return res;
}
int main()
{
while (cin >> w >> h, w || h) {
int sx, sy;
cin >> sx >> sy >> gx >> gy;
int n; cin >> n;
while (n--) {
int c, d, x, y; cin >> c >> d >> x >> y;
if (d) {
for (int i = 0; i < 4; ++i) for (int j = 0; j < 2; ++j) mp[y+i][x+j] = c;
} else {
for (int i = 0; i < 2; ++i) for (int j = 0; j < 4; ++j) mp[y+i][x+j] = c;
}
}
cout << (dfs(sy, sx, mp[sy][sx]) ? "OK" : "NG") << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
typedef pair<long long,long long> pll;
int main() {
fastIO;
int x, k;
cin >> k >> x;
for(int i = x-k+1; i <= x+k-1; i++){
if(i != x+k-1) cout << i << " ";
else cout << i << endl;
}
return 0;
}
| #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#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);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll a,b; cin >> a >> b;
cout << max(a*b,max(a+b,a-b)) << endl;
} | 0 |
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
const int mod = 998244353;
const int N = 307;
int dp[N][N][2*N][2];
inline int sum(int x, int y) {
if (x+y < 0) return x+y+mod;
if (x+y >= mod) return x+y-mod;
return x+y;
}
inline int mult(int x, int y) {
return ((ll) x * y) % mod;
}
int main(){
#ifdef LOCAL
freopen("I_input.txt", "r", stdin);
//freopen("I_output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int k;
cin >> k;
vector<int> arr;
int R = 0;
int now = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1') {
R++;
now++;
}
else {
arr.push_back(now);
now = 0;
}
}
arr.push_back(now);
dp[0][0][0][0] = 1;
int cur = 0;
for (int i = 0; i < arr.size(); ++i) {
for (int was = 0; was <= R; ++was) {
for (int delta = 0; delta <= 2*s.size(); ++delta) {
int T = sum(dp[i][was][delta][0], dp[i][was][delta][1]);
if (T == 0) continue;
for (int be = 0; be <= arr[i] && was+be <= R; ++be) {
dp[i+1][was + be][delta + arr[i] - be][0] = sum(dp[i+1][was + be][delta + arr[i] - be][0], T);
}
if (i + 1 < arr.size() && was + arr[i] + 1 <= R) {
dp[i+1][was+arr[i]+1][delta+1][1] = sum(dp[i+1][was+arr[i]+1][delta+1][1], T);
}
}
}
for (int was = 0; was <= R; ++was) {
for (int delta = 0; delta <= 2*s.size(); ++delta) {
if (dp[i+1][was][delta][1] && was+1 <= R) {
dp[i+1][was+1][delta+1][1] = sum(dp[i+1][was][delta][1], dp[i+1][was+1][delta+1][1]);
}
}
}
cur += arr[i];
for (int was = 0; was < cur; ++was) for (int delta = 0; delta <= 2*s.size(); ++delta) {
dp[i+1][was][delta][0] = 0;
dp[i+1][was][delta][1] = 0;
}
}
//cout << dp[3][2][2][0] << " " << R << endl;
int ans = 0;
for (int delta = 0; delta <= 2*s.size(); ++delta) if (delta <= 2*k) {
int T = sum(dp[arr.size()][R][delta][0], dp[arr.size()][R][delta][1]);
ans = sum(ans, T);
}
cout << ans;
}
| #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
std::istream &operator>>(std::istream &in, set<ll> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
//ifstream myfile("C:\\Users\\riku\\Downloads\\0_00.txt");
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
//const ll mod = 1e10;
//typedef priority_queue<P, vector<P>, greater<P> > PQ_ASK;
unordered_map<string, ll> check(int n, string &s) {
unordered_map<string, ll> ans;
rep(i, 1 << n) {
string a, b;
rep(j, n) {
if ((i >> j) & 1) a.push_back(s[j]);
else b.push_back(s[j]);
}
ans[a + ' ' + b]++;
}
return ans;
}
int main() {
int n;
string s;
cin >> n >> s;
string a = s.substr(0, n);
string b = s.substr(n);
unordered_map<string, ll> m1 = check(n, a);
reverse(b.begin(), b.end());
unordered_map<string, ll> m2 = check(n, b);
ll ans = 0;
for (auto &e : m1) {
ll now = e.second * m2[e.first];
ans += now;
}
cout << ans << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K;
cin >> N >> K;
if(N < K){
cout << 1 << endl;
return 0;
}
if(N%K == 0){
cout << 0 << endl;
return 0;
}
cout << N%K+1 - N%K << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
if(N % K == 0){
cout << '0' << endl;
}
else{
cout << '1' << endl;
}
}
| 1 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
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; }
ll INF = 1001001001;
ll LINF = 1001001001001001001ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vl as(n);
cin>>as;
if (n == 1) {
if (as[0]) cout<<-1<<endl;
else cout<<0<<endl;
return 0;
}
ll ans = as.back();
for (int i = n - 2; i >= 0; --i) {
if (as[i] > i) {
cout<<-1<<endl;
return 0;
}
if (as[i] + 1 < as[i + 1]) {
cout<<-1<<endl;
return 0;
}
if (as[i] + 1 == as[i + 1]) continue;
ans += as[i];
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define re register
using namespace std;
template <typename T>inline void read(T &x)
{
x=0;int f=1;char c=getchar();
for(;c>'9'||c<'0';c=getchar()) if(c=='-') f=-1;
for(;c>='0'&&c<='9';c=getchar()) x=(x<<3)+(x<<1)+(c^48);
x*=f;
}
const int maxn=1e5+5;
struct edge
{
int to,nxt;
}e[maxn<<1];
int n,k,head[maxn],cnt;
int a[maxn],rem[maxn],ans;
void add(int u,int v)
{
e[++cnt].to=v;
e[cnt].nxt=head[u];
head[u]=cnt;
}
void dfs(int u)
{
for(re int i=head[u];i!=0;i=e[i].nxt)
{
int v=e[i].to;
dfs(v);
if(rem[v]==k-1&&u!=1)
{
ans++;
rem[v]=-1;
}
rem[u]=max(rem[u],rem[v]+1);
}
}
int main()
{
read(n),read(k);
for(re int i=1;i<=n;++i)
read(a[i]);
if(a[1]!=1) ++ans;
for(re int i=2;i<=n;++i)
add(a[i],i);
dfs(1);
printf("%d",ans);
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
if(n<3)cout << 0 << endl;
else if(n<6)cout << 1 << endl;
else {
cout << n/3 << endl;
}
}
return 0;
}
| #define _USE_MATH_DEFINES //M_PI, M_E
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
cout<<n/3<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
using ll = long long;
using Weight = int;
using Capacity = int;
struct Edge {
int src, dst; Weight weight;
Edge(int s, int d, int w) : src(s), dst(d), weight(w) {}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;
vector<int> articulationPoint(const Graph& g){
int n = g.size(), idx;
vector<int> low(n), ord(n), art;
function<void(int)> visit = [&](int v){
low[v] = ord[v] = ++idx;
for(auto &e : g[v]){
int w = e.dst;
if(ord[w] == 0){
visit(w);
low[v] = min(low[v], low[w]);
if((ord[v] == 1 && ord[w] != 2) ||
(ord[v] != 1 && low[w] >= ord[v])) art.push_back(v);
} else low[v] = min(low[v], ord[w]);
}
};
for(int u = 0; u < n; u++) if(ord[u] == 0){ idx = 0; visit(u); }
return art;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
while(cin >> n >> m){
Graph g(n);
rep(i,m){
int a,b;
cin >> a >> b;
g[a].emplace_back(a,b,0);
g[b].emplace_back(b,a,0);
}
vector<int> arts = articulationPoint(g);
sort(all(arts));
auto last = unique(all(arts));
for(auto it = arts.begin(); it != last; ++it) cout << *it << '\n';
}
} | #include <iostream>
#include <cstring>
using namespace std;
int w, h, n;
int sx, sy, gx, gy;
int t[102][102];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
bool check(int x, int y, int c){
if(x == gx && y == gy) return true;
t[y][x] = -1;
for(int i = 0; i < 4; i++){
int nx = x + dx[i];
int ny = y + dy[i];
if(nx < 0 || w <= nx || ny < 0 || h <= ny || t[ny][nx] != c) continue;
if(check(nx, ny, c)) return true;
}
return false;
}
void putBlock(int c, int d, int x, int y){
int addX = (d == 0 ? 4 : 2);
int addY = (d == 0 ? 2 : 4);
for(int i = y; i < y + addY; i++){
for(int j = x; j < x + addX; j++){
t[i][j] = c;
}
}
}
int main(){
while(cin >> w >> h, w || h){
cin >> sx >> sy; sx--; sy--;
cin >> gx >> gy; gx--; gy--;
cin >> n;
memset(t, -1, sizeof(t));
for(int i = 0; i < n; i++){
int c, d, x, y;
cin >> c >> d >> x >> y;
x--;
y--;
putBlock(c, d, x, y);
}
/*
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
printf("%2d", t[i][j]);
}
cout<<endl;
}
*/
if(t[sy][sx] != -1 && check(sx, sy, t[sy][sx])){
cout << "OK\n";
}
else{
cout << "NG\n";
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m = 999;
string S;
cin >> S;
for (int i = 0; i < S.length() - 2; i++) {
int num;
istringstream ss;
ss = istringstream(S.substr(i, 3));
ss >> num;
int res = num - 753;
int diff = res < 0 ? -res : res;
m = min(diff, m);
}
cout << m << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
string S;
cin >> S;
int LS = S.size();
int k = 2;
int ans = 1000;
while (k<LS) {
int tmp = stoi(S.substr(k-2,3));
int l = abs(tmp-753);
ans = min(ans, l);
k++;
}
cout << ans << endl;
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define drep(i, n) for(int i = n - 1; i >= 0; i--)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define yes cout << "yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define no cout << "no" << endl
#define PI 3.14159265359
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
void P(int x) {cout << x << endl;}
void P(long x) {cout << x << endl;}
void P(double x) {cout << x << endl;}
void P(ll x) {cout << x << endl;}
void P(string x) {cout << x << endl;}
void P(char x) {cout << x << endl;}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
ll n, a, b;
cin >> n >> a >> b;
int now;
cin >> now;
ll ans = 0;
rep (i, n - 1) {
int tmp;
cin >> tmp;
ll diff = tmp - now;
ans += min(b, diff * a);
now = tmp;
}
P(ans);
return 0;
}
| #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ll n,a,b;
cin >> n >> a >> b;
int x[n];
for (int i=0;i<n;i++) cin >> x[i];
ll c=0;
for (int i=0;i<n-1;i++) {
if ((x[i+1]-x[i])*a>b) c+=b;
else c+=a*(x[i+1]-x[i]);
}
cout << c;
} | 1 |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define mem0(x) memset(x,0,sizeof(x))
#define meminf(x) memset(x,0x3f,sizeof(x))
#define VI vector<int>
#define VL vector<ll>
using namespace std;
const int N = 1e5+5;
int a[N];
deque<int> q;
int num;
int main()
{
ios::sync_with_stdio(0);
int n;cin>>n;
rep(i,1,n){
cin>>a[i];
}
q.push_back(a[1]);++num;
rep(i,2,n){
// cout<<"t"<<i-1<<":";
// rep(i,1,num){
// cout<<q[i-1]<<' ';
// }
//cout<<endl;
int idx = upper_bound(q.begin(),q.end(),a[i],greater<int>())-q.begin();
//cout<<"idx:"<<idx<<endl;
if(idx==num){
q.push_back(a[i]);
++num;
}else{
q[idx] = a[i];
}
//sort(q.begin(),q.end(),greater<int>());
}
cout<<num;
}
| #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 100100
lli n;
int main(void){
cin >> n;
vector<lli> v(n);
vector<lli> e(N), o(N);
rep(i, n) cin >> v[i];
rep(i, n){
if(i%2 == 0){
e[v[i]]++;
}else{
o[v[i]]++;
}
}
auto p1 = max_element(e.begin(), e.end())-e.begin();
auto p2 = max_element(o.begin(), o.end())-o.begin();
if(p1 != p2){
cout << n-e[p1]-o[p2] << endl;
}else{
sort(e.rbegin(), e.rend());
sort(o.rbegin(), o.rend());
cout << n-max(e[0]+o[1], e[1]+o[0]) << endl;
}
return 0;
}
| 0 |
/*
Over ice, I'm freezing
Beautiful eyes, deceiving
We may die this evening
Coughing, wheezing, bleeding...
*/
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Os")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll maxn=2e3+10, maxm=2e3+10, lg=18, mod=1e9+7, inf=1e18;
ll n,dp[3*maxn][maxn],M;
void add(ll &x,ll y){
x+=y;
if(x>=M) x-=M;
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>n>>M;
dp[0][0]=1;
for(int i=0;i<3*n;i++)for(int j=0;j<=n;j++){
add(dp[i+1][j],dp[i][j]);
add(dp[i+2][j+1],dp[i][j]*(i+1)%M);
add(dp[i+3][j+1],dp[i][j]*(i+1)%M*(i+2)%M);
}
ll ans=0; for(int i=0;i<=n;i++) ans+=dp[3*n][i];
cout<<ans%M;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int MOD;
void extgcd(int a, int b, int& x, int& y) {
if (b != 0) {
extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
}
int mod_inverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
int add(int& a, const int b) {
a += b;
if (a >= MOD) a -= MOD;
}
vector<int> fact;
vector<int> inv_fact;
vector<int> p2;
vector<int> inv_p2;
vector<int> inv_p6;
int C(int a, int b) {
if (a < b || b < 0) return 0;
return ((fact[a] * inv_fact[a - b]) % MOD) * inv_fact[b] % MOD;
}
int P(int a, int b) {
if (a < b || b < 0) return 0;
return ((fact[a] * inv_fact[a - b]) % MOD);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N >> MOD;
fact.resize(3 * N + 2, 1);
inv_fact.resize(fact.size(), 1);
p2.resize(3 * N + 2, 1);
inv_p2.resize(3 * N + 2, 1);
inv_p6.resize(3 * N + 2, 1);
int inv2 = (MOD + 1) / 2;
int inv6 = mod_inverse(6, MOD);
for (int i = 1; i < fact.size(); i++) {
fact[i] = (fact[i - 1] * i) % MOD;
p2[i] = (p2[i - 1] * 2) % MOD;
inv_fact[i] = mod_inverse(fact[i], MOD);
inv_p2[i] = (inv_p2[i - 1] * inv2) % MOD;
inv_p6[i] = (inv_p6[i - 1] * inv6) % MOD;
}
int res = 0;
for (int n2 = 0; n2 <= 3 * N; n2++) {
for (int n1 = 0; n1 <= 3 * N; n1++) {
if (n2 * 2 + n1 > 3 * N) break;
if (n2 > n1) continue;
int n3 = 3 * N - n2 * 2 - n1;
if (n3 % 3 != 0) continue;
int ans = 1;
n3 /= 3;
ans = (ans * C(3 * N, n1)) % MOD;
ans = (ans * P(3 * N - n1, n2 * 2)) % MOD;
ans = (ans * inv_fact[n2]) % MOD;
ans = (ans * inv_p2[n2]) % MOD;
ans = (ans * fact[n3 * 3]) % MOD;
ans = (ans * inv_fact[n3]) % MOD;
ans = (ans * inv_p6[n3]) % MOD;
ans = (ans * p2[n3]) % MOD;
//cerr << n1 << " " << n2 << " " << n3 << " " << ans << endl;
add(res, ans);
}
}
cout << res << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N == 1) {
cout << "Hello"<< " " <<"World" << endl;
}
else {
int A,B;
cin >> A >> B;
cout << A+B << endl;
}
}
| #define _GLIBCXX_DEBUG
#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<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll n; cin >> n; ll a,b; cin >> a >> b;
if(n==1) cout << "Hello World" << endl;
else cout << a+b << endl;
} | 1 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
using namespace std;
const long long int MOD = 1000000007;
//const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
//int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<long long int>v(N);
for (auto &i : v)cin >> i;
cin >> M >> K;
vector<int>p(N - 1);
for (int i = 0; i < N - 1; i++)p[i] = i;
for (int i = 0; i < M; i++) {
cin >> L;
swap(p[L - 2], p[L - 1]);
}
vector<vector<int>>to(62, vector<int>(N - 1));
for (int i = 0; i < N - 1; i++)to[0][i] = p[i];
for (int i = 1; i < 62; i++) {
for (int j = 0; j < N - 1; j++) {
to[i][j] = to[i - 1][to[i - 1][j]];
}
}
for (int i = 0; i < N - 1; i++) {
long long int box = K;
int cnt = i;
for (int j = 0; j < 62; j++) {
if ((box >> j) & 1) {
cnt = to[j][cnt];
}
}
p[i] = cnt;
}
long long int num = v[0];
cout << num << endl;
for (auto i : p) {
//cout << i << endl;
num += v[i+1]-v[i];
cout << num << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define endl '\n'
using namespace std;
const int N = 1e5 + 5;
int n, m, a[N], label[N], label2[N];
ll k;
ll x[N], d[N], ans[N];
vector <vector <int> > cycles;
bool vis[N];
void DFS(int v)
{
cycles.back().pb(v);
vis[v] = true;
if(vis[label[v]])
return;
DFS(label[v]);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> x[i];
d[i] = x[i] - x[i - 1];
label[i] = i;
}
cin >> m >> k;
for(int i = 1; i <= m; i++)
{
cin >> a[i];
swap(label[a[i]], label[a[i] + 1]);
}
for(int i = 1; i <= n; i++)
{
if(!vis[i])
{
cycles.pb(vector <int> ());
DFS(i);
}
}
for(int i = 0; i < cycles.size(); i++)
{
int sz = k % (int)cycles[i].size();
for(int j = 0; j < cycles[i].size(); j++)
label2[cycles[i][(j + sz) % cycles[i].size()]] = cycles[i][j];
}
for(int i = 1; i <= n; i++)
ans[label2[i]] = d[i];
for(int i = 1; i <= n; i++)
ans[i] = ans[i] + ans[i - 1];
for(int i = 1; i <= n; i++)
cout << fixed << setprecision(9) << ans[i] << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> void write(T a)
{
if(a<0)
{
a=-a;
putchar('-');
}
if(a>9)
{
write(a/10);
}
putchar(a%10+'0');
}
template <typename T> void writeln(T a)
{
write(a);
puts("");
}
}
int n,q[101],tot,tt=1;
double mins=190000;
double avg;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>q[i];
tot+=q[i];
}
avg=tot*1.0/n;
for(int i=1;i<=n;i++)
{
if(abs(q[i]-avg)<mins)
{
mins=abs(q[i]-avg);
tt=i;
}
}
cout<<tt-1;
} | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main() {
int N;
cin >> N;
vector<double> a(N);
REP(i,N) cin >> a[i];
double av = accumulate(ALL(a),double(0))/N;
int ans = 0;
double shortest = INF;
REP(i,N) {
if (chmin(shortest,abs(av-a[i]))) {
ans = i;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,q,l,r,i;
string s;
vector<int> a;
cin>>n>>q>>s;
for(i=0;i<n-1;i++) if(s.at(i)=='A'&&s.at(i+1)=='C') a.push_back(i+1);
for(i=0;i<q;i++){
cin>>l>>r;
cout<<distance(lower_bound(a.begin(),a.end(),l),lower_bound(a.begin(),a.end(),r))<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
void dfs(vector<vector<pair<int,ll>>> &graph,
int now, int past,ll sum, vector<ll> &dist){
dist[now]=sum;
for(auto next:graph[now]){
if(next.first==past)continue;
dfs(graph, next.first, now, sum+next.second, dist);
}
}
int main(){
int n;
cin >> n;
vector<vector<pair<int,ll>>> graph(n);
vector<ll> dist(n);
rep(i, 0, n-1){
int a, b;
ll c;
cin >> a >> b >> c;
a--, b--;
graph[a].push_back({b, c});
graph[b].push_back({a, c});
}
int q, k;
cin >> q >> k;
k--;
dfs(graph, k, -1, 0, dist);
vector<ll>ans(q);
rep(i, 0, q){
int x, y;
cin >> x >> y;
ans[i] = dist[x-1]+dist[y-1];
}
rep(i, 0, q)cout<< ans[i] << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
ll K,X;
cin >> K >> X;
for (int i = X-K+1; i <= X+K-1; i++) {
cout << i;
if(i == K+X-1){
cout << endl;
} else {
cout << " ";
}
}
} | #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>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define res(i,n) for(int i=n;;i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define req(i,n,m) for(int i=n;i<m;i++)
#define REQ(i,n,m,l) for(int i=n;i<m;i+=l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(long long x, long long y) {
if (y == 0)return x;
return gcd(y, x % y);
}
signed lcm(long long x, long long y) {
return x / gcd(x, y) * y;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N, K; cin >> N >> K;
vector<int>l(N);
rep(i, N)cin >> l[i];
sort(l.begin(), l.end());
reverse(l.begin(),l.end());
int ans = 0;
rep(i, K)ans += l[i];
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
#define EB emplace_back
#define int long long
#define F first
#define S second
#define N 500005
#define all(x) x.begin(),x.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
#define rt return
void test_case(){
string s; cin >> s;
int cnt = 0, ans = 0;
for(int i = 0; i < 3; i++){
if(s[i] == 'R') cnt++;
else{
ans = max(ans, cnt);
cnt = 0;
}
}
ans = max(ans, cnt);
cout << ans;
}
int32_t main(){
IOS;
int tt = 1;
//cin >> tt;
while(tt--){
test_case();
cout << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> num(55556);
for(int i = 0; i < 55556; i++) num[i] = i;
num[0] = -1;
num[1] = -1;
for(int i = 2; i < 55556; i++){
if(num[i] == -1) continue;
int t = 2;
while(i * t <= 55555){
num[i * t] = -1;
t++;
}
}
vector<int> sosuu;
for(int i = 0; i < 55556; i++){
if(num[i] != -1) sosuu.push_back(num[i]);
}
vector<int> cnt(5, 0);
for(int i = 0; i < sosuu.size(); i++){
cnt[sosuu[i] % 5]++;
}
int t = 0;
for(int i = 0; i < sosuu.size(); i++){
if(t == N) break;
if(sosuu[i] % 5 == 1) {
cout << sosuu[i] << ' ';
t++;
}
}
cout << endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
if( N % K == 0 ) cout << 0 << endl;
else cout << 1 << endl;
} | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(x) ll t; cin >> t; x.push_back(t);
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout << "no" << endl;
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typedef vector<string> vvs;
const static ll MOD = 1e9 + 7;
int main() {
ll x, y;
cin >> x >> y;
ll ans = 0;
if (x == 3) {
ans += 100000;
} else if (x == 2) {
ans += 200000;
} else if (x == 1) {
ans += 300000;
}
if (y == 3) {
ans += 100000;
} else if (y == 2) {
ans += 200000;
} else if (y == 1) {
ans += 300000;
}
if (x == 1 && y == 1) {
ans += 400000;
}
MSG(ans)
}
| 0 |
#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
void dice1();
void dice2();
void dice3();
void dice4();
class DICE{
int face[6],a;
public:
bool operator==(const DICE&di)const{
int cont=0;
for(int i=0;i<6;++i){
if(face[i]==di.face[i]){
cont++;
}
}
if(cont==6){
return true;
}
else{
return false;
}
}
bool operator!=(const DICE&di)const{
return !(*this==di);
}
void set(int&f,int&f1,int&f2,int&f3,int&f4,int&f5){
face[0]=f;face[1]=f1;face[2]=f2;face[3]=f3;face[4]=f4;face[5]=f5;
}
void N(){
a=face[0];
face[0]=face[1];
face[1]=face[5];
face[5]=face[4];
face[4]=a;
}
void E(){
a=face[0];
face[0]=face[3];
face[3]=face[5];
face[5]=face[2];
face[2]=a;
}
void S(){
a=face[0];
face[0]=face[4];
face[4]=face[5];
face[5]=face[1];
face[1]=a;
}
void W(){
a=face[0];
face[0]=face[2];
face[2]=face[5];
face[5]=face[3];
face[3]=a;
}
void output(){
cout<<face[0]<<endl;
}
int up(){
return face[0];
}
void turn(){
a=face[1];
face[1]=face[3];
face[3]=face[4];
face[4]=face[2];
face[2]=a;
}
int front(){
return face[1];
}
int right(){
return face[2];
}
void allout(){
for(int i=0;i<6;++i){
cout<<face[i]<<" ";
}
cout<<endl;
}
void toupper(int n){
if(n<=3){
a=face[0];
face[0]=face[1];
face[1]=face[5];
face[5]=face[4];
face[4]=a;
}
else if(n==4){
a=face[0];
face[0]=face[3];
face[3]=face[5];
face[5]=face[2];
face[2]=a;
}
else if(n==5){
a=face[0];
face[0]=face[3];
face[3]=face[5];
face[5]=face[2];
face[2]=a;
a=face[0];
face[0]=face[3];
face[3]=face[5];
face[5]=face[2];
face[2]=a;
}
}
};
bool judge(DICE,DICE);
int main(){
dice4();
return 0;
}
void dice1(){
DICE a;
int d[6];string str;
for(int i=0;i<6;++i){
cin>>d[i];
}
a.set(d[0],d[1],d[2],d[3],d[4],d[5]);
getline(cin,str);
getline(cin,str);
for(int i=0;i<str.size();++i){
if(str[i]=='E'){
a.E();
}
else if(str[i]=='S'){
a.S();
}
else if(str[i]=='W'){
a.W();
}
else if(str[i]=='N'){
a.N();
}
}
a.output();
return;
}
void dice2(){
DICE a;
int d[6],p,u;
for(int i=0;i<6;++i){
cin>>d[i];
}a.set(d[0],d[1],d[2],d[3],d[4],d[5]);
int n;
cin>>n;
for(int i=0;i<n;++i){
cin>>p>>u;
int k=0;
while(1){
k++;
if(k<=5){
a.E();
}
else{
a.N();
}
if(p==a.up()){
break;
}
}
k=0;
while(1){
k++;
a.turn();
if(u==a.front()){
break;
}
}
cout<<a.right()<<endl;
}
return;
}
void dice3(){
DICE a,b;
int d[6][2];
for(int i=0;i<2;++i){
for(int j=0;j<6;++j){
cin>>d[j][i];
}
}
a.set(d[0][0],d[1][0],d[2][0],d[3][0],d[4][0],d[5][0]);
b.set(d[0][1],d[1][1],d[2][1],d[3][1],d[4][1],d[5][1]);
if(judge(a,b)){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
bool judge(DICE a,DICE b){
bool bo1=false,bo2=false;
for(int i=0;i<6;++i){
b.toupper(i);
for(int j=0;j<4;++j){
if(a==b){
return true;
}
b.turn();
}
}
return false;
}
void dice4(){
int n,d[6][101];
DICE a[101];
cin>>n;
for(int i=0;i<n;++i){
for(int j=0;j<6;++j){
cin>>d[j][i];
}
}
for(int i=0;i<n;++i){
a[i].set(d[0][i],d[1][i],d[2][i],d[3][i],d[4][i],d[5][i]);
}
for(int i=0;i<n-1;++i){
for(int j=i+1;j<n;++j){
if(judge(a[i],a[j])){
cout<<"No"<<endl;
return ;
}
else {
}
}
}
cout<<"Yes"<<endl;
return ;
} | #include<iostream>
#include<string>
using namespace std;
class Dice{
public:
int face[6];
Dice(){}
void roll_x(){ roll(0,3,5,2);}
void roll_y(){ roll(0,1,5,4);}
void roll_z(){ roll(1,2,4,3);}
void roll(int i, int j, int k, int l){
int t = face[i]; face[i] = face[j]; face[j] = face[k]; face[k] = face[l]; face[l] = t;
}
};
bool check(Dice d1,Dice d2){
for (int i = 0; i < 6; i++){
if (d1.face[i] != d2.face[i]) return false;
}
return true;
}
bool equal(Dice d1, Dice d2){
for(int j = 0; j < 6; j++){
for(int k = 0; k < 4; k++){
if(check(d1, d2)) return true;
d1.roll_z();
}
if(check(d1,d2)) return true;
if (j == 2) d1.roll_y();
else d1.roll_x();
}
return false;
}
bool equal_all(Dice d[],int n){
for(int i = 0; i < n-1; i++){
for(int j = i+1; j < n; j++){
if(equal(d[i],d[j])) return true;
}
}
return false;
}
int main(){
int n;
cin >> n;
// ???????????????????????????
Dice d[100];
for(int i = 0; i < n; i++){
for(int j = 0; j < 6; j++){
cin >> d[i].face[j];
}
}
//??????
if(equal_all(d,n)) cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define range(i,a,n) for(int i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}
void solve(int n){
vector<pair<double,string>> v(n);
double p,a,b,c,d,e,f,s,m;
string l;
rep(i,n){
cin>>l;
v[i].sc=l;
cin>>p>>a>>b>>c>>d>>e>>f>>s>>m;
v[i].fs=(m*s*f-p)/(a+b+c+(d+e)*m);
}
sort(all(v),[](auto a,auto b){
if(a.fs!=b.fs)return a.fs>b.fs;
else return a.sc<b.sc;
});
rep(i,n)cout<<v[i].sc<<endl;
cout<<"#\n";
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin>>n,n)solve(n);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while ( cin >> N ) {
if ( N == 0 ) {
break;
}
typedef pair<double, string> P;
vector<P> ans;
while ( N-- ) {
string l;
int p;
cin >> l >> p;
int t = 0;
int d = 0;
for ( int i = 0; i < 5; i++ ) {
int a;
cin >> a;
if ( i <= 2 ) t += a;
else d += a;
}
int f, s, m;
int sum = 0;
cin >> f >> s >> m;
t += d*m;
sum = f*s*m;
ans.push_back(P(-((double)(sum-p)/(double)t), l));
}
sort(ans.begin(), ans.end());
for ( int i = 0; i < ans.size(); i++ ) {
cout << ans[i].second << endl;
}
cout << '#' << endl;
}
return 0;
}
| 1 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(a) ({REP(__i,1,n) cout<<a[__i]<<' ';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}
//head
const int N = 1e6+50;
int n,m,a[N],b[N];
int sum[N];
ll solve(int *a, int n) {
REP(i,1,n) sum[i]=(sum[i-1]+a[i])%P;
ll ans = 0;
REP(i,1,n) ans=(ans+(ll)(n-i)*a[i]-(sum[n]-sum[i]))%P;
if (ans<0) ans += P;
return ans;
}
int main() {
scanf("%d%d",&n,&m);
REP(i,1,n) scanf("%d",a+i);
REP(i,1,m) scanf("%d",b+i);
printf("%lld\n",solve(a,n)*solve(b,m)%P);
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N,K;cin>>N>>K;
vector<int> p(N);
for (int i = 0; i < N; i++){
cin>>p[i];
}
int ans=0;
for (int i = 0; i < K; i++){
ans+=p[i]+1;
}
int sum=ans;
for (int i = 0; i < N-K; i++){
sum=sum-p[i]+p[i+K];
ans=max(ans,sum);
}
cout<<ans/2;
if(ans%2!=0)cout<<".5"<<endl;
} | 0 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
typedef long long ll;
const int N = 401;
const vector<int> dx = {0, 0, 1, -1};
const vector<int> dy = {1, -1, 0, 0};
int used[N * N];
vector<int> g[N * N];
int n, m;
int a[N][N];
int get(int i, int j) {
return i * m + j;
}
int ok(int i, int j) {
return 0 <= i & i < n && 0 <= j && j < m;
}
void dfs(int cur, int &c0, int &c1) {
used[cur] = 1;
if (a[cur / m][cur % m] == 0) {
c0++;
} else {
c1++;
}
for (auto t : g[cur]) {
if (!used[t]) {
dfs(t, c0, c1);
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char c;
cin >> c;
a[i][j] = (c == '#');
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
for (int f = 0; f < 4; f++) {
int i1 = i + dx[f];
int j1 = j + dy[f];
if (ok(i1, j1) && a[i][j] != a[i1][j1]) {
g[get(i, j)].push_back(get(i1, j1));
}
}
}
}
ll ans = 0;
for (int i = 0; i < n * m; i++) {
if (!used[i]) {
int c0 = 0;
int c1 = 0;
dfs(i, c0, c1);
ans += c0 * c1;
}
}
cout << ans << '\n';
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
#define fo(i,s,e_ex) for(i=s;i<e_ex;i++)
#define Fo(i,k,n) for(i=k;k<n?i<=n:i>=n;k<n?i+=1:i-=1)
#define endl '\n'
#define MOD 1000000007//998244353
#define pbb push_back
#define mpp make_pair
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define mset(arr,val) memset(arr,val,sizeof(arr))
ll a[20][20],n;
ll dp[66000],gc[66000];
vi sm[66000];
bool dpp[66000];
void findsm(ll pos,ll bitmask,ll submask){
if(pos==n){
if(setbits(submask)==0) return;
sm[bitmask].pbb(submask);
return;
}
findsm(pos+1,bitmask,submask);
findsm(pos+1,bitmask|(1<<pos),submask);
findsm(pos+1,bitmask|(1<<pos),submask|(1<<pos));
}
void findgc(){
for(ll b=1;b<pow(2,n);b++){
//b is the bitmask
gc[b]=0;
for(ll i=0;i<n;i++){
if( ((1<<i) & b)==0 ) continue;
for(ll j=i+1;j<n;j++){
if( ((1<<j) & b)==0 ) continue;
gc[b]+=a[i][j];
}
}
}
}
ll findans(ll bitmask){
if(bitmask==0) return 0;
if(dpp[bitmask]) return dp[bitmask];
ll ans=LLONG_MIN;
for(auto submask:sm[bitmask]){
ans = max(ans,findans(bitmask^submask)+gc[submask]);
}
dpp[bitmask]=true;
return dp[bitmask]=ans;
}
void solve(ll caseno){
ll i,j,ans;
cin>>n;
fo(i,0,n){
fo(j,0,n){
cin>>a[i][j];
}
}
findsm(0,0,0);
findgc();
mset(dpp,0);
ans = findans(pow(2,n)-1);
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll t=1;
//cin>>t;
for(ll i=1;i<=t;i++){
solve(i);
}
return 0;
}
| 0 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
char str[64];
int i;
cin >> str;
for(i=1;i<=strlen(str);i++){
cout << str[strlen(str)-i];
}
cout << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n,x;
cin >> n;
for(int i = 1; i <= n; i++){
if(i % 3 == 0){
cout << " " << i;
}else{
if(i % 10 == 3){
cout << " " << i;
}else{
x = i;
while(x /= 10){
if(x % 10 == 3){
cout << " " << i;
break;
}
}
}
}
}
cout << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n;
cin >> n;
int sum = 0;
int tmp = n;
while(tmp > 0)
{
sum += tmp % 10;
tmp /= 10;
}
cout << (n % sum == 0 ? "Yes" : "No");
}
int main()
{
fastio;
solve();
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <regex>
#include <locale>
#include <iomanip>
using namespace std;
using ll = long long;
#define OVERLOAD3(_1,_2,_3,name,...) name
#define REP(i,n) REPI(i,0,n)
#define REPI(i,a,b) for(int i=int(a),i##_Len=int(b);i<i##_Len;++i)
#define rep(...) OVERLOAD3(__VA_ARGS__,REPI,REP,)(__VA_ARGS__)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
int main () {
string s; cin >> s;
s.replace(s.begin(), s.begin() + 4, "2018");
cout << s << endl;
} | 0 |
//https://atcoder.jp/contests/abc162/tasks/abc162_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
ll sum1=0;
sum1=(n*(n+1))/2;
ll n3;
n3=(n)/3;
ll n5;
n5=(n)/5;
ll n15;
n15=(n)/15;
ll a3;
a3=3+(n3-1)*3;
ll a5;
a5=5+(n5-1)*5;
ll a15;
a15=15+(n15-1)*15;
ll sum3=0;
sum3=((n3)*(3+a3))/2;
ll sum5=0;
sum5=((n5)*(5+a5))/2;
ll sum15=0;
sum15=((n15)*(15+a15))/2;
ll sumfin=0;
sumfin=sum3+sum5-sum15;
ll ans=0;
ans=sum1-sumfin;
cout<<ans<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N;
cin >> N;
long long fb_sum = 0;
for (int elem = 1; elem <= N; elem++){
if (elem % 3 != 0 & elem % 5 != 0) fb_sum += elem;
}
cout << fb_sum << endl;
} | 1 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF = 10010001010;
const int inf = 1000034000;
typedef vector<ll> vecl;
typedef vector<int> veci;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
int N;
cin >> N;
ll ans = 0;
vector<int> A(N);
vector<int> B(N);
vector<int> C(N);
for (int i = 0; i < N;i++)
{
cin >> A[i];
}
for (int i = 0; i < N; i++)
{
cin >> B[i];
}
for (int i = 0; i < N; i++)
{
cin >> C[i];
}
sort(all(A));
sort(all(B));
sort(all(C));
for (int i = 0; i < N;i++)
{
auto itA = lower_bound(A.begin(),A.end(),B[i]);
auto itC = upper_bound(C.begin(), C.end(),B[i]);
ll a = itA - A.begin();
ll b = C.end() - itC;
//cout << a <<" " << b << endl;
ans += a * b;
}
cout << ans << endl;
}
| #include <iostream>
#include <vector>
#include <cassert>
#include <map>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 200000;
int v[1 + nmax];
bool valid(int n) {
if(0 < v[1])
return 0;
for(int i = 2; i <= n; i++)
if(v[i - 1] + 1 < v[i])
return 0;
return 1;
}
int frec[1 + nmax];
int main() {
int n;
std::cin >> n;
for(int i = 1;i <= n; i++)
std::cin >> v[i];
if(valid(n) == 0)
std::cout << -1;
else {
ll result = 0;
for(int i = n; 1 <= i; i--) {
if(frec[i - v[i]] == 0) {
result += v[i];
frec[i - v[i]] = 1;
}
}
std::cout << result;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &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; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N,K;
cin >>N>>K;
if(N%K==0){
cout<<0<<endl;
}else{
cout<<1<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,N,r,s=0;
cin>>n;
N=n;
while(n>0){
r=n%10;
s+=r;
n/=10;
}
if(N%s==0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
int div = n / max(h, w);
int rem = n % max(h, w);
if (rem) cout << div + 1 << '\n';
else cout << div << '\n';
return 0;
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
int sx, sy;
int tx, ty;
cin >> sx >> sy >> tx >> ty;
string res;
int x = tx - sx;
int y = ty - sy;
res += string(y, 'U');
res += string(x, 'R');
res += string(y, 'D');
res += string(x, 'L');
res += 'L';
res += string(y + 1, 'U');
res += string(x + 1, 'R');
res += 'D';
res += 'R';
res += string(y + 1, 'D');
res += string(x + 1, 'L');
res += 'U';
// cout << res.length() << endl;
cout << res << '\n';
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int sum = 0;
int a, b, m = 101;
for (int i = 0; i < 4; i++){
cin >> a;
m = min(a, m);
sum += a;
}
sum -= m;
cin >> a >> b;
sum += max(a, b);
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
double now, next;
cin >> now >> next;
cout << next*2 - now << endl;
} | 0 |
#include <iostream>
using namespace std ;
int main()
{
int get ;
cin >> get ;
cout << (get*get*get) << endl ;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int FB, F, B;
FB = N / 15;
F = N / 3;
B = N / 5;
long long ans = 0;
for(int i = 1; i <= N; i++) {
ans += i;
}
for(int i =1 ; i <= F; i++) {
ans -= i*3;
}
for(int i =1 ; i <= B; i++) {
ans -= i*5;
}
for(int i =1 ; i <= FB; i++) {
ans += i*15;
}
cout << ans << endl;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.