Список решенных задач

Здесь приведены не все задачи. Смотрите еще здесь

1 2 3 4 5 6 8 9 10 13 14 15 17 21 22 23 25 26 27 28 33 35 41 43 46 48 52 61 62 63 66 68 79 81 
86 92 106 108 113 124 125 131 135 149 150 156 163 167 195 196 233 234 263 264 272 284 293 296 
297 312 315 324 328 331 336 392 413 416 439 446 475 493 496 504 511 513 529 539 543 550 597 600 
606 633 637 675 685 691 692 697

1

2

3

4

5

6

8

9

10

 #include<iostream> 
using namespace std; 
int main() 
{ 
long long int a, b, c, d; 
cin>>a>>b>>c>>d; 
for(int i=-100; i<=100; i++) 
{ 
if((a*i*i*i + b*i*i + c*i + d)==0) 
{ 
cout<<i<<" "; } 
} 
return 0; 
} 

13

#include <iostream>
#include <string>
using namespace std;
int main() 
{
 string s;
 getline(cin, s);
 int bulls = 0, cows = 0;
 for (int i = 0; i < 4; ++i)
 if (s[i + 5] == s[i]) {
 bulls += 1;
 s[i] = s[i + 5] = '.';
 }
 for (int i = 0; i < 4; ++i)
 if (s[i + 5] != '.')
 for (int j = 0; j < 4; ++j)
 if (s[j] != '.')
 if (s[i + 5] == s[j]) {
 cows += 1;
 s[i + 5] = s[j] = '.';
 break;
 }
 cout << bulls << " " << cows << endl;
return 0;
}

14

#include <iostream> 
using namespace std; 
int main() 
{ 
int a,b,c;
cin >> a >> b; 
int n=a,m=b; 
while(a*b!=0)
{ 
if(a>b) 
 a=a%b; 
else 
 b=b%a; 
} 
cout << n*m/(a+b); 
return 0; 
}

15

#include<iostream>
using namespace std;
int main()
{
 int n, a[100][100],f=0;
 cin >> n;
 for (int i = 0; i < n; i++)
 for (int j = 0; j < n; j++)
 cin >> a[i][j];
 for (int i = 0; i < n; i++)
 for (int j = 0; j < n; j++)
 if (a[i][j] == 1)
 f++;
 cout << f / 2; 
 return 0;
}

17

#include <stdio.h>
unsigned int n;
int * list;
bool Check(int step)
{ 
 unsigned int i = 0;
 while ((list[i%step] == list [i]) && (i<n))
 i++;
 if (i==n)
 return true;
 else
 return false;
}
int main()
{ 
 FILE *f = fopen("input.txt", "r");
 fscanf(f, "%d", &n);
 list = new int [n];
 for (int i = 0; i<n; i++)
 fscanf(f, "%d", & list [i]);
 fclose(f);
 n--;
 int r = n;
 for (int i = 1; i<n; i++)
 { 
 if (!(n%i)) 
 { 
 if (Check(i))
 { 
 r = i;
 break;
 } 
 }
 } 
 f = fopen("output.txt", "wt");
 fprintf(f, "%d", r);
 fclose(f);
 return 0;
}

21

#include<iostream>
using namespace std;
int main()
{
 int a,b,c,mx,mn;
 cin>>a>>b>>c;
 mx=max(a,b);
 mx=max(mx,c);
 mn=min(a,b);
 mn=min(mn,c);
 cout<<mx-mn;
 return 0;
}

22

#include <iostream> 
using namespace std; 
int main() 
{ 
int a,b=0; 
cin>>a; 
while(a>0) 
{ 
b=b+a%2; 
a=a/2; 
} 
cout<<b; 
return 0; 
}

23

#include<iostream> 
using namespace std;
int main() 
{ 
int n; 
cin>>n; 
int s=n,i; 
for (i=1;i<=n/2;i++) 
if (n%i==0) 
s+=i; 
cout<<s; 
}

25

#include<iostream>
using namespace std;
int main()
{
 int a,b;
 cin>>a>>b;
 if(a>b)
 cout<<">";
 if(a<b)
 cout<<"<";
 if(a==b)
 cout<<"=";
 return 0;
}

26

 #include <iostream> 
#include <cmath> 
using namespace std; 
int main() 
{ 
long double x1,x2,y1,y2,r,r1,r2,res1,res2; 
cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2; 
res1=pow(x2-x1,2); 
res2=pow(y2-y1,2); 
r=sqrt((res1+res2)); 
if(r1+r2>=r && r+r1>=r2 && r+r2>=r1)
 cout << "YES"; 
else 
 cout << "NO"; 
return 0;
}

27

#include <stdio.h>
#include <memory.h>
int main()
{ 
 unsigned int a = 0, b = 0, n = 0;
 FILE * f = fopen("input.txt", "r"); 
 fscanf(f, "%d %d %d", &a, &b, &n); 
 unsigned int x1 = 0, x2 = 0, y1 = 0, y2 = 0; 
 unsigned char ** matrix = new unsigned char * [b]; 
 for (int i = 0; i<b; i++) 
 { 
 matrix[i] = new unsigned char [a]; 
 memset(matrix[i], 0, a); 
 } 
 for (int i = 0; i<n; i++) 
 { 
 fscanf(f, "%d %d %d %d", &x1, &y1, &x2, &y2); 
 for (int j = y1; j<y2; j++) 
 memset(matrix[j]+x1, 1, x2-x1); 
 } 
 fclose(f); 
 unsigned int sum = a*b; 
 f = fopen("output.txt", "wt"); 
 for (int i = 0; i<b; i++) 
 for (int j = 0; j<a; j++) 
 sum -= matrix[i][j];
 fprintf(f, "%d", sum); 
 fclose(f); 
 return 0;
}

28

