code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 92,021,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 100010;
int main() {
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,m=0,s,l=0,c=0,i,k,b;
cin>>n;
m=n-1;
for(i=1;i<=sqrt(n);i++){
if(!(n % i)){
k=i;
s=n/k;
m=min(m,(k-1)+(s-1));
l=1;
}
}
if(l)
cout<<m;
else
... | 0 | 34,139,935 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
if(a==1 || b==1){
if(a==1 && b==1)cout<<"Draw";
else if(a<b)cout<<"Alice";
else if(a>b)cout<<"Bob";
}
else {
if(a>b)cout<<"Alice";
else if(a==b)cout<<"Draw";
else if(a<b)co... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
map<string,int> word_map;
map<string,int>::iterator it;
string s,freq_word,long_word;
int freq_count=0;
while (cin >> s) {
it = word_map.find(s);
if(it == word_map.end()){
word_map.inse... | 0 | 53,055,139 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
using pp=pair<int,pair<int,int>>;
#define MOD 1000000007
#define INF 1000000000
int main(){
int N;
cin>>N;
cout<<(N-1)/2<<endl;
} | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
ll cnt = 0, i=0;
for(i=1;i<=n;i++) {
cnt += i;
if(cnt >= n) {
break;
}
}
n -= i;
vector<int> v;
v.push_back(i);
i--;
... | 0 | 59,487,453 |
#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;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 0 | 86,451,204 |
#include <bits/stdc++.h>
using namespace std;
int const MOD = 1000000007;
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; }
int dp[1001][1001];
int main(){
cin.tie(0); ios::sync_wi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(),... | 0 | 14,864,734 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF=1000000007;
typedef long long ll;
int main() {
ll N,M;
cin>>N>>M;
ll a[M];
vector<bool> j(N,true);
rep(i,M){
cin>>a[i];
j[a[... | 0 | 17,854,981 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <vector>
#include <cmath>
#include <cstdint>
#include <string>
using namespace std;
int main() {
while (true) {
int n;
int x;
cin >> n >> x;
if (!n && !x) {
break;
}
int count = 0;
for (int i = 1;... | #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... | 0 | 67,783,226 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,K; cin>>N>>K;
vector<ll> P(N+1,0), M(N+1,0);
for(int i=1; i<=N; i++){
ll a; cin>>a;
if(a>0)
P[i]=a;
else
M[i]=a;
}
for(int i=1; i<=N; i++){
P[i]=P[i-1]+P[i];
M[i]=M[i-1]+M[i];
}
ll lose=1e14;... | #include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
const int N=1e5+5, INF=1e9;
using namespace std;
int n, ans = 0;
vector<int> v;
signed main()
{
bool flag=false;
cin >> n;
for(int i = 0; i < n; i++)
{
int a, b;
... | 0 | 9,100,650 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int A, B;
cin >> A >> B;
for (int64_t i = 1; i <= 100000; i++) {
int64_t j = A * i;
if (j % B == 0) {
cout << j << endl;
break;
}
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n!=0){
vector<pair<string,string> >pcc;
vector<string> vc;
for(int i=0;i<n;i++){
string a,b;
cin>>a>>b;
pcc.push_back(make_pair(a,b));
}
int m;
cin>>m;
for(int i=0;i<m;i++){
string a;
... | 0 | 49,051,412 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int N;
cin >> N;
vector<int> C(N-1);
vector<int> S(N-1);
vector<int> F(N-1);
for ( int i = 0; i < N-1; i++ ) {
cin >> C.at(i) >> S.at(i) >> F.at(i);
}
for ( int start = 0; start < N-1; start++ ) {
int time = ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
string S, T;
cin >> S >> T;
vector<int> seq... | 0 | 2,635,295 |
#include <stdio.h>
#include <string.h>
int main (){
char A[11],B[11],C[11];
scanf("%s %s %s", &A, &B, &C);
strlen (A),(B);
if(A[strlen(A)-1] == B[0] && B[strlen(B)-1] == C[0]){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<bool> dp(N+1, false);
dp[0] = true;
for (int i = 1; i <= N; ++i) {
if (i >= 5 && dp[i-5] && S.substr(i-5, 5) == "erase") dp[i] = true;
if (i >= 6... | 0 | 30,509,800 |
#include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
bool c... | #include <bits/stdc++.h>
using namespace std;
const int thr = 753;
int main(){
string S;
cin >> S;
string buf;
int temp, diff, diff_min = 1e5;
for (int i=0; i<S.size()-2; i++){
buf = S.at(i);
buf += S.at(i+1);
buf += S.at(i+2);
temp = stoi(buf);
diff = abs(thr... | 0 | 77,551,728 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 10000... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N; cin >> N;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int M; cin >> M;
string t[M];
for (int j = 0; j < M; j++) {
cin >> t[j];
}
int Xmax = 0;
string word;
for (int u = 0; u < N; u++) {
word = s[u];
in... | 0 | 14,582,519 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<string> a... | #include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
class Point
{
public:
double x;
double y;
};
void koch(int n, Point a, Point b){
if(n == 0) return;
Point s, u, t;
double si60 = sqrt(3.0)/2.0;
double co60 = 0.5;
s.x = (a.x + a.x + b.x) / 3.0;
s.y = (a.y + a.y + b.y) / ... | 0 | 57,844,957 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pf(n) printf("%d\n",n)
#define pff(a,b) printf("%d %d\n",a,b);
typedef long long ll;
typedef p... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int s;
long long dp[2005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
dp[0] = 1;
for (int j = 1; j <= s; j++) {
for (int i = 3; i <= s; i++) {
if (j >= i) dp[j] = (dp[j] + dp[j - i])... | 0 | 62,588,693 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define in... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(i... | 0 | 83,511,036 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
void f(int index, vector<int>& v, const vector<int>& vr, const vector<vector<int>>& min_... | #include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <set>
using ll = long long;
using namespace std;
int monmo(char ms){
if(ms=='R')return 3;
else if(ms=='G')return 2;
else if(ms=='B')return 1;
else co... | 0 | 26,327,763 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M, X;
cin >> N >> M >> X;
vector<ll> C(N);
vector<vector<ll>> A(N, vector<ll>(M, 0));
for (int i = 0; i<N; ++i){
cin >> C[i];
for (int j = 0; j < M; j++) cin >> A[i][j];
}
bool no = true;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
ll n, k, sum, c = 1;
cin >> n >> k;
ll arr[n];
for(ll i = 0; i < n; i++){
cin >> arr[i];
}
if(n == k){
cout << 1;
}
else if(k == 2){
cout << n - 1;
}
else{
n = n - k - 1;;
... | 0 | 28,675,846 |
#include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int N;
int main(int argc, char* argv[]) {
cin >> N;
unordered_map<int, int> map;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (map.find(a) != map.cend()) {
map[a]++;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
#... | 0 | 89,616,764 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int a[3],num;
int i;
scanf("%d",&num);
for(i = 0; i < num; i++){
scanf("%d %d %d",&a[0],&a[1],&a[2]);
sort(a,a+3);
if(a[0] * a[0] + a[1] * a[1] == a[2] * a[2]){
printf("YES\n");
}else{
printf("NO\n");
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
voi... | 0 | 73,778,755 |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
#include <numeric>
using namespace std;
#define... | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 0 | 12,571,882 |
#include <bits/stdc++.h>
using namespace std;
long long pow(long long p,long long q,long long r){
if(q==0)return 1;
else if(q%2==0)return pow(p,q/2,r)*pow(p,q/2,r)%r;
else return pow(p,q-1,r)*p%r;
}
int main() {
int n;
cin>>n;
long long a[n],b[n];
for(int i=0;i<n;i++){
long long k;
cin>>k;
a[i... | #include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <tuple>
using namespace std;
const double pi = acos(-1);
#define nyan cout<<"(=^•ω•^=)"<<endl;
#define int long long
int n;
int ans[2000][2000];
int generate(){
a... | 0 | 38,989,167 |
#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>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x... | 0 | 40,169,023 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
long long n,a[200005],i,total=0,min[200005],mn;
cin>>n;
mn=10000000000;
for(i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]<mn)
{
mn=a[i];
}
min[i]=mn;
}
for(i=1;i<=n;i++)
... | #include <bits/stdc++.h>
using namespace std;
struct WeightUniTree {
int *par, *rank, *diff_weight;
WeightUniTree(int n) {
par = new int[n];
rank = new int[n];
diff_weight = new int[n];
for(int i = 0; i < n; i++) {
par[i] = i;
rank[i] = 0;
diff... | 0 | 91,885,854 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include<bits/stdc++.h>
using namespace std;
#define vi vector<long long int>
#define set1 set<long long int>
#define pb push_back
#define map1 map<long long int,long long int>
#define ll long long int
#define mp make_pair
#define inf 1e17
#define minf INT_MIN
#define setbits(x) __builtin_popcountll(x)
#def... | 0 | 35,110,202 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c;
scanf("%lld %lld. %lld",&a,&b,&c);
cout<<a*(b*100+c)/100;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int m,k;
cin>>m>>k;
if(k>=(1<<m))
{
cout<<"-1\n";
return 0;
}
if(m==1)
{
if(k==1)
cout<<"-1\n";
else
{
cout<<"0 0 1 1\n";
}
return 0;
}
for(int i... | 0 | 65,752,862 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int n,k,R,S,P;
string t;
cin >> n >> k >> R >> S >> P >> t;
int ans = 0;
vector<bool>po(n,false);
rep(i,0,k){
if(t[i] == 'r') ans += P;
if(t[... | #include <bits/stdc++.h>
using namespace std;
long long D[302][301], H[302];
int main()
{
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> H[i];
}
H[n+1] = 0;
for (int i = 0; i <= k; i++)
{
D[0][i] = 0;
}
for (int i = 1; i <= n+1; i++)
{
... | 0 | 89,459,016 |
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
for(int i = 0; i < n; i++){
cin >> d[i];
}
int replaceCnt = 0;
int start = 0;
for(int i = 0; i < n; i++){
int min = d[start], pos = start;
for(int k = start; k < n;... | #include<bits/stdc++.h>
using namespace std;
void Ok()
{
long int a[113],b,c,d,e,f,g,t,i,j,k,l,m,n,r,sum,ans_1,ans_2,ans_3,cnt,Max = 0,Min = 999;
double aa,bb,cc,dd,ee;
char aaa[1013],bbb[1013],ccc[1013];
cin>>n>>k;
for(i=1;i<=k;i++)
{
a[i] = 1;
}
ans_1 = (n - k);
a[1] += ans... | 0 | 80,424,647 |
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <string>
#include <stdio.h>
#include <sstream>
using namespace std;
void swap(int &a, int &b);
int main()
{
string sstr;
string Output[10];
int tempcount = 0;
while (true)
{
cin >> sstr;
if (sstr == "-")
break;
int... | #pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
using namespace std;
using QWORD = uint64_... | 0 | 70,306,126 |
#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 alp ="abcdefghijklmnopqrstuvwxyz";
char c[2];
cin >> c;
for (int i = 0; alp.size(); i++) {
if (alp[i] == *c) {
cout << alp[... | #include <cstdio>
int main(void)
{
int A,B,N;
scanf("%d%d%d",&N,&A,&B);
if(N==1)
{
if(A==B)
printf("1\n");
else
printf("0\n");
}
else
{
if(A>B)
printf("0\n");
else
printf("%lld\n",(long long )(B-A)*(N-2)+1);
... | 0 | 75,675,497 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespac... | #include<iostream>
using namespace std;
int main()
{
float ax,ay,bx,by,cx,cy,dx,dy;
double katamuki[2];
short n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>ax>>ay>>bx>>by>>cx>>cy>>dx>>dy;
katamuki[0]=(by-ay)/(bx-ax);
katamuki[1]=(dy-cy)/(dx-cx);
cout<<((katamuki[0]==katamuki[1])?"YES":"NO")<<endl;
}
return 0;
} | 0 | 87,239,379 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<int> vec(n);
rep(i,n)cin>>vec[i];
int cnt=0,a=0;
rep(i,n){
if(a<=vec[i]){
a=vec[i];
cnt++;
}
}
cout<<cnt<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3][3],n;
for ( int i=0; i<3 ; i++){
for (int j=0 ; j<3 ; j++){
cin >> a[i][j];
}
}
cin >> n;
int b[n] ;
for ( int i= 0 ; i<n ; i++) {
cin >> b[i] ;
}
bool c[3][3];
for ( int i=0; i<3 ; i++){
for (int j=0 ; j<3 ; j+... | 0 | 34,155,670 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <bits/stdc++.h>
using namespace std;
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else return 0;
}
long long getKey(char str[]) {
long long sum ... | 0 | 93,058,706 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m = 1000; cin >> n;
vector<long long> a(n);
for(long long &c : a) {
cin >> c;
}
for(int i = 0; i < n - 1; ++i) {
if(a.at(i) < a.at(i + 1)) {
long long c = m / a.at(i);
m += c... | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace s... | 0 | 55,671,523 |
#include<iostream>
using namespace std;
struct Node {
int key;
int parent = -1;
int left = -1;
int right = -1;
};
Node T[251];
void prop(int num) {
int div = num / 2;
int tmp = num % 2;
T[num].parent = div;
if (tmp == 0) {
T[div].left = num;
}
else {
T[div].right = num;
}
}
int main() {
int n;
cin >> n... | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
#include <climits>
using namespace std;
long long ... | 0 | 99,423,939 |
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#if 0
#pragma comment(linker,... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 45,633,253 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <iostream>
#include <queue>
using namespace std;
struct Node{
int u,k,v[99];
int distance;
};
int main(int argc, char *argv[])
{
int n;
Node node[100];
queue<Node> que;
cin >> n;
for(int i=0; i<n; i++){
cin >> node[i].u >> node[i].k;
for(int j=0; j<node[i].k; j++)
cin >> node[i].v[j... | 0 | 80,058,912 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
vector<vector<char>> A(N, vector<char>(N)), B(M, vector<char>(M));
for (int i=0; i<N; i++) {
for (int j=0; j<N; j++) {
cin >> A[i][j];
}
}
for (int i=0; i<M; i++) {
for (int j=0; j<... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define vvi vector< vector<int> >
#define vvl vector< vector<ll> >
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int)(n-1); i >= 0; i--... | 0 | 84,639,978 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll ans = 0;
vector<ll> o(5);
rep(i,5) {
cin >> o[i];
}
ll min = 10;
... | 0 | 63,757,575 |
#include <iostream>
using namespace std;
using LL = long long;
const LL INF = 1L << 29;
int N, M, R;
int r[8];
bool U[8];
LL d[201][201];
LL ans = INF;
void dfs(int count, int prev, LL dist) {
if (count == R) {
ans = min(ans, dist);
return;
}
for (int i = 0; i < R; i++) {
if (!U[i]) ... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>... | 0 | 49,321,722 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
ll h, w;
cin >> h >> w;
if(h==1){
if(w==1){
cout << 1 << endl;
}else{
cout << w-2 << endl;
}
return 0;
}else if(w==1){
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N; cin >> N;
ll a[N];
ll sum = 0;
bool ok = true;
for (ll i = 0; i < N; i++) {
cin >> a[i]; sum+=a[i];
}
if (sum % (N*(N+1)/2) != 0) {
cout << "NO" << endl; return 0;
}
ll K = sum/(N*(N+1)/2);
ll c[N];
for... | 0 | 85,883,614 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
void warshall_floyd(vector<vector<long long>> &dist, vector<vector<long long>> &prev) {
int V = dist.size();
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if ... | #include <bits/stdc++.h>
#define lli long long int
#define pb(a) push_back(a)
#define forr(a,n) for(lli i=a;i<n;i++)
#define forrr(j,a,n) for(lli j=a;j<n;j++)
#define all(x) x.begin(),x.end()
#define mp make_pair
#define ff first
#define ss second
#define pi2 1.57079632679489661923
using namespace std;
void print(lli ... | 0 | 1,044,959 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i =... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 0 | 22,416,614 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | #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 pbds tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f... | 0 | 8,880,738 |
#include <vector>
#include <set>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iterator>
#include <limits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdint>
#include <cassert>
using namespace std;
#define FOR(i, start, end) for(int i ... | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
#define STRMAX 1005
#define ORDREMAX 20
int main(void)
{
char str[STRMAX];
int num, i, j, k, under, over;
char substr[STRMAX];
char order[ORDREMAX];
char tmp;
cin >> str;
cin >> num;
for (i=0; i<num; i++) {
ci... | 0 | 70,133,367 |
#include<iostream>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
int main()
{
ios;
int n,m;
cin>>n>>m;
n%=500;
if(m>=n)cout<<"Yes\n";
else cout<<"No\n";
} | #include <bits/stdc++.h>
using namespace std;
#define All(A) A.begin(), A.end()
typedef pair<long long, long long> P;
int main(){
long long N, D, A;
cin >> N >> D >> A;
vector<P> X(N);
vector<long long> x(N);
for(int i = 0; i < N; i++) {
long long s, t;
cin >> s >> t;
X[i] = ... | 0 | 67,028,695 |
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int* a = new int[n];
for (int i = 0;i < n;i++) {
cin >> a[i];
}
long long kane = 1000;
long long kabu = 0;
bool kai = true;
for (int i = 0;i < n;i++) {
if (i == n - 1) {
kane += kabu * a[i];
kabu = 0;
}
else {
if (kai) {
... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
typedef long long ll;
typedef pair<int, int> ii;
#define EPS 1e-8
int main(){
map<int, int> mp;
int a, maxi = 0;
wh... | 0 | 80,266,434 |
#include <iostream>
using namespace std;
int main(void){
int n, ans = 0;
long long w,h;
cin >> n >> w >> h;
for (int i=0; i<n; i++){
long long a, b; cin >> a >> b;
ans += a>=w&&b>=h;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 84,320,850 |
#include<bits/stdc++.h>
using namespace std;
long long int n,k,i,x,y,ans,mod;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>k;ans=0;mod=1e9+7;
for (i=k;i<n+2;i++)
{
ans=ans-(i*i-i)/2+1;
x=n+1-i;
ans=ans+(n*n+n)/2-(x*x-x)/2;
ans=ans%mod;
}
cout<<ans;
} | #include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define Unique(x) x.erase(unique(all(x)),x.end());
using namespace std;
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
const int Days[]={-1,31,28,31,30,31,30,31,31,30,31,30,31};
inline int read()
{
#define gc getc... | 0 | 18,920,983 |
#include <iostream>
using namespace std;
int main()
{
int N, cut;
long long int L, prev, curr;
bool poss=false;
cin>>N>>L;
for(int i=0; i<N; i++)
{
cin>>curr;
if(i==0) prev=curr;
else
{
if(prev+curr>=L)
{
cut=i;
... | #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;
template < typename T > using oset = tree < T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update >;
typedef long long ll;
typedef long double ld;
#de... | 0 | 96,640,057 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
long long int x, y;
cin>>x>>y;
if(x>0&&y>0){
long long int ans=abs(y-x);
if(x>y) ans+=2;
cout<<ans<<endl;
}else if(x>0&&y<0){
if(x!=abs(y)) cout<<abs(abs(y)-x)+1<<endl;
if(x==abs(y)) cout<<... | 0 | 73,976,884 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | 0 | 66,715,583 |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
using namespace std;
int main()
{
string str;
string item;
vector<string> list;
getline(cin, str);
stringstream ss(str);
while (getline(ss, item, ' ') && !item.empty()) {
list.push_back(item);
}
int a = list[0].c_str()[0];
int b = lis... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 12,864,090 |
#include <cstdio>
#include <cctype>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() { return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2) ? EOF : *p1++; }
inline long long read() {
long long f =... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s... | 0 | 9,404,176 |
#include <bits/stdc++.h>
using namespace std;
char Ga[610][610];
char Gb[310][310];
int main()
{
int64_t N, ans = 0;
cin >> N;
char c;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
cin >> c;
Ga[i][j] = Ga[i + N][j] = Ga[i][j + N] = Ga[i + N][j + N] = c;
}
}
for (int a... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
int main() {
ll n, x, m;
cin >> n >> x >> m;
vector<bool> used(m * 2);
vector<ll> one_cycle;
... | 0 | 74,853,389 |
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <map>
#define INF 100000000
using namespace std;
typedef long long ll;
int main(){
int sum[2];
sum[0]=sum[1]=0;
for(int i=0;i<2;i++){
for(int j=0;j<4;j++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 68,088,748 |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout<<n<<"\n"
#define rep(i,n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;cin>>n>>k;
vector<ll>... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N;
cin >> N;
vector<int> A( N );
for( auto &x : A ) {
cin >> x;
}
map<int,int> search;
for (auto &x : A) {
search[ x ]++;
search[ x + 1 ]++;
search[ x - 1 ]++;
}
int result{};
for(auto x : search) {
result = max(result, x.second);
}... | 0 | 94,626,000 |
#include <iostream>
using namespace std;
int m[50][50],a,b,c,d,e,cou;
void dfs(int i,int j){
if(i==b&&j==a)cou++;
if(m[i+1][j]==0&&i+1<=b)dfs(i+1,j);
if(m[i][j+1]==0&&j+1<=a)dfs(i,j+1);
}
int main(){
while(1){
cin >>a>>b;
if(a==0&&b==0)break;
for(int i=1;i<=b;i++){
for(int j=1;j<=a;j++){
m[i]... | #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<ll,ll>;
ll merge(ll a, ll b) {
if(a + b <= 9) return a + b;
else return (a + b)/10 + ((a + b) % 10);
}
ll dfs(vector<P> v) {
if(v.size() == 1 && v[0].second == 1) return 0;
ll res ... | 0 | 85,397,654 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
static const int MAX_INT = std::numeric_limits<int>::max();
static const lo... | 0 | 13,434,159 |
#include <iostream>
using namespace std;
int main(void)
{
int W, H, x, y, r;
bool flg = false;
cin >> W;
cin >> H;
cin >> x;
cin >> y;
cin >> r;
if ((x+r) <= W) {
if ((x-r) >= 0) {
if ((y+r) <= H) {
if ((y-r) >= 0) {
cout << "Yes" << endl;
flg = true;
}
}
}
}
if (flg == false) {
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
int n,a,b,c;
vector<int>l;
int ans=1001001001;
void dfs(vector<int>A){
if(A.size()==n){
int now=1001001000;
int w=0;
int wc=0;
int x=0;
int x... | 0 | 57,655,758 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
#define REP(i, n) for (long i = 0; i < n; ++i)
#define FOR(i, b, n) for (long i = b; i <= n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const string YES = "POSSIBLE";
const string NO = "IMPOSSIBLE";
void solve(long N, long M, vector<long> a, vector<long> b) {
ve... | 0 | 25,751,900 |
#include <cstdio>
using namespace std;
int n;
int a[80];
void solve() {
long money = 1000;
for (int i=0;i<n-1;i++) {
if (a[i] < a[i+1]) {
money += (a[i+1]-a[i]) * (long)(money/a[i]);
}
}
printf("%ld\n", money);
}
int main() {
scanf("%d", &n);
for (int i=0;i<n;i++) {
... | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = ... | 0 | 59,541,496 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << f... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define FASTIO cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
#define loop(i,a,b) for(int i=a; i<b; i++)
#define INF 10000000000099ll
#define mod 1000000007
#define prDouble(x) cout<<fixed<<setprecision(10)<<x
ll solve(vecto... | 0 | 1,216,229 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int h,w,k;
cin >> h >> w >> k;
vector<string> c(h);
int ans = 0;
rep(i,h) cin >> c[i];
rep(is,1<<h)rep(js,1<<w){
int counts = 0;
rep(i,h)rep(j,w){
if(is>>... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define ... | 0 | 46,685,169 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using minpq = priority_queue <T, vector<T>, greater<T>>;
template<typename T, typena... | #include<bits/stdc++.h>
using namespace std;
#define LL long long int
int N, P;
string S;
LL answer;
int main() {
cin >> N >> P >> S;
answer = 0;
if (P == 2) {
for (int i = 0; i < N; i++) {
int digit = S[i] - '0';
if (digit%2 == 0)
answer += (i + 1);
}... | 0 | 43,327,858 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0,c - (a - b)) << endl;
return 0;
} | #include<iostream>
#include<cstring>
using namespace std;
int table[10][10];
int town;
int INF = 9999;
void fw(){
for(int k = 0; k <= town; k++){
for(int i = 0; i <= town; i++){
for(int j = 0; j <= town; j++){
table[i][j] = min(table[i][j], table[i][k] + table[k][j]);
... | 0 | 19,525,687 |
#include <cstdlib>
#include <cstdio>
using namespace std;
void print(int tree[], int n){
for (int i = 1; i <= n; ++i) {
printf("node %d: key = %d, ", i, tree[i]);
if (i != 1){
printf("parent key = %d, ", tree[i/2]);
}
if (i*2 <= n){
printf("left key = %d, ", t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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 MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b;... | 0 | 98,187,653 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[60];
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i];
for(sort(a+1,a+n+1);a[n]>=n;sort(a+1,a+n+1)){for(int i=0;i<n;++i)a[i]+=a[n]/n;a[n]%=n;}
cout<<a[0]<<'\n';
return 0;
} | #include<bits/stdc++.h>
#define fr(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define rf(i,j,p) for(int i=p;i>=j;i--)
#define vi vector<int>
#define vll vector<long long>
#define ll long long
#define hmm "\n"
#define sp " "
#define srt(v) sort(v.begin()... | 0 | 11,307,430 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define f(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define fm(i, a, b) for (long long i = a; i > b; i--)
#define repm(i, a, b) for (long long i = a; i >= b; i--)
#define vi... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 0 | 4,396,097 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
map<string,ll> m;
ll ans = 0;
rep(i,0,n) {
string s;
cin >> s;
vector<string> t(10);
rep(j,0,10) t[j] = s.substr(j,1);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define setbits(x) __builtin_popcountll... | 0 | 22,386,057 |
#include<bits/stdc++.h>
#define pii pair<int, int>
#define fir first
#define sec second
using namespace std;
const int MAXN = 1e5 + 7;
vector<pii>G[MAXN];
int n, dis[MAXN];
bool vis[MAXN];
int dijkstra(int s)
{
for (int i = 0; i <= n; i++) dis[i] = 1e9, vis[i] = 0;
priority_queue<pii, vector<pii>, greater<pii>>... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<vector<string>> problem_array(n,vector<string>(0));
for(int i=0;i<m;i++){
int num;
string res;
cin >> num >> res;
problem_array.at(num-1).push_back(res);
}
long long penalty=0... | 0 | 58,408,144 |
#include<iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)return q;
return gcd(q, p % q);
}
int main()
{
int a, b;
cin >> a >> b;
int out = -1;
for (int i = 10 * b; i < 10 * b + 10; i++) {
if ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
typedef long long int ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, int> pli;
typed... | 0 | 97,024,681 |
#include <iostream>
using namespace std;
#define repi(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
int main() {
ios::sync_with_stdio(false);
int c[6] = {500, 100, 50, 10, 5, 1};
while(1) {
int a;
cin >> a;
if(!a)break;
a = 1000-a;
int s = 0;
rep(i, 6) {
int t = a/c[i];
a ... | #include <cstdio>
#include <cstdlib>
#include <cctype>
int main()
{
char ch[1200];
char alphabet;
int number, counter[26];
int int_alpha;
for(int i = 0; i < 26; i++) counter[i] = 0;
while(scanf("%s", ch) != EOF){
for(int i = 0; ch[i] != '\0';i++){
if(isupper(ch[i])) ch[i] = t... | 0 | 73,369,678 |
#include <iostream>
using ll = long long;
using namespace std;
int main() {
int n,u,k, v;
int A[100][100];
cin >> n;
for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) A[i][j] = 0;
for (int i = 0; i < n; ++i) {
cin >> u >> k;
for (int j = 0; j < k; ++j) {
cin >> v;
... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void){
char x[1001];
int i, s;
for(;;){
scanf("%s", x);
if(x[0] == '0' && x[1] == '\0') break;
s = 0;
for(i = 0; x[i] != '\0'; i++)
s += x[i] - '0';
printf("%d\n", s);
}
return 0;
... | 0 | 87,440,086 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n - 1);
for (int i = 0; i < n - 1; i++)
cin >> a[i];
vector<int> res(n);
res[0] = a[0];
for (int i = 1; i < n - 1; i++) {
res[i] = a[i];
if (res[i] > a[i - 1])... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n+1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
typedef pair<ll,ll> P;
const ll MO = 1000000007;
int main(){
int n;
cin >> n;
vector<ll> a... | 0 | 56,933,690 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <string.h>
#include <tuple>
#include <vector>
#define REP(i,x) for(int i{ 0 }; i < (int)(x); i++)
#define REPC(i,x) for(int i{ 0 }; i <= (int)(x); i... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 0 | 63,974,798 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200000;
int n,a[N+9];
int main(){
scanf("%d",&n);
LL sum=0;
for (int i=0;i<=n;++i){
scanf("%d",&a[i]);
sum+=a[i];
}
if (n==0) {puts(a[0]==1?"1":"-1");return 0;}
if (a[0]) {puts("-1");return 0;}
LL now=1,ans=1;
for (int i=1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
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 y... | 0 | 48,400,332 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <queue>
using namespace std;
const int MAX_E = 45;
const int MAX_V = 10;
const int INF = INT32_MAX;
struct edge {int to, cost; };
typedef pair<int, int> P;
vector<edge> G[MAX_V];
vector<string> result;
int main() {
int n;
while(1) {
ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,m;
cin >> n >> m;
vector<ll> k(m);
vector<vector<ll>> s(m);
for(i = 0;i < m;++i){
cin >> k.at(i);
rep(j,k.at(i)){
... | 0 | 64,063,403 |
#include <iostream>
#include <vector>
using namespace std;
using pint = pair<int,int>;
int main() {
int N, K; cin >> N >> K;
int ma = (N-1)*(N-2) / 2;
if (ma < K) cout << -1 << endl;
else {
vector<pint> res;
for (int i = 1; i <= N-1; ++i) res.push_back({i, N});
int rem = ma - K;
... | #include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll,ll> P;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b; ... | 0 | 77,577,602 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int X,Y,Z,K;
cin >> X >> Y >> Z >> K;
vector<int>A(X),B(Y),C(Z);
for(int i = 0; i < X; i++) {
cin >>... | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrep... | 0 | 30,199,271 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int maxn = 333;
long long f[maxn][maxn];
int a[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n = 0;
cin >> n;
int k = 0;
cin >> k;
for(int i=1;i<=n;i++) cin >> a[i];
for(int j=0;j<=n;j++) for(int i=0;i<=n;i++) f[j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 48,032,908 |
#include <stdio.h>
int max(int a,int b){return a>b?a:b;}
int n;
int a[200050];
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",&a[i]);
int left[200050];
int right[200050];
for(int i=1;i<n;i++)
{
left[i]=max(left[i-1],a[i-1]);
}
for(int i=n-2;i>=0;i--)
{
ri... | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
void solve(long long W, long long H, std::vector<long long> p, std::vector<long long> q){
vector<pair<int,int>> v;
for(int i = 0; i < W; ++i) {
... | 0 | 66,623,312 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int cost(vector<int> a, int x){
int ret = 0;
for(auto y : a){
ret += (x - y)*(x - y);
}
return ret;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setpre... | #include<iostream>
#include<vector>
#include<string>
#include<deque>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
deque<int>a;
for(int i=0;i<n;i++){
int k;
cin>>k;
if((n%2==0&&i%2!=0)||(n%2!=0&&i%2==0)){
a.push_front(k);
}else{
... | 0 | 83,822,974 |
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> vec(N+1);
for(int i=1;i<=N;i++){
cin>>vec.at(i);
}
int sum=0;
for(int i=0;i<100;i++){
for(int j=1;j<=N;j++){
if(vec.at(j)>=1){
if(vec.at(j-1)==0){
sum++;
}
}
}
for(in... | 0 | 45,679,412 |
#include <iostream>
using namespace std;
int main(void)
{
int n, m, p, x;
while(cin >> n >> m >> p, n && m){
int win = 0, money, sum = 0;
for (int i = 1; i <= n; i++){
cin >> x;
if (i == m) win = x;
sum += x;
}
money = sum * 100;
money -= (int)(money * (p / 100.0));
cout << (win == 0 ? 0 : money ... | #include<bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
long long counta[300000][60][2];
int main(){
long long N;
cin >> N;
long long A[N];
long long i,j,k;
for(i=0; i<N; i++){
cin >> A[i];
}
long long nibeki[60];
nibeki[0]=1;
for(i=1; i<60; i++){
... | 0 | 100,140,609 |
#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>;
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... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | 0 | 42,666,607 |
#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... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
const int MAXN = 1e5 + 10;
int N;
int cnt = 1, Head[MAXN], Next[MAXN << 1], To[MAXN << 1];
int d[MAXN];
int ans;
inline void add_edge(int x, int y) {
Next[++cnt] = Head[x], To[cnt] = y, Head[x] = cnt;
}
... | 0 | 69,907,695 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include <algorithm>
#include<math.h>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
int main() {
while(... | 0 | 91,407,098 |
#include<iostream>
#include<queue>
using namespace std;
static const int N=101;
static const int INF=(1<<21);
int n,M[N][N];
int d[N];
void bfs(int s){
queue<int> q;
q.push(s);
for(int i=0;i<n;i++) d[i]=INF;
d[s]=0;
int u;
while(!q.empty()){
u=q.front();
q.pop();
for(int v=0;v<n;v++){
if(M... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int counta = 0;
int countb = 0;
vector<char> C(S.size());
for (int i = 0; i < S.size(); i++) {
C.at(i) = S.at(i);
if (i % 2 == 0 && C.at(i) == '1'){
counta++;
}
else if (i % 2 == 1 && C.at(i) == '0'){
... | 0 | 20,050,078 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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... | #include<bits/stdc++.h>
using namespace std;
int b[1000005];
int main()
{
int n;
memset(b,0,sizeof(b));
cin >> n;
int a[n],max = 0;
for(int i = 0;i < n;i++){
cin >> a[i];
if(max < a[i])
max = a[i];
b[a[i]]++;
b[a[i]-1]++;
b[a[i]+1]++;
}
int max1 = 0;
for(int i = 0;i <= max + 1;i++){
if(max1 < b[... | 0 | 30,300,089 |
#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>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
int main(){
ll k;
cin >> k;
if(k==0){
cout << 2 << endl;
cout << "1 1" << endl;
return 0;
}
vector<ll> v(50);
for(int i=0;i<50;i++) v[i] = (k/50)+50;
int res = k % 50;
res = 50 - res;
for(int i=0;i<res;i++){... | 0 | 74,207,288 |
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
map<long long, long long> m;
int main()
{
long long n;
cin >> n;
for (long long i = 0; i < n; i++)
{
long long x;
cin >> x;
if (m.find(x) == m.end())
{
m[x] = 1;
}
els... | #include <cstdio>
#include <stack>
using namespace std;
int main() {
stack<int> q;
while (true) {
int n;
if (scanf("%d", &n) == EOF)
break;
if (n) {
q.push(n);
} else {
printf("%d\n", q.top());
q.pop();
}
}
return 0;... | 0 | 78,656,413 |
#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<set>
using namespace std;
#define N 100009
#define LL long long
#define INF 0x3f3f3f3f
#define mymin(x,y) (x>=y?y:x)
#define mymax(x,y) (x>=y?x:y)
int main() {
std::ios::sync_with_stdio(0)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const ll MOD = 1e9+7;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> table(n+1);
for(int i=1;i<=n;i++){
table[i] = t... | 0 | 89,494,378 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef vector<int> vi;
typedef unsigned long ul;
typedef vector<ll> vl;
typedef p... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | 0 | 7,269,872 |
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int64_t> a(n), b(n), c(m), d(m);
rep(i, n) std::cin >> a[i] >> b[i];
rep(i, m) std::cin >> c[i] >> d[i];
std::vector<i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define SORT(s) sort((s).begin(), (s).e... | 0 | 11,523,742 |
#include<iostream>
using namespace std;
int main(){
int a, b, c,count = 0;
cin >> a >> b >> c;
for(; a < b + 1; a++){
if(c % a == 0) count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> cnt(n, 0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
a--;
cnt[a]++;
}
vector<int> v;
for (int i ... | 0 | 78,171,969 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
int n;
cin >> n;
vi a(n), ans(n);
rep(i, n){
cin >> a[i];
ans[a[i]-1]=i+1;
}
rep(i, n)cout << ans[i] << endl;
return 0;
} | #include<iostream>
#include<map>
using namespace std;
int main(){
long H,W,N;
cin >> H >> W >> N;
long ans[10];
for(int i=0; i<10; i++) ans[i] = 0;
ans[0] = (H-2)*(W-2);
map<pair<int,int>,int> m;
for(int t=0; t<N; t++){
long a, b;
cin >> a >> b;
for(int i = -1; i < 2;... | 0 | 25,536,052 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> bars(N);
rep(i, N){
cin >> bars.at(i);
}
sort(bars.begin(), bars.end(), greater<int>());
int ans = 0;
rep(i, K){
ans += bars.at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& x: ve... | 0 | 54,136,318 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double d = sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
cout << fixed << setprecision(8) << d << "\n";
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int n; cin >> n;
vector<int>b(n-1);
vector <int>a(n);
for(int i = 0; i < n-1; i++) cin >> b[i];
a[0] = b[0];
a[1] = b[0];
for(int i = 1; i < n-1; i++){
... | 0 | 30,091,167 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.