code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
ll s;
cin>>s;
int mi=1000;
while(s>=100){
mi=min(mi,abs(753-int(s%1000)));
s/=10;
}
cout<<mi<<endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=unsigned long long;
using namespace std;
int main() {
string s;
cin>>s;
int minv=1000000005;
size_t l=s.length();
rep(i,l-2){
string ss=s.substr(i,3);
int num=stoi(ss);
minv=min(minv,abs(num-753));
... | 1 |
#include <stdio.h>
int main() {
char S[30];
scanf("%[^\n]", S);
S[3] = '8';
printf("%s", S);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
char s[6];
cin >> s;
for(int i=0;i<5;i++){
if(s[i]=='A'&&s[i+1]=='C'){
cout << "Yes";
return 0;
}
}
cout << "No";
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=17;
const int INF=0x3f3f3f3f;
ll n,m,conn[MAX][MAX],dist[MAX][MAX],dp[MAX][1<<MAX],visit[MAX][1<<MAX],calc[1<<MAX],trk[MAX],ans;
void calc_build(ll x,ll v,ll idx){
//printf("%lld %lld ... | #include <bits/stdc++.h>
#define N 20
#define M (1 << 15 | 5)
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0')ch=='-'&&(f=0)||(ch=getchar());
while(ch<='9'&&ch>='0')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return f?x:-x;
}
int mp[N][N], inc[M], cot[M][N],... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
int main(){
ll counte=0,countw=0;
string str;
cin>>str>>str;
vector<ll> w((ll)str.size());
vector<ll> e((ll)str.size());
for(ll i=0;i<(ll)str.size();i++){
if(i==0)... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
int n,m,A[301][301],B[301][301];
cin>>n>>m;
rep(i,n)rep(j,m) cin>>A[i][j],B[i][A[i][j... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
set<ll> st;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 2e5 + 5;
int tab[max_n];
map<int, int> zliczanie;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, wynik = 0;
cin >> n;
for (int i = 0; i < n; i++){
cin >> tab[i];
zliczanie[tab[i]]++;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii>... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 0 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int, int >
#define F first
#define S second
#define int long long int
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, K; scanf("%d %d", &n, &K);
vector<int> a(n);
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
int ans = 0;
for(int left = 0; left <= K; left++){
for(int right = 0; right <= K; right++){
if(left + right > min(n, K)... | 0 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
namespace {
int cnt;
void InsertionSort(vector<int>& A, int g)
{
for (int i = g; i < A.size(); ++i)
{
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j -= g;
cnt++;... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll sum = 0;
for (int i = 0; i < n; i++) {... | 0 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
string Caesar(string a) {
for (int b = 0; b < a.length(); b++) {
if (a[b] == 'z')a[b] = 'a';
else if (a[b] >= 'a'&&a[b] < 'z')a[b] = a[b] + 1;
}
return a;
}
int main()
{
string a;
while (getline(cin, a)) {
for (int b = 0; b < 26; b++... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
while(getline(cin,s)){t=s;
for(int i=0;i<26;i++){
s=t;
for(int j=0;j<s.size();j++){
if(s[j]>='a'&&s[j]<='z')for(int k=0;k<i;k++){
s[j]++;
if(s[j]>'z')s[j]-=26;
}
}
if((s.find("the")!=s.npos||s.find("this")!=s.npos||s.find("tha... | 1 |
#include <bits/stdc++.h>
#define DEBUG
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll read(){
char c=getchar();bool flag=0;ll x=0;
while(c<'0'||c>'9'){if(c=='-')flag=1;c=getchar();}
while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
return flag?-x:x;
}
#define N 2010
const ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).si... | 0 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
for(int i = 0; i < N; i++) {
// cout << A.at(i) << endl;
}
for(int i = 0; i < N-1; i++) {
if(A.at(i) == A.at(i+... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | //pragma
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define YOU using
#define DONT namespace
#define SAY std
YOU DONT SAY;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef ... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
int main() {
int N;
std::cin >> N;
std::vector<int>sum(N), sort(N);
for (int i = 0; i < (N - 1)*N / 2; i += 1) {
int a, b, c, d;
std::cin >> a >> b >> c >> d;
if (c > d) {
sum[a - 1] += 3;
}
else if (d > c) {
sum[b - 1] += 3;
}
else {
su... | #include<stdio.h>
int main(void)
{
int n,m,i,j,q,a[5000],b[5000],c[5000],d[5000],s[500],z[500];
scanf("%d",&n);
m=n*(n-1)/2;
for(i=1;i<=m;i++){
scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
}
for(j=1;j<=n;j++){
s[j]=0;
z[j]=1;
}
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
if(j==a[i]){
if(c[i]>d[i]){
... | 1 |
#include "bits/stdc++.h"
using namespace std;
int main() {
using ull = unsigned long long;
ull ans[50];
ull k;
cin >> k;
cout << 50 << endl;
ull j = k / 50;
int i = k % 50;
for (auto &x : ans) {
x = 49 + j;
}
for (int a = 0; a < i; ++a) {
ans[a] += 51;
}
for (auto &x : ans) {
x -= ... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
ll k;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k;
int n = 50;
vector <ll> a(n);
for(int i = 0 ; i < n ; i++){
a[i] = i;
}
ll f = k / n;
for(a... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functi... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin >>n;
cin.ignore();
while(n--){
string word;
getline(cin,word);
string::size_type index;
for(;;){
index = word.find("Hoshino");
if(index == string::npos){break;}
word[index+6] = 'a';
}
cout <... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int MAXN = 305;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int f(ll a,ll b)
{
return (int)max(log10(a),log10(b));
}
int main()
{
ll N;
cin>>N;
int ans=10;
for(int i=1;i<sqrt(N)+1;i++)
{
if(N%i!=0) continue;
l... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).beg... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
//const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T... | 0 |
#include<iostream>
#include<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
string s;
int n;
cin>>n;
cin.ignore();
rep(i,n){
getline(cin,s);
int size=s.size();
rep(j,size-6){
string point=s.substr(j,7);
if(point=="Hoshino"){
point="Hos... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n,pos;
string s;
while(cin>>n&&n){
getline(cin,s);
while(n--){
getline(cin,s);
while((pos=s.find("Hoshino",0))!=string::npos)
s.replace(pos,7,"Hoshina");
cout<<s<<endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
int count = 0;
int score = 0;
cin >> N;
vector<string> s(N);
for(int i=0;i<N;i++){
cin >> s.at(i);
}
cin >> M;
vector<string> t(M);
for(int i=0;i<M;i++){
cin >> t.at(i);
}
for(int i=0;i<N;... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=305;
const int MOD=998244353;
int n,m;
int a[N];
long long f[N][N*N],g[N][N*N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),m+=a[i];
f[0][0]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<=m;j++)
{
f[i][... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define debug(x... | 0 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LLP;
bool check(int N, int M, vector<vector<int>> a... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define INF (2e9)
const int maxv=10000+10;
const int maxe=100000+10;
int V,E;
int d[maxv];
struct Edge
{
int from,to,cost;
};
Edge es[maxe];
int p[maxv];
int rank... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,n,ans=0;
cin>>N>>n;
if(n){
puts("-1");
return 0;
}
for(int i=1;i<N;i++){
int a;
cin>>a;
if(n>=a)ans+=a;
else if(n+1==a)ans++;
else{
puts("-1");
return 0;
}
n=a;
}
cout<<a... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end() // 昇順ソート
#define rall(v)(v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S second... | 1 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
vector<int> v(3);
v.at(0) = A;
v.at(1) = B;
v.at(2) = C;
sort(v.begin(), v.end());
int n = v.back();
while (K) {
n... | #include<iostream>
#include<queue>
#include<utility>
using namespace std;
long int inf=100000*100000+100;
int main()
{
int v,e,r;
int s[500000];
int t[500000];
int d[500000];
long int dis[100000];
cin>>v>>e>>r;
for(int i=0;i<e;i++)
{
cin>>s[i]>>t[i]>>d[i];
}
for(int... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
for (int i = 1; i <= n; ++i) {
if (i % 3 == 0) {
fprintf(stdout, " %d", i);
}
else {
for (int x = i; x > 0; x /= 10) {
if (x % 10 == 3) {
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n;i++) {
if (i % 3 == 0) {
cout << " " << i;
}
else {
for (int j = 0; j < 4;j++) {
int n;
int m;
n = pow(10, j + 1);
m = n / 10;
if (j == 0 && i % n == 3) {
c... | 1 |
//khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const in... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>
#define ft first
#define sc second
#define pb push_back
#define len(v) (... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 |
#include<bits/stdc++.h>
using ll=long long;
#define rep(i,j,n) for(ll i=(j);i<(n);i++)
#define per(i,n,j) for(ll i=(n);i>=(j);i--)
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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; ... | 1 |
#include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
int in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}
int in() {return in(gcu());}
bool scan(int &n){int c=gcu();return c==EOF?fa... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | 1 |
#include<stdio.h>
#include<iostream>
#include <algorithm>
#include <functional>
#include <array>
using namespace std;
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
//void margesort(int a[], int a_len, int left, int right);
//void margesortD(int a[], int b[], in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll x,y;
cin >> x >> y;
ll ans;
// 1回目に符号を反転させる場合
ll A = 1 + y - (-x);
// 最後に符号を反転させる場合
ll B = (-y) - x + 1;
// 最初と最... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
int main() {
int N;
cin>>N;
string s,t;
cin>>s>>t;
reverse(s.begin(),s.end());
for(int i=N;i<=2*N;i++){
string S=s.substr(0,2*N-i);
reverse(S.begin(),S.end());
if(S==t.substr(0,2*N-i)){cout<<i<<endl;return 0;}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S,T;
cin >> N >> S >> T;
bool a=false;
for(int i=0;i<N;i++){
if(S.substr(i,N-i)==T.substr(0,N-i)){
a=true;
cout << N+i << endl;
break;
}
}
if(!a){
cout << 2*N << endl;
}
} | 1 |
#include <iostream>
using namespace std;
int main(){
int l[10], v[2], sl;
char c;
while(cin >> l[0]){
sl = l[0];
for(int i = 1; i < 10; i++){
cin >> c >> l[i];
sl += l[i];
}
cin >> c >> v[0] >> c >> v[1];
for(int i = 0; i < 10; i++){
l[i] *= v[0] + v[1];
}
sl *= v[0];
for(int i = 0; i < 10;... | #include <bits/stdc++.h>
#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<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#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 all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_... | #include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2... | 1 |
#include <iostream>
#include <utility>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),... | #include<iostream>
using namespace std ;
int table[10010] = {} ;
void f(){
table[0] = 1 ;
table[1] = 1 ;
for( int i=2 ; i<=10000 ; i++ ){
if( !table[i] ){
for( int j=2 ; i*j<=10000 ; j++ ) table[i*j] = 1 ;
}
}
}
main(){
f() ;
int n ;
while( cin >> n , n ){
int p = 0 ;
for( int i=5 ; i<=n ; i++ ){... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define left 2*node+1
#define right left+1
#define mid (s+e>>1)
const ll N=5e5+5;
vector<ll> T[4*N];
void build(ll A[], ll node, ll s, ll e){
if(s==e){
T[node].push_back(A[s]);
return;
}
build(A, left, s, mid);
build(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll bi[514514];
void add(ll n,ll i,ll x){
for(;i<=n;i+=i&-i)bi[i]+=x;
}
ll sum(ll i){
ll num=0;
for(;i>0;i-=i&-i)num+=bi[i];
return num;
}
ll c[514514],g[514514],ans[514514];
int main(){
ll n,q;
cin>>n>>q;
vector<vector<ll>... | 1 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//cout << fixed << setprecision(15);
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int a;
cin >> a;
if(a == 1) cout << "Hello World" << endl;
else{
... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int sum,i,j,kari;
string data;
while(getline(cin, data)) {
data = data.insert(data.length(), "KKKKKK");
sum = j = 0;
for(j = 0; j < data.length(); j++) {
if(data[j] == 'M'){
sum += 1000;
}else if(data[j] == 'D'){
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N=1e6,MAX_A=1e5;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
int N;
int a[MAX_N];
ll sum[MAX_N+1];
int main(){
do{
scanf("%d",&N);
if (N){
REP(i,N){
scanf("%d",&a[i]);
}
ll ma=-MAX_A;
... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
while (1) {
long a[5001] = { 0 };
long n;
cin >> n;
if (n == 0)break;
a[0] = 0;
long maxv = -100000;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
a[i] = max(a[i], a[i] + a[i - 1]);
maxv =... | 1 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) f... | 0 |
#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;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,a,imin,j;
cin >> N >> A;
for (imin = 0; A % 2 == 0; imin++)
A /= 2;
for (int i = 0;i < N-1; i++) {
cin >> a;
for (j = 0;a % 2 == 0;j++)
a /= 2;
if (j < imin)
imin = j;
}
cout << imin << endl;
} | 1 |
#include<iostream>
using namespace std;
int n, a, b, c;
int main() {
while (true) {
cin >> n; if (n == 0) { break; }
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a + b + c >= 240) { goto A; }
if (a + b >= 180) { goto A; }
if (a == 100 || b == 100 || c == 100) { goto A; }
if (a + b + c >= 21... | /*
* src.cpp
*
* Created on: 2016/08/04
* Author: joi
*/
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=1e4;
int n;
int p[3];
char out[MAX_N+5];
int main(){
do{
cin>>n;
if (n){
REP(i,n){
int ave=0;
b... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
int l = a + b;
int r = c + d;
if(l > r){
cout << "Left" << endl;
}else if(l == r){
cout << "Balanced" << endl;
}else{
cout << "Right" << endl;
}
retu... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_poizcy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define mem(a,h) ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int a, b, c, n;
int parts[310];
int result[1010][4];
int main()
{
while(cin >> a >> b >> c && (a || b || c)){
cin >> n;
for(int i = 1; i <= a + b + c; i++)
parts[i] = 2;
for(int i = 0; i < n; i++)
for(int j = 0; j < 4; j++)
cin >> result[i][j];
... | #include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
struct Info {
int i,j,k;
Info(int _i,int _j,int _k) {i=_i,j=_j,k=_k;}
};
vector<Info> info[2];
int result[300];
int main() {
int a,b,c,N;
while(scanf("%d %d %d",&a,&b,&c),a|b|c) {
scanf("%d",&N);
info[0].clear();
info[1].clear();
me... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
vector<int> W;
vector<int> K;
for(int i = 0;i < 20;++i){
int a;
cin>>a;
if(i < 10){
W.push_back(a);
}
else{
K.push_back(a);
}
}
sort(W.begin(),W.end());
reverse(W.begin(),W.end());
sort(K.begin(),K.end()... | #include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int W[10], K[10];
for(int i = 0; i < 10; i++) scanf("%d", &W[i]);
for(int i = 0; i < 10; i++) scanf("%d", &K[i]);
sort(W, W + 10);
sort(K, K + 10);
printf("%d %d\n", W[9] + W[8] + W[7], K[9] + K[8] + K[7]);
return 0;
} | 1 |
#include<iostream>
using namespace std;
int a[102][102],color;
void dfs(int x,int y){
a[y][x] = 9;
if(a[y+1][x] == color){
dfs(x,y+1);
}
if(a[y][x+1] == color){
dfs(x+1,y);
}
if(a[y-1][x] == color){
dfs(x,y-1);
}
if(a[y][x-1] == color){
dfs(x-1,y);
... | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n,p;
while(1){
cin>>n>>p;
if(n==0 && p==0)break;
int dt[n];
int cop=p;
int counta=0;
rep(i,n)dt[i]=0;
int ans;
while(1){
counta=counta%n;
if(cop!=0){
dt[counta]++;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
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... | #include <iostream>
//#include<stack>
#include<set>
#include<bits/stdc++.h>
using namespace std;
//int f[10005];
//int chazhao(int x)
//{
// if(x==f[x])
// return x;
// else
// return f[x]=chazhao(f[x]);
//}
int main()
{
set<int >ss;
int n,x;
cin>>n>>x;
ss.insert(x);
for(int i=1;i<n;i++)
{
cin>>x;
if(ss.cou... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define sz(obj) ((int)(obj).size())
#define pf push_front
#define pb push_back
int main()
{
int n;
cin >> n;
in... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
auto gcd = [](int mm, int nn) {
function<int(int, int)> f = [&f](int m, int n) {
if (n == 0) {
return m;
}
else {... | 1 |
// Problem : E - Colorful Blocks
// Contest : AtCoder - AtCoder Beginner Contest 167
// URL : https://atcoder.jp/contests/abc167/tasks/abc167_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define fastio... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn=200005,K=998244353;
int n,m,p,ans,fac[maxn],inv[maxn];
int C(int A,int B) { return (LL)fac[A]*inv[B]%K*inv[A-B]%K; }
int Pow(int A,int B)
{
int res=1;
while (B)
{
if (B&1) res=(LL)res*A%K;
A=(LL)A*A%K;
B>>=1;
}
return res;
}
in... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <numeric>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <deque>
#include <cmath>
#include <complex>
#include <cassert>
#include <cstring>
#include <functional>
#include <bitset>
#include <clim... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() { int N, K;
cin >> N >> K;
int s = 1;
for (int i = 0; i < N; i++){
if(s<K){
s = 2 * s;
}
else{
s = s + K;
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a,b;
cin>>a>>b;
if(a==b)
cout<<a+b;
else{
int mx=max(a,b);
int k=(mx-1)+mx;
cout<<k;
}
}
| 0 |
#include <bits/stdc++.h>
# define M_PI 3.14159265358979323846 /* pi */
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
int count = 0;
int result = 200;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
while (true) {
if (A.at(i) % 2 != 0 || A.at(i) == 0) {
break;
}
... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <string>
#include <algorithm>
#include <climits>
#include <utility>
#define PRINT(STR) cout << STR << endl;
#defi... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
vector<int>v;
int a,b,c,k;
cin >> a >> b >> c >> k;
v.push_back(a);
v.push_back(b);
v.push_back(c);
int sum = 0;
while(k--)
{
sort(v.begin(),v.end());
v[2]*=2;
}
sum = v[0] + v[1] + v[2];
cout << sum << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
int a[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
int ans=0;
bool used[n];
memset(used,0,sizeof(used));
used[0]=1;
int cost[n];
for(int i=0;i<n;i++) cost[i]=a[0][i];
while(... | 0 |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
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,n) for(int i=0;i<n;i++)
#define all(a) (a).begin(),(a).end()
#defin... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int applepie = 0;
for (int i = 1; i <= N; i++) {
applepie += L + i - 1;
}
int ans;
int diff = abs(L + 1 - 1);
for (int i = 2; i <= N; i+... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C; cin >> A >> B >> C;
cout << (((A < C && C < B) || (A > C && C > B)) ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define int long long int
#define vi vector<int>
#define vvi vector < vi >
#define pii pair<int,int>
#define mod 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(),c.en... | 0 |
#include<cstdio>
#include<algorithm>
#include<cstring>
int main(){
using namespace std;
int table[300][300][2],n,m,a,b,INF=10000000;
while(true){
scanf("%d%d",&n,&m);
if(n==0&&m==0) break;
for(int i=0;i<300;i++)
for(int j=0;j<300;j++)
for(int k=0;k<2;k++)
table[i][j][k]=INF;
for(int i=0;i<300;i+... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <climits>
using namespace std;
void floyd(vector<vector<long long> >& d)
{
for (int k = 0; k < d.size(); k++) {
for (int i = 0; i < d.size(); i++) {
if (L... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int R;
cin>>R;
if(R<1200) cout<<"ABC"<<endl;
else if(1200<=R && R<2800) cout<<"ARC"<<endl;
else cout<<"AGC"<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin>>n>>x;
long long int ans=0;
long long int a;
cin>>a;
for(int i=0; i<n-1; i++){
long long int b;
long long int eat=0;
cin>>b;
eat=max(a+b-x, eat);
ans+=eat;
if(b<=eat) b=0;
else b=b-eat;
a=b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
ll x;
cin >> N >> x;
vector<ll> a(N);
for(int i = 0; i < N; i++) cin >> a[i];
ll ans = 0;
for(i... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n,0);
REP(i,n) cin >> a[i];
sort(a.begin(), a.end());
bool ok ... | #define _CRT_NO_SECURE_WARNINGS
#pragma warning(disable:4996)
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <string>
#include <iomanip>
#include <set>
#include <random>
#include <queue>
#include <map>
#include <ctime>
#include <sstream>
#includ... | 0 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include<iostream>
using namespace std;
const int maxn = 200001;
const int INF = 0x7fffffff;
int L[maxn], R[maxn];
long long merge(int A[], int n, int left, int mid, int right)
{
int i, j, k;
long long cnt = 0;
int n1 = mid - left;
int n2 = right - mid;
for(int i = 0; i < n1; i++) L[i] = A[left + ... | 0 |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int N = 0, M = 0;
int points[1001];
int scores[1002001];
bool check(int a, int c){
if(a >= (N + 2) * (N + 1) / 2 - 1){
return true;
}
return (scores[a] <= c && scores[a + 1] > c);
}
int search2(int a, int b, int c){
... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, N) for(int i = 0; i < N; i++)
int main()
{
int N, M;
while(cin >> N >> M, N || M) {
int A[1005] = {0};
vector<int>sum;
int maxv = 0;
sum.push_back(0);
for(int i = 1; i <= N; i++) {
cin >> A[i];
Rep(j, i + 1) {
if(A[i]... | 1 |
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define input freopen("1.txt","r",stdin);
#define output freopen("output.txt","w",stdout);
#define ll long long int
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define vi vector<int>
#define vii vector<vi>
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl
using namespace std;
typedef long lon... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | #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) ?... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long fac[1010], finv[1010], inv[1010];
long long MOD = 1000000007;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1005; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (... | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#include<cmath>
using namespace std;
void read(int &x){
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok)x=-x;
}
#define rg register
const i... | 0 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
const double pi = acos(-1);
pair <double, double> rotate(int x, int y, int degree, double d) {
double theta = (2 * pi / 360) * degree;
double x_ = x * cos (theta) - y * sin(theta);
double y_ = x * sin (theta) + y * cos(theta);
x_ *= d;
... | #include <bits/stdc++.h>
#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 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool ... | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=m-1;i>=n;--i)
#def... | #include<iostream>
using namespace std;
int main(){
int n,cnt=0,num=0;
int base[4]={0};
cin>>n;
string s;
while(1){
cin>>s;
if(s=="HIT"){
base[3]+=base[2];
base[2]=base[1];
base[1]=base[0];
base[0]=1;
}
if(s=="HOMERUN"){
for(int i=0;i<3;i++){
base[3]+=base[i];
base[i]=0;
}
bas... | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF=1e9;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
ll s[200010];
s[0]=0;
rep(i,n){
ll a;
cin >> a;
s[i+1]=s... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
using namespace std;
typedef long long llong;
typedef long double ld;
typedef... | 0 |
#include<stdio.h>
int main(void)
{
int n,pm,pe,pj,s,i;
while(1){
scanf("%d",&n);
if(n==0) break;
for(i=0;i<n;i++){
scanf("%d%d%d",&pm,&pe,&pj);
s=(pm+pe+pj)/3;
if(pm==100||pe==100||pj==100) printf("A\n");
else if((pm+pe)/2>=90) printf("A\n");
else if(s>=80) printf("A\n");
else if(s>=70) printf... | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int color[200][200];
bool flg[200][200];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int w,h,n,c,d,x,y;
void dfs(int ny,int nx,int gy,int gx){
flg[ny][nx]=true;
rep(i,4){
int nex=nx+dx[i];
int ney=ny+d... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
bool ok = 1;
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1]) ok = 0;
}
if (ok) printf("YES\n");
else pr... | /*
h s, d't skp th si tll i's sved
* ABC141 E
* ABC145 D
* ABC147 F
*/
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
int n,x;
cin>>n;
set<int> st;
string ans="YES";
while(n--)
{
cin>>x;
if(st.count(x))
{
ans="NO";
break;
}
st.insert(x);
}
cout<<ans;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int rr[8], cc[8];
int r[8], c[8];
int main(){
int k;
cin >> k;
int count=0;
for(int i=0;i<k;i++) cin >> r[i] >> c[i];
for(int co=0;co<pow(8,8-k);co++)
{
for(int i=0;i<8;i++)
{
rr[i]=-1;
cc[i]=-1;
}
//無理やり配置を用意して
for... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.cle... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s, w, r;
int q, i, j, a, b;
cin >> s >> q;
for(i = 0; i < q; ++i){
cin >> w >> a >> b;
if( w == "replace" ){
cin >> r;
for( j = a; j <= b; ++j)
s[j] = r[j-a];
}else if( w == "print" ){
for( j = a; j <= b; ++j)
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, cnt, d[N << 3], v[N << 3], sum, ans;
map <int, int> mp[N << 3];
vector < pair <int, int> > e[N << 3];
queue <int> q;
void init ()
{
scanf ( "%d%d" , &n, &m);
cnt = n;
for (int i = 1; i <= m; ++ i)
{
int p, q, c;
scanf ( "%d%d... | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#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 fore(i,a) for(auto &i:a)
#define INF INT_M... | #include <bits/stdc++.h>
using namespace std;
int main() {
int current_rate, target_rate; //初期値
double next_rate;
cin >> current_rate >> target_rate;
next_rate = target_rate*2 - current_rate;
cout << next_rate << endl;
} | 0 |
#include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 0 |
#include <iostream>
#include <string>
int main(){
char s[10];
for (int i = 0; i < 10; i++){
std::cin >> s[i];
if (i == 3){
s[i] = '8';
}
}
for (int i = 0; i < 10; i++){
std::cout << s[i];
}
std::cout << std::endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int n,m;
int C[200][200];
int T[200][200];
int d[200];
int dijk(int s,int g,int r){
boo... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
lli n, q, k;
vector<vector<pair<lli, ... | 0 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
t... | #include<iostream>
using namespace std;
int h,w,map[20][20];
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int f(int i,int j,int cnt)
{
if(cnt>10)return 11;
int ans=11;
for(int r=0;r<4;r++)
{
int x=i+dx[r],y=j+dy[r];
while(x>=0&&y>=0&&x<h&&y<w&&map[x][y]==0)x+=dx[r],y+=dy[r];
if(x<0||y<0||x>=h||y>=w)continue;
else i... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.setf(ios::fixed);
double x1, y1, x2, y2;
cin>>x1>>y1>>x2>>y2;
cout<<hypot(x2-x1, y2-y1)<<'\n';
return 0;
} | #include <stdio.h>
#include <math.h>
int main(){
double vx,vy,v,x1,x2,y1,y2;
scanf("%lf%lf%lf%lf", &x1,&y1,&x2,&y2);
vx=(x2-x1)*(x2-x1);
vy=(y2-y1)*(y2-y1);
v=vx+vy;
printf("%0.8f\n",sqrt(v));
return 0;
} | 1 |
#include <cstdio>
long long x[100001],p[100001],ans,n,s;
int main(){
scanf("%d%d",&n,&s);
for(int i=1;i<=n;i++)
scanf("%d%d",&x[i],&p[i]);
int i=1,j=n;
while(i<=j){
if(s<=x[i]){
printf("%lld",x[j]-s+ans);
return 0;
}else if(s>=x[j]){
printf("%lld",ans+s-x[i]);
return 0;
}
if(p[i]>=p[j]){
an... | #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=1010000;
const int P=1000000007;
const db... | 1 |
#if 0
date +%Y.%m.%d
不妨设 n > 1 。
如果所有 a[i] 都是奇数，那么先手操作后会有一个偶数，约分后仍然有唯一偶数，
此时后手一定可以对唯一偶数操作，所有数成为奇数，约分后同样如此，
直到所有数都为 1 ，仍然没有偶数，那么当 a[i] 全是奇数时先手必败。
更一般的，假设 n 足够大奇数足够多，如果有偶数个偶数，
先手操作后有奇数个偶数，后手一定可以对偶数操作使得状态还原至奇数个偶数，
也就是说有奇数个偶数时先手必胜，反之先手必败。
特别的是，如果有偶数个偶数且奇数唯一，此时先手对唯一奇数操作后，所有数都是偶数，
此时一定可以约分，并且约分后的结果是难以推断的。
由于这种情况一定可以约分，那么... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | 1 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,Q,K;
cin>>N;
vector<vector<pair<int,int>>> A(N);
for(int i=1;i<N;i++){
int a,b,c;
cin>>a>>b>>c;
A[a-1].push_back({b-1,c});
A[b-1].push_back({a-1,c});
}
cin>>Q>>K;
vector<int> B(N,-1);
queue<int> q;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
#define MAX_V 100000
vector<int> G[MAX_V]; //???
v... | 0 |
#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<iostream>
using namespace std;
int main() {
int N, K; cin >> N >> K;
int ans = 1000;
for (int i = 0; i <= N; i++) {
int num = 1;
for (int k = 0; k < i; k++) {
num *= 2;
}
for (int k = 0; k < N - i; k++) {
num += K;
}
ans = min... | 1 |
// #pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 1e5 + 7;
const double eps = 1e-9;
const ... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(a);i>(b);i--)
typedef long long ll;
using namespace std;
typedef double dd;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,x,t;
cin>>n>>x>>t;
if(... | 1 |
#include<iostream>
using namespace std;
int main() {
int N;
cin>>N;
long A[N];
for(int i=0;i<N;++i){
cin>>A[i];
}
bool check = true;
if(A[0]!=0)check = false;
for(int i=1;i<N;++i){
if(A[i]-A[i-1]>1)check = false;
}
long ans = A[N-1];
if(check){
for(in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define go(u) for(int i = head[u], v = e[i].to; i; i=e[i].lst, v=e[i].to)
#define rep(i, a, b) for(int i = a; i <= b; ++i)
#define pb push_back
#define re(x) memset(x, 0, sizeof x)
inline int gi() {
int x = 0,f = 1;
char ch = ... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int n,id[maxn],omove,orev,emove,erev,bit[maxn],rnk[maxn];
bool rev[maxn],vis[maxn];
inline void wrong(){
puts("No");
exit(0);
}
inline void add(int x,int val){
while(x<maxn){
bit[x]+=val;
x+=x&-x;
}
}
inline int sum(int x){
int res=0;
while... | 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 1 |
#include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<... | #include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
usin... | //#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std:... | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int main(){
ll x;cin>>x;
cout<<x/11*2+(x%11>6?2:x%11>0?1:0);;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long x, ans = 0;
cin >> x;
ans += 2 * (x / 11);
x %= 11;
if(x > 0) ans++;
if(x > 6) ans++;
cout << ans << endl;
return 0;
} | 1 |
#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)
// -----------... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 2e5 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#... | 1 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define INF 999999
using namespace std;
int main(){
int N;
while(cin>>N,N){
int ice[15]={0},X;
while(N--){
cin>>X;
ice[X]++;
}
for(int i=0;i<10;i++){
if(... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<string>
#include<string.h>
using namespace std;
struct DICE
{
int f[8];
};
DICE dice;
int ch(char a)
{
int s[60];
for (int i = 1; i < 7; i++)
{
s[i] = dice.f[i];
}
int k = a;
switch (k)
{
case 78://N
dice.... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
long long gcd(long long x, long long y){
if(y == 0) return x;
else return gcd(y, x%y);
}
bool IsPrime(long long n){
if(n == 1) return false;
for(long long i = 2; i * i < n; i++){
if(n%i == 0) return false;
}
... | //int a = s - '0'; 文字から数字
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//小文字に対応する文字コード：S... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PRINT(x,y) cout<<"Case #"<<(int)x<<": "<<(int)(y)<<endl;
ll exp(ll x, ll y) {
if(y==0) return 1;
if(y==1) return x;
if(y%2==0) return exp(x,y/2)*exp(x,y/2);
else return x*exp(x,y/2)*exp(x,y/2);
}
ll gcd(ll a , ll b) {
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | 1 |
#include <cstdio>
const int MAXN = 6005;
template<typename _T>
void read( _T &x )
{
x = 0;char s = getchar();int f = 1;
while( s > '9' || s < '0' ){if( s == '-' ) f = -1; s = getchar();}
while( s >= '0' && s <= '9' ){x = ( x << 3 ) + ( x << 1 ) + ( s - '0' ), s = getchar();}
x *= f;
}
template<typename _T>
void... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// true:a < b false:a > b
bool mycomp(pair <int, int> a, pair <int, int> b)
{
int c = a.first*a.first + a.second*a.second;
int d = b.first*b.first + b.second*b.second;
if (c == d){
return a.first < b.first;
}
return c < d;
}
int m... | 0 |
#include<bits/stdc++.h>
using namespace std;
vector<pair<long long,long long>> bunkai;
int main(){
int a,b,c; cin >> a >> b >> c;
if(a == b && b == c && c == a || a != b && b != c && c != a)
cout << "No";
else
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
set<int> nums;
int a;
whil... | 1 |
#include <bits/stdc++.h>
using namespace std;
#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<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a,... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#inclu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N = 1010;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
int _w;
int n, m;
char str[N][N];
int dis[N][N];
queue<pii> q;
bool inside( int x, int y ) {
return x >= 1 && x <= n && y >= 1 && y <= m;
}
int main() {
_w =... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
#define cout(val) cout << (val) << endl
using namespace std;
typedef long long ll;
int main(){
int h, w;
char t;
cin >> h >> w;
vector<vector<bool>> c(h, vector<bool>(w, false));
queue<pair<int, int>> que1, que2;
rep(i, ... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.