.


:




:

































 

 

 

 





A+B

.

INPUT.TXT , 109.

OUTPUT.TXT .

 

#include <iostream>

main()

{

int a,b;

std::cin>>a>>b;

std::cout<<a+b;

}

 

:

, .

 


: , -, , . , . - , . : . , . , , . . . , 487, 784. 784 487, 297, 2, . , . , . , , : , , .. 9-2=7. , .

.
INPUT.TXT , .

.
OUTPUT.TXT .

 

#include <iostream>

using namespace std;

main()

{

int a;

cin>>a;

cout<<a*99+99;

}

:

- , , , .

INPUT.TXT A, B C . A B <= 102, C <= 106.

YES , A*B=C NO .

 

#include <iostream>

using namespace std;

int main()

{

int a,b,c,d;

cin>>a>>b>>c;

d=a*b;

if (d==c) cout<<"YES";

else cout<<"NO";

return 0;

}

:

3 , , YES, NO


 

3 , . : .

 

INPUT.TXT . , 105.

OUTPUT.TXT .

 

 

:

 

. max1 , min1 . max1 min1, .

-

. , , .

INPUT.TXT A B, 2*109.

OUTPUT.TXT <, A < B, >, A > B =, A=B.

 

 

#include <iostream>

using namespace std;

main ()

{

long long a,b;

cin>>a>>b;

if (a>b) cout<<'>'; else

if (a==b) cout<<'=';else

cout<<'<';

}

:

, , >, <. =.

. , - - ( 10). , , . - , .

, , . , . , , . , .

, .

 

#include <iostream>

using namespace std;

int main()

{ int a,b;

cin>>a>>b;

cout<<b-1<<' '<<a-1;

return 0;

}

:

: , . , , , . .

 

 

k . , , n m , d = 19m + (n + 239)*(n + 366) / 2. d, .

 

.

 

 

#include <iostream>

using namespace std;

main()

{

int a,b,k,i;

cin>>k;

for(i=1;i<=k;i++)

{

cin>>a>>b;

cout<<(19*b+(a+239)*(a+366)/2)<<endl;

}

}

 

:

- K. 1 k , .


.

#include<iostream>

#include<string>

using namespace std;

int main()

{

int b=0,max=0;

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;

}

:

, . , , b, max b. b max, max = b. b , . max.


n E. , 2.7182818284590452353602875.

#include <iostream>

using namespace std;

main()

