code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namesp... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,s,n) for(int i = s; i < n; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
ll dp[110][10][2];
int main(){
string n;
cin >> n;
int k;
cin >> k;
dp[0][0][0] ... | 0 | 6,069,616 |
#include<iostream>
using namespace std;
int main(){
int x,y;
while(cin >> x >> y)
if(x==0&&y==0){
break;
}
else if(x<=y){
cout << x << " " << y << endl;
}
else
cout << y << " " << x <<endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int N, M;
cin >> N >> M;
vector<int> a(M), b(M), c(M);
rep(i, M){
... | 0 | 92,068,106 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n, k;
cin >> n >> k;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define in(v) (v).begin(),(v).end()
#define rin(v) (v).rbegin(),(v).rend()
#define inf 1e9+7
int solvius()
{
int n;
cin>>n;
vector<int> dp(3);
for(int i=0;i<n;i++)
{
vector<int> a(3),new_dp(3,0);
cin>>a[0]>>a[1]>>a... | 0 | 13,367,253 |
#include<stdio.h>
int main()
{
char a[201]={'x'},b[201]={'x'};
int i,t,p,n,m;
for(;a[0]!='-';){
scanf("%s",a);
if(a[0]!='-'){
scanf("%d",&n);
for(i=0;a[i]!='\0';i++){
b[i]='0';
}
for(t=0;t<n;t++){
scanf("%d",&m);
for(p=0;p<m;p++){
b[i-m+p]=a[p];
}
for(p=0;p<i-m;p++){
b[p... | #include <iostream>
#include <iomanip>
#include <complex>
#include <cmath>
static double pi = M_PI;
static void k(int n, std::complex<double>& p1, std::complex<double>& p2) {
if (n <= 0) {
return;
}
std::complex<double> s = (p1 * 2. + p2) / 3.;
std::complex<double> t = (p1 + p2 * 2.) / 3.;
s... | 0 | 28,902,258 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define co(x) cout << x <<endl
#define cs(x) cout << x <<" "
#define cer(x) cerr << x <<endl
#define ALL(x) (x... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 77,515,201 |
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
#define MAX_P 2000010
int fact[MAX... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
long long a,b;
cin>>a>>b;
if (a%b==0LL)
{
cout<<"-1\n";
}
else
{
cout<<a<<endl;
}
return 0;
} | 0 | 21,100,493 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h;
cin >> n;
int m = -1;
int res = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (m <= h) {
res++;
}
m = max(m, h);
}
cout << res << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[]) {
long long N, K, S;
cin >> N >> K >> S;
vector<long long> t(N);
for (int i = 0; i < N; ++i) {
if (K > 0) {
t[i] = S;
--K;
} else
if (S == 1000000000)
t[i] = S - 1;
... | 0 | 38,857,806 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 30,649,615 |
#include<bits/stdc++.h>
using namespace std;
int N,length[100001];
long long ans1,ans2;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>N;
for(int i = 1;i <= N;i++){
cin>>length[i];
}
sort(length + 1,length + N + 1);
for(int i = N;i >= 1;i--){
if(... | #include <iostream>
using namespace std;
int main(){
char buf[1030];
int n,bi,ki;
int kcount=0,kcode=0;
char kdata[10][10]={{0,5,3,3,3,3,3,4,3,4},".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
cin >> n;
for (int i=0;i<n;i++){
cin >> buf;
bi=-1;
kcode=0;
kcount=0;
while (buf[... | 0 | 42,555,828 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | #include <bits/stdc++.h>
using namespace std;
const int N=5e5+5,mod=1e9+7;
#define ll long long
int a[N];
pair<int,int> Best[N];
void update(pair<int,int> &p,int idx)
{
if(a[idx]>a[p.first]) swap(idx,p.first);
if(a[idx]>a[p.second]&&idx!=p.first) swap(idx,p.second);
}
int main()
{
ios_base::sync_with_stdio(... | 0 | 84,159,094 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 0 | 77,296,447 |
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<map>
#include<algorithm>
#include<set>
#include <stdexcept>
#include<queue>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
c... | #include <bits/stdc++.h>
using namespace std;
int n,a[100001],t;
vector<pair<int,int> > kq;
priority_queue<int> duong;
priority_queue<int,vector<int>,greater<int> > am;
void nhap()
{
scanf("%d",&n);
for (int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
}
sort(a+1,a+1+n);
}
void process()
{
int vt=... | 0 | 28,632,966 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
if (n == 1 || m == 1) {
if (n == 1 && m == 1) {
cout << 1 << endl;
return 0;
}
cout << max(0LL, max(n, m) - 2) << endl;
return 0;
} else if (n ... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | 0 | 53,939,073 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX(a,b) ((a)>(b)?(a):(b))
int LCS(string& wordA, string& wordB) {
int i,j;
int sizeA, sizeB;
vector<vector<int> > lcs;
sizeA=(int)wordA.size();
sizeB=(int)wordB.size();
lcs.resize(sizeA+1);
lcs[0].resize(sizeB+1);
for(i=0; i<=... | #include <stdio.h>
int main(){
int H1,H2,M1,M2,K;
scanf("%d %d %d %d %d",&H1,&M1,&H2,&M2,&K);
int sum1 = (H1*60) + M1;
int sum2 = (H2*60) + M2;
int sum3 = sum2 - sum1;
printf("%d", sum3 - K);
return 0;
} | 0 | 47,759,060 |
#include<bits/stdc++.h>
#define For(i,a,b) for(i=(a);i<=(b);++i)
#define Forward(i,a,b) for(i=(a);i>=(b);--i)
using namespace std;
template<typename T>inline void read(T &x)
{
T s=0,f=1;char k=getchar();
while(!isdigit(k)&&(k^'-'))k=getchar();
if(!isdigit(k)){f=-1;k=getchar();}
while(isdigit(k)){s=s*10+(k^48);k=get... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Pair vector<pair<ll,ll>>
#define vec vector <ll>
#define all(a) a.begin(),a.end()
#define mo 1000000007
#... | 0 | 24,714,481 |
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int main(){
int A[3][3];
int B[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> A[i][j];
B[i][j] = 0;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a, int b){
if(a < b) return gcd(b, a);
if(b == 0) return a;
return gcd(b, a%b);
}
signed main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
cin >> a[0];
int c = 0;
while(a[0] % 2 == 0){
a[0] /= 2;... | 0 | 78,461,119 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,k,res=0; cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++)cin>>arr[i];
sort(arr,arr+n);
for(int i=0;i<n;i++){
while(i<n-1 && arr[i]==arr[i+1])++i; res++;
}
if(res<=k)cout<<0;
else{ int M=200005,m=arr[n-1]; long c=0;
i... | #include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define sz size()... | 0 | 3,913,002 |
#include<bits/stdc++.h>
int n,x,y,h,w,res;
using namespace std;
int main(){
cin>>n>>h>>w;
while(n--){
cin>>x>>y;
if(x>=h&&y>=w) res++;
}
cout<<res;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
string First;
string Second;
int Judge = 0;
vector<int> Inner_judge(100, 1);
cin >> First;
cin >> Second;
for(int i = 0; i < First.size(); i++)
{
for(int j = 0; j < Second.size(); j++)
{
if(Second[j] != First[(i+j) % F... | 0 | 47,502,791 |
#include<iostream>
using namespace std;
#define N 100000
int main(){
int n,a;
a=N;
cin >> n;
while(n--){
a+=a/20;
if(a%1000)a=a-a%1000+1000;
}
cout << a <<endl;
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 mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 0 | 88,799,244 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
char a, b, c, d;
cin >> a >> b >> c >> d;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
for (int k = 0; k < 2; ++k) {
int sum = a - '0';
int d1 = b - '0';
int d2 = c - '0';
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 0 | 24,017,759 |
#include<iostream>
using std::cout;
using std::cin;
using std::endl;
void check(int W, int H, int x, int y, int r) {
if (x - r < 0 || x + r > W || y - r < 0 || y + r > H) {
cout << "No" << endl;
return;
}
cout << "Yes" << endl;
return;
}
int main(void) {
int W;
int H;
int x;
int y;
int r;
cin >> W >> H >> x >> y >> r;
... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf(... | 0 | 123,469 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
ll ans = K;
rep(i, N - 1) {
ans *= K - 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> a(N);
long long int y = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
y += a[i];
}
long long int x = 0;
long long int min = LLONG_MAX;
for (int i = 0; i < N - 1; i++) {
... | 0 | 95,088,901 |
#include<stdio.h>
int main(){
int h1,h2,m1,m2,k;
int a,b,c,d;
scanf("%d %d %d %d %d", &h1,&m1,&h2,&m2,&k);
a = (h1*60) +m1;
b=(h2*60) +m2;
c = b-a;
d = c- k;
printf("%d\n", d);
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {... | 0 | 87,979,782 |
#include<iostream>
using namespace std;
int main()
{
int a, b, c, d, ans[2];
for (int i = 0; i < 2; i++)
{
cin >> a >> b >> c >> d;
ans[i] = a + b + c + d;
}
if (ans[0] > ans[1])
{
cout << ans[0] << endl;
}
if (ans[0] < ans[1])
{
cout << ans[1] << endl;
}
if (ans[0] == ans[1])
{
cout << ans[0] << ... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 37,931,239 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int>a(n, 0);
for (int i = 0; i < n; i++) {
int tmp; cin >> tmp;
a[tmp-1]++;
}
int cnt = 0;
for (auto&& x : a) {
if (x)cnt++;
}
if (cnt <= k)cout << 0 << endl;
else {
int ans = 0;
... | #include <iostream>
#include <vector>
int main(int argc, char const* argv[])
{
while (true) {
int N, M, P;
std::cin >> N >> M >> P;
if (N == 0 && M == 0 && P == 0)
break;
std::vector<int> X(N);
double pool = 0.0;
for (int i = 0; i < N; ++i) {
std::cin >> X[i];
pool += X[i] * ... | 0 | 50,624,986 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using Graph = std::vector<std::vector<intt>>;
Graph G;
int main() {
intt A, B, C, K; std::cin >> A >> B >> C ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 28,599,501 |
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | #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>
vector<pair<char,int>> RLE(string S){
vector<pair<char... | 0 | 67,527,661 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
const long MOD = 1'000'000'007;
int main() {
long n, k; cin >> n >> k;
long ans = 0;
for (long i = k; i <= n+1; i++) {
long min = i * (i - 1) / 2;
long max = i * (n * 2 - i + 1) / 2;
ans += (max - min + 1) % MOD;
ans %= MOD;
}
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 10;
const ll INFLL = 3e18;
int main(){
ios_base :: sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s;
cin >> t;
reverse(t.begin(), t.end());
if(t == s) cout << "YES\n";
else cout << "NO\n";
return 0;
} | 0 | 80,450,211 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
string s, t;
cin >> s >> t;
int n = s.size();
rep(i,n){
bool flag = true;
rep(j,n) if(s[(i+j)%n] != t[j]) flag = false;
if(flag){... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
const int mod = 1e9 + 7;
for (int i = 1; i <= n... | 0 | 97,637,499 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include<iostream>
#include<cctype>
using namespace std;
int main()
{
string ch;
int num[26]={},i;
int test;
while(cin>>ch){
for(i=0;i<ch.size();i++)
if( isupper(ch[i])) ch[i] = tolower(ch[i]);
for(i=0;i<ch.size();i++){
test = ch[i] - 'a';
num[test]++;
}
}
cout <<"a : " <<num[0] <<"\n";
cout <<"b : " <<nu... | 0 | 29,760,262 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
int n, d[N];
int tot, fir[N], nxt[N << 1], to[N << 1];
long long a[N], f[N];
inline void addE(int u, int v) {
nxt[++tot] = fir[u], fir[u] = tot, to[tot] = v;
}
void dfs(int u, int p) {
if (d[u] == 1) return f[u] = a... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll K, A, B;
ll cookie = 1;
ll yen = 0;
bool change = false;
double BperA;
cin >> K >> A >> B;
for (int i = 0; i < K; i++) {
if (change) {
yen-=1;
cookie += B;
change = fals... | 0 | 45,127,188 |
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define MOD 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define loop(I,N) for(int i=I;i<N;i++)
#define sortvec(V) sort(V.begin(),V.end())
#define vec vector<i... | #include <iostream>
using namespace std;
#define INIT 0
#define TRUE 1
int main() {
int x = INIT;
int y = INIT;
int tmp = INIT;
while (TRUE) {
cin >> x;
cin >> y;
if ((x == 0) && (y == 0)) {
break;
}
else {
if (x > y) {
... | 0 | 84,776,595 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
const long long INF = numeric_limits<long long>:... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 0 | 93,784,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=100005,INF=1<<28;
int main(){
std::ifstream in("text.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
while(1){
int N;cin>>N;
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 998244353
using namespace std;
ll solve(vector<ll> &a) {
ll res = 0, n = a.size();
while(*max_element(all(a)) >= n) {
*max_element(all(a)) -= n + 1;
for(int i = 0; i < n; i++) {
a[i]++;
... | 0 | 22,453,839 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long lo... | #include <iostream>
#include <vector>
using namespace std;
vector<int> G[100000];
bool used[100000];
int grundy[100000];
void dfs(int v){
used[v] = true;
grundy[v] = 0;
for(int i = 0; i < G[v].size(); i++){
if(!used[G[v][i]]){
dfs(G[v][i]);
grundy[v] ^= (grundy[G[v][i]]+1);
... | 0 | 48,968,999 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
struct edge {
int to;
int weight;
ed... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
int N; cin>>N;
vector<int> X(N); rep(i,N) cin>>X[i];
int mimu = 1e9;
for(int i=1; i<=100; i++){
int sum=0;
for(int j=0; j<X.size(); j++){
sum += (i-X[j])*... | 0 | 72,473,707 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IN freopen("in.txt","r",stdin)
#define OUT freopen("out.txt","w",stdout)
#define pi pair<int,int>
#define F first
#define S second
#define pb push_back
#define pp pop_back
#define mod 1000000007
#define pai acos(-1)
#define N 100005
ll ar[N],dp[... | #include <bits/stdc++.h>
using namespace std;
namespace IO
{
const int __S=(1<<20)+5;char __buf[__S],*__H,*__T;
inline char getc()
{
if(__H==__T) __T=(__H=__buf)+fread(__buf,1,__S,stdin);
if(__H==__T) return -1;return *__H++;
}
template <class __I>inline void read(__I &__x)
{
... | 0 | 47,090,787 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
const int mod = 1e9 + 7;
int main(){
char a;
cin >> a;
if ('a' <= a && a <= 'z') cout << 'a' << endl;
else cout << 'A' << ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> degree(n);
for(int i=0; i<m; i++){
int a, b;
cin >> a >> b;
a -= 1;
b -= 1;
degree[a] += 1;
degree[b] += 1;
}
for(int i=0; i<n; i++){
if(degree[i... | 0 | 33,413,598 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <numeric>
#include <sstream>
#include <queue>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a);... | #include<cstdio>
#include<algorithm>
#include<utility>
#include<vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
typedef std::pair<int, int> P;
int N, M;
std::vector<P> ps;
int main()
{
while( scanf( "%d%d", &N, &M ), N|M )
{
ps.clear();
rep( i, N )
{
int d, p;
... | 0 | 54,584,964 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
vector<bool> abc(26,0);
cin >> S;
for(int i = 0; i < S.size(); i++) {
if(abc.at(S.at(i) - 'a')) {
cout << "no" << endl;
return 0;
} else {
abc.at(S.at(i) - 'a') ... | /*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int l, r, count = 0;
cin >> l >> r;
for (int i = l; i <=r; i++)
{
int x = i;
string s = to_str... | 0 | 92,472,576 |
#include<iostream>
#include<stdio.h>
using namespace std;
using ll=long long;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
using P=pair<int,int>;
int main(){
int n;
string s,t;
cin>>n>>s;
t=s.substr(0,n/2);
t=t+t;
if(t==s)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 6,843,223 |
#include<iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
uint32_t H, W;
cin >> H >> W;
if (H == 1 || W == 1)
cout << 1 << endl;
else
cout << W * (uint64_t)(H / 2) + (H % 2) * ((uint64_t)((W + 1) / 2)) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
static const long long INFTY = (1LL << 32);
void WarshallFloyd(long long weight[][100], int verNum) {
for (int k = 0; k < verNum; k++)
for (int i = 0; i < verNum; i++) {
if (weight[i][k] == INFTY) continue;
for (int j = 0; j < verN... | 0 | 31,759,235 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H;
cin >> H;
vector<int> A(H);
for (int i = 0; i < H; i++){
cin >> A[i];
}
for (int i = 0; i < H; i++){
cout << "node " << i + 1 << ": ";
cout << "key = " << A[i] << ", ";
if (i > 0){
cout << "parent key = " << A[(i - 1) / 2... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<memory.h>
using namespace std;
int dp[1001][1001];
int n;
int solve(string a,string b)
{
int len1=a.size(),len2=b.size();
for(int i=0;i<=len1;i++)
dp[i][0]=i;
for(int j=0;j<=len2;j++)
dp[0][j]=j;
for(int i=1;i<=len1;i++)
for(int... | 0 | 48,574,136 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B;
vector<int>P(N);
int count1 = 0;
int count2 = 0;
int count3 = 0;
for (int i = 0; i < N; i++) {
cin >> P.at(i);
if (P.at(i) <= A){
count1++;
}
else if (P.at(i) <= B){
count2++;
}
el... | #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 | 45,840,506 |
#include <bits/stdc++.h>
using namespace std;
signed main () {
string s, t;
cin >> s >> t;
int n = s.size();
map < char, char > assigned;
bool fucked = 0;
for (int i = 0; i < n; ++i) {
if (assigned.find(s[i]) == assigned.end())
assigned[s[i]] = t[i];
else if (assigned... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,k,i=0,j,c=0,p,m=0,max=0,h[100000],dp[100000],saisyo=100000000;
string s;
cin >> n >> k;
for(i=0;i<n;i++)
{
cin >> h[i];
}
for(i=1;i<=k;i++)
{
dp[i]=abs(h[0]-h[i]);
}
for(i=k;i<n;i++)
... | 0 | 61,475,640 |
#include <stdio.h>
int main(){
int W = 0;
int H = 0;
int x = 0;
int y = 0;
int r = 0;
bool judge = true;
scanf("%d %d %d %d %d", &W, &H, &x, &y, &r);
if ((x - r) < 0 || (x + r) > W){
judge = false;
}
if ((y - r) < 0 || (y + r) > H){
judge = false;
}
printf("%s\n", (judge ? "Yes" : "No"))... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 85,567,502 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N; cin >> N;
ll res = to_string(N).size();
ll A,B;
for (ll A=1; A<=sqrt(N); A++){
if (N%A != 0) continue;
B = N/A;
res = min((ll)log10(B)+1, res);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 74,280,774 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long q,h,s,d,n,ans=0;
cin >> q >> h >> s >> d >> n;
h=min(h,q*2);
s=min(s,h*2);
d=min(d,s*2);
cout << d*(n/2)+s*(n%2) << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
... | 0 | 7,025,760 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
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) {... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
using db = double;
using vll = vector<long long>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#de... | 0 | 83,397,798 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int INF = 2100000000;
class Heap{
public:
vector<int> a;
int N;
Heap(int n){
N = n;
a.resize(N, INF);
N--;
}
int get_parent(int x){
return a[(x)/2];
}
int get_left(int x){
if(x*... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i)=(n); (i)<(m); ++i)
constexpr ll INF = 1LL << 62;
constexpr int mod = 1e9+7;
int main(){
int K, N;
cin >> N >> K;
vec... | 0 | 7,711,616 |
#include <bits/stdc++.h>
using namespace std;
# define LL long long
int main(){
LL a;
float b;
scanf("%lld%f",&a,&b);
b=b*100;
b=round(b);
int b_=b;
LL ans=a*b_;
ans/=100;
printf("%lld",ans);
} | #include <bits/stdc++.h>
using namespace std;
void b(vector<int> A,vector<int> B,vector<int> C,int &k){
int j=0;
for(int i=0;i<3;i++){
j+=abs(A[i]-C[i]);
j+=10*(B[i]-1);
}
k=min(k,j);
}
void a(vector<int> A,vector<int> B,vector<int> C,vector<int> L,int N,int j,int &k){
if(j==N){
if(A[0]!=0 && A[1]... | 0 | 19,921,482 |
#include<iostream>
int main(){
int d,n,sum;
while(std::cin >> d){
n = 600/d;
for(int i=0;i<n;i++){
sum += i*i*d*d*d;
}
std::cout << sum << std::endl;
sum = 0;
}
} | #include <stdio.h>
int main(){
int array[10][10];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &array[i][j]);
}
}
int brpKali;
scanf("%d", &brpKali);
int percobaan[100];
for(int k=0;k<brpKali;k++){
scanf("%d", &percobaan[k]);
}
for(int l... | 0 | 75,157,052 |
#include<bits/stdc++.h>
#define boost ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
using namespace std;
void sol(){
int h,n;
cin >>h >> n;
int a[n];
int sum=0;
for(int i=0;i<n;i++){
cin >>a[i];
sum+= abs(a[i]);
}
if (sum>=h){
cout << "Yes";
}
... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=1e9;
const ll INF=1e18;
int main() {
cin.tie(0),cout.tie(0);
ios... | 0 | 3,185,647 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define FF first
#define SS second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).siz... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 4,641,212 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
if (n == 1 && m == 1) {
cout << 1 << endl;
}else if (n < 2 || m < 2) {
cout << max({ m - 2, n - 2, 0 }) << endl;
}
else if (n == 2 || m == 2) {
cout << 0 << endl;
}
else {
long long ans = (long long)n * m... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong a, b;
llong wh, bl;
char mp[505]... | 0 | 7,116,239 |
#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 <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
int main(){
int n,k; cin >> n >> k;
vector<ll> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
ll ans=1e18;
for(int i=0;i<(1<<n);i++){
if(__builtin_popcount(i)>=k){
ll... | 0 | 78,199,971 |
#include<iostream>
#include<vector>
#include<string>
#include<stdlib.h>
using namespace std;
vector<string> ans;
string bot[10] = {"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int main(){
int n;
cin >> n;
for(int i = 0;i < n;i++){
string mess;
string code;
cin >> code;
int count = 0;
for(... | #include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
#include <cmath>
using namespace std;
using ll = long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
template <class T>
void updatemax(T& a,... | 0 | 5,143,490 |
#include <iostream>
#define llint long long
#define mod 1000000007
using namespace std;
llint n, m;
llint x[100005], y[100005];
llint calc(llint p[], llint N)
{
llint sum = 0, ret = 0, tmp;
for(int i = 0; i < N; i++){
tmp = (i*p[i]) % mod;
tmp -= sum;
tmp = (tmp + mod) % mod;
sum += p[i];
sum %= mod;
ret ... | # include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
string s;
ll k;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>s;
cin>>k;
ll cnt=0;
l... | 0 | 67,738,818 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
int N,K,R,S,P;
string T;
cin >> N >> K >> R >> S >> P >> T;
int ans = 0;
bool add[N];
REP(i,N){
if(i< K){
... | #include<iostream>
#include<algorithm>
using namespace std;
int N;
int A[100000];
void all_minus(){
int M = A[N - 1];
for(int i = 0; i < N - 1; i++){
M -= A[i];
}
cout << M << endl;
int left = A[N - 1];
for(int i = 0; i < N - 1; i++){
cout << left << ' ' << A[i] << endl;
left -= A[i];
}
}
void... | 0 | 6,817,117 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<unordered_map>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int N=1e5+10;
ll d[N];
unordered_map<ll,vector<int> > p;
ll cnt[N],sum[N],n,r[N];
vector<pair<int,int> > w;
bool comp(int a,int b){
return d[a]>d[b];
}
int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))... | 0 | 93,880,040 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans[55];
pair<int, int> s[55], c[55];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i].first >> s[i].second;
}
for (int i = 0; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for(l... | 0 | 48,128,487 |
#include <bits/stdc++.h>
#define int long long
#define fast_io(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(x) x.begin(),x.end()
#define us unordered_set
#define um unordered_map
#define ms multiset
#define mm multimap
#define pb push_back
#define pf pus... | #include<bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld,lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout<<endl<<"answer : ";
#define maxn 100005
#define messi ios_base::sync_with_stdio(false);cin.tie(NULL)... | 0 | 98,166,431 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, foo;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> foo;
}
cout << (N - 2) / (K - 1) + 1;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
using namespace std;
int main(void) {
int m,f,r;
char g;
for (;;) {
cin >> m >> f >> r;
if (m==-1 && f==-1 && r==-1) break;
if (m==-1 || f==-1) {
g = 'F';
} else if (m+f... | 0 | 67,805,459 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long a;
double b;
cin >> a >> b;
int B = b*100+0.001;
a *= B;
cout << a/100 << endl;
} | #include <iostream>
#include <vector>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
int main(void) {
Int n;
cin >> n;
vector<Int> c(n);
vector<Int> s(n);
vector<Int> f(n);
for (Int i = 0; i < n; ++i) {
cin >> c[i] >> s[i] >> f[i];... | 0 | 3,374,903 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int year, month, day;
cin >> year >> month >> day;
int ans = 0;
if (year % 3 == 0 || month % 2 == 1) {
ans += 20 - day;
} else {
ans += 19... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll MOD=1e9+7;
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
const int MAX = (int)1e6;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2... | 0 | 7,533,975 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
ll n;
cin >> n;
map<string,ll> mp;
rep(i,n){
string s;
cin >> s;
sort(s.begin(),s.end());
mp[s]++;
}
ll ans = 0;
for(auto ... | #include<iostream>
using namespace std;
int main(){
double a,b,c,d,e,f,g,h;
int n;
int x,y;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a>>b>>c>>d>>e>>f>>g>>h;
x=(d-b)/(c-a);
y=(h-f)/(g-e);
if((d-b)/(c-a)==(h-f)/(g-e)){cout<<"YES"<<endl;}
else {cout<<"NO"<<endl;}
}
} | 0 | 36,522,013 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long n=2,m=1;
for(int i=0;i<N;i++){
m=n+m;
n=m-n;
}
cout << n << endl;
} | #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 main() {
map<char,int> mp;
rep(i,4){
char s; cin >> s;
auto itr = mp.find(s);
if( itr != mp.end() )
mp[s]++;
else
mp[s] = 1;
}
bool ... | 0 | 46,905,876 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#incl... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 21,028,384 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string ans = ( a <= 8 && b <= 8 ) ? "Yay!" : ":(";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin>>n>>d;
vector<vector<int>>a(n,vector<int>(d));
for(int i=0;i<n;i++){
for(int j=0;j<d;j++){
cin>>a[i][j];
}
}
int kotae=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
int kyori=0;
for(int k=0;k<d;k++){
... | 0 | 52,038,333 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int>H(N);
for (int i=0; i<N; i++)
cin >> H.at(i);
int max=0,cnt=0;
for (int i=0; i<N-1; i++){
if (H.at(i) >= H.at(i+1)){
cnt++;
}else{
if (max < cnt)
max = cnt;
cnt = 0;
}
}
if (ma... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N; cin >> N;
vector<ll> a(N, 0);
map<ll, ll> m;
for (int i = 0; i < N; ++i) {
cin >> a[i];
m[a[i]]++;
}
vector<ll> T;
for (a... | 0 | 50,223,278 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n) ; i++)
constexpr auto INF = 2147483647;
typedef long long ll;
static const int MAX = 100000;
vector<int> adjGraph[MAX];
list<int> ans;
bool check[MAX];
int N;
int indeg[MAX];
void bfs(int start){
queue<int> que;
que.push(start);
... | 0 | 83,780,306 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 100000000... | 0 | 53,627,730 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int a[9], h;
int main(){
for(int i = 1; i <= 5; i++){
cin >> a[i];
}
for(int i = 1; i <= 4; i++){
for(int u = 5; u > i; u--){
if(a[u] > a[u-1]){
h = a[u];
a[u] = a[u-1];
a[u-1] = h;
}
}
}
for(int i = 1; i <= 5; i++){
if(i == ... | #include<stdio.h>
int MAX(int *num,int n,int k){
int i,now,max = 0;
for(i = 0;i < k;i++){
max += num[i];
}
now = max;
for(i = 0;i < n-k;i++){
now += num[i+k]-num[i];
if(max < now)
max = now;
}
return max;
}
int main(){
int n,k,max;
int *num;
int i;
while(1){
scanf("%d%d",&n,&k);
if(n == 0 && k =... | 0 | 85,723,208 |
#include<bits/stdc++.h>
#define ll unsigned long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
using namespace std;
const int N=3e5+10;
set<pii>s;
int r[N],c[N],id1[N],id2[N];
int main()
{
int h,w,m;
scanf("%d%d%d",&h,&w,&m);
for(int i=1;i<=m;i++)
{
in... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 31,498,117 |
#include<bits/stdc++.h>
using namespace std;
struct XY
{
int x;
int y;
};
int main ()
{
string a;
getline(cin,a);
while(a!=".")
{
bool ok = false;
stack<int> x;
for(int i=0;i<a.size();i++)
{
if(a[i]=='(')x.push(1);
if(a[i]==')')
{
if(x.empty())
{
ok =true;
}
else if(x.top()==... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#incl... | 0 | 65,108,714 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | 0 | 81,289,858 |
#include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cctype>
#include <map>
#include <set>
const int INT_INF = 1e9;
const long long LONG_INF = 1e18;
const long long MOD = 1e9 + 7;
const double PI = 3.14159265358979323846;
using namespace std;
int mai... | 0 | 55,596,535 |
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) for(int i=a; i>=0; i--)
#... | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<limits>
#include<numeric>
#include<math.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
template<class T>bool ch... | 0 | 76,597,926 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
int main() {
int h, w, d;
cin >> h >> w >> d;
vector<vector<int>> a(h, vector<int>(w));
rep(i,h... | 0 | 6,795,986 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main()
{
ll s, c;
cin >> s >> c;
if (c <= 2 * s) cout << c / 2 << endl;
else cout << s + (c - 2 * s) / 4 << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 92,063,479 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
bool flag=false;
for(int i=1;i<=b;i++){
if((a*i%b)==c){
flag=true;
break;
}
}
cout<<(flag?"YES":"NO")<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> dist(N, vector<i... | 0 | 59,694,977 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> d(n);
REP(i,n) {
cin >> d[i];
}
int ans = 0;
REP(i,n) {
REP(j,n) {
if(i != j) ans += d[i]*d[j];
}
}
cout << ans/2 << endl;
} | #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include ... | 0 | 61,568,179 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=1e5;
const int inf=1e9;
int K;
vector<pair<int,int>> g[2][size];
int d[2][... | #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 | 59,319,266 |
#include <bits/stdc++.h>
using namespace std;
bool check(vector<string> words){
int n = words.size();
for (int i=0; i<n-1; i++){
if (words[i].back() != words[i+1].front()){
return false;
}
}
for(int i=0; i<n; i++){
for (int j=i+1; j<n; j++){
if (words[i] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef v... | 0 | 17,299,106 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll L, R, mi = 2000000000;
cin >> L >> R;
if((L / 2019 + 1) * 2019 <= R) cout << 0 << endl;
else {
for(ll i = L; i <= R - 1; i++) {
for(ll j = i + 1; j <= R; ... | #include<iostream>
using namespace std;
int main(){
int l,r;
int n;
while(cin>>n,n!=0){
l=r=false;
int ans = 0;
bool on = false;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s=="lu"){
l = true;
}else if(s=="ru"){
r = true;
}else if(s=="ld"){
l = ... | 0 | 3,645,429 |
#include <cstdio>
#include <cmath>
#define PI 3.1415926535
using namespace std;
int n;
void koch_curve(double p1x,double p1y,double p2x,double p2y, int current) {
if(current == n) {
printf("%.8lf %.8lf\n",p2x,p2y);
return;
}
double sx = (2.0*p1x + p2x) / 3.0;
double sy = (2.0*p1y + p2y) / 3.0;
double ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | 0 | 2,208,893 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b,c,d;... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int n, m;
vvi adj(200001);
vector<bool> visited(200001);
int dfs(int src)
{
if (visited[src])
return 0;
visited[src] = true;
int res = 1;
for (int a ... | 0 | 82,592,558 |
#include<iostream>
using namespace std;
int n;
int bfs(int now,int d){
int ans=0;
if(d==4){
if(now==n)return 1;
else return 0;
}
else{
for(int i=0;i<10;i++)ans+=bfs(now+i,d+1);
}
return ans;
}
int main(){
while(cin>>n)cout<<bfs(0,0)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | 0 | 64,704,134 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int n,k;
cin>>n>>k;
ll res=k;
for(int i=0;i<n-1;++i)
res*=(k-1);
cout<<res<<'\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long>a(N);
vector<long long>b(N,0);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
b.at(a.at(i)-1)++;
}
long long sum = 0;
for (int i = 0; i < N; i++) {
sum += b.at(i)*(b.at(i)-1)/2;
}
for (int i = 0; ... | 0 | 84,931,514 |
#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
typedef long long ll;
const int MAXN=2e5+7;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
ll fac[MAXN];
ll quick(ll x,ll n)
{
ll res=1;
while(n)
{
if(n&1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin>>N;
vector<int64_t> A(N);
vector<int64_t> B(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
}
for(int i=0;i<N;i++){
cin>>B.at(i);
}
int64_t sumA=0;
int64_t sumB=0;
for(int i=0;i<N;i++){
sumA+=A.at(i);
}
for(int i=0;i... | 0 | 91,756,208 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define FOR(i,start,sto... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x)... | 0 | 38,477,784 |
#include<iostream>
#include<set>
#include<map>
#include<unordered_set>
#include<cmath>
#include<algorithm>
using namespace std;
#include<vector>
#define int long long int
#define mod 1000000007
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,k;
cin>>n>>k;
int j,arr[n];
for... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N, M;
cin >> N;
vector<string> s_N(N);
rep2(i, 0, N) cin >> s_N.at(i);
cin >> M;
vector<string> s_M(M);
rep2(i, 0, M) cin >> s_M.at(i);
vector<string> list(0);
li... | 0 | 55,411,952 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long a,b,c,d,n;
cin >> a >> b >> c >> d >> n;
b = min(a*2,b);
c = min(b*2,c);
d = min(c*2,d);
cout << (n/2)*d+(n%2)*c << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,cyc=0;
string S;
cin >> S >> N;
char f=S.at(0);
int a=0;
ulong b=0;
int64_t ans=0;
if(N==1){
bool ok=false;
for(int i=0;i<S.size()-1;i++){
if(S.at(i)==S.at(i+1)&&!ok){
cyc++;
ok=true;
}else{
ok... | 0 | 73,274,423 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | 0 | 23,749,263 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(3);
cin >> V[0] >> V[1] >> V[2];
vector<int> D(3);
int res = 0;
while (!(V[0] == V[1] && V[1] == V[2]))
{
int maxv = -1, minv = 100000;
int min_i, max_i;
for (int i = 0; i < 3; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> tab(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++){
cin >> tab.at(i).at(j);
}
}
vector<int> mark(0);
for (int k = 0; k < h; k++){
int count = 0;
fo... | 0 | 80,517,062 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No... | #include <bits/stdc++.h>
using namespace std;
int N, temp, swaps = 0;
int arr[100];
void SelectionSort(int *arr, int n, bool stable = 0)
{
for (int i = 0; i < n - 1; i++)
{
int minIdx = i;
for (int j = i + 1; j < n; j++)
{
if (arr[j] < arr[minIdx])
{
... | 0 | 26,015,664 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define debug(x) (cout << # x ": " << x << endl)
#define ll long long int
#define repeat(n) for (int i = 0; i < n; ++i)
#define all(x) x.begin(), x.end()
int main() {
int n, m;
cin >... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
int a,b;
cin >> a >> b;
int c = a - ... | 0 | 49,608,302 |
#include <iostream>
#include <algorithm>
#define INF 1000000000
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int n,ans;
int a[100005][5];
int dp[100005][5]={};
cin>>n;
for(int i=1;i<=n;i++){
for(int j=0;j<3;j++){
cin>>a[i][j];
}
}
for(int i=1;i<=n;i++){
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#inclu... | 0 | 72,520,219 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const long long int m=pow(10,9)+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,max=-1,sum=0;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int f[100005]={0};
for(int i=0;i<n;i++)
... | #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 maxs(x,y) (x = max(x,y))
#d... | 0 | 65,315,553 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int M,A;
cin >> M;
cin >> A;
cout << M * M - A << endl;
} | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
LL N; cin >> N;
vector<LL> A(N); rep(i, N) cin >> A[i];
ULL S = 0; rep(i, N) S += A[i];
if (S %... | 0 | 46,407,352 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.