Vous êtes sur la page 1sur 6

1)

#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("text.in");
int s=0,vo=0,c=0;
char v[1001];
fin.getline(v,1001);
for(int i=0;i<=strlen(v);i++)
{
if(isalpha(v[i]))
{
if(strchr("aeiouAEIOU",v[i])) vo++;
else c++;
}
if(v[i]==32) s++;
}
cout<<s<<" "<<vo<<" "<<c;
return 0;
}
2)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
int main()
{
ofstream fout("text.out");
int c=1;
char v[1001];
cin.getline(v,1001);
for(int i=0;i<=strlen(v);i++)
{
if(v[i]==32) c++;
}
fout<<v<<"\n"<<c;
return 0;
}
3)
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
ifstream fin("text.in");
ofstream fout("text.out");
int main()
{
char s1[101];
char s2[101];
fin.getline(s1,101);
fin.getline(s2,101);

char *p=strstr(s1,s2);
int k=p-s1;
int u=strlen(s2);
int n=strlen(s1);
for(int i=0;i<n;i++)
{
if(i!=k) fout<<s1[i];
else
{
i=i+u-1;
p=strstr(s1+i,s2);
k=p-s1;
}
}
return 0;
}
4)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("date.in");
struct data
{
int an;
int luna;
int zi;
};
int main()
{
data a,b;
int k=0;
fin>>a.an>>a.luna>>a.zi;
fin>>b.an>>b.luna>>b.zi;
if(b.an>a.an) {int c=a.an;a.an=b.an;b.an=c;}
else if(b.an==a.an&&b.luna>a.luna) {int c=a.luna;a.luna=b.luna;b.luna=c;}
else if(b.an==a.an&&b.luna==a.luna&&a.zi<b.zi) {int c=a.zi;a.zi=b.zi;b.zi=c;
}
k=k+(a.an-b.an)*365;
k=k+(a.luna-b.luna)*30;
k=k+a.zi-b.zi;
cout<<k;
return 0;
}
5)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("puncte.in");
float calc(float a,float b,float c,float d)
{
float k=sqrt((a-b)*(a-b)+(c-d)*(c-d));
return k;
}
struct pu
{

float x,y;
}A,B,C,D;
int main()
{
float h=0;
fin>>A.x>>A.y>>B.x>>B.y;
fin>>C.x>>C.y>>D.x>>D.y;
float a=calc(D.x,C.x,D.y,C.y);
float d=calc(C.x,A.x,C.y,A.y);
float c=calc(A.x,D.x,A.y,D.y);
float p=(a+d+c)/2;
h=h+sqrt(p*(p-a)*(p-d)*(p-c));
a=calc(C.x,B.x,C.y,B.y);
float b=calc(A.x,C.x,A.y,C.y);
c=calc(B.x,A.x,B.y,A.y);
p=(a+b+c)/2;
h=h+sqrt(p*(p-a)*(p-b)*(p-c));
cout<<h;
return 0;
}
7)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elevi.in");
struct el
{
char nu[101];
char pr[101];
int mg;
int h;
};
int main()
{
el r[50];
int n;
fin>>n;
for(int i=1;i<=n;i++)
fin>>r[i].nu>>r[i].pr>>r[i].mg>>r[i].h;
int v[50];
for(int i=1;i<=n;i++)
v[i]=r[i].mg;
for(int i=1;i<=n-1;i++)
for(int j=i+1;j<=n;j++)
{
if(v[i]<v[j]) {int c=v[i];v[i]=v[j];v[j]=c; }
}
int g=1;
int i=1;
while(g!=n+1)
{
if(v[g]==r[i].mg) {cout<<r[i].nu<<" "<<r[i].pr<<"\n";g++;i=0;}
i++;
}
float s=0;
for(int i=1;i<=n;i++)
s+=r[i].h;

cout<<s/n;
return 0;
}
8)
#include <iostream>
using namespace std;
struct nod
{
int val;
nod *urm;
};
int main()
{
int n;
int v[50];
cin>>n;
nod *p=NULL;
for(int i=1;i<=n;i++)
{
cin>>v[i];
nod *nou=new nod;
nou->val=v[i];
nou->urm=NULL;
if(p==NULL) p=nou;
else
{
nou->urm=p;
p=nou;
}
}
nod *a=p;
while(a!=NULL)
{
cout<<a->val<<" ";
a=a->urm;
}
return 0;
}
10)
#include <iostream>
using namespace std;
void h(int n,int a,int b,int c)
{
if(n==1) cout<<a<<"->"<<b<<"\n";
else
{
h(n-1,a,c,b);
cout<<a<<"->"<<b<<"\n";
h(n-1,c,b,a);
}
}
int main()
{
int n;

int a=1,b=2,c=3;
cin>>n;
h(n,a,b,c);
}
11)
#include <iostream>
using namespace std;
int v[50];
int bam(int st,int dr)
{
if(st==dr) return v[st];
int m=(st+dr)/2;
int r1=bam(st,m);
int r2=bam(m+1,dr);
return r1+r2;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
cout<<bam(1,n);
return 0;
}
12)
#include <iostream>
using namespace std;
float v[101];
int pivotare(int st,int dr)
{
float x=v[st];
while(st<dr)
{
while(v[dr]>=x&&st<dr) dr--;
v[st]=v[dr];
while(v[st]<=x&&st<dr) st++;
v[dr]=v[st];
}
v[st]=x;
return st;
}
int quicksort(int st,int dr)
{
int m=pivotare(st,dr);
if(st<m-1)
quicksort(st,m-1);
if(m+1<dr)
quicksort(m+1,dr);
}
int main()
{
int n;

cin>>n;
for(int i=1;i<=n;i++) cin>>v[i];
quicksort(1,n);
for(int i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}
13)
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int v[101];
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}

Vous aimerez peut-être aussi