#include <iostream> 
using namespace std; 
int main(){ 
int Ax, Ay, Bx, By, X, Y; 
cin>>Ax>>Ay>>Bx>>By>>X>>Y; 
if(Ax==Bx) 
 X=2*Ax-X; 
if(Ay==By) 
 Y=2*Ay-Y; 
cout<<X<<" "<<Y; 
return 0;
}

33

#include <iostream> 
using namespace std; 
int main() 
{ 
int l; 
cin >> l; 
int g; 
cin >> g; 
int c = l + g - 1; 
cin >> c; 
cout << c - l << " " << c - g; 
return 0;
}

35

#include <iostream> 
using namespace std; 
int main() 
{ 
int k,d,m,n; 
cin>>k; 
for (int i=0;i<k;i++) 
{ 
cin>>n>>m; 
d=19*m+(n+239)*(n+366)/2; 
cout<<d<<endl; 
} 
return 0; 
} 

41

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n;
vector<int> mas;
void input()
{ 
 scanf("%d", &n);
 mas.resize(n); 
 for (int i=0;i<n;i++) 
 scanf("%d",&mas[i]);
}
void output()
{ 
 for (int i=0;i<n;i++)
 printf("%d ", mas[i]);
}
int main()
{ 
 freopen("input.txt","r",stdin); 
 freopen("output.txt","w",stdout); 
 input(); 
 sort(mas.begin(), mas.end());
 output(); 
 return 0;
}​

43

#include<iostream> 
#include<string> 
using namespace std; 
int main() 
{ 
int b=0,max=-999999; 
string a; 
cin>>a; 
a+='1'; 
for(int i=0;i<a.size();i++) 
{ 
 if(a[i]=='0')
 b++; 
 if(a[i]=='1')
 { 
 if(max<b)
 max=b; 
 b=0; 
 } 
} 
cout<<max; 
return 0; 
}

46

 #include <iostream> 
#include <string> 
using namespace std; 
int main() 
{
int i; 
string e="7182818284590452353602875"; 
int n; 
cin>>n; 
if (n==0) 
 cout<<3; 
else 
if (n==25) 
cout<<"2."<<e; 
else 
{
 cout<<"2."; 
for (i=0;i<n-1;++i) 
{ 
cout<<e[i]; 
} 
i++;
int k; 
switch (e[i]) 
{ 
case '0': k=0;break; 
case '1': k=1;break; 
case '2': k=2;break; 
case '3': k=3;break; 
case '4': k=4;break; 
case '5': k=5;break; 
case '6': k=6;break; 
case '7': k=7;break; 
case '8': k=8;break; 
case '9': k=9;break; 
} 
if (k>=5) 
 cout<<char(e[i-1]+1); 
else 
 cout<<(char)e[i-1]; 
} 
return 0; 
}

48

#include <iostream>
#include <string>
using namespace std;
int main() 
{
 freopen("input.txt","r",stdin);
 freopen("output.txt","w",stdout);
 int j;
 string s;
 cin>>s; 
 j=s.length();
 j--; 
 while (s[j]=='0') 
 j--;
 j=s.length()-j-1;
 cout<<"1";
 while (j>0)
 { 
 cout<<"0";
 j--;
 } 
 return 0;
} 

52

#include <iostream> 
using namespace std;
int main()
{
 int x, x1, x2, x3, z1, z2, z3, y1, y2;
 cin >> x;
 x1 = x / 100000;
 x2 = (x / 10000) % 10;
 x3 = (x / 1000) % 10;
 z1 = (x / 100) % 10;
 z2 = (x / 10) % 10;
 z3 = x % 10;
 y1 = x1 + x2 + x3;
 y2 = z1 + z2 + z3;
 if (y1 == y2)
 cout << "YES";
 else
 cout << "NO";
 return 0;
}

61

#include <iostream>
using namespace std;
int main() 
{ 
 freopen("input.txt","r",stdin);
 freopen("output.txt","w",stdout);
 int a,a1,a2,a3,a4,b,b1,b2,b3,b4; 
 cin>>a1>>b1>>a2>>b2>>a3>>b3>>a4>>b4; 
 a=a1+a2+a3+a4; 
 b=b1+b2+b3+b4;
 if (a>b)
 cout<<1 ; 
 if (a<b)
 cout<<2;
 if(a==b)
 cout <<"DRAW";
 return 0; 
} 

62

#include<iostream> 
using namespace std; 
int main()
{ 
char x;
int n; 
cin>>x>>n; 
if ((x-'A')%2!=n%2)
 cout<<"BLACK"; 
else
 cout<<"WHITE"; 
 return 0;
}

63

#include <iostream> 
using namespace std; 
int main() 
{ 
int a,b,s,p; 
cin>>s>>p; 
for (a=1;a<=1000;a++) 
{ 
for (b=a;b<=1000;b++) 
{ 
if (a+b==s && a*b==p) 
cout<<a<<" "<<b; 
} 
} 
return 0; 
}

66

 #include <iostream> 
using namespace std; 
int main()
{ 
string a; 
cin>>a; 
if (a=="q") 
 cout<<"w"; 
if (a=="w") 
 cout<<"e"; 
if (a=="e") 
 cout<<"r"; 
if (a=="r") 
 cout<<"t"; 
if (a=="t") 
 cout<<"y"; 
if (a=="y") 
 cout<<"u"; 
if (a=="u") 
 cout<<"i"; 
if (a=="i") 
 cout<<"o"; 
if (a=="o") 
 cout<<"p"; 
if (a=="p") 
 cout<<"a"; 
if (a=="a") 
 cout<<"s"; 
if (a=="s") 
 cout<<"d"; 
if (a=="d") 
 cout<<"f"; 
if (a=="f") 
 cout<<"g"; 
if (a=="g") 
 cout<<"h"; 
if (a=="h") 
 cout<<"j"; 
if (a=="j")
 cout<<"k"; 
if (a=="k")
 cout<<"l"; 
if (a=="l")
 cout<<"z"; 
if (a=="z")
 cout<<"x"; 
if (a=="x") 
 cout<<"c"; 
if (a=="c") 
 cout<<"v"; 
if (a=="v") 
 cout<<"b"; 
if (a=="b") 
 cout<<"n"; 
if (a=="n") 
 cout<<"m"; 
if (a=="m") 
 cout<<"q"; 
} 

