code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 39,713,370 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
/*
int a, b;
cin >> a >> b ;
char a;
cin >> a ;
a = a + 1;
/*
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
/*
if( a == b ){
cout << "Yes" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define in... | 0 | 41,684,865 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1000000007;
signed main(){
int N;
cin>>N;
vector<int> A(64,0);
for(int j=0;j<N;j++){
int B;
cin>>B;
bitset<64> C(B);
for(int i=0;i<64;i++)
if(C.test(i))
A[i]++;
}
int ans=0;
for(int i=0,j=1;i<64;... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using P = pair<int, int>;
int main(){
int n, h;
cin >> n >> h;
vector<P> sword(n);
for(int i = 0; i < n; i++) cin >> sword[i].second >> sword[i].first;
sort(sword.begin(), sword.end());
int amax_i = 0;
for(int i ... | 0 | 31,661,610 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
string s;
ll k;
cin >> s >> k;
int no = s.size()+1, x;
REP(i, s.size()){
if(s[i]... | #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 | 40,720,887 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int a, flag = 1;
string b;
cin>>a>>b;
if(a%2==0)
{
int c= b.length()/2;
for(int i=0; i<c; i++)
if(b.at(i)!=b.at(i+c))
{
flag = 0;
break;
}
... | 0 | 67,698,836 |
#include <iostream>
int main()
{
int n;
int cnt;
while (std::cin >> n){
cnt = 0;
for (int a = 0; a < 10; a++){
for (int b = 0; b < 10; b++){
for (int c = 0; c < 10; c++){
for (int d = 0; d < 10; d++){
if (a + b + c + d... | #include<bits/stdc++.h>
template<typename First, typename Second, typename Third>
struct triple {
First first;
Second second;
Third third;
};
using namespace std;
void solve(){
int n;
cin>>n;
vector<int>v(n+2);
v[0]=0;
v[n+1]=0;
long long sum=0;
for(int i=1;i<=n;i++){
... | 0 | 72,752,251 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | 0 | 78,564,828 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
int n=s.size();
int count=0;
for(int i=0;i<n;i++){
if(s[i]==s[n-1-i]){
count++;
}
}
if(count==n){
int x=(n-1)/2;
for(int i=0;i<x;i++){
if(s[i]==s[x-1-i]){
count++;
}
}
... | #include<bits/stdc++.h>
using namespace std;
const int N = 20005;
int a[N], b[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
for (int i=1; i<=n; i++) a[i] = i*n, b[i] = (n+1-i)*n;
for (int i=0; i<n; i++) {
int x;
cin>>x;
a[x] += i;
}
f... | 0 | 56,014,752 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <random>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) ... | #pragma region header
#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>
#inc... | 0 | 29,443,549 |
#include <iostream>
#include <cstdio>
using namespace std;
int mtoi(string s){
int sum=0;
int co=1;
for(int i=0;i<s.length();i++){
if('1'<=s[i] && s[i]<='9'){co=s[i]-'0';}
else if(s[i]=='m'){sum+=1000*co;co=1;}
else if(s[i]=='c'){sum+= 100*co;co=1;}
else if(s[i]=='x'){sum+= 10*co;co=1;}
else if(s[i]=='i')... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>... | 0 | 9,591,982 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
ll N, A, B; cin >> N >> A >> B;
ll retva... | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int x1, y1, x2, y2, x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2;
int yd=abs(y2-y1);
int xd=abs(x2-x1);
if (x1 <= x2 && y1 < y2){
x3 = x2 - yd;
y3 = y2 + xd;
x4 = x1 - yd;
y4 = y1 + xd;
}else if (x1 > x2 && y1 < y2){
x3... | 0 | 96,944,120 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
vector<bool> vis(n, 0);
int ans = 0;
... | 0 | 92,979,962 |
#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>
#include <cctype>
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.... | 0 | 3,846,409 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int a, b, i;
int sum_a, sum_b;
sum_a = sum_b = 0;
for (i = 0; i < 4; i++){
scanf("%d", &a);
sum_a += a;
}
for (i = 0; i < 4; i++){
scanf("%d", &b);
sum_b += b;
}
printf("%d\n", max(sum_a, sum_b));
return (0);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const i... | 0 | 14,400,020 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<cstdio>
using namespace std;
map<char,int>M;
int cnv(string str){
str="."+str;
int res=0;
for(int i=0;i<str.length();i++){
if(M.find(str[i])!=M.end()){
int a;
if(str[i-1]>='0'&&str... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
struct UnionFind {
vector<int> d;
UnionFind(int N) : d(N, -1) {}
int find(int x)... | 0 | 45,606,217 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int h,n;
cin>>h>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
sort(a.begin(),a.end());
bool flag=false;
rep(i,n){
h-=a[i];
if(h<=0){
flag=true;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef pair<long long, long long> P;
int main(){
long long N, H;
cin >> N >> H;
vector<long long> a(N),b(N);
vector<P> v(N), u(N);
for(int i = 0; i < N; i++) {
cin >> a[i] >> b[i];
v[i... | 0 | 93,611,757 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double x1,x2,y1,y2,s;
cin >> x1 >> y1 >> x2 >> y2;
s = sqrt( pow(x1 - x2, 2) + pow(y1 - y2, 2));
printf("%9.7f",s);
} | #include <stdio.h>
int main(void) {
int n;
int i;
scanf("%d", &n);
for(i=0; i<n; i++) {
int max, b, c;
scanf("%d %d %d", &max, &b, &c);
if (max < b) {
int tmp = max;
max = b;
b = tmp;
}
if (max < c) {
int tmp = max;
max = c;
c = tmp;
}
if (max * ma... | 0 | 81,995,820 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
vector<string> table(305);
int n;cin >> n;
rep(i,n) cin >> table[i];
int ans = 0;
rep(t... | #include <bits/stdc++.h>
using namespace std;
long long f(long long k){
return (k*(k-1))/2;
}
int main(){
long long n;
long long now=0;
cin>>n;
vector<long long> p(n,0);
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
a[i]--;
p[a[i]]++;
}
for(int i=0;i<n;i++){
now+=f(p[i]);
}
for(int... | 0 | 7,219,426 |
#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>
#include <cctype>
#in... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define ... | 0 | 8,652,572 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
double x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
x2 -= x1; y2 -= y1;
printf("%.7lf\n", sqrt(x2*x2 + y2*y2));
} | #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 INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
if(a==0) return b;
if (a < b) swap... | 0 | 21,558,492 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,last=0,num=0;
cin>>n;
for(int i=1;i<=n;i++){
long long x,y,sum;
cin>>x>>y;
num+=y;
sum=x*y+last;
while(sum>=10){
num+=sum/10;
sum=sum/10+sum%10;
}
last=sum;
}
cout<<num-1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100100;
int N;
ll D[MAXN];
vector <int> edge[MAXN];
map <ll, int> ord;
map <ll, int> ssize;
map <ll, ll> stot;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> D[i];
... | 0 | 58,559,948 |
#include <iostream>
using namespace std;
int main(void){
int N, a, b, c, d, e, f, g, h, i;
cin >> N;
a = N % 10;
b = N % 100 / 10;
c = N % 1000 / 100;
d = N % 10000 / 1000;
e = N % 100000 / 10000;
f = N % 1000000 / 100000;
g = N % 10000000 / 1000000;
h = N % 100000000 / 10000000;... | #include <iostream>
using namespace std;
int main(){
int n,array[100][100],a,b,c;
for(int i = 0;i < 100;++i){
for(int j = 0;j < 100;++j){
array[i][j] = 0;
}
}
cin >> n;
for(int i = 0;i < n;++i){
cin >> a >> b;
for(int j = 0;j < b;++j){
cin >> c;
array[a - 1][c - 1] = 1;
}
}
for(int i = 0;i < n... | 0 | 16,492,698 |
#pragma GCC optimize("O4")
#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9+7)
#define INF (1e17)
#define int ll
#define EPS (1e-6)
#define DB(x) #x<<" "<<x<<" "
using namespace std;
usi... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD... | 0 | 15,604,399 |
#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;
} | #include <cstdio>
#include <vector>
const int MN = 100005;
int N;
std::vector<int> G[MN];
int DFS(int u, int p) {
int ret = 0;
for (int v : G[u]) if (v != p) ret ^= DFS(v, u) + 1;
return ret;
}
int main() {
scanf("%d", &N);
for (int i = 1, x, y; i < N; ++i)
scanf("%d%d", &x, &y),
G[x].push_back(y),
G[y].push... | 0 | 91,536,708 |
#include <iostream>
using namespace std;
int n;
int F[45];
int fibo(int i) {
if (F[i]) {
return F[i];
}
F[i] = fibo(i - 1) + fibo(i-2);
return F[i];
}
int main() {
cin >> n;
F[0] = F[1] = 1;
cout << fibo(n) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <set>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
int N;
cin >> N;... | 0 | 83,690,828 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using ll = long long;
void PrintV(const vector<ll> v) {
for(int i = 0; i < v.size(); ++i)
cout << v[i] << "\t";
cout << endl;
}
int main() {
int n;
cin >> n;
vector<ll> v(n);
for(int i = 0; i... | 0 | 96,461,666 |
#include <stdio.h>
#define MAX 1000000
int isPrime[MAX];
int main(){
int num;
int i, j;
int count;
isPrime[0] = isPrime[1] = 0;
for(i = 2; i < MAX; i++){
isPrime[i] = 1;
}
for(i = 2; i * i < MAX; i++){
if(isPrime[i]){
for(j = 2 * i; j < MAX; j+=i){
isPrime[j] = 0;
}
}
}
while(scanf("%d", &num) != EOF){
count = 0;
while... | #include <iostream>
#include <cstdio>
using namespace std;
long long mod = 1e9 + 7;
long long modpow(long long x, long long n) {
x = x%mod;
if(n == 0){
return 1;
}
else if(n%2 == 1){
return(x*modpow(x, n-1))%mod;
}
else{
return modpow((x*x)%mod, n/2)%mod;
}
}
long lon... | 0 | 42,920,176 |
#include <cstdio>
#include <queue>
#include <map>
using namespace std;
typedef pair<int, int> P;
int a,b,n;
int point[20][20];
bool busy[20][20];
bool used[20][20];
int main(){
while(scanf("%d%d", &a, &b)){
if(a == 0 && b == 0) break;
for(int i = 0; i < 20; i++) for(int j = 0; j < 20; j++){
point[i][j] = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf(... | 0 | 97,174,693 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll inf=1e9+7;
const ll mo... | 0 | 18,447,067 |
#include <iostream>
#include<vector>
using namespace std;
int main(void){
int n;
cin >> n;
string s;
cin >> s;
vector<int> v(26,1);
for(int i = 0;i < s.size();i++){
v[s[i] - 'a']++;
}
long ans = 1;
for(int i = 0;i < v.size();i++){
ans = ans *... | #include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
using na... | 0 | 67,152,715 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> S(s.size());
for (int i = 0; i < s.size(); i++) {
S.at(i) = s.at(i);
}
int count = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (S.at(i) == S.at(j)){
c... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<long long> p( A );
for( int i = 0; i < A; i++ ) {
cin >> p[i];
}
vector<long long> q( B );
for( int i = 0; i < B; i++ ) {
cin >> q[i];
}
vector<long long> r( C );
for( int i = 0; i < C; i++ )... | 0 | 4,682,978 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
template<class T> inline b... | 0 | 76,064,657 |
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | #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();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 39,271,126 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <limits.h>
using namespace std;
int a[101][101];
int main(){
int n; scanf("%d",&n);
for (int i = 1; i <= n; ++i){
int u, k; scanf("%d %d",&u,&k);
int tmp;
while(k--){
scanf("%d",&tmp);
a[u][tmp] = 1;
}
}... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(),sdk.end()
#define mll map<ll, ll>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define repd(i,a,b) for(ll i=a;i>=b;--i)
#define hell 100000000... | 0 | 54,818,348 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp1[2010][2010];
ll dp2[2010][2010];
ll dp3[2010][2010];
ll dp4[2010][2010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll h,w;
cin>>h>>w;
vector<string>s;
string s1;
for(ll i=0;i<h;i++)
{
ci... | #include <stdio.h>
#include <string.h>
int main(){
int i;
char str[256];
char n[256];
scanf("%s", str);
int l = strlen(str);
for(i=0;i<l;i++)
n[i] = str[l-i-1];
printf("%s\n", n);
} | 0 | 19,905,757 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#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 rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vp... | 0 | 65,245,495 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long long INF = 1001001001;
const long long MOD = 1000000007;
const double EPS = 1e-10;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int m;
cin>>m;
ll d[m],c[m];
ll dig=0,sum=0;
for(in... | 0 | 13,224,787 |
#include <bits/stdc++.h>
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;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
long long s = 0;
if(a<=k){
s+=a;
k-=a;
}
else {
s+=k;
k=0;
}
if(k){
if(b<=k){
k=k-b;
}
else{
k=0;
}
if(k... | 0 | 37,712,830 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 86,545,176 |
#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() {
int n, r;
cin >> n >> r;
if (n >= 10) {
cout << r << endl;
}
else {
cout << r + 100 * (10 - n) << endl;
}
return 0;
}
l... | #include<bits/stdc++.h>
#define all(vc) vc.begin(),vc.end()
#define ll long long
#define MIN(a,b) ((a)<(b)) ? (a) : (b)
#define EVEN(a) (a)%2==0 ? 1 : 0
#define fi first
#define se second
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define DEBUG
#pragma GCC optimize("Ofast")
#pragma GCC ... | 0 | 84,845,779 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin >>n;
long long int sum=0;
for(long long int i =1;i<=n;i++)
{
sum+=i;
}
cout << sum;
} | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 0 | 97,554,883 |
#include <cstdio>
#include <algorithm>
using namespace std;
long long A[300003], X[300003];
int main() {
int i, j, n, m, a, b;
scanf("%d%d%d", &n, &a, &b);
if (a + b > n + 1 || (long long)a * b < n) {
puts("-1");
return 0;
}
n -= a + b - 1;
m = 0;
for (i = 0; i < a; i++) for (j = 0; j < b; j++) {
if (i == ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | 0 | 12,676,985 |
#include<cstdio>
#include<cstring>
int main(void){
int i,j;
int m[256];
int s[256]={0};
char c[256][201];
int d[256]={0};
int k=0;
while(1){
scanf("%s",c[k]);
if(strcmp(c[k],"-")==0) break;
while(c[k][d[k]]!='\0'){d[k]++;};
scanf("%d",&m[k]);
for(i=0;i<m[k];i++){
scanf("%d",&j);
s[k]=s[k]+j;
};
s[k]=s[k]%d[k... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
const ll INF = 1LL << 60;
ll d[201][201];
struct edge{int from,to; ll cost;};
int main(){
int n,m,... | 0 | 72,143,538 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int r = 0;
for (int i = a; i <= b; i++)
{
int s = i % 10;
int t = i / 10000 % 10;
int u = i / 10 % 10;
int v = i / 1000 % 10;
if (s == t && u == v)
{
r++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int> > vvint;
typedef vector<pair<int, int> > vpii;
typedef vector<p... | 0 | 60,001,898 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s,t; cin >> s >> t;
vector<string> ans;
int l = s.size() - t.size() + 1;
for(int i = 0; i < max(l,0); i++){
string tmp = s;
for(int j = 0; j < t.size(); j++){
if(i + j > s.size() - 1)break;
if(tm... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, L, T; cin >> N >> L >> T;
int X[100100], W[100100];
for(int i=0; i<N; i++){
cin >> X[i] >> W[i];
}
int fin[100100];
int pos;
for(int i=0; i<N; i++){
if(W[i]==1){
fin[i] = (T+X[i]) % L;
}
... | 0 | 75,521,619 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int d;
while (cin >> d) {
int s = 0;
for (int i = d; i <= (600 - d); i+=d) {
s += pow(i, 2)*d;
}
cout << s << endl;
}
} | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll a[1010];
ll sum[1010];
ll... | 0 | 78,942,539 |
#include<iostream>
#include<vector>
#include<string>
#include<array>
#include<algorithm>
#include<list>
#include<cmath>
#include<iomanip>
#include<queue>
#include<functional>
#include<climits>
#include<iterator>
#include<unordered_map>
using namespace std;
const double pi=4*atan(1.0);
int mod=1000000007;
int main() {
... | #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>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_bac... | 0 | 78,104,122 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <numeric>
using namespace std;
#pragma warning(disable: 4996)
#define _sort(v,type,order) do { sort(v.begin(),v.end(),order<type>()); } while(0)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define MAX 510000
#define INF 1<<30
#define LINF (ll)1<<62
#define rep(i,n) for(ll i=0; i<(n); i+... | 0 | 98,382,077 |
#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 _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector... | #include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
using vi = vector<int>;
using vii ... | 0 | 13,011,401 |
#define rep(i,n) for (int i=0;i<n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,R;
cin>> N >> R;
if(N>=10)
cout << R << endl;
else
cout << R + 100*(10-N) <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 50,671,953 |
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<int,int>&a,const pair<int,int>&b)
{
return (a.second<b.seco... | #include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld",... | 0 | 25,933,005 |
#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... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
bool flag=false;
int len=s.size();
for(int i=1;i<s.size();i++){
if((len-i)%2!=0)continue;
else{
string str1=s.substr(0,(len-i)/2);
strin... | 0 | 19,114,678 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | 0 | 9,896,516 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#define LP(i,n) for(int i=0;i<n;i++)
#define Mset(x,v) memset(x,v,sizeof(x))
using nam... | #include <bits/stdc++.h>
#include <vector>
#define rep(x, n) for(int i = x; i < (n); ++i)
using namespace std;
using ll = long long;
ll H, W;
vector<string> a(100);
int main(void)
{
cin >> H >> W;
rep(0, H) cin >> a.at(i);
vector<bool> row(H, false);
vector<bool> col(W, false);
for (int y = 0; y < H; ++y) {
... | 0 | 35,435,879 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
int main()
{
ll q,h,s,d; cin>>q>>h>>s>>d;
ll n; cin >> n;
ll t = 8*q;
t = min(t, 4*h);
t = min(t, 2*s);
t = min(t, d);
ll u = min(4*q, 2*h);
u = min(u, s);
cout << (n/2)*t + (n%2)*u << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<int> c(n);
rep(i,n) {
int px;
cin >> px;
p[i] = px-1;
}
rep(i,n) cin >> c[i];
ll ans... | 0 | 38,753,010 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int H, W, D;
cin >> H >> W >> D;
map<int, pair<int, int>> A;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
int a;
cin >> a;
A.insert(make_pair(a, make_pair(i, j)));
}
}
i... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using ll = int64_t;
using namespace std;
ll n,m;
ll a[100010];
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
REP(... | 0 | 19,422,392 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | #include<bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
int32_t main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int x;
cin>>x;
if(x<600)cout<<"8"<<endl;
else if(x<800)cout<<"7"<<endl;
else if(x<1000)cout<<"6"<<endl;
else if(x<1200)cout<<"5"<<endl;
else if(x<1400)cou... | 0 | 59,620,214 |
#include <iostream>
#include<algorithm>
using namespace std;
int main(void){
int A,B,m;
cin>>A>>B>>m;
int a[A];
int b[B];
for (int i = 0; i<A;i++){
cin>>a[i];
}
for (int i = 0; i<B;i++){
cin>>b[i];
}
int x[m];
int y[m];
int c[m];
for (int i = 0; i<m;i++){
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" <<... | 0 | 99,363,044 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int A, B;
cin >> A >> B;
bool one = false;
if ((A == 1) || (B == 1)) {
one = true;
}
if (one) {
if (A == 1 && B == 1) {
cout << "Draw" << endl;
} else if (A... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cctype>
#include <ctime>
#include <bitset>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#d... | 0 | 13,139,298 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int a, b, c, k;
cin >> a >> b >> c >>k;
if(k<=a){
cout << k << endl;
retu... | #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;
typede... | 0 | 99,259,824 |
#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... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ss second
#define ff first
#define INF 30000000000001
#define ll_max 9000000000000000001
#define mod 1000000007
#define PI 3.14159265358979323846L
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std... | 0 | 98,369,194 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
int cnt = 0;
for(int i = 1; i <= n; i++) {
string s = to_string(i);
int cmp = s.length();
if(cmp % 2 == 1) c... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, 1000) {
int t = i;
int cnt = 0;
for (int j = n - 1; j >= 0; j--) {
if (s[j] - '0' == t % 10) {
cnt++;
t /= 10;
if ... | 0 | 26,762,975 |
#include<iostream>
using namespace std;
int main(){
int n,a[101],minj,tmp,cnt=0;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n-1;i++){
minj=i;
for(int j=i;j<n;j++)if(a[j]<a[minj])minj=j;
tmp=a[i];
a[i]=a[minj];
a[minj]=tmp;
if(i!=minj)cnt++;
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | 0 | 86,642,618 |
#include<bits/stdc++.h>
using namespace std;
#define STR_MAX 1000
int mat[STR_MAX+1][STR_MAX+1];
int common_subsequence(int len1, int len2, string str1, string str2){
int i, j;
for(i=1; i<=len1; i++){
for(j=1; j<=len2; j++){
if(str1[i-1] == str2[j-1]) mat[i][j]=mat[i-1][j-1]+1;
else mat[i][j]=max(ma... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 0 | 51,440,892 |
#include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int main(){
int n;
cin >> n;
int num = 1;
int ans;
for(int i = 1; i <= n; i++){
if(num == n){
ans = num;
break;
}
else if( n... | #include <iostream>
#include <cctype>
#include <stdio.h>
using namespace std;
int main(void){
char ch;
while(1){
scanf("%c", &ch);
if(islower(ch)){
cout << static_cast<char>(toupper(ch));
}else if(isupper(ch)){
cout << static_cast<char>(tolower(ch));
}els... | 0 | 6,506,427 |
#include <bits/stdc++.h>
using namespace std;
#define ref(i,c,n) for(int i = n;i<c;i++)
int main()
{
int n;
cin>>n;
int arr[n],l = 100,r = 0,ans = 100000000;
ref(i,n,0)
{
cin>>arr[i];
l = min(arr[i],l);
r = max(arr[i],r);
}
for(int i = l;i<=r;i++)
{
int te... | #include <stdio.h>
int a[3][3];
int n;
int b[10];
int main()
{
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
scanf("%d",&a[i][j]);
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&b[i]);
bool memo[3][3]={};
for(int i=0;i<n;i++)
{
for(int j=0;j<3;j++)
for(int k=0;k<3;k++)
... | 0 | 86,010,725 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
while (true) {
int a, b; cin >> a >> b;
if (a == 0 && b == 0)break;
int n; cin >> n;
vector<vector<ll>> f(a + 1, vector<ll>(b + 1, false));
vector<vector<ll>> dp(a + 1, vecto... | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
using namespace std;
using ll... | 0 | 99,014,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
ll h, w;
cin >> h >> w;
if(h==1){
if(w==1){
cout << 1 << endl;
}else{
cout << w-2 << endl;
}
return 0;
}else if(w==1){
co... | #include <bits/stdc++.h>
using namespace std;
typedef long int li;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<ll> a(n,0);
for (int i=0; i<n; i++) cin >> a[i];
vector<ll> s(n+1, 0);
map<ll, ll> nums;
for (int i=0; i<n; i++) s[i+1] =... | 0 | 48,028,430 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
using namespace std;
map<... | 0 | 28,953,435 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int W,H,N;
cin >> W >> H >> N;
vector<vector<int>> m(H,vector<int>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
m.at(i).at(j)=1;
}
}
for(int i=0;i<N;i++){
int x,y,a;
cin >> x >> y >> a;
... | #include<stdio.h>
#include<iostream>
#include<utility>
#include<string.h>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++... | 0 | 91,760,253 |
#include <bits/stdc++.h>
using namespace std;
bool solve(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i == n % i) {
cnt++;
} else {
cnt += 2;
}
}
}
if (cnt == 8) {
return true;
} else {
return false;
}
}
int main() {
int... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 95,111,170 |
#include <bits/stdc++.h>
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a) ; i < (int)(b) ; i++)
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
struct Vec{
double x, y;
};
template<class T> inline bool chmin(T& a, T b) {
... | #include<iostream>
#include<algorithm>
using namespace std;
int p[101] = {};
int q[101] = {};
int main(){
int X, N = 0;
cin >> X >> N;
if(N == 0){
cout << X << endl;
return 0;
}
int flag = 1;
for(int i = 0; i < N; i++){
cin >> p[i];
if(p[i] == X){
flag = 0;... | 0 | 25,482,059 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const p... | 0 | 3,508,834 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
string S;
cin >... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#def... | 0 | 33,039,387 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 1e+5 + 5;
const ll LINF = 1LL << 50;
const int mod = 1e+9 + 7;
int N;
vector<vector<int>> G(MAX, vector<int>());
vector<vector<ll>> dp(MAX, vector<ll>(2));
vector<bool> used(MAX);
void dfs(int x) {
if (us... | #include <bits/stdc++.h>
using namespace std;
int main(void){
vector<string> str;
vector<int> cnt;
int n, m;
string tmp;
cin >> n;
for (int i=0; i<n; i++){
cin >> tmp;
auto itr = find(str.begin(), str.end(), tmp);
if (itr == str.end()){
str.emplace_back(tmp);
... | 0 | 23,905,270 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,k;
cin >> n >> k;
ll i,ans=0,j,mod=1e9+7;
for(i=k;i<=n+1;i++){
ll sum=0,sum1=0;
sum=i*(i-1)/2;
sum1=i*(n+n-i+1)/2;
ans+=sum1-sum+1;
ans%=mod;
}
cout <<... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void){
string s;
cin >> s;
for(int i =0;i!=s.size();i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2<<endl;
return 0;
}
if(s[i]==s[i+2]){
cout<< i+1 << " "<< i+3 << endl;
return 0 ;
}
}
cout << "-1 -1" << end... | 0 | 93,542,557 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c2;
int x1,x3;
cin >> x1 >> c2 >> x3;
if (c2=='+'){
cout << x1+x3 << endl;
}else{
cout << x1-x3 <<endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int M, K; std::cin >> M >> K;
if(M == 0) {
if(K > 0) fin(-1);
fin("0 0");
}
if(M ... | 0 | 46,198,239 |
#include <cstdio>
int A[101];
void swap(int *A, int i, int j) {
int t = A[i];
A[i] = A[j];
A[j] = t;
}
int selection_sort(int *A, int N) {
int swap_count = 0;
for (int i = 0; i < N; ++i)
{
int mini = i;
for (int j = i; j < N; ++j)
if (A[j] < A[mini])
m... | #include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while (cin >> n, n) {
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a.begin(), a.end());
int ans = a[n - 1] - a[0];
for (int i ... | 0 | 34,015,634 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
i... | #include<bits/stdc++.h>
#define int long long int
#define pb push_back
#define inf 1e9
#define pp pop_back
#define pii pair<int,int>
#define vec vector<int>
#define mp make_pair
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
while(t--)
{
i... | 0 | 99,474,086 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
#define ll long long int
ll pc(int n){
if(n<=1) return 0;
return (ll)n*(n-1)/2;
}
int main(){
int n;
cin>>n;
vector<int> a(n);
rep(i, n) cin>>a[i];
... | #include <bits/stdc++.h>
using namespace std;
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) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 0 | 2,307,880 |
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
string S, T;
cin >> S... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REP1(i,n) for(int i=1;i<=(int)(n);i++)
#define RREP(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
int main(){
int N,M,ans=0;
string temp;
vector<string> str;
vector<int> num;
cin >> ... | 0 | 51,304,987 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<string> grid(h);
for(int i = 0; i < h; i++) cin >> grid.at(i);
vector<vector<int>> dp(h, vector<int> (w, 100000));
if(grid.at(0).at(0) == '#') dp.at(0).at(0) = 1;
else dp.at(0).at(0) = 0;
for(int i = 0; i < h; i++)... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YE... | 0 | 42,469,539 |
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#d... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int d... | 0 | 67,927,576 |
#include <cassert>
#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <algorithm>
#include <string>
#include <set>
#include <limits>
#include <numeric>
#include <iterator>
using namespace std;
int main(){
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pair<double, double... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 84,551,065 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using PL = pair<ll,ll>;
int main()
{
string s; ll t; cin >> s >> t;
for(auto &i : s) i -= '0';
ll n = s.size();
vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(120, vector<ll>(2)));
dp[0][0][0] = 1;
for(ll i = 0; i <... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <math.h>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ull unsigned long long
#define ... | 0 | 6,799,029 |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limit... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
string s; cin >> s;
string sr = s;
reve... | 0 | 53,669,490 |
#include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int i = 0,n, h = 0, p, ans = 0;
double d ;
cin >> n;
ve... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define per(i,n) for(int i=(n)-1; i>=0; i--)
using namespace std;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
int n,k;cin>>n>>k;
map<char,int> score;
string hand = "spr";
rep(i,3)cin>>score[hand[i]];
string t;cin>>t;
... | 0 | 53,756,117 |
#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 int64_t INF=1e18+1;
const int mod = 100000000... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define UB upper_bound
#define LB lower_bound
#define PB push_back
#define mp make_pair
#define F first
#define S second
#define be(a) (a).begin(),(a).end()
#define deb(x) cout<< #x <<" "<<endl;
#define deb2(x, y)... | 0 | 85,853,387 |
#include <iostream>
using namespace std;
using ll = long long;
const ll INF = 1LL << 50;
int main() {
int N;
cin >> N;
ll sum = 0, minB = INF;
bool same = true;
for (int i = 0; i < N; ++i) {
ll A, B;
cin >> A >> B;
sum += A;
if (A > B) minB = min(minB, B);
if ... | #include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7... | 0 | 87,433,615 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const double PI = 3.141592653589793238460;
const int INF = 1e9+5;
int ans = INF;
int x;
void recur(int cost[], vector<int> books[], vector<int>& knowledge, int start, int n, int m, int& res){
bool flag=true;
for(int i = 0; ... | 0 | 9,659,340 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>> job(m+1);
rep(i,n){
int a,b;
cin>>a>>b;
if(a<=m) job[a].pb(b);
}
int ans = 0;
priority_queue<int> q;
rep(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; ++i)
cin >> a[i];
sort(a.begin(), a.end());
for(int i = 0; i < n - 1; ++i)
{
if(a[i] == a[i + 1])
{
cout << "NO" << "\n... | 0 | 62,732,310 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
vector<vector<int>> a(3, vector<int>(3));
rep(i, 3)rep(t, 3)
{
c... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <stack>
using namespace std;
const int maxn=1e5+5;
typedef long long ll;
struct node{
int id,w;
bool operator<(const node &n1)const{
return w>n1.w;
}
node(int... | 0 | 69,369,936 |
#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){
int h,w; cin >> h >> w;
vector<string> c(h);
rep(i,h) cin >> c[i];
vector<string> out(2*h);
for(int i = 0;i<h;i+... | #include <stdio.h>
#include <stdlib.h>
#define N 3000000
#define INF 1000000
int parent_key(int);
int left_key(int);
int right_key(int);
void BuildMaxHeap();
void maxHeapify(int);
void insert(int);
void HeapIncreaseKey(int,int);
int HeapExtractMax();
int n,A[N+1];
int main()
{
int key;
char length[10];
while(1)
... | 0 | 55,015,575 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,p; cin>>n>>m;
string s;
vector<int> ac(n,0);
vector<int> wa(n,0);
int sumAC=0,sumWA=0;
for(;m--;){
cin>>p>>s;
p--;
if(s=="AC") ac[p]=1;
else if(s=="WA"&&!ac[p]) wa[p]++;
}
for(int i=0;i<n;i++){
sumAC+=ac[i];
if(ac... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, c, k; cin >> n >> c >> k;
vector<int> t(n);
int ans = 0;
rep(i,n) cin >> t[i];
sort(t.begin(), t.... | 0 | 32,079,705 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int a[3];
scanf("%d %d %d", &a[0], &a[1], &a[2]);
sort(a, a + 3);
printf("%d %d %d\n", a[0], a[1], a[2]);
return (0);
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 42,949,327 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
ll sum(int n);
void go(){
string s,t;cin>>s>>t;
int a,b;cin>>a>>b;
string u;cin>>u;
if(u==t) b--;
if(u==s)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int64_t i=ini;i<n;i++)
#define _rep(i,ini,n) for(int64_t i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int64_t X,Y,A,B,C; cin>>X>>Y>>A>>B>>C;
vector<int64_t> P(A),Q(B),R(C);
rep(a,0,A) cin>>P.at(... | 0 | 41,178,238 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,n;
cin>>x>>n;
int sa=0;
int frag2=0;
vector<int> num(n);
for(int i=0;i<n;i++)
{
cin>>num.at(i);
}
for (int i = 0; i < 100; i++)
{
int frag=0;
int frag2=0;
for (int j = 0; j < n; j++)
{
if (num.at(j)==x+i)
{
frag++;... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define pb push_back
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int par[10004];
int rnk[10004];
void init(int n){
rep(i,n){
par[i]=i;
... | 0 | 3,114,652 |
#include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"
using namespace std;
typedef long long ll;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
const double EPS = 1e-10;
int main(){
string s... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespac... | 0 | 38,319,103 |
#include <iostream>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
ll powMod(ll a, ll p, ll mod){
if(p==1) return a;
if(p%2) return (a*powMod(a, p-1, mod))%mod;
ll t = powMod(a, p/2, mod);
return (t*t)%mod;
}
int main(){
ll x,y,m,n,k,pre=1,cnt=1;
cin >> ... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 7,874,112 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
#define rep(i, n) for(long int i = 0; i < n; i++)
int main(){
long int x, y, z, k;
cin >> x >> y >> z >> k;
long int a[x], b[y], c[z];
rep(i, x) cin >> a[i];
rep(i, y) cin ... | 0 | 56,086,096 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.