code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include<iostream>
#include<algorithm>
using namespace std;
int data[101];
int mod[101];
void ini(void){
for(int i=0;i<101;i++){
data[i]=0;
mod[i]=0;
}
}
main(){
int max=0;
int j;
j=0;
int in;
while(cin >> in){
for(int i=0;i<101;i++){
if(in == i){
data[i]++;
break;
}
}
j+... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <time.h>
#define int long long
#define ... | 0 | 7,387,005 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 0;
int... | #include <bits/stdc++.h>
using namespace std;
int main () {
set<int> s;
for (int i = 0; i < 3; i++) {
int a;
cin >> a;
s.insert(a);
}
if (s.size() == 1) {
puts("Yes");
}
else {
puts("No");
}
} | 0 | 13,069,025 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
\
#define FOR(i,l,r) for(size_... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod (int)(1e9 + 7)
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll n,m;
cin>>n>>m;
ll arr1[n],arr2[m];
for(ll i=0;i<n;i++)
cin>>arr1[i];
for(ll j=0;j<m;j++)
cin>>arr2[j];
ll dp[n + 1][m + 1];
... | 0 | 30,855,165 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,M;
char c;
int A[55][55];
int B[55][55];
cin >> N >> M;
rep(i, N)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M), B(M);
for(int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
A[i]--;
B[i]--;
}
vector<vector<int>> s(2000001);
bool hantei[2000001];
int prev[2000001] = {0};
int ans[2000... | 0 | 88,141,787 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
#define INX(x) (cin >> x)
#define OUTX(x) (cout << x << endl)
#define ADD emplace_back
#define MP make_pair
#define VVEC(type) vector<vector<ty... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a... | 0 | 81,087,378 |
#include <stdio.h>
#include <iostream>
#include <queue>
#include <map>
#include <string>
#include <vector>
#define PB push_back
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
using namesp... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | 0 | 21,058,843 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> vec(n);
vector<int> dp(n,0);
for(int i=0;i<n;i++){
int temp;
cin>>temp;
vec[i]=temp;
}
for(int i=0;i<k;i++){
dp[i]=abs(vec[i]-vec[0]);
}
for(int i=k;i<n;i++){
int minCost=INT_MAX;
for(int j=1;j<=k;j++){
minC... | #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, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n)rep(j, d) cin >> x[i][j];
vector<int> check(200);
for (int i = 1;... | 0 | 74,797,629 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int k,s;
... | #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<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<bitset>
using namespace std;
#define intmax IN... | 0 | 61,782,077 |
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a, b, c;
for(int i = 0; i < n; i++){
cin >> a >> b >> c;
if(a*a == b*b+c*c || b*b == a*a+c*c || c*c == a*a+b*b){
cout << "YES\n";
} else{
cout << "NO\n";
}
}
return 0;... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
string s;
cin >> s;
set<char> st;
for (const auto c : s)
st.insert(c);
for (char c = 'a'; c <= 'z'; ++c) {
if (!st.count(c)) {
cout << s << c << '\n';
return 0;
}... | 0 | 88,048,666 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a>b){
int tmp = a;
a = b;
b = tmp;
}
if(b>c){
int tmp = b;
b = c;
c = tmp;
}
if(a>b){
int tmp = a;
a = b;
b = tmp;
}
cout << a << ' ' << b << ' ' << c << '\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main()
{
int n, m;
std::cin >> n >> m;
std::vector<int> a(m);
for (int i = 0; i < m; i++) {
std::cin >> a[i];
}
std::sort(a.begin(), a.end(), std::greater<int>());
std::vector<int> num_match = { 0, 2, 5, 5, 4, 5, 6, 3, 7,... | 0 | 44,009,637 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int a[101] = { 0 };
int A;
int M_C = 0;
while (cin >> A) {
a[A]++;
M_C = max(M_C, a[A]);
}
for (int i = 1; i <= 100;i++) {
if (a[i] == M_C) cout << i << endl;
}
} | #include <bits/stdc++.h>
#include <atcoder/dsu.hpp>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using intpair = pair<int, int>;
using intmap = map<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
const int MOD = 1e9 + 7;
inline int mod (ll a, int m = MO... | 0 | 22,883,370 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RFOR(i, a, b) for (int i=a;i>=b;--i)
#define ll long long
#define all(a) a.begin(),a.end()
#define ull unsigned long long
#define pb(x) push_back(x)
#define dbg(x) cout<<#x<<" : "<<(x)<<endl;
using namespac... | #include <bits/stdc++.h>
using namespace std;
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int N) : data(N, -1) {}
int find(int k) { return data[k] < 0 ? k : data[k] = find(data[k]); }
int unite(int x, int y) {
if ((x = find(x)) == (y = find(y))) return false;
if (data[x] > data[y... | 0 | 93,520,457 |
#include <stdio.h>
int main (){
char alpha;
scanf("%c",&alpha);
printf("%c",alpha+1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, H, W;
cin >> N;
cin >> H;
cin >> W;
int cnt=0;
for(int i=0; i<N; i++){
int a, b;
cin >> a;
cin >> b;
if(a>=H && b>=W) cnt++;
}
cout << cnt << endl;
} | 0 | 2,575,837 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli k, s;
int main(void){
cin >> k >> s;
lli ans = 0;
for(lli i = 0; i <= k; i++){
for(lli j = 0; j <= k; j++){
lli u = s-i-j;
if(u >= 0 && u <= k) ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn=112345;
typedef pair<int,int> pii;
int n,m,l,r,x,d[maxn],vis[maxn];
vector<pii> G[maxn];
bool dfs(int u,int dep) {
vis[u]=1;
d[u]=dep;
for (int i=0;i<(int)G[u].size();++i) {
int v=G[u][i].first,w=G[u][i].second;
if (vis[v]&&d[u]+w!... | 0 | 39,201,346 |
#include "bits/stdc++.h"
#define rep(i,n) for (ll i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
ll n,m;
cin >> n >> m;
if(n%2!=0){
rep(i,m){
cout << n/2-i << " " << n/2+i+1 << endl;
}
}
else{
rep(i,m){
i... | #include <cmath>
#include <complex>
#include <iostream>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define REP(i,n) FOR(i,0,n)
using namespace std;
typedef complex<double> xy_t;
double dot_product(xy_t a, xy_t b){ return (conj(a) * b).real(); }
double cross_product(xy_t a, xy_t b){ return (conj(a) * b).imag()... | 0 | 93,227,567 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
ll n;
cin >> n;
for(ll i=sqrt(n);i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
const int NIL = -1;
struct Node{
int p, l, r;
};
vector<Node> T(100010, {... | 0 | 19,291,702 |
#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
bool flag = true;
int c = 0;
for (int i = 0; i < int(s.size()); ++i) {
flag = true;
c = 0;
for (int j = 0;; ++j) {
if (s[i + j] != t[j]) {
fla... | 0 | 77,458,268 |
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | #if 0
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int Q;
int L[1000+10][1000+10];
int main() {
cin >> Q;
string X, Y;
for (int i = 0; i < Q; i++) {
for (int j = 0; j < 1000+10; j++) {
L[0][j] = 0; L[j][0] = 0;
}
cin >> X >> Y;
for (int x = 1; x <= X.length(... | 0 | 24,035,332 |
#include <iostream>
using namespace std;
int main(){
int g[1001][1001]={{0}};
int n,a,b,c;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a >> b ;
for (int i = 0; i < b; ++i)
{
cin >> c;
g[a-1][c-1]=1;
}
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
... | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 0 | 46,683,447 |
#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++)
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(right - left > 1)... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> A(N), B(N);
int first = 0, second = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];
if(first <= A[i]) {
second = first;
first = A[i];
}
else if(second <= A[i]) {
second = A[i];
}
}
... | 0 | 96,780,049 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include<iostream>
#include<string>
using namespace std;
int A[1001][1001];
int main(){
string s1,s2;
cin>>s1;
cin>>s2;
for(int i=0;i<=s1.size();++i){
for(int j=0;j<=s2.size();++j){
if(i==0){
A[0][j]=j;
continue;
}
if(j==0){
... | 0 | 13,976,106 |
#include <iostream>
using namespace std;
int main(){
int a=100000,b=0,t;
cin>>t;
for(int k=0;k<t;k++){
b=a*1.05;
b=(b+999)/1000*1000;
a=b;
}
cout<<a<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | 0 | 20,554,152 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
double PI = 3.141592653589793;
int main()
{
int A, B;
cin >> A >> B;
cout << (A + B + 1) / 2;
} | #include <iostream>
using namespace std;
#define MAX 250
int main() {
int n;
int x;
int H[MAX];
cin >> n;
for(int i=0; i<n; i++) {
cin >> x;
H[i] = x;
}
for(int i=0; i<n; i++) {
cout << "node " << i+1 << ": ";
cout << "key = " << H[i] << ", ";
if(i>0) ... | 0 | 21,507,239 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector <ll> A(X);
for (int ii = 0; ii < X; ++ii){
cin >> A[ii];
}
vector <ll> B(Y);
for (int ii = 0; ii < Y; ++ii){
cin >> B[ii];
}
vector <ll> C(Z);
for (... | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) ... | 0 | 34,969,480 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=998244353;
const ll MAX=91... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 87,194,658 |
#include <iostream>
using namespace std;
int l[2000][2000], r[2000][2000], up[2000][2000], down[2000][2000];
char a[2000][2000];
int main () {
int h, w, temp = 0, res = 0;
cin >> h >> w;
for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) cin >> a[i][j];
for (int i = 0; i < h; i++) {
temp = ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int a[5],i,j,b;
scanf("%d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4]);
for(i=0;i<5;i++){
for(j=0;j<4;j++){
if(a[j]<=a[j+1]){
b=a[j];
a[j]=a[j+1];
a[j+1]=b;
}
}
}
for(i=0;i<5;i++){
printf("%d",a[i]);
if(i<4){
printf... | 0 | 54,929,716 |
#include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;
int main(){
int n, m;
while(cin >> n >> m, n){
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1... | 0 | 99,715,815 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#d... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
{
int n, m, v, p;
cin >> n >> m >> v >> p;
vector<int> a(n);
for(int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
auto poss = [&] ... | 0 | 58,875,593 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
ll n; cin >> n;
ll ans = 0;
for(ll i = 1; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
ll modpow(ll x,ll k){
if(k==0)return 1;
ll ret=modpow(x,k/2);
ret*=ret; ret%=MOD;
if(k%2==1){
ret*=x; ret%=MOD;
}
return ret;
}
int main(){
static ll n;
static ll a[100010];
scanf("%lld",&n);
for(int i=0;i<=n;i++)sc... | 0 | 4,305,701 |
#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<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=500000;
char s[N+9];
int n;
void into(){
scanf("%s",s+1);
n=strlen(s+1);
}
int a[N+9];
LL ans;
void Dfs_a0(int p,int v){
a[p]=max(a[p],v);
if (p>1&&s[p-1]=='>') Dfs_a0(p-1,v+1);
}
void Dfs_a1(int p,int v){
a[p]=max(a[p],v);
if (p... | 0 | 69,964,456 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string o,e;
cin >> o >> e;
for(int i=0; i<e.length(); i++){
cout << o.at(i) << e.at(i);
}
if(o.length()!=e.length()) cout << o.at(o.size()-1);
cout << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
ll N;
cin >> N;
ll ans=1;
... | 0 | 7,728,495 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 0 | 9,990,398 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include<iostream>
using namespace std;
int main(){
long long a[100000],b,n;
int p=0,q=0;
cin>>n;
for (int i=0;i<n;i++) cin>>a[i];
b=a[0];
for(int i=0;i<n;i++){
if(a[i]==0) {
b=0;
p=1;
break;
}
}
long long x=1000000000000000000;
... | 0 | 7,395,240 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(10);
}
signed ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define pb(x... | 0 | 64,141,720 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
char buf[128] = { 0 };
short grid[64][64] = { {0} };
int H,W;
fgets(buf, sizeof(buf), stdin);
sscanf(buf, "%d %d", &H, &W);
for(int i = 0; i < H; i++){
memset(buf, 0, sizeof(buf));
fgets(buf, sizeof(buf), st... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,t0,t1,t2,t3;
cin >> N;
t0=N/1000;
t1=(N-1000*t0)/100;
t2=(N-1000*t0-100*t1)/10;
t3=(N-1000*t0-100*t1-10*t2);
if (t1==t0){
if(t2 == t1){
cout << "Yes" << endl;
}
else{
cout<< "No" << endl;
}
}
else{
if(t1==t... | 0 | 98,550,666 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,ans=0,now;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; ++i){
cin >> a.at(i);
}
now = 0;
for(int i = 0; i < n; ++i){
now = a.at(now)-1;
if(now == 1){
cout << (i + 1) << endl;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | 0 | 20,446,834 |
#include<cctype>
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c", &ch);
if( isalpha(ch)){
if(islower(ch)){
printf( "%c", toupper(ch));
} else{
printf("%c", tolower(ch));
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
vector<int> d(10),e(10);
for(int i = 1;i<10;i++)
{
int now = i*2;
int num = 2;
int cnt = 1;
while(now != i)
{
if(now>9)
{
now = now%10+now/10;
cnt++;
if(now==i)break;
}
now += i;
num++;
cnt++;
i... | 0 | 18,795,997 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | #include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int n;
struct Node{
int key;
Node *p, *l, *r;
};
Node *NIL, *root;
void preorder(Node *u){
if(u == NIL) return;
cout << ' ' << u->key;
preorder(u->l);
preorder(u->r);
}
void inorder(Node *u){
if(u == NIL) return;
inorder(u->l);
... | 0 | 69,625,586 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
using namespace std;
void solve(){
int a, b, c, d; cin >> a >> b >> c >> d;
string ans;
if(a + b > c + d) ans = "Left";
else if(a + b < c + d) ans = "Right";
else ans = "Balanced";
cout << ans << endl... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true... | 0 | 58,204,604 |
#include<cstdio>
#include<iostream>
int a[5];
int swa;
int change(int n){
swa=a[n],a[n]=a[n-1],a[n-1]=swa;
}
int main(){
for(int i=0;i<5;i++)
scanf("%d",&a[i]);
for(int i=4;i>=0;i--){
for(int j=4;j>0;j--){
if(a[j-1]<a[j])
change(j);
}
}
for(int i=0... | #include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);... | 0 | 52,441,784 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
string s,t;
int flg = 0;
cin>>s>>t;
for(int i = 0; i < s.length(); i++)
{
if(s[i] != t[i])
{
flg++;
}
}
cout<<flg;
cout<<endl;
return 0;
} | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 35,850,191 |
#include <iostream>
#include <string>
int main() {
int a, b;
auto mark = ">";
std::cin >> a >> b;
if (a > b)
{
mark = ">";
}
else if(a < b)
{
mark = "<";
}
else mark = "==";
std::cout << "a" << " " << mark << " " << "b" << std::endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stdexcept>
#include<cmath>
#include<fstream>
#include<memory>
#include<algorithm>
#include<cstring>
#include<ctime>
#include<deque>
#include<sstream>
#include<iomanip>
#include<sstream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#incl... | 0 | 91,700,256 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n + 2);
for (int i = 1; i < n + 1; i++) cin >> a[i];
int s = 0;
for (int i = 0; i < n + 1; i++) {
s += abs(a[i+1] - a[i]);
}
for (int i = 1; i < n + 1; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, Q;
vector<vector<int>> graph(0, vector<int>());
void rOp(int v, int p, vector<ll> & score){
if(p != -1) score[v] += score[p];
for (auto elem : graph[v])
{
if(elem == p) continue;
rOp(elem, v, score);
}
}
int main(... | 0 | 28,222,357 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
string func(int a){
string num;
if(a<100)
num+='0';
else
num+=to_string(a/100);
if(a<10)
num+='0';
else
num+=to_str... | #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 b... | 0 | 55,499,080 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | #include<iostream>
using namespace std;
int main()
{
int a[5],c;
for(int i=0 ; i<5 ; i++){
cin >> a[i];
}
for(int i=0 ; i<4 ; i++){
for(int j=i+1 ; j<5 ; j++){
if(a[j]>a[i]){
c=a[j];
a[j]=a[i];
a[i]=c;
}
}
... | 0 | 50,893,354 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
string s; cin >> s;
bool dup = false;
for(int i = 0;i<s.size();i++)
for(int j = i+1;j<s.size();j++)
if(s[i... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll f[10000050],n;
int main(){
cin >> n;
for(ll i=1; i<=n; i++){
for(ll j=i; j<=n; j+=i){
f[j]++;
}
}
ll cnt=0;
for(ll i=1; i<=n; i++){
cnt+=i*f[i];
}
cout << cnt << endl;
} | 0 | 93,690,379 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,sizeof(v))
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 61,620,089 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
cin >> A;
int k = N*N - A;
cout << k;
return 0;
} | #include <cstdio>
#include <string>
#include <vector>
using namespace std;
struct Card {
char suite;
int value;
bool operator==(const Card& rhs) const
{
return suite == rhs.suite && value == rhs.value;
}
};
void bubbleSort(vector<Card>& v)
{
for (size_t i = 0; i < v.size(); ++i) {
... | 0 | 77,816,162 |
#include <bits/stdc++.h>
using namespace std ;
int main()
{
int i,a,b,n,c=0;
cin>>n;
cin>>a>>b;
for(i=a;i<=b;i++){
if(i%n==0)
{
c++;
}
}
if(c>=1)
cout<<"OK"<<endl;
else
cout<<"NG"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef struct _dot{
int a;
int b;
}Dot;
int Distance(Dot a,Dot b){
return abs(a.a-b.a) + abs(a.b - b.b);
}
int main(void){
int N,M;
cin >> N >> M;
Dot student[N];
Dot CheckPoint[M];
for(int i=0;i<N;i++){
cin >> student[i].a;
cin >> ... | 0 | 81,887,821 |
#include <cstdio>
#include <cmath>
#include <utility>
#include <vector>
using namespace std;
#define nmax 10005
int Countingsort( int A[], int B[], int n){
int i, j;
int C[ nmax ] = {};
for( j = 0 ; j < n ; j++ ){
C[ A[j] ]++;
}
for( j = 1; j < nmax ; j++ ){
C[j] = C[j] + C[j-1];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv)
{
bool flag;
int N;
cin >> N;
vector<ll> a(N+10);
vector<ll> b(N+10);
for (int i = 0; i < N; ++i)
cin >> a[i];
for (int i = 0; i < N; ++i)
cin >> b[i];
ll larger_a{0}, larger_b{0};
for (int i = 0; i < N; ++i... | 0 | 59,781,992 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define pb push_back
#define endl '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vl... | 0 | 80,940,326 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
long long int ans=1000;
long long int counter=1000;
long long int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n-1;i++)
{
if(a[i]<a[i+1])
{
counter=ans/a[i];
... | #include<bits/stdc++.h>
using namespace std;
int hea[100010],nxt[200010],to[200010],d[100010],tot;
long long v[100010];
void fason(int x,int y)
{
nxt[++tot]=hea[x];
hea[x]=tot;
to[tot]=y;
}
long long dfs(int x,int f,int fa)
{
if(d[x]==1)return v[x];
long long s=0;
for(int i=hea[x];i;i=nxt[i])
{
int y=to[i];
... | 0 | 42,292,156 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef pair<P,int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#defin... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int llu;
#define f1(i,n) for(i=1;i<=n;i++)
#define f(i,n) for(i=0;i<n;i++)
#define Max 100009
#define Mx 1e10
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ll n,mn=0,mx=0,x,i,t=0,j=0,k=0;
set<ll>s;
... | 0 | 63,422,548 |
#include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define int long long
typedef pair<int,int>pi;
... | #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<string> s(n);
rep(i,n){
cin >> s.at(i);
sort(s.at(i).begin(),s.at(i).end());
}
vector<int> alp(26);
vector<int> ans(26,100);
int count=0... | 0 | 78,958,136 |
#include<iostream>
using namespace std;
int main(){
int money,bell;
while(1){
cin >> money;
if(money==0){
break;
}
money=1000-money;
bell=0;
while(money!=0){
if(money>=500){
bell++;
money-=500;
}
else if(money>=100){
bell++;
money-=100;
}
else if(money... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 25,627,351 |
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
struct UnionFind{
vector<int> data;
UnionFind(int size) : data(size,-1){}
bool unite(int x,int y){
x=root(x),y=root(y);
if(x!=y){
if(data[y]<data[x]){
... | #include<iostream>
#include<string>
#include<map>
#include<vector>
using namespace std;
int main(void){
string str;
vector<string> w;
map<string,int> word;
unsigned int max=0,length=0;
while(cin>>str){
w.push_back(str);
if(word.find(str) != word.end()){
word[str]++;
}else{
word.insert(make_pair(str,1))... | 0 | 26,661,317 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using plll=pair<ll,pll>;
using graph=vector<vector<int>>;
using wgraph=vector<vector<pll>>;
const ll MOD=1000000007;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll abs1(ll a){
if(a>=0)return a;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N,M;
cin >> N >> M;
ll ans;
if(N == 2 || M == 2)ans = 0;
else if(N == 1 && M == 1)ans = 1;
else if(N == 1 && M > 2)ans = M - 2;
else if(M == 1 && N > 2)ans = N - 2;
else ans = (M - 2) * (N - 2);
cout <... | 0 | 76,946,910 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#defi... | 0 | 64,909,614 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int a[10],i;
for(i = 0; i < 10; i++){
scanf("%d",&a[i]);
}
sort(a,a+10);
printf("%d\n%d\n%d\n",a[9],a[8],a[7]);
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | 0 | 91,643,629 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int n;
cin >> n;
vector <int> v(n);
for(auto &e: v) {
cin >> e;
}
sort(v.begin(), v.end());
int x = v.size() / 2;
cout << v[x] - v[x - 1] << endl;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
... | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
if (b == 0) return a;
else return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
return a / gcd(a,b) * b;
}
int main(){
int n, m;
... | 0 | 33,638,732 |
#include <iostream>
using namespace std;
int main() {
int s,h,n,i,a[5000];
while(true) {
cin >> n;
if (n==0) break;
for (i=0;i<n;i++) cin >> a[i];
s=0; h=-100000;
for (i=0;i<n;i++) {
s=(s+a[i]>=a[i]) ? s+a[i] : a[i];
h=(s > h) ? s : h;
}
cout << h << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,i,j,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#defin... | 0 | 44,640,744 |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include <bits/stdc++.h>
using namespace std;
int frog1(int* s, int n){
int dp[100006];
dp[0]=dp[1] = 0;
for(int i=2;i<=n;i++){
int op1 = abs(s[i]-s[i-1]) + dp[i-1];
int op2 = (i==2)?INT_MAX:abs(s[i]-s[i-2]) + dp[i-2];
dp[i] = min(op1, op2);
}
return dp[n];
... | 0 | 49,413,855 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define gc getchar
#define pc putchar
#define cs const
inline
ll getint(){
re ll num;
re char c;
re bool f=0;
while(!isdigit(c=gc()))f^=c=='-';num=c^48;
while(isdigit(c=gc()))num=(num<<1)+(num<<3)+(c^48);
return f?-num:num;
}
in... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 0 | 19,212,513 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,a,sum=0;
cin>>n>>m;
for (int i = 0; i < m; ++i)
{
cin>>a;
sum+=a;
}
int ans = n-sum;
if(ans<0) cout<<-1; el... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | 0 | 45,966,305 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define show(x) cerr<<#x<<"="<<x<<"\n"
typedef long long ll;
using namespace std;
const int dy[]={1,0,-1};
const int dx[]={1,0,-1};
int n,m,h,w;
int a[90000];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;
#ifdef L... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <tuple>
using namespace std;
using i64 = int64_t;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr i64 MOD = 100000... | 0 | 75,415,804 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI a(n);
rep(i,n){
cin >> a.at(i);
}
ll mn=100000000000000;
for(in... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | 0 | 21,903,425 |
#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 rep(x,a,b) for(int x = a; x < b; x++)
#define per(x,a,b) for(int x = a; x >= b; x--)
#define all(container) (container).begin(), container.end()
#define rall(container) (container).rbegin(), container.rend()
#define sz(container) (int) (c... | 0 | 40,888,087 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <deque>
#include <string>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <map>
#include <unordered_map>
#include <bitset>
#define _crt_secure_no_warn... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define ff first
#define ss second
#define MAXN 1000005
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll k;
cin>>k;
ll e=k/50;
ll f=k%50;
ll rr... | 0 | 8,771,016 |
#include<bits/stdc++.h>
using namespace std;
int n,a[100010];
string s;
vector<int> check(int x,int y)
{
vector<int> v;
v.push_back(x);
v.push_back(y);
for(int i=2;i<n;i++)
{
if(!a[i-1])
{
if(v[i-1]==0)
v.push_back(v[i-2]);
else
v.push_back(1-v[i-2]);
}
else
{
if(v[i-1]==0)
v.push_ba... | #include<bits/stdc++.h>
using namespace std;
long long h[100009];
long long sz[100009];
long long f[100009];
long long D[100009];
vector<long long> v[100009];
map<long long,long long> M;
void dfs(long long x, long long de){
f[x] = 1;
h[x] = de;
for(long long i = 0; i < v[x].size(); i++){
if(!f[v[x][... | 0 | 54,610,077 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, k; cin >> a >> b >> k;
ll n = max(a, b);
ll i = 1;
ll order = 0;
vector<ll> p;
for (ll i = 1; i <= n; i++) {
if (a % i == 0 && b % i == 0) {
order++;
p.emplace_back(i);
}
}
sort(p.begin(), p.end(), greater<ll>(... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (ll)(n) - 1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define INF (1LL << 62)
#define ... | 0 | 23,866,498 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | 0 | 55,210,904 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
int h,w; cin >> h >> w;
int x,y;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
string s; cin >> s;
if(s == "snuke"){
x = i+1; y = j;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,D,answer=0,a,b=0,count=0;
cin>>N>>D;
vector<vector<int>> X(N,vector<int>(D));
for (int i=0; i < N; ++i) {
for (int j=0; j < D; ++j) {
cin >> X[i][j];
}
}
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
b=0;
for(int k=... | 0 | 96,148,183 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[]) {
string S;
cin >> S;
vector<string> key = {
"dreamer",
"dream",
"eraser",
"erase",
};
reverse(S.begin(), S.end());
while (S.length() > 0) {
bool stringFlag = fal... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
string ta, ha;
int left=0, right = 0;
for(int i=0; i<n; i++){
cin >> ta >> ha;
if(ta > ha){
left += 3;
}else if(ta < ha){
right += 3;
}else{
lef... | 0 | 46,789,505 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = 1000;
if(p + q < ans) ans = p + q;
if(r + q < ans) ans = r + q;
if(p + r < ans) ans = p + r;
if(q + r < ans) ans = q + r;
if(r + p < ans) ans = r + p;
if(q + p < ans) ans = q + p;
... | #include<bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
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 ; 0 <= i ; i--)
#define ROP(i, n) for(int i = 1 ; i <... | 0 | 24,854,682 |
#include<iostream>
#include<algorithm>
#include<string.h>
#include<set>
#define MAX_N 50
#define INF 10000
using namespace std;
int d[MAX_N][MAX_N];
int N;
void floyed(int X) {
for (int k = 0; k<X; k++) {
for (int i = 0; i<X; i++) {
for (int j = 0; j<X; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned... | 0 | 3,442,399 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using vv = vector<v>;
int gcd(int a, int b){
if(a<b)
swap(a,b);
while(a%b){
a %= b;
swap(a,b);
}
return b;
}
int main(){
int n,k;
cin >> n >> k;
v a(n);
bool ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int m;
cin >> m;
int ans = 8;
m-=400;
for(;;)
{
if(m<200)
{
break;
}
m-=200;
ans--;
}
cout << ans << endl;
} | 0 | 52,640,771 |
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
int n;
cin >> n;
double point[2][4097];
point[0][0] = 0; point[1][0] = 0; point[0][4096] = 100; point[1][4096] = 0;
double l = 100; double root3 = sqrt(3.0); double gosa = 0.0001;
for(int i = 0; i < n; i++){
l = 100 / pow(... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=int(a);i<int(b);++i)
#define RFOR(i,a,b) for(int i=int(b)-1;i>=int(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
int q;
int main() {
int a,b;
string str,q_str,m_str;
cin >> str;
... | 0 | 18,047,586 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int f1(int n, int k) {
int ret = 0;
int tmp = k;
while (n >= tmp) {
tmp += k;
ret++;
}
return ret;
}
int f2(int n, int k, int m) {
int ret = 0;
for(int i =1;i<=n;i++){
if(i%k ==m... | 0 | 84,012,695 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int n = -1;
for(int i = 0; i < 1000000; i++){
if(N == i * (i - 1) / 2){
n = i;
break;
}
}
if(N == 1){
cout << "Yes" << endl;
cout << 2 << endl;
cout << 1 << " " <... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll kyori(ll x,ll y,ll nx,ll ny){
ll a=0;
a+=max(x-nx,nx-x);
a+=max(y-ny,ny-y);
return(a);
}
int main(){
int n,m;
cin >> n >> m;
vector<pair<ll,ll>> s(n);
for(int i=0;i<n;i++) cin >> s.at(i).first >> s.at(i).second;
vector<pair<ll,ll>> p... | 0 | 86,655,435 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#i... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod ... | 0 | 60,788,953 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#... | 0 | 41,287,228 |
#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;... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> ostream& operator<<(os... | 0 | 74,567,701 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
string s; cin >> s;
for (int i = 1; i < s.size(); ++i)
{
int sz = s.size() - i;
if (sz % 2 != 0)
continue;
if (s.substr(0, sz / 2) == s.substr(sz / 2, sz / 2)){
cout << sz;
break;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
struct Node{
int Num;
int length = 0;
set<Node*> reach;
};
int N,M,A,B;
Node a[100001];
int r[100001];
void solve(){
cin >> N >> M;
for (int i = 0; i < N; i++)
{
a[i].Num = i;
r[i] = 0;
}
... | 0 | 52,288,398 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a!=1&&b!=1){
cout<<"1"<<endl;}
else if(a!=2&&b!=2){
cout<<"2"<<endl;}
else{
cout<<"3"<<endl;}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int c1=0,c2=0,c3=0,c4=0;
for(int i=0;i<3;i++){
int ai,bi;
cin>>ai>>bi;
if(ai==1)
c1++;
else if(ai==2)
c2++;
else if(ai==3)
c3++;
else
c4++;
if(bi==1)... | 0 | 1,297,743 |
#include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inc... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> blue(N);
for(int i = 0; i < N; i++) cin >> blue.at(i);
int M;
cin >> M;
vector<string> red(M);
for(int i = 0; i < M; i++) cin >> red.at(i);
int sum = 0;
for(int i = 0; i < N; i++) {
string s = blue.at(i);
... | 0 | 41,888,651 |
#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 <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 10;
int a[MAXN], b[MAXN];
int n, mx = 0;
template <class T>
inline void _read(T &x)
{
x = 0;
char t = getchar();
while (!isdigit(t) && t != '-') t = getchar();
if (t == '-')
{
_read(x);
x *= -1;
return ;
... | 0 | 41,989,790 |
#include <bits/stdc++.h>
using namespace std;
const int INF=999999999;
int main() {
int64_t Q,H,S,D,N;
cin>>Q>>H>>S>>D>>N;
cout<<min(min({4*Q,2*H,S})*N , D*(N/2)+min({4*Q,2*H,S})*(N%2))<<endl;
return 0;} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 83,383,728 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1000000007;
const ll INFLL = 1000000000000000007LL;
void solve() {
int A, B, X;... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> arr(n, vector<int>(3));
for(int i = 0;i<n;i++){
cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = ... | 0 | 43,221,059 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 0 | 42,814,065 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
int ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 31,856,453 |
#include <iostream>
using namespace std;
int main() {
bool judge = true;
int x;
int n = 0;
while (judge) {
cin >> x;
n++;
if (x != 0) {
cout << "Case " << n << ": " << x << endl;
} else {
judge = false;
}
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 48,935,994 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int s;
cin>>s;
vector<int> dp(s+1,0);
int mod = 1e9 + 7;
dp[0] = 1;
dp[1] = 0;
dp[2] = 0;
for(int i = 3;i<=s;i++)
{
int j = 3;
while(j <= i)
{
dp[i] = (dp[i] + dp[i-j]) % mod;
j+... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[]) {
int n, i, j, id, num, node;
scanf("%d", &n);
int A[n][n];
for(i = 0; i < n; i++){
for(j = 0; j < n; j++){
A[i][j] = 0;
}
}
for (i = 0; i < n; i++){
scanf("%d"... | 0 | 21,361,985 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 95,129,599 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
vector<int> count;
vector<char> sign;
sign.push_back(s.at(0));
int ct = 0;
for(char c : s) {
if(c == sign.at(sign.size()-1)) ct++;
... | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_map>
#include<string>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
using namespace std;
#define Mohamed_Gad fast()
#define ll long long
#define ull unsigned long long
#define all(v) v.begin(),v.end()
#define endl "\n"
#define ... | 0 | 90,115,698 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll pow2(long long n) {
ll ret = 1;
ll x = 2;
while (n > 0) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
int main() {
ll a,b,c,h,i,j,k,l,m,n,... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans1=0,ans2=0;
for(int i=0; i<s.size(); i++){
if(i%2==(int(s[i])-'0')) ans1++;
else ans2++;
}
cout << min(ans1,ans2) << endl;
return 0;
} | 0 | 80,163,447 |
#include <iostream>
using namespace std;
long long int f(int a){
return (long long int)a*a;
}
int main(){
int d , od , num;
long long int s=0;
while(cin>>d){
num=600/d;
od=d;
d=0;
for(int i=0 ; i<num ; i++){
s+=od*f(d);
d+=od;
}
cout << s << endl;
s=0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 60,482,206 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string o,e;
cin >> o >> e;
for(int i =0; i< (int) o.length(); i++){
cout << o[i];
if(i<(int) e.length()) cout << e[i];
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,m;
cin>>n>>m;
char fi1[n][n];
char fi2[m][m];
rep(i,n){
rep(j,n){
... | 0 | 42,177,314 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | #include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n){
int a=0;
for(int i=0;i<10;i++)
for(int j=0;j<10;j++)
for(int p=0;p<10;p++)
for(int q=0;q<10;q++)
if(i+j+p+q==n)
a++;
cout<<a<<endl;
}
} | 0 | 88,487,760 |
#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define... | #include <iostream>
#include <algorithm>
#include <vector>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
while(true){
int m, f, r;
std::cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
char rank;
if(m==-1 || f==-1) rank = 'F';
else if(m+... | 0 | 15,715,338 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 +... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#defin... | 0 | 40,615,548 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.