68

#include<iostream> 
#include<string> 
using namespace std; 
int main(){ 
string str; 
int n; 
cin>>str>>n; 
if (str=="Home" || n%2==1) 
 cout<<"Yes"; 
else 
 cout<<"No"; 
return 0; 
} 

79

#include <stdio.h>
int main()
{ 
 FILE *f; 
 f=fopen("INPUT.TXT","r");
 unsigned int a,b;
 fscanf(f,"%d %d",&a,&b); 
 fclose(f);
 f=fopen("OUTPUT.TXT","wt");
 a=a%10;
 int res=a;
 b--;
 for (int i=0;i<b;i++)
 { 
 res=res*a;
 res=res%10;
 } 
 fprintf(f,"%d",res);
 fclose(f);
} 

81

#include <algorithm>
#include <iostream>
using namespace std;
int main() {
 int m[10000];
 int n, i;
 cin >> n;
 for (i = 0; i < n; i++)
 cin >> m[i];
 sort(m, m + n);
 cout << m[0] << ' ' << m[n - 1];
 return 0;
}

86

#include<iostream> 
using namespace std; 
int main (){ 
int a,b; 
cin>>a; 
b=a+((a-1)+(a-1)); 
cout<<a*a-b; 
return 0; 
}

92

#include <iostream> 
using namespace std; 

int main() 
{ 
long int p, k, s, d, sum; 
cin>> sum; 
p = sum/6; 
s = sum/6; 
k = 2*sum/3; 
cout<< p<< " "<< k<< " "<< s; 
return 0; 
}

106

#include <iostream> 
using namespace std; 
int main () 
{ 
int n,a; 
int c1=0, c2=0; 
cin>>n; 
for(int i=1; i<=n; i++)
{ 
 cin>>a; 
 if(a==1)
 c1++; 
 else
 c2++; 
} 
cout<<min(c2,c1); 
return 0; 
}

108

#include<iostream>
using namespace std;
int main()
{
 int a;
 cin>>a;
 cout<<a;
 return 0;
}

113

#include <iostream>
#include <vector>
using namespace std;
vector<vector<int> > dp;
int lsbra(const vector<string>& a, int x, int y) 
{
 if (x < 0 || y < 0) return 0;
 if (a[y][x] == '0') return 0;
 if (dp[y][x] != -1) return dp[y][x];
 if (x == 0 || y == 0) return 1;
 dp[y][x] = 1 + min(lsbra(a, x - 1, y), 
 min(lsbra(a, x, y - 1), lsbra(a, x - 1, y - 1)));
 return dp[y][x];
}
int main()
{
 int N;
 cin >> N >> ws;
 vector<string> f(N);
 for (int i = 0; i < N; ++i) 
 {
 getline(cin, f[i]);
 }
 dp = vector<vector<int> >(N, vector<int>(N, -1));
 int r = 0;
 for (int y = 0; y < N; ++y) {
 for (int x = 0; x < N; ++x) {
 int a = lsbra(f, x, y);
 a = a * a;
 if (a > r) r = a;
 }
 }
 cout << r << endl;
 return 0;
}

124

#include <iostream> 
using namespace std;
int main()
{
 int n, m, i, j, *k, c;
 cin >> n >> m;
 k = new int[n];
 for (c = 0; c < n; ++c)
 k[c] = 0;
 for (c = 0; c < m; ++c) {
 cin >> i >> j;
 k[i - 1]++;
 k[j - 1]++;
 }
 for (c = 0; c < n; ++c)
 cout << k[c] << " ";
 return 0;
}

125

#include <iostream> 
using namespace std;
int main()
{
 int q, i, j, sum, mas[105][105], m[105]; 
 cin >> q;
 sum = 0;
 for (i = 0;i < q;i++)
 for (j = 0;j < q;j++)
 cin >> mas[i][j];
 for (i = 0;i < q;i++)
 cin >> m[i];
 for (i = 0;i<q;i++)
 for (j = 0;j<q;j++)
 if (mas[i][j] == 1)
 if (m[i] != m[j])
 sum++;
 cout<<sum/2;
 return 0;
}

131

#include <iostream> 
using namespace std; 
int main () 
{ 
int m[1001], max=-1, n,index,i,sum=0; 
cin>>n; 
for (i=1; i<=2*n; i++) 
 cin>>m[i]; 
for (i=1; i<=2*n; i++) 
 if (i%2==1) 
 sum=sum+m[i]*m[i+1]; 
if (sum==0) 
{
 cout<<-1; 
 return 0;
} 
for (i=1; i<=2*n; i++) 
 if (i%2==1) 
 if (m[i]*m[i+1]>max) 
 {
 max=m[i]*m[i+1]; 
 index = i/2 + 1;
 } 
cout<<index<<endl; 
return 0; 
}

135

#include<iostream> 
#include<cmath> 
using namespace std; 
int main() 
{ 

int n,d[100][100],t; 
cin>>n; 
for(int i = 0;i<n;i++) 
for(int j = 0;j<n;j++) 
cin>>d[i][j]; 

for (int k=0; k<n; ++k) 
for (int i=0; i<n; ++i) 
for (int j=0; j<n; ++j) 
d[i][j] = min (d[i][j], d[i][k] + d[k][j]); 

for(int i = 0;i<n;i++) 
{for(int j = 0;j<n;j++) 
{ cout<<d[i][j]<<" "; 

} 
cout<<"\n"; 
} 
cin>>t;
 return 0;
}

