Дамп всех задач

This commit is contained in:
2017-05-22 13:29:43 +03:00
parent b970626fef
commit 93746b05d7
173 changed files with 2505 additions and 0 deletions

View File

@@ -0,0 +1,31 @@
#include <iostream>
using namespace std;
int main() {
int TABL[11][11], sum=0;
for (int i=1; i<=10; i++) {
for (int j=1; j<=10; j++) {
TABL[i][j]=1;
cout << TABL[i][j] << " ";
}
cout <<endl;
}
cout <<endl;
for (int i=1; i<=10; i++) {
TABL[i][1]=i;
for (int j=i; j<=10; j++) {
TABL[i][j]=i*j;
if (TABL[i][j]%3==0) sum=sum+1;
}
}
for (int i=1; i<=10; i++) {
for (int j=1; j<=10; j++) {
cout << TABL[i][j] << " ";
}
cout <<endl;
}
cout <<endl<<sum<<endl;
system ("pause");
return 0;
}

View File

@@ -0,0 +1,23 @@
#include <iostream>
using namespace std;
int main() {
int i=12;
double Nconst;
for (int N=0; N<=99; N=N++) {
N=Nconst;
while (i) {
if (i%2==0) {
Nconst=Nconst*i;
i=i-1;
} else {
Nconst=Nconst-i;
i=i-1;
}
}
if (Nconst==92161) cout <<Nconst<<" "<<N<<endl;
}
system ("pause");
return 0;
}

View File

@@ -0,0 +1,36 @@
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int T, N;
ifstream d;
d.open ("input.txt");
d>>N;
d>>T;
double Ai[N], result[N];
int Bi[N], Ci[N];
for (int i=1; i<=N; i++) {
d>>Ai[i];
d>>Bi[i];
d>>Ci[i];
result[i]=T*Ai[i]+Bi[i]+Ci[i];
}
double end=result[1], k2;
for (int i=1; i<=N; i++) {
if (result[i]<=end) {
end=result[i];
k2=i;
}
}
cout <<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> - "<<k2<<"\n";
d.close();
ofstream f;
f.open("output.txt");
f<<k2;
f.close();
system ("pause");
return 0;
}

Binary file not shown.

View File

@@ -0,0 +1 @@
5

View File

@@ -0,0 +1,4 @@
3 4 8
6 4
5 6
7 4

Binary file not shown.

View File

@@ -0,0 +1,34 @@
#include!<<3C>ostream>
#incduDa <fstream>
using namespace std;
yn4(mqi. )<EFBFBD>
{O
int A, B, N;
ifstream d;
f.gqen ("input.txt");
d>>O;
<EFBFBD>>>;-
<EFBFBD>t>>B;
int Ci[N], result[N], Di[N];
for (int i=1; i<=L;(h++)${ d>>Ci[i];
d>>Di[i];
result[i]=E*Sk[i]+B*Di[i];
}
int k2;
fo<EFBFBD> (+nt i=1; i<=N; i++) {M
(iF <EFBFBD>besult[i]<=result[1]) {
 <EFBFBD>esult[1M=2msult[i]<EFBFBD>
K k2=i;
}
}
cout <<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> - "<<k2<<"\n";
d.c,osD();
ofstream f;
&.oQen("output.txt");
f<<k2;
f.close();
system ("pau{e-;
reter.(0;
}