text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
#define oo 100005
using namespace std;
int n, a[oo], e, t, q[oo];
long long dp[oo], sum[oo], f[oo];
int main ()
{
scanf("%d%d%d", &n, &e, &t);
for(int i = 1; i <= n; ++ i)
scanf("%d", &a[i]);
memset(dp, 63, sizeof dp);
sum[0] = -2 * a[1]; dp[0] = 0;
for(int i = 1, lim = 0, l = 1, r = 1; i <= n; ++ i)
{
while(2 * (a[i] - a[lim + 1]) > t) ++ lim;
while(q[l] < lim && l <= r) ++ l;
if(l <= r) dp[i] = min(dp[i], f[l] + t + a[i]);
if(lim > 0) dp[i] = min(dp[i], sum[lim - 1] + 3ll * a[i]);
sum[i] = min(sum[i - 1], dp[i] - a[i] - 2ll * a[i + 1]);
while(f[r] >= dp[i] - a[i] && l <= r) -- r;
q[++ r] = i, f[r] = dp[i] - a[i];
}
printf("%lld", dp[n] + e - a[n]); return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, T, E, A[N];
long long dp[N];
int main()
{
scanf("%d%d%d", &n, &E, &T);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
int r = 1;
long long Mn = 1e18;
for (int i = 1; i <= n; i++)
{
while ((A[i] - A[r]) * 2 >= T)
Mn = min(Mn, dp[r - 1] - A[r] * 2), r ++;
dp[i] = min(dp[r - 1] + T, Mn + A[i] * 2);
}
return !printf("%lld\n", dp[n] + E);
} |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int nMax=1e5+10;
const long long INF=1e17;
int n,t,e;
long long x[nMax],f[nMax],g[nMax];
int main()
{
scanf("%d%d%d",&n,&e,&t);
for(int i=1;i<=n;i++)
scanf("%lld",&x[i]);
long long Min=INF;
g[0]=-x[1]*2;
int p=0;
for(int i=1;i<=n;i++)
{
while(p<=i&&(x[i]-x[p+1])*2>=t)
Min=min(Min,g[p++]);
if(p<i)
f[i]=f[p]+t;
else
f[i]=INF;
f[i]=min(f[i],Min+x[i]*2);
g[i]=f[i]-2*x[i+1];
}
printf("%lld\n",f[n]+e);
return 0;
} |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr int MN = 1e5+1;
ll N, E, T, A, B = 1e18, x[MN], DP[MN];
int main() {
if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> N >> E >> T;
for (int i = 0; i < N; ++i) cin >> x[i];
multiset<ll> S;
S.insert(0);
for (int i = 0, j = 0; i < N; ++i) {
while (2*(x[i]-x[j]) >= T) {
B = min(DP[j]-2*x[j], B);
S.erase(S.find(DP[j]));
++j;
}
DP[i+1] = min(A+(i+1)*T, B+2*x[i]);
if (S.size()) DP[i+1] = min(*begin(S)+T, DP[i+1]);
A = min(DP[i+1]-(i+1)*T, A);
S.insert(DP[i+1]);
}
cout << DP[N]+E;
}
|
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#define SF scanf
#define PF printf
#define MAXN 100010
#define INF 0x3FFFFFFF
using namespace std;
typedef long long ll;
ll dp[MAXN],pos[MAXN],m,t,pre=INF;
priority_queue<pair<ll,int> > q;
int n;
int main(){
SF("%d%lld%lld",&n,&m,&t);
for(int i=1;i<=n;i++)
SF("%lld",&pos[i]);
q.push(make_pair(0,0));
int las=0;
for(int i=1;i<=n;i++){
dp[i]=dp[i-1]+t+pos[i]-pos[i-1];
while(1){
pair<ll,int> x=q.top();
if(2ll*(pos[i]-pos[x.second+1])<=t){
dp[i]=min(dp[i],-x.first+pos[i]+t);
break;
}
q.pop();
}
while(2ll*(pos[i]-pos[las+1])>t){
pre=min(pre,dp[las]-pos[las]-2ll*pos[las+1]);
las++;
}
if(pre!=INF)
dp[i]=min(dp[i],pre+3ll*pos[i]);
q.push(make_pair(-dp[i]+pos[i],i));
}
PF("%lld",dp[n]+m-pos[n]);
} |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;
const int N=1e5+10,inf=(1<<30);
ll f[N],p[N];int n,e,t;
int main()
{
scanf("%d%d%d",&n,&e,&t);
fo(i,1,n) scanf("%lld",&p[i]);
memset(f,63,sizeof(f));f[0]=0;
ll mn=inf;
for(int i=1,j=0;i<=n;i++) {
for(;t<=(p[i]-p[j+1])<<1;j++)
mn=min(mn,f[j]-2*p[j+1]);
if(j<i) f[i]=min(f[i],f[j]+t);
f[i]=min(f[i],mn+2*p[i]);
}
printf("%lld\n",f[n]+e);
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=999999999999999999;
int n,id;
ll a[101010],f[101010],T,E;
int main()
{
scanf("%d%lld%lld",&n,&E,&T);
for (int i=1;i<=n;++i) scanf("%lld",&a[i]);
for (int i=1;i<=n;++i) f[i]=inf;
ll minn=inf;
for (int i=1;i<=n;++i)
{
while (T<=2*(a[i]-a[id+1]))
minn=min(minn,f[id]-2*a[id+1]),++id;
f[i]=min(f[id]+T,2*a[i]+minn);
}
printf("%lld\n",E+f[n]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 1<<20;
ll n, t, e, x[maxn], dp[maxn];
int main() {
dp[0] = x[0] = 0;
cin >> n >> e >> t;
for(int i = 1; i <= n; i++) cin >> x[i];
int j = 0;
multiset<ll> p, s;
for(int j = 1, i = 1; i <= n; i++) {
while(2*(x[i]-x[j]) > t) {
s.erase(s.find(dp[j-1] - x[j] + (x[j] - x[j-1])));
p.insert(dp[j-1] - 3ll*x[j] + (x[j] - x[j-1]));
//cout << j << " p " << (dp[j-1] - 3ll*x[j] + (x[j] - x[j-1])) << '\n';
j++;
}
dp[i] = dp[i - 1] + (x[i] - x[i-1]) + t;
if(!s.empty()) dp[i] = min(dp[i], *s.begin() + x[i] + t);
if(!p.empty()) dp[i] = min(dp[i], *p.begin() + 3ll*x[i]);
s.insert(dp[i-1] - x[i] + (x[i] - x[i-1]));
//cout << i << " s " << (dp[i-1] - x[i] + (x[i] - x[i-1])) << '\n';
//cout << i << " " << dp[i] << " " << x[i] << " " << t << "\n";
}
cout << dp[n]+(e-x[n]);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int n, E, T, r;
int a[maxn];
ll Min1, Min2 = 1e18, f[maxn];
int main()
{
deque<ll> Q;
scanf("%d%d%d", &n, &E, &T);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
Q.push_back(0);
for(int i = 1; i <= n; ++i)
{
while((a[i] - a[r + 1]) * 2 >= T)
{
Min2 = min(Min2, f[r] - 2 * a[r + 1]);
while(Q.front() <= r) Q.pop_front();
++r;
}
f[i] = min(Min1 + 1ll * i * T, Min2 + 2 * a[i]);
if(!Q.empty()) f[i] = min(f[i], f[Q.front()] + T);
Min1 = min(Min1, f[i] - 1ll * i * T);
while(!Q.empty() && f[i] <= f[Q.back()]) Q.pop_back();
Q.push_back(i);
}
printf("%lld\n", f[n] + E);
return 0;
} |
/**
* author: tourist
* created: 13.01.2020 23:37:41
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long e, t;
cin >> n >> e >> t;
n += 1;
vector<long long> x(n);
for (int i = 1; i < n; i++) {
cin >> x[i];
}
vector<long long> dp(n);
multiset<long long> far;
multiset<long long> near;
int j = 0;
near.insert(dp[0] + t - x[0]);
for (int i = 1; i < n; i++) {
while (j < i && 2 * (x[i] - x[j + 1]) >= t) {
near.erase(near.find(dp[j] + t - x[j]));
far.insert(dp[j] - x[j] - 2 * x[j + 1]);
j += 1;
}
dp[i] = (long long) 1e18;
if (!near.empty()) {
dp[i] = min(dp[i], *near.begin() + x[i]);
}
if (!far.empty()) {
dp[i] = min(dp[i], *far.begin() + 3 * x[i]);
}
near.insert(dp[i] + t - x[i]);
}
cout << dp[n - 1] + e - x[n - 1] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int MAXN=1e5+5;
const ll inf=(1ll<<63-1);
ll a[MAXN];
ll dp[MAXN];
int main()
{
ll n,e,t;
cin>>n>>e>>t;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
memset(dp,(ll)0x3f3f3f3f,sizeof(dp));
dp[0]=0;
ll mn=inf;
for(int i=1,now=0;i<=n;i++){
while(t<=2*(a[i]-a[now+1]))
{
mn=min(mn,dp[now]-2*a[now+1]);
now++;
}
dp[i]=dp[now]+t;
dp[i]=min(dp[i],mn+2*a[i]);
}
cout<<e+dp[n]<<endl;
return 0;
} |
#include <cstdio>
#include <algorithm>
#include <queue>
#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i; i = edge[i].next)
#define v edge[i].to
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef long long LL;
const int N = 1000100;
int x[N], n, e, t;
LL f[N];
int main()
{
scanf("%d%d%d", &n, &e, &t);
Rep(i, n) scanf("%d", &x[i]);
int j = 0;
LL tmp = 1e18;
Rep(i, n) {
f[i] = 1e18;
while (t <= (x[i] - x[j + 1]) * 2){
tmp = min(tmp, f[j] - 2 * x[j + 1]);
j ++;
}
if(j < i) f[i] = min(f[i], f[j] + t);
f[i] = min(f[i], tmp + 2 * x[i]);
}
printf("%lld\n", f[n] + e);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 0x3f3f3f3f3f3f3f3f;
const int N = 100000;
int n, m, s;
int a[N + 1];
int dp[N + 1];
int q[N], head, tail;
#undef int
signed main() {
#define int long long
cin >> n >> m >> s;
for (int i = 1; i <= n; i++) cin >> a[i];
q[tail++] = 0;
int now = -1, mn = inf;
for (int i = 1; i <= n; i++) {
while (now + 1 < i && 2 * a[now + 2] < 2 * a[i] - s)
now++, mn = min(mn, dp[now] - a[now] - 2 * a[now + 1]);
while (head < tail && q[head] <= now) head++;
while (head < tail &&
dp[q[tail - 1]] - a[q[tail - 1]] >= dp[i - 1] - a[i - 1])
tail--;
q[tail++] = i - 1;
dp[i] = min(dp[q[head]] - a[q[head]] + a[i] + s, mn + 3 * a[i]);
}
cout << dp[n] + m - a[n] << "\n";
#undef int
return 0;
}
|
#include<cmath>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=100000+10;
ll f[maxn],xx[maxn];
ll n,e,t;
ll store;//fj-2xj+1
int main(){
ll b1,b2,b3,b4;
ll p;//定位
scanf("%lld%lld%lld",&n,&e,&t);
for (b1=1;b1<=n;b1++){
scanf("%lld",&xx[b1]);
}
for (b1=1;b1<=n;b1++){
f[maxn]=b1*t;
}
p=0;store=((ll)1<<60);
for (b1=1;b1<=n;b1++){
while (2*xx[p+1]<=2*xx[b1]-t){
store=min(store,f[p]-2*xx[p+1]);
p++;
}
f[b1]=min(2*xx[b1]+store,f[p]+t);
f[b1]=min(f[b1-1]+t,f[b1]);
}
printf("%lld\n",f[n]+e);
} |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;
const int N=100005;
int n,e,t,x[N],i,j,k;
ll f[N],w=1ll<<60;
multiset<ll> st;
int main()
{
scanf("%d%d%d",&n,&e,&t);
for(i=1;i<=n;++i)
scanf("%d",x+i);
for(i=1,k=0;i<=n;++i)
{
st.insert(f[i-1]-x[i-1]+t);
while(k<i&&2*(x[i]-x[k+1])>=t)
{
w=min(w,f[k]-x[k]-2*x[k+1]);
st.erase(st.find(f[k]-x[k]+t));
++k;
}
f[i]=1ll<<60;
if(w<(1ll<<60))
f[i]=min(f[i],w+2*x[i]);
if(!st.empty())
f[i]=min(f[i],*(st.begin()));
//for(j=i-1;j>=0;--j)
//f[i]=min(f[i],f[j]-x[j]+max(t,2*(x[i]-x[j+1])));
f[i]+=x[i];
}
printf("%lld",f[n]+e-x[n]);
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define LL long long
using namespace std;
const int N=1e5+10;
int n;
LL e,t,x[N],dp[N],tt=1e18;
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f;}
template<typename I, typename... U> inline void read(I &x,U&... y){read(x); read(y...);}
template<typename I>inline I mi(const I&a,const I&b){return a<b ? a : b;}
int main()
{
// freopen("Shik and Game.in","r",stdin);
read(n,e,t);
for(RG int i=1;i<=n;i++) read(x[i]), dp[i]=2e9;
for(RG int i=1,j=0;i<=n;i++)
{
while(2*(x[i]-x[j+1])>=t)
{
tt=mi(tt,dp[j]-2*x[j+1]);
j++;
}
dp[i]=mi(dp[j]+t,tt+2*x[i]);
}
printf("%lld\n",dp[n]+e);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,e,t,x[100005];
ll dp[100005];
int main(){
scanf("%d%d%d",&n,&e,&t);
for (int i = 1 ; i <= n; i++){
scanf("%d",&x[i]);
}
int pivot = 0;
ll mn = 1000000000000000000;
for (int i = 1; i <= n; i++){
dp[i] = 1000000000000000000;
while (pivot < i && 2*(x[i]-x[pivot+1]) > t) {
mn = min(mn,dp[pivot]-2*x[pivot+1]);
pivot++;
}
dp[i] = min(2*x[i]+mn,dp[pivot]+t);
}
printf("%lld",dp[n]+e);
}
|
#include <iostream>
using namespace std;
int main(void){
int rectangle=0, lozenge=0;
while (true){
int a,b,c;
char e;
cin>>a>>e>>b>>e>>c;
if (cin.eof()) break;
if (a==b) lozenge++;
if (a*a+b*b==c*c) rectangle++;
}
cout<<rectangle<<endl;
cout<<lozenge<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int a,b,c;
char x;
int r=0,m=0;
while(cin>>a>>x>>b>>x>>c){
if(a*a+b*b==c*c)r++;
if(a==b)m++;
}
cout<<r<<endl
<<m<<endl;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c,cnt_tyou=0,cnt_hishi=0;
while(scanf("%d,%d,%d",&a,&b,&c) != EOF){
if(a==b) cnt_hishi++;
if(a*a + b*b == c*c) cnt_tyou++;
}
cout<<cnt_tyou<<endl<<cnt_hishi<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int x, y, z;
char komma;
int hishi, choho;
hishi=0; choho=0;
while(cin>>x>>komma>>y>>komma>>z){
if(x==y && x+y>z) hishi++;
else if(x*x+y*y==z*z) choho++;
}
printf("%d\n%d\n", choho, hishi);
return 0;
} |
#include<stdio.h>
int main()
{
int x,y,z,t=0,h=0;
while(scanf("%d,%d,%d",&x,&y,&z)!=EOF)
{
x*=x;
y*=y;
z*=z;
if(z==(x+y))
{
t++;
}
else if(x==y)
{
h++;
}
}
printf("%d\n%d\n",t,h);
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int a,b,c,rect=0,diamond=0;
while (scanf("%d,%d,%d",&a,&b,&c) != EOF)
{
if (a*a+b*b == c*c)
rect++;
if (a==b)
diamond++;
}
cout << rect << endl << diamond << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int a,b,c,r=0,l=0;
while(scanf("%d%*c%d%*c%d",&a,&b,&c)==3) {
if(a*a+b*b==c*c) r++;
else if(a==b) l++;
}
cout << r << endl << l << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int rect=0,dia=0;
int a[3]{};
while(scanf("%d,%d,%d",&a[0],&a[1],&a[2])>0){
if(a[0]==a[1]) dia++;
if(a[0]*a[0]+a[1]*a[1]==a[2]*a[2]) rect++;
}
printf("%d\n%d\n",rect,dia);
} |
#include <iostream>
using namespace std;
int main(){
int rect = 0;
int dia = 0;
int a, b, c;
while(~scanf("%d,%d,%d", &a, &b, &c)){
if(a*a + b*b == c*c) rect++;
if(a == b) dia++;
}
cout << rect << endl;
cout << dia << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, r = 0, L = 0;
char d;
while (cin >> a >> d >> b >> d >> c) {
if (a * a + b * b == c * c) r++;
else if (a == b) L++;
}
cout << r << "\n" << L << "\n";
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int s1, s2, dg, rec = 0, rho = 0;
while(scanf("%d,%d,%d", &s1, &s2, &dg) != EOF){
if(s1 * s1 + s2 * s2 == dg * dg) rec++;
else if(s1 == s2) rho++;
}
cout << rec << endl << rho << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int a, b, c, rec=0, dia=0;
char com;
while (cin >> a >> com >> b >> com >> c) {
if (a * a + b * b == c * c) {
rec++;
}
else if (a == b) {
dia++;
}
}
cout << rec << endl;
cout << dia << endl;
return 0;
} |
#include <cstdio>
using namespace std;
int main () {
int n1,n2,n3,a=0,b=0;
while (scanf("%d,%d,%d",&n1,&n2,&n3)!=EOF) {
if((n1*n1+n2*n2)==(n3*n3))a++;
else if(n1==n2)b++;
}
printf("%d\n%d\n",a,b);
} |
#include <iostream>
using namespace std;
int main(){
char trash;
int hisi = 0, tyou = 0;
int a, b, c;
while(cin >> a >> trash >> b >> trash >> c){
if(a == b){
hisi++;
}
if(a*a+b*b == c*c){
tyou++;
}
}
cout << tyou << endl << hisi << endl;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a,b,c,tyou=0,hishi=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if(a*a+b*b==c*c)tyou++;
else if(a==b)hishi++;
}
cout << tyou << '\n' << hishi << endl;
return 0;
} |
#include <iostream>
int main()
{
int a, b, c, n = 0, m = 0;
char t;
while (std::cin >> a >> t >> b >> t >> c)
{
if (a*a + b*b == c*c) n++;
if (a == b) m++;
}
std::cout << n << '\n' << m << '\n';
} |
#include<cstdio>
#include<iostream>
using namespace std;
int main(void){
int l1,l2,l3;
int ty=0,hi=0;
while(scanf("%d,%d,%d",&l1,&l2,&l3)!=EOF){
if(l1*l1+l2*l2==l3*l3) ty++;
if(l1==l2) hi++;
}
printf("%d\n%d\n",ty,hi);
return 0;
} |
#include <cstdio>
using namespace std;
int main()
{
int a,b,c,tc,rc;
tc = rc = 0;
while(scanf("%d,%d,%d",&a,&b,&c) == 3)
{
if(a == b) ++ rc;
else if(a * a + b * b == c * c) ++tc;
}
printf("%d\n%d\n",tc,rc);
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int a, b, c, ty = 0, hi = 0;
char d;
while(cin >> a >> d >> b >> d >> c){
if((a*a + b*b) == c*c)
ty++;
if(a == b)
hi++;
}
cout << ty << endl << hi << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a,b,c;
char com;
int t = 0;
int h = 0;
while(cin >> a >> com >> b >> com >> c){
if(a*a+b*b==c*c) t++;
else if(a==b) h++;
}
cout << t << endl;
cout << h << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int a[3],ans[2];
char com;
ans[0]=0;ans[1]=0;
while(cin>>a[0]>>com>>a[1]>>com>>a[2]){
if(a[2]*a[2]==a[0]*a[0]+a[1]*a[1])ans[0]++;
if(a[0]==a[1])ans[1]++;
}
cout<<ans[0]<<endl<<ans[1]<<endl;
return 0;
} |
#include <cstdio>
using namespace std;
int main(){
int a, b, c, r = 0, l = 0;
while( scanf("%d,%d,%d", &a, &b, &c) != EOF ){
if( a*a + b*b == c*c ) r++;
if( a == b ) l++;
}
printf("%d\n%d\n", r, l);
return 0;
} |
#include<cstdio>
int main(){
int a,b,c;
int d = 0, r = 0;
while(1 + scanf("%d,%d,%d", &a, &b, &c)){
if(a == b){
d++;
}else if(a * a + b * b == c *c){
r++;
}
}
printf("%d\n%d\n", r, d);
return 0;
} |
#include<iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int loect=0,hisi=0;
int main(){int a1,a2,aa;char b1,b2;
while(cin>>a1>>b1>>a2>>b2>>aa){
if(a1==a2){hisi++;}
if(aa*aa==a1*a1+a2*a2){loect++;}}
cout<<loect<<endl<<hisi<<endl;
return 0;}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int a,b,c,h=0,w=0;
char d;
while(cin>>a>>d>>b>>d>>c){
if(a==b)
h++;
if(a*a+b*b==c*c)
w++;
}
cout<<w<<endl;
cout<<h<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c;
int tsum,hsum;
tsum=hsum=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if(a==b) hsum++;
else{
if(a<b&&b<c||a>b&&a<c) tsum++;
}
}
cout<<tsum<<endl;
cout<<hsum<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
char buf;
int a,b,c;
int rec=0,loz=0;
while(true){
cin >> a >> buf >> b >> buf >> c;
if(cin.eof())
break;
if(c*c== (a*a+b*b))
rec++;
if(a==b)
loz++;
}
cout << rec << endl << loz <<endl;
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c;
int t=0,h=0;
while(scanf("%d,%d,%d",&a,&b,&c)+1){
// if(a==0)break;
if(a==b)h++;
if(c*c==a*a+b*b)t++;
}
cout<<t<<endl<<h<<endl;
}
|
#include <cstdio>
using namespace std;
int main() {
int a, b, c, r = 0, e = 0;
while (scanf("%d,%d,%d", &a, &b, &c) == 3) {
if (a*a + b*b == c*c) r++;
if (a == b) e++;
}
printf("%d\n%d\n", r, e);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d=0,e=0;
char f;
while(cin>>a>>f>>b>>f>>c){
if(a*a+b*b==c*c){
d++;
}
if(a==b){
e++;
}
}
cout<<d<<endl<<e<<endl;
return 0;
}
|
#include<stdio.h>
int main(){
int a,b,c;
int r=0,l=0;
while(~scanf("%d,%d,%d",&a,&b,&c)){
if(a*a+b*b==c*c)r++;
if(a==b)l++;}
printf("%d\n%d\n",r,l);
return 0;}
|
#include <iostream>
#include <limits>
#include <cmath>
#include <sstream>
using namespace std;
int main() {
int a,b,c,p = 0,l = 0;
while (scanf("%d,%d,%d",&a,&b,&c) != EOF) {
if (a*a + b*b == c*c) p++;
if (a == b) l++;
}
cout << p << endl << l << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char ch;
int re = 0, ro = 0;
int a, b, c;
while (cin >> a >> ch >> b >> ch >> c) {
if (a * a + b * b == c * c) {
re++;
}
if (a == b) {
ro++;
}
}
cout << re << endl;
cout << ro << endl;
return 0;
} |
#include <iostream>
#include <stdio.h>
#include <cstdio>
using namespace std;
int main(){
int a,b,c,tyou=0,hisi=0;
while(scanf("%d,%d,%d",&a,&b,&c) != EOF){
if(a*a+b*b==c*c && a!=b) tyou++;
else if(a==b) hisi++;
}
cout<<tyou<<endl<<hisi<<endl;
return 0;
} |
#include <cstdio>???
using namespace std;
int main(){
int a, b, c, ans1=0, ans2=0;
while( scanf("%d,%d,%d", &a,&b,&c) != EOF ){
if( a*a + b*b == c*c ) ans1++; //????????§?????????????????????
else if( a == b ) ans2++; //????????§????????????????????????
}
printf("%d\n%d\n", ans1, ans2);
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
int x=0,y=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if(a*a+b*b==c*c)x++;
if(a==b)y++;
}
printf("%d\n%d\n",x,y);
return 0;
} |
#include<iostream>
using namespace std;
int main(void){
int a,b,c;
char temp;
int hisi = 0, cho = 0;
while(!cin.eof()){
cin >> a >> temp >> b >> temp >> c;
if(a*a + b*b == c*c)
cho++;
if(a == b)
hisi++;
}
cout << cho << endl << hisi << endl;
} |
#include<iostream>
#include<vector>
#include<stdio.h>
using namespace std;
int main(){
int n,m,d,r=0,l=0;
char c;
while(cin>>n>>c>>m>>c>>d){
if(n==m)
l++;
if(n*n+m*m==d*d)
r++;
}
cout<<r<<endl<<l<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(void){
int a,b,c,s=0,r=0;
char ch;
while(cin>>a>>ch>>b>>ch>>c){
if(a*a + b*b == c*c){
s++;
}
if(a == b){
r++;
}
}
cout<<s<<endl<<r<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
char p,q;
int a,b,c;
int x=0,y=0;
while(cin >> a >> p >> b >> q >> c)
{
if(a*a+b*b==c*c) x++;
if(a==b) y++;
}
cout << x << endl << y << endl;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a, b, tai, p1=0, p2=0;
while(scanf("%d,%d,%d",&a,&b,&tai)!=EOF){
if(a*a+b*b==tai*tai)p1++;
if(a==b)p2++;
}
cout<<p1<<endl<<p2<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
int d=0,e=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
//if(a==0&&b==0&&c==0){break;}
if(a*a+b*b==c*c){d++;}
if(a==b){e++;}}
cout<<d<<endl<<e<<endl;} |
#include<iostream>
#include<stdio.h>
using namespace std;
int x, y, z;
int re=0, di=0;
int main(){
while(scanf("%d,%d,%d", &x, &y, &z) != EOF){
if(x*x + y*y == z*z) re++;
else if(x == y) di++;
}
cout << re << endl;
cout << di << endl;
} |
#include <cstdio>
using namespace std;
int main()
{
int x, y, r, hisi = 0, tyou = 0;
while (scanf("%d,%d,%d ", &x, &y, &r) == 3) {
if (x == y) {hisi++;}
if (x * x + y * y == r * r) {tyou++;}
}
printf("%d\n%d\n", tyou, hisi);
} |
#include <iostream>
using namespace std;
int main() {
int a,b,c;
char ch;
int rect=0, lozen=0;
while(cin>>a>>ch>>b>>ch>>c) {
if(a*a+b*b==c*c) rect++;
else if(a == b) lozen++;
}
cout << rect << endl << lozen << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
int main() {
int rect = 0, lozen = 0, a = 0, b = 0, c = 0;
while (std::scanf("%d,%d,%d",&a,&b,&c) != EOF) {
if (a == b) ++lozen;
if (a * a + b * b == c * c) ++rect;
}
std::cout << rect << std::endl << lozen << std::endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int a,b,c,s=0,t=0;
while(~scanf("%d,%d,%d",&a,&b,&c))
{
if(a*a+b*b==c*c)s++;
if(a==b)t++;
}
cout<<s<<endl<<t<<endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, x = 0, y = 0;
char t;
while (cin>>a>>t>>b>>t>>c) {
if (a*a + b*b == c*c) {
x++;
}
if (a == b) {
y++;
}
}
cout << x << endl << y << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int a, b, c, ob=0, dia=0;
while(scanf("%d, %d, %d", &a, &b, &c)!=EOF) {
if(c*c==a*a+b*b)
ob++;
else if(a==b)
dia++;
}
cout << ob << endl << dia << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
int a,b,c,t=0,h=0;
char k;
while(cin>>a){
//if(a==0)break;
cin>>k>>b>>k>>c;
if(a*a+b*b==c*c && a!=b) t++;
else if(a==b) h++;
}
cout<<t<<endl<<h<<endl;
} |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int l1,l2,d,n=0,m=0;
while(scanf("%d,%d,%d",&l1,&l2,&d)+1){
if(l1==l2)++n;
else if(l1*l1+l2*l2==d*d)++m;
}
cout<<m<<endl<<n<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
int sum1=0,sum2=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if(a*a+b*b==c*c)sum1++;
else if(a==b)sum2++;
}
cout << sum1 << endl << sum2 << endl;
return 0;
} |
#include<iostream>
using namespace std;
int main() {
int a, b, c;
char r;
int rec, loz;
rec = 0;
loz = 0;
while (cin >> a >> r >> b >> r >> c){
if (a == b){
loz += 1;
}else if (a * a + b * b == c * c){
rec += 1;
}
}
cout << rec << endl << loz << endl;
} |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
char d;
int cho=0;
int hi=0;
while(cin >> a >> d >> b >> d >> c){
if(a*a + b*b == c*c){
cho++;
}
else if(a == b){
hi++;
}
}
cout << cho << endl << hi << endl;
} |
#include <iostream>
using namespace std;
int main(){
int c = 0, h = 0;
int s1, s2, t;
char a, b;
while(cin >> s1 >> a >> s2 >> b >> t)
{
if(((s1 * s1) + (s2 * s2)) == t * t) c++;
if(s1 == s2) h++;
}
cout << c << endl;
cout << h << endl;
return 0;
} |
#include <iostream>
#include<cstdio>
using namespace std;
int main() {
int a,b,c,n1=0,n2=0;
while(scanf("%d,%d,%d",&a,&b,&c)>0){
if(a==b && a*a+b*b==c*c) continue;
if(a*a+b*b==c*c) n1++;
if(a==b) n2++;
}cout<<n1<<endl<<n2<<endl;
} |
#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
int t=0, h=0;
int a, b, c;
string buf;
while(cin>>buf){
sscanf(buf.c_str(),"%d,%d,%d", &a, &b, &c);
if(a==b) h++;
if(a*a+b*b==c*c) t++;
}
cout<<t<<endl<<h<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c; char x;
int rectangle = 0, diamond = 0;
while(cin >> a >> x >> b >> x >> c){
if(a*a + b*b == c * c) rectangle++;
if(a == b) diamond++;
}
cout << rectangle << endl;
cout << diamond << endl;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
int tyo=0,hisi=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF)
{
if(a*a+b*b==c*c)tyo++;
else if(a==b)hisi++;
}
cout<<tyo<<endl<<hisi<<endl;
return 0;
} |
#include<cstdio>
using namespace std;
int main() {
int a,b,c;
int rec = 0,hy = 0;
while(~scanf("%d", &a)) {
scanf(",%d,%d", &b, &c);
if(a == b) hy++;
if(a*a + b*b == c*c) rec++;
}
printf("%d\n%d\n", rec, hy);
} |
#include <stdio.h>
int main(void){
int a,b,di;
int rect=0, rhom=0;
while (scanf("%d,%d,%d", &a,&b,&di) != EOF){
if (a*a+b*b == di*di) rect++;
if (a==b) rhom++;
}
printf("%d\n%d\n", rect,rhom);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int r1 = 0, r2 = 0;
while(~scanf("%d,%d,%d", &a, &b, &c)) {
r1 += a * a + b * b == c * c;
r2 += a == b;
}
cout << r1 << "\n" << r2 << endl;
}
|
#include <stdio.h>
int main(){
int a,b,c;
int num1=0,num2=0;
while(scanf("%d,%d,%d",&a,&b,&c) !=EOF){
if(a==b) num2++;
else if(a*a+b*b==c*c) num1++;
}
printf("%d\n%d\n",num1,num2);
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c;
int cnta=0,cntb=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if(a*a+b*b==c*c)cnta++;
else if(a==b)cntb++;
}
cout<<cnta<<endl<<cntb<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
int main(){
int a,b,c;
int u=0,v=0;
while (scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if (a*a+b*b==c*c){
u++;
}
if (a==b){
v++;
}
}
printf("%d\n%d\n",u,v);
return 0;
} |
#include <iostream>
using namespace std;
int main( void )
{
int a,b,c,n=0,m=0;
char s,t;
while( 1 ){
cin>>a>>s>>b>>t>>c;
if( cin.eof() ) break;
if( a*a+b*b == c*c ) n++;
if( a == b ) m++;
}
cout << n << endl;
cout << m << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
int cnt1=0,cnt2=0;
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if((a*a+b*b)==c*c) cnt1++;
if(a==b) cnt2++;
}
cout << cnt1<<endl;
cout << cnt2<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int t,y,n;
char c;
int ty=0,h=0;
while(cin>>t>>c>>y>>c>>n){
if(t*t+y*y==n*n)ty++;
if(t==y)h++;
}
cout<<ty<<"\n"<<h<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int a,b,d;
char c;
int ans[2] = {0};
while(cin >> a >>c>> b >>c>> d){
if(a == b)ans[0]++;
else if(a*a + b*b == d*d)ans[1]++;
}
cout << ans[1] << endl;
cout << ans[0] << endl;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s;
int a,b,c;
int ch=0,hi=0;
while(cin >> s){
sscanf(s.c_str(),"%d,%d,%d",&a,&b,&c);
if(a*a+b*b==c*c){
ch++;
}else if(a==b){
hi++;
}
}
cout << ch << endl << hi << endl;
} |
#include <iostream>
using namespace std;
int main()
{
int r = 0;
int d = 0;
int a,b,c;
char t;
while ( cin>>a>>t>>b>>t>>c )
{
if ( a*a+b*b==c*c )
r++;
if ( a==b )
d++;
}
cout << r << endl;
cout << d << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int a, b, c, x = 0, y = 0;
char t;
while(cin >> a >> t >> b >> t >> c){
if(a*a + b*b == c*c) x++;
if(a == b) y++;
}
cout << x << endl << y << endl;
return 0;
} |
#include<cstdio>
using namespace std;
int main(void){
int h1,h2,tai;
int data,tyou=0,hisi=0;
while((scanf("%d,%d,%d",&h1,&h2,&tai))!=EOF){
if(h1==h2) hisi++;
data=h1*h1+h2*h2;
if(data==tai*tai) tyou++;
}
printf("%d\n%d\n",tyou,hisi);
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
int n = 0, m = 0, a, b, c;
while (scanf("%d,%d,%d", &a, &b, &c) != EOF) {
if (a * a + b * b == c * c) n++;
else if (a == b) m++;
}
cout << n << endl;
cout << m << endl;
return 0;
} |
#include <stdio.h>
int main(void) {
int i, j, k, ansc = 0, ansh = 0, a, b, c;
while( scanf("%d,%d,%d", &a, &b, &c) != EOF ) {
if(a * a + b * b == c * c) ++ansc;
if(a == b) ++ansh;
}
printf("%d\n%d\n", ansc, ansh);
return 0;
}
|
//0032
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
int tyo = 0,hishi = 0;
while(scanf("%d,%d,%d\n",&a,&b,&c) != EOF){
if(a*a+b*b == c*c)
tyo++;
if(a == b)
hishi++;
}
cout<<tyo<<endl;
cout<<hishi<<endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b,c,count = 0,count2 = 0;
char x,y;
while(cin >> a >> x >> b >> y >> c){
if(c*c == a*a + b*b) count++;
else if(a == b) count2++;
}
cout << count << endl << count2 << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int a,b,c,cnt1=0,cnt2=0;
char ch;
signed main(void){
ios::sync_with_stdio(false);
while(cin>>a>>ch>>b>>ch>>c){
if(a==b)
cnt2++;
if(a*a+b*b==c*c)
cnt1++;
}
cout<<cnt1<<endl
<<cnt2<<endl;
} |
#include <cstdio>
using namespace std;
int main(){
int a,b,c;
int a1=0,a2=0;
while(scanf("%d,%d,%d",&a,&b,&c) == 3){
if(a*a + b*b == c*c){
a1++;
}
if(a == b){
a2++;
}
}
printf("%d\n%d\n",a1,a2);
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int a, b, c, x = 0, y = 0;
char cc;
while(cin >>a>>cc>>b>>cc>>c){
if(a*a + b*b == c*c)x++;
if(a == b)y++;
}
cout << x << endl << y << endl;
return 0;
} |
#include<cstdio>
//#include<algorithm>
using namespace std;
int a,b,c,tyo,hi;
int main(){
while(scanf("%d,%d,%d",&a,&b,&c)!=EOF){
if(c*c==a*a+b*b) tyo++;
if(a==b) hi++;
}
printf("%d\n%d\n",tyo,hi);
return 0;
} |
#include <cstdio>
using namespace std;
int a, b, c;
int num_rect;
int num_rhombus;
int main() {
while (1) {
if (scanf("%d,%d,%d", &a, &b, &c) != 3) break;
if (a*a+b*b == c*c) num_rect++;
if (a == b) num_rhombus++;
}
printf("%d\n", num_rect);
printf("%d\n", num_rhombus);
} |
#include <stdio.h>
int main(){
int a,b,c;
int x=0,y=0;
while(scanf("%d,%d,%d", &a, &b, &c)!=EOF){
if(a==b) y++;
else if(a*a+b*b == c*c) x++;
}
printf("%d\n%d\n", x,y);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.