code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define all(z) (z).begin(),(z).end()
#define MOD 1000000007
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll isprime(ll n)
{
for(int i=2;i<n;i++)
if(n%i==0)
return 0;
return 1;
}
i... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
using ll = long long;
using... | 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
// a^n mod を計... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int ans = 1e9;
for (int i = 0; i < s.size() - 2; i++) {
ans = min(ans, abs(753 - atoi((s.substr(i, 3)).c_str())));
}
cout << ans << endl;
... |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
std::vector<bool> dict(26, false);
for (char c : s)
dict[c - 'a'] = true;
std::string r = "None";
for (std::size_t i = 0;... | 0 |
#include <iostream>
#include <vector>
#include<string>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
long long N;
cin >> N;
long long result = 0;
for(long long i = 1;i<=N;i++){
if(i % 3 != 0 && i % 5 != 0){
result += i;
}
}
std::cout << result... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
cout << (N / 1 * 1 * (N / 1 + 1) - N / 3 * 3 * (N / 3 + 1) - N / 5 * 5 * (N / 5 + 1) + N / 15 * 15 * (N / 15 + 1)) / 2 << endl;
} | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<string,int>;
int main() {
map<string,int> day{P("SUN",7),P("MON",6),P("TUE",5),P("WED",4),P("THU",3),P("FRI",2),P("SAT",1)};
string S;cin>>S;
cout<<day[S]<<endl;
} | #include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
vector<string> D = {"SUN","MON","TUE","WED","THU","FRI","SAT"};
string S;
cin >> S;
int ans=0;
rep(i,7){
if(D[i]==S) ans = 7-i;
}
cout << ans << endl;
return 0... | 1 |
#include <iostream>
using namespace std;
int main()
{
double U = 3.14;
int R;
cin >> R >> U;
cout << R * 2 * U <<"\n";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int R;
cin >> R;
R *= 2;
cout << R * 3.14 << endl;
} | 1 |
// 2020-07-18 10:56:41
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i... | #include<bits/stdc++.h>
#define mo 1000000007
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
xx=xx*10+ch-'0';
... | 0 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
#ifndef MAX
#define MAX 400000
#endif
//Range Update Query+Range Sum Query
template<class T>
class RUQ_RSQ {
public:
int n;
T dat[MAX], lazy[MAX], ZERO, DEFAULT;
void init(int n_, T d = INT_MAX, T t = 0) {
DEFAULT = d;
ZERO = T(... | #include<stdio.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define MAX_V 100001
#define INF (1e9 + 1)
int V,E,r,a,b,c;
vector<int> Gto[MAX_V];
vector<int> Gcost[MAX_V];
int d[MAX_V];
void dijkstra(){
int i;
for(i=0;i<MAX_V;i++)d[i]=INF;
d[r]=0;
priority_queue< pair<int,int>... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s1,s2;
cin>>s1>>s2;
cout<<s2+s1<<endl;
} | #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 repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | 0 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, m;
while(1){
scanf("%d%d", &n, &m);
if(n == 0 && m == 0)return 0;
int res = 0, tmp;
vector<int> points, points2;
for(int i = 0;i < n;i++){
scanf("%d", &tmp);
if(tmp < m)points.push_back(tmp... | //JOI 2008??´???3??? ?????????
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
#define MAX -210000000
#define MIN 210000000
int a,b;
int d[1002],c[1001*1001],hk=0,mcunt,low,high;
int x,pr=0/*,flg[200000000]*/,m,ff=0;
int main(){
scanf("%d %d",&a,&b... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MX = 0; //最大値
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define PB push_back
#define F first
#define S second
int ma... | // God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define NIL 2000000001
typedef struct{
int p,l,r,key;
}node;
node tree[500001];
queue<int> q[2];
int root=NIL;
void insert(int key,int i){
node z={NIL,NIL,NIL,key};
int x=(root==NIL?NIL:root),y=NIL;
if(root==NIL)root=i;
while(x!=NIL){
y=x;
if(z.key<tree[... | #define _GLIBCXX_DEBUG
#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(){
int k;
cin>>k;
int r,c;
vector<int> A(8),B(8);
rep(i,8) A[i]=i;
rep(i,8) B[i]=-1;
rep(i,k){
cin>>r>>c;
... | 0 |
/*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
map<string,int> num;
num["SUN"]=7;
num["MON"]=6;
num["TUE"]=5;
num["WED"]=4;
num["THU"]=3;
num["FRI"]=2;
num["SAT"]=1;
cout<<num[S... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int cnt;
int sum;
string ans="War";
vector<int> a(n);
rep(i,n){
cin>>a[i];
}
vector<int> b(m);
rep(i,m){
cin>>b[i];
}
for(int i=x+1;i<y;i++){
cnt=0;
for(i... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 0 |
#include<bits/stdc++.h>
using namespace std;
bool bfs(int s,int t,vector<vector<pair<int,int>>> graph,vector<int> &prev)
{
int v,w;
vector<bool> visit(201,false);
queue<int> que;
que.push(s);
visit[s]=true;
for (int i=0;i<prev.size();i++) prev[i]=0;
while(!que.empty())
{
v=que.front();
que.pop();
for (in... | #include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cassert>
#define ll long long
using namespace std;
inline int read(){
int re=0,flag=1;char ch=getchar();
while(ch>'9'||ch<'0'){
if(ch=='-') flag=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') re=(re<<1)+(re<<3)+ch-'0... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n; cin >> n;
vector<long long>a(n); for(int i=0;i<n;i++) cin >> a.at(i);
vector<long long>b(n); for(int i=0;i<n;i++) cin >> b.at(i);
vector<long long>c(n); for(int i=0;i<n;i++) cin >> c.at(i);
sort(a.begin(),a... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main(){
int n,l; cin>>n>>l;
vector<pair<int, bool> > fla;
for (size_t i = 0; i < n; i++)
{
int tmpfl = l + i;
if (tmpfl< 0)
{
tmpfl *= -1;
fla.push_back(make_pair(tmpfl , true));
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cou;
void merge(vector<ll> &v,ll l,ll r){
ll mid = (r+l)/2;
ll n1 = mid-l;
ll n2 = r-mid;
vector<ll> a,b;
for(ll i=0;i<n1;i++)a.push_back(v[l+i]);
for(ll i=0;i<n2;i++)b.push_back(v[mid+i]);
a.push_back(1e9);
b.push... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int,int>
const int maxm=1e6+5;
int a[maxm];
int n;
signed main(){
cin>>n;
for(int i=1;i<=n*2;i++)cin>>a[i];
int ans=0;
sort(a+1,a+1+n*2);
for(int i=1;i<=n*2;i+=2){
ans+=min(a[i],a[i+1]);
}
cout<<ans<<... | 0 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i,n) for(int i=... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
using namespace std;
#define ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugArray(x, n) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 25;
int d;
LL p[N];
int sub1[N], sub2[N]; // sub1 not front, sub2 is front
vector <LL> v;
void dfs(int s, int e, vector <pair <LL, LL> > &w, LL val, LL cnt){
if (s == e){
w.push_back(make_pair(val, cnt));
ret... | #include <iostream>
#include <vector>
using namespace std;
long long MOD = 1e9 + 7;
int main(){
int N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i < N; i++) cin >> A[i];
vector<long long> cnt(60, 0);
for(int i = 0; i < N; i++){
int cn = 0;
long long t = A[i];
while... | 0 |
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int MOD=1e9+7;
int n,x[3], dp[40][1<<16];
void printbin(int n, int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) for(auto it=x.begin();it!=x.end();it++) cout<<*it<<' '; cout<<'\n';
#define debug(a,b,c) cout << a << " " << b << " " << c << endl;
#de... | 0 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<l... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
vector<int> adj[N];
int vis[N] , n;
bool cycle(int node , int lim) {
if (vis[node])
return vis[node] == 1;
if (!lim)
return 0;
vis[node] = 1;
for (int c : adj[node])
if (cycle(c , lim - 1))
retu... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str;
cin >> str;
int q;
cin >> q;
for(int i = 0; i < q; i++){
string command;
int a, b;
cin >> command >> a >> b;
if(command == "print"){
cout << str.substr(a, b-a+1) << endl;
}
if(command == "rever... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
vector<int> x(M);
vector<int> y(M);
vector<int> c(M);
for (int i = 0; i < A; i++) {
cin >> a[i];
}
for (int i = 0; i < B; i++) {
cin >> b[i];
}
f... | 0 |
#include <stdio.h>
int main() {
int n;
long long int val = 0;
scanf("%d",&n);
for (int i = 1 ; i <= n; i++)
{
if (i % 3 == 0 && i % 5 == 0)
{
continue;
}
else if (i % 3 == 0)
{
continue;
}
else if (i % 5 == 0)
{
continue;
}
else
{
val += i;
}
}
printf("%lld",val);
return 0;... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v... | 0 |
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
#include<string>
#include<cstdio>
#include<cctype>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<sstream>
#include<numeric>
#include<iostream>
#include<algorithm>
#include<functional>
#define For(i,x,y) for (int i=x;i<y;i++)
... | #include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,a[4][N],b[N],c[N],A,B;
void M(int x,int *a){ while(x<=n) a[x]^=1,x+=(x&(-x));}
int Q(int x,int *a){ int s=0; while(x) s^=a[x],x-=(x&(-x)); return s;}
void GG(){ printf("No"); exit(0);}
int main()
{
int i,p;
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#defi... | #include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int n;
cin >> n;
vector<vector<P>>lis(n);
rep(i, n) {
int a;
cin >> a;
... | 0 |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <utility>
#include <complex>
#include <stack>
#include <climits>
#include <set>
#include <numeric>
using namespace std;
int t[5];
bool ... | #include <iostream>
using namespace std;
int main() {
int n;
int dp[31];
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
for ( int i = 4; i <= 30; i++ ) dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
while ( cin >> n, n ) {
cout << dp[n]/10/365 + 1 << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <vector>
using namespace std;
const int dx[] = {0, -1, 0, 1};
const int dy[] = {-1, 0, 1, 0};
bool fill(vector<vector<int> > &v, int x, int y, int gx, int gy) {
if(x == gx && y == gy) return true;
int W = v.size();
int H = v[0].size();
int clr = v[x][y];
v[x][y] = 0;... | #include <cstdio>
#include <functional>
#include <vector>
#include <algorithm>
int testcase_ends() {
int w, h;
scanf("%d %d", &w, &h);
if (w == 0 && h == 0)
return 1;
int xs, ys;
scanf("%d %d", &xs, &ys);
int xg, yg;
scanf("%d %d", &xg, &yg);
std::vector<std::vector<int>> g(h+2, std::vector<int>... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x... | #include <iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int a[5000], ans = -100001;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n; j++){
sum += a[j];
ans = max(ans, sum);
}
}
cout << ans << endl;
}
return 0;
} | 1 |
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int... | #include<iostream>
using namespace std;
int main()
{
int month[12];
month[0]=31;
month[1]=29;
month[2]=31;
month[3]=30;
month[4]=31;
month[5]=30;
month[6]=31;
month[7]=31;
month[8]=30;
month[9]=31;
month[10]=30;
month[11]=31;
int hoge,fuga;
hoge = 1;
int i;
int count=0;
while(hoge!=0)
{
coun... | 0 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int n, p;
while (cin >> n >> p, n) {
int now = 0,wan=p;
vector<int>person(n,0);
while (true) {
if (wan) {
person[now]++; wan--;
if (person[now] == p) {
cout << now << endl;
break;
}
}
else if (person[now]) {
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, P;
while(true){
scanf("%d%d", &N, &P);
if(N == 0 && P == 0) break;
int c[50], left = P;
fill(c, c + N, 0);
int turn = 0;
while(true){
if(left == 0){
left += c[turn];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> prime(0);
const int M=1000;
void primeGeneration(){
vector<bool> number(M,true);
for(int i=2;i*i<M;i++){
for(int j=i+i;j<=M;j+=i){
number[j]=false;
}
}
for(int i=2;i<M;i++){
if(number[i])prime.push_back(i);
}
};
void factorization(... | #include <iostream>
#include <cmath>
using namespace std;
bool isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int log(int base, int num) {
int temp = 0;
int base1 = base;
while (num / base1 > 0) {
temp += num / base1;
base1 *= base;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RA... | #include <iostream>
#include <map>
using namespace std;
string Alpha = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int l = 52;
int main(void) {
int n, x, d;
int k[1000];
string s;
map<char, int> mp;
for (int i = 0; i < 52; i++) mp[Alpha[i]] = i;
while (1) {
cin >> n;
... | 1 |
#include <iostream>
#include <vector>
using namespace std;
typedef vector<vector<int> > graph;
vector<int> color;
graph G;
bool dfs(int s, int c) {
color[s] = c;
for (int i = 0; i < G[s].size(); i++) {
int v = G[s][i];
if (color[v] == c)
return false;
else if (color[v] == ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; ... | 1 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int N=4010,M=1000010,P=998244353;
const int inf=0x3f3f3f3f;
const int INF=0xcfcfcfcf;
const double eps=1e-6,pi=asin(1)*2;
inline ll read();
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
inline int ADD(int a,int b) { ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int kind[16];
int unkind[16];
for(int i=0; i<n; i++){
int kind_p = 0;
int unkind_p = 0;
int t;
cin>>t;
while(t--){
int a,b;
cin>>a>>b;
if(b) kind_p |=(1<<--a);
else unkind_p|=(1<<--a);
}
kind[i] = kind_p;
unkind[... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
vector<vector<pair<int, int> > > data(n);
for (int i = 0; i < n; i++) {
int sz;
cin >> sz;
data[i].resize(sz);
for (int j = 0; j < sz; j++) {
cin >... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
#define rep(i, j) for(int i=0; i < (int)(j); i++)
using EdgeList = vector<vector<int>>;
// ?????£?????????????????°?????? E ????????£????????????????§£
// O(N + M) N: ????????°, M: ?????°
vector<vector<int>> strongly_connected_components(const E... | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n = 0, m = 0;
vector<vector<int>> g;
vector<bool> vi;
vector<int> comp;
stack<int> post;
vector<pair<int, int>> q;
void input() {
ci... | 1 |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int,int> pii;
const int INF = 1000000000;
int par[10000],rnk[10000];
void init(int n){
for(int i=0;i<n;i++){
par[i] = i;
rnk[i] = 1;
}
}
int find(int x){
if(par[x]==x) return x;
else return par[x]... | #include<bits/stdc++.h>
using namespace std;
struct Edge{
int to,cost;
bool operator<(const Edge&a)const{
return cost>a.cost;
}
};
struct Graph{
Graph(int n):E(n),T(n),N(n){}
vector<vector<Edge>>E,T;
int N;
void add_edge(int a,int b,int c){
E[a].push_back({b,c});
E[b].push_back({a,c});
}
... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++) //0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(rig... | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
const int N=2e5+3;
//string s,p;
//vector<int>v;
//map<in... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef vector<int>vi;
#define pb push_back
#define sc(n) scanf("%d",&n)
#define lsc(n) scanf("%lld",&n)
#define all(x) x.begin(),x.end()
#define rep(i,n) for(i=0LL;i<n;i++)
#define... | 0 |
//include,using,define等
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deq... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <stack>
#include <string>
using namespace std;
int main(){
string s;
while(cin>>s){
if(s.length()==2){
}else if(s.length()==3){
reverse(s.begin(),s.end());
}
cout<<s<<endl;
}
... | 1 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 2200
using namespace std;
int a[N][N],f[N][N],l[N],r[N],b[N],id[N];
int n,m,ans;
char s[N];
int check(int x,int y){
return ((a[x][y]==a[x-1][y])&&(a[x][y-1]==a[x-1][y-1]))||((a[x][y]!=a[x-1][y])&&(a[x][y-1]!=a[x-1][y-1]));
}
bool cmp... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define mod 1000000007
#defin... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
using namespace std;
typedef pair<int, int> P;
int k, a[100000], dist[100000];
vector<int> v[100000];
vector<P> w;
bool b[100000];
void cal(int x, int y){
dist[x] = y;
b[x] = false;
w.push_back(P(y, x));
for(int i... | #include <bits/stdc++.h>
using namespace std;
#define N 100000
#define pb push_back
int n, k, len, a[N + 5], d[N + 5], vis[N + 5], ans;
vector<int> G[N + 5];
struct Cmp {
bool operator () (const int &a, const int &b) const {
return d[a] < d[b];
}
};
priority_queue<int, vector<int>, Cmp> pq;
void dfs1(int u) {
... | 1 |
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n){
if(!n) break;
int a[n];
for(int i=0; i<n; i++){
cin >> a[i];
}
int mx=-99999999;
for(int i=0; i<n; i++){
int sum=0;
for(int j=i; j<n; j++){
... | #include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#i... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII; typedef pair<LL, LL> PLL;
typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<VVI> VVVI;
typedef vector<LL> VLL; typedef vector<VLL> VVLL; ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
while(cin>>n&&n!=0){
int p,a,b,c,d,e,f,s,m;
string l;
vector<pair<double,string> > vpii;
for(int i = 0; i < n; i++){
cin>>l>>p>>a>>b>>c>>d>>e>>f>>s>>m;
int time = a+b+c+d+e;
for(int j ... | 1 |
#include<cstdio>
#include<cctype>
#include<unordered_map>
#include<vector>
#include<queue>
using namespace std;
const int N=1e5,M=2e5,P=N+2*M,inf=0x3f3f3f3f;
typedef pair<int,int> pii;
int n,m,tot;
vector<pii>e[P+1];
int dis[P+1];
int read()
{
int ret=0;
char c=getchar();
while(!isdigit(c)) {
c=getchar();
}
whil... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) fo... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector <ll> A(N);
for (int ii = 0; ii < N; ++ii){
cin >> A[ii];
}
ll ans = 0;
vector <ll> digZero(61);
vector <ll> digOn... | #include<cstdio>
typedef long long LL;
const int N=2003;
const int O=2*N;
int n,m,ans;
int dp[3*N][5*N];
inline LL Pow(LL x,int p) {
if(p==0) return 1;
if(!(p&1)) return Pow(x*x%m,p>>1);
return x*Pow(x*x%m,p>>1)%m;
}
inline void Add(int &x,int y) {
x+=y; if(x>=m) x-=m;
}
int main() {
scanf("%d %d",&n,&m); n*=3;
... | 0 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
#define rep(a,n) for(ll a = 0;a < n;a++)
static const ll INF = 1e15;
static const ll mod = 1e9+7;
template<typename T>
static inline void chmi... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int main() {
fastIO;
int p, q, r;
cin >> p >> q >> r;
cout << (min(p + q, min(q + r, r + p)));
... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,r,k;
cin>>n>>r;
if(n>=10){
k=0;
}else{
k=1000-100*n;
}
cout<<r+k;
} | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
int main(){
int K,T;
cin >> K >> T;
int A[T];
int mx = 0;
for(int i = 0;i < T;i++){
cin >> A[i];
mx = max(mx,A[i]);
}
cout << max(0,mx-1-(K-mx))<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | #include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a... | 1 |
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
scanf("%d",&n);
vector<int>ar(n);
for(auto&e:ar){
scanf("%d",&e);
}
for(int i=n-1;i>0;i--){
pr... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
char s[4]={};
cin>>s;
if(s[0]=='S'){
if(s[1]=='U'){
cout<<7<<endl;
}else{
cout<<1<<endl;
}
}else if(s[0]=='M'){
cout<<6<<endl;
}else if(s[0]=='W'){
cout<<4<<endl;
}else if(s[0]=='F'){
cout<<2<<endl;
}else if(s[0]=='T... | #include<bits/stdc++.h>
using namespace std;
int main()
{ string s;
long long d,sum=0,num;
cin>>s;
long long n=s.size();
for(int i=0 ; i<n ; i++){
d = s[i] - '0';
num = num * 10 + d;
sum+=d;
}
if(num%(sum)==0) cout<< "Yes"<< endl;
if(num%(sum)!=0) cout<< "No"<< endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,M,V,P;
cin>>N>>M>>V>>P;
vector<int> A(N);
for(int &i:A)cin>>i;
sort(A.rbegin(),A.rend());
int ok=0,ng=N;
while(ng-ok>1){
int n=(ok+ng)/2,m=0;
for(int i=0;i<N;i++){
if(i<P-1)m+=M;
else if(i>=n)m+=M;
... | #include <bits/stdc++.h>
template <class T>
inline void read(T &res)
{
char ch; bool flag = false; res = 0;
while (ch = getchar(), !isdigit(ch) && ch != '-');
ch == '-' ? flag = true : res = ch ^ 48;
while (ch = getchar(), isdigit(ch))
res = res * 10 + ch - 48;
flag ? res = -res : 0;
}
template <class T>
inlin... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define ... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int n, a, b, c;
vector<char>l;
while (true){
cin >> n;
if (n == 0){
break;
}
else{
for (int i = 0; i < n; i++){
cin >> a >> b >> c;
if (a == 100 || b == 100 || c == 100){
l.push_back('A');
}
else if (a + b >= 180... | 1 |
#include <bits/stdc++.h>
using namespace std;
int soredake(int point, int kazu, int bonasu, int goal) {
int tokukazu = goal / point;
if (goal % point > 0) {
tokukazu++;
}
if (tokukazu > kazu) {
tokukazu = kazu;
}
return tokukazu;
}
int search(vector<vector<int>> questions, int goal) {
int minim... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int d,g;cin >> d >> g;
vector<int> p(10),c(10);
rep(i,d) cin >> p[i] >> c[i];
int ind = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | /*
Author : Devil088
*/
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define sep cout<<"\n";
#define Yes cout<<"Yes\n";
#define No cout<<"No\n";
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
inline string shift(string s){
int n = s.length();
string r = "";
r+=s[n-1];
for(int i=0;i<n-1;... | 1 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647 -> 10桁
// MAX ll 9,223,372,036,854,775,807 -> 19桁
// MAX O(n) 10^18 -> 18回
// double pi = M_PI or acos(-1)
// printf("%.10f\n... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int> a;
for(int i=0;i<n;i++){
int p;
cin>>p;
a[p]++;
}
bool ok=true;
for(auto x:a){
if(x.second>=2)ok=false;
}
if(ok){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
} | 1 |
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAX=1e4+10;
const int mod=1e9+7;
void fun(int *cnt,int n){
for(int i=2;i<=n;i++){
while(n%i==0){
cnt[i]++;
n/=i;
}
}
}
ll solve(int n){
int cnt[1001]={0};
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
long long ans = 1;
cin >> n;
vector<int> fact(10000); //factor container
for(int j = 2; j<=n;j++){
long long num = j;
for (int i = 2; i <= num; i++) {
while (num%i == 0) { // 素数で割り切れなくなるまで割っていく
fact.at(i)++; //... | 1 |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 1 |
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#define pi 3.14159
using namespace std;
int main() {
string str;
int i;
while(getline(cin, str)) {
for(i = 0; i < 26; i++) {
for(int j = 0; j < str.size(); j++) {
if(str[j] != ' ' && str[j] != '.') {
if(str[j] !... | #include<bits/stdc++.h>
using namespace std;
int main(){
string sa;
while(getline(cin,sa)){
for(int j=0;j<26;j++){
int a=sa.size();
for(int i=0;i<a;i++){
if(sa[i]>='a'&&sa[i]<='z'){
sa[i]+=1;
if(sa[i]>'z'){
sa[i]-=26;
}
}
}
size_t z=sa.find("this");
size_t za=sa.find("t... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,t=0;
cin>>n;
int arr[2*n];
priority_queue<int,vector<int>,greater<int>> q;
for(int i=0;i<2*n;i++)
{
int k;
cin>>k;
q.push(k);
}
for(int i=0;i<n;i++)
{
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
if (A > B) {
exit (1);
}
if (A < 9999 || B > 100000) {
exit (1);
}
int sum = 0;
for (int i = A ; i <= B ; i++) {
string k;
k = to_string (i);
int kl = (int)(k.length ());
string k1 = ... | 0 |
#include <iostream>
#include <vector>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
using namespace std;
const int kInfinity = 0x3F3F3F3F;
const int kNil = -1;
const int kMaxV = 10010;
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) {... | //kruskal tree
#include <cstdio>
#include <algorithm>
using namespace std;
#define M 100000
int parent[M],a[M],b[M];
pair<int,int>node[M];
int root(int a){return parent[a]==a?a:parent[a]=root(parent[a]);}
int unite(int a,int b){
int x=root(a),y=root(b);
if(x==y)return 0;
parent[x]=y;
return 1;
}
int main(){
int i,... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | /*
* @Author: wxyww
* @Date: 2020-03-31 09:07:10
* @Last Modified time: 2020-03-31 09:20:33
*/
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<bitset>
#include<cstring>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
using namespace std;
typedef long ... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int n, l;
cin >> n >> l;
int r = n + l - 1;
int eat;
if (r <= 0) eat = r;
else if (l >= 0) eat = l;
else eat = 0;
cout << (r + ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
const int INF = 1001001001;
int main() {
int n, l; cin >> n >> l;
int a[n];
int sum0 = 0;
rep(i, n){
a[i] = i+l;
sum0 += a[i];
}
int s = INF... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #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--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll v[... | 0 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<bitset>
#define MN 100
#define ull unsigned long long
#define F(a,b,c,d) ((a>b||c>d)?ans:f[num[a][b]][num2[c][d]])
#define N 65535
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getch... | #include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp mak... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int required = 1,extended = a;
while(extended < b){
required++;
extended += a-1;
}
if(b == 1){
cout<<0;
}else{
cout<<required;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
int const N = 1e6+5;
int const mod = 1e9+7;
using namespace std;
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
ll counter=0;
void prime_fuct(ll x){
for (ll i = 2; i * i <= x; i++){
if(x%i==0){
while (x % i == 0)... | 0 |
#include <iostream>
#include <numeric>
#include <math.h>
#include <algorithm>
#include <float.h>
#include <limits>
#include <vector>
#include <string.h>
#include <iomanip>
#define rep(i,a,n) for(ll int (i) = (a);(i) < (n);(i)++)
#define urep(i,a,n) for(ll int (i) = (a);(i) > (n);(i)--)
#define MOD 1000000007
#define ... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
while(n != 0){
int a[12][12] ={};
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin >> a[i][j];
a[i][n] += a[i][j];
a[n][j] += a[i][j];
}
a[n][n] += a[i][n];
}
for(int i=0;i<=n;i++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 0 |
#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (... | #include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b... | 1 |
#include<bits/stdc++.h>
#define rep(i,a) for(int (i)=0; (i)<(a); (i)++)
#define rrep(i,a) for(int (i)=a-1; (i)>=(0); (i)--)
#define rep2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
using namespace std;
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for(ll i = n-1; i >= 0LL; i--)
#define FOR(i, n, m) for(ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define eb emplace_back
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 233;
char s[maxn];
int op[maxn];
int main()
{
int n;cin>>n;
scanf("%s",s+1);... | #include <bits/stdc++.h>
#define FOR(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define FORUL(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define FORULE(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define FOREACH(it, X) for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); it++)
#if defined(_MSC_VER) || __c... | 1 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
using namespace std;
#define N 300100
const int mod=1e9+7;
int a[8][2],f[N][8];
char s[N];
int main()
{
a[0][0]=1; a[0][1]=2;
a[1][0]=3; a[1][1]=4;
a[2][0]=5; a[2][1]=6;
a[3][0]=a[3][1]=1;
a[4][0]=1; a[4][1]=2;
a[5][0]=7; a[5][1]=2;
a[6][0]=a[6][1]=6;
a[7][0]=a[7][1]=5;
scanf("%s",s)... | 0 |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif
#define sz(x) ((int) (x).size())
#define TASK "text"
const int inf = (int) 1.01e9;
con... | #include<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
using namespace std;
const ll MOD=1e9+7;
int n;
ll f[300005][9];
char s[300005];
int main()
{
scanf("%s",s+1);
n=(int)strlen(s+1);
f[0][1]=1;
for(int i=1;i<=n;i++)
{
if(s[i]!='1')
{
f[i][2]+=f[i-1][1]+f[i-1][3]+f[i-1][4];
f[i][3]... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n; cin >> n;
vector<ll> a(n); cin >> a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int saidai = 0;
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int M;
cin >> M;
vector<string> t(M);
for (int i = 0; i < M; i++) {
cin >> t.at(i);
}
f... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int n,flag=0,result=0;
cin>>s;
for(long int i=s.size()-1;i>=0;i--){
n=s[i]-'0'+flag;
if(n<(10-n) || (n==5 && s[i-1]<'5')){
flag=0;
result+=n;
}
else{
flag=1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 10;
const ll INFLL = 3e18;
int main(){
ios_base :: sync_with_stdio(false);
cin.tie(0);
int ans = 1;
int n;
cin >> n;
for(int i = 1 ; i*i <= n ; i ++)
ans = i*i;
cout << ans << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node {
int key;
node *left, *right, *parent;
};
node *root, *NIL;
node* minimum(node *x) {
while( x ->left != NIL ) x = x->left;
return x;
}
node * successor( node *x ) {
if( x->right != NIL ) return minimum(x->right);
... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string tmp;
int n;
cin>>n;
for (int i=0; i<n; i++) {
getline(cin,tmp);
while (tmp=="") getline(cin,tmp);
while (tmp.find("Hoshino")!=string::npos) {
tmp.replace(tmp.find("Hoshino"),7,"Hoshina");
... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll n;
cin >> n;... | #include<iostream>
using namespace std;
int main(){
int a;
cin>>a;
cout<<a/3;
return 0;
}
| 1 |
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x.size())
#define FOR(x,y,z) for(int x = y; x <= z; x++)
#define int long long
const int N = 1e5 + 2, inf = 1e18;
int32_t main(){
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, m;
cin >> n >> m;
if(n > m)
... | 1 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #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 <stack>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii v... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
/*int main(int argc, char **argv)
{
int a, b, c, d, e;
std::cin >> a >> b >> c >> d >> e;
std::cout << std::min(a, std::min(b, c)) + std::min(d, e) - 50 << std::endl;
return 0;
}*/
/*int main()
{
int l, a, b, c, d;
std::cin >> l >> a >> b >> c >> d;
int... | #include <cstdio>
#include <functional>
#include <algorithm>
using namespace std;
int p[10];
int main(){
for(int i = 0; i < 2; i++){
int ans = 0;
for(int j = 0; j < 10; j++) scanf("%d", &p[j]);
sort(p,p+10,greater<int>());
for(int j = 0; j < 3; j++) ans += p[j];
if(i == 0) printf("%d", ans);
else printf(... | 1 |
#include <stdio.h>
int main(){
while(1){
int n,m,a[21][21],px=10,py=10;
scanf("%d",&n);
if(n==0) return 0;
for(int i=0;i<21;i++) for(int j=0;j<21;j++) a[i][j]=0;
for(int i=0;i<n;i++){
int x,y;
scanf("%d %d",&x,&y);
a[x][y]=1;
}
... | /*+lmake
* STD = c++14
* DEFINE += WAAUTOMATON
*/
#include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#ifdef WAAUTOMATON
#define debug(args...) {dbg,args; cerr<<endl;}
#else
#define debug(args...) // Just strip off all debug tokens
#endif
struct de... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template<typename T>
#define TTF template<typename T, typename F>
#define ET(T) typename T::value_type
TT inline T sq(T x){return x*x;}
TT inline T In(){T x;cin>>x;return x;}
TT inline ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 1 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=300+10;
const int MOD=998244353;
int n,a[N],dp[N][N*N],sum;
signed main()
{
cin>>n;
for (int i=1;i<=n;i++) scanf("%lld",&a[i]),sum+=a[i];
dp[0][0]=1;
for (int i=1;i<=n;i++)
for (int j=0;j<=sum;j++) {
dp[i][j]=dp[i-1][j];
if (j... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include <iostream>
//#include <vector>
#include <string>
//#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;... | #include <iostream>
#include <string>
using namespace std;
int main(){
int A, B;
string S;
cin >> A >> B >> S;
for (int i = 0; i < S.size(); i++){
if (i==A){
if (S[i]!='-'){
printf("No\n");
return 0;
}
}else if (S[i]-'0' > 9 || S[i]-'0' < 0){
printf("No\n");
re... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
int n, m;
int main(){
scanf("%d%d", &n, &m);
rep(i,m) printf("%d %d\n", i+1, n-i-(~n&1 && n<=i*4+2));
} | #include<iostream>
int main(){
int N,M;
std::cin>>N>>M;
int a,b;
if(M%2==0){
a=M/2;
b=M/2;
}else{
a=M/2;
b=M-a;
}
for(int i=1;i<=a;++i){
std::cout<<i<<" "<<2*a+2-i<<std::endl;
}
for(int i=1;i<=b;++i){
std::cout<<i+2*a+1<<" "<<M*2+2-i<<s... | 1 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
const int N = (int) 1e6 + 7;
int n, sumtop;
struct T {
int top;
int mn;
};
bool cmp1(T a, T b) {
return a.mn > b.mn;
}
bool cmp2(T a, T b)... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; ++i)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define vll vector<ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
cout << c << " " << a << " " << b << endl;
return 0;
} | #include<iostream>
int main(void){
int p, q, r;
std::cin >> p >> q >> r;
int ans;
ans = std::min(p+q, p+r);
ans = std::min(ans, q+r);
std::cout << ans << std::endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <utility>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <climits>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pa... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define vll v... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
#define PB push_back
#define MP make_pair
const int MAX_N = 500... | #include <bits/stdc++.h>
using namespace std;
int MAX_N=262144*2;
vector<int64_t> seg(MAX_N*2-1);
int64_t qu(int a,int b,int k,int l, int r){
if(r<=a||b<=l){
return 0;
}
else if(a<=l&&r<=b){
return seg[k];
}
else{
int64_t X=qu(a,b,k*2+1,l,(l+r)/2);
int64_t Y=qu(a,b,k*2+2,(l+r)/2,r);
retur... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... | 0 |
#include <iostream>
using namespace std;
int main() {
string s;
bool pri = 0;
cin >> s;
for (int i = 0; i < s.length(); ++i) {
if(s[i] == 'A'){
if(i+1 != s.length() && s[i+1] == 'C'){
cout << "Yes";
pri = 1;
break;
}
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
string S;
cin>>S;
if(S.find("AC")!=string::npos ){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
return 0;
} | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> outp;
int icn;
int icd;
int g;
vector<int> ice;
for(g = 0;;g++){
vector<int> ice(10,0);
cin >> icn;
if(icn == 0){
break;
}else{
for(int a = 0;a< icn;a++){
cin >> icd;
ice[icd] += 1;
... | #include<iostream>
#include<string>
#include<vector>
#include<map>
using namespace std;
int main(void){
int a,n;
while(1){
map<int,string> str;
cin >> n;
if(n==0)break;
for(a=0;a<n;a++){
int b;
cin >> b;
str[b].push_back('*');
}
for(a=0;a<=9;a++){
if(str.size()>0)cout << str[a] << endl;
e... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 99824... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int lmax = *max_element(L.begin(), L.end());
int rmin = *min_element(R.begin(), R.end());
int d = rmin - lmax + ... | 0 |
#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 REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP mak... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<string> vstr;
t... | 0 |
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <algorithm>
#include <stdio.h>
int main(void){
int x,y,z;
std::cin >> x >> y >> z;
std::cout << z << " " << x << " " << y;
return 0;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#includ... | 0 |
#include<stdio.h>
int main()
{
int a,b,c,n;
scanf("%d %d %d",&n,&a,&b);
if(n==2){
for (int i=1; i < a ;i++) {
if(a%i+b%i==0){
printf("%d\n",i);
}
}
}else if(n==3){
scanf("%d",&c);
for (int i=1; i < a ;i++) {
if(a%i+b%i+c%i==0){
printf("%d\n",i);
}
}
}
return 0;
} | #include "bits/stdc++.h"
#define rep(i,a,n) for(int i = a;i < n;i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int main(){
int n,memo;
priority_queue<int,vector<int>,greater<int> > que;
cin >> n;
int a[n];
rep(i,0,n){
cin >> a[i];
}
sort(a,... | 1 |
#include <iostream>
#include <map>
using namespace std;
int main()
{
int n;
cin >> n;
map<int, int> mp;
for(int i = 0; i < n; i++){
int a;
cin >> a;
mp[a]++;
}
int t = (1 << 30);
int ans = 0;
for(auto itr = mp.rbegin(); itr != mp.rend(); itr++){
int a = i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N = pow(10,9)+7;
vector<ll> ans(61,0);
ll n;
cin >> n;
for(int i=0; i<n; i++){
ll a;
cin >> a;
int count=0;
while(a!=0){
ans.at(count) += a%2;
a /= 2;
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.