149

#include <iostream> 
using namespace std; 
int main () 
{ 
int a[1001], n, i; 
cin >> n; 
for (i=1;i<=n;i++) 
 cin >> a[i]; 
for (i=n;i>0;i--) 
 cout << a[i] << " ";
return 0; 
}

150

#include <iostream> 
#include <vector> 
#include <queue> 
using namespace std; 
int main() 
{ 
int n,s,k; 
cin>>n>>k; 
s=k-1; 
vector < vector <int> > A(n, vector <int>(n,0)); 
vector <bool> visit(n,false); 
int x=0,y=0; 
for(;x<n;x++) 
{ 
for(;y<n;y++) 
{ 
cin>>A[x][y]; 
} 
y=0; 
} 
x=0,y=0; 
queue <int> f; 
f.push(s); 
visit[s]=true; 
int count=0; 
while(!f.empty()) 
{ 
for(x=f.front(),y=0;y<n;y++) 
{ 
if(A[x][y]==1 && visit[y]==false) 
{ 
count++; 
f.push(y); 
visit[y]=true; 
} 
} 
f.pop(); 
} 
cout<<count; 
return 0; 
}

156

#include<iostream> 
using namespace std;
int main()
{ 
 long long a[100001], i, n, k;
 cin>>n>>k;
 a[0]=1;
 a[1]=1;
 for (i=2; i<=n; i++)
 {
 a[i]=a[i-1]*i;
 }
 if (n<k)
 cout<<0;
 else
 cout<<(a[n]*a[n])/(a[n-k]*a[n-k]*a[k]);
 return 0;
}

163

#include <iostream> 
#include <cstdio> 
using namespace std;
int main() 
{ 
freopen("input.txt","r",stdin); 
freopen("output.txt","w",stdout); 
string s; 
getline(cin,s); 
char a = s[1]; 
int ix; 
for (int i = 0; i < 5; i+=2) 
if (s[i] == 'x') 
 ix = i; 
if (a == '+') 
{ 
if (ix == 4) 
cout<<s[0]+s[2]-2*'0'; 
else 
 if (ix == 2) 
cout<<s[4]-s[0]; 
else 
 cout<<s[4]-s[2]; 
} 
else 
{ 
if (ix == 0) 
cout<<s[2]+s[4]-2*'0'; 

else 
 if (ix == 2) 
cout<<s[0]-s[4]; 
else
 cout<<s[0]-s[2]; 
} 
}

167

#include<iostream>
#include<string>
using namespace std;
int main()
{
 __int64 n;
 cin >> n;
 cout << n*(n + 2)*(n * 2 + 1) / 8; 
 return 0;
}

195

#include<iostream>
using namespace std;
int main()
{
 int a,b,c;
 cin>>a>>b>>c;
 cout<<(a*2)*(b*c);
 return 0;
}

196

#include<iostream> 
#include<iomanip> 
using namespace std; 
int main() 
{ 
int n,c=0,i=0,j=0,o=0,f=0,l=0,m,k=3; 
cin>>n; 
m=n; 
if(n<4) 
{ 
k=2; 
} 
else if (n>=10&&n<32) 
{ 
k=4; 
}else if (n>=32&&n<100) 
{ 
k=5; 
}else if (n==100) 
{ 
k=8; 
} 
int a[n][n],g=n-1,q,d; 
d=n*n; 
while (c<d) 
{ 
for (i;i>i-1;i++) 
{ 
for (j=i;j<n;j++) 
{ 
c++; 
a[i][j]=c; 
} 
break; 
} 
for (o=i+1;o<n;o++) 
{ 
for (g=n-1;g>0;) 
{ 
c++; 
a[o][g]=c; 
break; 
} 
} 
for (g=n-1;g>0;) 
{ 
for (f=g-1;f>=i;f--) 
{; 
c++; 
a[g][f]=c; 
}break; 
} 
for (q=n-2;q>i;q--) 
{ 
for (l=i-1;l<i;l++) 
{ 
c++; 
a[q][i]=c; 
break; 
} 
} 
n--; 
i++; 
} 
for (i=0;i<m;i++) 
{ 
for (j=0;j<m;j++) 
{ 
cout<<setw(k)<<a[i][j]; 
}cout<<endl; 
} 
return 0; 
}

233

#include<iostream> 
using namespace std; 
int main() 
{ 
int n; 
cin >> n; 
int i; 
int a; 
for(i=1;i<=n;i++) 
{ 
 cin >> a; 
 if (a<=437) 
 { 
 cout << "Crash " << i; 
 return 0; 
 } 
} 
cout << "No crash"; 
}

234

