Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //algoritmi_2014 1
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main()
- {
- float a[100];
- unsigned int n, i;
- do {
- cin >> n;
- }while(n >= 100);
- cout << "Introduceti elementele vectorului: ";
- for(i = 0; i < n; i++)
- {
- cout << "a[" << i << "] = ";
- cin >> a[i];
- }
- cout << endl;
- for(i = 0; i < n; i++)
- cout << ceil(a[i]) << ' ' << floor(a[i]) << '\n';
- return 0;
- }
- //algoritmi_2014 2
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[100], m, n;
- do {
- cin >> m;
- }while(m >= 100 || m < 0);
- do {
- cin >> n;
- }while(n >= 100 || n < 0);
- cin >> v[1];
- for(int i = 2; i <= m; i++)
- {
- do {
- cout << "v[" << i << "]=";
- cin >> v[i];
- }while(v[i] <= v[i - 1]);
- }
- cin >> v[n + 1];
- for(int i = m + 2; i <= m +n; i++)
- {
- do {
- cout << "v[" << i << "]=";
- cin >> v[i];
- }while(v[i] <= v[i - 1]);
- }
- return 0;
- }
- int caut_bin(int v[100], int st, int dr, int x) // recursiv
- {
- if(st <= dr)
- {
- int mij;
- mij = (st + dr) / 2;
- if(x == v[mij])
- return 1;
- else if(x < v[mij])
- caut_bin(v, st, mij - 1, x);
- else caut_bin(v, mij + 1, dr, x);
- }
- else return 0;
- }
- // algoritmi_2014 10
- #include <iostream>
- #include <cstring>
- using namespace std;
- int main()
- {
- char c[16], voc[] = {"aeiou"};
- int i;
- cin >> c;
- for(i = 0; i < strlen(c); i++)
- {
- if(strchr(voc, c[i]))
- strcpy(c+i, c+i+1);
- cout << c << endl;
- }
- return 0;
- }
- // algoritmi_2014 11
- #include <iostream>
- #include <cstring>
- using namespace std;
- int main()
- {
- char c[21];
- cin >> c;
- if(strlen(c) <= 2)
- {
- cout << "CUVANT VID";
- return 0;
- }
- else if(strlen(c) % 2)
- {
- strcpy(c + (strlen(c) / 2), (c + strlen(c) / 2) + 1);
- cout << c;
- }
- else if(strlen(c) % 2 == 0)
- {
- strcpy(c + (strlen(c) / 2), (c + strlen(c) / 2) + 2);
- cout << c;
- }
- return 0;
- }
- // algoritmi_2014 14
- #include <iostream>
- #include <algorithm>
- #include <cstring>
- using namespace std;
- int main()
- {
- char s1[31], s2[31];
- cin >> s1 >> s2;
- int l1 = strlen(s1);
- int l2 = strlen(s2);
- sort(s1, s1 + l1);
- sort(s2, s2 + l2);
- if(!strcmp(s1, s2))
- cout << "este anagrame";
- else cout << "nu este anagrame";
- return 0;
- }
- // algoritmi_2014 19
- #include <iostream>
- using namespace std;
- int main()
- {
- int c[26] = {0}, i, nrl(0);
- char s1[101], s2[101];
- cin >> s1 >> s2;
- for(i = 0; s1[i] != '\0'; i++)
- c[s1[i] - 'a']++;
- for(i = 0; s2[i] != '\0'; i++)
- c[s2[i] - 'a']++;
- for(i = 0; i < 26; i++) {
- if(!c[i])
- {
- nrl++;
- cout << (char)('a' + i);
- }
- }
- if(!nrl)
- cout << "Au fost folosite toate literele.";
- return 0;
- }
- //algoritmi_2014 20
- #include <iostream>
- using namespace std;
- int main()
- {
- int n, nr, i, max = -30000, nrap = 0;
- cin >> n;
- for(i = 1; i <= n; i++)
- {
- do {
- cin >> nr;
- }while(nr < -30000 || nr > 30000);
- if(max == nr)
- ++nrap;
- else if(nr > max) {
- nrap = 1;
- max = nr;
- }
- }
- cout << "Cel mai mare numar este: " << max << " si a aparut de " << nrap << " ori.";
- return 0;
- }
- //algoritmi_2014 23
- #include <iostream>
- using namespace std;
- int a[100][100];
- int main()
- {
- int n, i, j, k(1);
- cin >> n;
- for(i = 1; i <= n; i++)
- {
- for(j = i; j <= n; j++)
- {
- if(i == j) a[i][j] = 0;
- else {
- a[i][j] = k;
- k++;
- }
- }
- }
- k = 1;
- for(i = 1; i <= n; i++)
- {
- for(j = 1; j <= i; j++)
- {
- if(i == j) a[i][j] = 0;
- else {
- a[i][j] = k;
- k++;
- }
- }
- }
- for(i = 1; i<= n; i++)
- {
- for(j = 1; j <= n; j++) cout << a[i][j] << ' ';
- cout << endl;
- }
- return 0;
- }
- //algoritmi_2014 25
- #include <iostream>
- using namespace std;
- int a[21][21];
- int main()
- {
- int n, i, j, k;
- do {
- cout << "n=";
- cin >> n;
- }while(n <= 0 || n >= 21);
- for(k = 1; k <= n/2+1; k += 2)
- {
- for(j = k; j <= n-k+1; j++)
- a[k][j] = a[n-k+1][j] = 1;
- for(i = k+1; i <= n-k; i++)
- a[i][k] = a[i][n-k+1] = 1;
- }
- afisare();
- }
Advertisement
Add Comment
Please, Sign In to add comment