code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 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--)
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[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 1;
const ll mo = 1000000007;
int main()
{
ll n , m ;
cin >> n >> m ;
vector<ll> a(n);
rep(i, n){
cin >> a[i];
}
vector<ll> b(m);
rep(i, m){
cin >> b[i];
}
sort(a.rbegin(),a.rend());
sort(... | 0 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
string str;
while(cin >> str){
vector<char> v;
int ci, cj, co;
int lv = 0;
for(int i=0; i<str.size(); ++i) v.push_back(str[i]);
ci = 0;
cj = 0;
co = 0;
for(int i=0; i<v.size(); ++i){
if(v[i] ... | #include <bits/stdc++.h>
using namespace std;
int CountOfJOI[3];
const string target = "JOI";
int main() {
int len, curPos, k;
string input;
k = 0;
cin >> input;
len = input.size();
curPos = 0;
while (curPos < len) {
if (input[curPos] != 'J') {
++curPos;
continue;
}
memset(CountOfJOI, 0, sizeof(C... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
while(n--){
int runner = 0, out = 0, score = 0;
while(out < 3){
string e;
cin >> e;
if(e == "HIT"){
runner = (runner << 1) + 1;
if(runner & 0xf8){ ++score; }
}else if(e == "HOMERUN"){
++score;
if... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 998244353;
const i64 INF = 998244353;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
x ... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
using namespace s... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main() {
int N,T; cin>>N>>T;
vi time(N);
rep... | #include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
#define get(A,B,C,D) (rui[B][D]-rui[A-1][D]-rui[B][C-1]+rui[A-1][C-1])
short dp[102][102][102][102];
int map[100][100];
short rui[101][101];
int main()
{
int mx,my;
scanf("%d%d",&mx,&my);
int sx,sy;
for(int i=0;i<mx;i++)
{
for(int j=0;j<... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int>c(N, -1);
int s, t;
int ans = 0;
bool b = true;
for (int i = 0; i < M; i++) {
cin >> s;
if (c[s - 1] == -1){
cin >> c[s - 1];
}else{
cin >> t;
... | #include <bits/stdc++.h>
using namespace std;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<bool>> a(n, vector<bool>(m));
for (int i = 0; i < n; i++) {
string foo;
cin >> foo;
for ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip> //cout << fixed << setprecision(15) << x << endl;
using namespace std;
typedef long long ll;
const ll INF = 1e... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define MOD 1000000007
#define ms(a,x) memset(a,x,sizeof(a))
int main()
{
run;
ll n,i,ans=0;
cin>>n;
ll a[n], b[n+1]={0};
for(i=0;i<n;i++)
{
... | #include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
bool is_prime(int n) {
for (int p = 2; p * p <= n; p++) {
if (n % p == 0) {
return false;
}
}
return true;
}
vector<pair<int, int>> factorize(int n) {
vector<pair<int, int>> result;
for (int p = 2;... | 0 |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
bool block[6][110][110];
bool visit[110][110];
int main(){
int w, h;
int xs, ys, xg, yg;
int n, c, d, x, y;
while(scanf("%d%d%d%d%d%d%d", &w, &h, &xs, &ys, &xg, &yg, &n) == 7){
memset(block, 0, sizeof block);
memset(visit, 0, sizeof vi... | #include <iostream>
#include <string>
using namespace std;
string ans;
int w,h,gx,gy;
int map[110][110];
int dx_[4] = {0,1,0,-1};
int dy_[4] = {1,0,-1,0};
int dx[2][8] = {
{0,1,2,3,0,1,2,3},
{0,1,0,1,0,1,0,1}
};
int dy[2][8] = {
{0,0,0,0,1,1,1,1},
{0,0,1,1,2,2,3,3},
};
void solve(int x,int y,int color){
if( ans =... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<int>> a(h,vector<int>(w,0));
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
cin >> a[i][j];
}
}
vector<tuple<int,int,int,int>> ans;
for(int i=0;i<h;++i){
for(int j=0;j<w-1;++j){
if(a[i][j]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1000000007;
//const int mod = 998244353;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n];
for(ll i = 0; i ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
const long long MOD = 1000000007;
long long ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int gcd(int x, int y) { return (x % y)? gcd(y, x % y): y; } //ๆๅคงๅ
ฌ็ดๆฐ
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } //ๆๅฐๅ
ฌๅๆฐ
using Graph = vector<vector<ll>>;
ll inf=300000000000000000;
const do... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragm... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
int n;
cin>>n;
vector<int> l(n*2);
rep(i,n*2) cin>>l.at(i);
sort(l.begin(),l.end());
int ans=0;
rep(i,n){
ans+=l.at(2*i);
}
cout<<ans;
} |
// C - 2D Plane 2N Points
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
pair<int, int> red[100];
pair<int, int> blue[100];
bool used_red[100];
int main() {
int N;
cin >> N;
for (int i=0; i<N; i... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
const int maxn = 1e5 + 1e2;
int bipart[maxn];
int color[maxn];
std::vector<int> adj[maxn];
int main(){
std::ios::sync_with_stdio(false);
int v, e;
std::cin >> v >> e;
for(int i = 0; i < e; i++){
int f, s;
std::cin >> f >> s;
f--, s--;
adj[f].push_back(s);... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
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) <... | 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<complex>
#define rep(i, a, n) for(int i=a;i<n;i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define R long double
#define P ... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n, i, j, l,k;
int A[101];
int q[101][101];
cin >> n;
for (i = 1; i < n+1; i++) {
cin >> A[i - 1] >> A[i];
}
for (i = 0; i < n + 1; i++) q[i][i] = 0;
for (l = 2; l < n + 1; l++) {
for (i = 1; i < n - l + 2; i++) {
j = i + l - 1... | 0 |
//Author: Fuadul Hasan(fuadul202@gmail.com)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
int a,b;
cin>>a>>b;
cout<<max(a+(a-1),max(b+(b-1),a+b))<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
int main() {
int a,b,ans;
cin >> a >> b;
ans = (a==b ? 2*a : 2*max(a,b)-1);
cout << ans << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
/* ใกใใใจ่ใใฆใใใฃใฆๅฎ่ฃ
*/
ll amari(ll a){
if(abs(a) % 2 == 0) return 0;
else return 1;
}
ll sho(ll a){
if(a<0 && amari(a)==1) return (a / (-2)) + 1;
else return a / (-2);
}
stack<char> base_min2(ll a){
stack<cha... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
for(int i=0;i<8;i++){
string ans;
ans+=S.at(0);
int sum=S.at(0)-'0';
for(int j=0;j<3;j++){
if(i>>j&1){
sum+=S.at(j+1)-'0';
ans+="+";
ans+=S.at(j+1);
}
else{
sum-=S.a... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
int N, M, p[1001], s[1001 * 1001];
int main(){
while(scanf("%d%d", &N, &M) != EOF && (N|M)){
for(int x = 0; x < N; x++){
scanf("%d", p+x);
}
p[N++] = 0;
for(int x = 0; x < N; x++){
for(int y = 0; y ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
in... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
ll dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
int main(void){
ll h,w;
cin>>h>>w;
string s[h];
rep(0,i,h)cin>>s[i];
ll ans=0;
vector<vector<bool>>d(h,vector<bool>(w,false));
rep(0,i,h){
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
ll counterb=0,counterw=0;
void dfs(ll x,ll y,ll H, ll W,vector<vector<bool>> &field,vector<vector<bool>> &check){
check[x][y]=1;
if(field[x][y]==1){counterb++;}
if(field[x][y]=... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template<class T>
using reverse_priority_queue = priority_queue<T, vector<T>, great... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define int long long
const int maxn = 310;
const ll inf = 1e18+10;
//const int mod = 998244353;
//const int mod = 1e9+7;
int n, m;
int a[maxn][maxn], ptr[maxn], cnt[maxn];
bool mark[maxn];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
int main(){
LL D; cin >> D;
if(D%9 != 0) return cout << 0 << endl, 0;
D /= 9;
LL ans = 0;
repp(i,1,19){
LL z = 1;
... | #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 200005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
long long int ans = 0;
if(x == y) ans = 0;
else if(x == 0){
ans = abs(y);
if(y < 0) ans += 1;
}
else if(y == 0){
ans = abs(x);
if(x > 0) ans += 1;
}
// different sign
... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
typedef unsigned long long ull;
#define vvi std::vector<std::vector<int> >
#define vvs std::vector<std::vector<string... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | // #pragma GCC target("avx") // CPU ๅฆ็ไธฆๅๅ
// #pragma GCC optimize("O3") // CPU ๅฆ็ไธฆๅๅ
// #pragma GCC optimize("unroll-loops") // ๆกไปถๅฆ็ใฎๅผใณๅบใใๆธใใ
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int m,nmin,nmax;
while (cin >> m >> nmin >> nmax, m) {
vector<int> p(m);
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
int res = 0;
int gap = 0;
for (int i = nmin; i <= nmax; ++i) {
if (p[i-1] - p[i] >=... | #include <iostream>
#include <string>
using namespace std;
const int MOD = 1000000007;
int solve(const string& s){
const int N = s.size()/2;
long long res = 1;
int numS = 0, sumS = 0, inc = 0;
for(auto& c : s){
if(c == 'B'){
if(inc%2 == 0){
++inc;
+... | 0 |
#include <iostream>
#include <algorithm>
int main()
{
int n;
int64_t a, b;
std::cin >> n >> a >> b;
int x;
std::cin >> x;
int64_t sum = 0;
for (int i = 1; i < n; ++i)
{
int y;
std::cin >> y;
sum += std::min((y - x) * a, b);
x = y;
}
std::cout <... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define mod 1000000007
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define all(x) x.begin(),x.end()
#define ff first
#defi... | #include<bits/stdc++.h>
using namespace std;
const int S=(1<<20)+5;
char buf[S],*H,*T;
inline char Get()
{
if(H==T) T=(H=buf)+fread(buf,1,S,stdin);
if(H==T) return -1;return *H++;
}
inline int read()
{
int x=0;char c=Get();
while(!isdigit(c)) c=Get();
while(isdigit(c)) x=x*10+c-'0',c=Get();
ret... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
const int MOD=1e9+7;
//const int MOD=998244353;
const long long LINF=1e18;
#define int long long
//template
/*
ๅ้กใฎ่จใๆใ
//0ใฎ่กใๅ
ใ0ใใใชใใฃใใ0ใซใใฆans++;
0ใๆ นใจใใๆ นไปใๆจใ่ใใ
ๅ้จๅๆ นไปใๆจใฎๆทฑใใ(ๆ นใฎๆทฑใใ0ใจใใฆ๏ผKไปฅไธใซใชใใใใซๅ่งฃใใใจใๆๅฐใงใใใคใซๅ่งฃใใชใใจใใใชใใ
ใใใฏ่ใใๆฑบใใฆใใใฐใใใใ
*/
//main
signed main... | #include <iostream>
#include <algorithm>
using namespace std;
int A[110], ans[110];
int main() {
int N, M;
cin >> N >> M;
int cnt=0;
for(int i=0; i<M; ++i){
cin >> A[i];
cnt += A[i]%2;
}
if(cnt>2){
cout << "Impossible" << endl;
return 0;
}
if(cnt>0){
bool flag=false;
for(int i=0; i<M; ++i){
if(... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main(){
ll n,m,x,y;
cin>>n>>m>>x>>y;
ll a_max=-101;
ll b_min=101;
ll tmp;
rep(i,n){
cin>>tmp;
a_max=std::max(a_max, tmp);
}
rep(i,m... | #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 n,a,b,c,d,e;
cin>>n>>a>>b>>c>>d>>e;
ll mi=min({a,b,c,d,e});
ll x=(n+mi-1)/mi-1;
cout<<x+5<<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int di[4] = {0, -1, 0, 1};
int dj[4] = {1, 0, -1, 0};
void game(int n, int& ans, int ni, int nj, int gi, int gj, vector<vector<int> >& table){
if(ni == gi && nj == gj){
if(ans == -1) ans = n;
else ans = min(ans, n);
return;
}else if(n == 10... | #include <cstdio>
#include <vector>
using namespace std;
class Edge{
public:
int from,to,cost;
Edge(int f,int t,int c){
from = f;
to = t;
cost = c;
}
void swap(){
int a = from;
from = to;
to = a;
}
};
vector<Edge> edge;
int n,m;
const int INF = 999999999;
int solve(int s){
int* d = new int[n + 1... | 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"
... | #ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define pii pair<int , int>
#define mp make_pair
#define fi first
#define se second
const int MAXN = 2e5 + 10;
int pc;
int pr[MAXN] , f[MAXN];
LL A[MAXN] , B[MAXN];
template <typename T> inline v... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<numeric>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int su... | #include <iostream>
using namespace std;
int main()
{
double n, m;
int d;
cin >> n >> m >> d;
double ans = 1.0;
if (d == 0) {
ans *= m - 1;
ans /= n;
}else{
ans = 2.0 * (n - d);
ans *= m - 1;
ans /= n * n;
}
printf("%.10f\n", ans);
return 0;
} | 0 |
#include<stdio.h>
#include<algorithm>
using namespace std;
char str[110];
int b[110];
int main(){
int a;
while(scanf("%d",&a),a){
for(int i=0;i<a;i++)scanf("%d",b+i);
scanf("%s",str);
for(int i=0;str[i];i++){
int p=0;
if('a'<=str[i]&&str[i]<='z')p=str[i]-'a';
else p=str[i]-'A'+26;
p-=b[i%a];
if(p... | #include <iostream>
#include <string>
using namespace std;
char byte_minus(char ch, int num)
{
if ( 97 <= ch && ch <= 122 )
{
if ( ch - 97 >= num )
{
return ch - num;
}
else
{
return byte_minus('Z', num - (ch - 96) );
}
}
else
{
if ( ch - 65 >= num )
{
return... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include<iostream>
#include<algorithm>
#include <string>
using namespace std;
int main() {
int a, b, c, d, n = 0, ans = 0, ans2 = 0;
string s;
cin >>s;
s.pop_back();
s.pop_back();
s.pop_back();
s.pop_back();
s.pop_back();
s.pop_back();
s.pop_back();
s.pop_back();
cout << s << endl;
} | 1 |
#include <stdio.h>
int main()
{
int a[101],n,cou;
scanf("%d",&n);
for(cou=1;cou<=n;cou++){
scanf("%d",&a[cou]);
}
for(cou=n;cou>=1;cou--){
printf("%d",a[cou]);
if(cou==1){
break;
}
printf(" ");
}
printf("\n");
return 0;
} | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#i... | 0 |
// AOJ ITP 1_5_D
#include<cstdio>
void call( int n )
{
int i = 1;
do
{
int x = i;
if( x % 3 == 0 )
printf( " %d", i );
else
{
do
{
if( x % 10 == 3 )
{
printf( " %d", i );
break;
}
x /= 10;
} while( x );
}
}while( ++i <= n );
puts("");
return;
}
int main()
{
... | #include<iostream>
using namespace std;
int main(){
int n,k,l,m,o;
cin>>n;
for(int i=3;i<=n;i++){
k=i%10;
l=i/1000;
m=i/100%10;
o=i/10%10;
if(i%3==0){
cout<<" "<<i;
}else if(k==3 || l==3 || m==3 || o==3){
cout<<" "<<i;
}
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
const int mod=1e9+7;
int... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int mod=1000000007;
const int INF=1001001001... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll x = 1e9 + 7;
int main() {
int n;
cin >> n;
if ((n-7) % 10 == 0) {
cout << "Yes" << endl;
return 0;
}
n /= 10;
if ((n-7) % 10 == 0) {
cout << "Yes" << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
bool ok = false;
if (s[0] == '7')
ok = true;
if (s[1] == '7')
ok = true;
if (s[2] == '7')
ok = true;
if (ok) {
cout << "Yes" << endl;
... | 1 |
#include <iostream>
using namespace std;
int n;
int A[100000];
int main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>A[i];
int x=A[n-1];
int j=A[0]<x?1:0;
for(int i=1;i<n-1;i++)
{
if (A[i]<=x)
{
int aj=A[j];
A[j]=A[i];
A[i]=aj;
j++;
}
}
A[n-1]=A[j];
A[j]=x;
for (int i=0;i<j;i++)
{
if (i) cout <<... | #include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<cmath>
#include<list>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
typedef long long ll;
const int maxn = 100000 + 8;
int n,a[maxn];
int Partition(int a[],int p... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mn=2e6+10;
const ll mod=998244353;
ll inv(ll x){
ll ans=1;
for(ll i=mod-2;i;i>>=1,x=x*x%mod)if(i&1)ans=ans*x%mod;
return ans;
}
ll fact[mn];
ll ch(ll n,ll k){
if(k<0||k>n)return 0;
return fact[n]*inv(fact[k])%mod*inv(fact[... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double n,m,d,ans;
cin >> n >> m >> d;
ans=0;
if(d != 0){
for(int i=0;i<m-1;i++){
ans+=(2*(n-d))/(n*n);
}
}
else{
for(int i=0;i<m-1;i++){
ans+=(n-d)/(n*n);
}
}
cout<<fixed<<setprecision(20)<<ans<<endl;
return 0;
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i+... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,M;
cin>>N;
vector<string>S(N);
for(int i=0;i<=N-1;i++){
cin>>S[i];
}
cin>>M;
vector<string>T(M);
for(int i=0;i<=M-1;i++){
cin>>T[i];
}
int countplus=0;
int countminus=0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//้
ๅไปฅๅคใฎๅ
ฅๅใๅใๅใ
vo... | #include <iostream>
#include<math.h>
#include<string>
#include<iomanip>
#include <limits>
using namespace std;
int main()
{
long r,g,b; cin>>r>>g;
b=(g*2)-r;
cout<<b;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<tuple>
#include<map>
#include<bitset>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int N, M;
cin >> N;
vector<string> vec1(N);
for (int i=0; i<N; i++){
cin >> vec1.at(i);
}
cin >> M;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll min_move = min({a,b... | #include<iostream>
using namespace std;
void swap(int *a,int *b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(void){
int a,b,c;
cin >> a >> b >> c;
swap(&a,&b);
swap(&a,&c);
cout << a <<" "<< b << " " << c << endl;
return 0;
}
| 0 |
/**
* created: 24.08.2020 21:32:00
**/
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
using ll = long long;
using P = pair<int,int>;
// #define endl '\n'
#define int long long
#define rep(i,n) for (int i = 0; i < (int)(n); i++... | #include<bits/stdc++.h>
using namespace std;
int main( void )
{
int a;
cin >> a;
cout << a + pow( a, 2 ) + pow( a, 3 ) << endl;
} | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,... | #include<bits/stdc++.h>
#define INF 10000000000ll
#define ll long long
using namespace std;
signed main(){
ll n,m,x,y,a,b;
cin>>n>>m>>x>>y;
for(int i=0;i<n;i++){
cin>>a;
x = max(a,x);
}
for(int i=0;i<m;i++){
cin>>b;
y = min(y,b);
}
if(y > x){
cout<<"No War\n";
}else{
cout<<"War\n... | 1 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
int x,y;
cin>>x>>y;
vector<long long> score={300000,200000,100000,0};
long long ans=0;
ans+=score.at(min(3,x-1));
ans+=score.at(min(3,y-1));
if(x==1 && y==1) ans+=400000;
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int num[maxn], x[maxn];
int main()
{
int n, s;
scanf("%d%d", &n, &s);
for(int i = 1; i <= n; i ++)
{
scanf("%d%d",x+i,num+i);
}
int l=1,r=n;
long long ans=0;
long long sum=0;
int nows;
bool flag;
... | 0 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typed... | 0 |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdlib>
#include<set>
#include<vector>
#include<sstream>
#include<queue>
#include <iomanip>
#include<unordered_set>
#include <stack>
#include ... | #include<cstdio>
#include<iostream>
using namespace std;
int main(){
int n,d,v;
cin >> n >> d >> v;
double time = (double)n/v;
if(time <= d) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<l... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int w;
cin>>S>>w;
int i=0;
while(i<S.size()){
cout<<S[i];
i+=w;
}
cout<<endl;
}
| 1 |
#include <iostream>
#include <string>
using namespace std;
long long solve(const string& S, int k){
int dst = 0;
long long res = 0;
long long cnt = 0;
int m = 0;
int c = 0;
for(int i=0;i<S.size();i++){
while(dst < S.size() && dst - i < k){
if(S[dst] == 'M') ++m;
... | #include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace std;
using ll = long long;
int main() {
int N, Q; cin >> N >> Q;
atcoder::fenwick_tree<ll> bit(N+1);
for (int i=1;i<=N;i++) {
int a; cin >> a;
bit.add(i, a);
}
for (int q=0; q<Q; q++) {
int d, l, r;
c... | 0 |
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <map>
#define INF 100000000
#define rep(i,a) for(int i=0;i<(a);i++)
using namespace std;
typedef long long ll;
int main(){
int hosei[]={0,4,0,1,4,6,2,4,0,3,5... | #include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main(int argc, char const* argv[])
{
int n,m;
int place[1000];
while( cin >> n >> m && n != 0 ){
for( int i = 0;i < 1000;i++ ) place[i] = 0;
for( int i = 0;i < n;i++ ) cin >> place[i];
sort( place, place + n, greater<in... | 0 |
#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
int h,w,s;
while(true){
cin>>h>>w;
if(h==0&&w==0)
break;
bool t=true;
s=h*h+w*w;
h++;
while(true){
if(h*h>=s-h*h)
break;
if(s==h*h+(int)sqrt((double)s-h*h+0.0)*(int)sqrt((double)s-h*h+0.0)){
t=false;
break;
}
... | #include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
struct rect{
int w,h,v;
bool operator<(const rect& a) const{
return v==a.v ? h < a.h : v < a.v;
}
};
int main(){
int i,j,k,w,h;
vector <rect> rs;
rect r;
for(i=1;i<151;i++){
for(j=1;j<i;j++){
r... | 1 |
# 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;
template <typename T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
# define int long long
typedef long long... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,ans;
cin >> a >> b;
if(a > b){
ans = a;
a--;
}else{
ans = b;
b--;
}
if(a > b){
ans += a;
a--;
}else{
ans += b;
b--;
}
cout <<ans;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll a[114514],b[114514];
int main(){
ll n,inf=1e15;
cin>>n;
b[n+1]=inf;
for(int i=1;i<=n;i++){
cin>>a[i];
b[i]=-inf;
}
ll ans=1;
b[1]=a[1];
b[0]=inf;
b[n+1]=-inf;
for(int i=2;i<=n;i++){
if(b[ans]>=a[i]){
ans++;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define show1(a) cout<<#a<<" = "<<a<<endl
#define show2(a,b) cout<<#a<<" = "<<a<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 50 + 5, mod = 1e9 + 7;
int n, k;
int a[N], dp[N][N][102];
int solve(int l, int r, int left)
{
if (l > r)
return 0;
if (dp[l][r][left] != -1)
return dp[l][r][left];
int ans = 0;
if (a[l] < 0)
{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define... | #include <bits/stdc++.h>
#include <climits>
using namespace std;
int main(){
int N;
string A,B,C;
cin >> N;
cin >> A >> B >> C;
int ans = 0;
for(int i = 0; i < N;i++){
if(A[i] == B[i] && B[i] != C[i] && C[i] != A[i])ans++;
else if(A[i] != B[i] && B[i] == C[i] && C[... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<vector<char>> ans;
for (int i = 0; i < 50; i++) ans.push_back(vector<char>(100, '#'));
for (int i = 0; i < 50; i++) ans.push_back(vector<char>(100, '.'));
a--, b--;
for (int i = 0; a > 0; i += 2) {
... | #include<iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b; a--; b--;
cout << "100 100" << endl;
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 100; j++) {
if (a > 0 && i % 2 == 0 && j % 2 == 1) { cout << '.'; a--; }
else cout << '#';
}
cout << endl;
}
for (int i = 0; i < 50; i... | 1 |
#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 LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define debug(...) 42
#endif
#define sf scanf
#define pf printf
#define nl print... | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
class UnionFind
{
public:
vector<int> parent;
UnionFind(int N)
{
for (int i = 0; i < N; i++)
{
parent.push_back(-1);
}
}
int root(int A)
{
if (parent[A] < 0)
return A;
return par... | 1 |
/**
* author: tourist
* created: 17.11.2019 02:03:54
**/
#include <bits/stdc++.h>
using namespace std;
class dsu {
public:
vector<int> p;
int n;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
}
inline int get(int x) {
return (x == p[x] ? x : (p[x] = get(p[x]))... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
// #define INF __INT32_MAX__
#define INF 1e9
#define LINF __LONG_LON... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #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=... | 1 |
#include <iostream>
#include <cstdlib>
int main()
{
long long s;
std::cin >> s;
int min = 56562;
int diff;
int num;
int k = 1;
while (true) {
num = s / k % 1000;
if (num < 100) break;
diff = std::abs(753 - num);
if (min > diff) min = diff;
k *= 10;
}
std::cout << min << std::endl;
return 0;
}... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 999;
for(unsigned int i = 0; i < s.length() - 2; ++i)
{
int num = (s[i] - '0') * 100 + (s[i+1] - '0') * 10 +(s[i+2] - '0');
ans = min(ans, abs(753 - num));
... | 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | 1 |
#include<bits/stdc++.h>
using namespace std;
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),putchar(x%10+48);
}
void... | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr ... | 1 |
// ====================================
// author: M_sea
// website: https://m-sea-blog.com/
// ====================================
#include <bits/stdc++.h>
#define file(x) freopen(#x".in","r",stdin); freopen(#x".out","w",stdout)
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1005,ha=1e9+7;
inline int add(int x,int y){ x+=y; return x>=ha?x-ha:x;}
inline void ADD(int &x,int y){ x+=y; if(x>=ha) x-=ha;}
inline int ksm(int x,int y){
int an=1;
for(;y;y>>=1,x=x*(ll)x%ha) if(y&1) an=an*(ll)x%ha;
return an... | 1 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | #include <iostream>
#include <vector>
int sort(std::vector<int> &v)
{
int size = v.size();
bool flag = true;
int idx = 0;
int swapCount = 0;
while (flag) {
flag = false;
for (int i = size - 1; i >= idx + 1; --i) {
if (v[i] < v[i-1]) {
int tmp = v[i];
... | 0 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | #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>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n); i+... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
map<ll,ll> mp;
ll N, MOD;
cin >> N >> MOD;
ll sum[N+1];
sum[0] =0;
mp[0]++;
for(int i=0;i<N;i++){
ll a;
cin >> a;
sum[i+1] = sum[i] + a;
sum[i+1] %=MOD;
mp[sum[i+1]]++;
... | # include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long llong;
#define rep(i, n) for (int i = 0; i < n; ++i)
char gf[1200][1200];
int main()
{
int n;
scanf("%d", &n);
if (n < 3)
printf("-1");
else if (n == 3)
printf("z..\nz..\n.zz");
else if (n == 7)
printf("a..bbaa\n... | #include <bits/stdc++.h>
#define uint unsigned long long
#define ll long long
#define db long double
#define ls rt << 1
#define rs rt << 1 | 1
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define X first
#define Y second
#define pcc pair<char, char>
#define vi totor<int>
#define vl totor<ll>
#de... | 0 |
#include<iostream>
using namespace std;
int x[10000000];
int G[20];
int v;
int w;
int cnt=0;
int m;
int n;
void sort1(int x[],int n,int g){
for(int i=g;i<n;i++){
v=x[i];
w=i-g;
while(w>=0 && x[w]>v){
x[w+g]=x[w];
w=w-g;
cnt++;
}
x[w+g]=v;
}
}
void sort2(int x[],int n){
cnt=0;
for(int h=0;h<20;... | #include <iostream>
#include <memory>
#include <cmath>
constexpr int max_size()
{
return static_cast<int>(1e+6);
}
int insert(int* a, const int i, const int gear)
{
if (i < gear) {
return 0;
}
if (a[i - gear] <= a[i]) {
return 0;
}
std::swap(a[i - gear], a[i]);
return 1 +... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll GCD(ll a, ll b) {
return a % b ? GCD(b, a % b): b;
}
vector<pair<ll, ll> > prime_factorize(ll n) {
vector<pair<ll,ll>> res;
for (ll a = 2; a * a <= n; ++a) {
if (n % a != 0) continue;
ll ex = 0; // ๆๆฐ
// ๅฒใใ้ใๅฒใ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int INF = -1e9;
vector<int> dpk(N + 1, INF), A(M);
for(int i = 0; i < M; i++) cin >> A[i];
sort(A.begin(), A.end());
vector<int> cost(M);
for(int i = 0; i < M; i++){
... | #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>... | 1 |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int m;
vector<int> v;
int num[10] = {0,2,5,5,4,5,6,3,7,6};
int dp[10010][10];
int pre[10010][10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
v.push_back(a);
}
for (int i = 0; i < 10010; i++) {
... | 1 |
#include <iostream>
using namespace std;
struct Dice{
int f[7];
void move(char dir){
int sw;
switch(dir){
case 'E':
sw = f[1];
f[1] = f[4];
f[4] = f[6];
f[6] = f[3];
f[3] = sw;
break;
case 'N':
sw = f[1];
f[1] = f[2];
f[2] = f[6];
f[6] = f[5];
f[5] = sw;
break;
case 'S':... | // Vote
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int N, M, i, j, maxp = 0, maxs;
scanf("%d %d", &N, &M);
int a[N], b[M], p[N];
for (i = 0; i < N; ++i){
cin >> a[i];
p[i] = 0;
}
for (j = 0; j < M; ++j){
cin >> b[j];
}
for (j = 0; j < M; ++j){
for (i = 0; i < N; ++i){
... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n; char c; string s;
while(cin >> n)
{
int cd[13]={0},pr[5]={0};
cd[n-1]++;
for(int i=0; i<4; i++)
{
cin >> c >> n;
cd[n-1]++;
}
for(int i=0; i<13; i++)
{
pr[cd[i]]++;
}
bool st=false;
for(int i=0; i<10; i++)... | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
using namespace std;
int main(){
int hand[5];
char s[4];
while(cin >> hand[0] >> s[0] >> hand[1] >> s[1] >> hand[2] >> s[2] >> hand[3] >> s[3] >> hand[4]){
int trump[14] = {};
for(int i = 0; i < 5; i++)trump[hand[i]]++;... | 1 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
vector<string> S(3);
for... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
if(A<=B){
if(C<=D)
cout<<A+C<<endl;
else
cout<<A+D<<endl;
}else{
if(C<=D)
cout<<B+C<<endl;
else
cout<<B+D<<endl;
}
return 0;
} | 0 |
/* โโโโโโโโโโ โโโโโโโโโโโโโโโโโโโโ โโโโโโโโโโโโโโ
โโโโโโโโโโ โโโโโโโโโโโโโโโโโโโโ โโโโโโโโโโโโโโ */
// Author : Udit "luctivud" Gupta @ (https://www.linkedin.com/in/udit-gupta-1b7863135/)
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
typedef long long int lld;
typedef ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
//ใใฏใญ
//forใซใผใ้ขไฟ
//ๅผๆฐใฏใ(ใซใผใๅ
ๅคๆฐ,ๅใ็ฏๅฒ)ใ(ใซใผใๅ
ๅคๆฐ,ๅงใใฎๆฐ,็ตใใใฎๆฐ)ใใฎใฉใกใใ
//Dใใคใใฆใชใใใฎใฏใซใผใๅคๆฐใฏ1ใใคใคใณใฏใชใกใณใใใใDใใคใใฆใใใฎใฏใซใผใๅคๆฐใฏ1ใใคใใฏใชใกใณใใใใ
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
//xใซใฏvectorใชใฉ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb emplace_back
#define ll long long
const int INF = 2e9 + 1;
const ll INFLL = 1e18 + 1;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(... | #include<iostream>
using namespace std;
long long int MOD = 1000000007;
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
int main() {
//A
int n, r;
cin >> n >> r;
if (n >= 10) {
cout << r << endl;
}
else {
cout << r + 100 * (10 - n) << endl;
}
retur... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define _dec(i,N,j) for(int i = (N-1);i >= (j);i--)
#define _rec(i,N,j) for(int i = (N);i >=(j);i--)
#define ALL(x) x.begin(),x.end()
#define MEM(a,n) memset(a,n,sizeof(a))
#... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long ll;
int ... | 1 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
type... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n,q;
vector<int> S,T;
cin >> n;
for(int i=0;i<n;i++) {
int s;
cin >> s;
S.push_back(s);
}
cin >> q;
for(int i=0;i<q;i++) {
int t;
cin >> t;
T.push_back(t);
}
// O(n^2)
int C = 0;
for(int t_itr=0;... | 0 |
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define N 1100005
using namespace std;
typedef long long ll;
ll n, ans, kac, a[N], pre[N], dp[N], fen[N], of[N];
vector < int > g[N];
ll fe(ll a, ll us){
if(us <= 1)
return (us)?a:1ll;
ll ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
using namespace st... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
char conv[256];
int conv2[256];
for (int i = 0; i < 26; i++){
conv[i] = 'a' + i;
conv[i + 26] = 'A' + i;
conv2['a' + i] = i;
conv2['A' + i] = i + 26;
}
while (scanf("%d", &n) && n){
... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<int> a;
for(int i=0,t;i<n;++i){
cin>>t;
a.push_back(t);
}
string s,ans;
cin>>s;
string alpha;
map<char, int> alph... | 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 L... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
int w[4];
int main() {
for (int i = 0; i < 4; i++) {
cin >> w[i];
... | 1 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
struct Dice {
int d[6], E, S, U;
void init(int a[]) {
rep(i, 6)d[i] = a[i];
E = 2; S = 1; U = 0;
}
void rotate(char C) {
int a = E, b = S, c = U;
switch (C) {
case'E':E = U; U = 5 - a; break;
case'N':U = S; S = 5 - c; bre... | #include <iostream>
using namespace std;
static const int MAX = 101;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAX][MAX];
int prim()
{
int u, mincost;
int d[MAX], p[MAX], color[MAX];
for(int i=0; i<MAX; i++)
{
... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
using ll = long long;
using P = pair<ll, ll>;
/*่ฟฝๅ ้จๅ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c; cin >> a >> b >> c;
string ans = "Yes";
if((a-c)*(b-c)>0) ans ="No";
cout << ans << endl;
} | 0 |
#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 N;
cin >> N;
int ans = INT_MAX;
for (int i = 0; i < N; i++) {
int n;
cin >> n;
int cnt = 0;
while (n%2==0) {
if (n / 2) {
cnt++;
n /= 2;
... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <deque>
using namespace std;
int main() {
//input
int n; cin >> n;
long long sum = 0;
int counter = 0;
vector<long> a(n + 1);
for(int i = 1; i < n + 1; i+... | 0 |
#include <cstdio>
#include <vector>
using namespace std;
typedef long long i64;
int main()
{
int n;
vector<i64> as;
scanf("%d", &n);
as.resize(n);
for(int i = 0; i < n; i++) {
scanf("%lld", &as[i]);
}
i64 sum = 0;
for(auto& a : as) {
sum = sum ^ a;
}
for(auto& a : as) {
a = a & (~sum);
}
i64 max... | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
constexpr int NINF = std::numeric_limits<int>::min();
using namespace std;
int g[10][10];
int f[10... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 4005;
const long long mod = 998244353;
long long C[N][N];
long long pow2[N];
void init(){
C[0][0] = C[1][0] = C[1][1] = 1;
for (int i = 2; i <= 4000; i++){
C[i][0] = 1;
for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
C[i... | #include <bits/stdc++.h>
typedef long long ll;
const int N=5005,P=998244353;
int n,k,C[N][N];
inline int Cs(int n,int m){return n<0||m<0||n<m?0:C[n][m];}
int main()
{
scanf("%d%d",&k,&n);
for(int i=C[0][0]=1;i<=5001;++i)
for(int j=C[i][0]=1;j<=i;++j)
if((C[i][j]=C[i-1][j]+C[i-1][j-1])>=P)
C[i][j]-=P;
for... | 1 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,i,j,cnt,xlh,ans,op,a[302][302],b[302],v[302];
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)v[i]=1;
ans=n;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)scanf("%d",&a[i][j]);
for(cnt=1;cnt<m;cnt++){
for(i=1;i<=m;i++)b[i]=0;
for(i=1;i<=n;i++)
... | #include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
ty... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string sa,sb,sc;
cin >> sa >> sb >> sc;
queue<char> qa,qb,qc;
for(int i = 0; i < sa.size(); i++) qa.push(sa[i]);
for(int i = 0; i < sb.size(); i++) qb.push(sb[i]);
for(int i = 0; i < sc.size(); i++) qc.push(sc[i]);... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LO... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //้ไน
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n, q;
cin >> n >> q;
... | /**
* author: yuya1234
* created: 17.07.2020 14:32:58
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long double eps = 1.0E-14;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) st... | #include<bits/stdc++.h>
using namespace std;
int n,k;
int a[233],odd[3],top;
int main()
{
ios_base::sync_with_stdio(false);
cin>>n>>k;
for(int i=1;i<=k;i++)
{
cin>>a[i];
if(a[i]%2)
{
odd[++top]=i;
}
}
if(top>2)return puts("Impossible"),0;
else if(top==2)
{
swap(a[1],a[odd[1]]);
swap(a[k],a[odd[2]... | 0 |
#include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<end... | #include <bits/stdc++.h>
#define loop(v, f, l) for(int v = (f), v##_ = (l); v < v##_; ++v)
using namespace std;
typedef long long int lint;
static inline int in(){ int x; scanf("%d", &x); return (x); }
static inline lint inl(){ lint x; scanf("%lld", &x); return (x); }
int matrix[11][11];
int main()
{
int n;
whi... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
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; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).... | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N; cin >> N;
int x, y;
vector<int> y_x(8, -1);
for (int i = 0; i < N; i++)
{
cin >> y >> x;
y_x[y] = x;
}
vector<int> perm(8);
for (int i = 0; i < 8; i++) { perm[i] = i; }
bool ok = true;
do
{
ok ... | 1 |
#include <iostream>
#include <cmath>
#include <vector>
#include <climits>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> v;
for(int i = 0;i < n;i++)
{
int t;
cin >> t;
v.push_back(t);
}
bool f = true;
int c = 0;
while(f)
{
f = false... | #include <algorithm>
#include <cstdio>
#include <string>
#define MAXN 1000001
#define a first
#define b second
char buf[MAXN];
std::pair<int, int> s[MAXN];
int main() {
using namespace std;
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", buf);
s[i].a = s[i].b = 0;
for (int j = 0... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long a,b,i,A,B;int x;
map<int,int>m;
int main()
{
cin>>A>>B;
a=A;b=B;
for(i=2;i*i<=A;i++)
{while(a%i==0){a/=i;m[i]=1;}}
if(a!=1)m[a]=1;
for(i=2;i*i<=B;i++)
{while(b%i==0){b/=i;if(m[i]==1){x++;m[i]=2;}}}
if(b!=1){if(m[b]==1)x++;}
cout<... | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define l... | 1 |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
//using namespace atcoder;
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(5);
for (int i = 0; i < 5; i++){
cin >> a[i];
}
sort(a... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
map<int,int> m;
rep(i,n){
int a;
cin >> a;
m[a]++;
}
for(auto p : m){
if(p.second > 1){
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
while(cin>>n,n){
unsigned long long a[5000]={0},c=0,p,o,u;
rep(i,n){
cin>>p>>o>>u;
a[p]+=o*u;
if(a[p]>=1000000){cout<<p<<endl;c++;}
}
if(!c)cout<<"NA"<<endl;
}
} | #include <iostream>
using namespace std;
int order[4000];
bool search(int);
class Member {
public:
Member() {sum = 0;}
void add(long price, long num) {
sum += (long long int)price*num;
}
bool milion()
{
if (sum >= 1000000) return true;
else return false;
}
private:
long long int sum;
int id;
};
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long sum(long long n)
{return n*(n+1)/2;}
int main(){
int n;
cin>>n;
long long ans;
ans=sum(n)-sum(n/3)*3-sum(n/5)*5+sum(n/15)*15;
cout<<ans;
return 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 put(x) cout << x << endl;
using namespace std;
int main()
{
ll n;
cin >> n;
ll sum = 0;
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.