#include<iostream>
using namespace std;
int main()
{
 char a[200][200]={'0'};
 int i,j,n,k,m,z1,z2,num=0;
 cin>>n>>m>>k;
 for(i=0; i<n; i++)
 for(j=0; j<m; j++)
 a[i][j]='0'; 
 for(i=0; i<k; i++)
 {
 cin>>z1>>z2;
 a[z1-1][z2-1]='*';

 if(z1-2>=0 && z1-2<n && z2-2>=0 && z2-2<m && a[z1-2][z2-2]!='*')
 { 
 num=(int(a[z1-2][z2-2])-48+1);
 a[z1-2][z2-2]=char(num+48);
 }

 if(z1-2>=0 && z1-1<n && z2-1>=0 && z2-1<m && a[z1-2][z2-1]!='*')
 {
 num=(int(a[z1-2][z2-1])-48+1);
 a[z1-2][z2-1]=char(num+48);
 }

 if(z1-2>=0 && z1-2<n && z2>=0 && z2<m && a[z1-2][z2]!='*')
 {
 num=(int(a[z1-2][z2])-48+1);
 a[z1-2][z2]=char(num+48);
 }

 if(z1-1>=0 && z1-1<n && z2-2>=0 && z2-2<m && a[z1-1][z2-2]!='*')
 {
 num=(int(a[z1-1][z2-2])-48+1);
 a[z1-1][z2-2]=char(num+48);
 }

 if(z1-1>=0 && z1-1<n && z2>=0 && z2<m && a[z1-1][z2]!='*')
 {
 num=(int(a[z1-1][z2])-48+1);
 a[z1-1][z2]=char(num+48);
 }

 if(z1>=0 && z1<n && z2-2>=0 && z2-2<m && a[z1][z2-2]!='*')
 {
 num=(int(a[z1][z2-2])-48+1);
 a[z1][z2-2]=char(num+48);
 }

 if(z1>=0 && z1<n && z2-1>=0 && z2-1<m && a[z1][z2-1]!='*')
 {
 num=(int(a[z1][z2-1])-48+1);
 a[z1][z2-1]=char(num+48);
 }

 if(z1>=0 && z1<n && z2>=0 && z2<m && a[z1][z2]!='*')
 {
 num=(int(a[z1][z2])-48+1);
 a[z1][z2]=char(num+48);
 }
 }
 for(i=0; i<n; i++)
 {
 for(j=0; j<m; j++)
 {
 if(a[i][j]=='0')
 a[i][j]='.';
 cout<<a[i][j];
 }
 cout<<endl;
 } 
}

263

#include <iostream> 
using namespace std; 
int main() 
{ 
int n; 
cin>>n; 
int i,j; 
cin>>i>>j; 
if(i>j) 
 swap(i,j); 
if(i<j) 
 cout<<(j-i-1<i+n-j-1?j-i-1:i+n-j-1);
return 0; 
}

264

#include<iostream> 
using namespace std; 
int main()
{ 
int a,c=0,m=0; 
cin>>a; 
for(int i=1;i<=a;i++)
{ 
 int x; 
 cin>>x; 
 if(x<1)
 c=0; 
 else 
 c=c+1; 
 if(c>m)
 m=c; 
} 
cout<<m; 
return 0; 
}

272

#include <iostream> 
using namespace std; 
int main() 
{ 
int a, b = -10000, c = 10000, d=0; 
while (cin >> a) 
{ 
 d += 1; 
 if (d % 2 == 0) 
 { 
 if (b <= a) 
 b = a; 
 } 
else 
 { 
 if (c>=a) 
 c = a; 
 } 

} 
cout << c + b; 
return 0; 
}

284

#include<iostream>
using namespace std; 
int main() 
{ 
int a,b[1001],d,k,n; 
cin>>a; 
for(int i=1; i<=a; i++) 
{ 
 cin>>b[i]; 
} 
cin>>d; 
for(int i=1; i<=d; i++) 
{ 
 cin>>k>>n; 
 for(int j=k; j<=n; j++) 
 { 
 cout<<b[j]<<" "; 
 } 
 cout<<endl; 
} 
return 0;
}

293

#include <iostream> 
#include <cstdio> 
#include <vector> 
using namespace std; 

int main() 
{ 
freopen("input.txt","r",stdin); 
freopen("output.txt","w",stdout); 
int n; 
cin>>n; 
vector<int>v(n); 
vector<int>b(n); 
for (int i=0;i<n;i++){ 
cin>>v[i]; 
} 
for (int i=0;i<n;i++){ 
cin>>b[i]; 
} 
int a; 
int k=1; 
a=v[0]*b[0]; 
for(int i=1;i<n;i++){ 
if(a<v[i]*b[i]){ 
a=v[i]*b[i]; 
k=i+1; 
} 
} 
cout<<k; 
return 0; 
}

296

#include <iostream> 
using namespace std;
int main()
{
 int r, r1 = 0, r2 = 0;
 cin >> r;
 r1 = r / 5;
 r = r % 5;
 if (r % 3 == 0) 
 r2 += r / 3; 
 else 
 while (r % 3 != 0)
 {
 r += 5;
 r1--;
 }
 r2 = r / 3; 
 cout << r1 << " " << r2;
 return 0;
}

297

#include<iostream> 
#include<string> 
using namespace std; 
int main() 
{ 
string s; 
int c=0; 
cin>>s; 
for(int i=0; i<s.length(); i++) 
{ 
 if((char)s[i]=='8') 
 c+=2; 
 if((char)(s[i]=='0') || ((char)s[i]=='6') || ((char)s[i]=='9')) 
 c++; 
} 
cout<<c; 
 return 0;
}

312

#include <iostream> 
using namespace std; 
int main() 
{ 
int x1,x2,a,b,c; 
cin>>x1>>x2>>c; 
a=x2-x1; 
b=x1+a*(c-1); 
cout<<b; 
return 0; 
}

315

#include <iostream> 
#include <string.h> 
using namespace std; 
int main() 
{ 
char s[255]; 
gets(s); 
int max=1; 
for (int i=0;i<strlen(s);++i) 
{ 
if ((int)s[i]<48|| (int)s[i]>90 ||(int)s[i]>57&&(int)s[i]<65) 
{ 
cout<<-1; 
return 0; 
} 
if (s[i]>=48 &&s[i]<=57&&s[i]-48>max) 
max=s[i]-48; 
if (s[i]>=65 &&s[i]<=90&&s[i]-55>max) 
max=s[i]-55; 
} 
cout<<max+1; 
 return 0;
}

324

#include <iostream> 
using namespace std; 
int main () { 
long long a,b,c,d,e; 
cin>>a; 
b=a/10%10; 
c=a%10; 
d=a/100%10; 
e=a/1000; 
if(b==d&&e==c) 
cout<<"YES"; 
else 
cout<<"NO"; 
return 0; 
}

328

