code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
vector<int> G[200005];
int aoki_d[200005], takahashi_d[200005];
bool is_end[200005];
void dfs(int u, bool is_aoki, int p=-1) {
for (int v : G[u]... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 998244353
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 1ll<<59
vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pi;
#define fi first
#define se second
int read() {
int res = 0, w = 1; char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-') c = getchar(), w = -1;
while (isdigit(c... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstrea... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF=INT_MAX;
struct lst
{
private:
int n;
vector<int> node;
vector<int> lazy;
vector<bool> lflg;
public:
lst(int sz)
{
n=1; while(n<sz) n*=2;
node.resize(2*n-1, INF);
la... | #include<iostream>
#include<algorithm>
#include<map>
using namespace std;
#define SEG_NUM (1<<20)
pair<long, long> seg[SEG_NUM*2];
long find(int i){
i += SEG_NUM;
long ans = 2147483647;
int time = 0;
while(i > 0){
if(time < seg[i].first) {
ans = seg[i].second;
time = s... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,counter,subcounter;
string strn,strm;
cin >> n;
subcounter = 0;
vector<string> vecn(0);
vector<string> vecm(0);
for (int i = 0; i < n; i++) {
cin >> strn;
vecn.push_back(strn);
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> strm;
... | #include<iostream>
#include<cstring>
using namespace std;
int main(){
int dice[6],i,dif[6],len;
string str;
/********サイコロの目の入力*********/
for(i = 0 ; i < 6 ; i++)
{
cin >> dice[i];
}
cin >> str;
len = str.size();
for ( int j = 0 ; j < len ; j++){
if(str[j] == 'S')
{
dif[0] = dice[... | 0 |
#include <iostream>
using namespace std;
int main(void){
// Your code here!]
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = a + b;
int ans1 = c + d;
if(ans > ans1){
cout << "Left" << endl;
}
else if(ans == ans1){
cout << "Balanced" << endl;
}
else {
co... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int a[5];
for(int i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
if(a[0] == a[2]) return cout << "No", 0;
for(int i = 1; i ... | 0 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#... | #include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n, k; cin >> n >> k;
vector<int> v(n);
int og = 0;
for(i... | 1 |
#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x... | #include <cstdint>
#include <algorithm>
#include <vector>
#include <string>
int main() {
char buf[131072];
scanf("%s", buf);
std::string s = buf;
for (size_t i = 1; i < s.length(); ++i)
if (s[i-1] == s[i])
return !printf("%zu %zu\n", i, i+1);
for (size_t i = 1; i+1 < s.length(); ++i)
if (s[i-... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
int sum=0;
for(int i=v.size()-1;i>=n-k;i--)
{
sum+=v[i];
}
cout<<sum;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin>>N>>S;
vector<int> a(N),b(N);
int j=0;
for(int i=0;i<N;i++){
int k=0;
if(S.at(i)=='E')
k=1;
j+=k;
a.at(i)=j;
b.at(i)=i+1-j;
}
j=a.at(N-1)-a.at(0);
for(int i=1;i<N;i++){
int k=b.at(i-1)+a.at(N-... | 0 |
#include<iostream>
#include<vector>
using namespace std;
typedef unsigned long long int ull;
vector<ull> allPrimes;
void sieve(int n)
{
vector<bool> prime(n+1, true);
for (int p=2; p*p<=n; p++) {
if (prime[p] == true) {
for (int i=p*2; i<=n; i += p)
prime[i] = fal... | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i <= N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
map<ll, ll> M;
void prime_factor(ll N){
bool C = 1;
while(C){
C = 0;
rep(i, 2, sqrt(N)){
if(N%i ... | 1 |
#include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main(){
int n, a, b;
cin >> n;
if(n == 1)
cout << "Hello World";
if(n == 2){
cin >> a >> b;
cout << a + b;
}
}
| 1 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | #include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
int len;
len=s.size();
if(len<=k){
cout << s << endl;
return 0;
}else{
for(int i=0;i<k;i++){
cout << s.at(i);
}
}
cout << "..." << endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) <... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N,u,v;
cin >> N >> u >> v;
vector<vector<int>> A(N);
for(int i=0;i<N-1;i++){
int a,b;cin>>a>>b;
A[a-1].push_back(b-1);
A[b-... | 1 |
#include<stdio.h>
using namespace std;
const int sss=1<<21;
int n;
int a[1000][1000];
int d[1000],p[10000],color[1000];
int prim(){
int u,minv;
for(int i=0;i<n;i++){
d[i]=sss;
p[i]=-1;
}
d[0]=0;
while(1){
minv=sss;
u=-1;
for(int i=0;i<n;i++){
if(minv>d[i]&&color[i]!=1){
u=i;
minv=d[i];
}
... | #include<iostream>
#include<iomanip>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cassert>
#include<ctime>
#include<algorithm>
#include<utility>
#include<map>
#include<set>
#include<vector>
#include<functional>
using namespace std;
#ifd... | 1 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define si short int
using namespace std;
const int N=101;
si n,m,x,y,ans,dp[N][N][N][N],sum[N][N];
char g[N][N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
... | #include <algorithm>
#include <cstdio>
char str[105];
int row_pre[105][105], col_pre[105][105], dp[105][105][105][105];
int main()
{
// freopen("AGC004-E.in", "r", stdin);
int n, m, x, y;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", str);
for (int j = 0; j < m; j++)
{
row_pre[i][j] = (... | 1 |
#include <iostream>
using namespace std;
int main()
{
int m[50],d[50];
int x = 0;
string Day[7] = {"Thursday", "Friday","Saturday","Sunday","Monday", "Tuesday", "Wednesday"};
int BanyakHari[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
string ThatDayIs[50];
do
{
int DayinBetween =... | #include <iostream>
#include <string>
using namespace std;
int main(){
string y[7]={"Wednesday","Thursday","Friday","Saturday","Sunday","Monday","Tuesday"};
int num[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
while(1){
int m,d;
cin >> m >> d;
if( m == 0 && d == 0 ) break;
while( m != 0 ){
... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
int main() {
int n;
std::cin >> n;
while (n != 0) {
std::vector<int> vec(n+1, 0);
int x;
for (int i = 1; i <= n; ++i) {
std::cin >> x;
vec[i] = x;
}
std::vector<int> sum;
sum.... | #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair < db, db > pdd;
typedef pair < db, ld > pdl;
typedef pair < ld, db > pld;
typedef pair < ld, ld > ldp;
typedef pair ... | 0 |
#include <cstdio>
#include <iostream>
using namespace std;
struct Candidate{
int num;
};
int main(void) {
for (;;) {
int n, p;
cin >> n >> p;
if (n == 0 && p == 0)
break;
Candidate candidate[50];
for (int i = 0; i < 50; i++) {
candidate[i].num = 0;
}
int winner;
int t = p;
for (int i = 0;... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> a;
vector <int> all;
int n,m;
int main() {
while(1) {
scanf("%d%d",&n,&m);
if(n == 0 && m ==0) break;
a.resize(n);
for(int i=0;i<n;i++) scanf("%d",&a[i]);
a.push_back(0);
all.clea... | 0 |
#include <iostream>
#include <map>
using namespace std;
int main(){
int n;
cin >> n;
map<int, int> memo;
for(int i = 0; i < n; i++){
int a;
cin >> a;
if(memo.count(a)) memo.erase(a);
else memo[a] = 1;
}
cout << memo.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
main(){
int n;cin >> n;
int a[n];for(int i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
int ans=0;
for(int i=0;i<n;){
int cc = a[i];
int cnt = 0;
int j=i;
while(a[j] == cc){
cnt++;
i++;
j++;
}
ans+=c... | 1 |
#include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N, M, Q;
cin >> N >> M >> Q;
vector<map<int, int>> start_length(N, map<int, int>());
for (int i = 0; i < M; ++i) {
int l, r;
cin >> l >> r;
--l;
--r;
if (start_length[l].count(r - l) == 0) {
... | 1 |
#include <iostream>
using namespace std;
int main() {
while(1) {
int n;
cin >> n;
if(n == 0) break;
int pm[n], pe[n], pj[n];
double average[n];
double ave_me[n];
for(int i = 0; i < n; i++) {
cin >> pm[i] >> pe[i] >> pj[i];
average[i] = (pm[i]+pe[i]+pj[i])/3.0;
ave_me[i] ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
while( true ) {
long long int a, b, c;
cin >> a >> b >> c;
if ( a == 0 ) break;
vector< long long int > ans;
for ( long long int i = 0; i < a + b + c; i++ ) {
ans.push_back( 2 );
}
long long int n;
cin >... | 0 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
int N, X, T;
cin >> N >> X >> T;
cout << (N+X-1)/X*T;
} | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
const int MAX = 510000;
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
... | 0 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
template<class T> inli... | #include<cstdio>
#include<queue>
#include<iostream>
#define ll long long
using namespace std;
ll res[4][2]={-1,0,0,1,0,-1,1,0};
char map1[60][60];
ll step[60][60];
ll n,m;
ll bfs()
{
map1[0][0]='#';
step[0][0]=0;
queue<ll>qu;
qu.push(0);
qu.push(0);
while(!qu.empty())
{
ll x=qu.front();qu.pop();
ll y=qu.fron... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#... | 1 |
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#inclu... | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin(... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
using namespace std;
typedef long long ll;
#define INF 99999999
int n, k;
int dis[100][100];
int t, a, b, c, d, e;
signed main()
{
while (true) {
cin >> n >> k;
if (n == 0 && k == 0) break;
rep(i,n) rep(j,n) if (i == j) {
... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();... | 0 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
if(y%2==0)
return (p*p)%z;
else
return (x*((p*p)%z))%z... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int r;
int x;
cin >> n;
cin >> r;
x = 100*(10-n)+r;
if (n >= 10) {
cout << r;
} else {
cout << x;
}
return 0;
}
| 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T &b) {
if(a >= b) return false;
a = b;
r... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool upd[(1<<18)];
int val[(1<<18)];
void Set(int a,int b,int x,int k=0,int l=0,int r=(1<<17)){
if(b<=l || r<=a)return;
if( r-l>1 && upd[k] ){
upd[k*2+1] = upd[k*2+2] = 1;
val[k*2+1] = val[k*2+2] = val[k];
}
upd[k]=0;
if(a<=l && r<=b){
upd[k]=1;
val[k]=x... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define INIVAL 2147483647
int *a, *ts, c, s, t, v;
void update(int k, int l, int r)
{
if (r<s || t<=l) return;
if (s<=l && r<=t) {
a[k] = v;
ts[k] = c;
} else if (l<r-1) {
update(((k+1)<<1)-1, l, (l+r)>>1);
update((k+1)<<1, (l+r)>>1, r);
... | 1 |
#include <iostream>
using namespace std;
int x[100010], nx[100010][20];
int main() {
int N, L, Q;
cin >> N;
for(int i=1; i<=N; ++i) cin >> x[i];
cin >> L;
int now=1;
for(int i=1; i<=N; ++i){
while(now<N){
if(x[now+1]-x[i]<=L){
++now;
}
else break;
}
nx[i][0]=now;
}
nx[N][0]=nx[N+1][0]=N+1;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
int cnt = 0;
for(int i = a; i <= b; i++){
int l = i;
vector<int> vec(5);
rep(j, 5){
vec[j] = l % 10;
l /= 10;
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
int n, r;
cin >> n >> r;
if(n<10){
cout << r - 100*n + 1000 << endl;
}else{
cout << r << endl;
}
}
| 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int m; cin>>m;
vector<ll> d(m),c(m);
for (int i=0;i<m;i++) cin>>d[i]>>c[i];
ll res=0, digit=0;
for (int i=0;i<m;i++) {
res+=c[i];
digit+=d[i]*c[i];
}
res=res-1+(digit-1)/9;
cout<<res<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,f,ans=0,k,g;
cin>>a>>b>>c>>d>>e>>f;
k=min(min(a,b),min(c,d));
g=min(e,f);
ans=a+b+c+d+e+f-k-g;
cout<<ans<<endl;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, L;
cin >> N >> L;
vector<int> A;
for (int i = 1; i <= N... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | 0 |
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include <iostream>
using namespace std;
int main() {
int a,b,c,n,buhin[300],kensa[1000][4];
while(1){
for(int i = 0;i < 300;i++) buhin[i] = 2;
cin >> a >> b >> c >> n;
if(a == 0 && b == 0 && c == 0) break;
for(int i = 0;i < n;i++){
cin >> kensa[i][0] >> kensa[i][1] >> kensa[i][2] >> kensa[i][3];
if(kensa[i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | // organize and stay in moment - Abhinav IIITA
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define ff first
#define ss second
#define ld long double
#define f(i,x,n) for(int i=x;i<n;++i)
int dx[]={-1,1,0,0};
int dy[]={0,0,1,-1};
int m=1e9+7;
vector<int> pr;
int prime[... | 1 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a;
cin >> a;
cout << a / 3;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int counter = 0;
cin >> N;
for(int i = 0;i < N/3 + 1;i++){
if((N - 3*(i + 1) >= 0)){
counter ++;}
else cout << counter << endl;}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y; cin >> x >> y;
int ans = 0;
if(x>0){
if(y>0){
if(x>y){
ans++; // x -> -x
ans += abs(x-y); // x -> -y
ans++; // x-> y
}else if(x < y){
ans+= y-x; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double current, goal;
cin >> current >> goal;
cout << 2 * goal - current << endl; // Solve for x: (current + x) / 2 = goal
} | 0 |
///*Bismillahir Rahmanir Rahim***///
/***Stay_Home_Stay_Safe***/
///**Author Thasin Sheikh**///
#include<bits/stdc++.h>
using namespace std;
#define MAX 35000
#define MOD 1000000007
#define PI 3.14159265359
#define makefast__ ios_base::sync_with_stdio(false);
using ll=long long int ;
using dl =double;
const int N = 2... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
const long long MOD = 1000000007;
long long ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;cin>>s;
int n=s.size();
if(n%2!=0)cout<<"No";
else
{int f=0;
for(int i=0;i<n;i+=2)
{
if(s[i]=='h' && s[i+1]=='i')continue;
else{f++;break;}
}
if(f==0)cout<<"Yes";
else cout<<"No";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int cur = 0;
while (cur < S.size()) {
if (cur + 1 < S.size() && S[cur] == 'h' && S[cur + 1] == 'i') {
cur += 2;
} else {
break;
}
}
if (cur < S.si... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int count = 0;
const int INF = 2000000000;
for(int i = 0; i < N; i++) {
cin >> A[i];
}
// 最長減少(等しい場合も含む)部分列の数列の長さがi+1のときの最終要素の最大値dp[i]?
vector<int> dp;
// 初期条件
dp.push_... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,M;
int a[1002]={0},vt[1002]={0};
cin>>N>>M;
for(int i=1;i<=N;i++)cin>>a[i];
for(int i=0;i<M;i++){
int b;
cin>>b;
for(int j=1;j<=N;j++){
if(a[j]<=b){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long,long long>
#define ii pair<int,int>
#define mod 1000000007
#define endl '\n'
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
ll power(ll a,ll b){
ll ans=1;
while(b>0){
if(b%2!=0){
ans=(ans*a... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int dp1[3004][3004];
int dp2[3004][3004];
int main(){
i... | 1 |
#include <iostream>
#include <vector>
#include <list>
#include <set>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using pii=pair<int,int>;
using vs=vector<string>;
using vpii=vector<pii>;
using si=set<int>;
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)
... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Dice{
public:
long top, front, right, left, back, bottom;
Dice(long top, long front, long right, long left, long back, long bottom);
void north();
void south();
void west();
void east();
void rightTurn();
void ChangeTop(long ... | #include <bits/stdc++.h>
using namespace std;
void dice_roll( int *dice, char i){
if( i == 'W'){
int tmp = dice[0];
dice[0] = dice[1];
dice[1] = dice[5];
dice[5] = dice[4];
dice[4] = tmp;
}
if( i == 'S'){
int tmp = dice[0];
dice[0] = dice[4];
dice[4] = dice[5];
dice[5] = dice[1];
dice[1] = tmp;
... | 1 |
#include <algorithm>
#include <iostream>
#include <numeric>
using namespace std;
int main() {
int n, m, cost;
int p[1000];
while (true) {
cin >> n >> m;
if (n == 0) {
return 0;
}
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
sort(p, p + n);
cost = accumulate(p, p + n, 0);
... | #include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <boost/tokenizer.hpp>
#include <boost/lexical_cast.hpp>
#include <vector>
#include <list>
using namespace std;
using namespace boost;
int main(int argc, char* argv[])
{
using sprtr = char_separator<char>;
using tknzr = tokenizer... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i ... | #include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FILL0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
int n,t;
ll a[105],dp[105][105];
ll solve(int i,int j) {
if (i==j) return 0;
if (dp[i][j]) return dp[i][j];
dp[i][j]=INF;
for (int k=i+1;k<=j;k++)
dp[i][j]=min(dp[i][j],solve(i,k-1)+solve(k,j)+a[i]*a[k]*a[j+1]);
retur... | #include <bits/stdc++.h>
#define pb push_back
#define vii vector<int>
#define task "KMULT"
#define pll pair<ll, ll>
#define pii pair< ll, pair< ll, ll > >
#define fi first
#define se second
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll mod = 998244353;
using namespace std;
cons... | 0 |
#include <stdio.h>
int main(){
int x;
int y;
scanf("%d", &x);
y = x*x*x;
printf("%d\n", y);
} | #include <stdio.h>
#include <string.h>
int main() {
int angka1=0,angka2=0;
scanf("%d %d",&angka1,&angka2);
int hitung = 0;
hitung = angka1*angka2;
printf("%d\n",hitung);
return 0;
}
| 0 |
#include<cstdio>
int main(){
char str[20];
char c;
int i = -1;
scanf("%c", &c);
while(c - 10){
i++;
str[i] = c;
scanf("%c", &c);
}
for(; i >= 0; i--){
printf("%c", str[i]);
}
printf("\n");
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a, b, c,i,j;
cin >> a >> b >> c;
i = a;
a = b;
b = i;
j = a;
a = c;
c = j;
cout << a << " " << b << " " << c;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
map<int, int> mp;
int total_acs = 0;
rep(i,0,N-1) {
char c;
cin >> c;
if (S.back() == 'A' && c == 'C') {
total_acs++;
}
mp[i] = total_acs;
... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
using... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int AB[2], CD[2], value;
for(int i = 0; i < 2; i++)
cin >> AB[i];
for(int i = 0; i < 2; i++)
cin >> CD[i];
sort(begin(AB), end(AB));
sort(begin(CD), end(CD));
value = AB[0] + CD[0];
cout << value << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main()
{
int A , B , C , D;
cin >> A >> B >> C >> D;
if ((A >= B) && (C >= D)) {cout << B + D;}
else if ((A <= B) && (C >= D)) {cout << A + D;}
else if ((A >= B) && (C <= D)) {cout << B + C;}
else if ((A <= B) && (C <= D)) {cout << A + C;}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 1 |
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>... | #include<bits/stdc++.h>
using namespace std;
int counter[200005];
bool balls[200005];
bool picked[200005];
void solve(int k){
for(int i=1; i*i<=k; i++){
if(k%i==0){
counter[i]++;
if(i!=k/i) counter[k/i]++;
}
}
}
int main(){
int n;
cin>>n;
int ret = 0;
for(int i=1; i<=n; i++) cin>>balls[i];
for(int i=n;... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
static const long long INFTY = (1LL << 32);
int main()
{
int n, m, p, q, r,i,j,k,a,b,cost,time;
long long cost_d[101][101], time_d[101][101];
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)break;
for (i = 1; i <= m; i++) {
for (j = 1; j <= m; j++)... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s, t, r;
int n, a, b;
cin >> s >> n;
while (n--) {
cin >> t >> a >> b;
if (t == "print")
cout << s.substr(a, b - a + 1) << endl;
else if (t == "reverse")
reverse(s.begin() + a, s.begin() + b + 1);
else ... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int m; cin >> m;
vector<ll> d(m), c(m);
for(int i = 0; i < m; i++)cin >> d[i] >> c[i];
ll res = 0, ans = -1;
for(int i = 0; i < m; i++) {
res += c[i] * d[i];
ans += c[i];
}
while(res > 9) {
... | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
using namespace std;
typedef long long ... | 0 |
#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#include<ra... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
string s; cin >> s;
int len = s.length();
for(int i = 0; i < len-8; i++){
cout << s[i];
}
cout << endl;
return 0;
} | 1 |
///FUCKOUT
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#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 row = vector<int>;
usin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int long long
int hmt() {int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';if(n) x=-x;return x;}
#define in hmt()
#define ins ({string x;char c=getchar(... | 1 |
#include<iostream>
using namespace std;
int main(void){
long long n,a[10000],min=1000000,max=-1000000,sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<min){min=a[i];}
if(a[i]>max){max=a[i];}
sum=a[i]+sum;
}
cout<<min<<" "<<max<<" "<<sum<<endl;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 200001
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int64_t> a(n), dp(n), os(n);
for (auto &i: a) cin >> i;
for (int i = 0; i < n; ++i) {
os[i] = (i ? os[i-1] : 0) + (i % 2 ? 0 : a[i]);
}
... | #include <bits/stdc++.h>
#define sp ' '
#define nyan "(=^・ω・^=)"
#define mkp make_pair
#define intmax 2147483647
#define llmax 9223372036854775807
#define lP pair<ll,ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
const int mod = 1000000007;
int N, A, B, C, D;
ll DP[1001], E869120[1001];
ll pw... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
// #define mult... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int r; cin>>r;
if(r<1200) cout<<"ABC"<<endl;
else if(r<2800)cout<<"ARC"<<endl;
else cout<<"AGC"<<endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(0.0)
#define ll long long
#define f first
#define s second
#define gap ' '
#define pb push_back
#define mod 1000000007
int main()
{
ll n,m;
cin>>n>>m;
ll x[n+5],y[m+5];
for(int i=0;i<n;i++)
{
cin>>x[i];
}
for(int i=0;i<m;i+... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 2000000000;
int main() {
long n;
cin >> n;
long a[n];
for(in... | 0 |
#include <bits/stdc++.h>
#define len(x) ((int)(x).size())
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
// [
// (count_WA_before_passed, is_passed)
// ]
vector<pair<int, bool>> contest_result(105000, make_pair(0, false));
int WA_count = 0;
... | #include <iostream>
#include <set>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n, q, m, d;
int mxd=0;
set<int> s[50];
int date=0;
cin >> n >> q;
if(!(n||q)) break;
--q;
for(int i=0;i<n;++i){
cin >> m;
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, x, t;
cin >> n >> x >> t;
cout << (n+(x-1))/x*t << endl;
return 0;
} | /**
* ABC042 C
*
* @date 2020.05.03
* @author 焼き鮭 <yaki-shake@up-tri.me>
*/
#include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::endl;
int target;
bool *disallow;
bool is_ok(int target)
{
int remain_size = std::to_string(target).length();
while (remain_size != 0)
{
int d... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> m;
vector<ll> x(n), y(m);
for(i = 0; i < n; i++) {
cin >> x[i];
}
for(i = 0; i < m; i++) {
cin >> y[i];
}
ll retx... | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespac... | 1 |
#include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ri register int
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
const int rlen=1<<18|1,inf=0x3f3f3f3f;
const ll Inf=1e18;
char buf[rlen],*ib=buf,*ob=buf;
#d... | /*
* @Author: RBQRBQ
* @Date: 2020-04-05 15:08:15
* @LastEditors: RBQRBQ
* @LastEditTime: 2020-04-05 19:16:50
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll,ll> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ... | 1 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
map<int, int> m;
int ans = 0;
for (int i = 0; i < N; i++) {
int A;
scanf("%d", &A);
if (m[A] == 1) {
m[A] = 0;
ans--;
} else {
m[A] = 1;
ans++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | 0 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int count = 1000000;
for (int i = 0; i < count; i++) {
int e = 0;
cin >> e;
if (e == 0){
return 0;
}
int min = e;
for (int z = 0; z*z*z <= e; z++) {
for (int y = 0; y*y <= e - z*z*z; y++) {
int x = e - y*y - z*z*... | #include <iostream>
#include <vector>
#include <algorithm>
#include <initializer_list>
using namespace std;
int main()
{
int m, e, y, z;
int min;
while (cin >> e, e) {
m = min = 1000000;
for (z = 0; z <= 100; z++) {
if (z*z*z > e)
break;
for (y = 0; ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[n], b[n], 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(a, a+n);
sort(b, b+n)... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N;
int A[3][100001];
LL dp[3][100001] = {};
int main() {
scanf("%d", &N);
rep(j, 3) { rep(i, N) scanf("%d", &A[j][i]); A[j][N] = 1000000001; }
rep(j, 3) sort(A[j... | 1 |
#include <bits/stdc++.h>
using namespace std;
class dice{
public:
int init_label[6];
int label[6];
int tmp1, tmp2;
int order[4] = {1,2,4,3};
void setnumber(){
for(int i=0; i<6; i++)
cin >> init_label[i];
}
int check(int over, int front, int right, int left, int back, int bottom){
for(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long nexta[18][100001];
long long arr(long long from, long long days){
long long shisu=0;
while(days>0){
if(days%2==1){
from=nexta[shisu][from];
}
days/=2;
shisu++;
}
return from;
}
int main(){
//input
... | /*
* Author : Andrew J
*/
#include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
const int N = 1050;
#define singleCase
// #define ... | 0 |
#include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std;
template<c... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n;
char s[maxn];
typedef long long ll;
const ll mod = 1e9 + 7;
ll fac(int x) { ll ret = 1; for(int i = 1; i <= x; ++i) ret = ret * i % mod; return ret;}
ll f(int i, int j)
{
if(i == 0) return j == 0;
if(s[i] == 'B')
{
if(j & 1)
return ... | 0 |
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iom... | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <fstream>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct UnionFind {
//各要素が属する集合の代表(根)を管理する
//もし、要素xが根であればdata[x]は負の値を取り、-data[x]はxが属する集合の大きさに等しい
vector<int> data;
UnionFind(int sz) : data(sz, -1) {}
bool unite(int x, int y) {
x = find(x);
... | 0 |
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
struct person{
long long h;
long long p;
};
int main(){
int n;
int ans=0;
std::vector<person> list;
std::vector<long long> dpList;
std::cin>>n;
list.resize(n);
dpList.resize(n+1, -1);
dpList[0]= 0;
for(int i=0; i<n; i++)
std::cin>>... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
while(N%111... | #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... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#d... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int x = a;
int z = std::pow(x, 2);
int y = std::pow(x, 3);
int ans = x+y+z;
cout << ans << endl;
return 0;
} | /**
* auther: moririn_cocoa
*/
// #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_me... | 0 |
#include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward... | #include<stdio.h>
int main(){
long long input;
scanf("%lld",&input);
int i = 0;
char ans[100];
while(input > 0){
int temp = input % 26;
if(temp == 0){
ans[i++] = 'z';
input = (input/26) - 1;
}
else{
ans[i++] = (temp - 1) + 'a';
... | 0 |
//#pragma warning(disable:4996)
//#include <Windows.h>
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include ... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N, Q; cin >> N >> Q;
fenwick_tree<long long> fw(N);
rep(i, N) {
int a; cin >> a;
fw.add(i, a);
}
rep(query, Q) {
int a, b, c; cin >> a... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string game[3];
cin >> game[0] >> game[1] >> game[2];
int turn = 0;
int length[] = {game[0].length(), game[1].length(), game[2].length()};
int indices[] = {0, 0, 0};
while(true) {
int curr = indices[turn]++;
if(indices[turn] > length[turn]) break;
t... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-1... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
template <typename T> using vvec = vector<vector<T>>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0) { return 1; } if (b == 1) { return a % mod; } if (b == 2) { return (a * a) % mod; }
... | #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,r;
cin >> n >> r;
if(n<10) cout << r+(10-n)*100 << "\n";
else cout << r << "\n";
return ... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
const int INF = -100;
int k, r, c;
int a[8] = { INF, INF, INF, INF, INF, INF, INF, INF };
bool b[8] = { 0, 0, 0, 0, 0, 0, 0, 0 };
bool check() {
for (int i = 0; i < 7; i++) {
for (int j = i + 1; j < 8; j++)
if (a[i] == a[j] || j - i == abs(a[i] - a[j]))
... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
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;
}
r... | #include<iostream>
#include<string>
using namespace std;
int main(){
int k;
cin>>k;
string s,S;
cin>>s;
if(s.length()<=k)
cout<<s;
else{
for(int i=0;i<k;i++){
cout<<s[i];
}
cout<<"...";
}
}
| 1 |
#include <bits/stdc++.h>
#define ll long long
#define N 1000100
ll n,s,ans,x[N],p[N];
using namespace std;
int main(){
scanf("%lld%lld",&n,&s);
for (ll i=1;i<=n;i++) scanf("%lld%lld",&x[i],&p[i]);
for (ll l=1,r=n;l<=r;){
if (x[l]>=s){ans+=x[r]-s; break;}//所有人都在一边直接开过去
if (x[r]<=s){ans+=s-x[l... |
#include <cstdio>
using namespace std;
typedef long long int LL;
const int Max_N(100050);
namespace io
{
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == i... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,q;
ci... | #include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, q, inf=2e9, cnt;
vector<int> par ;
vector<pair<int,pair<int,int> > > v;
map<int,int> id ;
int tree[3000006];
void update(int node, int s, ... | 1 |
#include <stdio.h>
int main(){
long long int s,max,min,k;
int n;
scanf("%d",&n);
max = -1000000;
min = 1000000;
s = 0;
for (int i=0; i<n ; ++i){
scanf("%lld",&k);
if(k>max) max = k;
if(k<min) min = k;
s =s+k;
};
printf("%lld %lld %lld\n",min ,max, s);
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
long long Min,Max,sum=0,n,m;
scanf("%lld%lld",&n,&Max);
Min=sum=Max;
for(int i=1;i<n;i++){
scanf("%lld",&m);
if(m>Max) Max=m;
if(m<Min) Min=m;
sum+=m;
}
printf("%lld %lld %lld\n",Min,Max,sum);
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int> p(n... | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
bool hantei( vector<int>& x, vector<int>& y ) {
rep( Z, -100, 100+1 ) {
bool flag = true;
rep( i, 0, x.size() ) {
if ( x.at(i) >= Z ) flag = false;
}
rep( i, 0, y.size() ) {
if ( y.at(i) < Z ) ... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | 0 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
int main(){
int k,n;
cin >> k >> n;
vi a(n);
rep(i,n) cin >> a[i];
sort(a.rbegin(),a.rend());
cout << max(2*a[0]-k-1,0);
return 0;
} | 0 |
#include<iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
char str[20];
int i, len=0;
cin >> str;
while (str[len])
len++;
for (i = len - 1; i >= 0; i--)
cout << str[i];
putchar('\n');
return 0;
} | #include<iostream>
using namespace std;
int n, i, j;
char a[1005][1005];
int main(){
cin>> n;
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
a[i][j] = '.';
}
}
if(n % 2 == 0){
if(n == 2){
cout<< -1;
return 0;
}
for(i = 1; i <... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <functional>
#include <list>
#define MOD (1000000000 + 7)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
cons... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77 ;
int mod = 998244353;
int cnt[N];
int32_t main(){
fast;
int n ; cin >> n ;
int in = 0;
for(int i = 0 ; i < n ; ++i){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,x;
cin >> N >> x;
vector<int> data(N);
for (int i=0; i<N; i++){
cin >> data[i];
}
sort(data.begin(),data.end());
for (int i=0; i<N; i++) {
x = x - data[i];
if (x == 0) {
cout << i+1 <<endl;
return 0;
}
if (x... | #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#end... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1e9+7;
// const ll INF = 1000000000000000000LL;
//使い方
int main() {
ll n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
rep(i,n) cin >> a[i];
for(int ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, a, b) for (int i = a;i<=b;i++)
#define ll long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(x) (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int tmpCnt1,tmpCnt2;
int Max1 = 0, Max2 = 0;
string str1, str2;
cin >> num >> str1 >> str2;
if(str1 == str2){
cout << num;
return 0;
}
for(int i = 0; i < num; i++){
tmpCnt1 = 0;
if(str1.at(i) == str2.at(0)){
... | 0 |
#include<vector>
#include<iostream>
using namespace std;
string solve(){
vector<int> a;
for(int i=0;i<3;i++){
int tmp;
cin>>tmp;
a.push_back(tmp);
}
for(int i=0;i<a.size();i++){
if(a[i]==100)return "A";
}
if(a[0]+a[1]>=90*2)return "A";
int ave = (a[0]+a[1]+a[2])/3;
if(ave>=80)return "... | #include <iostream>
using namespace std;
char judge(int pm, int pe, int pj)
{
if(pm == 100 || pe == 100 || pj == 100 || pm + pe >= 180 || pm + pe + pj >= 240) return 'A';
else if(pm + pe + pj >= 210 || pm + pe + pj >= 150 && (pm >= 80 || pe >= 80)) return 'B';
return 'C';
}
int main()
{
int n, pm, pe,... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2005;
const int mod = 1e9+7;
int fac[N],combi[N][N];
int add(int x,int y) {
int ret = ((x+y)%mod + mod)%mod;
return ret;
}
int mul(int x,int y) {
ll ret = (ll)x*y;
ret%=mod;
return ret;
}
int num[2];
int group[2];
int dp... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <st... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define _ int v, int tl, int tr, int l, int r
#define tm (tl + tr >> 1)
#define sol v+v, tl, tm, l, r
#define sag v+v+1, tm+1, tr, l, r
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
con... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <utility>
#define INF 1000000000
using namespace std;
typedef long long int lli;
typedef pair<int, int> P;
struct edge{
int to, cost;
};
int V, E;
vector<edge> e[10000];
int mincost[10000];
bool used[10000];
i... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.