code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main(){
int d,a,sum;
while(cin >> d &&d){
a = 600 / d;
sum = 0;
for(int i=1;i<a;i++){
sum += d*d*i*d*i;
}
cout << sum << endl;
}
} | #include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using l... | 0 | 86,189,443 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
typedef long long ll;
typedef pair<int,int> pii;
int field[105][105];
int dp[105][105];
const int INF = 1e9+7;
int main(){
int h,w;
cin>>h>>w;
REP(i,h){
string s;
ci... | 0 | 13,865,887 |
#include<stdio.h>
int main(){
int m,f,r,ten;
while(1){
scanf("%d %d %d",&m,&f,&r);
if(m==-1 && f==-1 && r==-1){
break;
}
ten = m+f;
if(m == -1 || f == -1){
printf("F\n");
}else if(ten >= 80){
printf("A\n");
}else if(ten>=65 && ten<80){
printf("B\n");
}else if(ten>=50 && ten<65){
printf("C\n");
}els... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
int n; cin >> n;
int a, b... | 0 | 5,522,657 |
#include<bits/stdc++.h>
#define N 100005
using namespace std;
vector<int> g[N];
int n,m,a1,a2,a3;
int vis[N];
bool DFS(int u,int col){
vis[u]=col;bool ret=true;
for(int i:g[u])
if(vis[i]==0) ret&=DFS(i,col^1);
else if(vis[i]==vis[u]) ret=false;
return ret;
}
int main(){
scanf("%d%d",&n,&... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
string s; int w; cin>>s>>w;
int k=s.size();
rep(i,k){
if(i%w==0) cout<<s[i];
}
cout<<endl;
} | 0 | 71,164,838 |
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n, m;
LL x[N], y[N], z[N];
int main(... | #include <iostream>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
string s, t;
cin >> s >> t;
int n = s.size();
int m = t.size();
if (n < m)
{
... | 0 | 49,271,408 |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
t... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 | 35,719,113 |
#include <iostream>
#include <stdio.h>
#include <math.h>
struct point {
double x, y;
};
void koch(int d, point p1, point p2) {
if ( d == 0 ) {
return;
}
point s, t, u;
double rad = M_PI * 60.0 / 180.0;
s.x = ( 2*p1.x + 1*p2.x ) / 3;
s.y = ( 2*p1.y + 1*p2.y ) / 3;
t.x = ( 1*p1.x +... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<complex>
using namespace std;
long long int gcd(long long int a, long long int b) {
long long int tmp;
... | 0 | 90,681,509 |
#pragma GCC optimization ("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#incl... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 51,763,569 |
#include <algorithm>
#include <utility>
#include <cstdio>
#include <map>
using ll = long long;
int fa[100005], sz[100005];
ll arr[100005], val[100005];
std::pair<ll, int> app[100005];
std::map<ll, int> idx;
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%lld", arr + i);
idx[arr[i]] = ... | #include<iostream>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... | 0 | 73,314,164 |
#include<bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp,-1,sizeof(dp))
const ll mod = 1e9+7;
void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}
#define PI 3.14159265359
int sx,sy,tx,ty;
struct threeElements{
int _1st,_2nd,_3rd... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<string> ss(n, "");
ll ans = 0;
ll a = 0;
ll b = 0;
ll ba = 0;
rep(i, n) {
cin >> ss[i];
size_t it = 0;
if (ss[i]... | 0 | 90,664,660 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, S = 0;
cin >> N;
vector<int> A(N + 2, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
S += abs(A[i] - A[i - 1]);
}
S += abs(A[N + 1] - A[N]);
for (int i = 1; i <= N; i++) {
... | #include "bits/stdc++.h"
using namespace std;
#define debug(...) 42
using ll = long long;
bool check(string s, vector <char> v) {
int ptr = 0;
for(int i = 0; i < s.length(); i++) {
if(s[i] == v[ptr]) {
ptr++;
if(ptr == v.size()) return true;
}
}
return false;
}
void solve() {
... | 0 | 83,873,365 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
int main(){
int n;
cin>>n;
vector<int> dp(n+1);
dp[0]=1;
rep(i,n){
for(int j=0;j<=i-3;j++){
dp[i]+=dp[j];
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <ios>
#include <iomanip>
int main() {
int N,M;
std::cin >> N >> M;
std::vector<std::vector<int>> City(N+1,std::vector<int>(0,0));
std::vector<std::pair<int,int>> Input(M+1);
for(int i=1;i<M+1;i++){
int P_i... | 0 | 83,659,235 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
int N, M; cin >> N >> M;
vector<ll> X(N), Y(N), Z(N); for(int i = 0; i < N; i++) cin >> X[i] >> Y[i] >> Z[i];
ll Max = 0;
for(int f1 = 0; f1 < 2; f1++){
for(int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
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 cout << "Yes" << endl... | 0 | 45,424,503 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(v) v.begin(), v.end()
#define revall(v) v.rbegin(), v.rend()
constex... | #include<bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
int MAX=1e8;
int n,k;
int a[100005],dp[100005];
int f(int idx)
{
if(idx==n-1)
return 0;
int &ret=dp[idx];
if(ret!=-1)
return ret;
ret=f(idx+1)+abs(a[idx]-a[idx+1]);
for(int i=2; i<=k; i++)
{
... | 0 | 5,530,992 |
#include <iostream>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
k--;
cout << n - k << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
ll find(ll x, v... | 0 | 817,205 |
#define _GLIBCXX_DEBUG
#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 np next_permutation
#define fi first
#define se second
#define all(x) (x).b... | #include<iostream>
#include<cstdio>
using namespace std;
long long x,a[200005],h[200005],yh[200005],ans;
int main() {
int n;
scanf("%d",&n);
h[0]=0;
yh[0]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
h[i]=h[i-1]+a[i];
yh[i]=yh[i-1]^a[i];
}
int l=1;
... | 0 | 63,490,751 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
if (s.size() + 1 == t.size()) {
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == t.at(i)) {
count++;
}
else {
cout << "No" << endl;
return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
double pi = 3.14159265358979;
ll r(ll x, ll y) {
if (y == 0) return 1;
else if (y % 2 == 0) return r(x, y/2) * r(x, y/2);
else return x * r(x, (y-1)/2) * r(x, (y-1)/2);
}
int main() {
ll n, p;
cin >> n >> p;
vector<... | 0 | 89,363,314 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> X;
vector<int> Y;
for(;;){
int x, y;
cin >> x >> y;
if(x == 0 && y == 0) break;
X.push_back(x);
Y.push_back(y);
}
for(int i = 0; i < X.size(); i++){
int x = X.at(i), y = Y.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,y;
cin >> n >> y;
int a=-1,b=-1,c=-1;
for(int i=0;i<=n;i++){
for(int j=0;j<=n-i;j++){
if(10000*i+5000*j+1000*(n-i-j)==y){
a=i;
b=j;
c=n-i-j;
}
}
}
cout << a << ' '<< b << '... | 0 | 73,648,340 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct warshall_floyd {
int d[1000][1000];
int V;
warshall_floyd(int V) : V(V) {
for(int i=0; i<V; ++i) {
for(int j=0; j<V; ++j) {
if(i==j) d[i][j] = 0;
else d[i][j] = 1e+18;
}... | 0 | 51,205,127 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
if(A<=C){
if(A+B-C>=0)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
else cout<<"NO"<<endl;
} | #include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<stdio.h>
#include<queue>
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
#define N 15
int n;
int dis[N],maps[N][N];
int main()
{
int i,a,b,c,j,k;
while(scanf("%d",&n),n)
{
for(i=0;i<N;i++)
... | 0 | 64,797,938 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double a[2],b[2],c[2],p[2];
double matrix[2][2],ans[2],reverse[2][2],det,x,y;
while(cin >>a[0]>>a[1]>>b[0]>>b[1]>>c[0]>>c[1]>>p[0]>>p[1]){
b[0] = b[0]-a[0];
b[1] = b[1]-a[1];
c[0] = c[0]-a[0];
c[1] = c[1]-a[1];
p[0] = p[0]-a[0];
p[1] = p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int r, d, s;
cin >> r >> d >> s;
int n = 10;
while(n--) {
s = r * s - d;
cout << s << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | 0 | 49,939,782 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
#include <queue>
#define _USE_MATH_DEFINES
#include <math.h... | 0 | 8,894,663 |
#include "bits/stdc++.h"
using namespace std;
int main(){
int X,Y;
cin >> X >>Y;
int ans;
ans = X + Y/2;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#include <cstdint>
#include <sys/time.h>
typedef std::int_fast32_t s32;
typedef std::uint_fast32_t u32;
typedef std::int_fast64_t s64;
typedef std::uint_fast64_t u64;
int main(void) {
int isright[26] = {
0, 0, 0, 0, 0, 0, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1,
0, 0, 0, 0, ... | 0 | 19,996,510 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
reverse(s.begin(),s.end());
int k=0;
long long ans=0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='B'){
ans+=i-k;
k++;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,k,n,m,c,l,ans,f1,f2;
vector<pair<int,int> >v;
string s;
cin>>n>>m;
cin>>s;
for(i=0;i<n; i++){
if(s[i]=='0'){ f1=i;j=i;j++;
while(j<n){if(s[j]=='1') break;
j++;i++;
}
f2=j-1;
v.pu... | 0 | 95,608,540 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#de... | 0 | 89,869,504 |
#include <bits/stdc++.h>
#include <stdio.h>
using std::cout;
using std::cin;
using std::endl;
int main()
{
int n, b, f, r, v;
int info[4][3][10];
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
info[i][j]... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int m, n_min, n_max;
while(1) {
cin >> m >> n_min >> n_max;
if(m + n_min + n_max == 0) break;
vector<int> P(m);
for(int i = 0; i < m; i++) {
cin >> P[i];
}
int... | 0 | 6,409,052 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
if(n==1){
cout << 0 << endl;
return 0;
}
vector<ll>a(n);
for(ll i=0;i<n;i++){
cin >> a[i];
a[i]-=(i+1);
}
sort(a.begin(),a.end());
ll... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
using namespace std;
using lint = long long;
using v1i = vector<int>;
int main(){
int n, p; cin >> n >> p;
string s; cin >> s;
v1i v(n+1, 0), u(p-1, 1);
rep(i, p-2){
u[i+1] = u[i]*10;
u... | 0 | 56,208,343 |
#include<iostream>
using namespace std;
void selectSort(int* a,int n){
int trade = 0;
int minI,v;
for(int i = 0;i < n;i++){
minI = i;
for(int j = i + 1;j < n;j++){
if(a[j] < a[minI]){
minI = j;
}
}
v = a[i];
a[i] = a[minI];
if(i != minI)
trade++;
a[minI] = v;
}
for(int i = 0; i < n;i++){... | #include<iostream>
#include<vector>
#include<string>
#include<map>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inl... | 0 | 49,028,396 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <stdlib.h>
using namespace std;
int main(void){
int n;
cin >> n;
char c[10][5] = {
{'*', '*', '*', '*', '*'},
{'.', ',', '!', '?', ' '},
{'a', 'b', 'c', '*', '*'},
{'d', 'e', 'f', '*', '*'},
{'g', 'h', 'i', '*', '*'},
{'j... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define srt(x) sort((x).begin(), (x).end())
#define rsrt(x) sort((x).rbegin(), (x).rend())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd... | 0 | 47,048,020 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100010;
struct node{
ll sum;int id;
bool operator<(const node n)const{
return sum>n.sum;
}
}p[maxn];
int n,sz[maxn],fa[maxn];
int to[maxn],nxt[maxn],head[maxn],el;
ll sum[maxn],tot;
inline void add(int u,int v){
to[++el]=v;nxt[el]=h... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
cin >> N;
vector<int> vec(N);
rep(i, N){
cin >> vec.at(i);
}
int light = 1;
int count = 0;
bool goal = false;
rep(i, N)
{
light = vec.at(light - 1... | 0 | 70,737,803 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll N, A, B, C;
ll mp(vector<ll>& which_stick, vector<ll>& L)
{
ll res = -30;
vector<ll> length(3, 0);
for (ll i = 0; i < N; ++i)
{
if (which_stick.at(i) == 3)
{
continue;
... | 0 | 37,065,168 |
# include <algorithm>
# include <cassert>
# include <cctype>
# include <cstdio>
# include <cstdlib>
# include <cstring>
# include <cmath>
# include <iostream>
# include <map>
# include <queue>
# include <set>
# include <sstream>
# include <stack>
# include <string>
# include <vector>
# include <iomanip>
# define rep(i,... | #include<stdio.h>
int N,S;
int f(int n,int m,int s){
if(m==10){
if(S==s&&N==n)return 1;
return 0;
}
return f(n,m+1,s)+f(n+1,m+1,s+m);
}
int main(void){
while(1){
scanf("%d%d",&N,&S);
if(N==0&&S==0)break;
printf("%d\n",f(0,0,0));
}
return 0;
} | 0 | 48,611,086 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll md = 1000000007;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
vl p, fac(2, 1), ifac(2, 1);
ll add(ll a, ll b, ll mod = md) {
return (a%mod + b%mod + mod) % mod;
}
ll mul(ll a, ll b, ll mod = md) {
retu... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,m;
cin>>n>>m;
ll a[n];
priority_queue<int>q;
for(ll i=0;i<n;i++)
{
... | 0 | 93,081,437 |
#include <bits/stdc++.h>
int main(){
int N;
double v[50];
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> v[i];
}
std::sort(v, v+N);
for (int i = 0; i < N; i++) {
v[i+1] = (v[i] + v[i+1])/2;
}
std::cout << v[N-1] << std::endl;
} | #include <bits/stdc++.h>
#define N 200005
using namespace std;
int n;
int a[N];
map < int , int > b;
bool ok(int mij)
{
int i , k;
b.clear();
for(i = 2 ; i <= n ; i++)
if(a[i] <= a[i - 1])
{
b.erase(b.upper_bound(a[i]) , b.end());
k = a[i];
++b[k];
... | 0 | 53,816,123 |
#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... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
bool map[20][20];
long long int num[20][20];
int main(){
int a, b, n;
while(true){
cin >> a >> b;
if(a == 0 && b == 0){
break;
}
cin >> n;
int x, y;
for(int i = 0; i < 20; i++){
for(int... | 0 | 84,379,148 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n;
double ans=0;
cin>>n;
vector<double> x(n);
vector<string> u(n);
rep(i,n) cin>>x[i]>>u[i];
rep(i,n) {
... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 64,738,264 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
double x[N];
string y[N];
double total = 0;
for(int i = 0 ; i < N ; i++){
cin >> x[i] >> y[i];
if(y[i] == "JPY"){
total += x[i];
}else{
total += x[i] * 380000.0;
... | # include <bits/stdc++.h>
# define ll int64_t
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std;
bool compare_by_b(... | 0 | 100,715,822 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#define ll long long
#define ... | #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++)
typedef int64_t Int;
Int MOD = 1e9+7;
Int power(Int a, Int n){
if(a == 0) return 0;
if(n == 0) return 1;
Int res = 1;
while(n > 0){
if(n % 2 =... | 0 | 35,632,075 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int cnt = 0,X;
int main(){
int N,A,B,C,y;
while(true){
cin >> N >> A >> B >> C >> X;
if(N+A+B+C+X == 0)break;
cnt = 0;
vector<int> Y;
for(int i=0;i<N;i++){
cin >> y;
Y.push_back(y);
}
... | #include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for(ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef ... | 0 | 91,328,067 |
#include <bits/stdc++.h>
using namespace std;
#define vll vector<long long>
#define mll map<long long,long long>
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a>b)?b:a)
#define pb push_back
#define prll pair<long long,long long>
typedef long long ll;
typedef long double ld;
#define rep(i,a,n) for(ll i=a; i<n; i++)
... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define int long long
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define w(x) int x; cin>>x; while(x--)
#define mka(... | 0 | 45,807,575 |
#include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
... | #include <bits/stdc++.h>
using namespace std;
bool flags[21][21];
char maps[21][21];
int W, H;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dfs(int x, int y)
{
if(x < 0 || y < 0 || x >= H || y >= W || flags[x][y] || maps[x][y] == '#')return 0;
flags[x][y] = true;
int sum = 0;
for(int i = 0; i < 4; i+... | 0 | 57,291,061 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > > minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcoun... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define LINF 9223372036854775807
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | 0 | 42,929,377 |
#include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,1,a)
using namespace std;
int main(){
rep(i,10)
rep(j,10)
cout<<i<<"x"<<j<<"="<<i*j<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string S;
cin >> S;
string keyence = "keyence";
string value;
rep(i, S.size())
{
for (int j = i; j < S.size(); j++)
{
if (S.substr(0, i) + S.substr(j, S.siz... | 0 | 44,083,425 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(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 all(x) (x).begin(),(x).end()... | 0 | 4,494,928 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int w;
cin >> S >> w;
for(int i=0;i<S.size();i++){
if(i%w==0){
cout << S.at(i);
}
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vii vector<int>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define take(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define takes(a,n,st) for(ll i=st;i<n+st;i++)cin>>a[i]
ll ... | 0 | 4,060,906 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<ll> l(100);
l[0] = 2; l[1] = 1;
rep(i, 2, 100) l[i] = l[i-1] + l[i-2];
cout << l[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
using ll = ... | 0 | 46,627,015 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> r(n);
vector<int> l(n);
int res = 0;
for(int i=0; i<n; i++){
cin >> l[i] >> r[i];
res = res + (r[i] - l[i] + 1);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
int sum = 0;
int a,b,c;
a = b = c = -1;
for (int i = 0; i <= N; i++){
for (int j = 0; j <= N; j++){
if ((0 <= (N - i - j)) && ((N - i - j) <= N)){
sum = 10000 * i + 5000 * j + 1... | 0 | 21,478,374 |
#include <iostream>
#include<cmath>
using namespace std ;
int main()
{
long long R=0;
long long t,i,N,M;
cin>>N;
M=N-1;
long long*a= new long long[N];
long long*b= new long long[M];
for(i=0;i<N;i++)
{
cin>>a[i];
R+=a[i];
}
b[0]=a[0];
for(i=1;i<N-1;i++)
b[i]=b[i-1]+a[i];
for(i=0;i<N-... | #include <bits/stdc++.h>
using namespace std;
int main(){
int i, j, k;
int N, X[1000], Y[1000], S[1000];
cin >> N;
for(i=0; i<N; i++){
cin >> X[i] >> Y[i];
S[i] = X[i] + Y[i];
if((S[i] - S[0]) % 2 != 0){
cout << -1 << endl;
... | 0 | 36,854,931 |
#include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini freopen(name".inp","r",stdin); freopen(name".out","w",stdout)
#define foe(it,c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); it++)
#define long long long
#define db double
#define pii pair <int, int>
#define pll pair <long, long>
#de... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 7,011,903 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
int S=0;
for (int i=0; i<N; i++) {
cin >> A.at(i);
S+=A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int B;
if (S%(4*M)==0) {
B = S/(4*M);
}
else {
B = S/(4*M)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
ll x, y, z, k;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> x >> y >> z >> k;
ll a[x], b[y], c[z];
priority_queue<pair<ll, ll>>pq;
for(int i = 0;i < x;++i)
cin >> a[i]... | 0 | 43,266,149 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
map< string, ll > m;
for(int i=0;i<n;i++)
{
string s;
cin>>s;
sort( s.begin() ,s.end() );
m[s] ++;
}
ll ans =0;
auto it = m.begin();
for(;it!= m.... | #include "bits/stdc++.h"
using namespace std ;
#define timesaver ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll ;
typedef long double ldb ;
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define nl '\n'
#define all( x ) x.begin(),x.end()
#define sz( x ) ( int )( x... | 0 | 78,172,484 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
int inputNumber;
cin >> inputNumber;
d = inputNumber % 10;
inputNumber /= 10;
c = inputNumber % 10;
inputNumber /= 10;
b = inputNumber % 10;
inputNumber /= 10;
a = inputNumber;
if (b != c) {
cout << "No" << end... | 0 | 18,127,394 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> d;
for(int i=0; i<n; i++){
int x;
cin >> x;
d.push_back(x);
}
sort(d.begin(), d.end());
cout << d[n/2]-d[(n-1)/2] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, m; cin >> n >> m;
V<int> wa(n + 1, 0);
V<bool> ac(n + 1, false);
... | 0 | 6,811,460 |
#include <iostream>
#include <ios>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int C[10001] = {0};
int n = 0;
cin >> n;
int a = 0;
int mina = 10000;
for (int i = 0; i != n; ++i){
cin >> a;
++C[a];
if (a < mina) mina = a;
}
cout << mina;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
const ll LINF=1e18;
int main(){
int n;
cin>>n;
vector<pair<int,int>> v(n);
for(int i=0;i<n;i++){
int a;
cin>>a;
v[i]={a,-i};
}
sort(v.begin(),v.end());
ll ans[n]... | 0 | 64,465,037 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin>>n;
vector<string> p(n);
map<string,in... | #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 srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P... | 0 | 5,074,272 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar
#define gcu getchar_unlocked
#define pc(x) putchar(x);
#define pcu(x) putchar_unlocked(x);
#define ll long long int
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll gcd(ll a, ll b)
{
if(b==0)
return a;
else
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
#define f(i, l, r) for (int i = l; i <= r; i++)
#define rf(i, r, l) for (int i = r; i >= l; i--)
#define all(x) (x).begin(), (x).end()
#define sf(a) scanf("%d",&a)
#define llsf(a) scanf("%lld"... | 0 | 98,265,316 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using PQ = priority_queue<P,vector<P>,greater<P>>;
const ll MAX_V = 100... | #include <bits/stdc++.h>
using namespace std;
#define BE(x) (x).begin(), (x).end()
int main() {
int n, x, a;
cin >> n >> x;
if (n > 1000) {
cin >> a;
a = abs(a-x);
vector<int> b = {1, a};
for (int i = 2; i*i <= a; i++) {
if (a%i == 0) {
b.push_back... | 0 | 32,031,115 |
#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 < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
long long best = 0;
long long curr = 0;
for (int i = 0; i < n.length(); i++) {
if (n[i] == 'R')
curr++;
else {
best = max(best, curr);
curr = 0;
}
best = max(best, curr);
}
co... | 0 | 29,463,954 |
#include <iostream>
#include <complex>
#include <cmath>
#include <vector>
using namespace std;
typedef complex<double> P;
const double eps = 1e-8;
bool cross(P a, P b) {
return a.real()*b.imag() - a.imag()*b.real();
}
int main() {
int Tc;
cin >> Tc;
while(Tc--) {
vector<P> ps(4);
for(int i = 0; i < 4; +... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool e = true;
int a=s.size();
for(int i=0;i<(a/2);i++){
if(s.at(i) != s.at(a-1-i)){
e = false;
break;
}
}
int b = (a-1)/2;
for(int i=0;i<(b/2);i++){
if(s.at(i) != s.at(b-1-i)){
... | 0 | 42,308,772 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define All(V) v.begin(), v.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
int n; cin >> n;
cout << n*800 - (n/15)*200 << endl;
system("pause");
} | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | 0 | 15,238,837 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
c... | #include <iostream>
#include <bits/stdc++.h>
typedef long long ll;
#define lp(i,n) for(ll i = 0;i < ll(n);i++)
#define rlp(i,n) for(ll i = ll(n);i >= 0;i--)
#define rg(i,a,b) for(ll i = ll(a);i <= ll(b);i++)
#define wh(t) while(t)
#define re return
#define pb push_back
#define sz(s) (ll)(s.size())
#define NeverGiveUp i... | 0 | 5,404,576 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(i, n + 1) rep(j, n + 1) {
if ((n - (r * i + g * j)) % b == 0) {
int k = (n - (r * i + g * j)) / b... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int l, r;
cin >> l >> r;
if (l * r < 2019)
cout << l*(l + 1);
else if ((l - 1) / 2019 != (r / 2019))
{
cout << 0;
}
else
{
int min = LONG_MAX;
for... | 0 | 72,475,365 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a,b;
cin >> a >> b;
cout << (a % b != 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
string S, T; cin >> S >> T;
vector<int> s(26, -1);
vector<int> ... | 0 | 1,113,227 |
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " <... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T>... | 0 | 65,858,637 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
vector<ll... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s1, s2, s3; cin >> s1 >> s2 >> s3;
string res = {};
res.push_back(s1[0] + 'A' - 'a');
res.push_back(s2[0] + 'A' - 'a');
res.push_back(s3[0] + 'A' - 'a');
cout << res << endl;
return 0;
} | 0 | 1,101,862 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxn= 5e5+5;
#define mod 1000000007
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<array<ll,2>> adj[mxn];
bool vis[mxn];
ll ans=0,w,check;
ll dfs(int i, ll temp, int j){
vis[i]=true;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
vector<int> sq(128);
int i,j,k;
for(i=0;i<128;i++){
sq.at(i)=i*i;
}
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d,0));
for(i=0;i<n;i++){
for(j=0;j<d;j++){
cin >> x.at(i).at(j);
}
}
int s=0... | 0 | 6,392,754 |
#include <bits/stdc++.h>
#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i >= _##i p... | #include <iostream>
int main() {
using namespace std;
int a[9];
for (int i=0; i<9; i++){
cin >> a[i];
}
int n, b;
cin >> n;
for (int j=0; j<n; j++) {
cin >> b;
for (int i=0; i<9; i++){
if (a[i] == b) {
a[i] = -1;
}
}
... | 0 | 45,274,271 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define pb push_back
#define vi vector<int>
#define vpi vector<pair<int,in... | #include<iostream>
using namespace std;
int main()
{
static char num[5];
int i, sum;
do{
cin >> num;
sum = 0;
for(i = 0; *(num + i); i++){
sum = sum + static_cast<int>(*(num + i) - '0');
}
if(sum == 0) break;
cout << sum << endl;
}while(1);
retur... | 0 | 88,030,971 |
#include <stdio.h>
int main()
{
int m,f,r;
while(1){
scanf("%d %d %d",&m,&f,&r);
if(m==-1&&f==-1&&r==-1)
break;
else if(m==-1||f==-1)
printf("F\n");
else if(m+f>=80)
printf("A\n");
else if(m+f>=65&&m+f<80)
printf("B\n");
else if(m+f>=50&&m+f<65)
printf("C\n");
else if(m+f>=30&&m+f<50){
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,len,i=0,c=0;
string s,n,d,f,g,h;
cin >> s;
reverse(s.begin(), s.end());
n="maerd";
d="remaerd";
f="esare";
g="resare";
len=s.size();
while(len>i)
{
if(s.substr(i,5)==n)
{
h=h+n;
... | 0 | 79,345,391 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll n,q;
vector<ll>ch[200010];
ll pl[200010];
ll ans[200010];
void dep(ll now,ll sum){
for(ll i=0;i<ch[now].size();i++){
ll nex=ch[now][i];
if(ans[nex]!=-1){
continue;
}
ans[nex]=sum+pl[nex];
dep(... | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
string s, t, u;
cin >> s;
t = s;
sort(t.begin(), t.end());
for (char c = 'a'; c <= 'z'; ++c)
u.push_back(c);
string diff;
std::set_difference(u.begin(), u.end(), t.begin(), t.end(), std::inserter(diff... | 0 | 44,440,574 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int x, max, ans;
int count = 0;
for(int i=1; i<=n; i++) {
x = i;
while(true) {
if(x%2==0) {
count++;
x /= 2;
}
else if(count>=max) {
ans = ... | #define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long
ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) { ... | 0 | 53,549,143 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 7,806,347 |
#include <fstream>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define lli long long int
#define pii pair<int,int>
#define add(a,b) ((int) (... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int i = 0; i <= 9; ++i)
for(int j = 0; j <= 9; ++j... | 0 | 18,376,390 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void abc_170a();
void abc_171a();
void abc_172a();
void abc_173a();
void abc_174a();
void abc_175a();
void abc_170b();
void abc_171b();
void abc_172b();
int main()
{
abc_172b();
}
void abc_170a()
{
vector<int> x(5);
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
ll ans = 0;
ll c... | 0 | 96,700,221 |
#include <bits/stdc++.h>
#define pb push_back
#define sz(a) int(a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
using namespace std;
signed main()
{
int a,b;
cin>>a>>b;
if (a<9 && b<9) cout<<"Yay!";
else cout<<":(";
re 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
int rightx = -1000;
int lefty = 1000;
for(int i=0; i<N; i++){
int x;
cin >> x;
rightx = max(x, rightx);
}
for(int i=0; i<M; i++){
int y;
... | 0 | 71,110,558 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#define ill long long
#define rep(i, a, b) for(ill i = (ill)(a); i < (ill)(b); i++)
#define fcout cout << fixed << setprecision(10)
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if... | #include <bits/stdc++.h>
#include <tuple>
typedef long long int ll;
using namespace std;
int main() {
int primelist[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int num_of_prime[15];
int n;
cin >> n;
for (int i = 0; i < 15; i++) {
int n1 = n;
int count = 0;
... | 0 | 51,061,912 |
#include<algorithm>
#include<bitset>
#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_set>
#include<util... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int DPFibonacci(int x, vector<bool> v){
ll dp[1000010] = {0};
dp[0] = 1;
for(int i = 1; i < x+1; i++){
if(v[i] == false){
dp[i] = 0; continue;
}
if(i==1 && ... | 0 | 85,299,483 |
#include "iostream"
using namespace std;
int a[5000],b[5001];
int main(int argc, char const *argv[])
{
int n;
b[0]=0;
while(cin>>n,n)
{
int ma=-5000*100000;
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
for (int i = 0; i < n; ++i)
{
b[i+1]=b[i]+a[i];
}
for (int i = 1; i <= n; ++i)
{
for (in... | #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
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
ll solve(vector<ll> v) {
int n = v.size();
ll res = 0;
for (ll i=0; i<... | 0 | 70,326,423 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const ll INF = 1LL<<60;
const int ny[4] = {-1,1,0,0}, nx[4] = {0,0,-1,1};
int sy,sx,gy,gx;
int main(){
int n,m... | 0 | 31,433,857 |
#include<iostream>
#include<cmath>
using namespace std;
typedef struct xyz{
double x;
double y;
}XYZ;
int main(void){
int times;
cin >> times;
XYZ a,b,c,d;
double x1,y1,x2,y2;
while(times > 0){
cin >> a.x >> a.y;
cin >> b.x >> b.y;
cin >> c.x >> c.y;
cin >> d.... | #include <bits/stdc++.h>
using namespace std;
int main(){
int r;
double d;
cin >> r;
r = (3.14159265359)*r*r;
d = r/(3.14159265359*1);
cout << int(d)+1;
return 0;
} | 0 | 51,243,060 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 88,201,748 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
int main(void)
{
ll n,m;
cin >> n >> m;
Graph g(n+1);
for(int i=0;i<m;i++)
{
ll a,b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int w, h, n;
cin >> w >> h >> n;
vector<int> x(n), y(n), a(n);
rep(i, n) cin >> x[i] >> y[i] >> a[i];
int x_min = 0, y_min = 0, x_max = w, y_max = h;
rep(i, n)
{
if (a[i] == 1)
... | 0 | 31,579,389 |
#include<iostream>
using namespace std;
int main() {
int N;
cin>>N;
int a[N];
for(int i = 1; i <= N; i++) cin>>a[i];
for(int i = 1; i <= N; i++) {
cout<<"node "<<i<<": key = "<<a[i]<<", ";
if(i != 1) cout<<"parent key = "<<a[i/2]<<", ";
if(i*2 <= N) cout<<"left key = "<<a[i*2]<<", ";
if(i*2+1 ... | #include <bits/stdc++.h>
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define sz(x) x.size()
#define ll long long int
#define ls long int
#define start ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define test int t;... | 0 | 45,141,096 |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int a[1010];
void solve(int n){
REP(i,n)cin>>a[i];
sort(a,a+n);
int result=1e+7;
REP(i,n-1)
if(result>a[i+1]-a[i])
result=a[i+1]-a[i];
cout<<result<<endl;
}
in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 0 | 81,891,092 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
int n,m;cin>>n>>m;
vector<int> a(m);
vector<int> b(m);
int i;
int even=m/2;
int odd=m-even;
rep(i,odd)
{
a[i]=i+1;
b[i]=odd*2-i;
}
int add=odd*2;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
in... | 0 | 27,562,479 |
#include <iostream>
#include <stdio.h>
using namespace std;
static const int Nmax = 36;
typedef struct Card{
char suit;
char value;
} playcard;
void swap(playcard* a, playcard* b)
{
playcard p = *a;
*a = *b;
*b = p;
return ;
}
void printcards(playcard* array,int length)
{
for(int i = 0; i < length-1; i++)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
int n,m; cin >> n >> m;
vector<int> a(m);
rep(i, m) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>() );
vector<int> match_num{2 , 5 , 5 , ... | 0 | 27,838,483 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <iostream>
#include <map>
#include <cstdio>
using namespace std;
int main()
{
int n;
char to,from,*str;
map<char,char> hyou;
str = new char [10000001];
while(cin >> n && n ){
for(int i = 0; i < n; i++){
cin >> to;
cin >> from;
hyou.insert( make_pair(to,from) );
}
cin >> n;
for(int i = 0; ... | 0 | 45,020,994 |
#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(... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
using namespace std;
#define ll long long
#define debug_message 0
#define debug if (debug_message)
#define sz(x) (int)x.size()
int i,t,j;
int r,c,a,b,mp[1005][1005];
int rcnt[1005],ccnt[1005];
boo... | 0 | 8,480,208 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include <fstream>
#include <time.h>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class... | 0 | 36,572,252 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
long long quick_powll(long long x, long long n){
if(n == 0)
return 1;
if(n % 2 == 0)
return quick_powll(x * x % MOD, n / 2);
else
return x * quick_powll(x, n - 1) % MOD;
}
int main()
{
int n;
cin >> n;
vector<int> d(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 16,010,008 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int MAX = 510000;
const int INF = 1e9;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
vector<ll>a(n),b(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
vector<ll... | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <random>
#include <chrono>
#include <iomanip>
#define lint long long int
#define FOR(x, to) for(int x=0; x<(int)(to); x++)
#define DUMP(ar) for(int loop_dump=0; loop_dump<(int)ar.s... | 0 | 44,494,073 |
#include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b;
cin >> n >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
vector<int> arr(n);
for (int &x : arr)
cin >> x;
int l;
cin >> l;
int log = ceil(log2(n));
vector<vector<int>> par(n, vector<int>(log + 1)... | 0 | 19,737,777 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | #include<bits/stdc++.h>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define... | 0 | 54,090,704 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <t... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | 0 | 69,562,579 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s, ans;
int m;
while (true)
{
cin >> s;
if (s == "-")
break;
cin >> m;
while (m--)
{
int h;
cin >> h;
string temp = s.substr(0, h);
s.erase(0, h);
s += temp;
}
ans += s + "\n";
}
cout << ans;
return 0;
... | #include<cstdio>
#include<cctype>
int main(){
char c;
while(1){
scanf("%c", &c);
if(isalpha(c)){
if(islower(c)) printf("%c", toupper(c));
else printf("%c", tolower(c));
}
else printf("%c", c);
if(c == '\n')break;
}
return 0;
} | 0 | 94,006,808 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <iostream>
using namespace std;
int main()
{
long long n, ans = 0, k = 10;
cin >> n;
if(n & 1){
cout << 0 << endl;
return 0;
}
while (k <= n) {
ans += n / k;
k *= 5;
}
cout << ans << endl;
return 0;
} | 0 | 29,182,334 |
#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()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n),b(n);
vector<ll> dif(n);
ll asum=0,bsum=0;
rep(i,n){
cin >> a[i];
asum += a[i];
}
rep(i,n){
cin >> b[i];
bsum += b[i];
}
if(a... | 0 | 17,162,027 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> k(N+1);
k.at(0) = 2;
k.at(1) = 1;
for(int i = 2; i <= N; i++) {
k.at(i) = k.at(i-1) + k.at(i-2);
}
cout << k.at(N) << endl;
} | #include<iostream>
#include<string>
int main(void){
std::string S, T;
std::cin >> S >> T;
int counter = 0;
for(int i = 0; i < S.length(); i++)
if(S[i] != T[i]) counter++;
std::cout << counter << std::endl;
return 0;
} | 0 | 60,679,280 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<string.h>
#include<complex>
#include<math.h>
using namespace std;
typedef long long int llint;
typedef vector<int> vint;
typedef vector<llint> vllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a/gcd(a,b) * b;
}
ll func2(ll n){
ll res = 0;
while(n%2 == 0){
n /= 2;
res++;
}
return... | 0 | 90,923,706 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int h, w, k;
cin >> h >> w >> k;
vector<vector<char>> c(h,vector<char>(w));
for(int i=0; i<h; i++) for(int j=0; j<w; j++) cin>>c[i][j];
int ans=0;
for(int i=0; i<(1<<h); i++){
for(int j=0; j<(1<<w); j++){
... | 0 | 65,735,732 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.