#include<iostream>
using namespace std;
int main() {
 long long a, b = 0;
 cin >> a;
 for (int i = 0;i <= a; i++)
 {
 for (int i1 = i;i1 <= a;i1++)
 b = b + i + i1;
 }
 cout << b;
 return 0;
}

331

#include <iostream> 
using namespace std; 
int main() 
{ 
int a,b,m,n; 
char c; 
cin>>a>>c>>b>>m>>n; 
b+=n; 
if(b>60)
{
 a+=b/60;
 b=b%60;
} 
a+=m; 
if(a>=24)
 a=a%24;
if(a<10)
 cout<<0<<a;
else
 cout<<a;
cout<<c; 
if(b<10)
 cout<<0<<b;
else
 cout<<b; 
return 0; 
}

336

#include <iostream> 
using namespace std; 

int main() 
{ 
char input = '\0'; 
short max = 0, min = 0, count = 0; 
while(cin >> input) 
{ 
if(input == '1') 
count++; 
else 
count--; 

if(count > max) 
max = count; 
if(count < min) 
min = count; 
} 
cout << max - min + 1; 
return 0; 
}

392

#include <iostream>
#include <cmath>
#include <string>
using namespace std;
double sqr(int x)
{
 return (x*x*1.0);
}
int main() 
{ 
 freopen("input.txt","r",stdin);
 freopen("output.txt","w",stdout);
 int n,i,x,a[100010];
 cin>>n;
 for (i=1; i<=n; i++) 
 { 
 cin>>a[i];
 if (a[i]==1) 
 x=i;
 } 
 for (i=x; i<=n; i++)
 cout<<a[i]<<" ";
 for (i=1; i<x; i++)
 cout<<a[i]<<" ";
 return 0;
} 

413

#include <stdio.h>
char ** matrix;
unsigned int a, b;
void check(unsigned int x, unsigned int y)
{ 
 if (x<a-1)
 if (matrix[x+1][y]=='#')
 { 
 matrix[x+1][y] = '.'; 
 check(x+1, y); 
 } 
 if (x>0)
 if (matrix[x-1][y]=='#')
 { 
 matrix[x-1][y] = '.';
 check(x-1, y);
 } 
 if (y<b-1)
 if (matrix[x][y+1]=='#')
 {
 matrix[x][y+1] = '.';
 check(x, y+1);
 } 
 if (y>0)
 if (matrix[x][y-1]=='#')
 { 
 matrix[x][y-1] = '.'; 
 check(x, y-1);
 }
}
int main()
{ 
 FILE * f = fopen("input.txt", "r");
 fscanf(f, "%d %d", &a, &b);
 matrix = new char* [a];
 for (int i = 0; i < a; i++) 
 { 
 matrix [i] = new char [b];
 fscanf(f,"%s", matrix[i]);
 } 
 fclose(f);
 unsigned int sum = 0;
 for (int i = 0; i < a; i++) 
 for (int j = 0; j<b; j++)
 if (matrix[i][j] == '#')
 { 
 sum++;
 check(i,j);
 } 
 f = fopen("output.txt", "wt"); 
 fprintf(f, "%d", sum);
 fclose(f);
 return 0;
}

416

#include<iostream> 
using namespace std; 
int main() 
{ 
char s[2]; 
cin>>s; 
if (int(s[0])-2>96 && int(s[1])-1>48) 
 cout<<char(s[0]-2)<<char(s[1]-1)<<endl; 
if (int(s[0])-2>96 && int(s[1])+1<57) 
 cout<<char(s[0]-2)<<char(s[1]+1)<<endl; 
if (int(s[0])-1>96 && int(s[1])+2<57) 
 cout<<char(s[0]-1)<<char(s[1]+2)<<endl; 
if (int(s[0])-1>96 && int(s[1])-2>48) 
 cout<<char(s[0]-1)<<char(s[1]-2)<<endl; 
if (int(s[0])+1<105 && int(s[1])-2>48) 
 cout<<char(s[0]+1)<<char(s[1]-2)<<endl; 
if (int(s[0])+1<105 && int(s[1])+2<57) 
 cout<<char(s[0]+1)<<char(s[1]+2)<<endl;
if (int(s[0])+2<105 && int(s[1])-1>48) 
 cout<<char(s[0]+2)<<char(s[1]-1)<<endl; 
if (int(s[0])+2<105 && int(s[1])+1<57) 
 cout<<char(s[0]+2)<<char(s[1]+1)<<endl; 
 return 0;
}

439

#include<iostream> 
using namespace std;
int main()
{
    int n, p;
    float l;
    cin >> n >> p;
    l = (float)100 * n / (100 - p + p*n);
    printf("%.7f", l);
    return 0;
}

446

#include <fstream>
#include <string>
int main()
{
 char **tablo = NULL;
 int temp = 0;
 bool superBreak = false;
 size_t rows = 0; 
 size_t columns = 0;
 std::ifstream fin("input.txt");
 std::ofstream fout("output.txt");
 fin >> rows >> columns; 
 tablo = new char*[ rows ]; 
 for ( size_t i = 0; i < rows; ++i )
 { 
 tablo[i] = new char[ columns ];
 } 
 std::string curLine; 
 std::getline(fin, curLine ); 
 for (size_t i = 0; i < rows; ++i ) 
 { 
 std::getline( fin, curLine ); 
 for (size_t j = 0; j < columns; ++j ) 
 { 
 tablo[i][j] = curLine[j]; 
 } 
 } 
 for (size_t i = 0; i < rows && !superBreak; ++i )
 { 
 for ( size_t j = 0; j < columns && !superBreak; ++j )
 { 
 fin >> temp; 
 switch( tablo[i][j] ) 
 { 
 case '.': 
 break; 
 case 'R': 
 if ( temp < 4 ) 
 { 
 superBreak = true; 
 } 
 break; 
 case 'G': 
 if ( !( temp == 2 || temp == 3 || temp == 6 || temp == 7 ) ) 
 { 
 superBreak = true; 
 } 
 break; 
 case 'B': 
 if ( temp % 2 == 0 ) 
 { 
 superBreak = true; 
 } 
 break; 
 default:// throw (-1); 
 break; 
 } 
 } 
 } 
 if ( !superBreak ) 
 fout << "YES"; 
 else 
 fout << "NO"; 
 fout.close(); 
 fin.close(); 
 return 0;
 }

