rezolvate

[gigantfarmier]

DE pe campion:
1)Case 1:
#include<fstream.h>
int main() {
int n,nr,r,b=0,fe=0,c=0,g1=0,g2=0,g3=0,i;
ifstream f("case1.in");
ofstream g("case1.out");

f>>n;

for(i=1;i<=n;i=i+1)
{
f>>nr;
r=nr/1000;
if(r==1)
g1++;
if(r==2)
g2++;
if(r==3)
g3++;
b=b+nr/100%10;
fe=fe+nr/10%10;
c=c+nr%10;}
g<<g1<<'\n'<<g2<<'\n'<<g3<<'\n'<<b<<'\n'<<fe<<'\n'<<c;
f.close();g.close();
return 0;
}


2)Capete
#include<fstream.h>
int main() {
int cap,nrz;
ifstream f("capete.in");
ofstream g("capete.out");
f>>nrz;
cap=nrz*5;

g<<cap<<'\n';
f.close(); g.close( );
return 0;
}

3)Rachete
#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
int n,v[60002],i;
freopen("rachete.in","r",stdin);
freopen("rachete.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d",&v);
}
sort(v+1,v+n+1);
for(i=1;i<=n;++i) { printf("%d ",v); }
return 0;
}













vreti si in pascal?