{

int n,i;

cin>>n;

string s;

s="7182818284590452353602875";

if(n==0) cout<<3;

else

{

cout<<"2.";

for(i=0;i<n-1;i++) cout<<s[i];

if(s[n]>=5') cout<<s[n-1]+1-'0';

else cout<<s[n-1];

}

}

:

n . S . n=0, 3. 2., n-1, n- , n>=5, s[n-1]+1-0 ( int), s[n-1].

 

4 . .

 

#include <iostream>

using namespace std;

int main()

{

int a, b, c, d, e, f, g, h,j,l;

cin >> a >> b >> c >> d >> e >> f >> g >> h;

j = a + c + e + g;

l = b + d + f + h;

if(j ==l)

cout <<"DRAW" << endl;

if(j > l)

cout << 1 << endl;

if(j<l)

cout << 2 << endl;

return 0;

}

:

. j l . DRAW, j>l 1, 2.

 


. , .. p a, l z, m q.

 

#include <iostream>

#include <string>

using namespace std;

int main()

{ int i; char c,x;

string a={'q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m','q'};

cin>>c;

for(i=0;i<=26;i++)

if(a[i]==c) {x=a[i+1];

break;}

cout<<x;

}

:

c. , , . , a[i+1] .


- -

. , , , . , , - X . , . , . , , () X .

, , , , . : , , , .

.

#include <iostream>

#include <string>

using namespace std;

main()

{

string a;

int n;

cin>>a;

cin>>n;

if(a=="Home") { if(n%2==0) cout<<"Yes";

else cout<<"Yes";}

if(a=="School") { if(n%2==0) cout<<"No";

else cout<<"Yes";}

}

:

. Home, , 0 , Yes. School, 2, No,

Yes.


: , . , , . : ? !

 

#include <iostream>

using namespace std;

main()

{

int i,n,max=0,min=30000,a;

cin>>n;

for(i=0;i<n;i++)

{ cin>>a;

if(a>=max) max=a;

 

if(a<=min) min=a;

}

cout<<min<<' '<<max;

}

 

:

, 0. n , 0 n . max min . max min.


, . S . , , , , ?

#include <iostream>

using namespace std;

main()

{

float s,a,b;

cin>>s;

a=s/6;

b=4*a;

cout<<a<<' '<<b<<' '<<a;

}

 

:

s - . - (), 4 - . 6 , = S/6; b=4*a; , , .


n . , . , , .

 

#include <iostream>

using namespace std;

int main()

{

int n, i, c0=0;

cin>>n;

int mass [n];

for (i=0; i<n; i++)

{

cin>>mass[i];

if (mass[i]==0)

c0++;

}

if (c0<(n-c0))

cout<<c0;

else

cout<<n-c0;

return 0;

}

:

- n. 0 n , 0, 0, 0 1. .

, , . : , , , . , . Fi(x) , x , i+1 i. n- y, :

y = Fn-1(Fn-2(F2(F1(x))))

- , , , .. Fi(x) = x i 1 n-1.

#include <iostream>

using namespace std;

main()

{int a;

cin>>a;

cout<<a;

}

:

, .


N . , . .

 

#include <iostream>

using namespace std;

int main()

{

int max=0,n,v,i,s,k=0;

cin>>n;

for(i=1;i<=n;i++)

{

cin>>v>>s;

if(s==1) { if(v>max) {max=v; k=i;}}

}

if(max!=0) cout<<k;

else cout<<-1;

}

 

- n. 1 n , , , -1. , .

N N . .

#include <iostream>

using namespace std;

main()

{

int n,i;

cin>>n;

int a[n];

if (n<=1000) {

for(i=1;i<=n;i++)

cin>>a[i];

for(i=n;i>0;i--)

cout<<a[i]<<" "; }

}

:

n. 1 n , n 0.


. . . , . -. .

, . , 1 . N A B . , . , .

 

#include <iostream>

using namespace std;

int main()

{

int n,a,b,s;

s=0;

n<=100;

a<=100;

b<=100;

cin>>n>>a>>b;

s=a*b*n*2;

cout<<s;

return 0;

}

:

, 2( ).

. ( ) 437 . N . , . . , .

, , , , .

#include <iostream>

using namespace std;

int main()

{

int n,i,a,x=437,k=0;

cin>>n;

for(i=0;i<n;i++)

{

cin>>a;

if(a<=x) {cout<<"Crash "<<i+1;

break;}

else k++;

}

if(n==k) cout<<"No crash";

}


:

n. , . 437, Crash . No crash.

, . , , .

 

#include <iostream>

#include <cmath>

using namespace std;

int main()

{

int n,a,k,b,c;

cin>>a>>k>>n;

b=abs(n-k)-1;

c=a-b-2;

if(b<c) cout<<b;

else cout<<c;

}

:

: , , . b - ( ), - . b c.

, , . , , , . , .

, 0 . , .

#include <iostream>

using namespace std;

int main()

{

int n,i,a,k=0,max,x=0;

cin>>n;

max=0;

for(i=1;i<=n;i++)

{cin>>a;

if(a>0) k++;

else k=0;

 

if(k>max) max=k;

 

}

cout<<max;

return 0;

}

:

. 1 n . : , k, max. max.

. , .

, max{a2, a4, }+min{a1, a3, }.

 

#include <iostream>

using namespace std;

int main() {

int mx = -10000, mn = 10000, a, k = 0;

while (cin >> a) {

k += 1;

if (k % 2 == 0) {

if (mx < a) mx = a;

} else { if (mn >a) mn = a; }}

cout << mn + mx;

return 0;

}

 

:

, , , , mx, mn. mn mx.

 

a + bx + y x y a, b c. , a, b c , :

, , , ;

, , ( , , 0);

"+" , ;

"+" , ( );

.

 

:

. 0, 0. != 0 . b!= 0, , b, c.

1, 2,..., n. f(i,j) , i, ai+1,..., aj-1, aj. , a.

 

#include <iostream>

using namespace std;

int main()

{

long long n,m,i,x,y,j;

int a[n+1];

cin>>n;

for(i=1;i<=n;i++)

cin>>a[i];

cin>>m;

for(i=1;i<=m;i++)

{ cin>>x>>y;

for(j=x;j<=y;j++)

cout<<a[j]<<" ";

cout<<endl;

}

}

:

. 1 n , . , 1 m, x y. x y .

 

N , . , V[i] . , . , . i- p[i] .

, ( ). , , ( , !), .

.

 

#include <iostream>

using namespace std;

int main()

{

int n,i,max=-1,k=0;

cin>>n;

int a[n],p[n],o[n];

for(i=1;i<=n;i++)

cin>>a[i];

for(i=1;i<=n;i++)

cin>>p[i];

for(i=1;i<=n;i++)

o[i]=a[i]*p[i];

for(i=1;i<=n;i++)

if(o[i]>max) {max=o[i]; k=i;}

cout<<k;

return 0;

}

 

1 n [i] - i- , p[i] - i- . o[i] i- . 1 n , . .

 

. . , , ( ) , .

, , , , ( ) , ( ).

 

#include <iostream>

using namespace std;

int main()

{

int g,sg,b,sb,a,c;

double pb,pg;

cin>>b>>pb>>sb;

cin>>g>>pg>>sg;

pb=b*(pb/100);

pg=g*(pg/100);

g=g-pg;

b=b-pb;

if(g>b) {a=g-b;pg+=a;}

else {a=b-g; pb+=a;}

c=pg*sg+pb*sb;

cout<<c;

}

 

:

, , .

, , .

(pg pb).

, , , . .

:

 

157892 = 3

203516 = 2

409578 = 4

236271 =?

. , "", , . , , .

 

#include <iostream>

#include <string>

using namespace std;

 

int main()

{

string a;

cin>>a;

int b=a.size();

int sum=0;

for (int i=0;i<b;i++)

{

if(a[i]=='6' || a[i]=='9' || a[i]=='0') sum=sum+1;

else if (a[i]=='8')sum=sum+2;

}

cout<<sum;

}

:

, = b. 0 b, 6,9,0 sum 1, 8, sum 2. sum.

 





:


: 2017-02-25; !; : 5097 |


:

:

, .
==> ...

1356 - | 1180 -


© 2015-2024 lektsii.org - -

: 0.288 .