475

#include <iostream>
using namespace std;
int compare (const void *a,const void *b)
{ 
 return (*(int*)a - *(int*)b);
} 
int main()
{ 
 freopen("input.txt","rt",stdin);
 freopen("output.txt","wt",stdout);
 int a;
 int l=0;
 int m[100001];
 while (cin >> a)
 { 
 m[l++]=a;
 } 
 qsort(m,l,sizeof(int),compare);
 int q=0;
 int k=m[1]-m[0];
 for (int i=1;i<l-1;i++)
 { 
 if (m[i+1]-m[i]!=k)
 { 
 q=1;
 break;
 } 
 } 
 if (q==0) 
 cout <<"Yes";
 else 
 cout <<"No"; 
 return 0;
}

493

#include<iostream> 
using namespace std;
char a[1000][1000];
int main() {
 int n, m, q = 0;
 cin >> n >> m;
 for (int i = 1; i <= n; i++) 
 for (int j = 1; j <= m; j++) 
 cin >> a[i][j]; 
 for (int i = 1; i <= n; i++) 
 for (int j = 1; j <= m; j++)
 if (a[i][j - 1] != '*' && a[i - 1][j] != '*' && a[i + 1][j] != '*' && a[i][j + 1] != '*' && a[i][j] == '.') 
 q++; 
 cout << q;
 return 0;
}

496

#include<iostream> 
using namespace std; 
int n,d[10005],sum,mex; 
int main () 
{ 
cin>>n; 
for(int i=1; i<=n; i++) 
 cin>>d[i];
for(int i=1; i<=n; i++)
{ 
 if(d[i]==d[n-1])
 sum=d[n-1]+d[n]+d[1]; 
 else
 if(d[i]==d[n])
 sum=d[n]+d[1]+d[2];
 else
 sum=d[i]+d[i+1]+d[i+2];
mex=max(sum,mex);
} 
cout<<mex; 
return 0; 
}

504

#include <iostream> 
using namespace std; 
int main() 
{int a; 
cin>>a; 
if(a%3==0) 
cout<<"GCV"<<endl; 
if(a%3==1) 
cout<<"VGC"<<endl; 
if(a%3==2) 
cout<<"CVG"<<endl; 
return 0; 
}

511

#include <iostream> 
using namespace std; 
int main(){ 
int k; 
cin>> k; 
k = k * 5 - 5; 
if(k > 720) 
 cout<<"NO"; 
else 
 cout<<k / 60 << " "<< k % 60;
return 0; 
}

513

#include <iostream> 
using namespace std;
int n;
int main() { 
 cin>>n;
 cout <<(1<<n)-n-1;
 return 0;
}

529

#include <iostream> 
#include <cmath> 
using namespace std; 
int main() 
{ 
float x1,y1,x2,y2,total1,total2; 
cin>>x1>>y1>>x2>>y2; 
total1=(x2-x1)*(x2-x1); 
total2=(y2-y1)*(y2-y1); 
cout<<fixed<<sqrt(total1+total2)<<"\n"; 
return 0; 
}

539

#include <iostream> 
using namespace std; 
int main () 
{ 
int a; 
cin >> a; 
if (a% 2==0) 
 cout << a/2; 
else 
 if (a==1) 
 cout << 0; 
else 
cout << a;
return 0; 
}

543

#include <stdio.h>
int main()
{ 
 unsigned int n = 0, w = 0, d = 0, osum = 0, sum = 0;
 FILE *f = fopen("input.txt", "r");
 fscanf(f, "%d %d %d %d", &n, &w, &d, &osum);
 fclose(f);
 sum = (n*n)/2 + n/2 - n;
 if (n%2)
 sum++;
 sum *= w;
 f = fopen("output.txt", "wt");
 if ((sum-osum)/d)
 fprintf(f, "%d", (sum-osum)/d);
 else 
 fprintf(f, "%d", n);
 fclose(f);
 return 0;
}

550

#include<iostream> 
using namespace std; 
int main() 
{ 
int a; 
cin>>a; 
if((a%100!=0&&a%4==0)||(a%400==0)) 
{ 
if(a<10) 
{ 
cout<<"12"<<"/"<<"09/000"<<a; 
} 
else if(a<100) 
{ 
cout<<"12"<<"/"<<"09/00"<<a; 
} 
else if(a<1000) 
{ 
cout<<"12"<<"/"<<"09/0"<<a; 
} 
else if(a<10000) 
{ 
cout<<"12"<<"/"<<"09/"<<a; 
} 
} 
else{ 
if(a<10) 
{ 
cout<<"13"<<"/"<<"09/000"<<a; 
} 
else if(a<100) 
{ 
cout<<"13"<<"/"<<"09/00"<<a; 
} 
else if(a<1000) 
{ 
cout<<"13"<<"/"<<"09/0"<<a; 
} 
else if(a<10000) 
{ 
cout<<"13"<<"/"<<"09/"<<a; 
} 
} 
return 0; 
}

597

#include<iostream>
using namespace std;
int main()
{
 int a,b,c;
 cin>>a>>b>>c;
 if((b+c)<=a)
 cout<<"YES";
 else
 cout<<"NO";
 return 0;
}

600

