Cod sursa(job #585693)
Utilizator | Data | 30 aprilie 2011 11:08:15 | |
---|---|---|---|
Problema | NumMst | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <vector>
#define x first
#define y second
using namespace std;
typedef pair<int,int> per;
per sol;
int cmmdc(int a, int b) {
int c;
for(;b;c=a%b,a=b,b=c);
return a;
}
int n,gcm,cmm;
int main()
{
ifstream f("nummst.in");
ofstream g("nummst.out");
f>>n;
if(n&1) g<<n/2<<' '<<n/2+1;
else g<<n/2<<' '<<n/2;
return 0;
}