#include <stdio.h>
#include <memory.h>
int main()
{ 
 char * s = new char [30000];
 unsigned int n = 0;
 unsigned int cnt0, cnt1, cnt2;
 bool b0, b1, b2, res;
 FILE * fin = fopen("input.txt", "r");
 FILE * fout = fopen("output.txt", "wt");
 fscanf(fin, "%d", &n);
 for (int w = 0; w<n; w++)
 { 
 memset(s, 0, sizeof(char)*30000);
 cnt0 = 0;
 cnt1 = 0;
 cnt2 = 0;
 b0 = true;
 b1 = false;
 b2 = false;
 res = true;
 fscanf(fin, "%s", s);
 for (int i = 0; i<30000; i++)
 { 
 if (s[i] == '0')
 cnt0++;
 if (s[i] == '1')
 cnt1++; 
 if (s[i] == '2')
 cnt2++;
 } 
 if ((cnt0!=cnt1)||(cnt2!=cnt1))
 res = false;
 else
 { 
 for (int i = 0; i<30000; i++)
 { 
 if (s[i]=='0')
 {
 if (b1||b2)
 { 
 res = false;
 break;
 } 
 } 
 if (s[i]=='1') 
 {
 if (b2)
 {
 res = false;
 break;
 } 
 } 
 if (s[i]=='0')
 b0 = true;
 if (s[i]=='1')
 b1 = true;
 if (s[i]=='2')
 b2 = true;
 } 
 } 
 if (res)
 fprintf(fout, "YES\n");
 else
 fprintf(fout, "NO\n");
 } 
 fclose(fin);
 fclose(fout);
}

606

#include <iostream> 
using namespace std; 
int main() 
{ 
int X,Y,Z; 
cin>>X>>Y>>Z; 
if(X<=(Y+Z) && Y <= (X+Z) && Z <= (X+Y)) 
 cout<<"YES"; 
else 
 cout<<"NO"; 
return 0; 
}

633

#include <iostream> 
#include <string> 
using namespace std;
int main(){ 
string s,name1,name2,name3; 
getline(cin,s); 
getline(cin,name1); 
getline(cin,name2); 
getline(cin,name3); 
string p[3]={name1,name2,name3}; 
string min; 
for (int j=0;j<2;j++){ 
for (int i=0;i<2;i++){ 
if(p[i+1]<p[i]){ 
min=p[i+1]; 
p[i+1]=p[i]; 
p[i]=min; 
} 
} 
} 
cout<<s<<":"<<" "<<p[0]<<","<<" "<<p[1]<<","<<" "<<p[2]; 
return 0; 
} 

637

#include <iostream> 
using namespace std; 
int main () 
{ 
int c=0,n,a[10000],k; 
cin>>n; 
for(int i=0;i<n;i++) 
cin>>a[i]; 
cin>>k; 
for(int i=0;i<n;i++) 
{ 
if(a[i]>=k) 
c+=k; 
else 
c+=a[i]; 
} 
cout<<c; 
return 0; 
} 

675

#include <iostream> 
#include <string> 

using namespace std; 

int main () { 
int n, m, p[101], min = 32000; 
cin >> n >> m; 
string s[10000]; 
for (int i = 1; i <= n; ++i) { 
cin >> s[i]; 
for (int j = 1; j <= m; ++j) { 
if (s[i][j] == '.') { 
p[i]++; 
} 
} 
if (p[i] < min) { 
min = p[i]; 
} 
} 
cout << min; 
return 0; 
}

685

#include <iostream> 
using namespace std; 
int main() 
{ 
int a1, a2, a3, b1, b2, b3, p, p1, p2, p3, maxA, medA, minA, maxB, medB, minB, sA, sB, o1, o2; 
cin>> a1>> a2>> a3>> b1>> b2>> b3; 
sA = a1 + a2 + a3; 
sB = b1 + b2 + b3; 
maxA = max(max(a1, a2), a3); 
minA = min(min(a1, a2), a3); 
o1 = maxA + minA; 
medA = sA - o1; 
maxB = max(max(b1, b2), b3); 
minB = min(min(b1, b2), b3); 
o2 = maxB + minB; 
medB = sB - o2; 
p1 = maxA * maxB; 
p2 = medA * medB; 
p3 = minA * minB; 
p = p1 + p2 + p3; 
cout<< p<< endl; 
return 0; 
}

691

#include<iostream> 
#include<fstream> 
using namespace std;
int lol(string s)
{
 int sch = 0;
 string s1, s2, s3;

 s1 = "ABCEHKMOPTXY";
 s2 = "0123456789";

 for (int j = 0;j<s2.length();j++) 
 if (s[1] == s2[j]) 
 sch++; 
 for (int j = 0;j<s2.length();j++) 
 if (s[2] == s2[j]) 
 sch++; 
 for (int j = 0;j<s2.length();j++) 
 if (s[3] == s2[j]) 
 sch++; 
 for (int i = 0;i<s1.length();i++)
 {

 if (s[0] == s1[i]) 
 sch++; 
 if (s[4] == s1[i]) 
 sch++; 
 if (s[5] == s1[i]) 
 sch++;
 
 }
 if (sch == 6) 
 return true; 
 else 
 return false; 
}
int main()
{
 int n;
 string s;
 cin >> n;
 for (int i = 1;i <= n;i++)
 {
 cin >> s;
 if (lol(s) && s.length() == 6) 
 cout << "Yes" << endl; 
 else 
 cout << "No" << endl; 
 }
 return 0;
}

692

#include <iostream> 
using namespace std; 
int main() 
{ 
int a,c; 
double b; 
cin>>a; 
b=log2(a); 
c=log2(a); 
if(b==c)
 cout<<"YES"; 
else 
 cout<<"NO"; 
return 0; 
}

697

#include<iostream> 
using namespace std; 
int main() 
{ 
int l,w,h,s=0; 
cin>>l>>w>>h; 
s=s+(l*h)*2+(w*h)*2; 
if(s%16==0) 
 cout<<s/16; 
else 
 cout<<s/16+1; 
return 0; 
}